|
Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
Go to the source code of this file.
Data Structures | |
| class | ext::BaseNode< Data > |
| Base class for hierarchy of tree node types. The tree node types can be used to construct tree structures of different types of nodes. More... | |
| class | ext::AnyaryNode< Data, arity, Base > |
| Tree node with any but fixed number of children. More... | |
| class | ext::NullaryNode< Data, Base > |
| Nullary node is specialisation of Anyary node to no children. More... | |
| class | ext::UnaryNode< Data, Base > |
| Unary node is specialisation of Anyary node to one child. More... | |
| class | ext::BinaryNode< Data, Base > |
| Binary node is specialisation of Anyary node to two children. More... | |
| class | ext::TernaryNode< Data, Base > |
| Ternany node is specialisation of Anyary node to three children. More... | |
| class | ext::FixedaryNode< Data, Base > |
| Fixedary node is tree node that when initialized does not permit change of the number of its children. More... | |
| class | ext::VararyNode< Data, Base > |
| Varary node is tree node that can hold any number of children. More... | |
Namespaces | |
| namespace | ext |