source file of the Flower Library
- (c) 1996--2004 Han-Wen Nienhuys <hanwen@cs.uu.nl>
+ (c) 1996--2007 Han-Wen Nienhuys <hanwen@xs4all.nl>
*/
-
#ifndef INTERVAL_TCC
#define INTERVAL_TCC
-#include <assert.h>
-#include <math.h>
+#include <cassert>
+
#include "interval.hh"
-#include "string.hh"
+#include "std-string.hh"
+// MacOS 10.3 problems:
+// #include <cmath>
+using namespace std;
template<class T>
int
-_Interval__compare (const Interval_t<T>&a,Interval_t<T> const&b)
+_Interval__compare (const Interval_t<T> &a, Interval_t<T> const &b)
{
- if (a.elem (LEFT) == b.elem (LEFT) && a.elem (RIGHT) == b.elem (RIGHT))
+ if (a.at (LEFT) == b.at (LEFT) && a.at (RIGHT) == b.at (RIGHT))
return 0;
-
- if (a.elem (LEFT) <= b.elem (LEFT) && a.elem (RIGHT) >= b.elem (RIGHT))
+
+ if (a.at (LEFT) <= b.at (LEFT) && a.at (RIGHT) >= b.at (RIGHT))
return 1;
- if (a.elem (LEFT) >= b.elem (LEFT) && a.elem (RIGHT) <= b.elem (RIGHT))
+ if (a.at (LEFT) >= b.at (LEFT) && a.at (RIGHT) <= b.at (RIGHT))
return -1;
return -2;
}
template<class T>
-bool
-Interval_t<T>::superset (Interval_t<T> const& a) const
+bool
+Interval_t<T>::superset (Interval_t<T> const &a) const
{
int c_i = _Interval__compare (*this, a);
if (c_i == -2)
template<class T>
int
-Interval__compare (Interval_t<T> const& a,Interval_t<T> const& b)
+Interval__compare (Interval_t<T> const &a, Interval_t<T> const &b)
{
- int i = _Interval__compare (a,b);
+ int i = _Interval__compare (a, b);
if (i < -1)
assert (false);
return i;
void
Interval_t<T>::set_empty ()
{
- elem_ref (LEFT) = (T) infinity ();
- elem_ref (RIGHT) = (T) -infinity ();
+ at (LEFT) = (T) infinity ();
+ at (RIGHT) = (T) -infinity ();
}
template<class T>
void
Interval_t<T>::set_full ()
{
- elem_ref (LEFT) = (T) -infinity ();
- elem_ref (RIGHT) = (T) infinity ();
+ at (LEFT) = (T) -infinity ();
+ at (RIGHT) = (T) infinity ();
}
template<class T>
T
-Interval_t<T>::length () const
+Interval_t<T>::length () const
{
- if (elem (RIGHT) <= elem (LEFT))
+ if (at (RIGHT) <= at (LEFT))
return 0;
- else
- return elem (RIGHT) - elem (LEFT);
+ else
+ return at (RIGHT) - at (LEFT);
}
template<class T>
T
-Interval_t<T>::delta () const
+Interval_t<T>::delta () const
{
- return elem (RIGHT) - elem (LEFT);
+ return at (RIGHT) - at (LEFT);
}
/* smallest Interval which includes *this and #h# */
void
Interval_t<T>::unite (Interval_t<T> h)
{
- elem_ref (LEFT) = h.elem (LEFT) <? elem (LEFT);
- elem_ref (RIGHT) = h.elem (RIGHT) >? elem (RIGHT);
+ at (LEFT) = min (h.at (LEFT), at (LEFT));
+ at (RIGHT) = max (h.at (RIGHT), at (RIGHT));
}
template<class T>
void
Interval_t<T>::intersect (Interval_t<T> h)
{
-#if defined (__GNUG__) && !defined (__STRICT_ANSI__)
- elem_ref (LEFT) = h.elem (LEFT) >? elem (LEFT);
- elem_ref (RIGHT) = h.elem (RIGHT) <? elem (RIGHT);
-#else
- elem_ref (LEFT) = max (h.elem (LEFT), elem (LEFT));
- elem_ref (RIGHT) = min (h.elem (RIGHT), elem (RIGHT));
-#endif
+ at (LEFT) = max (h.at (LEFT), at (LEFT));
+ at (RIGHT) = min (h.at (RIGHT), at (RIGHT));
}
-#if 0 //this is called intersection
template<class T>
-Interval_t<T>
-intersect (Interval_t<T> x, Interval_t<T> const &y)
-{
- x.intersect (y);
- return x;
-}
-#endif
-
-template<class T>
-String
+string
Interval_t<T>::to_string () const
{
if (is_empty ())
return "[empty]";
- String s ("[");
-
- return (s + T_to_string (elem (LEFT)) + String ("," )
- + T_to_string (elem (RIGHT) ) + String ("]" ));
+ string s ("[");
+
+ return (s + T_to_string (at (LEFT)) + string (",")
+ + T_to_string (at (RIGHT)) + string ("]"));
}
template<class T>
bool
-Interval_t<T>::contains (T r)
+Interval_t<T>::contains (T r) const
{
- return r >= elem (LEFT) && r <= elem (RIGHT);
+ return r >= at (LEFT) && r <= at (RIGHT);
}
-#define INTERVAL__INSTANTIATE(T) struct Interval_t<T>;\
-template int Interval__compare (const Interval_t<T>&,Interval_t<T> const&)
+#define INTERVAL__INSTANTIATE(T) struct Interval_t<T>; \
+ template int Interval__compare (const Interval_t<T> &, Interval_t<T> const &)
#endif // INTERVAL_TCC