Tools/Range.h

Go to the documentation of this file.

/**
 * @file Range.h
 *
 * The file defines a template class to represent ranges.
 * 
 * @author <A href=mailto:roefer@tzi.de>Thomas Röfer</A>
 */

#ifndef __RANGE_H__
#define __RANGE_H__

/**
 * A template class to represent ranges. It also defines the 13 Allen relations
 */
template <class T> class Range
{
  public:
    T min,max;                    /**< The limits of the range. */

    /**
     * Constructor.
     * Defines an empty range.
     */
    Range() {min = max = 0;}

    /**
     * Constructor.
     * @param min The minimum of the range.
     * @param max The maximum of the range.
     */
    Range(T min,T max)
      {Range::min = min; Range::max = max;}

    /**
     * The function enlarges the range so that a certain value will be part of it.
     * @param t The value that will be part of the range.
     * @return A reference to the range.
     */
    Range<T>& add(T t)
    {
      if(min > t)
        min = t;
      if(max < t)
        max = t;
      return *this;
    }

    /**
     * The function enlarges the range so that the resulting range also contains another one.
     * @param r The range that also will be part of the range.
     * @return A reference to the range.
     */
    Range<T>& add(const Range<T>& r)
    {
      add(r.min);
      add(r.max);
      return *this;
    }

    /**
     * The function checks whether a certain value is in the range.
     * Note that the function is able to handle circular range, i.e. max < min.
     * @param t The value.
     * @return Is the value inside the range?
     */
    bool isInside(T t) const
      {return min <= max ? t >= min && t <= max : t >= min || t <= max;}

    /**
     * The function limits a certain value to the range.
     * Note that the function is not able to handle circular range, i.e. max < min.
     * @param t The value that will be "clipped" to the range.
     * @return The limited value.
     */
    T limit(T t) const {return t < min ? min : t > max ? max : t;} //sets a limit for a Range

    /**
     * The function limits another range to this range.
     * Note that the function is able to handle circular range, i.e. max < min.
     * @param r The range that will be "clipped" to this range.
     * @return The limited value.
     */
    Range<T> limit(const Range<T>& r) const {return Range<T>(limit(r.min),limit(r.max));} //sets the limit of a Range

    /**
     * The function returns the size of the range.
     * @return The difference between the lower limit and the higher limit.
     */
    T getSize() const {return max - min;}

    /**
     * The function returns the center of the range.
     * @return The center.
     */
    T getCenter() const {return (max + min) / 2;}

  //!@name The 13 Allen relations
  //!@{
    bool operator==(const Range<T>& r) const {return min == r.min && max == r.max;}
    bool operator<(const Range<T>& r) const {return max < r.min;}
    bool operator>(const Range<T>& r) const {return min > r.max;}
    bool meets(const Range<T>& r) const {return max == r.min;}
    bool metBy(const Range<T>& r) const {return min == r.max;}
    bool overlaps(const Range<T>& r) const {return min < r.min && max < r.max && max > r.min;}
    bool overlappedBy(const Range<T>& r) const {return min > r.min && max > r.max && min < r.max;}
    bool starts(const Range<T>& r) const {return min == r.min && max < r.max;}
    bool startedBy(const Range<T>& r) const {return min == r.min && max > r.max;}
    bool finishes(const Range<T>& r) const {return max == r.max && min > r.min;}
    bool finishedBy(const Range<T>& r) const {return max == r.max && min < r.min;}
    bool during(const Range<T>& r) const {return min > r.min && max < r.max;}
    bool contains(const Range<T>& r) const {return min < r.min && max > r.max;}
  //!@}
};

#endif // __RANGE_H__

/*
 * Changelog:
 * 
 * $Log: Range.h,v $
 * Revision 1.1.1.1  2004/05/22 17:35:54  cvsadm
 * created new repository GT2004_WM
 *
 * Revision 1.1  2003/10/07 10:13:21  cvsadm
 * Created GT2004 (M.J.)
 *
 * Revision 1.3  2003/09/28 09:28:48  juengel
 * Comments corrected.
 *
 * Revision 1.2  2003/09/26 15:28:10  juengel
 * Renamed DataTypes to representations.
 *
 * Revision 1.1  2003/09/26 11:40:40  juengel
 * - sorted tools
 * - clean-up in DataTypes
 *
 * Revision 1.1.1.1  2003/07/02 09:40:22  cvsadm
 * created new repository for the competitions in Padova from the 
 * tamara CVS (Tuesday 2:00 pm)
 *
 * removed unused solutions
 *
 * Revision 1.4  2003/06/22 09:14:34  roefer
 * Speed clipping in GT2003 walking engine
 *
 * Revision 1.3  2002/12/16 14:53:53  dueffert
 * changelog added
 *
 */

---