-
Notifications
You must be signed in to change notification settings - Fork 89
Expand file tree
/
Copy pathContourTest.java
More file actions
237 lines (213 loc) · 8.4 KB
/
ContourTest.java
File metadata and controls
237 lines (213 loc) · 8.4 KB
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
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
package nodebox.graphics;
import java.util.List;
public class ContourTest extends GraphicsTestCase {
public void testPointAt() {
Contour c1 = new Contour();
c1.addPoint(0, 0);
c1.addPoint(100, 0);
assertEquals(new Point(0, 0), c1.pointAt(0));
assertEquals(new Point(50f, 0), c1.pointAt(0.5f));
assertEquals(new Point(100, 0), c1.pointAt(1f));
assertEquals(new Point(-50, 0), c1.pointAt(-0.5f));
assertEquals(new Point(150, 0), c1.pointAt(1.5f));
Contour c2 = new Contour();
c2.addPoint(new Point(0, 0, Point.LINE_TO));
c2.addPoint(new Point(0, 0, Point.CURVE_DATA));
c2.addPoint(new Point(100, 0, Point.CURVE_DATA));
c2.addPoint(new Point(100, 0, Point.CURVE_TO));
assertEquals(new Point(0, 0), c2.pointAt(0));
assertEquals(new Point(50f, 0), c2.pointAt(0.5f));
assertEquals(new Point(100, 0), c2.pointAt(1f));
//assertEquals(new Point(-50, 0), c2.pointAt(-0.5f));
//assertEquals(new Point(150, 0), c2.pointAt(1.5f));
}
public void testPointAtEmptyPath() {
Contour c = new Contour();
try {
c.pointAt(0.1f);
fail("Should have thrown an error.");
} catch (NodeBoxError e) {
}
c.addPoint(33, 44);
assertPointEquals(33, 44, c.pointAt(0.1f));
assertPointEquals(33, 44, c.pointAt(100f));
assertPointEquals(33, 44, c.pointAt(-12f));
}
public void testPointAtClosed() {
Contour c = new Contour();
c.addPoint(0, 0);
c.addPoint(SIDE, 0);
c.addPoint(SIDE, SIDE);
c.addPoint(0, SIDE);
assertEquals(SIDE * 3, c.getLength());
assertPointEquals(0, 0, c.pointAt(0f));
assertPointEquals(SIDE, SIDE / 2, c.pointAt(0.5f));
assertPointEquals(0, SIDE, c.pointAt(1f));
c.close();
assertEquals(SIDE * 4, c.getLength());
assertPointEquals(0, 0, c.pointAt(0f));
assertPointEquals(SIDE, SIDE, c.pointAt(0.5f));
assertPointEquals(0, 0, c.pointAt(1f));
}
public void testPointAtMultiple() {
Contour c1 = new Contour();
c1.addPoint(0, 0);
c1.addPoint(50, 0);
c1.addPoint(100, 0);
assertEquals(new Point(-50, 0), c1.pointAt(-0.5f));
assertEquals(new Point(0, 0), c1.pointAt(0));
assertEquals(new Point(25, 0), c1.pointAt(0.25f));
assertEquals(new Point(50, 0), c1.pointAt(0.5f));
assertEquals(new Point(60, 0), c1.pointAt(0.6f));
assertEquals(new Point(100, 0), c1.pointAt(1f));
assertEquals(new Point(150, 0), c1.pointAt(1.5f));
}
public void testLength() {
testLength(0, 0);
testLength(100, 200);
}
private void testLength(float x, float y) {
Contour c = new Contour();
c.addPoint(x, y);
c.addPoint(x + SIDE, y);
c.addPoint(x + SIDE, y + SIDE);
c.addPoint(x, y + SIDE);
assertEquals(SIDE * 3, c.getLength());
c.close();
assertEquals(SIDE * 4, c.getLength());
}
public void testMakePoints() {
Point[] points;
// A contour that is "open", which means it doesn't describe the last point.
Contour c = new Contour();
c.addPoint(0, 0);
c.addPoint(SIDE, 0);
c.addPoint(SIDE, SIDE);
c.addPoint(0, SIDE);
assertEquals(SIDE * 3, c.getLength());
points = c.makePoints(7);
assertPointEquals(0, 0, points[0]);
assertPointEquals(SIDE / 2, 0, points[1]);
assertPointEquals(SIDE, 0, points[2]);
assertPointEquals(0, SIDE, points[6]);
// Closing the contour will encrease the length of the path and thus will also
// have an effect on point positions.
c.close();
assertEquals(SIDE * 4, c.getLength());
points = c.makePoints(8);
assertEquals(new Point(0, 0), points[0]);
assertPointEquals(SIDE / 2, 0, points[1]);
assertPointEquals(SIDE, 0, points[2]);
assertPointEquals(0, SIDE, points[6]);
assertPointEquals(0, SIDE / 2, points[7]);
//
// // A contour that is "closed", which means that the last and first point are equal.
// Contour closedContour = new Contour();
// closedContour.addPoint(0, 0);
// closedContour.addPoint(50, 0);
// closedContour.addPoint(50, 50);
// closedContour.addPoint(0, 0);
// assertEquals(150f, closedContour.getLength());
// points = closedContour.makePoints(6);
// // The first and last points overlap.
// assertEquals(new Point(0, 0), points[0]);
// assertEquals(new Point(25, 0), points[1]);
// assertEquals(new Point(50, 0), points[2]);
// assertEquals(new Point(50, 25), points[3]);
// assertEquals(new Point(50, 50), points[4]);
// assertEquals(new Point(25, 25), points[5]);
// // Because the first and last points overlap, closing the contour has no effect.
// // The length does not increase.
// closedContour.close();
// assertEquals(150f, closedContour.getLength());
// // Point positions remain unchanged.
// points = closedContour.makePoints(6);
// assertEquals(new Point(0, 0), points[0]);
// assertEquals(new Point(25, 0), points[1]);
// assertEquals(new Point(50, 0), points[2]);
// assertEquals(new Point(50, 25), points[3]);
// assertEquals(new Point(50, 50), points[4]);
// assertEquals(new Point(25, 25), points[5]);
}
public void testMakePointsEmptyPath() {
Contour c = new Contour();
Point[] points = c.makePoints(10);
assertEquals(0, points.length);
}
public void testResample() {
Contour r;
List<Point> points;
Contour c1 = new Contour();
r = c1.resampleByAmount(10);
assertEquals(0, r.getPointCount());
assertFalse(r.isClosed());
Contour c2 = new Contour();
addRect(c2, 0, 0, SIDE, SIDE);
r = c2.resampleByAmount(4);
assertEquals(4, r.getPointCount());
assertFalse(r.isClosed());
points = r.getPoints();
assertPointEquals(0, 0, points.get(0));
assertPointEquals(SIDE, 0, points.get(1));
assertPointEquals(SIDE, SIDE, points.get(2));
assertPointEquals(0, SIDE, points.get(3));
c2.close();
r = c2.resampleByAmount(4);
assertEquals(4, r.getPointCount());
assertTrue(r.isClosed());
points = r.getPoints();
assertPointEquals(0, 0, points.get(0));
assertPointEquals(0, SIDE, points.get(3));
}
public void testResampleByLength() {
Contour r;
Contour c1 = new Contour();
r = c1.resampleByLength(1);
assertEquals(0, r.getPointCount());
assertFalse(r.isClosed());
Contour c2 = new Contour();
addRect(c2, 0, 0, SIDE, SIDE);
r = c2.resampleByLength(SIDE);
assertFalse(r.isClosed());
assertRectPoints(r, 0, 0, SIDE, SIDE);
c2.close();
r = c2.resampleByLength(SIDE);
assertTrue(r.isClosed());
assertRectPoints(r, 0, 0, SIDE, SIDE);
}
/**
* Contour uses a length cache to speed up pointAt, makePoints and resample operations.
* Check if the cache is properly invalidated.
*/
public void testCacheInvalidation() {
Contour c = new Contour();
c.addPoint(0, 0);
c.addPoint(50, 0);
assertEquals(50f, c.getLength());
// Manually change the last point.
Point lastPoint = c.getPoints().get(1);
lastPoint.x = 100;
// This change is not detected by the contour and thus the length is not updated.
assertEquals(50f, c.getLength());
// Manually invalidate the contour.
c.invalidate();
// This time, the length is correct.
assertEquals(100f, c.getLength());
}
/**
* Check the bounds for an empty contour.
*/
public void testEmptyBounds() {
Contour c = new Contour();
Rect r = c.getBounds();
assertEquals(new Rect(), r);
}
private void assertRectPoints(IGeometry g, float x, float y, float width, float height) {
assertEquals(4, g.getPointCount());
List<Point> points = g.getPoints();
assertPointEquals(x, y, points.get(0));
assertPointEquals(x + width, y, points.get(1));
assertPointEquals(x + width, y + height, points.get(2));
assertPointEquals(x, y + height, points.get(3));
}
}