All Classes Namespaces Functions Variables Typedefs Enumerations Enumerator Friends

fcl::SimpleInterval Struct Reference

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>

Inheritance diagram for fcl::SimpleInterval:

[legend]
List of all members.

Public Member Functions

virtual ~SimpleInterval ()
virtual void print ()

Public Attributes

double low
 interval is defined as [low, high]
double high

Detailed Description

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 50 of file interval_tree.h.


The documentation for this struct was generated from the following file: