Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Data Structures | Variables
stringology::indexing Namespace Reference

Data Structures

class  BitParallelIndexConstruction
 
class  CompressedBitParallelIndexConstruction
 
class  ExactFactorOracleAutomaton
 
class  ExactMultiNondeterministicSubsequenceAutomaton
 
class  ExactNondeterministicSubsequenceAutomaton
 
class  ExactSubsequenceAutomaton
 
class  ExactSuffixAutomaton
 
class  ExperimentalCompactSuffixAutomatonConstruct
 
class  ExperimentalSuffixTrie
 
class  NondeterministicApproximateSuffixAutomatonForHammingDistance
 
class  NondeterministicApproximateSuffixEpsilonAutomatonForHammingDistance
 
class  NondeterministicExactFactorAutomaton
 
class  NondeterministicExactSuffixAutomaton
 
class  NondeterministicExactSuffixEpsilonAutomaton
 
class  PositionHeapNaive
 
class  SuffixArrayNaive
 
class  SuffixTrieNaive
 

Variables

auto NDApproximateSuffixAutomaton = registration::AbstractRegister < NondeterministicApproximateSuffixAutomatonForHammingDistance, automaton::NFA < DefaultSymbolType, ext::pair < unsigned, unsigned > >, const string::LinearString < > &, unsigned > ( NondeterministicApproximateSuffixAutomatonForHammingDistance::construct )
 
auto NDApproximateSuffixAutomatonEpsilon = registration::AbstractRegister < NondeterministicApproximateSuffixEpsilonAutomatonForHammingDistance, automaton::EpsilonNFA < DefaultSymbolType, ext::pair < unsigned, unsigned > >, const string::LinearString < > &, unsigned > ( NondeterministicApproximateSuffixEpsilonAutomatonForHammingDistance::construct )
 

Variable Documentation

◆ NDApproximateSuffixAutomaton

◆ NDApproximateSuffixAutomatonEpsilon