inet::IntervalTree::Interval Struct Reference

Interval trees implemented using red-black-trees as described in the book Introduction_To_Algorithms_ by Cormen, Leisserson, and Rivest. More...

#include <IntervalTree.h>

Public Member Functions
	Interval (simtime_t low, simtime_t high, void *value)
virtual	~Interval ()
virtual void	print () const

Public Attributes
simtime_t	low
	interval is defined as [low, high] More...
simtime_t	high
void *	value

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.

Constructor & Destructor Documentation

Interval()

inet::IntervalTree::Interval::Interval ( simtime_t  low, simtime_t  high, void *  value  )

inline

                                                             :
            low(low), high(high), value(value) {}

~Interval()

virtual inet::IntervalTree::Interval::~Interval ( )

inlinevirtual

        {
        }

Member Function Documentation

print()

virtual void inet::IntervalTree::Interval::print ( ) const

inlinevirtual

        {
            std::cout << value;
        }

Member Data Documentation

high

simtime_t inet::IntervalTree::Interval::high

low

simtime_t inet::IntervalTree::Interval::low

interval is defined as [low, high]

value

void* inet::IntervalTree::Interval::value

---

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

• IntervalTree.h