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 "PathOpsExtendedTest.h" 8 #include "PathOpsTestCommon.h" 9 #include "SkIntersections.h" 10 #include "SkPathOpsLine.h" 11 #include "SkPathOpsQuad.h" 12 #include "SkReduceOrder.h" 13 #include "Test.h" 14 15 static struct lineQuad { 16 QuadPts quad; 17 SkDLine line; 18 int result; 19 SkDPoint expected[2]; 20 } lineQuadTests[] = { 21 // quad line results 22 {{{{1, 1}, {2, 1}, {0, 2}}}, {{{0, 0}, {1, 1}}}, 1, {{1, 1}, {0, 0}} }, 23 {{{{0, 0}, {1, 1}, {3, 1}}}, {{{0, 0}, {3, 1}}}, 2, {{0, 0}, {3, 1}} }, 24 {{{{2, 0}, {1, 1}, {2, 2}}}, {{{0, 0}, {0, 2}}}, 0, {{0, 0}, {0, 0}} }, 25 {{{{4, 0}, {0, 1}, {4, 2}}}, {{{3, 1}, {4, 1}}}, 0, {{0, 0}, {0, 0}} }, 26 {{{{0, 0}, {0, 1}, {1, 1}}}, {{{0, 1}, {1, 0}}}, 1, {{.25, .75}, {0, 0}} }, 27 }; 28 29 static size_t lineQuadTests_count = SK_ARRAY_COUNT(lineQuadTests); 30 31 static int doIntersect(SkIntersections& intersections, const SkDQuad& quad, const SkDLine& line, 32 bool& flipped) { 33 int result; 34 flipped = false; 35 if (line[0].fX == line[1].fX) { 36 double top = line[0].fY; 37 double bottom = line[1].fY; 38 flipped = top > bottom; 39 if (flipped) { 40 SkTSwap<double>(top, bottom); 41 } 42 result = intersections.vertical(quad, top, bottom, line[0].fX, flipped); 43 } else if (line[0].fY == line[1].fY) { 44 double left = line[0].fX; 45 double right = line[1].fX; 46 flipped = left > right; 47 if (flipped) { 48 SkTSwap<double>(left, right); 49 } 50 result = intersections.horizontal(quad, left, right, line[0].fY, flipped); 51 } else { 52 intersections.intersect(quad, line); 53 result = intersections.used(); 54 } 55 return result; 56 } 57 58 static struct oneLineQuad { 59 QuadPts quad; 60 SkDLine line; 61 } oneOffs[] = { 62 {{{{97.9337616,100}, {88,112.94265}, {88,130}}}, 63 {{{88.919838,120}, {107.058823,120}}}}, 64 {{{{447.96701049804687, 894.4381103515625}, {448.007080078125, 894.4239501953125}, 65 {448.0140380859375, 894.4215087890625}}}, 66 {{{490.43548583984375, 879.40740966796875}, {405.59262084960937, 909.435546875}}}}, 67 {{{{142.589081, 102.283646}, {149.821579, 100}, {158, 100}}}, 68 {{{90, 230}, {160, 60}}}}, 69 {{{{1101, 10}, {1101, 8.3431453704833984}, {1099.828857421875, 7.1711997985839844}}}, 70 {{{1099.828857421875,7.1711711883544922}, {1099.121337890625,7.8786783218383789}}}}, 71 {{{{973, 507}, {973, 508.24264526367187}, {972.12158203125, 509.12161254882812}}}, 72 {{{930, 467}, {973, 510}}}}, 73 {{{{369.848602, 145.680267}, {382.360413, 121.298294}, {406.207703, 121.298294}}}, 74 {{{406.207703, 121.298294}, {348.781738, 123.864815}}}}, 75 }; 76 77 static size_t oneOffs_count = SK_ARRAY_COUNT(oneOffs); 78 79 static void testOneOffs(skiatest::Reporter* reporter) { 80 bool flipped = false; 81 for (size_t index = 0; index < oneOffs_count; ++index) { 82 const QuadPts& q = oneOffs[index].quad; 83 SkDQuad quad; 84 quad.debugSet(q.fPts); 85 SkASSERT(ValidQuad(quad)); 86 const SkDLine& line = oneOffs[index].line; 87 SkASSERT(ValidLine(line)); 88 SkIntersections intersections; 89 int result = doIntersect(intersections, quad, line, flipped); 90 for (int inner = 0; inner < result; ++inner) { 91 double quadT = intersections[0][inner]; 92 SkDPoint quadXY = quad.ptAtT(quadT); 93 double lineT = intersections[1][inner]; 94 SkDPoint lineXY = line.ptAtT(lineT); 95 if (!quadXY.approximatelyEqual(lineXY)) { 96 quadXY.approximatelyEqual(lineXY); 97 SkDebugf(""); 98 } 99 REPORTER_ASSERT(reporter, quadXY.approximatelyEqual(lineXY)); 100 } 101 } 102 } 103 104 DEF_TEST(PathOpsQuadLineIntersectionOneOff, reporter) { 105 testOneOffs(reporter); 106 } 107 108 DEF_TEST(PathOpsQuadLineIntersection, reporter) { 109 for (size_t index = 0; index < lineQuadTests_count; ++index) { 110 int iIndex = static_cast<int>(index); 111 const QuadPts& q = lineQuadTests[index].quad; 112 SkDQuad quad; 113 quad.debugSet(q.fPts); 114 SkASSERT(ValidQuad(quad)); 115 const SkDLine& line = lineQuadTests[index].line; 116 SkASSERT(ValidLine(line)); 117 SkReduceOrder reducer1, reducer2; 118 int order1 = reducer1.reduce(quad); 119 int order2 = reducer2.reduce(line); 120 if (order1 < 3) { 121 SkDebugf("%s [%d] quad order=%d\n", __FUNCTION__, iIndex, order1); 122 REPORTER_ASSERT(reporter, 0); 123 } 124 if (order2 < 2) { 125 SkDebugf("%s [%d] line order=%d\n", __FUNCTION__, iIndex, order2); 126 REPORTER_ASSERT(reporter, 0); 127 } 128 SkIntersections intersections; 129 bool flipped = false; 130 int result = doIntersect(intersections, quad, line, flipped); 131 REPORTER_ASSERT(reporter, result == lineQuadTests[index].result); 132 if (intersections.used() <= 0) { 133 continue; 134 } 135 for (int pt = 0; pt < result; ++pt) { 136 double tt1 = intersections[0][pt]; 137 REPORTER_ASSERT(reporter, tt1 >= 0 && tt1 <= 1); 138 SkDPoint t1 = quad.ptAtT(tt1); 139 double tt2 = intersections[1][pt]; 140 REPORTER_ASSERT(reporter, tt2 >= 0 && tt2 <= 1); 141 SkDPoint t2 = line.ptAtT(tt2); 142 if (!t1.approximatelyEqual(t2)) { 143 SkDebugf("%s [%d,%d] x!= t1=%1.9g (%1.9g,%1.9g) t2=%1.9g (%1.9g,%1.9g)\n", 144 __FUNCTION__, iIndex, pt, tt1, t1.fX, t1.fY, tt2, t2.fX, t2.fY); 145 REPORTER_ASSERT(reporter, 0); 146 } 147 if (!t1.approximatelyEqual(lineQuadTests[index].expected[0]) 148 && (lineQuadTests[index].result == 1 149 || !t1.approximatelyEqual(lineQuadTests[index].expected[1]))) { 150 SkDebugf("%s t1=(%1.9g,%1.9g)\n", __FUNCTION__, t1.fX, t1.fY); 151 REPORTER_ASSERT(reporter, 0); 152 } 153 } 154 } 155 } 156
