Basic binary node. More...
#include <binary_node.hpp>
Public Member Functions | |
binary_node () | |
Binary node constructor. | |
binary_node (const binary_node &that) | |
Binary node copy constructor. | |
~binary_node () | |
Binary node destructor. Deletes the whole subtree. | |
void | clear () |
Clear right and left childs. Memory's not freed. | |
Public Attributes | |
U * | left |
Left child. | |
U * | right |
Right child. |
Basic binary node.
Definition at line 41 of file binary_node.hpp.
claw::binary_node< U >::binary_node | ( | ) | [inline, explicit] |
Binary node constructor.
Definition at line 38 of file binary_node.tpp.
claw::binary_node< U >::binary_node | ( | const binary_node< U > & | that | ) | [inline, explicit] |
Binary node copy constructor.
that | Node to copy from. |
Definition at line 50 of file binary_node.tpp.
References claw::binary_node< U >::left, and claw::binary_node< U >::right.
claw::binary_node< U >::~binary_node | ( | ) | [inline] |
Binary node destructor. Deletes the whole subtree.
Definition at line 81 of file binary_node.tpp.
References claw::binary_node< U >::left, and claw::binary_node< U >::right.
void claw::binary_node< U >::clear | ( | ) | [inline] |
Clear right and left childs. Memory's not freed.
Definition at line 69 of file binary_node.tpp.
References claw::binary_node< U >::left, and claw::binary_node< U >::right.
Referenced by claw::avl_base< K, Comp >::recursive_delete_max(), and claw::avl_base< K, Comp >::recursive_delete_node().
U* claw::binary_node< U >::left |
Left child.
Definition at line 45 of file binary_node.hpp.
Referenced by claw::avl_base< K, Comp >::adjust_balance_left(), claw::avl_base< K, Comp >::avl_node::avl_node(), claw::binary_node< U >::binary_node(), claw::avl_base< K, Comp >::check_balance(), claw::avl_base< K, Comp >::check_in_bounds(), claw::binary_node< U >::clear(), claw::avl_base< K, Comp >::correct_descendant(), claw::trie< T, Comp >::count(), claw::avl_base< K, Comp >::avl_node::del_tree(), claw::avl_base< K, Comp >::avl_node::depth(), claw::avl_base< K, Comp >::avl_node::duplicate(), claw::avl_base< K, Comp >::avl_node::find(), claw::avl_base< K, Comp >::avl_node::find_nearest_greater(), claw::avl_base< K, Comp >::avl_node::find_nearest_lower(), claw::avl_base< K, Comp >::find_node_reference(), claw::trie< T, Comp >::insert(), claw::avl_base< K, Comp >::insert_node(), claw::avl_base< K, Comp >::avl_node::lower_bound(), claw::avl_base< K, Comp >::avl_node::next(), claw::avl_base< K, Comp >::avl_node::prev(), claw::avl_base< K, Comp >::recursive_delete(), claw::avl_base< K, Comp >::recursive_delete_max(), claw::avl_base< K, Comp >::recursive_delete_node(), claw::avl_base< K, Comp >::rotate_left(), claw::avl_base< K, Comp >::rotate_left_right(), claw::avl_base< K, Comp >::rotate_right(), claw::avl_base< K, Comp >::update_balance(), claw::avl_base< K, Comp >::validity_check(), and claw::binary_node< U >::~binary_node().
U* claw::binary_node< U >::right |
Right child.
Definition at line 47 of file binary_node.hpp.
Referenced by claw::avl_base< K, Comp >::adjust_balance_right(), claw::avl_base< K, Comp >::avl_node::avl_node(), claw::binary_node< U >::binary_node(), claw::avl_base< K, Comp >::check_balance(), claw::avl_base< K, Comp >::check_in_bounds(), claw::binary_node< U >::clear(), claw::avl_base< K, Comp >::correct_descendant(), claw::trie< T, Comp >::count(), claw::avl_base< K, Comp >::avl_node::del_tree(), claw::avl_base< K, Comp >::avl_node::depth(), claw::avl_base< K, Comp >::avl_node::duplicate(), claw::avl_base< K, Comp >::avl_node::find(), claw::avl_base< K, Comp >::avl_node::find_nearest_greater(), claw::avl_base< K, Comp >::avl_node::find_nearest_lower(), claw::avl_base< K, Comp >::find_node_reference(), claw::trie< T, Comp >::insert(), claw::avl_base< K, Comp >::insert_node(), claw::avl_base< K, Comp >::avl_node::next(), claw::avl_base< K, Comp >::avl_node::prev(), claw::avl_base< K, Comp >::recursive_delete(), claw::avl_base< K, Comp >::recursive_delete_max(), claw::avl_base< K, Comp >::recursive_delete_node(), claw::avl_base< K, Comp >::rotate_left(), claw::avl_base< K, Comp >::rotate_right(), claw::avl_base< K, Comp >::rotate_right_left(), claw::avl_base< K, Comp >::update_balance(), claw::avl_base< K, Comp >::avl_node::upper_bound(), claw::avl_base< K, Comp >::validity_check(), and claw::binary_node< U >::~binary_node().