Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Modules Concepts
RandomTreeFactory.h
Go to the documentation of this file.
1
6#pragma once
7
8#include <limits>
9
17
18namespace tree {
19
20namespace generate {
21
23public:
24 static tree::RankedTree < > generateRankedTree ( int depth, int nodesCount, size_t maxAlphabetSize, bool randomizedAlphabet, size_t maxRank = std::numeric_limits < size_t >::max ( ) );
25};
26
28public:
29 static tree::RankedPattern < > generateRankedPattern ( int depth, int nodesCount, size_t maxAlphabetSize, bool randomizedAlphabet, size_t maxRank = std::numeric_limits < size_t >::max ( ) );
30};
31
33public:
34 static tree::RankedExtendedPattern < > generateRankedExtendedPattern ( int depth, int nodesCount, size_t maxAlphabetSize, bool randomizedAlphabet, size_t maxRank = std::numeric_limits < size_t >::max ( ), double nodeWildcardProbability = 10 );
35};
36
38public:
39 static tree::RankedNonlinearPattern < > generateRankedNonlinearPattern ( int depth, int nodesCount, size_t maxAlphabetSize, bool randomizedAlphabet, bool singleNonlinearVariable, size_t maxRank = std::numeric_limits < size_t >::max ( ) );
40};
41
43public:
44 static tree::UnrankedTree < > generateUnrankedTree ( int depth, int nodesCount, size_t maxAlphabetSize, bool randomizedAlphabet, size_t maxRank = std::numeric_limits < size_t >::max ( ) );
45};
46
48public:
49 static tree::UnrankedPattern < > generateUnrankedPattern ( int depth, int nodesCount, size_t maxAlphabetSize, bool randomizedAlphabet, size_t maxRank = std::numeric_limits < size_t >::max ( ) );
50};
51
53public:
54 static tree::UnrankedExtendedPattern < > generateUnrankedExtendedPattern ( int depth, int nodesCount, size_t maxAlphabetSize, bool randomizedAlphabet, size_t maxRank = std::numeric_limits < size_t >::max ( ), double nodeWildcardProbability = 10 );
55};
56
57} /* namespace generate */
58
59} /* namespace tree */
60
Extended tree pattern represented in its natural representation. The representation is so called rank...
Definition: RankedExtendedPattern.h:74
Nonlinear tree pattern represented in its natural representation. The representation is so called ran...
Definition: RankedNonlinearPattern.h:74
Tree pattern represented in its natural representation. The representation is so called ranked,...
Definition: RankedPattern.h:72
Tree structure represented in its natural representation. The representation is so called ranked,...
Definition: RankedTree.h:72
Extended tree pattern represented in its natural representation. The representation is so called unra...
Definition: UnrankedExtendedPattern.h:76
Tree pattern represented in its natural representation. The representation is so called unranked,...
Definition: UnrankedPattern.h:73
Tree represented in its natural representation. The representation is so called unranked,...
Definition: UnrankedTree.h:69
Definition: RandomTreeFactory.h:32
static tree::RankedExtendedPattern< > generateRankedExtendedPattern(int depth, int nodesCount, size_t maxAlphabetSize, bool randomizedAlphabet, size_t maxRank=std::numeric_limits< size_t >::max(), double nodeWildcardProbability=10)
Definition: RandomTreeFactory.cpp:461
Definition: RandomTreeFactory.h:37
static tree::RankedNonlinearPattern< > generateRankedNonlinearPattern(int depth, int nodesCount, size_t maxAlphabetSize, bool randomizedAlphabet, bool singleNonlinearVariable, size_t maxRank=std::numeric_limits< size_t >::max())
Definition: RandomTreeFactory.cpp:501
Definition: RandomTreeFactory.h:27
static tree::RankedPattern< > generateRankedPattern(int depth, int nodesCount, size_t maxAlphabetSize, bool randomizedAlphabet, size_t maxRank=std::numeric_limits< size_t >::max())
Definition: RandomTreeFactory.cpp:437
Definition: RandomTreeFactory.h:22
static tree::RankedTree< > generateRankedTree(int depth, int nodesCount, size_t maxAlphabetSize, bool randomizedAlphabet, size_t maxRank=std::numeric_limits< size_t >::max())
Definition: RandomTreeFactory.cpp:416
static tree::UnrankedExtendedPattern< > generateUnrankedExtendedPattern(int depth, int nodesCount, size_t maxAlphabetSize, bool randomizedAlphabet, size_t maxRank=std::numeric_limits< size_t >::max(), double nodeWildcardProbability=10)
Definition: RandomTreeFactory.cpp:380
Definition: RandomTreeFactory.h:47
static tree::UnrankedPattern< > generateUnrankedPattern(int depth, int nodesCount, size_t maxAlphabetSize, bool randomizedAlphabet, size_t maxRank=std::numeric_limits< size_t >::max())
Definition: RandomTreeFactory.cpp:356
Definition: RandomTreeFactory.h:42
static tree::UnrankedTree< > generateUnrankedTree(int depth, int nodesCount, size_t maxAlphabetSize, bool randomizedAlphabet, size_t maxRank=std::numeric_limits< size_t >::max())
Definition: RandomTreeFactory.cpp:338
constexpr const T & max(const T &a)
Root case of maximum computation. The maximum from one value is the value itself.
Definition: algorithm.hpp:278
Definition: BackwardOccurrenceTest.h:17