1 /*
2 * Copyright 2018 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 "include/core/SkCubicMap.h"
9 #include "include/core/SkPoint.h"
10 #include "include/core/SkScalar.h"
11 #include "include/core/SkTypes.h"
12 #include "include/private/SkNx.h"
13 #include "src/core/SkGeometry.h"
14 #include "src/pathops/SkPathOpsCubic.h"
15 #include "tests/Test.h"
16
accurate_t(float A,float B,float C,float D)17 static float accurate_t(float A, float B, float C, float D) {
18 double roots[3];
19 SkDEBUGCODE(int count =) SkDCubic::RootsValidT(A, B, C, D, roots);
20 SkASSERT(count == 1);
21 return (float)roots[0];
22 }
23
accurate_solve(SkPoint p1,SkPoint p2,SkScalar x)24 static float accurate_solve(SkPoint p1, SkPoint p2, SkScalar x) {
25 SkPoint array[] = { {0, 0}, p1, p2, {1,1} };
26 SkCubicCoeff coeff(array);
27
28 float t = accurate_t(coeff.fA[0], coeff.fB[0], coeff.fC[0], coeff.fD[0] - x);
29 SkASSERT(t >= 0 && t <= 1);
30 float y = coeff.eval(t)[1];
31 SkASSERT(y >= 0 && y <= 1.0001f);
32 return y;
33 }
34
nearly_le(SkScalar a,SkScalar b)35 static bool nearly_le(SkScalar a, SkScalar b) {
36 return a <= b || SkScalarNearlyZero(a - b);
37 }
38
exercise_cubicmap(SkPoint p1,SkPoint p2,skiatest::Reporter * reporter)39 static void exercise_cubicmap(SkPoint p1, SkPoint p2, skiatest::Reporter* reporter) {
40 const SkScalar MAX_SOLVER_ERR = 0.008f; // found by running w/ current impl
41
42 SkCubicMap cmap(p1, p2);
43
44 SkScalar prev_y = 0;
45 SkScalar dx = 1.0f / 512;
46 for (SkScalar x = dx; x < 1; x += dx) {
47 SkScalar y = cmap.computeYFromX(x);
48 // are we valid and (mostly) monotonic?
49 if (!nearly_le(prev_y, y)) {
50 cmap.computeYFromX(x);
51 REPORTER_ASSERT(reporter, false);
52 }
53 prev_y = y;
54
55 // are we close to the "correct" answer?
56 SkScalar yy = accurate_solve(p1, p2, x);
57 SkScalar diff = SkScalarAbs(yy - y);
58 REPORTER_ASSERT(reporter, diff < MAX_SOLVER_ERR);
59 }
60 }
61
DEF_TEST(CubicMap,r)62 DEF_TEST(CubicMap, r) {
63 const SkScalar values[] = {
64 0, 1, 0.5f, 0.0000001f, 0.999999f,
65 };
66
67 for (SkScalar x0 : values) {
68 for (SkScalar y0 : values) {
69 for (SkScalar x1 : values) {
70 for (SkScalar y1 : values) {
71 exercise_cubicmap({ x0, y0 }, { x1, y1 }, r);
72 }
73 }
74 }
75 }
76 }
77