source file of the Flower Library
- (c) 1996, 1997--1998 Han-Wen Nienhuys <hanwen@cs.uu.nl>
+ (c) 1996--2004 Han-Wen Nienhuys <hanwen@cs.uu.nl>
*/
#include <math.h>
#include "interval.hh"
#include "string.hh"
-#include "flower-debug.hh"
-template<class T>
-void
-Interval_t<T>::print () const
-{
- fdebug << str ();
-}
template<class T>
int
_Interval__compare (const Interval_t<T>&a,Interval_t<T> const&b)
{
- if (a.left == b.left && a.right == b.right)
- return 0;
+ if (a.elem (LEFT) == b.elem (LEFT) && a.elem (RIGHT) == b.elem (RIGHT))
+ return 0;
- if (a.left <= b.left && a.right >= b.right)
- return 1;
+ if (a.elem (LEFT) <= b.elem (LEFT) && a.elem (RIGHT) >= b.elem (RIGHT))
+ return 1;
- if (a.left >= b.left && a.right <= b.right)
- return -1;
+ if (a.elem (LEFT) >= b.elem (LEFT) && a.elem (RIGHT) <= b.elem (RIGHT))
+ return -1;
return -2;
}
{
int c_i= _Interval__compare (*this, a);
if (c_i == -2)
- return false;
+ return false;
return c_i >= 0;
}
{
int i = _Interval__compare (a,b);
if (i < -1)
- assert (false);
+ assert (false);
return i;
}
template<class T>
void
-Interval_t<T>::set_empty()
+Interval_t<T>::set_empty ()
+{
+ elem (LEFT) = (T) infinity ();
+ elem (RIGHT) = (T) -infinity ();
+}
+
+template<class T>
+void
+Interval_t<T>::set_full ()
{
- left = (T) infinity();
- right = (T) -infinity();
+ elem (LEFT) = (T) -infinity ();
+ elem (RIGHT) = (T) infinity ();
}
template<class T>
T
-Interval_t<T>::length() const
+Interval_t<T>::length () const
{
- if (right < left)
+ if (elem (RIGHT) <= elem (LEFT))
return 0;
else
- return right-left;
+ return elem (RIGHT)-elem (LEFT);
}
template<class T>
-void
-Interval_t<T>::unite (Interval_t<T> h)
+T
+Interval_t<T>::delta () const
{
- if (h.left<left)
- left = h.left;
- if (h.right>right)
- right = h.right;
+ return elem (RIGHT) - elem (LEFT);
}
/**
smallest Interval which includes *this and #h#
*/
+template<class T>
+void
+Interval_t<T>::unite (Interval_t<T> h)
+{
+ elem (LEFT) = h.elem (LEFT) <? elem (LEFT);
+ elem (RIGHT) = h.elem (RIGHT) >?elem (RIGHT);
+
+#if 0
+ if (h.elem (LEFT)<elem (LEFT))
+ elem (LEFT) = h.elem (LEFT);
+ if (h.elem (RIGHT)>elem (RIGHT))
+ elem (RIGHT) = h.elem (RIGHT);
+#endif
+}
+
template<class T>
void
Interval_t<T>::intersect (Interval_t<T> h)
{
#if defined (__GNUG__) && ! defined (__STRICT_ANSI__)
- left = h.left >? left;
- right = h.right <?right;
+ elem (LEFT) = h.elem (LEFT) >? elem (LEFT);
+ elem (RIGHT) = h.elem (RIGHT) <?elem (RIGHT);
#else
- left = max (h.left, left);
- right = min (h.right, right);
+ elem (LEFT) = max (h.elem (LEFT), elem (LEFT));
+ elem (RIGHT) = min (h.elem (RIGHT), elem (RIGHT));
#endif
}
template<class T>
String
-Interval_t<T>::str() const
+Interval_t<T>::to_string () const
{
- if (empty_b())
- return "[empty]";
+ if (is_empty ())
+ return "[empty]";
String s ("[");
- return s + T_to_str (left) + String ("," ) + T_to_str (right ) + String ("]" );
+ return s + T_to_string (elem (LEFT)) + String ("," ) + T_to_string (elem (RIGHT) ) + String ("]" );
}
template<class T>
bool
-Interval_t<T>::elt_b (T r)
+Interval_t<T>::contains (T r)
{
- return r >= left && r <= right;
+ return r >= elem (LEFT) && r <= elem (RIGHT);
}
#define INTERVAL__INSTANTIATE(T) struct Interval_t<T>;\
- template int Interval__compare(const Interval_t<T>&,Interval_t<T> const&)
+template int Interval__compare (const Interval_t<T>&,Interval_t<T> const&)
#endif // INTERVAL_TCC