|
| enum | ExprType { Sum,
Prod
} |
| |
|
using | Container = std::vector< Node * > |
| |
|
using | iterator = Container::iterator |
| |
|
using | const_iterator = Container::const_iterator |
| |
|
|
bool | empty () const |
| |
|
auto | size () const |
| |
|
auto | begin () |
| |
|
auto | end () |
| |
|
auto | begin () const |
| |
|
auto | end () const |
| |
|
bool | isRoot () const |
| |
|
bool | isAbbreviated () const |
| |
|
iterator | insert (csl::Expr const &t_expr) |
| |
|
std::pair< Node *, std::vector< csl::Expr >::const_iterator > | findBestMatch (std::vector< csl::Expr >::const_iterator first, std::vector< csl::Expr >::const_iterator last) |
| |
|
std::vector< csl::Expr > | getArgs () const |
| |
|
csl::Expr | getChainExpr (ExprType type) const |
| |
|
csl::Expr | getAbbreviation () const |
| |
|
csl::Expr | getChainAbbreviation () const |
| |
|
void | setAbbreviation (std::vector< Tree *> &trees, ExprType type) |
| |
|
void | parse (std::vector< csl::Expr >::const_iterator first, std::vector< csl::Expr >::const_iterator last) |
| |
|
void | print (int indent=0) const |
| |
|
|
static csl::Expr | makeAbbreviation (csl::Expr const &expr, ExprType type) |
| |
|
static csl::Expr | makeExpression (std::vector< csl::Expr > const &args, ExprType type) |
| |
|
static size_t | distance (Node const *first, Node const *last) |
| |
|
static size_t | nLeafs (csl::Expr const &expr) |
| |
|
static csl::Expr | getChainExpr (std::vector< csl::Expr > const &args, ExprType type) |
| |
|
static Node * | build (csl::Expr const &t_expr, Node *t_parent=nullptr) |
| |
|
static void | destroy (Node *&node) |
| |
|
static void | removeSingle (Node *&node) |
| |
|
|
static bool | useDifferedStart = false |
| |
|
static size_t | maxLeaf = 10 |
| |
The documentation for this struct was generated from the following files: