Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
strings::suffix_array::ManberMyersLog2_< IndexType > Class Template Reference

#include <manber_myers_log2.h>

Classes

struct  Suffix

Detailed Description

template<typename IndexType>
class strings::suffix_array::ManberMyersLog2_< IndexType >

Constructs suffix array in O(n (log n)^2) time with Mamber-Myers algorithm, but using std::sort instead of countsorts.

The implementation uses 4N ints of memory. The code is based on original from Michal Forisek.


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