Interval Trees
By Yogi Dandass, January 01, 2000
We know that a tree is often a good way to represent an ordered set of values. It can also be a good way to order a set of ranges as well.
January 2000/Interval Trees/Figure 1
#include <time.h>
class observation {
public:
typedef float range_type;
observation(range_type rHigh, range_type rLow, short sID,
time_t DateTime)
: m_rHigh(rHigh), m_rLow(rLow), m_sID(sID),
m_tmDate(DateTime) {}
float low() const { return m_rLow; }
float high() const { return m_rHigh; }
short id() const { return m_sID; }
time_t date() const { return m_tmDate; }
private:
range_type m_rHigh, m_rLow;
short m_sID;
time_t m_tmDate;
};
