1 /*
2 * Copyright 2011 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
8 #include "SkGeometry.h"
9 #include "Test.h"
10 #include "SkRandom.h"
11
nearly_equal(const SkPoint & a,const SkPoint & b)12 static bool nearly_equal(const SkPoint& a, const SkPoint& b) {
13 return SkScalarNearlyEqual(a.fX, b.fX) && SkScalarNearlyEqual(a.fY, b.fY);
14 }
15
testChopCubic(skiatest::Reporter * reporter)16 static void testChopCubic(skiatest::Reporter* reporter) {
17 /*
18 Inspired by this test, which used to assert that the tValues had dups
19
20 <path stroke="#202020" d="M0,0 C0,0 1,1 2190,5130 C2190,5070 2220,5010 2205,4980" />
21 */
22 const SkPoint src[] = {
23 { SkIntToScalar(2190), SkIntToScalar(5130) },
24 { SkIntToScalar(2190), SkIntToScalar(5070) },
25 { SkIntToScalar(2220), SkIntToScalar(5010) },
26 { SkIntToScalar(2205), SkIntToScalar(4980) },
27 };
28 SkPoint dst[13];
29 SkScalar tValues[3];
30 // make sure we don't assert internally
31 int count = SkChopCubicAtMaxCurvature(src, dst, tValues);
32 if (false) { // avoid bit rot, suppress warning
33 REPORTER_ASSERT(reporter, count);
34 }
35 }
36
check_pairs(skiatest::Reporter * reporter,int index,SkScalar t,const char name[],SkScalar x0,SkScalar y0,SkScalar x1,SkScalar y1)37 static void check_pairs(skiatest::Reporter* reporter, int index, SkScalar t, const char name[],
38 SkScalar x0, SkScalar y0, SkScalar x1, SkScalar y1) {
39 bool eq = SkScalarNearlyEqual(x0, x1) && SkScalarNearlyEqual(y0, y1);
40 if (!eq) {
41 SkDebugf("%s [%d %g] p0 [%10.8f %10.8f] p1 [%10.8f %10.8f]\n",
42 name, index, t, x0, y0, x1, y1);
43 REPORTER_ASSERT(reporter, eq);
44 }
45 }
46
test_evalquadat(skiatest::Reporter * reporter)47 static void test_evalquadat(skiatest::Reporter* reporter) {
48 SkRandom rand;
49 for (int i = 0; i < 1000; ++i) {
50 SkPoint pts[3];
51 for (int j = 0; j < 3; ++j) {
52 pts[j].set(rand.nextSScalar1() * 100, rand.nextSScalar1() * 100);
53 }
54 const SkScalar dt = SK_Scalar1 / 128;
55 SkScalar t = dt;
56 for (int j = 1; j < 128; ++j) {
57 SkPoint r0;
58 SkEvalQuadAt(pts, t, &r0);
59 SkPoint r1 = SkEvalQuadAt(pts, t);
60 check_pairs(reporter, i, t, "quad-pos", r0.fX, r0.fY, r1.fX, r1.fY);
61
62 SkVector v0;
63 SkEvalQuadAt(pts, t, NULL, &v0);
64 SkVector v1 = SkEvalQuadTangentAt(pts, t);
65 check_pairs(reporter, i, t, "quad-tan", v0.fX, v0.fY, v1.fX, v1.fY);
66
67 t += dt;
68 }
69 }
70 }
71
test_conic_eval_pos(skiatest::Reporter * reporter,const SkConic & conic,SkScalar t)72 static void test_conic_eval_pos(skiatest::Reporter* reporter, const SkConic& conic, SkScalar t) {
73 SkPoint p0, p1;
74 conic.evalAt(t, &p0, NULL);
75 p1 = conic.evalAt(t);
76 check_pairs(reporter, 0, t, "conic-pos", p0.fX, p0.fY, p1.fX, p1.fY);
77 }
78
test_conic_eval_tan(skiatest::Reporter * reporter,const SkConic & conic,SkScalar t)79 static void test_conic_eval_tan(skiatest::Reporter* reporter, const SkConic& conic, SkScalar t) {
80 SkVector v0, v1;
81 conic.evalAt(t, NULL, &v0);
82 v1 = conic.evalTangentAt(t);
83 check_pairs(reporter, 0, t, "conic-tan", v0.fX, v0.fY, v1.fX, v1.fY);
84 }
85
test_conic(skiatest::Reporter * reporter)86 static void test_conic(skiatest::Reporter* reporter) {
87 SkRandom rand;
88 for (int i = 0; i < 1000; ++i) {
89 SkPoint pts[3];
90 for (int j = 0; j < 3; ++j) {
91 pts[j].set(rand.nextSScalar1() * 100, rand.nextSScalar1() * 100);
92 }
93 for (int k = 0; k < 10; ++k) {
94 SkScalar w = rand.nextUScalar1() * 2;
95 SkConic conic(pts, w);
96
97 const SkScalar dt = SK_Scalar1 / 128;
98 SkScalar t = dt;
99 for (int j = 1; j < 128; ++j) {
100 test_conic_eval_pos(reporter, conic, t);
101 test_conic_eval_tan(reporter, conic, t);
102 t += dt;
103 }
104 }
105 }
106 }
107
DEF_TEST(Geometry,reporter)108 DEF_TEST(Geometry, reporter) {
109 SkPoint pts[3], dst[5];
110
111 pts[0].set(0, 0);
112 pts[1].set(100, 50);
113 pts[2].set(0, 100);
114
115 int count = SkChopQuadAtMaxCurvature(pts, dst);
116 REPORTER_ASSERT(reporter, count == 1 || count == 2);
117
118 pts[0].set(0, 0);
119 pts[1].set(3, 0);
120 pts[2].set(3, 3);
121 SkConvertQuadToCubic(pts, dst);
122 const SkPoint cubic[] = {
123 { 0, 0, }, { 2, 0, }, { 3, 1, }, { 3, 3 },
124 };
125 for (int i = 0; i < 4; ++i) {
126 REPORTER_ASSERT(reporter, nearly_equal(cubic[i], dst[i]));
127 }
128
129 testChopCubic(reporter);
130 test_evalquadat(reporter);
131 test_conic(reporter);
132 }
133