2 interval.tcc -- implement Interval_t
4 source file of the Flower Library
6 (c) 1996, 1997--2000 Han-Wen Nienhuys <hanwen@cs.uu.nl>
15 #include "interval.hh"
21 _Interval__compare (const Interval_t<T>&a,Interval_t<T> const&b)
23 if (a.elem (LEFT) == b.elem (LEFT) && a.elem (RIGHT) == b.elem (RIGHT))
26 if (a.elem (LEFT) <= b.elem (LEFT) && a.elem (RIGHT) >= b.elem (RIGHT))
29 if (a.elem (LEFT) >= b.elem (LEFT) && a.elem (RIGHT) <= b.elem (RIGHT))
37 Interval_t<T>::contains_b (Interval_t<T> const& a) const
39 int c_i= _Interval__compare (*this, a);
47 Interval__compare (const Interval_t<T>&a,Interval_t<T> const&b)
49 int i = _Interval__compare (a,b);
57 Interval_t<T>::set_empty ()
59 elem (LEFT) = (T) infinity ();
60 elem (RIGHT) = (T) -infinity ();
65 Interval_t<T>::length () const
67 if (elem (RIGHT) < elem (LEFT))
70 return elem (RIGHT)-elem (LEFT);
74 smallest Interval which includes *this and #h#
78 Interval_t<T>::unite (Interval_t<T> h)
80 elem (LEFT) = h.elem (LEFT) <? elem (LEFT);
81 elem (RIGHT) = h.elem (RIGHT) >?elem (RIGHT);
84 if (h.elem (LEFT)<elem (LEFT))
85 elem (LEFT) = h.elem (LEFT);
86 if (h.elem (RIGHT)>elem (RIGHT))
87 elem (RIGHT) = h.elem (RIGHT);
94 Interval_t<T>::intersect (Interval_t<T> h)
96 #if defined (__GNUG__) && ! defined (__STRICT_ANSI__)
97 elem (LEFT) = h.elem (LEFT) >? elem (LEFT);
98 elem (RIGHT) = h.elem (RIGHT) <?elem (RIGHT);
100 elem (LEFT) = max (h.elem (LEFT), elem (LEFT));
101 elem (RIGHT) = min (h.elem (RIGHT), elem (RIGHT));
107 intersect (Interval_t<T> x, Interval_t<T> const &y)
115 Interval_t<T>::str () const
121 return s + T_to_str (elem (LEFT)) + String ("," ) + T_to_str (elem (RIGHT) ) + String ("]" );
126 Interval_t<T>::elem_b (T r)
128 return r >= elem (LEFT) && r <= elem (RIGHT);
132 #define INTERVAL__INSTANTIATE(T) struct Interval_t<T>;\
133 template int Interval__compare (const Interval_t<T>&,Interval_t<T> const&)
135 #endif // INTERVAL_TCC