Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#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 <tree/common/TreeAuxiliary.h>
#include <alphabet/BarSymbol.h>
#include <core/normalize.hpp>
#include <tree/common/TreeNormalize.h>
#include <string/LinearString.h>
#include "RankedTree.h"
Go to the source code of this file.
Data Structures | |
class | tree::PrefixRankedBarTree< SymbolType > |
Tree structure represented as linear sequece as result of preorder traversal with additional bar symbols. The representation is so called ranked, therefore it consists of ranked symbols (bars are ranked as well). The rank of the ranked symbol needs to be compatible with unsigned integer. More... | |
class | core::SetConstraint< tree::PrefixRankedBarTree< SymbolType >, common::ranked_symbol< SymbolType >, tree::GeneralAlphabet > |
class | core::SetConstraint< tree::PrefixRankedBarTree< SymbolType >, common::ranked_symbol< SymbolType >, tree::BarSymbols > |
struct | core::normalize< tree::PrefixRankedBarTree< SymbolType > > |
Namespaces | |
namespace | tree |
namespace | core |