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 "PathOpsTestCommon.h" |
8 #include "SkPathOpsCubic.h" | 8 #include "SkPathOpsCubic.h" |
9 #include "Test.h" | 9 #include "Test.h" |
10 | 10 |
11 static const SkDCubic hullTests[] = { | 11 static const CubicPts hullTests[] = { |
12 {{{2.6250000819563866, 2.3750000223517418}, {2.833333432674408, 2.33333334326744
08}, {3.1111112236976624, 2.3333333134651184}, {3.4074075222015381, 2.3333332538
604736}}}, | 12 {{{2.6250000819563866, 2.3750000223517418}, {2.833333432674408, 2.33333334326744
08}, {3.1111112236976624, 2.3333333134651184}, {3.4074075222015381, 2.3333332538
604736}}}, |
13 }; | 13 }; |
14 | 14 |
15 static const size_t hullTests_count = SK_ARRAY_COUNT(hullTests); | 15 static const size_t hullTests_count = SK_ARRAY_COUNT(hullTests); |
16 | 16 |
17 DEF_TEST(PathOpsCubicHull, reporter) { | 17 DEF_TEST(PathOpsCubicHull, reporter) { |
18 for (size_t index = 0; index < hullTests_count; ++index) { | 18 for (size_t index = 0; index < hullTests_count; ++index) { |
19 const SkDCubic& cubic = hullTests[index]; | 19 const CubicPts& c = hullTests[index]; |
| 20 SkDCubic cubic; |
| 21 cubic.debugSet(c.fPts); |
20 char order[4]; | 22 char order[4]; |
21 cubic.convexHull(order); | 23 cubic.convexHull(order); |
22 } | 24 } |
23 } | 25 } |
OLD | NEW |