OLD | NEW |
1 /* | 1 /* |
2 * Copyright 2012 Google Inc. | 2 * Copyright 2012 Google Inc. |
3 * | 3 * |
4 * Use of this source code is governed by a BSD-style license that can be | 4 * Use of this source code is governed by a BSD-style license that can be |
5 * found in the LICENSE file. | 5 * found in the LICENSE file. |
6 */ | 6 */ |
7 #include "PathOpsTestCommon.h" | 7 #include "PathOpsTestCommon.h" |
8 #include "SkIntersections.h" | 8 #include "SkIntersections.h" |
9 #include "SkPathOpsCubic.h" | 9 #include "SkPathOpsCubic.h" |
10 #include "SkPathOpsLine.h" | 10 #include "SkPathOpsLine.h" |
11 #include "SkReduceOrder.h" | 11 #include "SkReduceOrder.h" |
12 #include "Test.h" | 12 #include "Test.h" |
| 13 #include "TestClassDef.h" |
13 | 14 |
14 static struct lineCubic { | 15 static struct lineCubic { |
15 SkDCubic cubic; | 16 SkDCubic cubic; |
16 SkDLine line; | 17 SkDLine line; |
17 } lineCubicTests[] = { | 18 } lineCubicTests[] = { |
18 {{{{154,715}, {151.238571,715}, {149,712.761414}, {149,710}}}, | 19 {{{{154,715}, {151.238571,715}, {149,712.761414}, {149,710}}}, |
19 {{{149,675}, {149,710.001465}}}}, | 20 {{{149,675}, {149,710.001465}}}}, |
20 | 21 |
21 {{{{0,1}, {1,6}, {4,1}, {4,3}}}, | 22 {{{{0,1}, {1,6}, {4,1}, {4,3}}}, |
22 {{{6,1}, {1,4}}}}, | 23 {{{6,1}, {1,4}}}}, |
(...skipping 46 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
69 SkDPoint xy2 = line.ptAtT(tt2); | 70 SkDPoint xy2 = line.ptAtT(tt2); |
70 if (!xy1.approximatelyEqual(xy2)) { | 71 if (!xy1.approximatelyEqual(xy2)) { |
71 SkDebugf("%s [%d,%d] x!= t1=%g (%g,%g) t2=%g (%g,%g)\n", | 72 SkDebugf("%s [%d,%d] x!= t1=%g (%g,%g) t2=%g (%g,%g)\n", |
72 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX,
xy2.fY); | 73 __FUNCTION__, iIndex, pt, tt1, xy1.fX, xy1.fY, tt2, xy2.fX,
xy2.fY); |
73 } | 74 } |
74 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); | 75 REPORTER_ASSERT(reporter, xy1.approximatelyEqual(xy2)); |
75 } | 76 } |
76 } | 77 } |
77 } | 78 } |
78 | 79 |
79 static void PathOpsCubicLineIntersectionTest(skiatest::Reporter* reporter) { | 80 DEF_TEST(PathOpsCubicLineIntersection, reporter) { |
80 for (size_t index = 0; index < lineCubicTests_count; ++index) { | 81 for (size_t index = 0; index < lineCubicTests_count; ++index) { |
81 int iIndex = static_cast<int>(index); | 82 int iIndex = static_cast<int>(index); |
82 testOne(reporter, iIndex); | 83 testOne(reporter, iIndex); |
83 reporter->bumpTestCount(); | 84 reporter->bumpTestCount(); |
84 } | 85 } |
85 } | 86 } |
86 | 87 |
87 static void PathOpsCubicLineIntersectionOneOffTest(skiatest::Reporter* reporter)
{ | 88 DEF_TEST(PathOpsCubicLineIntersectionOneOff, reporter) { |
88 int iIndex = 0; | 89 int iIndex = 0; |
89 testOne(reporter, iIndex); | 90 testOne(reporter, iIndex); |
90 const SkDCubic& cubic = lineCubicTests[iIndex].cubic; | 91 const SkDCubic& cubic = lineCubicTests[iIndex].cubic; |
91 const SkDLine& line = lineCubicTests[iIndex].line; | 92 const SkDLine& line = lineCubicTests[iIndex].line; |
92 SkIntersections i; | 93 SkIntersections i; |
93 i.intersect(cubic, line); | 94 i.intersect(cubic, line); |
94 SkASSERT(i.used() == 1); | 95 SkASSERT(i.used() == 1); |
95 #if ONE_OFF_DEBUG | 96 #if ONE_OFF_DEBUG |
96 double cubicT = i[0][0]; | 97 double cubicT = i[0][0]; |
97 SkDPoint prev = cubic.ptAtT(cubicT * 2 - 1); | 98 SkDPoint prev = cubic.ptAtT(cubicT * 2 - 1); |
98 SkDPoint sect = cubic.ptAtT(cubicT); | 99 SkDPoint sect = cubic.ptAtT(cubicT); |
99 double left[3] = { line.isLeft(prev), line.isLeft(sect), line.isLeft(cubic[3
]) }; | 100 double left[3] = { line.isLeft(prev), line.isLeft(sect), line.isLeft(cubic[3
]) }; |
100 SkDebugf("cubic=(%1.9g, %1.9g, %1.9g)\n", left[0], left[1], left[2]); | 101 SkDebugf("cubic=(%1.9g, %1.9g, %1.9g)\n", left[0], left[1], left[2]); |
101 SkDebugf("{{%1.9g,%1.9g}, {%1.9g,%1.9g}},\n", prev.fX, prev.fY, sect.fX, sec
t.fY); | 102 SkDebugf("{{%1.9g,%1.9g}, {%1.9g,%1.9g}},\n", prev.fX, prev.fY, sect.fX, sec
t.fY); |
102 SkDebugf("{{%1.9g,%1.9g}, {%1.9g,%1.9g}},\n", sect.fX, sect.fY, cubic[3].fX,
cubic[3].fY); | 103 SkDebugf("{{%1.9g,%1.9g}, {%1.9g,%1.9g}},\n", sect.fX, sect.fY, cubic[3].fX,
cubic[3].fY); |
103 SkDPoint prevL = line.ptAtT(i[1][0] - 0.0000007); | 104 SkDPoint prevL = line.ptAtT(i[1][0] - 0.0000007); |
104 SkDebugf("{{%1.9g,%1.9g}, {%1.9g,%1.9g}},\n", prevL.fX, prevL.fY, i.pt(0).fX
, i.pt(0).fY); | 105 SkDebugf("{{%1.9g,%1.9g}, {%1.9g,%1.9g}},\n", prevL.fX, prevL.fY, i.pt(0).fX
, i.pt(0).fY); |
105 SkDPoint nextL = line.ptAtT(i[1][0] + 0.0000007); | 106 SkDPoint nextL = line.ptAtT(i[1][0] + 0.0000007); |
106 SkDebugf("{{%1.9g,%1.9g}, {%1.9g,%1.9g}},\n", i.pt(0).fX, i.pt(0).fY, nextL.
fX, nextL.fY); | 107 SkDebugf("{{%1.9g,%1.9g}, {%1.9g,%1.9g}},\n", i.pt(0).fX, i.pt(0).fY, nextL.
fX, nextL.fY); |
107 SkDebugf("prevD=%1.9g dist=%1.9g nextD=%1.9g\n", prev.distance(nextL), | 108 SkDebugf("prevD=%1.9g dist=%1.9g nextD=%1.9g\n", prev.distance(nextL), |
108 sect.distance(i.pt(0)), cubic[3].distance(prevL)); | 109 sect.distance(i.pt(0)), cubic[3].distance(prevL)); |
109 #endif | 110 #endif |
110 } | 111 } |
111 | |
112 #include "TestClassDef.h" | |
113 DEFINE_TESTCLASS_SHORT(PathOpsCubicLineIntersectionTest) | |
114 | |
115 DEFINE_TESTCLASS_SHORT(PathOpsCubicLineIntersectionOneOffTest) | |
OLD | NEW |