6663b6c9
 adorian
projet complet av...
|
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
|
#include <kandinsky/rect.h>
KDRect::KDRect(KDPoint p, KDSize s) :
m_x(p.x()), m_y(p.y()),
m_width(s.width()), m_height(s.height())
{
}
KDRect::KDRect(KDCoordinate x, KDCoordinate y, KDSize s) :
m_x(x), m_y(y),
m_width(s.width()), m_height(s.height())
{
}
KDRect::KDRect(KDPoint p, KDCoordinate width, KDCoordinate height) :
m_x(p.x()), m_y(p.y()),
m_width(width), m_height(height)
{
}
void KDRect::setOrigin(KDPoint p) { m_x = p.x(); m_y = p.y(); }
void KDRect::setSize(KDSize s) { m_width = s.width(); m_height = s.height(); }
bool KDRect::intersects(const KDRect & other) const {
return (
other.right() >= left() &&
other.left() <= right() &&
other.top() <= bottom() &&
other.bottom() >= top()
);
}
KDRect KDRect::intersectedWith(const KDRect & other) const {
if (!intersects(other)) {
return KDRectZero;
}
KDCoordinate intersectionLeft = max(left(), other.left());
KDCoordinate intersectionRight = min(right(), other.right());
KDCoordinate intersectionTop = max(top(), other.top());
KDCoordinate intersectionBottom = min(bottom(), other.bottom());
return KDRect(
intersectionLeft,
intersectionTop,
intersectionRight-intersectionLeft+1,
intersectionBottom-intersectionTop+1);
}
void computeUnionBound(KDCoordinate size1, KDCoordinate size2,
KDCoordinate * outputMin, KDCoordinate * outputMax,
KDCoordinate min1, KDCoordinate min2,
KDCoordinate max1, KDCoordinate max2)
{
if (size1 != 0) {
if (size2 != 0) {
*outputMin = min(min1, min2);
*outputMax = max(max1, max2);
} else {
*outputMin = min1;
*outputMax = max1;
}
} else {
if (size2 != 0) {
*outputMin = min2;
*outputMax = max2;
}
}
}
KDRect KDRect::unionedWith(const KDRect & other) const {
if (this->isEmpty()) {
return other;
}
if (other.isEmpty()) {
return *this;
}
/* We should ignore coordinate whose size is zero
* For example, if r1.height is zero, just ignore r1.y and r1.height. */
KDCoordinate resultLeft = 0;
KDCoordinate resultTop = 0;
KDCoordinate resultRight = 0;
KDCoordinate resultBottom = 0;
computeUnionBound(width(), other.width(),
&resultLeft, &resultRight,
left(), other.left(),
right(), other.right());
computeUnionBound(height(), other.height(),
&resultTop, &resultBottom,
top(), other.top(),
bottom(), other.bottom());
return KDRect(
resultLeft,
resultTop,
resultRight-resultLeft+1,
resultBottom-resultTop+1
);
}
KDRect KDRect::differencedWith(const KDRect & other) const {
if (this->isEmpty() || other.isEmpty()) {
return *this;
}
KDRect intersection = intersectedWith(other);
if (intersection.isEmpty()) {
return *this;
}
if (intersection == *this) {
return KDRectZero;
}
KDCoordinate resultLeft = left();
KDCoordinate resultTop = top();
KDCoordinate resultRight = right();
KDCoordinate resultBottom = bottom();
if (intersection.height() == height()) {
if (intersection.left() == left()) {
resultLeft = intersection.right() + 1;
} else if (intersection.right() == right()) {
resultRight = intersection.left() - 1;
}
} else if (intersection.width() == width()) {
if (intersection.top() == top()) {
resultTop = intersection.bottom() + 1;
} else if (intersection.bottom() == bottom()) {
resultBottom = intersection.top() - 1;
}
}
return KDRect(
resultLeft,
resultTop,
resultRight-resultLeft+1,
resultBottom-resultTop+1
);
}
bool KDRect::contains(KDPoint p) const {
return (p.x() >= x() && p.x() <= right() && p.y() >= y() && p.y() <= bottom());
}
bool KDRect::isAbove(KDPoint p) const {
return (p.y() >= y());
}
bool KDRect::isUnder(KDPoint p) const {
return (p.y() <= bottom());
}
KDRect KDRect::translatedBy(KDPoint p) const {
return KDRect(x() + p.x(), y() + p.y(), width(), height());
}
KDRect KDRect::movedTo(KDPoint p) const {
return KDRect(p.x(), p.y(), width(), height());
}
bool KDRect::isEmpty() const {
return (width() == 0 || height() == 0);
}
|