Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Public Member Functions | Protected Member Functions | Protected Attributes | Friends
indexes::SuffixTrieNodeTerminatingSymbol Class Reference

#include <SuffixTrieNodeTerminatingSymbol.h>

Collaboration diagram for indexes::SuffixTrieNodeTerminatingSymbol:
[legend]

Public Member Functions

 SuffixTrieNodeTerminatingSymbol (ext::map< DefaultSymbolType, SuffixTrieNodeTerminatingSymbol * > children)
 
 SuffixTrieNodeTerminatingSymbol (const SuffixTrieNodeTerminatingSymbol &other)
 
 SuffixTrieNodeTerminatingSymbol (SuffixTrieNodeTerminatingSymbol &&other) noexcept
 
SuffixTrieNodeTerminatingSymboloperator= (const SuffixTrieNodeTerminatingSymbol &other)
 
SuffixTrieNodeTerminatingSymboloperator= (SuffixTrieNodeTerminatingSymbol &&other) noexcept
 
 ~SuffixTrieNodeTerminatingSymbol () noexcept
 
SuffixTrieNodeTerminatingSymbolclone () const &
 ( ) const & ( ) const & More...
 
SuffixTrieNodeTerminatingSymbolclone () &&
 ( ) const & ( ) const & More...
 
ext::set< DefaultSymbolTypecomputeMinimalAlphabet () const
 
void computeMinimalAlphabet (ext::set< DefaultSymbolType > &alphabet) const
 
const ext::map< const DefaultSymbolType, const SuffixTrieNodeTerminatingSymbol * > & getChildren () const
 
const ext::map< DefaultSymbolType, SuffixTrieNodeTerminatingSymbol * > & getChildren ()
 
SuffixTrieNodeTerminatingSymbolgetChild (const DefaultSymbolType &symbol)
 
const SuffixTrieNodeTerminatingSymbolgetChild (const DefaultSymbolType &symbol) const
 
bool hasChild (const DefaultSymbolType &symbol) const
 
SuffixTrieNodeTerminatingSymboladdChild (DefaultSymbolType symbol, SuffixTrieNodeTerminatingSymbol node)
 
SuffixTrieNodeTerminatingSymbolgetParent ()
 
const SuffixTrieNodeTerminatingSymbolgetParent () const
 
void swap (SuffixTrieNodeTerminatingSymbol &other)
 
auto operator<=> (const SuffixTrieNodeTerminatingSymbol &other) const
 
bool operator== (const SuffixTrieNodeTerminatingSymbol &other) const
 
bool testSymbol (const DefaultSymbolType &symbol) const
 
void operator>> (ext::ostream &out) const
 

Protected Member Functions

bool attachTree (const SuffixTrieTerminatingSymbol *tree)
 

Protected Attributes

ext::map< DefaultSymbolType, SuffixTrieNodeTerminatingSymbol * > m_children
 
SuffixTrieNodeTerminatingSymbolparent
 
const SuffixTrieTerminatingSymbolparentTree
 

Friends

class SuffixTrieTerminatingSymbol
 
ext::ostreamoperator<< (ext::ostream &, const SuffixTrieNodeTerminatingSymbol &node)
 

Detailed Description

Represents a node in the ranked tree. Contains name of the symbol.

Constructor & Destructor Documentation

◆ SuffixTrieNodeTerminatingSymbol() [1/3]

indexes::SuffixTrieNodeTerminatingSymbol::SuffixTrieNodeTerminatingSymbol ( ext::map< DefaultSymbolType, SuffixTrieNodeTerminatingSymbol * >  children)
explicit
Here is the call graph for this function:
Here is the caller graph for this function:

◆ SuffixTrieNodeTerminatingSymbol() [2/3]

indexes::SuffixTrieNodeTerminatingSymbol::SuffixTrieNodeTerminatingSymbol ( const SuffixTrieNodeTerminatingSymbol other)
Here is the call graph for this function:

◆ SuffixTrieNodeTerminatingSymbol() [3/3]

indexes::SuffixTrieNodeTerminatingSymbol::SuffixTrieNodeTerminatingSymbol ( SuffixTrieNodeTerminatingSymbol &&  other)
noexcept

◆ ~SuffixTrieNodeTerminatingSymbol()

indexes::SuffixTrieNodeTerminatingSymbol::~SuffixTrieNodeTerminatingSymbol ( )
noexcept

Member Function Documentation

◆ addChild()

SuffixTrieNodeTerminatingSymbol & indexes::SuffixTrieNodeTerminatingSymbol::addChild ( DefaultSymbolType  symbol,
SuffixTrieNodeTerminatingSymbol  node 
)
Here is the call graph for this function:
Here is the caller graph for this function:

◆ attachTree()

bool indexes::SuffixTrieNodeTerminatingSymbol::attachTree ( const SuffixTrieTerminatingSymbol tree)
protected

Here is the call graph for this function:
Here is the caller graph for this function:

◆ clone() [1/2]

SuffixTrieNodeTerminatingSymbol * indexes::SuffixTrieNodeTerminatingSymbol::clone ( ) &&

( ) const & ( ) const &

( ) const & ( ) const &

◆ clone() [2/2]

SuffixTrieNodeTerminatingSymbol * indexes::SuffixTrieNodeTerminatingSymbol::clone ( ) const &

( ) const & ( ) const &

( ) const & ( ) const &

Here is the call graph for this function:
Here is the caller graph for this function:

◆ computeMinimalAlphabet() [1/2]

ext::set< DefaultSymbolType > indexes::SuffixTrieNodeTerminatingSymbol::computeMinimalAlphabet ( ) const

Here is the call graph for this function:
Here is the caller graph for this function:

◆ computeMinimalAlphabet() [2/2]

void indexes::SuffixTrieNodeTerminatingSymbol::computeMinimalAlphabet ( ext::set< DefaultSymbolType > &  alphabet) const

◆ getChild() [1/2]

SuffixTrieNodeTerminatingSymbol & indexes::SuffixTrieNodeTerminatingSymbol::getChild ( const DefaultSymbolType symbol)
Here is the caller graph for this function:

◆ getChild() [2/2]

const SuffixTrieNodeTerminatingSymbol & indexes::SuffixTrieNodeTerminatingSymbol::getChild ( const DefaultSymbolType symbol) const

◆ getChildren() [1/2]

const ext::map< DefaultSymbolType, SuffixTrieNodeTerminatingSymbol * > & indexes::SuffixTrieNodeTerminatingSymbol::getChildren ( )
Returns
children

◆ getChildren() [2/2]

const ext::map< const DefaultSymbolType, const SuffixTrieNodeTerminatingSymbol * > & indexes::SuffixTrieNodeTerminatingSymbol::getChildren ( ) const
Returns
children

◆ getParent() [1/2]

SuffixTrieNodeTerminatingSymbol * indexes::SuffixTrieNodeTerminatingSymbol::getParent ( )

◆ getParent() [2/2]

const SuffixTrieNodeTerminatingSymbol * indexes::SuffixTrieNodeTerminatingSymbol::getParent ( ) const

◆ hasChild()

bool indexes::SuffixTrieNodeTerminatingSymbol::hasChild ( const DefaultSymbolType symbol) const
Here is the caller graph for this function:

◆ operator<=>()

auto indexes::SuffixTrieNodeTerminatingSymbol::operator<=> ( const SuffixTrieNodeTerminatingSymbol other) const
inline
Here is the call graph for this function:

◆ operator=() [1/2]

SuffixTrieNodeTerminatingSymbol & indexes::SuffixTrieNodeTerminatingSymbol::operator= ( const SuffixTrieNodeTerminatingSymbol other)
Here is the call graph for this function:

◆ operator=() [2/2]

SuffixTrieNodeTerminatingSymbol & indexes::SuffixTrieNodeTerminatingSymbol::operator= ( SuffixTrieNodeTerminatingSymbol &&  other)
noexcept
Here is the call graph for this function:

◆ operator==()

bool indexes::SuffixTrieNodeTerminatingSymbol::operator== ( const SuffixTrieNodeTerminatingSymbol other) const
inline
Here is the call graph for this function:

◆ operator>>()

void indexes::SuffixTrieNodeTerminatingSymbol::operator>> ( ext::ostream out) const

◆ swap()

void indexes::SuffixTrieNodeTerminatingSymbol::swap ( SuffixTrieNodeTerminatingSymbol other)
Here is the call graph for this function:

◆ testSymbol()

bool indexes::SuffixTrieNodeTerminatingSymbol::testSymbol ( const DefaultSymbolType symbol) const

Here is the caller graph for this function:

Friends And Related Function Documentation

◆ operator<<

ext::ostream & operator<< ( ext::ostream out,
const SuffixTrieNodeTerminatingSymbol node 
)
friend

◆ SuffixTrieTerminatingSymbol

friend class SuffixTrieTerminatingSymbol
friend

Field Documentation

◆ m_children

ext::map< DefaultSymbolType, SuffixTrieNodeTerminatingSymbol * > indexes::SuffixTrieNodeTerminatingSymbol::m_children
protected

◆ parent

SuffixTrieNodeTerminatingSymbol* indexes::SuffixTrieNodeTerminatingSymbol::parent
protected

◆ parentTree

const SuffixTrieTerminatingSymbol* indexes::SuffixTrieNodeTerminatingSymbol::parentTree
protected

Parent tree contanining this instance of RankedTree


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