/*
interval.hh -- part of flowerlib
- (c) 1996 Han-Wen Nienhuys
+ (c) 1996--2003 Han-Wen Nienhuys
*/
#ifndef INTERVAL_HH
/** a T interval. this represents the closed interval [left,right].
No invariants. T must be a totally ordered ring (with division, anyway ..)
- At instantiation, the function infinity() has to be defined explicitely.
+ At instantiation, the function infinity () has to be defined explicitely.
*/
template<class T>
/* ************** */
- static T infinity() ;
- static String T_to_str (T arg);
- T center() { return (elem (LEFT) + elem (RIGHT)) / T(2);}
+ static T infinity () ;
+ static String T_to_string (T arg);
+ T center () const {
+ assert (!is_empty ());
+ return (elem (LEFT) + elem (RIGHT)) / T (2);
+ }
void translate (T t)
{
elem (LEFT) += t;
elem (RIGHT) += t;
}
+ void widen (T t)
+ {
+ elem (LEFT) -= t;
+ elem (RIGHT) += t;
+ }
/**
PRE
*/
void unite (Interval_t<T> h);
void intersect (Interval_t<T> h);
-
- T length() const;
- void set_empty() ;
- bool empty_b() const { return elem (LEFT) > elem (RIGHT); }
+ void add_point (T p) {
+ elem(LEFT) = elem (LEFT) <? p;
+ elem(RIGHT) = elem (RIGHT) >? p;
+ }
+ T length () const;
+ T delta () const;
+ void set_empty () ;
+ void set_full ();
+
+ /*
+ TODO: strip hungarian suffix.
+ */
+ bool is_empty () const { return elem (LEFT) > elem (RIGHT); }
bool contains_b (Interval_t<T> const&) const;
- Interval_t() {
- set_empty();
+ Interval_t () {
+ set_empty ();
}
Interval_t (T m, T M) : Drul_array<T> (m,M)
- {}
+ {
+ }
Interval_t<T> &operator -= (T r) {
*this += -r;
return *this;
elem (RIGHT) +=r;
return *this;
}
- Interval_t<T> &operator *=(T r) {
- elem (LEFT) *= r;
- elem (RIGHT) *= r;
- if (r < T(0)) {
- T t = elem (LEFT);
- elem (LEFT) = elem (RIGHT);
- elem (RIGHT) = t;
- }
+ Interval_t<T> &operator *= (T r) {
+ if (!is_empty ())
+ {
+ elem (LEFT) *= r;
+ elem (RIGHT) *= r;
+ if (r < T (0))
+ swap();
+
+ }
return *this;
}
- String str() const;
- void print () const;
+
+ Real linear_combination (Real x) const {
+ return ((1.0 - x) * Real (elem (LEFT)) + (x + 1.0) * Real (elem (RIGHT))) * 0.5;
+ }
+ String to_string () const;
+
bool elem_b (T r);
void negate () {
T r = -elem (LEFT);
elem (LEFT) = l;
elem (RIGHT) =r;
}
+
+ void swap ()
+ {
+ T t = elem (LEFT);
+ elem (LEFT) = elem (RIGHT);
+ elem (RIGHT) = t;
+ }
};
#include "compare.hh"
-TEMPLATE_INSTANTIATE_COMPARE(Interval_t<T>&, Interval__compare, template<class T>);
+TEMPLATE_INSTANTIATE_COMPARE (Interval_t<T>&, Interval__compare, template<class T>);
template<class T>
template<class T>
inline
-Interval_t<T> operator +(T a,Interval_t<T> i)
+Interval_t<T> operator + (T a,Interval_t<T> i)
{
i += a;
return i;
template<class T>
inline
-Interval_t<T> operator +(Interval_t<T> i,T a){
+Interval_t<T> operator + (Interval_t<T> i,T a){
return a+i;
}
template<class T>
inline
-Interval_t<T> operator *(T a,Interval_t<T> i)
+Interval_t<T> operator * (T a,Interval_t<T> i)
{
i *= a;
return i;
template<class T>
inline
-Interval_t<T> operator *(Interval_t<T> i,T a){
+Interval_t<T> operator * (Interval_t<T> i,T a){
return a*i;
}