PostfixRankedTree.h File Reference

#include <common/DefaultSymbolType.h>
#include <numeric>
#include <ext/algorithm>
#include <alib/set>
#include <alib/vector>
#include <alib/tree>
#include <alib/deque>
#include <core/components.hpp>
#include <common/ranked_symbol.hpp>
#include <tree/TreeException.h>
#include <tree/common/TreeAuxiliary.h>
#include <core/normalize.hpp>
#include <tree/common/TreeNormalize.h>
#include <string/LinearString.h>
#include "RankedTree.h"

Include dependency graph for PostfixRankedTree.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures
class	tree::PostfixRankedTree< SymbolType >
	Tree structure represented as linear sequece as result of postorder traversal. The representation is so called ranked, therefore it consists of ranked symbols. The rank of the ranked symbol needs to be compatible with unsigned integer. More...
class	core::SetConstraint< tree::PostfixRankedTree< SymbolType >, common::ranked_symbol< SymbolType >, tree::GeneralAlphabet >
struct	core::normalize< tree::PostfixRankedTree< SymbolType > >

Namespaces
namespace	tree
namespace	core