#include <tree.h>
Definition at line 98 of file tree.h.
Data Fields | |
tree_node_< T > * | parent |
tree_node_< T > * | first_child |
tree_node_< T > * | last_child |
tree_node_< T > * | prev_sibling |
tree_node_< T > * | next_sibling |
T | data |
tree_node_<T>* tree_node_< T >::parent |
Definition at line 100 of file tree.h.
Referenced by tree< T, tree_node_allocator >::append_child(), tree< T, tree_node_allocator >::depth(), tree< T, tree_node_allocator >::erase(), tree< T, tree_node_allocator >::flatten(), tree< T, tree_node_allocator >::head_initialise_(), tree< T, tree_node_allocator >::index(), tree< T, tree_node_allocator >::insert(), tree< T, tree_node_allocator >::insert_after(), tree< T, tree_node_allocator >::move_after(), tree< T, tree_node_allocator >::move_before(), tree< T, tree_node_allocator >::move_ontop(), tree< T, tree_node_allocator >::leaf_iterator::operator++(), tree< T, tree_node_allocator >::fixed_depth_iterator::operator++(), tree< T, tree_node_allocator >::post_order_iterator::operator++(), tree< T, tree_node_allocator >::pre_order_iterator::operator++(), tree< T, tree_node_allocator >::leaf_iterator::operator--(), tree< T, tree_node_allocator >::fixed_depth_iterator::operator--(), tree< T, tree_node_allocator >::post_order_iterator::operator--(), tree< T, tree_node_allocator >::pre_order_iterator::operator--(), tree< T, tree_node_allocator >::prepend_child(), tree< T, tree_node_allocator >::reparent(), tree< T, tree_node_allocator >::replace(), tree< T, tree_node_allocator >::fixed_depth_iterator::set_first_parent_(), tree< T, tree_node_allocator >::sibling_iterator::set_parent_(), tree< T, tree_node_allocator >::sort(), and tree< T, tree_node_allocator >::swap().
tree_node_<T>* tree_node_< T >::first_child |
Definition at line 101 of file tree.h.
Referenced by tree< T, tree_node_allocator >::append_child(), tree< T, tree_node_allocator >::iterator_base::begin(), tree< T, tree_node_allocator >::begin_fixed(), tree< T, tree_node_allocator >::begin_leaf(), tree< T, tree_node_allocator >::begin_post(), tree< T, tree_node_allocator >::post_order_iterator::descend_all(), tree< T, tree_node_allocator >::end_fixed(), tree< T, tree_node_allocator >::fixed_depth_iterator::find_leftmost_parent_(), tree< T, tree_node_allocator >::head_initialise_(), tree< T, tree_node_allocator >::insert(), tree< T, tree_node_allocator >::insert_after(), tree< T, tree_node_allocator >::move_before(), tree< T, tree_node_allocator >::move_ontop(), tree< T, tree_node_allocator >::iterator_base::number_of_children(), tree< T, tree_node_allocator >::leaf_iterator::operator++(), tree< T, tree_node_allocator >::fixed_depth_iterator::operator++(), tree< T, tree_node_allocator >::post_order_iterator::operator++(), tree< T, tree_node_allocator >::pre_order_iterator::operator++(), tree< T, tree_node_allocator >::prepend_child(), tree< T, tree_node_allocator >::sibling_iterator::range_first(), tree< T, tree_node_allocator >::replace(), and tree< T, tree_node_allocator >::swap().
tree_node_<T> * tree_node_< T >::last_child |
Definition at line 101 of file tree.h.
Referenced by tree< T, tree_node_allocator >::append_child(), tree< T, tree_node_allocator >::head_initialise_(), tree< T, tree_node_allocator >::insert(), tree< T, tree_node_allocator >::insert_after(), tree< T, tree_node_allocator >::move_before(), tree< T, tree_node_allocator >::move_ontop(), tree< T, tree_node_allocator >::iterator_base::number_of_children(), tree< T, tree_node_allocator >::leaf_iterator::operator--(), tree< T, tree_node_allocator >::sibling_iterator::operator--(), tree< T, tree_node_allocator >::fixed_depth_iterator::operator--(), tree< T, tree_node_allocator >::post_order_iterator::operator--(), tree< T, tree_node_allocator >::pre_order_iterator::operator--(), tree< T, tree_node_allocator >::prepend_child(), tree< T, tree_node_allocator >::sibling_iterator::range_last(), tree< T, tree_node_allocator >::reparent(), tree< T, tree_node_allocator >::replace(), and tree< T, tree_node_allocator >::swap().
tree_node_<T>* tree_node_< T >::prev_sibling |
Definition at line 102 of file tree.h.
Referenced by tree< T, tree_node_allocator >::append_child(), tree< T, tree_node_allocator >::erase(), tree< T, tree_node_allocator >::fixed_depth_iterator::find_leftmost_parent_(), tree< T, tree_node_allocator >::head_initialise_(), tree< T, tree_node_allocator >::index(), tree< T, tree_node_allocator >::insert(), tree< T, tree_node_allocator >::insert_after(), tree< T, tree_node_allocator >::move_after(), tree< T, tree_node_allocator >::move_before(), tree< T, tree_node_allocator >::move_ontop(), tree< T, tree_node_allocator >::number_of_siblings(), tree< T, tree_node_allocator >::leaf_iterator::operator--(), tree< T, tree_node_allocator >::sibling_iterator::operator--(), tree< T, tree_node_allocator >::fixed_depth_iterator::operator--(), tree< T, tree_node_allocator >::post_order_iterator::operator--(), tree< T, tree_node_allocator >::pre_order_iterator::operator--(), tree< T, tree_node_allocator >::prepend_child(), tree< T, tree_node_allocator >::reparent(), tree< T, tree_node_allocator >::replace(), tree< T, tree_node_allocator >::sort(), and tree< T, tree_node_allocator >::swap().
tree_node_<T> * tree_node_< T >::next_sibling |
Definition at line 102 of file tree.h.
Referenced by tree< T, tree_node_allocator >::append_child(), tree< T, tree_node_allocator >::begin(), tree< T, tree_node_allocator >::begin_breadth_first(), tree< T, tree_node_allocator >::begin_fixed(), tree< T, tree_node_allocator >::begin_leaf(), tree< T, tree_node_allocator >::begin_post(), tree< T, tree_node_allocator >::child(), tree< T, tree_node_allocator >::clear(), tree< T, tree_node_allocator >::end_fixed(), tree< T, tree_node_allocator >::erase(), tree< T, tree_node_allocator >::erase_children(), tree< T, tree_node_allocator >::flatten(), tree< T, tree_node_allocator >::head_initialise_(), tree< T, tree_node_allocator >::insert(), tree< T, tree_node_allocator >::insert_after(), tree< T, tree_node_allocator >::move_after(), tree< T, tree_node_allocator >::move_before(), tree< T, tree_node_allocator >::move_ontop(), tree< T, tree_node_allocator >::iterator_base::number_of_children(), tree< T, tree_node_allocator >::number_of_children(), tree< T, tree_node_allocator >::number_of_siblings(), tree< T, tree_node_allocator >::leaf_iterator::operator++(), tree< T, tree_node_allocator >::sibling_iterator::operator++(), tree< T, tree_node_allocator >::fixed_depth_iterator::operator++(), tree< T, tree_node_allocator >::post_order_iterator::operator++(), tree< T, tree_node_allocator >::pre_order_iterator::operator++(), tree< T, tree_node_allocator >::prepend_child(), tree< T, tree_node_allocator >::reparent(), tree< T, tree_node_allocator >::replace(), tree< T, tree_node_allocator >::set_head(), tree< T, tree_node_allocator >::sort(), and tree< T, tree_node_allocator >::swap().
T tree_node_< T >::data |
Definition at line 103 of file tree.h.
Referenced by tree< T, tree_node_allocator >::append_child(), tree< T, tree_node_allocator >::erase(), tree< T, tree_node_allocator >::erase_children(), tree< T, tree_node_allocator >::insert(), tree< T, tree_node_allocator >::insert_after(), tree< T, tree_node_allocator >::iterator_base::operator *(), tree< T, tree_node_allocator >::compare_nodes< StrictWeakOrdering >::operator()(), tree< T, tree_node_allocator >::iterator_base::operator->(), tree< T, tree_node_allocator >::prepend_child(), and tree< T, tree_node_allocator >::replace().