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 "SkLineParameters.h"
9 #include "Test.h"
10 
11 // tests to verify that distance calculations are coded correctly
12 static const SkDCubic tests[] = {
13     {{{0, 0}, {1, 1}, {2, 2}, {0, 3}}},
14     {{{0, 0}, {1, 1}, {2, 2}, {3, 0}}},
15     {{{0, 0}, {5, 0}, {-2, 4}, {3, 4}}},
16     {{{0, 2}, {1, 0}, {2, 0}, {3, 0}}},
17     {{{0, .2}, {1, 0}, {2, 0}, {3, 0}}},
18     {{{0, .02}, {1, 0}, {2, 0}, {3, 0}}},
19     {{{0, .002}, {1, 0}, {2, 0}, {3, 0}}},
20     {{{0, .0002}, {1, 0}, {2, 0}, {3, 0}}},
21     {{{0, .00002}, {1, 0}, {2, 0}, {3, 0}}},
22     {{{0, FLT_EPSILON * 2}, {1, 0}, {2, 0}, {3, 0}}},
23 };
24 
25 static const double answers[][2] = {
26     {1, 2},
27     {1, 2},
28     {4, 4},
29     {1.1094003924, 0.5547001962},
30     {0.133038021, 0.06651901052},
31     {0.0133330370, 0.006666518523},
32     {0.001333333037, 0.0006666665185},
33     {0.000133333333, 6.666666652e-05},
34     {1.333333333e-05, 6.666666667e-06},
35     {1.5894571940104115e-07, 7.9472859700520577e-08},
36 };
37 
38 static const size_t tests_count = SK_ARRAY_COUNT(tests);
39 
DEF_TEST(PathOpsLineParameters,reporter)40 DEF_TEST(PathOpsLineParameters, reporter) {
41     for (size_t index = 0; index < tests_count; ++index) {
42         SkLineParameters lineParameters;
43         const SkDCubic& cubic = tests[index];
44         SkASSERT(ValidCubic(cubic));
45         lineParameters.cubicEndPoints(cubic, 0, 3);
46         double denormalizedDistance[2];
47         denormalizedDistance[0] = lineParameters.controlPtDistance(cubic, 1);
48         denormalizedDistance[1] = lineParameters.controlPtDistance(cubic, 2);
49         double normalSquared = lineParameters.normalSquared();
50         size_t inner;
51         for (inner = 0; inner < 2; ++inner) {
52             double distSq = denormalizedDistance[inner];
53             distSq *= distSq;
54             double answersSq = answers[index][inner];
55             answersSq *= answersSq;
56             if (AlmostEqualUlps(distSq, normalSquared * answersSq)) {
57                 continue;
58             }
59             SkDebugf("%s [%d,%d] denormalizedDistance:%g != answer:%g"
60                     " distSq:%g answerSq:%g normalSquared:%g\n",
61                     __FUNCTION__, static_cast<int>(index), (int)inner,
62                     denormalizedDistance[inner], answers[index][inner],
63                     distSq, answersSq, normalSquared);
64         }
65         lineParameters.normalize();
66         double normalizedDistance[2];
67         normalizedDistance[0] = lineParameters.controlPtDistance(cubic, 1);
68         normalizedDistance[1] = lineParameters.controlPtDistance(cubic, 2);
69         for (inner = 0; inner < 2; ++inner) {
70             if (AlmostEqualUlps(fabs(normalizedDistance[inner]), answers[index][inner])) {
71                 continue;
72             }
73             SkDebugf("%s [%d,%d] normalizedDistance:%1.9g != answer:%g\n",
74                     __FUNCTION__, static_cast<int>(index), (int)inner,
75                     normalizedDistance[inner], answers[index][inner]);
76             REPORTER_ASSERT(reporter, 0);
77         }
78     }
79 }
80