Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
|
#include <binsearch.h>
Public Member Functions | |
SearchHelper (const _Iterator &first, const _Iterator &last_) | |
template<typename _PatternIterator > | |
int | compare (const std::pair< _PatternIterator, _PatternIterator > &pattern, const int &a) |
template<typename _PatternIterator > | |
bool | operator() (const std::pair< _PatternIterator, _PatternIterator > &pattern, const int &a) |
template<typename _PatternIterator > | |
bool | operator() (const int &a, const std::pair< _PatternIterator, _PatternIterator > &pattern) |
Private Attributes | |
_Iterator | base |
_Iterator | last |
Helper for searching Can compare two suffixes
strings::suffix_array::SearchHelper< _Iterator >::SearchHelper | ( | const _Iterator & | first, |
const _Iterator & | last_ | ||
) | [inline] |
input | whole sequence |
length | length of the sequence |
int strings::suffix_array::SearchHelper< _Iterator >::compare | ( | const std::pair< _PatternIterator, _PatternIterator > & | pattern, |
const int & | a | ||
) | [inline] |
bool strings::suffix_array::SearchHelper< _Iterator >::operator() | ( | const int & | a, |
const std::pair< _PatternIterator, _PatternIterator > & | pattern | ||
) | [inline] |
bool strings::suffix_array::SearchHelper< _Iterator >::operator() | ( | const std::pair< _PatternIterator, _PatternIterator > & | pattern, |
const int & | a | ||
) | [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::SearchHelper< _Iterator >::base [private] |
_Iterator strings::suffix_array::SearchHelper< _Iterator >::last [private] |