X-Git-Url: https://git.donarmstrong.com/?a=blobdiff_plain;f=flower%2Finclude%2Finterval.hh;h=9808bfaef652768c93d8bb97dd0b1f02716fd030;hb=5b4b0d6e9a197e8f9eb085b7c2ad78b8be3e5cfc;hp=be5f560d7e1e3bd17d1d76141b5a8f0a4f15eac5;hpb=7e72a1e50e94a7f9738d62599de79fe7745f600c;p=lilypond.git diff --git a/flower/include/interval.hh b/flower/include/interval.hh index be5f560d7e..9808bfaef6 100644 --- a/flower/include/interval.hh +++ b/flower/include/interval.hh @@ -1,151 +1,162 @@ /* interval.hh -- part of flowerlib - - (c) 1996--2004 Han-Wen Nienhuys + + (c) 1996--2008 Han-Wen Nienhuys */ #ifndef INTERVAL_HH #define INTERVAL_HH -#include +#include + #include "flower-proto.hh" -#include "real.hh" #include "drul-array.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. - - */ +/* 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. */ template -struct Interval_t : public Drul_array { - - /* ************** */ - - static T infinity () ; - static String T_to_string (T arg); - T center () const { - assert (!is_empty ()); - return (elem (LEFT) + elem (RIGHT)) / T (2); - } +struct Interval_t : public Drul_array +{ + Drul_array::at; + + static T infinity (); + static string T_to_string (T arg); + T center () const; void translate (T t) - { - elem (LEFT) += t; - elem (RIGHT) += t; - } + { + at (LEFT) += t; + at (RIGHT) += t; + } void widen (T t) { - elem (LEFT) -= t; - elem (RIGHT) += t; + at (LEFT) -= t; + at (RIGHT) += t; + } + + T distance (T t) const + { + if (t > at (RIGHT)) + return T (t - at (RIGHT)); + else if (t < at (LEFT)) + return T (at (LEFT) - t); + else + return T (0); } - /** - PRE - *this and h are comparable - */ + PRE + *this and h are comparable + */ void unite (Interval_t h); void intersect (Interval_t h); - void add_point (T p) { - elem(LEFT) = elem (LEFT) ? p; + void add_point (T p) + { + at (LEFT) = min (at (LEFT), p); + at (RIGHT) = max (at (RIGHT), p); } T length () const; T delta () const; - void set_empty () ; + void set_empty (); void set_full (); - /* - TODO: strip hungarian suffix. - */ - bool is_empty () const { return elem (LEFT) > elem (RIGHT); } - bool contains_b (Interval_t const&) const; - Interval_t () { + bool is_empty () const + { + return at (LEFT) > at (RIGHT); + } + bool superset (Interval_t const &) const; + Interval_t () + { set_empty (); } - Interval_t (T m, T M) : Drul_array (m,M) - { - } - Interval_t &operator -= (T r) { + Interval_t (Drul_array const &src) + : Drul_array (src) + { + } + + Interval_t (T m, T M) : Drul_array (m, M) + { + } + Interval_t &operator -= (T r) + { *this += -r; return *this; } - Interval_t &operator += (T r) { - elem (LEFT) += r; - elem (RIGHT) +=r; + Interval_t &operator += (T r) + { + at (LEFT) += r; + at (RIGHT) += r; return *this; } - Interval_t &operator *= (T r) { + Interval_t &operator *= (T r) + { if (!is_empty ()) { - elem (LEFT) *= r; - elem (RIGHT) *= r; + at (LEFT) *= r; + at (RIGHT) *= r; if (r < T (0)) - swap(); - + swap (); } return *this; } - Real linear_combination (Real x) const { - Drul_array da (elem (LEFT), - elem (RIGHT)); - return ::linear_combination (da, x); - } - String to_string () const; - - bool contains (T r); - void negate () { - T r = -elem (LEFT); - T l = -elem (RIGHT); - elem (LEFT) = l; - elem (RIGHT) =r; + Real linear_combination (Real x) const; + string to_string () const; + + bool contains (T r) const; + void negate () + { + T r = -at (LEFT); + T l = -at (RIGHT); + at (LEFT) = l; + at (RIGHT) = r; } - + void swap () { - T t = elem (LEFT); - elem (LEFT) = elem (RIGHT); - elem (RIGHT) = t; + T t = at (LEFT); + at (LEFT) = at (RIGHT); + at (RIGHT) = t; } -}; + static bool left_less (Interval_t const &a, Interval_t const &b) + { + return a[LEFT] < b[RIGHT]; + } +}; /** - inclusion ordering. Crash if not comparable. - */ + inclusion ordering. Crash if not comparable. +*/ template -int Interval__compare (const Interval_t&,Interval_t const&); +int Interval__compare (const Interval_t &, Interval_t const &); /** Inclusion ordering. return -2 if not comparable - */ +*/ template int -_Interval__compare (const Interval_t&a,Interval_t const&b); - +_Interval__compare (const Interval_t &a, Interval_t const &b); /* INLINE - */ +*/ #include "compare.hh" -TEMPLATE_INSTANTIATE_COMPARE (Interval_t&, Interval__compare, template); - +TEMPLATE_INSTANTIATE_COMPARE (Interval_t &, Interval__compare, template); template inline Interval_t -intersection (Interval_t a, Interval_t const&b) +intersection (Interval_t a, Interval_t const &b) { a.intersect (b); return a; - } template inline -Interval_t operator + (T a,Interval_t i) +Interval_t operator + (T a, Interval_t i) { i += a; return i; @@ -161,7 +172,7 @@ Interval_t operator - (Interval_t i, T a) template inline -Interval_t operator - (T a,Interval_t i) +Interval_t operator - (T a, Interval_t i) { i.negate (); i += a; @@ -170,13 +181,14 @@ Interval_t operator - (T a,Interval_t i) template inline -Interval_t operator + (Interval_t i,T a){ - return a+i; +Interval_t operator + (Interval_t i, T a) +{ + return a + i; } template inline -Interval_t operator * (T a,Interval_t i) +Interval_t operator * (T a, Interval_t i) { i *= a; return i; @@ -184,11 +196,19 @@ Interval_t operator * (T a,Interval_t i) template inline -Interval_t operator * (Interval_t i,T a){ - return a*i; +Interval_t operator * (Interval_t i, T a) +{ + return a * i; +} + +template +inline T +Interval_t::center () const +{ + assert (!is_empty ()); + return (at (LEFT) + at (RIGHT)) / T (2); } -// again? see flower-proto.hh typedef Interval_t Interval; typedef Interval_t Slice; // weird name