, including all inherited members.
| add_child(const tree< node > &t, bool last=true) | freeling::tree< node > | |
| begin() | freeling::tree< node > | |
| begin() const | freeling::tree< node > | |
| build_node_index(const std::wstring &) | freeling::parse_tree | |
| C_commands(parse_tree::const_iterator, parse_tree::const_iterator) | freeling::parse_tree | [static] |
| clear() | freeling::tree< node > | |
| const_iterator typedef | freeling::tree< node > | |
| const_preorder_iterator typedef | freeling::tree< node > | |
| const_sibling_iterator typedef | freeling::tree< node > | |
| empty() const | freeling::tree< node > | |
| end() | freeling::tree< node > | |
| end() const | freeling::tree< node > | |
| first | freeling::tree< node > | [protected] |
| get_head_label(parse_tree::const_iterator) | freeling::parse_tree | [static] |
| get_head_position(parse_tree::const_iterator) | freeling::parse_tree | [static] |
| get_head_word(parse_tree::const_iterator) | freeling::parse_tree | [static] |
| get_left_subsuming_node(size_t i, size_t j) const | freeling::parse_tree | |
| get_left_subsuming_node(size_t i, size_t j) | freeling::parse_tree | |
| get_leftmost_leaf(const_iterator) | freeling::tree< node > | [static] |
| get_node_by_id(const std::wstring &) const | freeling::parse_tree | |
| get_node_by_id(const std::wstring &) | freeling::parse_tree | |
| get_node_by_pos(size_t) const | freeling::parse_tree | |
| get_node_by_pos(size_t) | freeling::parse_tree | |
| get_parent() | freeling::tree< node > | |
| get_parent() const | freeling::tree< node > | |
| get_right_subsuming_node(size_t i, size_t j) const | freeling::parse_tree | |
| get_right_subsuming_node(size_t i, size_t j) | freeling::parse_tree | |
| get_rightmost_leaf(const_iterator) | freeling::tree< node > | [static] |
| get_subsuming_node(size_t i, size_t j) const | freeling::parse_tree | |
| get_subsuming_node(size_t i, size_t j) | freeling::parse_tree | |
| hang_child(tree< node > &t, tree_sibling_iterator< node > where=tree_sibling_iterator< node >(NULL)) | freeling::tree< node > | |
| hang_child(preorder_iterator &p, tree_sibling_iterator< node > where=tree_sibling_iterator< node >(NULL)) | freeling::tree< node > | |
| hang_child(sibling_iterator &p, tree_sibling_iterator< node > where=tree_sibling_iterator< node >(NULL)) | freeling::tree< node > | |
| has_ancestor(const tree< node > &) const | freeling::tree< node > | |
| is_root() const | freeling::tree< node > | |
| iterator typedef | freeling::tree< node > | |
| last | freeling::tree< node > | [protected] |
| nchildren | freeling::tree< node > | [protected] |
| next | freeling::tree< node > | [protected] |
| node_index | freeling::parse_tree | [private] |
| nth_child(unsigned int) | freeling::tree< node > | |
| nth_child(unsigned int) const | freeling::tree< node > | |
| nth_child_ref(unsigned int) | freeling::tree< node > | |
| nth_child_ref(unsigned int) const | freeling::tree< node > | |
| num_children() const | freeling::tree< node > | |
| operator=(const tree< node > &) | freeling::tree< node > | |
| parent | freeling::tree< node > | [protected] |
| parse_tree() | freeling::parse_tree | |
| parse_tree(parse_tree::const_iterator p) | freeling::parse_tree | |
| parse_tree(const node &) | freeling::parse_tree | |
| pinfo | freeling::tree< node > | [protected] |
| preorder_iterator typedef | freeling::tree< node > | |
| prev | freeling::tree< node > | [protected] |
| PrintTree(parse_tree::const_iterator n, int k, int depth) | freeling::parse_tree | [static] |
| rebuild_node_index() | freeling::parse_tree | |
| sibling_begin() | freeling::tree< node > | |
| sibling_begin() const | freeling::tree< node > | |
| sibling_end() | freeling::tree< node > | |
| sibling_end() const | freeling::tree< node > | |
| sibling_iterator typedef | freeling::tree< node > | |
| sibling_rbegin() | freeling::tree< node > | |
| sibling_rbegin() const | freeling::tree< node > | |
| sibling_rend() | freeling::tree< node > | |
| sibling_rend() const | freeling::tree< node > | |
| tree() | freeling::tree< node > | |
| tree(const node &) | freeling::tree< node > | |
| tree(const const_iterator &) | freeling::tree< node > | |
| tree(const tree< node > &) | freeling::tree< node > | |
| word_index | freeling::parse_tree | [private] |
| ~tree() | freeling::tree< node > | |
