![]() |
Fleet
0.0.9
Inference in the LOT
|
This is the complete list of members for Node, including all inherited members.
| all(std::function< bool(const Node &)> &f) const | BaseNode< Node > | inline |
| assign(Node &n) | Node | inline |
| assign(Node &&n) | Node | inline |
| BaseNode(size_t n=0, Node *p=nullptr, size_t i=0) | BaseNode< Node > | inline |
| BaseNode(const Node &n) | BaseNode< Node > | inline |
| BaseNode(Node &&n) | BaseNode< Node > | inline |
| BaseNode< Node > class | Node | friend |
| begin() const | BaseNode< Node > | inline |
| can_resample | Node | |
| check_child_info() const | BaseNode< Node > | inline |
| child(const size_t i) | BaseNode< Node > | inline |
| child(const size_t i) const | BaseNode< Node > | inline |
| children | BaseNode< Node > | protected |
| count() const | BaseNode< Node > | inlinevirtual |
| count(const Node &n) const | BaseNode< Node > | inlinevirtual |
| count_nonnull() const | Node | inlinevirtual |
| count_terminals() const | BaseNode< Node > | inlinevirtual |
| depth() const | BaseNode< Node > | inline |
| end() const | BaseNode< Node > | inline |
| EndNodeIterator | BaseNode< Node > | static |
| fill(size_t n, Args... args) | BaseNode< Node > | inline |
| fix_child_info() | BaseNode< Node > | inline |
| format() const | Node | inline |
| fullprint(size_t tab=0) | Node | inlinevirtual |
| get_children() | BaseNode< Node > | inline |
| get_children() const | BaseNode< Node > | inline |
| get_nth(int n, std::function< int(const Node &)> &f) | BaseNode< Node > | inlinevirtual |
| get_nth(int n) | BaseNode< Node > | inlinevirtual |
| get_via(std::function< bool(Node &)> &f) | BaseNode< Node > | inline |
| hash(size_t depth=0) const | Node | inlinevirtual |
| is_complete() const | Node | inlinevirtual |
| is_null() const | Node | inline |
| is_root() const | BaseNode< Node > | inlinevirtual |
| is_terminal() const | BaseNode< Node > | inlinevirtual |
| left_descend() const | BaseNode< Node > | inline |
| linearize(Program< VirtualMachineState_t > &program) const | Node | inline |
| lp | Node | |
| make_root() | BaseNode< Node > | inline |
| map(const std::function< void(Node &)> &f) | BaseNode< Node > | inline |
| my_string() const | BaseNode< Node > | inlinevirtual |
| nchildren() const | BaseNode< Node > | inline |
| Node(const Rule *r=nullptr, double _lp=0.0, bool cr=true) | Node | inline |
| Node(const Node &n) | Node | inline |
| Node(Node &&n) | Node | inline |
| nt() const | Node | inline |
| NTDelimiter | Node | static |
| operator(const Node &other) const | Node | inline |
| operator!=(const Node &n) const | BaseNode< Node > | inlinevirtual |
| operator=(const Node &n) | Node | inline |
| operator=(Node &&n) | Node | inline |
| BaseNode< Node >::operator=(const Node &&t) | BaseNode< Node > | inline |
| operator==(const Node &n) const override | Node | inlinevirtual |
| operator[](const size_t i) | BaseNode< Node > | inline |
| operator[](const size_t i) const | BaseNode< Node > | inline |
| parent | BaseNode< Node > | |
| parseable() const | Node | inlinevirtual |
| pi | BaseNode< Node > | |
| push_back(Node &n) | BaseNode< Node > | inline |
| push_back(Node &&n) | BaseNode< Node > | inline |
| reserve_children(const size_t n) | BaseNode< Node > | inline |
| root() | BaseNode< Node > | inline |
| rule | Node | |
| RuleDelimiter | Node | static |
| set_child(const size_t i, Node &n) | Node | inline |
| set_child(const size_t i, Node &&n) | Node | inline |
| show(size_t t=0) const | BaseNode< Node > | inline |
| string(bool usedot=true) const override | Node | inlinevirtual |
| sum(std::function< T(const Node &)> &f) const | BaseNode< Node > | inline |
| sum(T(*f)(const Node &)) const | BaseNode< Node > | inline |
| type(const size_t i) const | Node | inline |
| ~BaseNode() | BaseNode< Node > | inlinevirtual |
| ~Node() | Node | inlinevirtual |
1.8.13