/usr/include/cegui-0.8.4/CEGUI/Rect.h is in libcegui-mk2-dev 0.8.4+dfsg-4ubuntu1.
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 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 | /***********************************************************************
created: 14/2/2011
author: Martin Preisler (reworked from code by Paul D Turner)
purpose: Defines 'Rect' class
*************************************************************************/
/***************************************************************************
* Copyright (C) 2004 - 2011 Paul D Turner & The CEGUI Development Team
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
* IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR
* OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
* ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
* OTHER DEALINGS IN THE SOFTWARE.
***************************************************************************/
#ifndef _CEGUIRect_h_
#define _CEGUIRect_h_
#include "CEGUI/Vector.h"
#include "CEGUI/Size.h"
// Start of CEGUI namespace section
namespace CEGUI
{
/*!
\brief
Class encapsulating operations on a Rectangle
*/
template<typename T>
class Rect:
public AllocatedObject<Rect<T> >
{
public:
typedef T value_type;
inline Rect()
{}
inline Rect(const T& left, const T& top, const T& right, const T& bottom):
d_min(left, top),
d_max(right, bottom)
{}
inline Rect(const Vector2<T>& min, const Vector2<T>& max):
d_min(min),
d_max(max)
{}
inline Rect(const Vector2<T>& pos, const Size<T>& size):
d_min(pos),
d_max(pos + Vector2<T>(size.d_width, size.d_height))
{}
inline Rect(const Rect& r):
d_min(r.d_min),
d_max(r.d_max)
{}
inline Rect& operator=(const Rect& rhs)
{
d_min = rhs.d_min;
d_max = rhs.d_max;
return *this;
}
inline void left(const T& v)
{
d_min.d_x = v;
}
inline const T& left() const
{
return d_min.d_x;
}
inline void top(const T& v)
{
d_min.d_y = v;
}
inline const T& top() const
{
return d_min.d_y;
}
inline void right(const T& v)
{
d_max.d_x = v;
}
inline const T& right() const
{
return d_max.d_x;
}
inline void bottom(const T& v)
{
d_max.d_y = v;
}
inline const T& bottom() const
{
return d_max.d_y;
}
/*!
\brief
set the position of the Rect (leaves size in tact)
*/
void setPosition(const Vector2<T>& min)
{
const Size<T> size = getSize();
d_min = min;
setSize(size);
}
/*!
\brief
Return top-left position of Rect as a Vector2<T>
*/
const Vector2<T>& getPosition() const
{
return d_min;
}
void setSize(const Size<T>& size)
{
d_max = d_min + Vector2<T>(size.d_width, size.d_height);
}
/*!
\brief
return the size of the Rect area
*/
inline Size<T> getSize() const
{
return Size<T>(getWidth(), getHeight());
}
void setWidth(const T& w)
{
d_max.d_x = d_min.d_x + w;
}
/*!
\brief
return width of Rect area
*/
inline T getWidth() const
{
return d_max.d_x - d_min.d_x;
}
void setHeight(const T& h)
{
d_max.d_y = d_min.d_y + h;
}
/*!
\brief
return height of Rect area
*/
inline T getHeight() const
{
return d_max.d_y - d_min.d_y;
}
/*!
\brief
return a Rect that is the intersection of 'this' Rect with the Rect 'rect'
\note
It can be assumed that if d_left == d_right, or d_top == d_bottom, or getWidth() == 0, or getHeight() == 0, then
'this' rect was totally outside 'rect'.
*/
inline Rect getIntersection(const Rect& rect) const
{
if ((d_max.d_x > rect.d_min.d_x) &&
(d_min.d_x < rect.d_max.d_x) &&
(d_max.d_y > rect.d_min.d_y) &&
(d_min.d_y < rect.d_max.d_y))
{
Rect ret;
// fill in ret with the intersection
ret.d_min.d_x = (d_min.d_x > rect.d_min.d_x) ? d_min.d_x : rect.d_min.d_x;
ret.d_max.d_x = (d_max.d_x < rect.d_max.d_x) ? d_max.d_x : rect.d_max.d_x;
ret.d_min.d_y = (d_min.d_y > rect.d_min.d_y) ? d_min.d_y : rect.d_min.d_y;
ret.d_max.d_y = (d_max.d_y < rect.d_max.d_y) ? d_max.d_y : rect.d_max.d_y;
return ret;
}
else
{
return Rect(0.0f, 0.0f, 0.0f, 0.0f);
}
}
/*!
\brief
Applies an offset the Rect object
\param pt
Vector2 object containing the offsets to be applied to the Rect.
\return
this Rect after the offset is performed
*/
inline void offset(const Vector2<T>& v)
{
d_min += v;
d_max += v;
}
/*!
\brief
Return true if the given Vector2 falls within this Rect
\param pt
Vector2 object describing the position to test.
\return
true if position \a pt is within this Rect's area, else false
*/
inline bool isPointInRect(const Vector2<T>& v) const
{
if ((d_min.d_x > v.d_x) ||
(d_max.d_x <= v.d_x) ||
(d_min.d_y > v.d_y) ||
(d_max.d_y <= v.d_y))
{
return false;
}
return true;
}
/*!
\brief
check the size of the Rect object and if it is bigger than \a sz, resize it so it isn't.
\param sz
Size object that describes the maximum dimensions that this Rect should be limited to.
\return
'this' Rect object after the constrain operation
*/
void constrainSizeMax(const Size<T>& size)
{
if (getWidth() > size.d_width)
{
setWidth(size.d_width);
}
if (getHeight() > size.d_height)
{
setHeight(size.d_height);
}
}
/*!
\brief
check the size of the Rect object and if it is smaller than \a sz, resize it so it isn't.
\param sz
Size object that describes the minimum dimensions that this Rect should be limited to.
\return
'this' Rect object after the constrain operation
*/
void constrainSizeMin(const Size<T>& size)
{
if (getWidth() < size.d_width)
{
setWidth(size.d_width);
}
if (getHeight() < size.d_height)
{
setHeight(size.d_height);
}
}
/*!
\brief
check the size of the Rect object and if it is bigger than \a max_sz or smaller than \a min_sz, resize it so it isn't.
\param max_sz
Size object that describes the maximum dimensions that this Rect should be limited to.
\param min_sz
Size object that describes the minimum dimensions that this Rect should be limited to.
\return
'this' Rect object after the constrain operation
*/
void constrainSize(const Size<T>& max_sz, const Size<T>& min_sz)
{
Size<T> curr_sz(getSize());
if (curr_sz.d_width > max_sz.d_width)
{
setWidth(max_sz.d_width);
}
else if (curr_sz.d_width < min_sz.d_width)
{
setWidth(min_sz.d_width);
}
if (curr_sz.d_height > max_sz.d_height)
{
setHeight(max_sz.d_height);
}
else if (curr_sz.d_height < min_sz.d_height)
{
setHeight(min_sz.d_height);
}
}
/*************************************************************************
Operators
*************************************************************************/
inline bool operator==(const Rect& rhs) const
{
return ((d_min == rhs.d_min) && (d_max == rhs.d_max));
}
inline bool operator!=(const Rect& rhs) const
{
return !operator==(rhs);
}
inline Rect operator*(T scalar) const
{
return Rect(d_min * scalar, d_max * scalar);
}
const Rect& operator*=(T scalar)
{
d_min *= scalar;
d_max *= scalar;
return *this;
}
Rect operator+(const Rect& r) const
{
return Rect(d_min + r.d_min, d_max + r.d_max);
}
inline friend std::ostream& operator << (std::ostream& s, const Rect& v)
{
s << "CEGUI::Rect<" << typeid(T).name() << ">(" << v.d_min.d_x << ", " << v.d_min.d_y << ", " << v.d_max.d_x << ", " << v.d_max.d_y << ")";
return s;
}
//! \brief finger saving alias for zero sized, zero positioned rect
inline static Rect zero()
{
return Rect(Vector2<T>::zero(), Size<T>::zero());
}
/*************************************************************************
Data Fields
*************************************************************************/
Vector2<T> d_min;
Vector2<T> d_max;
// d_min.d_x is former d_left
// d_min.d_y is former d_top
// d_max.d_x is former d_right
// d_max.d_y is former d_bottom
};
// the main reason for this is to keep C++ API in sync with other languages
typedef Rect<float> Rectf;
// we need to allow URect to be multiplied by floats, this is the most elegant way to do that
inline Rect<UDim> operator * (const Rect<UDim>& v, const float c)
{
return Rect<UDim>(v.d_min * c, v.d_max * c);
}
typedef Rect<UDim> URect;
} // End of CEGUI namespace section
#endif // end of guard _CEGUIRect_h_
|