xref: /aosp_15_r20/external/skia/tests/Point3Test.cpp (revision c8dee2aa9b3f27cf6c858bd81872bdeb2c07ed17)
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 
8 // Unit tests for src/core/SkPoint3.cpp and its header
9 
10 #include "include/core/SkPoint3.h"
11 #include "include/core/SkScalar.h"
12 #include "src/base/SkRandom.h"
13 #include "tests/Test.h"
14 
15 #include <array>
16 #include <cstddef>
17 
test_eq_ops(skiatest::Reporter * reporter)18 static void test_eq_ops(skiatest::Reporter* reporter) {
19     const SkPoint3 p0 = SkPoint3::Make(0, 0, 0);
20     const SkPoint3 p1 = SkPoint3::Make(1, 1, 1);
21     const SkPoint3 p2 = SkPoint3::Make(1, 1, 1);
22 
23     REPORTER_ASSERT(reporter, p0 != p1);
24     REPORTER_ASSERT(reporter, p1 == p2);
25 }
26 
test_ops(skiatest::Reporter * reporter)27 static void test_ops(skiatest::Reporter* reporter) {
28     SkPoint3 v = SkPoint3::Make(1, 1, 1);
29     v.normalize();
30     REPORTER_ASSERT(reporter, SkScalarNearlyEqual(v.length(), SK_Scalar1));
31 
32     // scale
33     SkPoint3 p = v.makeScale(3.0f);
34     REPORTER_ASSERT(reporter, SkScalarNearlyEqual(p.length(), 3.0f));
35 
36     p.scale(1.0f/3.0f);
37     REPORTER_ASSERT(reporter, SkScalarNearlyEqual(p.length(), SK_Scalar1));
38 
39     SkPoint3 p1 = SkPoint3::Make(20.0f, 2.0f, 10.0f);
40     SkPoint3 p2 = -p1;
41 
42     // -
43     p = p1 - p1;
44     REPORTER_ASSERT(reporter, SkScalarNearlyEqual(p.x(), 0.0f));
45     REPORTER_ASSERT(reporter, SkScalarNearlyEqual(p.y(), 0.0f));
46     REPORTER_ASSERT(reporter, SkScalarNearlyEqual(p.z(), 0.0f));
47 
48     // +
49     p = p1 + p2;
50     REPORTER_ASSERT(reporter, SkScalarNearlyEqual(p.x(), 0.0f));
51     REPORTER_ASSERT(reporter, SkScalarNearlyEqual(p.y(), 0.0f));
52     REPORTER_ASSERT(reporter, SkScalarNearlyEqual(p.z(), 0.0f));
53 }
54 
test_dot(skiatest::Reporter * reporter)55 static void test_dot(skiatest::Reporter* reporter) {
56     const SkPoint3 xAxis = SkPoint3::Make(1.0f, 0.0f, 0.0f);
57     const SkPoint3 yAxis = SkPoint3::Make(0.0f, 1.0f, 0.0f);
58     const SkPoint3 zAxis = SkPoint3::Make(0.0f, 0.0f, 1.0f);
59 
60     SkScalar dot = xAxis.dot(yAxis);
61     REPORTER_ASSERT(reporter, SkScalarNearlyEqual(dot, 0.0f));
62 
63     dot = yAxis.dot(zAxis);
64     REPORTER_ASSERT(reporter, SkScalarNearlyEqual(dot, 0.0f));
65 
66     dot = zAxis.dot(xAxis);
67     REPORTER_ASSERT(reporter, SkScalarNearlyEqual(dot, 0.0f));
68 
69     SkPoint3 v = SkPoint3::Make(13.0f, 2.0f, 7.0f);
70     v.normalize();
71 
72     dot = v.dot(v);
73     REPORTER_ASSERT(reporter, SkScalarNearlyEqual(dot, 1.0f));
74 
75     v = SkPoint3::Make(SK_ScalarRoot2Over2, SK_ScalarRoot2Over2, 0.0f);
76 
77     dot = xAxis.dot(v);
78     REPORTER_ASSERT(reporter, SkScalarNearlyEqual(dot, SK_ScalarRoot2Over2));
79 
80     dot = yAxis.dot(v);
81     REPORTER_ASSERT(reporter, SkScalarNearlyEqual(dot, SK_ScalarRoot2Over2));
82 }
83 
test_length(skiatest::Reporter * reporter,SkScalar x,SkScalar y,SkScalar z,SkScalar expectedLen)84 static void test_length(skiatest::Reporter* reporter,
85                         SkScalar x, SkScalar y, SkScalar z, SkScalar expectedLen) {
86     SkPoint3 point = SkPoint3::Make(x, y, z);
87 
88     SkScalar s1 = point.length();
89     SkScalar s2 = SkPoint3::Length(x, y, z);
90 
91     REPORTER_ASSERT(reporter, SkScalarNearlyEqual(s1, s2));
92     REPORTER_ASSERT(reporter, SkScalarNearlyEqual(s1, expectedLen));
93 }
94 
test_normalize(skiatest::Reporter * reporter,SkScalar x,SkScalar y,SkScalar z,SkScalar expectedLen)95 static void test_normalize(skiatest::Reporter* reporter,
96                            SkScalar x, SkScalar y, SkScalar z, SkScalar expectedLen) {
97     SkPoint3 point = SkPoint3::Make(x, y, z);
98 
99     bool result = point.normalize();
100     SkScalar newLength = point.length();
101 
102     if (0 == expectedLen) {
103         const SkPoint3 empty = SkPoint3::Make(0.0f, 0.0f, 0.0f);
104 
105         REPORTER_ASSERT(reporter, SkScalarNearlyEqual(newLength, 0));
106         REPORTER_ASSERT(reporter, !result);
107         REPORTER_ASSERT(reporter, point == empty);
108     } else {
109         REPORTER_ASSERT(reporter, SkScalarNearlyEqual(newLength, SK_Scalar1));
110         REPORTER_ASSERT(reporter, result);
111     }
112     SkRandom random;
113     random.setSeed(1234);
114     SkPoint3 pt3;
115     int testCount = 100000;
116     for (int index = 0; index < testCount; ++index) {
117         SkScalar testVal;
118         do {
119             testVal = random.nextRangeF(0, 2);
120         } while (!testVal);
121         pt3.set(testVal, 0, 0);
122         REPORTER_ASSERT(reporter, !pt3.normalize() || 1 == pt3.fX);
123     }
124 }
125 
DEF_TEST(Point3,reporter)126 DEF_TEST(Point3, reporter) {
127     test_eq_ops(reporter);
128     test_ops(reporter);
129     test_dot(reporter);
130 
131     static const struct {
132         SkScalar fX;
133         SkScalar fY;
134         SkScalar fZ;
135         SkScalar fLength;
136     } gRec[] = {
137         { 0.0f, 0.0f, 0.0f, 0.0f },
138         { 0.3f, 0.4f, 0.5f, SK_ScalarRoot2Over2 },
139         { 1.0e-37f, 1.0e-37f, 1.0e-37f, 0.0f },  // underflows
140         { 3.4e38f, 0.0f, 0.0f, 3.4e38f }         // overflows
141     };
142 
143     for (size_t i = 0; i < std::size(gRec); ++i) {
144         test_length(reporter, gRec[i].fX, gRec[i].fY, gRec[i].fZ, gRec[i].fLength);
145         test_normalize(reporter, gRec[i].fX, gRec[i].fY, gRec[i].fZ, gRec[i].fLength);
146     }
147 }
148