2 interval.hh -- part of flowerlib
4 (c) 1996 Han-Wen Nienhuys
13 #include "drul-array.hh"
15 /** a T interval. this represents the closed interval [left,right].
16 No invariants. T must be a totally ordered ring (with division, anyway ..)
17 At instantiation, the function infinity() has to be defined explicitely.
21 struct Interval_t : public Drul_array<T> {
26 static String T_to_str (T arg);
29 ugh, egcs 1.02 ices on this
31 T center() { return (elem (LEFT) + elem (RIGHT)) / T(2);}
41 T &max() { return elem (RIGHT);}
42 T max() const { return elem (RIGHT);}
43 T min() const{ return elem (LEFT); }
44 T &min(){ return elem (LEFT); }
47 *this and h are comparable
49 void unite (Interval_t<T> h);
50 void intersect (Interval_t<T> h);
54 bool empty_b() const { return elem (LEFT) > elem (RIGHT); }
55 bool contains_b (Interval_t<T> const&) const;
59 Interval_t (T m, T M) : Drul_array<T> (m,M)
61 Interval_t<T> &operator -= (T r) {
66 Interval_t<T> &operator += (T r) {
71 Interval_t<T> &operator *=(T r) {
76 elem (LEFT) = elem (RIGHT);
94 inclusion ordering. Crash if not comparable.
97 int Interval__compare (const Interval_t<T>&,Interval_t<T> const&);
103 #include "compare.hh"
105 TEMPLATE_INSTANTIATE_COMPARE(Interval_t<T>&, Interval__compare, template<class T>);
110 intersection (Interval_t<T> a, Interval_t<T> const&b)
119 Interval_t<T> operator +(T a,Interval_t<T> i)
127 Interval_t<T> operator - (Interval_t<T> i, T a)
135 Interval_t<T> operator - (T a,Interval_t<T> i)
144 Interval_t<T> operator +(Interval_t<T> i,T a){
150 Interval_t<T> operator *(T a,Interval_t<T> i)
158 Interval_t<T> operator *(Interval_t<T> i,T a){
162 // again? see fproto.hh
163 typedef Interval_t<Real> Interval;
164 typedef Interval_t<int> Slice; // weird name
167 #endif // INTERVAL_HH