1 /*
2 * Copyright 2015 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 "include/core/SkTypes.h"
8 #include "include/private/base/SkDebug.h"
9 #include "src/pathops/SkIntersections.h"
10 #include "src/pathops/SkPathOpsConic.h"
11 #include "src/pathops/SkPathOpsPoint.h"
12 #include "src/pathops/SkPathOpsQuad.h"
13 #include "src/pathops/SkReduceOrder.h"
14 #include "tests/PathOpsTestCommon.h"
15 #include "tests/Test.h"
16
17 #include <array>
18
19 static struct conicQuad {
20 ConicPts conic;
21 QuadPts quad;
22 } conicQuadTests[] = {
23 {{{{{0.00000000000000000, -1.8135968446731567 },
24 {0.00000000000000000, -1.0033817291259766 },
25 {-0.0073835160583257675, 0.00000000000000000 }}}, 2.26585215e+11f},
26 {{{0.00000000000000000, -1.0000113248825073 },
27 {-2.4824290449032560e-05, -1.0000115633010864 },
28 {-0.0073835160583257675, 0.00000000000000000 }}}},
29
30 {{{{{494.348663,224.583771}, {494.365143,224.633194}, {494.376404,224.684067}}}, 0.998645842f},
31 {{{494.30481,224.474213}, {494.334961,224.538284}, {494.355774,224.605927}}}},
32
33 {{{{{494.348663,224.583771}, {494.365143,224.633194}, {494.376404,224.684067}}}, 0.998645842f},
34 {{{494.355774f, 224.605927f}, {494.363708f, 224.631714f}, {494.370148f, 224.657471f}}}},
35 };
36
37 static const int conicQuadTests_count = (int) std::size(conicQuadTests);
38
conicQuadIntersection(skiatest::Reporter * reporter,int index)39 static void conicQuadIntersection(skiatest::Reporter* reporter, int index) {
40 const ConicPts& c = conicQuadTests[index].conic;
41 SkDConic conic;
42 conic.debugSet(c.fPts.fPts, c.fWeight);
43 SkASSERT(ValidConic(conic));
44 const QuadPts& q = conicQuadTests[index].quad;
45 SkDQuad quad;
46 quad.debugSet(q.fPts);
47 SkASSERT(ValidQuad(quad));
48 SkReduceOrder reduce1;
49 SkReduceOrder reduce2;
50 int order1 = reduce2.reduce(conic.fPts);
51 int order2 = reduce1.reduce(quad);
52 if (order2 != 3) {
53 SkDebugf("[%d] conic order=%d\n", index, order1);
54 REPORTER_ASSERT(reporter, 0);
55 }
56 if (order1 != 3) {
57 SkDebugf("[%d] quad order=%d\n", index, order2);
58 REPORTER_ASSERT(reporter, 0);
59 }
60 SkIntersections i;
61 int roots = i.intersect(conic, quad);
62 for (int pt = 0; pt < roots; ++pt) {
63 double tt1 = i[0][pt];
64 SkDPoint xy1 = conic.ptAtT(tt1);
65 double tt2 = i[1][pt];
66 SkDPoint xy2 = quad.ptAtT(tt2);
67 if (!xy1.approximatelyEqual(xy2)) {
68 SkDebugf("%s [%d,%d] x!= t1=%g (%g,%g) t2=%g (%g,%g)\n",
69 __FUNCTION__, index, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX, xy2.fY);
70 }
71 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2));
72 }
73 reporter->bumpTestCount();
74 }
75
DEF_TEST(PathOpsConicQuadIntersection,reporter)76 DEF_TEST(PathOpsConicQuadIntersection, reporter) {
77 for (int index = 0; index < conicQuadTests_count; ++index) {
78 conicQuadIntersection(reporter, index);
79 reporter->bumpTestCount();
80 }
81 }
82
DEF_TEST(PathOpsConicQuadIntersectionOneOff,reporter)83 DEF_TEST(PathOpsConicQuadIntersectionOneOff, reporter) {
84 conicQuadIntersection(reporter, 0);
85 }
86