| /* |
| * Copyright 2012 Google Inc. |
| * |
| * Use of this source code is governed by a BSD-style license that can be |
| * found in the LICENSE file. |
| */ |
| #include "PathOpsTestCommon.h" |
| #include "SkPathOpsCubic.h" |
| #include "Test.h" |
| |
| static const SkDCubic tests[] = { |
| {{{2, 0}, {3, 1}, {2, 2}, {1, 1}}}, |
| {{{3, 1}, {2, 2}, {1, 1}, {2, 0}}}, |
| {{{3, 0}, {2, 1}, {3, 2}, {1, 1}}}, |
| }; |
| |
| static const size_t tests_count = SK_ARRAY_COUNT(tests); |
| |
| DEF_TEST(PathOpsDCubic, reporter) { |
| for (size_t index = 0; index < tests_count; ++index) { |
| const SkDCubic& cubic = tests[index]; |
| SkASSERT(ValidCubic(cubic)); |
| bool result = cubic.clockwise(); |
| if (!result) { |
| SkDebugf("%s [%d] expected clockwise\n", __FUNCTION__, index); |
| REPORTER_ASSERT(reporter, 0); |
| } |
| } |
| } |
| |
| static const SkDCubic hullTests[] = { |
| {{{2.6250000819563866, 2.3750000223517418}, {2.833333432674408, 2.3333333432674408}, {3.1111112236976624, 2.3333333134651184}, {3.4074075222015381, 2.3333332538604736}}}, |
| }; |
| |
| static const size_t hullTests_count = SK_ARRAY_COUNT(hullTests); |
| |
| DEF_TEST(PathOpsCubicHull, reporter) { |
| for (size_t index = 0; index < hullTests_count; ++index) { |
| const SkDCubic& cubic = hullTests[index]; |
| char order[4]; |
| cubic.convexHull(order); |
| } |
| } |