caryclark@google.com | 9166dcb | 2013-04-08 11:50:00 +0000 | [diff] [blame] | 1 | /* |
| 2 | * Copyright 2012 Google Inc. |
| 3 | * |
| 4 | * Use of this source code is governed by a BSD-style license that can be |
| 5 | * found in the LICENSE file. |
| 6 | */ |
| 7 | #include "SkIntersections.h" |
| 8 | #include "SkPathOpsLine.h" |
| 9 | #include "Test.h" |
| 10 | |
| 11 | // FIXME: add tests for intersecting, non-intersecting, degenerate, coincident |
| 12 | static const SkDLine tests[][2] = { |
caryclark@google.com | a5e5592 | 2013-05-07 18:51:31 +0000 | [diff] [blame^] | 13 | {{{{192, 4}, {243, 4}}}, {{{246, 4}, {189, 4}}}}, |
| 14 | {{{{246, 4}, {189, 4}}}, {{{192, 4}, {243, 4}}}}, |
caryclark@google.com | 0361032 | 2013-04-18 15:58:21 +0000 | [diff] [blame] | 15 | {{{{5, 0}, {0, 5}}}, {{{5, 4}, {1, 4}}}}, |
caryclark@google.com | 9166dcb | 2013-04-08 11:50:00 +0000 | [diff] [blame] | 16 | {{{{0, 0}, {1, 0}}}, {{{1, 0}, {0, 0}}}}, |
| 17 | {{{{0, 0}, {0, 0}}}, {{{0, 0}, {1, 0}}}}, |
| 18 | {{{{0, 1}, {0, 1}}}, {{{0, 0}, {0, 2}}}}, |
| 19 | {{{{0, 0}, {1, 0}}}, {{{0, 0}, {2, 0}}}}, |
| 20 | {{{{1, 1}, {2, 2}}}, {{{0, 0}, {3, 3}}}}, |
| 21 | {{{{166.86950047022856, 112.69654129527828}, {166.86948801592692, 112.69655741235339}}}, |
| 22 | {{{166.86960700313026, 112.6965477747386}, {166.86925794355412, 112.69656471103423}}}} |
| 23 | }; |
| 24 | |
caryclark@google.com | ad65a3e | 2013-04-15 19:13:59 +0000 | [diff] [blame] | 25 | static const size_t tests_count = SK_ARRAY_COUNT(tests); |
caryclark@google.com | 9166dcb | 2013-04-08 11:50:00 +0000 | [diff] [blame] | 26 | |
| 27 | static const SkDLine noIntersect[][2] = { |
| 28 | {{{{0, 0}, {1, 0}}}, {{{3, 0}, {2, 0}}}}, |
| 29 | {{{{0, 0}, {0, 0}}}, {{{1, 0}, {2, 0}}}}, |
| 30 | {{{{0, 1}, {0, 1}}}, {{{0, 3}, {0, 2}}}}, |
| 31 | {{{{0, 0}, {1, 0}}}, {{{2, 0}, {3, 0}}}}, |
| 32 | {{{{1, 1}, {2, 2}}}, {{{4, 4}, {3, 3}}}}, |
| 33 | }; |
| 34 | |
caryclark@google.com | ad65a3e | 2013-04-15 19:13:59 +0000 | [diff] [blame] | 35 | static const size_t noIntersect_count = SK_ARRAY_COUNT(noIntersect); |
caryclark@google.com | 9166dcb | 2013-04-08 11:50:00 +0000 | [diff] [blame] | 36 | |
caryclark@google.com | a5e5592 | 2013-05-07 18:51:31 +0000 | [diff] [blame^] | 37 | static void check_results(skiatest::Reporter* reporter, const SkDLine& line1, const SkDLine& line2, |
| 38 | const SkIntersections& ts) { |
| 39 | for (int i = 0; i < ts.used(); ++i) { |
| 40 | SkDPoint result1 = line1.xyAtT(ts[0][i]); |
| 41 | SkDPoint result2 = line2.xyAtT(ts[1][i]); |
| 42 | if (!result1.approximatelyEqual(result2)) { |
| 43 | REPORTER_ASSERT(reporter, ts.used() != 1); |
| 44 | result2 = line2.xyAtT(ts[1][i ^ 1]); |
| 45 | REPORTER_ASSERT(reporter, result1.approximatelyEqual(result2)); |
| 46 | REPORTER_ASSERT(reporter, result1.approximatelyEqual(ts.pt(i).asSkPoint())); |
| 47 | } |
| 48 | } |
| 49 | } |
| 50 | |
caryclark@google.com | ad65a3e | 2013-04-15 19:13:59 +0000 | [diff] [blame] | 51 | static void PathOpsLineIntersectionTest(skiatest::Reporter* reporter) { |
caryclark@google.com | 9166dcb | 2013-04-08 11:50:00 +0000 | [diff] [blame] | 52 | size_t index; |
| 53 | for (index = 0; index < tests_count; ++index) { |
| 54 | const SkDLine& line1 = tests[index][0]; |
| 55 | const SkDLine& line2 = tests[index][1]; |
| 56 | SkIntersections ts; |
| 57 | int pts = ts.intersect(line1, line2); |
| 58 | REPORTER_ASSERT(reporter, pts); |
caryclark@google.com | a5e5592 | 2013-05-07 18:51:31 +0000 | [diff] [blame^] | 59 | REPORTER_ASSERT(reporter, pts == ts.used()); |
| 60 | check_results(reporter, line1, line2, ts); |
| 61 | if (line1[0] == line1[1] || line2[0] == line2[1]) { |
| 62 | continue; |
| 63 | } |
| 64 | if (line1[0].fY == line1[1].fY) { |
| 65 | double left = SkTMin(line1[0].fX, line1[1].fX); |
| 66 | double right = SkTMax(line1[0].fX, line1[1].fX); |
| 67 | ts.horizontal(line2, left, right, line1[0].fY, line1[0].fX != left); |
| 68 | check_results(reporter, line2, line1, ts); |
| 69 | } |
| 70 | if (line2[0].fY == line2[1].fY) { |
| 71 | double left = SkTMin(line2[0].fX, line2[1].fX); |
| 72 | double right = SkTMax(line2[0].fX, line2[1].fX); |
| 73 | ts.horizontal(line1, left, right, line2[0].fY, line2[0].fX != left); |
| 74 | check_results(reporter, line1, line2, ts); |
| 75 | } |
| 76 | if (line1[0].fX == line1[1].fX) { |
| 77 | double top = SkTMin(line1[0].fY, line1[1].fY); |
| 78 | double bottom = SkTMax(line1[0].fY, line1[1].fY); |
| 79 | ts.vertical(line2, top, bottom, line1[0].fX, line1[0].fY != top); |
| 80 | check_results(reporter, line2, line1, ts); |
| 81 | } |
| 82 | if (line2[0].fX == line2[1].fX) { |
| 83 | double top = SkTMin(line2[0].fY, line2[1].fY); |
| 84 | double bottom = SkTMax(line2[0].fY, line2[1].fY); |
| 85 | ts.vertical(line1, top, bottom, line2[0].fX, line2[0].fY != top); |
| 86 | check_results(reporter, line1, line2, ts); |
caryclark@google.com | 9166dcb | 2013-04-08 11:50:00 +0000 | [diff] [blame] | 87 | } |
| 88 | } |
| 89 | for (index = 0; index < noIntersect_count; ++index) { |
| 90 | const SkDLine& line1 = noIntersect[index][0]; |
| 91 | const SkDLine& line2 = noIntersect[index][1]; |
| 92 | SkIntersections ts; |
| 93 | int pts = ts.intersect(line1, line2); |
caryclark@google.com | a5e5592 | 2013-05-07 18:51:31 +0000 | [diff] [blame^] | 94 | REPORTER_ASSERT(reporter, !pts); |
| 95 | REPORTER_ASSERT(reporter, pts == ts.used()); |
| 96 | } |
caryclark@google.com | 9166dcb | 2013-04-08 11:50:00 +0000 | [diff] [blame] | 97 | } |
| 98 | |
| 99 | #include "TestClassDef.h" |
caryclark@google.com | ad65a3e | 2013-04-15 19:13:59 +0000 | [diff] [blame] | 100 | DEFINE_TESTCLASS_SHORT(PathOpsLineIntersectionTest) |