|
fastjet 2.4.3
|
#include <SearchTree.hh>

Public Member Functions | |
| Node () | |
| bool | treelinks_null () const |
| default constructor | |
| void | nullify_treelinks () |
| set all the tree-related links are set to null for this node | |
| void | reset_parents_link_to_me (Node *XX) |
| if my parent exists, determine whether I am it's left or right node and set the relevant link equal to XX. | |
Public Attributes | |
| T | value |
| Node * | left |
| Node * | right |
| Node * | parent |
| Node * | successor |
| Node * | predecessor |
Definition at line 135 of file SearchTree.hh.
| SearchTree< T >::Node::Node | ( | ) | [inline] |
Definition at line 137 of file SearchTree.hh.
{};
| void SearchTree< T >::Node::nullify_treelinks | ( | ) | [inline] |
set all the tree-related links are set to null for this node
Definition at line 145 of file SearchTree.hh.
| void SearchTree< T >::Node::reset_parents_link_to_me | ( | Node * | XX | ) |
if my parent exists, determine whether I am it's left or right node and set the relevant link equal to XX.
Definition at line 164 of file SearchTree.hh.
References SearchTree< T >::Node::left, SearchTree< T >::Node::parent, and SearchTree< T >::Node::right.
| bool SearchTree< T >::Node::treelinks_null | ( | ) | const [inline] |
default constructor
returns tree if all the tree-related links are set to null for this node
Definition at line 141 of file SearchTree.hh.
Referenced by SearchTree< T >::verify_structure_linear().
| Node* SearchTree< T >::Node::left |
Definition at line 156 of file SearchTree.hh.
Referenced by SearchTree< T >::_find_predecessor(), SearchTree< T >::_find_successor(), SearchTree< T >::insert(), SearchTree< T >::print_elements(), SearchTree< T >::Node::reset_parents_link_to_me(), SearchTree< T >::verify_structure(), SearchTree< T >::verify_structure_linear(), and SearchTree< T >::verify_structure_recursive().
| Node* SearchTree< T >::Node::parent |
Definition at line 158 of file SearchTree.hh.
Referenced by SearchTree< T >::_find_predecessor(), SearchTree< T >::_find_successor(), SearchTree< T >::insert(), SearchTree< T >::print_elements(), SearchTree< T >::Node::reset_parents_link_to_me(), and SearchTree< T >::verify_structure_linear().
| Node* SearchTree< T >::Node::predecessor |
Definition at line 160 of file SearchTree.hh.
Referenced by SearchTree< T >::insert(), and SearchTree< T >::print_elements().
| Node* SearchTree< T >::Node::right |
Definition at line 157 of file SearchTree.hh.
Referenced by SearchTree< T >::_find_predecessor(), SearchTree< T >::_find_successor(), SearchTree< T >::insert(), SearchTree< T >::print_elements(), SearchTree< T >::Node::reset_parents_link_to_me(), SearchTree< T >::verify_structure(), SearchTree< T >::verify_structure_linear(), and SearchTree< T >::verify_structure_recursive().
| Node* SearchTree< T >::Node::successor |
Definition at line 159 of file SearchTree.hh.
Referenced by SearchTree< T >::print_elements().
| T SearchTree< T >::Node::value |
Definition at line 155 of file SearchTree.hh.
Referenced by SearchTree< T >::insert(), SearchTree< T >::print_elements(), SearchTree< T >::verify_structure_linear(), and SearchTree< T >::verify_structure_recursive().
1.7.3