/usr/include/ETL/_rect.h is in etl-dev 0.04.19-1.
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 | /*! ========================================================================
** Extended Template Library
** Rectangle Basic Class Implementation
** $Id$
**
** Copyright (c) 2002 Adrian Bentley
**
** 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.
**
** === N O T E S ===========================================================
**
** This is an internal header file, included by other ETL headers.
** You should not attempt to use it directly.
**
** ========================================================================= */
/* === S T A R T =========================================================== */
#ifndef __ETL__RECT_H
#define __ETL__RECT_H
/* === H E A D E R S ======================================================= */
#include <functional>
#include <algorithm>
/* === 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 ======================================= */
_ETL_BEGIN_NAMESPACE
template < typename T >
class rect
{
public: //type niceties
typedef T value_type;
public: //representation
value_type minx,maxx,miny,maxy;
public: //interface
rect() {}
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);
}
rect(const rect<T> &o)
:minx(o.minx),maxx(o.maxx),miny(o.miny),maxy(o.maxy)
{}
template < typename U >
rect(const rect<U> &o)
:minx(o.minx),maxx(o.maxx),miny(o.miny),maxy(o.maxy)
{}
void set_point(const value_type &x1,const value_type &y1)
{
minx = maxx = x1;
miny = maxy = y1;
}
void expand(const value_type &x1,const value_type &y1)
{
minx = std::min(minx,x1);
maxx = std::max(maxx,x1);
miny = std::min(miny,y1);
maxy = std::max(maxy,y1);
}
void set(const value_type &x1,const value_type &y1,
const value_type &x2,const value_type &y2)
{
minx = x1; maxx = x2;
miny = y1; maxy = y2;
}
//HACK HACK HACK (stupid compiler doesn't like default arguments of any type)
bool valid() const
{
return valid(std::less<T>());
}
template < typename F >
bool valid(const F & func) const
{
return func(minx,maxx) && func(miny,maxy);
}
};
template < typename T, typename F >
inline bool intersect(const rect<T> &r1, const rect<T> &r2, const F & func)
{
/* We wan to do the edge compare test
|-----|
|------| intersecting
|-----|
|-----| not intersecting
So we want to compare the mins of the one against the maxs of the other, and
visa versa
by default (exclude edge sharing) less will not be true if they are equal...
*/
return func(r1.minx,r2.maxx) &&
func(r2.minx,r1.maxx) &&
func(r1.miny,r2.maxy) &&
func(r2.miny,r1.maxy);
}
template < typename T >
inline bool intersect(const rect<T> &r1, const rect<T> &r2)
{
return intersect(r1,r2,std::less<T>());
}
template < typename T >
void set_intersect(rect<T> &rout, const rect<T> &r1, const rect<T> &r2)
{
//takes the intersection of the two rectangles
rout.minx = std::max(r1.minx,r2.minx);
rout.miny = std::max(r1.miny,r2.miny);
rout.maxx = std::min(r1.maxx,r2.maxx);
rout.maxy = std::min(r1.maxy,r2.maxy);
}
template < typename T >
void set_union(rect<T> &rout, const rect<T> &r1, const rect<T> &r2)
{
//takes the union of the two rectangles (bounds both... will contain extra info, but that's ok)
rout.set(
std::min(r1.minx,r2.minx),
std::min(r1.miny,r2.miny),
std::max(r1.maxx,r2.maxx),
std::max(r1.maxy,r2.maxy));
/*rect<T> local = r1;
rout.expand(r2.minx,r2.miny);
rout.expand(r2.maxx,r2.maxy);
rout = local;*/
}
_ETL_END_NAMESPACE
/* === E X T E R N S ======================================================= */
/* === E N D =============================================================== */
#endif
|