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/WildcardSymbol.h>
#include <core/normalize.hpp>
#include <string/LinearString.h>
#include <tree/common/TreeNormalize.h>
#include "PrefixRankedTree.h"
#include "PrefixRankedPattern.h"
#include "RankedTree.h"
#include "RankedPattern.h"
#include "RankedNonlinearPattern.h"
Go to the source code of this file.
Data Structures | |
class | tree::PrefixRankedNonlinearPattern< SymbolType > |
Nonlinear tree pattern 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. Additionally the pattern contains a special wildcard symbol representing any subtree and nonlinear variables each to represent same subtree (in the particular occurrence in a tree). More... | |
class | core::SetConstraint< tree::PrefixRankedNonlinearPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::GeneralAlphabet > |
class | core::SetConstraint< tree::PrefixRankedNonlinearPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::NonlinearAlphabet > |
class | core::ElementConstraint< tree::PrefixRankedNonlinearPattern< SymbolType >, common::ranked_symbol< SymbolType >, tree::SubtreeWildcard > |
struct | core::normalize< tree::PrefixRankedNonlinearPattern< SymbolType > > |
Namespaces | |
namespace | tree |
namespace | core |