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
14struct lineCubic {
15    SkDCubic cubic;
16    SkDLine line;
17};
18
19static lineCubic failLineCubicTests[] = {
20    {{{{37.5273438,-1.44140625}, {37.8736992,-1.69921875}, {38.1640625,-2.140625},
21            {38.3984375,-2.765625}}},
22            {{{40.625,-5.7890625}, {37.7109375,1.3515625}}}},
23};
24
25static const size_t failLineCubicTests_count = SK_ARRAY_COUNT(failLineCubicTests);
26
27static void testFail(skiatest::Reporter* reporter, int iIndex) {
28    const SkDCubic& cubic = failLineCubicTests[iIndex].cubic;
29    SkASSERT(ValidCubic(cubic));
30    const SkDLine& line = failLineCubicTests[iIndex].line;
31    SkASSERT(ValidLine(line));
32    SkReduceOrder reduce1;
33    SkReduceOrder reduce2;
34    int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics);
35    int order2 = reduce2.reduce(line);
36    if (order1 < 4) {
37        SkDebugf("[%d] cubic order=%d\n", iIndex, order1);
38        REPORTER_ASSERT(reporter, 0);
39    }
40    if (order2 < 2) {
41        SkDebugf("[%d] line order=%d\n", iIndex, order2);
42        REPORTER_ASSERT(reporter, 0);
43    }
44    if (order1 == 4 && order2 == 2) {
45        SkIntersections i;
46        int roots = i.intersect(cubic, line);
47        REPORTER_ASSERT(reporter, roots == 0);
48    }
49}
50
51static lineCubic lineCubicTests[] = {
52    {{{{-634.60540771484375, -481.262939453125}, {266.2696533203125, -752.70867919921875},
53            {-751.8370361328125, -317.37921142578125}, {-969.7427978515625, 824.7255859375}}},
54            {{{-287.9506133720805678, -557.1376476615772617},
55            {-285.9506133720805678, -557.1376476615772617}}}},
56
57    {{{{36.7184372,0.888650894}, {36.7184372,0.888650894}, {35.1233864,0.554015458},
58            {34.5114098,-0.115255356}}}, {{{35.4531212,0}, {31.9375,0}}}},
59
60    {{{{421, 378}, {421, 380.209137f}, {418.761414f, 382}, {416, 382}}},
61            {{{320, 378}, {421, 378.000031f}}}},
62
63    {{{{416, 383}, {418.761414f, 383}, {421, 380.761414f}, {421, 378}}},
64            {{{320, 378}, {421, 378.000031f}}}},
65
66    {{{{154,715}, {151.238571,715}, {149,712.761414}, {149,710}}},
67            {{{149,675}, {149,710.001465}}}},
68
69    {{{{0,1}, {1,6}, {4,1}, {4,3}}},
70            {{{6,1}, {1,4}}}},
71
72    {{{{0,1}, {2,6}, {4,1}, {5,4}}},
73            {{{6,2}, {1,4}}}},
74
75    {{{{0,4}, {3,4}, {6,2}, {5,2}}},
76            {{{4,3}, {2,6}}}},
77#if 0
78    {{{{258, 122}, {260.761414, 122}, { 263, 124.238579}, {263, 127}}},
79            {{{259.82843, 125.17157}, {261.535522, 123.46447}}}},
80#endif
81    {{{{1006.6951293945312,291}, {1023.263671875,291}, {1033.8402099609375,304.43145751953125},
82            {1030.318359375,321}}},
83            {{{979.30487060546875,561}, {1036.695068359375,291}}}},
84    {{{{259.30487060546875,561}, {242.73631286621094,561}, {232.15980529785156,547.56854248046875},
85            {235.68154907226562,531}}},
86            {{{286.69512939453125,291}, {229.30485534667969,561}}}},
87    {{{{1, 2}, {2, 6}, {2, 0}, {1, 0}}}, {{{1, 0}, {1, 2}}}},
88    {{{{0, 0}, {0, 1}, {0, 1}, {1, 1}}}, {{{0, 1}, {1, 0}}}},
89};
90
91static const size_t lineCubicTests_count = SK_ARRAY_COUNT(lineCubicTests);
92
93static int doIntersect(SkIntersections& intersections, const SkDCubic& cubic, const SkDLine& line) {
94    int result;
95    bool flipped = false;
96    if (line[0].fX == line[1].fX) {
97        double top = line[0].fY;
98        double bottom = line[1].fY;
99        flipped = top > bottom;
100        if (flipped) {
101            SkTSwap<double>(top, bottom);
102        }
103        result = intersections.vertical(cubic, top, bottom, line[0].fX, flipped);
104    } else if (line[0].fY == line[1].fY) {
105        double left = line[0].fX;
106        double right = line[1].fX;
107        flipped = left > right;
108        if (flipped) {
109            SkTSwap<double>(left, right);
110        }
111        result = intersections.horizontal(cubic, left, right, line[0].fY, flipped);
112    } else {
113        intersections.intersect(cubic, line);
114        result = intersections.used();
115    }
116    return result;
117}
118
119static void testOne(skiatest::Reporter* reporter, int iIndex) {
120    const SkDCubic& cubic = lineCubicTests[iIndex].cubic;
121    SkASSERT(ValidCubic(cubic));
122    const SkDLine& line = lineCubicTests[iIndex].line;
123    SkASSERT(ValidLine(line));
124    SkReduceOrder reduce1;
125    SkReduceOrder reduce2;
126    int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics);
127    int order2 = reduce2.reduce(line);
128    if (order1 < 4) {
129        SkDebugf("[%d] cubic order=%d\n", iIndex, order1);
130        REPORTER_ASSERT(reporter, 0);
131    }
132    if (order2 < 2) {
133        SkDebugf("[%d] line order=%d\n", iIndex, order2);
134        REPORTER_ASSERT(reporter, 0);
135    }
136    if (order1 == 4 && order2 == 2) {
137        SkIntersections i;
138        int roots = doIntersect(i, cubic, line);
139        for (int pt = 0; pt < roots; ++pt) {
140            double tt1 = i[0][pt];
141            SkDPoint xy1 = cubic.ptAtT(tt1);
142            double tt2 = i[1][pt];
143            SkDPoint xy2 = line.ptAtT(tt2);
144            if (!xy1.approximatelyEqual(xy2)) {
145                SkDebugf("%s [%d,%d] x!= t1=%g (%g,%g) t2=%g (%g,%g)\n",
146                    __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
147            }
148            REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
149        }
150#if ONE_OFF_DEBUG
151        double cubicT = i[0][0];
152        SkDPoint prev = cubic.ptAtT(cubicT * 2 - 1);
153        SkDPoint sect = cubic.ptAtT(cubicT);
154        double left[3] = { line.isLeft(prev), line.isLeft(sect), line.isLeft(cubic[3]) };
155        SkDebugf("cubic=(%1.9g, %1.9g, %1.9g)\n", left[0], left[1], left[2]);
156        SkDebugf("{{%1.9g,%1.9g}, {%1.9g,%1.9g}},\n", prev.fX, prev.fY, sect.fX, sect.fY);
157        SkDebugf("{{%1.9g,%1.9g}, {%1.9g,%1.9g}},\n", sect.fX, sect.fY, cubic[3].fX, cubic[3].fY);
158        SkDPoint prevL = line.ptAtT(i[1][0] - 0.0000007);
159        SkDebugf("{{%1.9g,%1.9g}, {%1.9g,%1.9g}},\n", prevL.fX, prevL.fY, i.pt(0).fX, i.pt(0).fY);
160        SkDPoint nextL = line.ptAtT(i[1][0] + 0.0000007);
161        SkDebugf("{{%1.9g,%1.9g}, {%1.9g,%1.9g}},\n", i.pt(0).fX, i.pt(0).fY, nextL.fX, nextL.fY);
162        SkDebugf("prevD=%1.9g dist=%1.9g nextD=%1.9g\n", prev.distance(nextL),
163                sect.distance(i.pt(0)), cubic[3].distance(prevL));
164#endif
165    }
166}
167
168DEF_TEST(PathOpsFailCubicLineIntersection, reporter) {
169    for (size_t index = 0; index < failLineCubicTests_count; ++index) {
170        int iIndex = static_cast<int>(index);
171        testFail(reporter, iIndex);
172        reporter->bumpTestCount();
173    }
174}
175
176DEF_TEST(PathOpsCubicLineIntersection, reporter) {
177    for (size_t index = 0; index < lineCubicTests_count; ++index) {
178        int iIndex = static_cast<int>(index);
179        testOne(reporter, iIndex);
180        reporter->bumpTestCount();
181    }
182}
183
184DEF_TEST(PathOpsCubicLineIntersectionOneOff, reporter) {
185    int iIndex = 0;
186    testOne(reporter, iIndex);
187    const SkDCubic& cubic = lineCubicTests[iIndex].cubic;
188    const SkDLine& line = lineCubicTests[iIndex].line;
189    SkIntersections i;
190    i.intersect(cubic, line);
191    SkASSERT(i.used() == 1);
192}
193