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
|
#include "RectangleUtil.hh"
#include <cstdio>
struct Rect {
int x() const { return m_x; }
int y() const { return m_y; }
int width() const { return m_width; }
int height() const { return m_height; }
int m_x, m_y, m_width, m_height;
};
int test_insideBorder() {
printf("testing RectangleUtil::insideBorder()\n");
struct _t {
struct Rect rect;
int x;
int y;
int bw;
int truth;
};
_t tests[] = {
{ { 0, 0, 10, 10 }, 0, 0, 2, false }, // on the (outer) edge
{ { 0, 0, 10, 10 }, 1, 1, 2, false }, // on the (inner) edge
{ { 0, 0, 10, 10 }, 5, 5, 2, true }, // really inside
{ { 0, 0, 10, 10 }, -5, 0, 2, false }, // somewhere outside
{ { 0, 0, 10, 10 }, 20, 20, 2, false } // outside for sure
};
int i;
for (i = 0; i < sizeof(tests)/sizeof(_t); ++i) {
const _t& t = tests[i];
int result = RectangleUtil::insideBorder<Rect>(t.rect, t.x, t.y, t.bw);
printf(" %d: is (%02d|%02d) inside [%d %d]-[%d %d] with border %d: %s, %s\n",
i,
t.x, t.y,
t.rect.x(), t.rect.y(),
t.rect.x() + (int)t.rect.width(),
t.rect.y() + (int)t.rect.height(),
t.bw,
result ? "yes" : "no", result == t.truth ? "ok" : "failed");
}
printf("done.\n");
return 0;
}
int test_overlapRectangles() {
printf("testing RectangleUtil::overlapRectangles()\n");
struct _t {
struct Rect a;
struct Rect b;
int truth;
};
struct _test {
bool operator()(const Rect& a, const Rect& b, int truth, int i) {
int result = RectangleUtil::overlapRectangles(a, b);
printf(" %d: [%2d %2d]-[%2d %2d] %s [%2d %2d]-[%2d %2d]: %s\n",
i,
a.x(), a.y(),
a.x() + (int)a.width(),
a.y() + (int)a.height(),
result ? "overlaps" : "does not overlap",
b.x(), b.y(),
b.x() + (int)b.width(),
b.y() + (int)b.height(),
result == truth ? "ok" : "failed");
return result == truth;
}
};
const _t tests[] = {
{ { 0, 0, 8, 8 }, { 0, 0, 8, 8 }, true }, // b equals a
{ { 0, 0, 8, 8 }, { 3, 3, 3, 3 }, true }, // b completely inside a
{ { 0, 0, 8, 8 }, { 4, 4, 8, 8 }, true }, // b overlaps a in one corner
{ { 0, 0, 8, 8 }, { 4,-1, 2, 9 }, true }, // b overlaps a in the middle
{ { 0, 0, 8, 8 }, { -8, 0, 5, 8 }, false }, // b completely left from a
{ { 0, 0, 8, 8 }, { 9, 0, 5, 8 }, false }, // b completely right from a
{ { 0, 0, 8, 8 }, { 0,-9, 5, 8 }, false }, // b completely down below a
{ { 0, 0, 8, 8 }, { 0, 9, 5, 8 }, false }, // b completely up above a
};
_test test;
int i;
for (i = 0; i < sizeof(tests)/sizeof(_t); ++i) {
test(tests[i].a, tests[i].b, tests[i].truth, i);
test(tests[i].b, tests[i].a, tests[i].truth, i);
}
printf("done.\n");
return 0;
}
int main(int argc, char **argv) {
test_insideBorder();
test_overlapRectangles();
return 0;
}
|
