OLD | NEW |
1 /* | 1 /* |
2 * Copyright 2011 Google Inc. | 2 * Copyright 2011 Google Inc. |
3 * | 3 * |
4 * Use of this source code is governed by a BSD-style license that can be | 4 * Use of this source code is governed by a BSD-style license that can be |
5 * found in the LICENSE file. | 5 * found in the LICENSE file. |
6 */ | 6 */ |
7 | 7 |
8 #include "Test.h" | 8 #include "Test.h" |
9 #include "TestClassDef.h" | |
10 #include "SkRegion.h" | 9 #include "SkRegion.h" |
11 #include "SkRandom.h" | 10 #include "SkRandom.h" |
12 | 11 |
13 static void Union(SkRegion* rgn, const SkIRect& rect) { | 12 static void Union(SkRegion* rgn, const SkIRect& rect) { |
14 rgn->op(rect, SkRegion::kUnion_Op); | 13 rgn->op(rect, SkRegion::kUnion_Op); |
15 } | 14 } |
16 | 15 |
17 #define TEST_NO_INTERSECT(rgn, rect) REPORTER_ASSERT(reporter, !rgn.intersect
s(rect)) | 16 #define TEST_NO_INTERSECT(rgn, rect) REPORTER_ASSERT(reporter, !rgn.intersect
s(rect)) |
18 #define TEST_INTERSECT(rgn, rect) REPORTER_ASSERT(reporter, rgn.intersects
(rect)) | 17 #define TEST_INTERSECT(rgn, rect) REPORTER_ASSERT(reporter, rgn.intersects
(rect)) |
19 #define TEST_NO_CONTAINS(rgn, rect) REPORTER_ASSERT(reporter, !rgn.contains(
rect)) | 18 #define TEST_NO_CONTAINS(rgn, rect) REPORTER_ASSERT(reporter, !rgn.contains(
rect)) |
(...skipping 228 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
248 rand_rect(&rect[j], rand); | 247 rand_rect(&rect[j], rand); |
249 } | 248 } |
250 REPORTER_ASSERT(reporter, test_rects(rect, N)); | 249 REPORTER_ASSERT(reporter, test_rects(rect, N)); |
251 } | 250 } |
252 | 251 |
253 test_proc(reporter, contains_proc); | 252 test_proc(reporter, contains_proc); |
254 test_proc(reporter, intersects_proc); | 253 test_proc(reporter, intersects_proc); |
255 test_empties(reporter); | 254 test_empties(reporter); |
256 test_fromchrome(reporter); | 255 test_fromchrome(reporter); |
257 } | 256 } |
OLD | NEW |