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