EST_Relation_tree.h File Reference

#include "EST_Item.h"

Include dependency graph for EST_Relation_tree.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions
EST_Item *	parent (const EST_Item *n)
	return parent of n More...
EST_Item *	daughter1 (const EST_Item *n)
	return first daughter of n More...
EST_Item *	daughter2 (const EST_Item *n)
	return second daughter of n More...
EST_Item *	daughtern (const EST_Item *n, int nth)
	return nth daughter of n More...
EST_Item *	daughtern (const EST_Item *n)
	return last daughter of n More...
EST_Item *	next_sibling (const EST_Item *n)
	return next sibling (sister) of n More...
EST_Item *	prev_sibling (const EST_Item *n)
	return previous sibling (sister) of n More...
EST_Item *	root (const EST_Item *n)
	return root node of treeprevious sibling (sister) of n More...
EST_Item *	parent (const EST_Item *n, const char *relname)
	return parent of n as seen from relation relname More...
EST_Item *	daughter1 (const EST_Item *n, const char *relname)
	return first daughter of n as seen from relation relname More...
EST_Item *	daughter2 (const EST_Item *n, const char *relname)
	return second daughter of n as seen from relation relname More...
EST_Item *	daughtern (const EST_Item *n, const char *relname)
	return last daughter of n as seen from relation relname More...
EST_Item *	next_sibling (const EST_Item *n, const char *relname)
	return next sibling (sister) of n as seen from relation relname More...
EST_Item *	prev_sibling (const EST_Item *n, const char *relname)
	return previous sibling (sister) of n as seen from relation relname More...
EST_Item *	root (const EST_Item *n, const char *relname)
	return root of tree of n as seen from relation relname More...
EST_Item *	first_leaf_in_tree (const EST_Item *root)
EST_Item *	last_leaf_in_tree (const EST_Item *root)
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 daughter1 etc as this descends the tree to find the leftmost terminal node (it is like the transitive closure of daughter1). More...
EST_Item *	last_leaf (const EST_Item *n)
EST_Item *	next_leaf (const EST_Item *n)
int	num_leaves (const EST_Item *n)
int	in_tree (const EST_Item *c, const EST_Item *t)
EST_Item *	append_daughter (EST_Item *n, EST_Item *p=0)
EST_Item *	append_daughter (EST_Item *n, const char *relname, EST_Item *p=0)
EST_Item *	prepend_daughter (EST_Item *n, EST_Item *p=0)
EST_Item *	prepend_daughter (EST_Item *n, const char *relname, EST_Item *p=0)