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 "PathOpsTestCommon.h" 8 #include "SkIntersections.h" 9 #include "SkPathOpsLine.h" 10 #include "Test.h" 11 12 // FIXME: add tests for intersecting, non-intersecting, degenerate, coincident 13 static const SkDLine tests[][2] = { 14 {{{{30,20}, {30,50}}}, {{{24,30}, {36,30}}}}, 15 {{{{323,193}, {-317,193}}}, {{{0,994}, {0,0}}}}, 16 {{{{90,230}, {160,60}}}, {{{60,120}, {260,120}}}}, 17 {{{{90,230}, {160,60}}}, {{{181.176468,120}, {135.294128,120}}}}, 18 {{{{181.1764678955078125f, 120}, {186.3661956787109375f, 134.7042236328125f}}}, 19 {{{175.8309783935546875f, 141.5211334228515625f}, {187.8782806396484375f, 133.7258148193359375f}}}}, 20 #if 0 // FIXME: these fail because one line is too short and appears quasi-coincident 21 {{{{158.000000, 926.000000}, {1108.00000, 926.000000}}}, 22 {{{1108.00000, 926.000000}, {1108.00000, 925.999634}}}}, 23 {{{{1108,926}, {1108,925.9996337890625}}}, {{{158,926}, {1108,926}}}}, 24 #endif 25 {{{{192, 4}, {243, 4}}}, {{{246, 4}, {189, 4}}}}, 26 {{{{246, 4}, {189, 4}}}, {{{192, 4}, {243, 4}}}}, 27 {{{{5, 0}, {0, 5}}}, {{{5, 4}, {1, 4}}}}, 28 {{{{0, 0}, {1, 0}}}, {{{1, 0}, {0, 0}}}}, 29 {{{{0, 0}, {0, 0}}}, {{{0, 0}, {1, 0}}}}, 30 {{{{0, 1}, {0, 1}}}, {{{0, 0}, {0, 2}}}}, 31 {{{{0, 0}, {1, 0}}}, {{{0, 0}, {2, 0}}}}, 32 {{{{1, 1}, {2, 2}}}, {{{0, 0}, {3, 3}}}}, 33 {{{{166.86950047022856, 112.69654129527828}, {166.86948801592692, 112.69655741235339}}}, 34 {{{166.86960700313026, 112.6965477747386}, {166.86925794355412, 112.69656471103423}}}} 35 }; 36 37 static const size_t tests_count = SK_ARRAY_COUNT(tests); 38 39 static const SkDLine noIntersect[][2] = { 40 {{{{(double) (2 - 1e-6f),2}, {(double) (2 - 1e-6f),4}}}, 41 {{{2,1}, {2,3}}}}, 42 43 {{{{0, 0}, {1, 0}}}, {{{3, 0}, {2, 0}}}}, 44 {{{{0, 0}, {0, 0}}}, {{{1, 0}, {2, 0}}}}, 45 {{{{0, 1}, {0, 1}}}, {{{0, 3}, {0, 2}}}}, 46 {{{{0, 0}, {1, 0}}}, {{{2, 0}, {3, 0}}}}, 47 {{{{1, 1}, {2, 2}}}, {{{4, 4}, {3, 3}}}}, 48 }; 49 50 static const size_t noIntersect_count = SK_ARRAY_COUNT(noIntersect); 51 52 static const SkDLine coincidentTests[][2] = { 53 {{{{0,482.5}, {-4.4408921e-016,682.5}}}, 54 {{{0,683}, {0,482}}}}, 55 56 {{{{1.77635684e-015,312}, {-1.24344979e-014,348}}}, 57 {{{0,348}, {0,312}}}}, 58 59 {{{{979.304871, 561}, {1036.69507, 291}}}, 60 {{{985.681519, 531}, {982.159790, 547.568542}}}}, 61 62 {{{{232.159805, 547.568542}, {235.681549, 531}}}, 63 {{{286.695129,291}, {229.304855,561}}}}, 64 65 {{{{186.3661956787109375f, 134.7042236328125f}, {187.8782806396484375f, 133.7258148193359375f}}}, 66 {{{175.8309783935546875f, 141.5211334228515625f}, {187.8782806396484375f, 133.7258148193359375f}}}}, 67 68 {{{{235.681549, 531.000000}, {280.318420, 321.000000}}}, 69 {{{286.695129, 291.000000}, {229.304855, 561.000000}}}}, 70 }; 71 72 static const size_t coincidentTests_count = SK_ARRAY_COUNT(coincidentTests); 73 74 static void check_results(skiatest::Reporter* reporter, const SkDLine& line1, const SkDLine& line2, 75 const SkIntersections& ts) { 76 for (int i = 0; i < ts.used(); ++i) { 77 SkDPoint result1 = line1.ptAtT(ts[0][i]); 78 SkDPoint result2 = line2.ptAtT(ts[1][i]); 79 if (!result1.approximatelyEqual(result2)) { 80 REPORTER_ASSERT(reporter, ts.used() != 1); 81 result2 = line2.ptAtT(ts[1][i ^ 1]); 82 REPORTER_ASSERT(reporter, result1.approximatelyEqual(result2)); 83 REPORTER_ASSERT(reporter, result1.approximatelyEqual(ts.pt(i).asSkPoint())); 84 } 85 } 86 } 87 88 static void testOne(skiatest::Reporter* reporter, const SkDLine& line1, const SkDLine& line2) { 89 SkASSERT(ValidLine(line1)); 90 SkASSERT(ValidLine(line2)); 91 SkIntersections i; 92 int pts = i.intersect(line1, line2); 93 REPORTER_ASSERT(reporter, pts); 94 REPORTER_ASSERT(reporter, pts == i.used()); 95 check_results(reporter, line1, line2, i); 96 if (line1[0] == line1[1] || line2[0] == line2[1]) { 97 return; 98 } 99 if (line1[0].fY == line1[1].fY) { 100 double left = SkTMin(line1[0].fX, line1[1].fX); 101 double right = SkTMax(line1[0].fX, line1[1].fX); 102 SkIntersections ts; 103 ts.horizontal(line2, left, right, line1[0].fY, line1[0].fX != left); 104 check_results(reporter, line2, line1, ts); 105 } 106 if (line2[0].fY == line2[1].fY) { 107 double left = SkTMin(line2[0].fX, line2[1].fX); 108 double right = SkTMax(line2[0].fX, line2[1].fX); 109 SkIntersections ts; 110 ts.horizontal(line1, left, right, line2[0].fY, line2[0].fX != left); 111 check_results(reporter, line1, line2, ts); 112 } 113 if (line1[0].fX == line1[1].fX) { 114 double top = SkTMin(line1[0].fY, line1[1].fY); 115 double bottom = SkTMax(line1[0].fY, line1[1].fY); 116 SkIntersections ts; 117 ts.vertical(line2, top, bottom, line1[0].fX, line1[0].fY != top); 118 check_results(reporter, line2, line1, ts); 119 } 120 if (line2[0].fX == line2[1].fX) { 121 double top = SkTMin(line2[0].fY, line2[1].fY); 122 double bottom = SkTMax(line2[0].fY, line2[1].fY); 123 SkIntersections ts; 124 ts.vertical(line1, top, bottom, line2[0].fX, line2[0].fY != top); 125 check_results(reporter, line1, line2, ts); 126 } 127 reporter->bumpTestCount(); 128 } 129 130 static void testOneCoincident(skiatest::Reporter* reporter, const SkDLine& line1, 131 const SkDLine& line2) { 132 SkASSERT(ValidLine(line1)); 133 SkASSERT(ValidLine(line2)); 134 SkIntersections ts; 135 int pts = ts.intersect(line1, line2); 136 REPORTER_ASSERT(reporter, pts == 2); 137 REPORTER_ASSERT(reporter, pts == ts.used()); 138 check_results(reporter, line1, line2, ts); 139 if (line1[0] == line1[1] || line2[0] == line2[1]) { 140 return; 141 } 142 if (line1[0].fY == line1[1].fY) { 143 double left = SkTMin(line1[0].fX, line1[1].fX); 144 double right = SkTMax(line1[0].fX, line1[1].fX); 145 SkIntersections ts; 146 ts.horizontal(line2, left, right, line1[0].fY, line1[0].fX != left); 147 REPORTER_ASSERT(reporter, pts == 2); 148 REPORTER_ASSERT(reporter, pts == ts.used()); 149 check_results(reporter, line2, line1, ts); 150 } 151 if (line2[0].fY == line2[1].fY) { 152 double left = SkTMin(line2[0].fX, line2[1].fX); 153 double right = SkTMax(line2[0].fX, line2[1].fX); 154 SkIntersections ts; 155 ts.horizontal(line1, left, right, line2[0].fY, line2[0].fX != left); 156 REPORTER_ASSERT(reporter, pts == 2); 157 REPORTER_ASSERT(reporter, pts == ts.used()); 158 check_results(reporter, line1, line2, ts); 159 } 160 if (line1[0].fX == line1[1].fX) { 161 double top = SkTMin(line1[0].fY, line1[1].fY); 162 double bottom = SkTMax(line1[0].fY, line1[1].fY); 163 SkIntersections ts; 164 ts.vertical(line2, top, bottom, line1[0].fX, line1[0].fY != top); 165 REPORTER_ASSERT(reporter, pts == 2); 166 REPORTER_ASSERT(reporter, pts == ts.used()); 167 check_results(reporter, line2, line1, ts); 168 } 169 if (line2[0].fX == line2[1].fX) { 170 double top = SkTMin(line2[0].fY, line2[1].fY); 171 double bottom = SkTMax(line2[0].fY, line2[1].fY); 172 SkIntersections ts; 173 ts.vertical(line1, top, bottom, line2[0].fX, line2[0].fY != top); 174 REPORTER_ASSERT(reporter, pts == 2); 175 REPORTER_ASSERT(reporter, pts == ts.used()); 176 check_results(reporter, line1, line2, ts); 177 } 178 reporter->bumpTestCount(); 179 } 180 181 static void PathOpsLineIntersectionTest(skiatest::Reporter* reporter) { 182 size_t index; 183 for (index = 0; index < coincidentTests_count; ++index) { 184 const SkDLine& line1 = coincidentTests[index][0]; 185 const SkDLine& line2 = coincidentTests[index][1]; 186 testOneCoincident(reporter, line1, line2); 187 } 188 for (index = 0; index < tests_count; ++index) { 189 const SkDLine& line1 = tests[index][0]; 190 const SkDLine& line2 = tests[index][1]; 191 testOne(reporter, line1, line2); 192 } 193 for (index = 0; index < noIntersect_count; ++index) { 194 const SkDLine& line1 = noIntersect[index][0]; 195 const SkDLine& line2 = noIntersect[index][1]; 196 SkIntersections ts; 197 int pts = ts.intersect(line1, line2); 198 REPORTER_ASSERT(reporter, !pts); 199 REPORTER_ASSERT(reporter, pts == ts.used()); 200 reporter->bumpTestCount(); 201 } 202 } 203 204 static void PathOpsLineIntersectionOneOffTest(skiatest::Reporter* reporter) { 205 int index = 0; 206 SkASSERT(index < (int) tests_count); 207 testOne(reporter, tests[index][0], tests[index][1]); 208 testOne(reporter, tests[1][0], tests[1][1]); 209 } 210 211 static void PathOpsLineIntersectionOneCoincidentTest(skiatest::Reporter* reporter) { 212 int index = 0; 213 SkASSERT(index < (int) coincidentTests_count); 214 const SkDLine& line1 = coincidentTests[index][0]; 215 const SkDLine& line2 = coincidentTests[index][1]; 216 testOneCoincident(reporter, line1, line2); 217 } 218 219 #include "TestClassDef.h" 220 DEFINE_TESTCLASS_SHORT(PathOpsLineIntersectionTest) 221 222 DEFINE_TESTCLASS_SHORT(PathOpsLineIntersectionOneOffTest) 223 224 DEFINE_TESTCLASS_SHORT(PathOpsLineIntersectionOneCoincidentTest) 225
