|
Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include <SuffixTrieNodeTerminatingSymbol.h>
Protected Member Functions | |
| bool | attachTree (const SuffixTrieTerminatingSymbol *tree) |
Protected Attributes | |
| ext::map< DefaultSymbolType, SuffixTrieNodeTerminatingSymbol * > | m_children |
| SuffixTrieNodeTerminatingSymbol * | parent |
| const SuffixTrieTerminatingSymbol * | parentTree |
Friends | |
| class | SuffixTrieTerminatingSymbol |
| ext::ostream & | operator<< (ext::ostream &, const SuffixTrieNodeTerminatingSymbol &node) |
Represents a node in the ranked tree. Contains name of the symbol.
|
explicit |
| indexes::SuffixTrieNodeTerminatingSymbol::SuffixTrieNodeTerminatingSymbol | ( | const SuffixTrieNodeTerminatingSymbol & | other | ) |
|
noexcept |
|
noexcept |
| SuffixTrieNodeTerminatingSymbol & indexes::SuffixTrieNodeTerminatingSymbol::addChild | ( | DefaultSymbolType | symbol, |
| SuffixTrieNodeTerminatingSymbol | node | ||
| ) |
|
protected |
| SuffixTrieNodeTerminatingSymbol * indexes::SuffixTrieNodeTerminatingSymbol::clone | ( | ) | && |
( ) const & ( ) const &
( ) const & ( ) const &
| SuffixTrieNodeTerminatingSymbol * indexes::SuffixTrieNodeTerminatingSymbol::clone | ( | ) | const & |
( ) const & ( ) const &
( ) const & ( ) const &
| ext::set< DefaultSymbolType > indexes::SuffixTrieNodeTerminatingSymbol::computeMinimalAlphabet | ( | ) | const |
| void indexes::SuffixTrieNodeTerminatingSymbol::computeMinimalAlphabet | ( | ext::set< DefaultSymbolType > & | alphabet | ) | const |
| SuffixTrieNodeTerminatingSymbol & indexes::SuffixTrieNodeTerminatingSymbol::getChild | ( | const DefaultSymbolType & | symbol | ) |
| const SuffixTrieNodeTerminatingSymbol & indexes::SuffixTrieNodeTerminatingSymbol::getChild | ( | const DefaultSymbolType & | symbol | ) | const |
| const ext::map< DefaultSymbolType, SuffixTrieNodeTerminatingSymbol * > & indexes::SuffixTrieNodeTerminatingSymbol::getChildren | ( | ) |
| const ext::map< const DefaultSymbolType, const SuffixTrieNodeTerminatingSymbol * > & indexes::SuffixTrieNodeTerminatingSymbol::getChildren | ( | ) | const |
| SuffixTrieNodeTerminatingSymbol * indexes::SuffixTrieNodeTerminatingSymbol::getParent | ( | ) |
| const SuffixTrieNodeTerminatingSymbol * indexes::SuffixTrieNodeTerminatingSymbol::getParent | ( | ) | const |
| bool indexes::SuffixTrieNodeTerminatingSymbol::hasChild | ( | const DefaultSymbolType & | symbol | ) | const |
|
inline |
| SuffixTrieNodeTerminatingSymbol & indexes::SuffixTrieNodeTerminatingSymbol::operator= | ( | const SuffixTrieNodeTerminatingSymbol & | other | ) |
|
noexcept |
|
inline |
| void indexes::SuffixTrieNodeTerminatingSymbol::operator>> | ( | ext::ostream & | out | ) | const |
| void indexes::SuffixTrieNodeTerminatingSymbol::swap | ( | SuffixTrieNodeTerminatingSymbol & | other | ) |
| bool indexes::SuffixTrieNodeTerminatingSymbol::testSymbol | ( | const DefaultSymbolType & | symbol | ) | const |
|
friend |
|
friend |
|
protected |
|
protected |
|
protected |
Parent tree contanining this instance of RankedTree