Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
Data Structures | |
class | BoyerMooreHorspool |
class | DeadZoneUsingBadCharacterShiftAndBorderArray |
class | ExactNonlinearTreePatternAutomaton |
class | ExactPatternMatch |
class | ExactPatternMatchingAutomaton |
class | ExactSubtreeAutomaton |
class | ExactSubtreeMatch |
class | ExactSubtreeMatchingAutomaton |
class | ExactTreePatternAutomaton |
class | KnuthMorrisPratt |
class | QuickSearch |
class | ReversedBoyerMooreHorspool |
class | ReversedQuickSearch |
Functions | |
template<class SymbolType > | |
ext::vector< char > | computeRHS (const tree::PrefixRankedPattern< SymbolType > &pattern, const ext::vector< int > &patternSubtreeJumpTable, int i) |
template<class SymbolType > | |
unsigned | constructRecursivePattern (const ext::tree< common::ranked_symbol< SymbolType > > &node, automaton::NFTA< SymbolType, unsigned > &res, const common::ranked_symbol< SymbolType > &subtreeWildcard, unsigned &nextState) |
template<class SymbolType > | |
unsigned | constructRecursivePattern (const ext::tree< common::ranked_symbol< SymbolType > > &node, automaton::UnorderedNFTA< SymbolType, unsigned > &res, const common::ranked_symbol< SymbolType > &subtreeWildcard, unsigned &nextState) |
template<class SymbolType > | |
unsigned | constructRecursivePattern (const ext::tree< SymbolType > &node, automaton::NondeterministicZAutomaton< SymbolType, unsigned > &res, const SymbolType &subtreeWildcard, const SymbolType &subtreeGap, const SymbolType &nodeWildcard, unsigned &nextState) |
template<class SymbolType > | |
unsigned | constructRecursive (const ext::tree< common::ranked_symbol< SymbolType > > &node, automaton::NFTA< SymbolType, unsigned > &res, unsigned &nextState) |
template<class SymbolType > | |
unsigned | constructRecursive (const ext::tree< common::ranked_symbol< SymbolType > > &node, automaton::UnorderedNFTA< SymbolType, unsigned > &res, unsigned &nextState) |
template<class SymbolType > | |
unsigned | constructRecursive (const ext::tree< SymbolType > &node, automaton::NondeterministicZAutomaton< SymbolType, unsigned > &res, unsigned &nextState) |
ext::vector< char > arbology::exact::computeRHS | ( | const tree::PrefixRankedPattern< SymbolType > & | pattern, |
const ext::vector< int > & | patternSubtreeJumpTable, | ||
int | i | ||
) |
unsigned arbology::exact::constructRecursive | ( | const ext::tree< common::ranked_symbol< SymbolType > > & | node, |
automaton::NFTA< SymbolType, unsigned > & | res, | ||
unsigned & | nextState | ||
) |
unsigned arbology::exact::constructRecursive | ( | const ext::tree< common::ranked_symbol< SymbolType > > & | node, |
automaton::UnorderedNFTA< SymbolType, unsigned > & | res, | ||
unsigned & | nextState | ||
) |
unsigned arbology::exact::constructRecursive | ( | const ext::tree< SymbolType > & | node, |
automaton::NondeterministicZAutomaton< SymbolType, unsigned > & | res, | ||
unsigned & | nextState | ||
) |
unsigned arbology::exact::constructRecursivePattern | ( | const ext::tree< common::ranked_symbol< SymbolType > > & | node, |
automaton::NFTA< SymbolType, unsigned > & | res, | ||
const common::ranked_symbol< SymbolType > & | subtreeWildcard, | ||
unsigned & | nextState | ||
) |
unsigned arbology::exact::constructRecursivePattern | ( | const ext::tree< common::ranked_symbol< SymbolType > > & | node, |
automaton::UnorderedNFTA< SymbolType, unsigned > & | res, | ||
const common::ranked_symbol< SymbolType > & | subtreeWildcard, | ||
unsigned & | nextState | ||
) |
unsigned arbology::exact::constructRecursivePattern | ( | const ext::tree< SymbolType > & | node, |
automaton::NondeterministicZAutomaton< SymbolType, unsigned > & | res, | ||
const SymbolType & | subtreeWildcard, | ||
const SymbolType & | subtreeGap, | ||
const SymbolType & | nodeWildcard, | ||
unsigned & | nextState | ||
) |