Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Data Structures | Functions
arbology::exact Namespace Reference

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)
 

Function Documentation

◆ computeRHS()

template<class SymbolType >
ext::vector< char > arbology::exact::computeRHS ( const tree::PrefixRankedPattern< SymbolType > &  pattern,
const ext::vector< int > &  patternSubtreeJumpTable,
int  i 
)
Here is the call graph for this function:
Here is the caller graph for this function:

◆ constructRecursive() [1/3]

template<class SymbolType >
unsigned arbology::exact::constructRecursive ( const ext::tree< common::ranked_symbol< SymbolType > > &  node,
automaton::NFTA< SymbolType, unsigned > &  res,
unsigned &  nextState 
)
Here is the call graph for this function:
Here is the caller graph for this function:

◆ constructRecursive() [2/3]

template<class SymbolType >
unsigned arbology::exact::constructRecursive ( const ext::tree< common::ranked_symbol< SymbolType > > &  node,
automaton::UnorderedNFTA< SymbolType, unsigned > &  res,
unsigned &  nextState 
)
Here is the call graph for this function:

◆ constructRecursive() [3/3]

template<class SymbolType >
unsigned arbology::exact::constructRecursive ( const ext::tree< SymbolType > &  node,
automaton::NondeterministicZAutomaton< SymbolType, unsigned > &  res,
unsigned &  nextState 
)
Here is the call graph for this function:

◆ constructRecursivePattern() [1/3]

template<class SymbolType >
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 
)
Here is the call graph for this function:
Here is the caller graph for this function:

◆ constructRecursivePattern() [2/3]

template<class SymbolType >
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 
)
Here is the call graph for this function:

◆ constructRecursivePattern() [3/3]

template<class SymbolType >
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 
)
Here is the call graph for this function: