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
|
#include <quiz.h>
#include <kandinsky.h>
#include <assert.h>
QUIZ_CASE(kandinsky_rect_intersect) {
KDRect a(-5,-5, 10, 10);
KDRect b(0, 0, 10, 10);
assert(a.intersects(b));
assert(b.intersects(a));
KDRect c = a.intersectedWith(b);
KDRect result(0, 0, 5, 5);
assert(c == result);
c = b.intersectedWith(a);
assert(c == result);
}
QUIZ_CASE(kandinsky_rect_union) {
KDRect a(-5, -5, 10, 10);
KDRect b(0, 0, 10, 10);
KDRect c = a.unionedWith(b);
assert(c == KDRect(-5, -5, 15, 15));
}
QUIZ_CASE(kandinsky_rect_empty_union) {
KDRect a(1, 2, 3, 4);
KDRect b(5, 6, 0, 0);
KDRect c(-2, -1, 0, 1);
KDRect t = a.unionedWith(b);
assert(t == a);
t = b.unionedWith(a);
assert(t == a);
t = a.unionedWith(c);
assert(t == a);
}
QUIZ_CASE(kandinsky_rect_difference) {
KDRect a(-1, 0, 11, 2);
KDRect b(-4, -3, 4, 7);
KDRect c(3, -2, 1, 5);
KDRect d(7, -3, 5, 7);
KDRect e(-2, -1, 13, 5);
KDRect f(2, -4, 3, 3);
KDRect t = e.differencedWith(a);
assert(t == e);
t = a.differencedWith(e);
assert(t == KDRectZero);
t = f.differencedWith(d);
assert(t == f);
t = f.differencedWith(e);
assert(t == f);
t = b.differencedWith(e);
assert(t == b);
t = c.differencedWith(f);
assert(t == KDRect(3, -1, 1, 4));
t = c.differencedWith(a);
assert(t == c);
t = c.differencedWith(e);
assert(t == KDRect(3, -2, 1, 1));
t = a.differencedWith(b);
assert(t == KDRect(0, 0, 10, 2));
t = a.differencedWith(c);
assert(t == a);
t = a.differencedWith(d);
assert(t == KDRect(-1, 0, 8, 2));
}
|