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
|
/*
* UltraStar Deluxe - Karaoke Game
*
* UltraStar Deluxe is the legal property of its developers, whose names
* are too numerous to list here. Please refer to the COPYRIGHT
* file distributed with this source distribution.
*
* This program 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 program 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.
*
* You should have received a copy of the GNU General Public License
* along with this program; see the file COPYING. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*
*/
#ifndef RECTANGLE_HPP
#define RECTANGLE_HPP
#include <algorithm>
#include "point.hpp"
#include "dimension.hpp"
namespace usdx
{
template <class T>
class Rectangle
{
private:
Point<T> point1;
Point<T> point2;
public:
Rectangle(T x1, T y1, T x2, T y2) :
point1(x1, y1), point2(x2, y2)
{
}
Rectangle(const Point<T>& point1, const Point<T>& point2) :
point1(point1), point2(point2)
{
}
Rectangle(const Point<T>& point1, T width, T height) :
point1(point1),
point2(point1.get_x() + width, point1.get_y() + height)
{
}
Rectangle(const Point<T>& point1, const Dimension<T>& dimension) :
point1(point1),
point2(point1.get_x() + dimension.get_width(),
point1.get_y() + dimension.get_height())
{
}
Rectangle(const Rectangle<T>& rectangle) :
point1(rectangle.point1), point2(rectangle.point2)
{
}
Point<T>& get_point1(void)
{
return point1;
}
Point<T>& get_point2(void)
{
return point2;
}
const T get_width(void) const
{
return std::abs(point2.get_x() - point1.get_x());
}
const T get_height(void) const
{
return std::abs(point2.get_y() - point1.get_y());
}
const T get_top(void) const
{
return std::min(point1.get_y(), point2.get_y());
}
void set_top(T value)
{
T height = get_height();
point1.set_y(value);
point2.set_y(value + height);
}
const T get_bottom(void) const
{
return std::max(point1.get_y(), point2.get_y());
}
const T get_left(void) const
{
return std::min(point1.get_x(), point2.get_x());
}
void set_left(T value)
{
T width = get_width();
point1.set_x(value);
point2.set_x(value + width);
}
const Dimension<T> get_dim() const
{
return Dimension<T> (get_width(), get_height());
}
const T get_right(void) const
{
return std::max(point1.get_x(), point2.get_x());
}
const Rectangle<T> intersect(const Rectangle<T>& inner) const
{
Rectangle<T> result(*this);
if (inner.point1.get_x() > result.point1.get_x()) {
result.point1.set_x(inner.point1.get_x());
}
if (inner.point1.get_y() > result.point1.get_y()) {
result.point1.set_y(inner.point1.get_y());
}
if (inner.point2.get_x() < result.point2.get_x()) {
result.point2.set_x(inner.point2.get_x());
}
if (inner.point2.get_y() < result.point2.get_y()) {
result.point2.set_y(inner.point2.get_y());
}
return result;
}
const Rectangle<T> operator+(const Point<T>& offset)
{
Rectangle<T> tmp(*this);
tmp += offset;
return tmp;
}
Rectangle<T>& operator+=(const Point<T>& offset)
{
T height = this->get_height();
T width = this->get_width();
T left = this->get_left() + offset.get_x();
T top = this->get_top() + offset.get_y();
this->point1 = Point<T>(left, top);
this->point2 = Point<T>(left + width, top + height);
return *this;
}
bool is_in(const Point<T>& p) const
{
if (p.get_x() < get_left())
return false;
if (p.get_x() > get_right())
return false;
if (p.get_y() < get_top())
return false;
if (p.get_y() > get_bottom())
return false;
return true;
}
};
}
#endif
|
