OLD | NEW |
1 /* | 1 /* |
2 * Copyright 2011 Google Inc. | 2 * Copyright 2011 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 | 7 |
| 8 #include "SkGeometry.h" |
8 #include "Test.h" | 9 #include "Test.h" |
9 #include "SkGeometry.h" | |
10 | 10 |
11 static bool nearly_equal(const SkPoint& a, const SkPoint& b) { | 11 static bool nearly_equal(const SkPoint& a, const SkPoint& b) { |
12 return SkScalarNearlyEqual(a.fX, b.fX) && SkScalarNearlyEqual(a.fY, b.fY); | 12 return SkScalarNearlyEqual(a.fX, b.fX) && SkScalarNearlyEqual(a.fY, b.fY); |
13 } | 13 } |
14 | 14 |
15 static void testChopCubic(skiatest::Reporter* reporter) { | 15 static void testChopCubic(skiatest::Reporter* reporter) { |
16 /* | 16 /* |
17 Inspired by this test, which used to assert that the tValues had dups | 17 Inspired by this test, which used to assert that the tValues had dups |
18 | 18 |
19 <path stroke="#202020" d="M0,0 C0,0 1,1 2190,5130 C2190,5070 2220,5010 2
205,4980" /> | 19 <path stroke="#202020" d="M0,0 C0,0 1,1 2190,5130 C2190,5070 2220,5010 2
205,4980" /> |
(...skipping 32 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
52 { SkIntToScalar(2), 0, }, | 52 { SkIntToScalar(2), 0, }, |
53 { SkIntToScalar(3), SkIntToScalar(1), }, | 53 { SkIntToScalar(3), SkIntToScalar(1), }, |
54 { SkIntToScalar(3), SkIntToScalar(3) }, | 54 { SkIntToScalar(3), SkIntToScalar(3) }, |
55 }; | 55 }; |
56 for (int i = 0; i < 4; ++i) { | 56 for (int i = 0; i < 4; ++i) { |
57 REPORTER_ASSERT(reporter, nearly_equal(cubic[i], dst[i])); | 57 REPORTER_ASSERT(reporter, nearly_equal(cubic[i], dst[i])); |
58 } | 58 } |
59 | 59 |
60 testChopCubic(reporter); | 60 testChopCubic(reporter); |
61 } | 61 } |
OLD | NEW |