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
|
/*
Copyright (C) 2013 Carl Hetherington <cth@carlh.net>
This file is part of DCP-o-matic.
DCP-o-matic 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.
DCP-o-matic 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 DCP-o-matic. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef DCPOMATIC_RECT_H
#define DCPOMATIC_RECT_H
#include "position.h"
#include <boost/optional.hpp>
#include <algorithm>
/* Put this inside a namespace as Apple put a Rect in the global namespace */
namespace dcpomatic
{
/** @struct Rect
* @brief A rectangle.
*/
template <class T>
class Rect
{
public:
Rect ()
: x (0)
, y (0)
, width (0)
, height (0)
{}
Rect (Position<T> p, T w_, T h_)
: x (p.x)
, y (p.y)
, width (w_)
, height (h_)
{}
Rect (T x_, T y_, T w_, T h_)
: x (x_)
, y (y_)
, width (w_)
, height (h_)
{}
T x;
T y;
T width;
T height;
Position<T> position () const
{
return Position<T> (x, y);
}
boost::optional<Rect<T> > intersection (Rect<T> const & other) const
{
/* This isn't exactly the paragon of mathematical precision */
T const tx = std::max (x, other.x);
T const ty = std::max (y, other.y);
Rect r (
tx, ty,
std::min (x + width, other.x + other.width) - tx,
std::min (y + height, other.y + other.height) - ty
);
if (r.width < 0 || r.height < 0) {
return boost::optional<Rect<T> > ();
}
return r;
}
void extend (Rect<T> const & other)
{
T old_x = x;
T old_y = y;
x = std::min (x, other.x);
y = std::min (y, other.y);
width = std::max (old_x + width, other.x + other.width) - x;
height = std::max (old_y + height, other.y + other.height) - y;
}
Rect<T> extended (T amount) const {
Rect<T> c = *this;
c.x -= amount;
c.y -= amount;
c.width += amount * 2;
c.height += amount * 2;
return c;
}
bool contains (Position<T> p) const
{
return (p.x >= x && p.x <= (x + width) && p.y >= y && p.y <= (y + height));
}
};
}
#endif
|
