Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
|
#include <naive.h>
Static Public Member Functions | |
template<typename _Iterator > | |
static void | buildSuffixArray (_Iterator first, _Iterator last, std::vector< int > *out) |
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
input | sequence |
length | length of the sequence |
out | constructed suffix array, will be owerwrittent |