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 "SkPathOpsCubic.h" | 7 #include "SkPathOpsCubic.h" |
8 | 8 |
9 extern const SkDCubic pointDegenerates[]; | 9 extern const SkDCubic pointDegenerates[]; |
10 extern const SkDCubic notPointDegenerates[]; | 10 extern const SkDCubic notPointDegenerates[]; |
11 extern const SkDCubic tests[][2]; | 11 extern const SkDCubic tests[][2]; |
12 extern SkDCubic hexTests[][2]; | 12 extern SkDCubic hexTests[][2]; |
13 | 13 |
14 extern void convert_testx(); | |
15 | |
16 extern const SkDCubic lines[]; | 14 extern const SkDCubic lines[]; |
17 extern const SkDCubic notLines[]; | 15 extern const SkDCubic notLines[]; |
18 extern const SkDCubic modEpsilonLines[]; | 16 extern const SkDCubic modEpsilonLines[]; |
19 extern const SkDCubic lessEpsilonLines[]; | 17 extern const SkDCubic lessEpsilonLines[]; |
20 extern const SkDCubic negEpsilonLines[]; | 18 extern const SkDCubic negEpsilonLines[]; |
21 | 19 |
22 extern const size_t pointDegenerates_count; | 20 extern const size_t pointDegenerates_count; |
23 extern const size_t notPointDegenerates_count; | 21 extern const size_t notPointDegenerates_count; |
24 extern const size_t tests_count; | 22 extern const size_t tests_count; |
25 extern const size_t hexTests_count; | 23 extern const size_t hexTests_count; |
26 extern const size_t lines_count; | 24 extern const size_t lines_count; |
27 extern const size_t notLines_count; | 25 extern const size_t notLines_count; |
28 extern const size_t modEpsilonLines_count; | 26 extern const size_t modEpsilonLines_count; |
29 extern const size_t lessEpsilonLines_count; | 27 extern const size_t lessEpsilonLines_count; |
30 extern const size_t negEpsilonLines_count; | 28 extern const size_t negEpsilonLines_count; |
OLD | NEW |