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 "SkRandom.h"
12#include "SkReduceOrder.h"
13#include "Test.h"
14
15static struct quadCubic {
16    CubicPts cubic;
17    QuadPts quad;
18} quadCubicTests[] = {
19    {{{{945.08099365234375, 747.1619873046875}, {982.5679931640625, 747.1619873046875}, {1013.6290283203125, 719.656005859375}, {1019.1910400390625, 683.72601318359375}}},
20     {{{945, 747}, {976.0660400390625, 747}, {998.03302001953125, 725.03302001953125}}}},
21
22    {{{{778, 14089}, {778, 14091.208984375}, {776.20916748046875, 14093}, {774, 14093}}},
23     {{{778, 14089}, {777.99957275390625, 14090.65625}, {776.82843017578125, 14091.828125}}}},
24
25    {{{{1020.08099,672.161987}, {1020.08002,630.73999}, {986.502014,597.161987}, {945.080994,597.161987}}},
26     {{{1020,672}, {1020,640.93396}, {998.03302,618.96698}}}},
27
28    {{{{778, 14089}, {778, 14091.208984375}, {776.20916748046875, 14093}, {774, 14093}}},
29     {{{778, 14089}, {777.99957275390625, 14090.65625}, {776.82843017578125, 14091.828125}}}},
30
31    {{{{1110, 817}, {1110.55225f, 817}, {1111, 817.447693f}, {1111, 818}}},
32     {{{1110.70715f, 817.292908f}, {1110.41406f, 817.000122f}, {1110, 817}}}},
33
34    {{{{1110, 817}, {1110.55225f, 817}, {1111, 817.447693f}, {1111, 818}}},
35     {{{1111, 818}, {1110.99988f, 817.585876f}, {1110.70715f, 817.292908f}}}},
36
37    {{{{55, 207}, {52.238574981689453, 207}, {50, 204.76142883300781}, {50, 202}}},
38     {{{55, 207}, {52.929431915283203, 206.99949645996094},
39       {51.464466094970703, 205.53553771972656}}}},
40
41    {{{{49, 47}, {49, 74.614250183105469}, {26.614250183105469, 97}, {-1, 97}}},
42     {{{-8.659739592076221e-015, 96.991401672363281}, {20.065492630004883, 96.645187377929688},
43       {34.355339050292969, 82.355339050292969}}}},
44
45    {{{{10,234}, {10,229.58172607421875}, {13.581720352172852,226}, {18,226}}},
46     {{{18,226}, {14.686291694641113,226}, {12.342399597167969,228.3424072265625}}}},
47
48    {{{{10,234}, {10,229.58172607421875}, {13.581720352172852,226}, {18,226}}},
49     {{{12.342399597167969,228.3424072265625}, {10,230.68629455566406}, {10,234}}}},
50};
51
52static const int quadCubicTests_count = (int) SK_ARRAY_COUNT(quadCubicTests);
53
54static void cubicQuadIntersection(skiatest::Reporter* reporter, int index) {
55    int iIndex = static_cast<int>(index);
56    const CubicPts& c = quadCubicTests[index].cubic;
57    SkDCubic cubic;
58    cubic.debugSet(c.fPts);
59    SkASSERT(ValidCubic(cubic));
60    const QuadPts& q = quadCubicTests[index].quad;
61    SkDQuad quad;
62    quad.debugSet(q.fPts);
63    SkASSERT(ValidQuad(quad));
64    SkReduceOrder reduce1;
65    SkReduceOrder reduce2;
66    int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics);
67    int order2 = reduce2.reduce(quad);
68    if (order1 != 4) {
69        SkDebugf("[%d] cubic order=%d\n", iIndex, order1);
70        REPORTER_ASSERT(reporter, 0);
71    }
72    if (order2 != 3) {
73        SkDebugf("[%d] quad order=%d\n", iIndex, order2);
74        REPORTER_ASSERT(reporter, 0);
75    }
76    SkIntersections i;
77    int roots = i.intersect(cubic, quad);
78    for (int pt = 0; pt < roots; ++pt) {
79        double tt1 = i[0][pt];
80        SkDPoint xy1 = cubic.ptAtT(tt1);
81        double tt2 = i[1][pt];
82        SkDPoint xy2 = quad.ptAtT(tt2);
83        if (!xy1.approximatelyEqual(xy2)) {
84            SkDebugf("%s [%d,%d] x!= t1=%g (%g,%g) t2=%g (%g,%g)\n",
85                __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
86        }
87        REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
88    }
89    reporter->bumpTestCount();
90}
91
92DEF_TEST(PathOpsCubicQuadIntersection, reporter) {
93    for (int index = 0; index < quadCubicTests_count; ++index) {
94        cubicQuadIntersection(reporter, index);
95        reporter->bumpTestCount();
96    }
97}
98
99DEF_TEST(PathOpsCubicQuadIntersectionOneOff, reporter) {
100    cubicQuadIntersection(reporter, 0);
101}
102