/
rectf.hpp
149 lines (121 loc) · 3.22 KB
/
rectf.hpp
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
// SuperTux
// Copyright (C) 2006 Matthias Braun <matze@braunis.de>
//
// 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 3 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. If not, see <http://www.gnu.org/licenses/>.
#ifndef HEADER_SUPERTUX_MATH_RECTF_HPP
#define HEADER_SUPERTUX_MATH_RECTF_HPP
#include <assert.h>
#include "math/sizef.hpp"
#include "math/vector.hpp"
#include "object/anchor_point.hpp"
class Sizef;
/** This class represents a rectangle.
* (Implementation Note) We're using upper left and lower right point instead of
* upper left and width/height here, because that makes the collision detection
* a little bit more efficient.
*/
class Rectf
{
public:
Rectf() :
p1(),
p2()
{ }
Rectf(const Vector& np1, const Vector& np2) :
p1(np1), p2(np2)
{
}
Rectf(float x1, float y1, float x2, float y2) :
p1(x1, y1), p2(x2, y2)
{
assert(p1.x <= p2.x && p1.y <= p2.y);
}
Rectf(const Vector& p1_, const Sizef& size);
float get_left() const
{ return p1.x; }
float get_right() const
{ return p2.x; }
float get_top() const
{ return p1.y; }
float get_bottom() const
{ return p2.y; }
float get_width() const
{ return p2.x - p1.x; }
float get_height() const
{ return p2.y - p1.y; }
Vector get_middle() const
{ return Vector((p1.x+p2.x)/2, (p1.y+p2.y)/2); }
void set_pos(const Vector& v)
{
move(v-p1);
}
void set_height(float height)
{
p2.y = p1.y + height;
}
void set_width(float width)
{
p2.x = p1.x + width;
}
void set_size(float width, float height)
{
set_width(width);
set_height(height);
}
Sizef get_size() const
{
return Sizef(get_width(), get_height());
}
void move(const Vector& v)
{
p1 += v;
p2 += v;
}
bool contains(const Vector& v) const
{
return v.x >= p1.x && v.y >= p1.y && v.x < p2.x && v.y < p2.y;
}
bool contains(const Rectf& other) const
{
if(p1.x >= other.p2.x || other.p1.x >= p2.x)
return false;
if(p1.y >= other.p2.y || other.p1.y >= p2.y)
return false;
return true;
}
float distance (const Vector& other, AnchorPoint ap = ANCHOR_MIDDLE) const
{
Vector v = get_anchor_pos (*this, ap);
return ((v - other).norm ());
}
float distance (const Rectf& other, AnchorPoint ap = ANCHOR_MIDDLE) const
{
Vector v1 = get_anchor_pos (*this, ap);
Vector v2 = get_anchor_pos (other, ap);
return ((v1 - v2).norm ());
}
Rectf grown(float border) const
{
return Rectf(p1.x - border, p1.y - border,
p2.x + border, p2.y + border);
}
// leave these two public to save the headaches of set/get functions for such
// simple things :)
/// upper left edge
Vector p1;
/// lower right edge
Vector p2;
};
#endif
/* EOF */