Suffix trie string index. Tree like representation of all suffixes. Nodes of the trie are optionally containing index of the suffix. The parent child relationship of nodes is represented by single symbol. The class does not checks whether the trie actually is suffix trie. More...
#include <SuffixTrie.h>
Inheritance diagram for indexes::stringology::SuffixTrie< SymbolType >:
Collaboration diagram for indexes::stringology::SuffixTrie< SymbolType >:
Public Member Functions | |
| SuffixTrie (ext::set< SymbolType > edgeAlphabet) | |
| SuffixTrie (ext::set< SymbolType > edgeAlphabet, ext::trie< SymbolType, std::optional< unsigned > > trie) | |
| SuffixTrie (ext::trie< SymbolType, std::optional< unsigned > > trie) | |
| const ext::trie< SymbolType, std::optional< unsigned > > & | getRoot () const & |
| ext::trie< SymbolType, std::optional< unsigned > > && | getRoot () && |
| const ext::set< SymbolType > & | getAlphabet () const & |
| ext::set< SymbolType > && | getAlphabet () && |
| void | setTree (ext::trie< SymbolType, std::optional< unsigned > > trie) |
| bool | removeSymbolFromEdgeAlphabet (const SymbolType &symbol) |
| auto | operator<=> (const SuffixTrie &other) const |
| bool | operator== (const SuffixTrie &other) const |
 Public Member Functions inherited from core::Components< SuffixTrie< DefaultSymbolType >, ext::set< DefaultSymbolType >, component::Set, GeneralAlphabet > | |
| void | accessComponent () |
Friends | |
| ext::ostream & | operator<< (ext::ostream &out, const SuffixTrie &instance) |
Additional Inherited Members | |
| Static Public Member Functions inherited from core::Components< SuffixTrie< DefaultSymbolType >, ext::set< DefaultSymbolType >, component::Set, GeneralAlphabet > | |
| static void | registerComponent () |
| static void | unregisterComponent () |
Detailed Description
template<class SymbolType = DefaultSymbolType>
class indexes::stringology::SuffixTrie< SymbolType >
class indexes::stringology::SuffixTrie< SymbolType >
Suffix trie string index. Tree like representation of all suffixes. Nodes of the trie are optionally containing index of the suffix. The parent child relationship of nodes is represented by single symbol. The class does not checks whether the trie actually is suffix trie.
- Template Parameters
-
SymbolType type of symbols of indexed string
Constructor & Destructor Documentation
◆ SuffixTrie() [1/3]
template<class SymbolType >
|
explicit |
Creates a new instance of the index over concrete alphabet and content initialized to empty root.
- Parameters
-
edgeAlphabet the alphabet of symbols on node to node edges.
◆ SuffixTrie() [2/3]
template<class SymbolType >
|
explicit |
Creates a new instance of the index over concrete alphabet and raw suffix trie.
- Parameters
-
edgeAlphabet the alphabet of symbols on node to node edges. trie the representation of suffix trie.
◆ SuffixTrie() [3/3]
template<class SymbolType >
|
explicit |
Creates a new instance of the index based on raw suffix trie.
- Parameters
-
trie the representation of suffix trie.
Member Function Documentation
◆ getAlphabet() [1/2]
template<class SymbolType = DefaultSymbolType>
|
inline |
Getter of the alphabet of the indexed string.
- Returns
- the alphabet of the indexed string
Here is the call graph for this function:
◆ getAlphabet() [2/2]
template<class SymbolType = DefaultSymbolType>
|
inline |
Getter of the alphabet of the indexed string.
- Returns
- the alphabet of the indexed string
Here is the caller graph for this function:
◆ getRoot() [1/2]
template<class SymbolType = DefaultSymbolType>
| ext::trie< SymbolType, std::optional< unsigned > > && indexes::stringology::SuffixTrie< SymbolType >::getRoot | ( | ) | && |
Getter of the raw suffix trie.
- Returns
- root node of the trie
◆ getRoot() [2/2]
template<class SymbolType = DefaultSymbolType>
| const ext::trie< SymbolType, std::optional< unsigned > > & indexes::stringology::SuffixTrie< SymbolType >::getRoot | ( | ) | const & |
Getter of the raw suffix trie.
- Returns
- root node of the trie
Here is the caller graph for this function:
◆ operator<=>()
template<class SymbolType = DefaultSymbolType>
|
inline |
The three way comparison implementation
- Parameters
-
other the other instance
- Returns
- the ordering between this object and the
other.
Here is the call graph for this function:
◆ operator==()
template<class SymbolType = DefaultSymbolType>
|
inline |
The equality comparison implementation.
- Parameters
-
other the other object to compare with.
- Returns
- true if this and other objects are equal, false othervise
Here is the call graph for this function:
◆ removeSymbolFromEdgeAlphabet()
template<class SymbolType = DefaultSymbolType>
|
inline |
Remover of a symbol from the alphabet.
- Parameters
-
symbol a symbol to remove.
◆ setTree()
template<class SymbolType >
| void indexes::stringology::SuffixTrie< SymbolType >::setTree | ( | ext::trie< SymbolType, std::optional< unsigned > > | trie | ) |
Sets the root node of the suffix trie
- Parameters
-
tree root node to set
Friends And Related Function Documentation
◆ operator<<
template<class SymbolType = DefaultSymbolType>
|
friend |
Print this object as raw representation to ostream.
- Parameters
-
out ostream where to print instance object to print
- Returns
- modified output stream
The documentation for this class was generated from the following file:
- alib2data/src/indexes/stringology/SuffixTrie.h
