freeling::dep_tree Member List

This is the complete list of members for freeling::dep_tree, including all inherited members.

add_child(const tree< depnode > &t, bool last=true)	freeling::tree< depnode >
begin()	freeling::tree< depnode >
begin() const	freeling::tree< depnode >
clear()	freeling::tree< depnode >
const_iterator typedef	freeling::tree< depnode >
const_preorder_iterator typedef	freeling::tree< depnode >
const_sibling_iterator typedef	freeling::tree< depnode >
dep_tree()	freeling::dep_tree
dep_tree(const depnode &)	freeling::dep_tree
empty() const	freeling::tree< depnode >
end()	freeling::tree< depnode >
end() const	freeling::tree< depnode >
first	freeling::tree< depnode >	[protected]
get_first_word(dep_tree::const_iterator)	freeling::dep_tree	[static]
get_last_word(dep_tree::const_iterator)	freeling::dep_tree	[static]
get_leftmost_leaf(const_iterator)	freeling::tree< depnode >	[static]
get_node_by_pos(size_t) const	freeling::dep_tree
get_node_by_pos(size_t)	freeling::dep_tree
get_parent()	freeling::tree< depnode >
get_parent() const	freeling::tree< depnode >
get_rightmost_leaf(const_iterator)	freeling::tree< depnode >	[static]
hang_child(tree< depnode > &t, tree_sibling_iterator< depnode > where=tree_sibling_iterator< depnode >(NULL))	freeling::tree< depnode >
hang_child(preorder_iterator &p, tree_sibling_iterator< depnode > where=tree_sibling_iterator< depnode >(NULL))	freeling::tree< depnode >
hang_child(sibling_iterator &p, tree_sibling_iterator< depnode > where=tree_sibling_iterator< depnode >(NULL))	freeling::tree< depnode >
has_ancestor(const tree< depnode > &) const	freeling::tree< depnode >
is_root() const	freeling::tree< depnode >
iterator typedef	freeling::tree< depnode >
last	freeling::tree< depnode >	[protected]
nchildren	freeling::tree< depnode >	[protected]
next	freeling::tree< depnode >	[protected]
nth_child(unsigned int)	freeling::tree< depnode >
nth_child(unsigned int) const	freeling::tree< depnode >
nth_child_ref(unsigned int)	freeling::tree< depnode >
nth_child_ref(unsigned int) const	freeling::tree< depnode >
num_children() const	freeling::tree< depnode >
operator=(const tree< depnode > &)	freeling::tree< depnode >
parent	freeling::tree< depnode >	[protected]
pinfo	freeling::tree< depnode >	[protected]
preorder_iterator typedef	freeling::tree< depnode >
prev	freeling::tree< depnode >	[protected]
PrintDepTree(dep_tree::const_iterator n, int depth)	freeling::dep_tree	[static]
rebuild_node_index()	freeling::dep_tree
sibling_begin()	freeling::tree< depnode >
sibling_begin() const	freeling::tree< depnode >
sibling_end()	freeling::tree< depnode >
sibling_end() const	freeling::tree< depnode >
sibling_iterator typedef	freeling::tree< depnode >
sibling_rbegin()	freeling::tree< depnode >
sibling_rbegin() const	freeling::tree< depnode >
sibling_rend()	freeling::tree< depnode >
sibling_rend() const	freeling::tree< depnode >
tree()	freeling::tree< depnode >
tree(const depnode &)	freeling::tree< depnode >
tree(const const_iterator &)	freeling::tree< depnode >
tree(const tree< depnode > &)	freeling::tree< depnode >
word_index	freeling::dep_tree	[private]
~tree()	freeling::tree< depnode >