al_Interval.hpp

#ifndef INCLUDE_AL_INTERVAL_HPP
#define INCLUDE_AL_INTERVAL_HPP
 
/*  Allocore --
  Multimedia / virtual environment application class library
 
  Copyright (C) 2009. AlloSphere Research Group, Media Arts & Technology, UCSB.
  Copyright (C) 2012. The Regents of the University of California.
  All rights reserved.
 
  Redistribution and use in source and binary forms, with or without
  modification, are permitted provided that the following conditions are met:
 
    Redistributions of source code must retain the above copyright notice,
    this list of conditions and the following disclaimer.
 
    Redistributions in binary form must reproduce the above copyright
    notice, this list of conditions and the following disclaimer in the
    documentation and/or other materials provided with the distribution.
 
    Neither the name of the University of California nor the names of its
    contributors may be used to endorse or promote products derived from
    this software without specific prior written permission.
 
  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
  LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  POSSIBILITY OF SUCH DAMAGE.
 
 
  File description:
  A closed interval
 
  File author(s):
  Lance Putnam, 2010, putnam.lance@gmail.com
*/
 
namespace al {
 
 
template <class T>
class Interval {
 public:
  Interval() : mMin(0), mMax(1) {}
 
  Interval(const T& min, const T& max) { endpoints(min, max); }
 
  T center() const { return (max() + min()) / T(2); }  
 
  bool contains(const T& v) const { return v >= min() && v <= max(); }
 
  bool degenerate() const {
    return min() == max();
  }  
  T diameter() const {
    return max() - min();
  }  
  T size() const {
    return diameter();
  }  
  const T& max() const { return mMax; }  
  const T& min() const { return mMin; }  
  bool proper() const {
    return min() != max();
  }  
  T radius() const {
    return diameter() / T(2);
  }  
 
  T toUnit(const T& v) const { return (v - min()) / diameter(); }
 
  template <class U>
  bool operator==(const Interval<U>& v) {
    return min() == v.min() && max() == v.max();
  }
 
  template <class U>
  bool operator!=(const Interval<U>& v) {
    return !(*this == v);
  }
 
  template <class U>
  Interval& operator+=(const Interval<U>& v) {
    endpoints(min() + v.min(), max() + v.max());
    return *this;
  }
 
  template <class U>
  Interval& operator-=(const Interval<U>& v) {
    endpoints(min() - v.max(), max() - v.min());
    return *this;
  }
 
  template <class U>
  Interval& operator*=(const Interval<U>& v) {
    T a = min() * v.min(), b = min() * v.max(), c = max() * v.min(),
      d = max() * v.max();
    mMin = min(min(a, b), min(c, d));
    mMax = max(max(a, b), max(c, d));
    return *this;
  }
 
  template <class U>
  Interval& operator/=(const Interval<U>& v) {
    T a = min() / v.min(), b = min() / v.max(), c = max() / v.min(),
      d = max() / v.max();
    mMin = min(min(a, b), min(c, d));
    mMax = max(max(a, b), max(c, d));
    return *this;
  }
 
  Interval& center(const T& v) { return centerDiameter(v, diameter()); }
 
  Interval& diameter(const T& v) { return centerDiameter(center(), v); }
 
  Interval& centerDiameter(const T& c, const T& d) {
    mMin = c - d * T(0.5);
    mMax = mMin + d;
    return *this;
  }
 
  Interval& endpoints(const T& min, const T& max) {
    mMax = max;
    mMin = min;
    if (mMin > mMax) {
      T t = mMin;
      mMin = mMax;
      mMax = t;
    }
    return *this;
  }
 
  Interval& translate(const T& v) {
    mMin += v;
    mMax += v;
    return *this;
  }
 
  Interval& max(const T& v) { return endpoints(min(), v); }
 
  Interval& min(const T& v) { return endpoints(v, max()); }
 
 private:
  T mMin, mMax;
 
  const T& min(const T& a, const T& b) { return a < b ? a : b; }
  const T& max(const T& a, const T& b) { return a > b ? a : b; }
};
 
}  // namespace al
 
#endif