3Depict
|
A node in the tree, combining links to other nodes as well as the actual data. More...
#include <tree.hh>
Public Attributes | |
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 |
A node in the tree, combining links to other nodes as well as the actual data.
T tree_node_< T >::data |
Referenced by FilterTreeAnalyse::analyse(), tree< Filter *>::append_child(), tree< Filter *>::erase(), tree< Filter *>::erase_children(), filterAffectedByComposition(), tree< Filter *>::insert(), tree< Filter *>::insert_after(), tree< T, tree_node_allocator >::iterator_base::operator*(), tree< T, tree_node_allocator >::iterator_base::operator->(), tree< Filter *>::prepend_child(), and tree< Filter *>::replace().
tree_node_<T>* tree_node_< T >::first_child |
Referenced by FilterTreeAnalyse::analyse(), tree< Filter *>::append_child(), tree< T, tree_node_allocator >::iterator_base::begin(), tree< Filter *>::begin_fixed(), tree< Filter *>::begin_leaf(), tree< Filter *>::begin_post(), tree< T, tree_node_allocator >::post_order_iterator::descend_all(), tree< Filter *>::end_fixed(), filterAffectedByComposition(), tree< Filter *>::insert(), tree< Filter *>::insert_after(), tree< Filter *>::max_depth(), tree< Filter *>::move_before(), tree< Filter *>::move_ontop(), tree< T, tree_node_allocator >::iterator_base::number_of_children(), tree< T, tree_node_allocator >::pre_order_iterator::operator++(), tree< T, tree_node_allocator >::post_order_iterator::operator++(), tree< T, tree_node_allocator >::fixed_depth_iterator::operator++(), tree< T, tree_node_allocator >::leaf_iterator::operator++(), tree< Filter *>::prepend_child(), tree< T, tree_node_allocator >::sibling_iterator::range_first(), tree< Filter *>::replace(), and tree< Filter *>::swap().
tree_node_<T> * tree_node_< T >::last_child |
Referenced by tree< Filter *>::append_child(), tree< Filter *>::insert(), tree< Filter *>::insert_after(), tree< Filter *>::move_before(), tree< Filter *>::move_ontop(), tree< T, tree_node_allocator >::iterator_base::number_of_children(), tree< T, tree_node_allocator >::pre_order_iterator::operator--(), tree< T, tree_node_allocator >::post_order_iterator::operator--(), tree< T, tree_node_allocator >::fixed_depth_iterator::operator--(), tree< T, tree_node_allocator >::sibling_iterator::operator--(), tree< T, tree_node_allocator >::leaf_iterator::operator--(), tree< Filter *>::prepend_child(), tree< T, tree_node_allocator >::sibling_iterator::range_last(), tree< Filter *>::reparent(), tree< Filter *>::replace(), and tree< Filter *>::swap().
tree_node_<T> * tree_node_< T >::next_sibling |
Referenced by FilterTreeAnalyse::analyse(), tree< Filter *>::append_child(), tree< Filter *>::begin_fixed(), tree< Filter *>::child(), tree< Filter *>::end_fixed(), tree< Filter *>::erase(), tree< Filter *>::erase_children(), tree< Filter *>::flatten(), tree< Filter *>::insert(), tree< Filter *>::insert_after(), tree< Filter *>::max_depth(), tree< Filter *>::move_after(), tree< Filter *>::move_before(), tree< Filter *>::move_ontop(), tree< T, tree_node_allocator >::iterator_base::number_of_children(), tree< Filter *>::number_of_children(), tree< Filter *>::number_of_siblings(), tree< T, tree_node_allocator >::pre_order_iterator::operator++(), tree< T, tree_node_allocator >::post_order_iterator::operator++(), tree< T, tree_node_allocator >::fixed_depth_iterator::operator++(), tree< T, tree_node_allocator >::sibling_iterator::operator++(), tree< T, tree_node_allocator >::leaf_iterator::operator++(), tree< Filter *>::prepend_child(), tree< Filter *>::reparent(), tree< Filter *>::replace(), tree< Filter *>::sibling(), tree< Filter *>::sort(), and tree< Filter *>::swap().
tree_node_<T>* tree_node_< T >::parent |
Referenced by FilterTreeAnalyse::analyse(), tree< Filter *>::append_child(), tree< Filter *>::begin_fixed(), tree< Filter *>::depth(), tree< Filter *>::erase(), filterAffectedByComposition(), tree< Filter *>::flatten(), tree< Filter *>::insert(), tree< Filter *>::insert_after(), tree< Filter *>::max_depth(), tree< Filter *>::move_after(), tree< Filter *>::move_before(), tree< Filter *>::move_ontop(), tree< T, tree_node_allocator >::pre_order_iterator::operator++(), tree< T, tree_node_allocator >::post_order_iterator::operator++(), tree< T, tree_node_allocator >::fixed_depth_iterator::operator++(), tree< T, tree_node_allocator >::leaf_iterator::operator++(), tree< T, tree_node_allocator >::pre_order_iterator::operator--(), tree< T, tree_node_allocator >::post_order_iterator::operator--(), tree< T, tree_node_allocator >::fixed_depth_iterator::operator--(), tree< T, tree_node_allocator >::leaf_iterator::operator--(), tree< Filter *>::prepend_child(), tree< Filter *>::reparent(), tree< Filter *>::replace(), tree< T, tree_node_allocator >::sibling_iterator::sibling_iterator(), tree< Filter *>::sort(), and tree< Filter *>::swap().
tree_node_<T>* tree_node_< T >::prev_sibling |
Referenced by tree< Filter *>::append_child(), tree< Filter *>::erase(), tree< Filter *>::insert(), tree< Filter *>::insert_after(), tree< Filter *>::move_after(), tree< Filter *>::move_before(), tree< Filter *>::move_ontop(), tree< Filter *>::number_of_siblings(), tree< T, tree_node_allocator >::pre_order_iterator::operator--(), tree< T, tree_node_allocator >::post_order_iterator::operator--(), tree< T, tree_node_allocator >::fixed_depth_iterator::operator--(), tree< T, tree_node_allocator >::sibling_iterator::operator--(), tree< T, tree_node_allocator >::leaf_iterator::operator--(), tree< Filter *>::prepend_child(), tree< Filter *>::reparent(), tree< Filter *>::replace(), tree< Filter *>::sort(), and tree< Filter *>::swap().