1 /* === S Y N F I G ========================================================= */
3 ** \brief Rectangle Class
8 ** Copyright (c) 2002-2005 Robert B. Quattlebaum Jr., Adrian Bentley
10 ** This package is free software; you can redistribute it and/or
11 ** modify it under the terms of the GNU General Public License as
12 ** published by the Free Software Foundation; either version 2 of
13 ** the License, or (at your option) any later version.
15 ** This package is distributed in the hope that it will be useful,
16 ** but WITHOUT ANY WARRANTY; without even the implied warranty of
17 ** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
18 ** General Public License for more details.
21 /* ========================================================================= */
23 /* === S T A R T =========================================================== */
25 #ifndef __SYNFIG_RECT_H
26 #define __SYNFIG_RECT_H
28 /* === H E A D E R S ======================================================= */
36 /* === M A C R O S ========================================================= */
38 /* === T Y P E D E F S ===================================================== */
40 /* === C L A S S E S & S T R U C T S ======================================= */
44 class Rect : public etl::rect<Real>
48 using etl::rect<Real>::set_point;
49 using etl::rect<Real>::expand;
50 using etl::rect<Real>::set;
52 static Rect full_plane();
66 Rect(const Point& x) { set_point(x); }
68 Rect(const Point& min, const Point& max) { set_point(min); expand(max); }
70 Rect(const value_type &x1,const value_type &y1) { set_point(x1,y1); }
72 Rect(const value_type &x1,const value_type &y1,
73 const value_type &x2,const value_type &y2)
79 void set_point(const Point& max) { set_point(max[0],max[1]); }
81 Rect& expand(const Point& max) { expand(max[0],max[1]); return *this; }
83 Rect& expand(const Real& r) { minx-=r; miny-=r; maxx+=r; maxy+=r; return *this; }
85 Rect& expand_x(const Real& r) { minx-=r; maxx+=r; return *this; }
87 Rect& expand_y(const Real& r) { miny-=r; maxy+=r; return *this; }
89 Rect& set(const Point& min,const Point& max) { set(min[0],min[1],max[0],max[1]); return *this; }
91 Point get_min()const { return Point(minx,miny); }
92 Point get_max()const { return Point(maxx,maxy); }
94 bool is_inside(const Point& x) { return x[0]>minx && x[0]<maxx && x[1]>miny && x[1]<maxy; }
98 return (maxx-minx)*(maxy-miny);
103 Rect& operator+=(const Vector& rhs)
105 minx+=rhs[0]; miny+=rhs[1];
106 maxx+=rhs[0]; maxy+=rhs[1];
110 Rect& operator-=(const Vector& rhs)
112 minx-=rhs[0]; miny-=rhs[1];
113 maxx-=rhs[0]; maxy-=rhs[1];
117 Rect& operator*=(const Real& rhs)
119 minx*=rhs; miny*=rhs;
120 maxx*=rhs; maxy*=rhs;
124 Rect& operator/=(Real rhs)
126 rhs=1.0/rhs; // Avoid doing several divisions
127 minx*=rhs; miny*=rhs;
128 maxx*=rhs; maxy*=rhs;
132 Rect& operator&=(const Rect& rhs)
134 if(rhs.area()>0.00000001 && area()>0.00000001)
135 etl::set_intersect(*this,*this,rhs);
141 Rect& operator|=(const Rect& rhs)
143 if(rhs.area()>0.00000001 && area()>0.00000001)
144 etl::set_union(*this,*this,rhs);
147 if(area()<rhs.area())
153 Rect operator+(const Vector& rhs)const { return Rect(*this)+=rhs; }
155 Rect operator-(const Vector& rhs)const { return Rect(*this)-=rhs; }
157 Rect operator*(const Real& rhs)const { return Rect(*this)*=rhs; }
159 Rect operator/(const Real& rhs)const { return Rect(*this)/=rhs; }
161 Rect operator&(const Rect& rhs)const { return Rect(*this)&=rhs; }
163 Rect operator|(const Rect& rhs)const { return Rect(*this)|=rhs; }
165 bool operator&&(const Rect& rhs)const { return etl::intersect(*this, rhs); }
167 bool is_valid()const { return valid(); }
168 }; // END of class Rect
170 }; // END of namespace synfig
172 /* === E N D =============================================================== */