blob: 94a2bf7d6f8ee821fcf3b74b7fade3fd1ff0ac14 [file] [log] [blame]
caryclark@google.coma5e55922013-05-07 18:51:31 +00001/*
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 */
caryclark@google.com8d0a5242013-07-16 16:11:16 +00007#include "PathOpsTestCommon.h"
caryclark@google.coma5e55922013-05-07 18:51:31 +00008#include "SkIntersections.h"
9#include "SkPathOpsCubic.h"
10#include "SkPathOpsQuad.h"
11#include "SkReduceOrder.h"
12#include "Test.h"
13
14static struct lineCubic {
15 SkDCubic cubic;
16 SkDQuad quad;
17 int answerCount;
18 SkDPoint answers[2];
19} quadCubicTests[] = {
skia.committer@gmail.comf54ad6f2013-11-02 07:02:02 +000020 {{{{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}}},
caryclark@google.coma2bbc6e2013-11-01 17:36:03 +000023
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
skia.committer@gmail.comb0a05892013-10-03 07:01:37 +000037 {{{{49, 47}, {49, 74.614250183105469}, {26.614250183105469, 97}, {-1, 97}}},
caryclark@google.com7eaa53d2013-10-02 14:49:34 +000038 {{{-8.659739592076221e-015, 96.991401672363281}, {20.065492630004883, 96.645187377929688},
39 {34.355339050292969, 82.355339050292969}}}, 2,
caryclark@google.coma2bbc6e2013-11-01 17:36:03 +000040 {{34.355339050292969,82.355339050292969}, {34.28654835573549, 82.424006509351585}}},
caryclark@google.com7eaa53d2013-10-02 14:49:34 +000041
skia.committer@gmail.com2b34fe02013-05-08 07:01:40 +000042 {{{{10,234}, {10,229.58172607421875}, {13.581720352172852,226}, {18,226}}},
caryclark@google.com7eaa53d2013-10-02 14:49:34 +000043 {{{18,226}, {14.686291694641113,226}, {12.342399597167969,228.3424072265625}}}, 1,
44 {{18,226}, {0,0}}},
caryclark@google.coma2bbc6e2013-11-01 17:36:03 +000045
skia.committer@gmail.com2b34fe02013-05-08 07:01:40 +000046 {{{{10,234}, {10,229.58172607421875}, {13.581720352172852,226}, {18,226}}},
caryclark@google.com7eaa53d2013-10-02 14:49:34 +000047 {{{12.342399597167969,228.3424072265625}, {10,230.68629455566406}, {10,234}}}, 1,
48 {{10,234}, {0,0}}},
caryclark@google.coma5e55922013-05-07 18:51:31 +000049};
50
51static const size_t quadCubicTests_count = SK_ARRAY_COUNT(quadCubicTests);
52
53static 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;
caryclark@google.com8d0a5242013-07-16 16:11:16 +000057 SkASSERT(ValidCubic(cubic));
caryclark@google.coma5e55922013-05-07 18:51:31 +000058 const SkDQuad& quad = quadCubicTests[index].quad;
caryclark@google.com8d0a5242013-07-16 16:11:16 +000059 SkASSERT(ValidQuad(quad));
caryclark@google.coma5e55922013-05-07 18:51:31 +000060 SkReduceOrder reduce1;
61 SkReduceOrder reduce2;
62 int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics,
63 SkReduceOrder::kFill_Style);
64 int order2 = reduce2.reduce(quad, SkReduceOrder::kFill_Style);
65 if (order1 != 4) {
66 SkDebugf("[%d] cubic order=%d\n", iIndex, order1);
67 REPORTER_ASSERT(reporter, 0);
68 }
69 if (order2 != 3) {
70 SkDebugf("[%d] quad order=%d\n", iIndex, order2);
71 REPORTER_ASSERT(reporter, 0);
72 }
73 SkIntersections i;
74 int roots = i.intersect(cubic, quad);
75 SkASSERT(roots == quadCubicTests[index].answerCount);
76 for (int pt = 0; pt < roots; ++pt) {
77 double tt1 = i[0][pt];
caryclark@google.com4fdbb222013-07-23 15:27:41 +000078 SkDPoint xy1 = cubic.ptAtT(tt1);
caryclark@google.coma5e55922013-05-07 18:51:31 +000079 double tt2 = i[1][pt];
caryclark@google.com4fdbb222013-07-23 15:27:41 +000080 SkDPoint xy2 = quad.ptAtT(tt2);
caryclark@google.coma5e55922013-05-07 18:51:31 +000081 if (!xy1.approximatelyEqual(xy2)) {
82 SkDebugf("%s [%d,%d] x!= t1=%g (%g,%g) t2=%g (%g,%g)\n",
83 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
84 }
85 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
86 bool found = false;
87 for (int idx2 = 0; idx2 < quadCubicTests[index].answerCount; ++idx2) {
88 found |= quadCubicTests[index].answers[idx2].approximatelyEqual(xy1);
89 }
caryclark@google.coma2bbc6e2013-11-01 17:36:03 +000090 if (!found) {
91 SkDebugf("%s [%d,%d] xy1=(%g,%g) != \n",
92 __FUNCTION__, iIndex, pt, xy1.fX, xy1.fY);
93 }
caryclark@google.coma5e55922013-05-07 18:51:31 +000094 REPORTER_ASSERT(reporter, found);
95 }
96 reporter->bumpTestCount();
97 }
98}
99
100#include "TestClassDef.h"
101DEFINE_TESTCLASS_SHORT(PathOpsCubicQuadIntersectionTest)