OLD | NEW |
1 /* | 1 /* |
2 * Copyright 2012 Google Inc. | 2 * Copyright 2012 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 #include "PathOpsTestCommon.h" |
7 #include "SkPathOpsCubic.h" | 8 #include "SkPathOpsCubic.h" |
8 #include "Test.h" | 9 #include "Test.h" |
9 | 10 |
10 static const SkDCubic tests[] = { | 11 static const SkDCubic tests[] = { |
11 {{{2, 0}, {3, 1}, {2, 2}, {1, 1}}}, | 12 {{{2, 0}, {3, 1}, {2, 2}, {1, 1}}}, |
12 {{{3, 1}, {2, 2}, {1, 1}, {2, 0}}}, | 13 {{{3, 1}, {2, 2}, {1, 1}, {2, 0}}}, |
13 {{{3, 0}, {2, 1}, {3, 2}, {1, 1}}}, | 14 {{{3, 0}, {2, 1}, {3, 2}, {1, 1}}}, |
14 }; | 15 }; |
15 | 16 |
16 static const size_t tests_count = SK_ARRAY_COUNT(tests); | 17 static const size_t tests_count = SK_ARRAY_COUNT(tests); |
17 | 18 |
18 static void PathOpsDCubicTest(skiatest::Reporter* reporter) { | 19 static void PathOpsDCubicTest(skiatest::Reporter* reporter) { |
19 for (size_t index = 0; index < tests_count; ++index) { | 20 for (size_t index = 0; index < tests_count; ++index) { |
20 const SkDCubic& cubic = tests[index]; | 21 const SkDCubic& cubic = tests[index]; |
| 22 SkASSERT(ValidCubic(cubic)); |
21 bool result = cubic.clockwise(); | 23 bool result = cubic.clockwise(); |
22 if (!result) { | 24 if (!result) { |
23 SkDebugf("%s [%d] expected clockwise\n", __FUNCTION__, index); | 25 SkDebugf("%s [%d] expected clockwise\n", __FUNCTION__, index); |
24 REPORTER_ASSERT(reporter, 0); | 26 REPORTER_ASSERT(reporter, 0); |
25 } | 27 } |
26 } | 28 } |
27 } | 29 } |
28 | 30 |
29 #include "TestClassDef.h" | 31 #include "TestClassDef.h" |
30 DEFINE_TESTCLASS_SHORT(PathOpsDCubicTest) | 32 DEFINE_TESTCLASS_SHORT(PathOpsDCubicTest) |
OLD | NEW |