/usr/include/crystalspace-2.0/csgeom/csrect.h is in libcrystalspace-dev 2.0+dfsg-1build1.
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 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 | /*
Crystal Space Engine: rectangle class interface
Copyright (C) 2001 by Jorrit Tyberghein
Copyright (C) 1998,1999 by Andrew Zabolotny <bit@eltech.ru>
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License as published by the Free Software Foundation; either
version 2 of the License, or (at your option) any later version.
This library 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
Library General Public License for more details.
You should have received a copy of the GNU Library General Public
License along with this library; if not, write to the Free
Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#ifndef __CS_RECT_H__
#define __CS_RECT_H__
/**\file
* Rectangle class
*/
/**
* \addtogroup geom_utils
* @{ */
#include "csextern.h"
/**
* Rectangle class: simple class for manipulating 2D rectangles.
* This class is somewhat similar to Box, but uses integer coordinates.<p>
* Example of a rectangle (xmin = 0, ymin = 0, xmax = 3, ymax = 2):
* <pre>
* 0 1 2 3 4 ...
* | | | | | |
* 0 --@@@@@@@@@@--+--+--
* @//|//|//@ | |
* 1 --@--+--+--@--+--+--
* @//|//|//@ | |
* 2 --@@@@@@@@@@--+--+--
* | | | | | |
* 3 --+--+--+--+--+--+--
* | | | | | |
*...--+--+--+--+--+--+--
* </pre>
* Vertical line 'X=3' and horizontal line 'Y=2' does NOT belong to
* the rectangle.
*/
class CS_CRYSTALSPACE_EXPORT csRect
{
public:
/// Rectangle bounds.
int xmin, ymin, xmax, ymax;
/// Create a empty rectangle.
csRect ();
/// Create a new rectangle.
csRect (int ixmin, int iymin, int ixmax, int iymax);
/// Copy constructor.
csRect (const csRect ©);
/// Destructor.
~csRect ();
/// Intersect with another rectangle.
void Intersect (int ixmin, int iymin, int ixmax, int iymax);
/// Intersect with another rectangle.
inline void Intersect (const csRect &other)
{ Intersect (other.xmin, other.ymin, other.xmax, other.ymax); }
/// Return true if rectangle intersects with target.
bool Intersects (const csRect &target) const;
/**
* Add a rectangle: find minimal rectangle
* that embeds both given rectangles.
*/
void Union (int ixmin, int iymin, int ixmax, int iymax);
/**
* Add a rectangle: find minimal rectangle
* that embeds both given rectangles.
*/
inline void Union (const csRect &other)
{ Union (other.xmin, other.ymin, other.xmax, other.ymax); }
/**
* Subtract rectangle: find the minimal rectangle which embeds all
* parts of this rectangle which are not covered by given rectangle.
* If rectangle is fully covered by argument, it becomes empty.
*/
void Exclude (int ixmin, int iymin, int ixmax, int iymax);
/// Same but works on a csRect argument
inline void Exclude (const csRect &other)
{ Exclude (other.xmin, other.ymin, other.xmax, other.ymax); }
/**
* Alternative subtraction: find maximal area of this rectangle that
* is not covered by argument.
*/
void Subtract (const csRect &rect);
/// Return true if rectangle is empty.
inline bool IsEmpty () const
{ return (xmin >= xmax) || (ymin >= ymax); }
/// Make rectangle empty.
inline void MakeEmpty ()
{ xmin = xmax = 0; }
/// Set rectangle to given ixmin,iymin,ixmax,iymax position.
inline void Set (int ixmin, int iymin, int ixmax, int iymax)
{
xmin = ixmin; xmax = ixmax;
ymin = iymin; ymax = iymax;
}
/// Copy rectangle.
inline void Set (const csRect &target)
{
xmin = target.xmin; xmax = target.xmax;
ymin = target.ymin; ymax = target.ymax;
}
/// Set rectangle xmin,ymin position.
inline void SetPos (int x, int y)
{
int w = Width(), h=Height();
xmin = x; ymin = y;
xmax = xmin+w;
ymax = ymin+h;
}
/// Set rectangle size.
inline void SetSize (int w, int h)
{ xmax = xmin + w; ymax = ymin + h; }
/// Move rectangle by deltaX, deltaY.
inline void Move (int dX, int dY)
{ xmin += dX; xmax += dX; ymin += dY; ymax += dY; }
/// Return the width of rectangle.
inline int Width () const { return xmax - xmin; }
/// Return the height of rectangle.
inline int Height () const { return ymax - ymin; }
/// Return true if a point lies within rectangle bounds.
inline bool Contains (int x, int y) const
{ return (x >= xmin) && (x < xmax) && (y >= ymin) && (y < ymax); }
/// Return true if a relative point lies within rectangle bounds.
inline bool ContainsRel (int x, int y) const
{ return (x >= 0) && (x < Width ()) && (y >= 0) && (y < Height ()); }
/// Return true if rectangle is the same.
inline bool Equal (int ixmin, int iymin, int ixmax, int iymax) const
{ return (xmin == ixmin) && (ymin == iymin) &&
(xmax == ixmax) && (ymax == iymax); }
/// Same but compare with another csRect
inline bool Equal (const csRect &other) const
{ return Equal (other.xmin, other.ymin, other.xmax, other.ymax); }
/// Normalize a rectangle such that xmin <= xmax and ymin <= ymax.
inline void Normalize ()
{
if (xmin > xmax) { int tmp = xmin; xmin = xmax; xmax = tmp; }
if (ymin > ymax) { int tmp = ymin; ymin = ymax; ymax = tmp; }
}
/// Return area of this rectangle.
inline int Area () const
{
if (IsEmpty ())
return 0;
else
return Width () * Height ();
}
/**
* Adds an adjacent rectangle if resulting rectangle will have a larger
* area.
*/
void AddAdjacent (const csRect &rect);
/// Test equality of two rectangles.
inline bool operator == (const csRect& rect) const
{
return Equal (rect);
}
/// Test inequality of two rectangles.
inline bool operator != (const csRect &rect) const
{
return !Equal (rect);
}
/// Extend rectangle so that it will include given point
inline void Extend (int x, int y)
{
if (xmin > x) xmin = x; if (xmax < x+1) xmax = x+1;
if (ymin > y) ymin = y; if (ymax < y+1) ymax = y+1;
}
/// Joins two rects by their minimum and maximum bounds
void Join (const csRect &rect);
/// Expands the whole rect by n units
void Outset(int n);
/// Contracts the whole rect by n units
void Inset(int n);
/**
* This function is the same as ClipLine() except that it doesn't
* check for two trivial cases (horizontal and vertical lines). It also
* doesn't check if the line is fully outside the box.
* Note: this function is only guaranteed to work correctly if the lines
* are not longer than an integer that fits in 16 bits.
*/
bool ClipLineGeneral (int& x1, int& y1, int& x2, int& y2);
/**
* Clip a line to make it fit to this rectangle. This algorithm
* is inclusive (the clipped line will touch the borders). If this
* function returns false the line is fully outside the rectangle.
* Note: this function is only guaranteed to work correctly if the lines
* are not longer than an integer that fits in 16 bits.
*/
bool ClipLine (int& x1, int& y1, int& x2, int& y2);
/**
* Clip a line to make it fit to this rectangle. This algorithm
* is inclusive (the clipped line will touch the borders). If this
* function returns false the line is fully outside the rectangle.
* Note: this function is guaranteed to work correctly even if the integer
* coordinates of the line are very big.
*/
bool ClipLineSafe (int& x1, int& y1, int& x2, int& y2);
};
/** @} */
#endif // __CS_RECT_H__
|