Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
|
checkCondition1Holds(const int SA[], int length) | strings::suffix_array::SuffixArrayChecker< T > | [inline, protected, static] |
checkCondition2Holds(const T s[], const int SA[], int length) | strings::suffix_array::SuffixArrayChecker< T > | [inline, protected, static] |
checkCondition3HoldsInverses(const T s[], const int SA[], int length) | strings::suffix_array::SuffixArrayChecker< T > | [inline, protected, static] |
checkCondition3HoldsKarkkainen(const T s[], const int SA[], int length) | strings::suffix_array::SuffixArrayChecker< T > | [inline, protected, static] |
FRIEND_TEST(SuffixArrayCheck, condition1) | strings::suffix_array::SuffixArrayChecker< T > | [private] |
isValidSuffixArray(const T s[], const int SA[], int length) | strings::suffix_array::SuffixArrayChecker< T > | [inline, static] |
isValidSuffixArrayInverses(const T s[], const int SA[], int length) | strings::suffix_array::SuffixArrayChecker< T > | [inline, static] |