$search
Interval trees implemented using red-black-trees as described in the book Introduction_To_Algorithms_ by Cormen, Leisserson, and Rivest. Can be replaced in part by boost::icl::interval_set, which is only supported after boost 1.46 and does not support delete node routine. More...
#include <interval_tree.h>
Public Member Functions | |
Interval () | |
virtual void | print () |
virtual | ~Interval () |
Public Attributes | |
double | high |
double | low |
Interval trees implemented using red-black-trees as described in the book Introduction_To_Algorithms_ by Cormen, Leisserson, and Rivest. Can be replaced in part by boost::icl::interval_set, which is only supported after boost 1.46 and does not support delete node routine.
Definition at line 53 of file interval_tree.h.
collision_space_ccd::Interval::Interval | ( | ) | [inline] |
Definition at line 56 of file interval_tree.h.
virtual collision_space_ccd::Interval::~Interval | ( | ) | [inline, virtual] |
Definition at line 57 of file interval_tree.h.
virtual void collision_space_ccd::Interval::print | ( | ) | [inline, virtual] |
Definition at line 58 of file interval_tree.h.
Definition at line 60 of file interval_tree.h.
Definition at line 60 of file interval_tree.h.