|
Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include <memory>#include <string>#include <compare>#include <extensions/iterator.hpp>#include "deque.hpp"#include "vector.hpp"#include "tree_base.hpp"Go to the source code of this file.
Data Structures | |
| class | ext::forward_tree< T > |
| Class introducing a forward_tree with interface trying to be close to the interface of standard library containers. More... | |
| class | ext::forward_tree< T >::const_structure_iterator |
| The iterator type over structure of the tree representing nodes and node_ends. More... | |
| class | ext::forward_tree< T >::const_prefix_iterator |
| The iterator type over structure of the tree following preorder traversal. More... | |
| class | ext::forward_tree< T >::const_postfix_iterator |
| The iterator type over structure of the tree following postorder traversal. More... | |
Namespaces | |
| namespace | ext |
Functions | |
| template<class T > | |
| std::ostream & | ext::operator<< (std::ostream &out, const forward_tree< T > &t) |
| Operator to print the forward_tree to the output stream. More... | |