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
|
/*
* Copyright (c) 2009-2016, Albertas Vyšniauskas
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
*
* * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
* * Neither the name of the software author nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
* IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
* OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef GPICK_RECT2_H_
#define GPICK_RECT2_H_
#include "Vector2.h"
namespace math
{
template<typename T>
struct Rect2
{
Rect2()
{
empty = true;
};
Rect2(const T &x1_, const T &y1_, const T &x2_, const T &y2_):
x1(x1_),
y1(y1_),
x2(x2_),
y2(y2_)
{
empty = false;
};
const Rect2 operator=(const Rect2 &rect)
{
x1 = rect.x1;
y1 = rect.y1;
x2 = rect.x2;
y2 = rect.y2;
empty = rect.empty;
return *this;
};
const Rect2 operator+(const Rect2 &rect) const
{
if (rect.empty) return *this;
if (empty) return rect;
Rect2 r;
if (x1 < rect.x1) r.x1 = x1;
else r.x1 = rect.x1;
if (y1 < rect.y1) r.y1 = y1;
else r.y1 = rect.y1;
if (x2 > rect.x2) r.x2 = x2;
else r.x2 = rect.x2;
if (y2 > rect.y2) r.y2 = y2;
else r.y2 = rect.y2;
return r;
};
const Rect2 operator+=(const Rect2 &rect)
{
*this = *this+rect;
return *this;
};
Rect2 impose(const Rect2 &rect) const
{
Rect2 r;
r.x1 = rect.x1 + x1 * rect.getWidth();
r.y1 = rect.y1 + y1 * rect.getHeight();
r.x2 = rect.x1 + x2 * rect.getWidth();
r.y2 = rect.y1 + y2 * rect.getHeight();
r.empty = false;
return r;
}
bool isInside(const T &x, const T &y) const
{
if (x < x1 || x > x2 || y < y1 || y > y2)
return false;
else
return true;
}
bool isInside(const Rect2 &r) const
{
if (empty || r.empty) return false;
if (x1 < r.x1 || x2 > r.x2) return false;
if (y1 < r.y1 || y2 > r.y2) return false;
return true;
}
Rect2 positionInside(const Rect2& rect) const
{
Rect2 r;
r.empty = false;
if (rect.x1 < x1){
r.x1 = x1;
r.x2 = x1 + rect.getWidth();
}else if (rect.x2 > x2){
r.x1 = x2 - rect.getWidth();
r.x2 = x2;
}else{
r.x1 = rect.x1;
r.x2 = rect.x2;
}
if (rect.y1 < y1){
r.y1 = y1;
r.y2 = y1 + rect.getHeight();
}else if (rect.y2 > y2){
r.y1 = y2 - rect.getHeight();
r.y2 = y2;
}else{
r.y1 = rect.y1;
r.y2 = rect.y2;
}
return r;
}
bool isEmpty() const
{
return empty;
};
const T& getX() const
{
return x1;
};
const T& getY() const
{
return y1;
};
T getWidth() const
{
return x2 - x1;
};
T getHeight() const
{
return y2 - y1;
};
T getCenterX() const
{
return (x1 + x2) / 2;
};
T getCenterY() const
{
return (y1 + y2) / 2;
};
const T& getLeft() const
{
return x1;
};
const T& getTop() const
{
return y1;
};
const T& getRight() const
{
return x2;
};
const T& getBottom() const
{
return y2;
};
Vec2<T> position() const
{
return Vec2<T>(x1, y1);
}
Vec2<T> center() const
{
return Vec2<T>((x1 + x2) / 2, (y1 + y2) / 2);
}
Vec2<T> size() const
{
return Vec2<T>(x2 - x1, y2 - y1);
}
private:
bool empty;
T x1, y1, x2, y2;
};
}
#endif /* GPICK_RECT2_H_ */
|
