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 "SkPathOpsCubic.h" 10 #include "SkPathOpsLine.h" 11 #include "SkReduceOrder.h" 12 #include "Test.h" 13 14 static struct lineCubic { 15 SkDCubic cubic; 16 SkDLine line; 17 } lineCubicTests[] = { 18 {{{{154,715}, {151.238571,715}, {149,712.761414}, {149,710}}}, 19 {{{149,675}, {149,710.001465}}}}, 20 21 {{{{0,1}, {1,6}, {4,1}, {4,3}}}, 22 {{{6,1}, {1,4}}}}, 23 24 {{{{0,1}, {2,6}, {4,1}, {5,4}}}, 25 {{{6,2}, {1,4}}}}, 26 27 {{{{0,4}, {3,4}, {6,2}, {5,2}}}, 28 {{{4,3}, {2,6}}}}, 29 #if 0 30 {{{{258, 122}, {260.761414, 122}, { 263, 124.238579}, {263, 127}}}, 31 {{{259.82843, 125.17157}, {261.535522, 123.46447}}}}, 32 #endif 33 {{{{1006.6951293945312,291}, {1023.263671875,291}, {1033.8402099609375,304.43145751953125}, 34 {1030.318359375,321}}}, 35 {{{979.30487060546875,561}, {1036.695068359375,291}}}}, 36 {{{{259.30487060546875,561}, {242.73631286621094,561}, {232.15980529785156,547.56854248046875}, 37 {235.68154907226562,531}}}, 38 {{{286.69512939453125,291}, {229.30485534667969,561}}}}, 39 {{{{1, 2}, {2, 6}, {2, 0}, {1, 0}}}, {{{1, 0}, {1, 2}}}}, 40 {{{{0, 0}, {0, 1}, {0, 1}, {1, 1}}}, {{{0, 1}, {1, 0}}}}, 41 }; 42 43 static const size_t lineCubicTests_count = SK_ARRAY_COUNT(lineCubicTests); 44 45 static void testOne(skiatest::Reporter* reporter, int iIndex) { 46 const SkDCubic& cubic = lineCubicTests[iIndex].cubic; 47 SkASSERT(ValidCubic(cubic)); 48 const SkDLine& line = lineCubicTests[iIndex].line; 49 SkASSERT(ValidLine(line)); 50 SkReduceOrder reduce1; 51 SkReduceOrder reduce2; 52 int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics); 53 int order2 = reduce2.reduce(line); 54 if (order1 < 4) { 55 SkDebugf("[%d] cubic order=%d\n", iIndex, order1); 56 REPORTER_ASSERT(reporter, 0); 57 } 58 if (order2 < 2) { 59 SkDebugf("[%d] line order=%d\n", iIndex, order2); 60 REPORTER_ASSERT(reporter, 0); 61 } 62 if (order1 == 4 && order2 == 2) { 63 SkIntersections i; 64 int roots = i.intersect(cubic, line); 65 for (int pt = 0; pt < roots; ++pt) { 66 double tt1 = i[0][pt]; 67 SkDPoint xy1 = cubic.ptAtT(tt1); 68 double tt2 = i[1][pt]; 69 SkDPoint xy2 = line.ptAtT(tt2); 70 if (!xy1.approximatelyEqual(xy2)) { 71 SkDebugf("%s [%d,%d] x!= t1=%g (%g,%g) t2=%g (%g,%g)\n", 72 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); 73 } 74 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); 75 } 76 } 77 } 78 79 static void PathOpsCubicLineIntersectionTest(skiatest::Reporter* reporter) { 80 for (size_t index = 0; index < lineCubicTests_count; ++index) { 81 int iIndex = static_cast<int>(index); 82 testOne(reporter, iIndex); 83 reporter->bumpTestCount(); 84 } 85 } 86 87 static void PathOpsCubicLineIntersectionOneOffTest(skiatest::Reporter* reporter) { 88 int iIndex = 0; 89 testOne(reporter, iIndex); 90 const SkDCubic& cubic = lineCubicTests[iIndex].cubic; 91 const SkDLine& line = lineCubicTests[iIndex].line; 92 SkIntersections i; 93 i.intersect(cubic, line); 94 SkASSERT(i.used() == 1); 95 #if ONE_OFF_DEBUG 96 double cubicT = i[0][0]; 97 SkDPoint prev = cubic.ptAtT(cubicT * 2 - 1); 98 SkDPoint sect = cubic.ptAtT(cubicT); 99 double left[3] = { line.isLeft(prev), line.isLeft(sect), line.isLeft(cubic[3]) }; 100 SkDebugf("cubic=(%1.9g, %1.9g, %1.9g)\n", left[0], left[1], left[2]); 101 SkDebugf("{{%1.9g,%1.9g}, {%1.9g,%1.9g}},\n", prev.fX, prev.fY, sect.fX, sect.fY); 102 SkDebugf("{{%1.9g,%1.9g}, {%1.9g,%1.9g}},\n", sect.fX, sect.fY, cubic[3].fX, cubic[3].fY); 103 SkDPoint prevL = line.ptAtT(i[1][0] - 0.0000007); 104 SkDebugf("{{%1.9g,%1.9g}, {%1.9g,%1.9g}},\n", prevL.fX, prevL.fY, i.pt(0).fX, i.pt(0).fY); 105 SkDPoint nextL = line.ptAtT(i[1][0] + 0.0000007); 106 SkDebugf("{{%1.9g,%1.9g}, {%1.9g,%1.9g}},\n", i.pt(0).fX, i.pt(0).fY, nextL.fX, nextL.fY); 107 SkDebugf("prevD=%1.9g dist=%1.9g nextD=%1.9g\n", prev.distance(nextL), 108 sect.distance(i.pt(0)), cubic[3].distance(prevL)); 109 #endif 110 } 111 112 #include "TestClassDef.h" 113 DEFINE_TESTCLASS_SHORT(PathOpsCubicLineIntersectionTest) 114 115 DEFINE_TESTCLASS_SHORT(PathOpsCubicLineIntersectionOneOffTest) 116
