Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
strings::suffix_array::NaiveSuffixArray Class Reference

#include <naive.h>

List of all members.

Static Public Member Functions

template<typename _Iterator >
static void buildSuffixArray (_Iterator first, _Iterator last, std::vector< int > *out)

Member Function Documentation

template<typename _Iterator >
static void strings::suffix_array::NaiveSuffixArray::buildSuffixArray ( _Iterator  first,
_Iterator  last,
std::vector< int > *  out 
) [inline, static]

Build suffix array with naive sorting.

_Iterator random access iterator

Parameters:
inputsequence
lengthlength of the sequence
outconstructed suffix array, will be owerwrittent

The documentation for this class was generated from the following file:
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Defines