Fleet
0.0.9
Inference in the LOT
|
#include <BindingTree.h>
Public Member Functions | |
BindingTree () | |
BindingTree (const SExpression::SExpNode &n) | |
This is a convertion from S-expression parsing. More... | |
BindingTree (const BindingTree &t) | |
BindingTree (const BindingTree &&t) | |
void | operator= (const BindingTree &t) |
void | operator= (const BindingTree &&t) |
BindingTree * | get_target () |
BindingTree * | coreferent () |
std::string | string (bool usedot=true) const override |
std::string | my_string () const override |
Public Member Functions inherited from BaseNode< BindingTree > | |
BaseNode (size_t n=0, BindingTree *p=nullptr, size_t i=0) | |
Constructor of basenode – sizes children to n. More... | |
BaseNode (const BindingTree &n) | |
BaseNode (BindingTree &&n) | |
void | operator= (const BindingTree &t) |
void | operator= (const BindingTree &&t) |
void | make_root () |
Make a node root – just nulls the parent. More... | |
virtual | ~BaseNode () |
virtual bool | operator== (const BindingTree &n) const |
NodeIterator | begin () const |
NodeIterator | end () const |
virtual bool | operator!= (const BindingTree &n) const |
void | reserve_children (const size_t n) |
decltype(children) & | get_children () |
decltype(children) const & | get_children () const |
BindingTree & | child (const size_t i) |
const BindingTree & | child (const size_t i) const |
void | fill (size_t n, Args... args) |
size_t | nchildren () const |
BindingTree * | left_descend () const |
size_t | depth () const |
void | fix_child_info () |
void | check_child_info () const |
BindingTree & | operator[] (const size_t i) |
const BindingTree & | operator[] (const size_t i) const |
void | set_child (const size_t i, BindingTree &n) |
void | set_child (const size_t i, BindingTree &&n) |
void | push_back (BindingTree &n) |
void | push_back (BindingTree &&n) |
virtual bool | is_root () const |
Am I a root node? I am if my parent is nullptr. More... | |
BindingTree * | root () |
Find the root of this node by walking up the tree. More... | |
BindingTree * | get_via (std::function< bool(BindingTree &)> &f) |
Return a pointer to the first node satisfying predicate f, in standard traversal; nullptr otherwise. More... | |
virtual size_t | count () const |
How many nodes total are below me? More... | |
virtual size_t | count (const BindingTree &n) const |
How many nodes below me are equal to n? More... | |
virtual bool | is_terminal () const |
Am I a terminal? I am if I have no children. More... | |
virtual size_t | count_terminals () const |
virtual BindingTree * | get_nth (int n, std::function< int(const BindingTree &)> &f) |
virtual BindingTree * | get_nth (int n) |
T | sum (std::function< T(const BindingTree &)> &f) const |
T | sum (T(*f)(const BindingTree &)) const |
bool | all (std::function< bool(const BindingTree &)> &f) const |
void | map (const std::function< void(BindingTree &)> &f) |
void | show (size_t t=0) const |
Public Attributes | |
int | referent |
bool | target |
int | linear_order |
POS | pos |
std::string | label |
std::string | word |
Public Attributes inherited from BaseNode< BindingTree > | |
BindingTree * | parent |
size_t | pi |
Additional Inherited Members | |
Static Public Attributes inherited from BaseNode< BindingTree > | |
static NodeIterator | EndNodeIterator |
Protected Attributes inherited from BaseNode< BindingTree > | |
std::vector< BindingTree > | children |
|
inline |
|
inline |
This is a convertion from S-expression parsing.
s |
|
inline |
|
inline |
|
inline |
|
inline |
|
inlineoverridevirtual |
Reimplemented from BaseNode< BindingTree >.
|
inline |
|
inline |
|
inlineoverridevirtual |
Reimplemented from BaseNode< BindingTree >.
std::string BindingTree::label |
int BindingTree::linear_order |
POS BindingTree::pos |
int BindingTree::referent |
bool BindingTree::target |
std::string BindingTree::word |