38 #ifndef FCL_BROADPHASE_DETAIL_INTERVALTREENODE_H 39 #define FCL_BROADPHASE_DETAIL_INTERVALTREENODE_H 41 #include "fcl/broadphase/detail/simple_interval.h" 72 void print(IntervalTreeNode* left, IntervalTreeNode* right)
const;
87 IntervalTreeNode* left;
89 IntervalTreeNode* right;
91 IntervalTreeNode* parent;
100 #include "fcl/broadphase/detail/interval_tree_node-inl.h" 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
Interval tree.
Definition: interval_tree.h:72