37 #ifndef __EST_RELATION_TREE_H__
38 #define __EST_RELATION_TREE_H__
76 {
return parent(as(n,relname)); }
109 {
return root(as(n,relname)); }
EST_Item * first_leaf(const EST_Item *n)
return the first leaf (terminal node) which is dominated by n. Note that this is different from daugh...
EST_Item * next_sibling(const EST_Item *n)
return next sibling (sister) of n
EST_Item * append_daughter(EST_Item *n, EST_Item *p=0)
EST_Item * prepend_daughter(EST_Item *n, EST_Item *p=0)
int in_tree(const EST_Item *c, const EST_Item *t)
EST_Item * daughter2(const EST_Item *n)
return second daughter of n
EST_Item * root(const EST_Item *n)
return root node of treeprevious sibling (sister) of n
EST_Item * prev_sibling(const EST_Item *n)
return previous sibling (sister) of n
int num_leaves(const EST_Item *n)
EST_Item * last_leaf(const EST_Item *n)
EST_Item * next_leaf(const EST_Item *n)
EST_Item * daughtern(const EST_Item *n, int nth)
return nth daughter of n
EST_Item * parent(const EST_Item *n)
return parent of n
EST_Item * daughter1(const EST_Item *n)
return first daughter of n