/usr/include/synfig-1.0/synfig/rect.h is in libsynfig-dev 1.0.2-1+b6.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 | /* === S Y N F I G ========================================================= */
/*! \file rect.h
** \brief Rectangle Class
**
** $Id$
**
** \legal
** Copyright (c) 2002-2005 Robert B. Quattlebaum Jr., Adrian Bentley
** Copyright (c) 2007, 2008 Chris Moore
**
** This package is free software; you can redistribute it and/or
** modify it under the terms of the GNU General Public License as
** published by the Free Software Foundation; either version 2 of
** the License, or (at your option) any later version.
**
** This package is distributed in the hope that it will be useful,
** but WITHOUT ANY WARRANTY; without even the implied warranty of
** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
** General Public License for more details.
** \endlegal
*/
/* ========================================================================= */
/* === S T A R T =========================================================== */
#ifndef __SYNFIG_RECT_H
#define __SYNFIG_RECT_H
/* === H E A D E R S ======================================================= */
#include <ETL/rect>
#include "real.h"
#include "vector.h"
#include <limits>
#include <cmath>
/* === M A C R O S ========================================================= */
/* === T Y P E D E F S ===================================================== */
/* === C L A S S E S & S T R U C T S ======================================= */
namespace synfig {
class Rect : public etl::rect<Real>
{
public:
using etl::rect<Real>::set_point;
using etl::rect<Real>::expand;
using etl::rect<Real>::set;
static Rect full_plane();
static Rect horizontal_strip(const value_type &y1, const value_type &y2);
static Rect vertical_strip(const value_type &x1, const value_type &x2);
static Rect zero()
{
return Rect(
0,
0,
0,
0
);
}
static Rect infinite()
{
return Rect(
-INFINITY,
-INFINITY,
INFINITY,
INFINITY
);
}
Rect() { }
Rect(const Point& x) { set_point(x); }
Rect(const Point& min, const Point& max) { set_point(min); expand(max); }
Rect(const value_type &x1,const value_type &y1) { set_point(x1,y1); }
Rect(const value_type &x1,const value_type &y1,
const value_type &x2,const value_type &y2)
{
set_point(x1,y1);
expand(x2,y2);
}
void set_point(const Point& max) { set_point(max[0],max[1]); }
Rect& expand(const Point& max) { expand(max[0],max[1]); return *this; }
Rect& expand(const Real& r) { minx-=r; miny-=r; maxx+=r; maxy+=r; return *this; }
Rect& expand_x(const Real& r) { minx-=r; maxx+=r; return *this; }
Rect& expand_y(const Real& r) { miny-=r; maxy+=r; return *this; }
Rect& set(const Point& min,const Point& max) { set(min[0],min[1],max[0],max[1]); return *this; }
Point get_min()const { return Point(minx,miny); }
Point get_max()const { return Point(maxx,maxy); }
bool is_inside(const Point& x) { return x[0]>minx && x[0]<maxx && x[1]>miny && x[1]<maxy; }
Real area()const
{
return (maxx-minx)*(maxy-miny);
}
// Operators
Rect& operator+=(const Vector& rhs)
{
minx+=rhs[0]; miny+=rhs[1];
maxx+=rhs[0]; maxy+=rhs[1];
return *this;
}
Rect& operator-=(const Vector& rhs)
{
minx-=rhs[0]; miny-=rhs[1];
maxx-=rhs[0]; maxy-=rhs[1];
return *this;
}
Rect& operator*=(const Real& rhs)
{
minx*=rhs; miny*=rhs;
maxx*=rhs; maxy*=rhs;
return *this;
}
Rect& operator/=(Real rhs)
{
rhs=1.0/rhs; // Avoid doing several divisions
minx*=rhs; miny*=rhs;
maxx*=rhs; maxy*=rhs;
return *this;
}
Rect& operator&=(const Rect& rhs)
{
if(rhs.area()>0.00000001 && area()>0.00000001)
etl::set_intersect(*this,*this,rhs);
else
*this=zero();
return *this;
}
Rect& operator|=(const Rect& rhs)
{
if(rhs.area()>0.00000001 && area()>0.00000001)
etl::set_union(*this,*this,rhs);
else
{
if(area()<rhs.area())
*this=rhs;
}
return *this;
}
Rect operator+(const Vector& rhs)const { return Rect(*this)+=rhs; }
Rect operator-(const Vector& rhs)const { return Rect(*this)-=rhs; }
Rect operator*(const Real& rhs)const { return Rect(*this)*=rhs; }
Rect operator/(const Real& rhs)const { return Rect(*this)/=rhs; }
Rect operator&(const Rect& rhs)const { return Rect(*this)&=rhs; }
Rect operator|(const Rect& rhs)const { return Rect(*this)|=rhs; }
bool operator&&(const Rect& rhs)const { return etl::intersect(*this, rhs); }
bool operator==(const Rect &rhs)const { return get_min() == rhs.get_min() && get_max() == rhs.get_max(); }
bool operator!=(const Rect &rhs)const { return get_min() != rhs.get_min() || get_max() != rhs.get_max(); }
bool is_valid()const { return valid(); }
Rect multiply_coords(const Vector &rhs) const
{ return Rect(minx*rhs[0], miny*rhs[1], maxx*rhs[0], maxy*rhs[1]); }
Rect divide_coords(const Vector &rhs) const
{ return Rect(minx/rhs[0], miny/rhs[1], maxx/rhs[0], maxy/rhs[1]); }
}; // END of class Rect
}; // END of namespace synfig
/* === E N D =============================================================== */
#endif
|