PhxRectangle.h

Go to the documentation of this file.

#ifndef PHX_RECTANGLE_H
#define PHX_RECTANGLE_H

#include <math.h>
#include <algorithm>

namespace Phx {

  template <typename T = double>
  class Rectangle {
  public:
    Rectangle() : mX0(0), mY0(0), mX1(0), mY1(0) {}
    Rectangle(T x0, T y0, T x1, T y1) :
      mX0(x0), mY0(y0), mX1(x1), mY1(y1) {}

    T x0(void) const { return mX0; }
    T y0(void) const { return mY0; }
    T x1(void) const { return mX1; }
    T y1(void) const { return mY1; }

    T left(void) const { return std::min(mX0, mX1); }
    T right(void) const { return std::max(mX0, mX1); }
    T top(void) const { return std::max(mY0, mY1); }
    T bottom(void) const { return std::min(mY0, mY1); }

    T width(void) const { return fabs(mX0-mX1); }
    T height(void) const { return fabs(mY0-mY1); }

    void x0(T x0) { mX0 = x0; }
    void y0(T y0) { mY0 = y0; }
    void x1(T x1) { mX1 = x1; }
    void y1(T y1) { mY1 = y1; }

    T area(void) const { return width()*height(); }

    T perimeter(void) const { return (width()+height())*2; }

    bool empty(void) const { return (width() == 0) || (height() == 0); }

    Rectangle intersection(const Rectangle& R) const {
      T l = std::max(left(), R.left());
      T r = std::min(right(), R.right());
      T t = std::min(top(), R.top());
      T b = std::max(bottom(), R.bottom());
      if (b < t) { t = b = (t - b) / 2; }
      if (r < l) { l = r = (l - r) / 2; }

      return Rectangle(l, t, r, b);
    }

    Rectangle cover(const Rectangle& R) const {
      T l = std::min(left(), R.left());
      T r = std::max(right(), R.right());
      T t = std::max(top(), R.top());
      T b = std::min(bottom(), R.bottom());
      return Rectangle(l, t, r, b);
    }

    // default copy/assign okay.
    
    bool operator==(const Rectangle& r) {
      return (r.x0()==x0() && r.x1()==x1() && 
              r.y0()==y0() && r.y1()==y1());
    }

  private:
    T mX0, mY0, mX1, mY1;
  };

};

#endif /* PHX_RECTANGLE_H */

---