Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Data Structures | Namespaces
PrefixRankedTree.h File Reference
#include <common/DefaultSymbolType.h>
#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 <core/normalize.hpp>
#include <tree/common/TreeNormalize.h>
#include <string/LinearString.h>
#include "RankedTree.h"
Include dependency graph for PrefixRankedTree.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures

class  tree::PrefixRankedTree< SymbolType >
 Tree structure represented as linear sequece as result of preorder 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::PrefixRankedTree< SymbolType >, common::ranked_symbol< SymbolType >, tree::GeneralAlphabet >
 
struct  core::normalize< tree::PrefixRankedTree< SymbolType > >
 

Namespaces

namespace  tree
 
namespace  core