| alloc_ | tree< T, tree_node_allocator > | private | 
  | append_child(iter position) | tree< T, tree_node_allocator > |  | 
  | append_child(iter position, const T &x) | tree< T, tree_node_allocator > |  | 
  | append_child(iter position, iter other_position) | tree< T, tree_node_allocator > |  | 
  | append_children(iter position, sibling_iterator from, sibling_iterator to) | tree< T, tree_node_allocator > |  | 
  | begin() const | tree< T, tree_node_allocator > | inline | 
  | begin(const iterator_base &) const | tree< T, tree_node_allocator > |  | 
  | begin_breadth_first() const | tree< T, tree_node_allocator > |  | 
  | begin_fixed(const iterator_base &, unsigned int) const | tree< T, tree_node_allocator > |  | 
  | begin_leaf() const | tree< T, tree_node_allocator > |  | 
  | begin_leaf(const iterator_base &top) const | tree< T, tree_node_allocator > |  | 
  | begin_post() const | tree< T, tree_node_allocator > |  | 
  | breadth_first_iterator typedef | tree< T, tree_node_allocator > |  | 
  | child(const iterator_base &position, unsigned int) | tree< T, tree_node_allocator > | static | 
  | clear() | tree< T, tree_node_allocator > |  | 
  | copy_(const tree< T, tree_node_allocator > &other) | tree< T, tree_node_allocator > | private | 
  | debug_verify_consistency() const | tree< T, tree_node_allocator > |  | 
  | depth(const iterator_base &) | tree< T, tree_node_allocator > | static | 
  | depth(const iterator_base &, const iterator_base &) | tree< T, tree_node_allocator > | static | 
  | empty() const | tree< T, tree_node_allocator > |  | 
  | end() const | tree< T, tree_node_allocator > | inline | 
  | end(const iterator_base &) const | tree< T, tree_node_allocator > |  | 
  | end_breadth_first() const | tree< T, tree_node_allocator > |  | 
  | end_fixed(const iterator_base &, unsigned int) const | tree< T, tree_node_allocator > |  | 
  | end_leaf() const | tree< T, tree_node_allocator > |  | 
  | end_leaf(const iterator_base &top) const | tree< T, tree_node_allocator > |  | 
  | end_post() const | tree< T, tree_node_allocator > |  | 
  | equal(const iter &one, const iter &two, const iter &three) const | tree< T, tree_node_allocator > |  | 
  | equal(const iter &one, const iter &two, const iter &three, BinaryPredicate) const | tree< T, tree_node_allocator > |  | 
  | equal_subtree(const iter &one, const iter &two) const | tree< T, tree_node_allocator > |  | 
  | equal_subtree(const iter &one, const iter &two, BinaryPredicate) const | tree< T, tree_node_allocator > |  | 
  | erase(iter) | tree< T, tree_node_allocator > |  | 
  | erase_children(const iterator_base &) | tree< T, tree_node_allocator > |  | 
  | feet | tree< T, tree_node_allocator > |  | 
  | flatten(iter position) | tree< T, tree_node_allocator > |  | 
  | head | tree< T, tree_node_allocator > |  | 
  | head_initialise_() | tree< T, tree_node_allocator > | private | 
  | index(sibling_iterator it) const | tree< T, tree_node_allocator > |  | 
  | insert(iter position, const T &x) | tree< T, tree_node_allocator > |  | 
  | insert(sibling_iterator position, const T &x) | tree< T, tree_node_allocator > |  | 
  | insert_after(iter position, const T &x) | tree< T, tree_node_allocator > |  | 
  | insert_subtree(iter position, const iterator_base &subtree) | tree< T, tree_node_allocator > |  | 
  | insert_subtree_after(iter position, const iterator_base &subtree) | tree< T, tree_node_allocator > |  | 
  | is_in_subtree(const iterator_base &position, const iterator_base &begin, const iterator_base &end) const | tree< T, tree_node_allocator > |  | 
  | is_valid(const iterator_base &) const | tree< T, tree_node_allocator > |  | 
  | iterator typedef | tree< T, tree_node_allocator > |  | 
  | lowest_common_ancestor(const iterator_base &, const iterator_base &) const | tree< T, tree_node_allocator > |  | 
  | max_depth() const | tree< T, tree_node_allocator > |  | 
  | max_depth(const iterator_base &) const | tree< T, tree_node_allocator > |  | 
  | merge(sibling_iterator, sibling_iterator, sibling_iterator, sibling_iterator, bool duplicate_leaves=false) | tree< T, tree_node_allocator > |  | 
  | move_after(iter target, iter source) | tree< T, tree_node_allocator > |  | 
  | move_before(iter target, iter source) | tree< T, tree_node_allocator > |  | 
  | move_before(sibling_iterator target, sibling_iterator source) | tree< T, tree_node_allocator > |  | 
  | move_ontop(iter target, iter source) | tree< T, tree_node_allocator > |  | 
  | next_at_same_depth(iter) const | tree< T, tree_node_allocator > |  | 
  | next_sibling(iter) const | tree< T, tree_node_allocator > |  | 
  | number_of_children(const iterator_base &) | tree< T, tree_node_allocator > | static | 
  | number_of_siblings(const iterator_base &) const | tree< T, tree_node_allocator > |  | 
  | operator=(const tree< T, tree_node_allocator > &) | tree< T, tree_node_allocator > |  | 
  | parent(iter) | tree< T, tree_node_allocator > | static | 
  | prepend_child(iter position) | tree< T, tree_node_allocator > |  | 
  | prepend_child(iter position, const T &x) | tree< T, tree_node_allocator > |  | 
  | prepend_child(iter position, iter other_position) | tree< T, tree_node_allocator > |  | 
  | prepend_children(iter position, sibling_iterator from, sibling_iterator to) | tree< T, tree_node_allocator > |  | 
  | previous_sibling(iter) const | tree< T, tree_node_allocator > |  | 
  | reparent(iter position, sibling_iterator begin, sibling_iterator end) | tree< T, tree_node_allocator > |  | 
  | reparent(iter position, iter from) | tree< T, tree_node_allocator > |  | 
  | replace(iter position, const T &x) | tree< T, tree_node_allocator > |  | 
  | replace(iter position, const iterator_base &from) | tree< T, tree_node_allocator > |  | 
  | replace(sibling_iterator orig_begin, sibling_iterator orig_end, sibling_iterator new_begin, sibling_iterator new_end) | tree< T, tree_node_allocator > |  | 
  | set_head(const T &x) | tree< T, tree_node_allocator > |  | 
  | sibling(const iterator_base &position, unsigned int) | tree< T, tree_node_allocator > |  | 
  | size() const | tree< T, tree_node_allocator > |  | 
  | size(const iterator_base &) const | tree< T, tree_node_allocator > |  | 
  | sort(sibling_iterator from, sibling_iterator to, bool deep=false) | tree< T, tree_node_allocator > |  | 
  | sort(sibling_iterator from, sibling_iterator to, StrictWeakOrdering comp, bool deep=false) | tree< T, tree_node_allocator > |  | 
  | subtree(sibling_iterator from, sibling_iterator to) const | tree< T, tree_node_allocator > |  | 
  | subtree(tree &, sibling_iterator from, sibling_iterator to) const | tree< T, tree_node_allocator > |  | 
  | swap(sibling_iterator it) | tree< T, tree_node_allocator > |  | 
  | swap(iterator, iterator) | tree< T, tree_node_allocator > |  | 
  | tree() | tree< T, tree_node_allocator > |  | 
  | tree(const T &) | tree< T, tree_node_allocator > |  | 
  | tree(const iterator_base &) | tree< T, tree_node_allocator > |  | 
  | tree(const tree< T, tree_node_allocator > &) | tree< T, tree_node_allocator > |  | 
  | tree_node typedef | tree< T, tree_node_allocator > | protected | 
  | value_type typedef | tree< T, tree_node_allocator > |  | 
  | wrap(iter position, const T &x) | tree< T, tree_node_allocator > |  | 
  | ~tree() | tree< T, tree_node_allocator > |  |