38 #ifndef FCL_BROADPHASE_DETAIL_INTERVALTREENODE_INL_H 39 #define FCL_BROADPHASE_DETAIL_INTERVALTREENODE_INL_H 41 #include "fcl/broadphase/detail/interval_tree_node.h" 50 class IntervalTreeNode<double>;
62 : stored_interval (new_interval),
63 key(new_interval->low),
64 high(new_interval->high),
83 std::cout <<
", k = " << key <<
", h = " << high <<
", mH = " << max_high;
84 std::cout <<
" l->key = ";
85 if(left == nil) std::cout <<
"nullptr";
else std::cout << left->key;
86 std::cout <<
" r->key = ";
87 if(right == nil) std::cout <<
"nullptr";
else std::cout << right->key;
88 std::cout <<
" p->key = ";
89 if(parent == root) std::cout <<
"nullptr";
else std::cout << parent->key;
90 std::cout <<
" red = " << (int)
red << std::endl;
Main namespace.
Definition: broadphase_bruteforce-inl.h:45
IntervalTreeNode()
Create an empty node.
Definition: interval_tree_node-inl.h:54
bool red
red or black node: if red = false then the node is black
Definition: interval_tree_node.h:85
Interval trees implemented using red-black-trees as described in the book Introduction_To_Algorithms_...
Definition: simple_interval.h:50
void print(IntervalTreeNode *left, IntervalTreeNode *right) const
Print the interval node information: set left = nil and right = root.
Definition: interval_tree_node-inl.h:79
The node for interval tree.
Definition: interval_tree_node.h:54
SimpleInterval< S > * stored_interval
interval stored in the node
Definition: interval_tree_node.h:76