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();
54 static Rect horizontal_strip(const value_type &y1, const value_type &y2);
55 static Rect vertical_strip(const value_type &x1, const value_type &x2);
69 Rect(const Point& x) { set_point(x); }
71 Rect(const Point& min, const Point& max) { set_point(min); expand(max); }
73 Rect(const value_type &x1,const value_type &y1) { set_point(x1,y1); }
75 Rect(const value_type &x1,const value_type &y1,
76 const value_type &x2,const value_type &y2)
82 void set_point(const Point& max) { set_point(max[0],max[1]); }
84 Rect& expand(const Point& max) { expand(max[0],max[1]); return *this; }
86 Rect& expand(const Real& r) { minx-=r; miny-=r; maxx+=r; maxy+=r; return *this; }
88 Rect& expand_x(const Real& r) { minx-=r; maxx+=r; return *this; }
90 Rect& expand_y(const Real& r) { miny-=r; maxy+=r; return *this; }
92 Rect& set(const Point& min,const Point& max) { set(min[0],min[1],max[0],max[1]); return *this; }
94 Point get_min()const { return Point(minx,miny); }
95 Point get_max()const { return Point(maxx,maxy); }
97 bool is_inside(const Point& x) { return x[0]>minx && x[0]<maxx && x[1]>miny && x[1]<maxy; }
101 return (maxx-minx)*(maxy-miny);
106 Rect& operator+=(const Vector& rhs)
108 minx+=rhs[0]; miny+=rhs[1];
109 maxx+=rhs[0]; maxy+=rhs[1];
113 Rect& operator-=(const Vector& rhs)
115 minx-=rhs[0]; miny-=rhs[1];
116 maxx-=rhs[0]; maxy-=rhs[1];
120 Rect& operator*=(const Real& rhs)
122 minx*=rhs; miny*=rhs;
123 maxx*=rhs; maxy*=rhs;
127 Rect& operator/=(Real rhs)
129 rhs=1.0/rhs; // Avoid doing several divisions
130 minx*=rhs; miny*=rhs;
131 maxx*=rhs; maxy*=rhs;
135 Rect& operator&=(const Rect& rhs)
137 if(rhs.area()>0.00000001 && area()>0.00000001)
138 etl::set_intersect(*this,*this,rhs);
144 Rect& operator|=(const Rect& rhs)
146 if(rhs.area()>0.00000001 && area()>0.00000001)
147 etl::set_union(*this,*this,rhs);
150 if(area()<rhs.area())
156 Rect operator+(const Vector& rhs)const { return Rect(*this)+=rhs; }
158 Rect operator-(const Vector& rhs)const { return Rect(*this)-=rhs; }
160 Rect operator*(const Real& rhs)const { return Rect(*this)*=rhs; }
162 Rect operator/(const Real& rhs)const { return Rect(*this)/=rhs; }
164 Rect operator&(const Rect& rhs)const { return Rect(*this)&=rhs; }
166 Rect operator|(const Rect& rhs)const { return Rect(*this)|=rhs; }
168 bool operator&&(const Rect& rhs)const { return etl::intersect(*this, rhs); }
170 bool is_valid()const { return valid(); }
171 }; // END of class Rect
173 }; // END of namespace synfig
175 /* === E N D =============================================================== */