Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
|
#include <sort_helper.h>
Public Member Functions | |
SortHelper (const _Iterator first, const _Iterator last_) | |
bool | operator() (const int &a, const int &b) |
Private Attributes | |
_Iterator | base |
_Iterator | last |
Helper for sorting Can compare two suffixes
strings::suffix_array::SortHelper< _Iterator >::SortHelper | ( | const _Iterator | first, |
const _Iterator | last_ | ||
) | [inline] |
input | whole sequence |
length | length of the sequence |
bool strings::suffix_array::SortHelper< _Iterator >::operator() | ( | const int & | a, |
const int & | b | ||
) | [inline] |
Returns which of the suffixes is lexicographically smaller. Note that end of sequence is less than any of the characters, i.e. "x" < "xa"
_Iterator strings::suffix_array::SortHelper< _Iterator >::base [private] |
_Iterator strings::suffix_array::SortHelper< _Iterator >::last [private] |