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
|
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
const { Point, Rect } = ChromeUtils.importESModule(
"resource://gre/modules/Geometry.sys.mjs"
);
function test() {
ok(Rect, "Rect class exists");
for (var fname in tests) {
tests[fname]();
}
}
var tests = {
testGetDimensions() {
let r = new Rect(5, 10, 100, 50);
ok(r.left == 5, "rect has correct left value");
ok(r.top == 10, "rect has correct top value");
ok(r.right == 105, "rect has correct right value");
ok(r.bottom == 60, "rect has correct bottom value");
ok(r.width == 100, "rect has correct width value");
ok(r.height == 50, "rect has correct height value");
ok(r.x == 5, "rect has correct x value");
ok(r.y == 10, "rect has correct y value");
},
testIsEmpty() {
let r = new Rect(0, 0, 0, 10);
ok(r.isEmpty(), "rect with nonpositive width is empty");
r = new Rect(0, 0, 10, 0);
ok(r.isEmpty(), "rect with nonpositive height is empty");
r = new Rect(0, 0, 10, 10);
ok(!r.isEmpty(), "rect with positive dimensions is not empty");
},
testRestrictTo() {
let r1 = new Rect(10, 10, 100, 100);
let r2 = new Rect(50, 50, 100, 100);
r1.restrictTo(r2);
ok(r1.equals(new Rect(50, 50, 60, 60)), "intersection is non-empty");
r1 = new Rect(10, 10, 100, 100);
r2 = new Rect(120, 120, 100, 100);
r1.restrictTo(r2);
ok(r1.isEmpty(), "intersection is empty");
r1 = new Rect(10, 10, 100, 100);
r2 = new Rect(0, 0, 0, 0);
r1.restrictTo(r2);
ok(r1.isEmpty(), "intersection of rect and empty is empty");
r1 = new Rect(0, 0, 0, 0);
r2 = new Rect(0, 0, 0, 0);
r1.restrictTo(r2);
ok(r1.isEmpty(), "intersection of empty and empty is empty");
},
testExpandToContain() {
let r1 = new Rect(10, 10, 100, 100);
let r2 = new Rect(50, 50, 100, 100);
r1.expandToContain(r2);
ok(
r1.equals(new Rect(10, 10, 140, 140)),
"correct expandToContain on intersecting rectangles"
);
r1 = new Rect(10, 10, 100, 100);
r2 = new Rect(120, 120, 100, 100);
r1.expandToContain(r2);
ok(
r1.equals(new Rect(10, 10, 210, 210)),
"correct expandToContain on non-intersecting rectangles"
);
r1 = new Rect(10, 10, 100, 100);
r2 = new Rect(0, 0, 0, 0);
r1.expandToContain(r2);
ok(
r1.equals(new Rect(10, 10, 100, 100)),
"expandToContain of rect and empty is rect"
);
r1 = new Rect(10, 10, 0, 0);
r2 = new Rect(0, 0, 0, 0);
r1.expandToContain(r2);
ok(r1.isEmpty(), "expandToContain of empty and empty is empty");
},
testSubtract: function testSubtract() {
function equals(rects1, rects2) {
return (
rects1.length == rects2.length &&
rects1.every(function (r, i) {
return r.equals(rects2[i]);
})
);
}
let r1 = new Rect(0, 0, 100, 100);
let r2 = new Rect(500, 500, 100, 100);
ok(
equals(r1.subtract(r2), [r1]),
"subtract area outside of region yields same region"
);
r1 = new Rect(0, 0, 100, 100);
r2 = new Rect(-10, -10, 50, 120);
ok(
equals(r1.subtract(r2), [new Rect(40, 0, 60, 100)]),
"subtracting vertical bar from edge leaves one rect"
);
r1 = new Rect(0, 0, 100, 100);
r2 = new Rect(-10, -10, 120, 50);
ok(
equals(r1.subtract(r2), [new Rect(0, 40, 100, 60)]),
"subtracting horizontal bar from edge leaves one rect"
);
r1 = new Rect(0, 0, 100, 100);
r2 = new Rect(40, 40, 20, 20);
ok(
equals(r1.subtract(r2), [
new Rect(0, 0, 40, 100),
new Rect(40, 0, 20, 40),
new Rect(40, 60, 20, 40),
new Rect(60, 0, 40, 100),
]),
"subtracting rect in middle leaves union of rects"
);
},
};
|
