Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Public Member Functions | Friends
indexes::stringology::CompactSuffixAutomatonTerminatingSymbol< SymbolType > Class Template Reference

#include <CompactSuffixAutomatonTerminatingSymbol.h>

Public Member Functions

void setString (const ext::vector< SymbolType > &str)
 
const ext::vector< SymbolType > & getString () const &
 
ext::vector< SymbolType > && getString () &&
 
void setNumberOfVertices (int n)
 
void insertVertex (unsigned vertexNumber, const ext::map< ext::pair< int, int >, int > &edges)
 
const ext::vector< ext::map< ext::pair< size_t, size_t >, unsigned > > & getTransitions () const &
 
ext::vector< ext::map< ext::pair< size_t, size_t >, unsigned > > && getTransitions () &&
 
bool addTransition (unsigned from, size_t startIndex, size_t endIndex, unsigned to)
 
void setTransitions (ext::vector< ext::map< ext::pair< size_t, size_t >, unsigned > > delta)
 
void GetAllPathsLen (unsigned state, unsigned curLen, ext::set< unsigned > &res) const
 
unsigned GetNextState (unsigned state, const ext::vector< SymbolType > &pattern, unsigned &index) const
 
auto operator<=> (const CompactSuffixAutomatonTerminatingSymbol &other) const
 
bool operator== (const CompactSuffixAutomatonTerminatingSymbol &other) const
 
 operator automaton::CompactDFA< SymbolType, unsigned > () const
 

Friends

ext::ostreamoperator<< (ext::ostream &out, const CompactSuffixAutomatonTerminatingSymbol &instance)
 

Member Function Documentation

◆ addTransition()

template<class SymbolType = DefaultSymbolType>
bool indexes::stringology::CompactSuffixAutomatonTerminatingSymbol< SymbolType >::addTransition ( unsigned  from,
size_t  startIndex,
size_t  endIndex,
unsigned  to 
)
inline
Here is the call graph for this function:

◆ GetAllPathsLen()

template<class SymbolType = DefaultSymbolType>
void indexes::stringology::CompactSuffixAutomatonTerminatingSymbol< SymbolType >::GetAllPathsLen ( unsigned  state,
unsigned  curLen,
ext::set< unsigned > &  res 
) const
inline
Here is the call graph for this function:
Here is the caller graph for this function:

◆ GetNextState()

template<class SymbolType = DefaultSymbolType>
unsigned indexes::stringology::CompactSuffixAutomatonTerminatingSymbol< SymbolType >::GetNextState ( unsigned  state,
const ext::vector< SymbolType > &  pattern,
unsigned &  index 
) const
inline
Here is the call graph for this function:
Here is the caller graph for this function:

◆ getString() [1/2]

template<class SymbolType = DefaultSymbolType>
ext::vector< SymbolType > && indexes::stringology::CompactSuffixAutomatonTerminatingSymbol< SymbolType >::getString ( ) &&
inline

◆ getString() [2/2]

template<class SymbolType = DefaultSymbolType>
const ext::vector< SymbolType > & indexes::stringology::CompactSuffixAutomatonTerminatingSymbol< SymbolType >::getString ( ) const &
inline
Here is the caller graph for this function:

◆ getTransitions() [1/2]

template<class SymbolType = DefaultSymbolType>
ext::vector< ext::map< ext::pair< size_t, size_t >, unsigned > > && indexes::stringology::CompactSuffixAutomatonTerminatingSymbol< SymbolType >::getTransitions ( ) &&
inline

◆ getTransitions() [2/2]

template<class SymbolType = DefaultSymbolType>
const ext::vector< ext::map< ext::pair< size_t, size_t >, unsigned > > & indexes::stringology::CompactSuffixAutomatonTerminatingSymbol< SymbolType >::getTransitions ( ) const &
inline
Here is the caller graph for this function:

◆ insertVertex()

template<class SymbolType = DefaultSymbolType>
void indexes::stringology::CompactSuffixAutomatonTerminatingSymbol< SymbolType >::insertVertex ( unsigned  vertexNumber,
const ext::map< ext::pair< int, int >, int > &  edges 
)
inline
Here is the call graph for this function:

◆ operator automaton::CompactDFA< SymbolType, unsigned >()

template<class SymbolType >
indexes::stringology::CompactSuffixAutomatonTerminatingSymbol< SymbolType >::operator automaton::CompactDFA< SymbolType, unsigned >
explicit
Here is the call graph for this function:

◆ operator<=>()

template<class SymbolType = DefaultSymbolType>
auto indexes::stringology::CompactSuffixAutomatonTerminatingSymbol< SymbolType >::operator<=> ( const CompactSuffixAutomatonTerminatingSymbol< SymbolType > &  other) const
inline
Here is the call graph for this function:

◆ operator==()

template<class SymbolType = DefaultSymbolType>
bool indexes::stringology::CompactSuffixAutomatonTerminatingSymbol< SymbolType >::operator== ( const CompactSuffixAutomatonTerminatingSymbol< SymbolType > &  other) const
inline
Here is the call graph for this function:

◆ setNumberOfVertices()

template<class SymbolType = DefaultSymbolType>
void indexes::stringology::CompactSuffixAutomatonTerminatingSymbol< SymbolType >::setNumberOfVertices ( int  n)
inline

◆ setString()

template<class SymbolType = DefaultSymbolType>
void indexes::stringology::CompactSuffixAutomatonTerminatingSymbol< SymbolType >::setString ( const ext::vector< SymbolType > &  str)
inline

◆ setTransitions()

template<class SymbolType = DefaultSymbolType>
void indexes::stringology::CompactSuffixAutomatonTerminatingSymbol< SymbolType >::setTransitions ( ext::vector< ext::map< ext::pair< size_t, size_t >, unsigned > >  delta)
inline

Friends And Related Function Documentation

◆ operator<<

template<class SymbolType = DefaultSymbolType>
ext::ostream & operator<< ( ext::ostream out,
const CompactSuffixAutomatonTerminatingSymbol< SymbolType > &  instance 
)
friend

The documentation for this class was generated from the following file: