38 #ifndef HPP_FCL_BROADPHASE_DETAIL_INTERVALTREENODE_INL_H 39 #define HPP_FCL_BROADPHASE_DETAIL_INTERVALTREENODE_INL_H 58 key(new_interval->low),
73 std::cout <<
", k = " <<
key <<
", h = " <<
high <<
", mH = " <<
max_high;
74 std::cout <<
" l->key = ";
76 std::cout <<
"nullptr";
79 std::cout <<
" r->key = ";
81 std::cout <<
"nullptr";
84 std::cout <<
" p->key = ";
86 std::cout <<
"nullptr";
89 std::cout <<
" red = " << (int)
red << std::endl;
Interval trees implemented using red-black-trees as described in the book Introduction_To_Algorithms_...
SimpleInterval * stored_interval
interval stored in the node
IntervalTreeNode * parent
void print(IntervalTreeNode *left, IntervalTreeNode *right) const
Print the interval node information: set left = nil and right = root.
The node for interval tree.
bool red
red or black node: if red = false then the node is black
IntervalTreeNode()
Create an empty node.