tree::generate::Node Struct Reference

Collaboration diagram for tree::generate::Node:

Public Member Functions
	Node ()
	Node (Node *parent)
	~Node ()
void	rotateLeftBranch ()
void	generateUnrankedSymbols (const ext::vector< char > &alphabet)
void	generateRankedSymbols (const ext::map< int, ext::vector< char > > &rankedAlphabet)
void	fillRanks (ext::map< int, ext::vector< char > > &rankedAlphabet)
ext::tree< DefaultSymbolType >	createUnrankedNode ()
ext::tree< DefaultSymbolType >	createUnrankedPatternNode ()
ext::tree< DefaultSymbolType >	createUnrankedExtendedPatternNode (const ext::set< DefaultSymbolType > &selectedNodeWildcards)
ext::tree< common::ranked_symbol< > >	createRankedNode ()
ext::tree< common::ranked_symbol< > >	createRankedPatternNode ()
ext::tree< common::ranked_symbol< > >	createRankedExtendedPatternNode (const ext::set< common::ranked_symbol< > > &selectedNodeWildcards)
ext::tree< common::ranked_symbol< > >	createRankedNonlinearPatternNode (bool singleNonlinearVariable)
void	nicePrint (ext::ostream &os=common::Streams::out, const std::string &prefix="", const bool last=true) const

Data Fields
char	symbol
int	depth
Node *	right
Node *	child = nullptr
size_t	rank = 0

Constructor & Destructor Documentation

Node() [1/2]

tree::generate::Node::Node ( )

inline

Node() [2/2]

tree::generate::Node::Node ( Node *  parent )

inline

~Node()

tree::generate::Node::~Node ( )

inline

Member Function Documentation

createRankedExtendedPatternNode()

ext::tree< common::ranked_symbol< > > tree::generate::Node::createRankedExtendedPatternNode ( const ext::set< common::ranked_symbol< > > &  selectedNodeWildcards )

inline

Here is the call graph for this function:

Here is the caller graph for this function:

createRankedNode()

ext::tree< common::ranked_symbol< > > tree::generate::Node::createRankedNode ( )

inline

Here is the call graph for this function:

Here is the caller graph for this function:

createRankedNonlinearPatternNode()

ext::tree< common::ranked_symbol< > > tree::generate::Node::createRankedNonlinearPatternNode ( bool  singleNonlinearVariable )

inline

Here is the call graph for this function:

Here is the caller graph for this function:

createRankedPatternNode()

ext::tree< common::ranked_symbol< > > tree::generate::Node::createRankedPatternNode ( )

inline

Here is the call graph for this function:

Here is the caller graph for this function:

createUnrankedExtendedPatternNode()

ext::tree< DefaultSymbolType > tree::generate::Node::createUnrankedExtendedPatternNode ( const ext::set< DefaultSymbolType > &  selectedNodeWildcards )

inline

Here is the call graph for this function:

Here is the caller graph for this function:

createUnrankedNode()

ext::tree< DefaultSymbolType > tree::generate::Node::createUnrankedNode ( )

inline

Here is the call graph for this function:

Here is the caller graph for this function:

createUnrankedPatternNode()

ext::tree< DefaultSymbolType > tree::generate::Node::createUnrankedPatternNode ( )

inline

Here is the call graph for this function:

Here is the caller graph for this function:

fillRanks()

void tree::generate::Node::fillRanks ( ext::map< int, ext::vector< char > > &  rankedAlphabet )

inline

Here is the call graph for this function:

Here is the caller graph for this function:

generateRankedSymbols()

void tree::generate::Node::generateRankedSymbols ( const ext::map< int, ext::vector< char > > &  rankedAlphabet )

inline

Here is the call graph for this function:

Here is the caller graph for this function:

generateUnrankedSymbols()

void tree::generate::Node::generateUnrankedSymbols ( const ext::vector< char > &  alphabet )

inline

Here is the call graph for this function:

Here is the caller graph for this function:

nicePrint()

void tree::generate::Node::nicePrint ( ext::ostream &  os = common::Streams::out, const std::string &  prefix = "", const bool  last = true  ) const

inline

Here is the call graph for this function:

Here is the caller graph for this function:

rotateLeftBranch()

void tree::generate::Node::rotateLeftBranch ( )

inline

Here is the call graph for this function:

Here is the caller graph for this function:

Field Documentation

child

Node* tree::generate::Node::child = nullptr

depth

int tree::generate::Node::depth

rank

size_t tree::generate::Node::rank = 0

right

Node* tree::generate::Node::right

symbol

char tree::generate::Node::symbol

---

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

• alib2algo/src/tree/generate/RandomTreeFactory.cpp