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:

List of all members.

Public Member Functions
virtual void	print ()
virtual	~SimpleInterval ()
Public Attributes
double	high
double	low
	interval is defined as [low, 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.

---

Constructor & Destructor Documentation

virtual fcl::SimpleInterval::~SimpleInterval

(

)

[inline, virtual]

Definition at line 53 of file interval_tree.h.

---

Member Function Documentation

virtual void fcl::SimpleInterval::print

(

)

[inline, virtual]

Definition at line 55 of file interval_tree.h.

---

Member Data Documentation

double fcl::SimpleInterval::high

Definition at line 58 of file interval_tree.h.

double fcl::SimpleInterval::low

interval is defined as [low, high]

Definition at line 58 of file interval_tree.h.

---

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

• interval_tree.h