liborigin
2.0.0
|
A node in the tree, combining links to other nodes as well as the actual data. More...
#include <tree.hh>
Public Attributes | |
T | data |
tree_node_< T > * | first_child |
tree_node_< T > * | last_child |
tree_node_< T > * | next_sibling |
tree_node_< T > * | parent |
tree_node_< T > * | prev_sibling |
A node in the tree, combining links to other nodes as well as the actual data.
T tree_node_< T >::data |
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 >::compare_nodes< StrictWeakOrdering >::operator()(), tree< T, tree_node_allocator >::prepend_child(), and tree< T, tree_node_allocator >::replace().
tree_node_<T>* tree_node_< T >::first_child |
Referenced by tree< T, tree_node_allocator >::append_child(), 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 >::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 >::max_depth(), tree< T, tree_node_allocator >::move_before(), tree< T, tree_node_allocator >::move_ontop(), 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 |
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 >::fixed_depth_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 >::next_sibling |
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 >::max_depth(), 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 >::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().
tree_node_<T>* tree_node_< T >::parent |
Referenced by tree< T, tree_node_allocator >::append_child(), tree< T, tree_node_allocator >::begin_fixed(), 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 >::max_depth(), 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 >::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 >::prev_sibling |
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 >::fixed_depth_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().