blob: 7d1bead824e04911cac23ba1b27af9a610aa2733 (
plain) (
blame)
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
|
/*
* The Mana Server
* Copyright (C) 2004-2010 The Mana World Development Team
*
* This file is part of The Mana Server.
*
* The Mana Server 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
* any later version.
*
* The Mana Server 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 The Mana Server. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef POINT_H
#define POINT_H
#include <algorithm>
/**
* A point in positive space. Usually represents pixel coordinates on a map.
*/
class Point
{
public:
Point():
x(0), y(0)
{}
Point(unsigned short X, unsigned short Y):
x(X), y(Y)
{}
unsigned short x; /**< x coordinate */
unsigned short y; /**< y coordinate */
/**
* Check whether the given point is within range of this point.
*/
bool inRangeOf(const Point &p, int radius) const
{
return std::abs(x - p.x) <= radius &&
std::abs(y - p.y) <= radius;
}
bool operator== (const Point &other) const
{
return (x == other.x && y == other.y);
}
bool operator!= (const Point &other) const
{
return (x != other.x || y != other.y);
}
};
/**
* A rectangle in positive space. Usually represents a pixel-based zone on a
* map.
*/
class Rectangle
{
public:
unsigned short x; /**< x coordinate */
unsigned short y; /**< y coordinate */
unsigned short w; /**< width */
unsigned short h; /**< height */
bool contains(const Point &p) const
{
return (unsigned short)(p.x - x) < w &&
(unsigned short)(p.y - y) < h;
}
bool intersects(const Rectangle &r) const
{
return x < (r.x + r.w) &&
y < (r.y + r.h) &&
x + w > r.x &&
y + h > r.y;
}
};
#endif // POINT_H
|
