1 /* 2 * Copyright 2013 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 "SkPathOpsQuad.h" 11 #include "SkReduceOrder.h" 12 #include "Test.h" 13 14 static struct lineCubic { 15 SkDCubic cubic; 16 SkDQuad quad; 17 int answerCount; 18 SkDPoint answers[2]; 19 } quadCubicTests[] = { 20 {{{{778, 14089}, {778, 14091.208984375}, {776.20916748046875, 14093}, {774, 14093}}}, 21 {{{778, 14089}, {777.99957275390625, 14090.65625}, {776.82843017578125, 14091.828125}}}, 2, 22 {{778, 14089}, {776.82855609581270,14091.828250841330}}}, 23 24 {{{{1110, 817}, {1110.55225f, 817}, {1111, 817.447693f}, {1111, 818}}}, 25 {{{1110.70715f, 817.292908f}, {1110.41406f, 817.000122f}, {1110, 817}}}, 2, 26 {{1110, 817}, {1110.70715f, 817.292908f}}}, 27 28 {{{{1110, 817}, {1110.55225f, 817}, {1111, 817.447693f}, {1111, 818}}}, 29 {{{1111, 818}, {1110.99988f, 817.585876f}, {1110.70715f, 817.292908f}}}, 2, 30 {{1110.70715f, 817.292908f}, {1111, 818}}}, 31 32 {{{{55, 207}, {52.238574981689453, 207}, {50, 204.76142883300781}, {50, 202}}}, 33 {{{55, 207}, {52.929431915283203, 206.99949645996094}, 34 {51.464466094970703, 205.53553771972656}}}, 2, 35 {{55, 207}, {51.464466094970703, 205.53553771972656}}}, 36 37 {{{{49, 47}, {49, 74.614250183105469}, {26.614250183105469, 97}, {-1, 97}}}, 38 {{{-8.659739592076221e-015, 96.991401672363281}, {20.065492630004883, 96.645187377929688}, 39 {34.355339050292969, 82.355339050292969}}}, 2, 40 {{34.355339050292969,82.355339050292969}, {34.28654835573549, 82.424006509351585}}}, 41 42 {{{{10,234}, {10,229.58172607421875}, {13.581720352172852,226}, {18,226}}}, 43 {{{18,226}, {14.686291694641113,226}, {12.342399597167969,228.3424072265625}}}, 1, 44 {{18,226}, {0,0}}}, 45 46 {{{{10,234}, {10,229.58172607421875}, {13.581720352172852,226}, {18,226}}}, 47 {{{12.342399597167969,228.3424072265625}, {10,230.68629455566406}, {10,234}}}, 1, 48 {{10,234}, {0,0}}}, 49 }; 50 51 static const size_t quadCubicTests_count = SK_ARRAY_COUNT(quadCubicTests); 52 53 static void PathOpsCubicQuadIntersectionTest(skiatest::Reporter* reporter) { 54 for (size_t index = 0; index < quadCubicTests_count; ++index) { 55 int iIndex = static_cast<int>(index); 56 const SkDCubic& cubic = quadCubicTests[index].cubic; 57 SkASSERT(ValidCubic(cubic)); 58 const SkDQuad& quad = quadCubicTests[index].quad; 59 SkASSERT(ValidQuad(quad)); 60 SkReduceOrder reduce1; 61 SkReduceOrder reduce2; 62 int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics); 63 int order2 = reduce2.reduce(quad); 64 if (order1 != 4) { 65 SkDebugf("[%d] cubic order=%d\n", iIndex, order1); 66 REPORTER_ASSERT(reporter, 0); 67 } 68 if (order2 != 3) { 69 SkDebugf("[%d] quad order=%d\n", iIndex, order2); 70 REPORTER_ASSERT(reporter, 0); 71 } 72 SkIntersections i; 73 int roots = i.intersect(cubic, quad); 74 SkASSERT(roots == quadCubicTests[index].answerCount); 75 for (int pt = 0; pt < roots; ++pt) { 76 double tt1 = i[0][pt]; 77 SkDPoint xy1 = cubic.ptAtT(tt1); 78 double tt2 = i[1][pt]; 79 SkDPoint xy2 = quad.ptAtT(tt2); 80 if (!xy1.approximatelyEqual(xy2)) { 81 SkDebugf("%s [%d,%d] x!= t1=%g (%g,%g) t2=%g (%g,%g)\n", 82 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY); 83 } 84 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); 85 bool found = false; 86 for (int idx2 = 0; idx2 < quadCubicTests[index].answerCount; ++idx2) { 87 found |= quadCubicTests[index].answers[idx2].approximatelyEqual(xy1); 88 } 89 if (!found) { 90 SkDebugf("%s [%d,%d] xy1=(%g,%g) != \n", 91 __FUNCTION__, iIndex, pt, xy1.fX, xy1.fY); 92 } 93 REPORTER_ASSERT(reporter, found); 94 } 95 reporter->bumpTestCount(); 96 } 97 } 98 99 #include "TestClassDef.h" 100 DEFINE_TESTCLASS_SHORT(PathOpsCubicQuadIntersectionTest) 101
