OLD | NEW |
1 /* | 1 /* |
2 * Copyright 2014 Google Inc. | 2 * Copyright 2014 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 "SkPathOpsTSect.h" | 8 #include "SkPathOpsTSect.h" |
9 | 9 |
10 int SkIntersections::intersect(const SkDQuad& quad1, const SkDQuad& quad2) { | 10 int SkIntersections::intersect(const SkDQuad& quad1, const SkDQuad& quad2) { |
11 SkTSect<SkDQuad, SkDQuad> sect1(quad1 PATH_OPS_DEBUG_T_SECT_PARAMS(1)); | 11 SkTSect<SkDQuad, SkDQuad> sect1(quad1 |
12 SkTSect<SkDQuad, SkDQuad> sect2(quad2 PATH_OPS_DEBUG_T_SECT_PARAMS(2)); | 12 SkDEBUGPARAMS(debugGlobalState()) PATH_OPS_DEBUG_T_SECT_PARAMS(1)); |
| 13 SkTSect<SkDQuad, SkDQuad> sect2(quad2 |
| 14 SkDEBUGPARAMS(debugGlobalState()) PATH_OPS_DEBUG_T_SECT_PARAMS(2)); |
13 SkTSect<SkDQuad, SkDQuad>::BinarySearch(§1, §2, this); | 15 SkTSect<SkDQuad, SkDQuad>::BinarySearch(§1, §2, this); |
14 return used(); | 16 return used(); |
15 } | 17 } |
16 | 18 |
17 int SkIntersections::intersect(const SkDConic& conic, const SkDQuad& quad) { | 19 int SkIntersections::intersect(const SkDConic& conic, const SkDQuad& quad) { |
18 SkTSect<SkDConic, SkDQuad> sect1(conic PATH_OPS_DEBUG_T_SECT_PARAMS(1)); | 20 SkTSect<SkDConic, SkDQuad> sect1(conic |
19 SkTSect<SkDQuad, SkDConic> sect2(quad PATH_OPS_DEBUG_T_SECT_PARAMS(2)); | 21 SkDEBUGPARAMS(debugGlobalState()) PATH_OPS_DEBUG_T_SECT_PARAMS(1)); |
| 22 SkTSect<SkDQuad, SkDConic> sect2(quad |
| 23 SkDEBUGPARAMS(debugGlobalState()) PATH_OPS_DEBUG_T_SECT_PARAMS(2)); |
20 SkTSect<SkDConic, SkDQuad>::BinarySearch(§1, §2, this); | 24 SkTSect<SkDConic, SkDQuad>::BinarySearch(§1, §2, this); |
21 return used(); | 25 return used(); |
22 } | 26 } |
23 | 27 |
24 int SkIntersections::intersect(const SkDConic& conic1, const SkDConic& conic2) { | 28 int SkIntersections::intersect(const SkDConic& conic1, const SkDConic& conic2) { |
25 SkTSect<SkDConic, SkDConic> sect1(conic1 PATH_OPS_DEBUG_T_SECT_PARAMS(1)); | 29 SkTSect<SkDConic, SkDConic> sect1(conic1 |
26 SkTSect<SkDConic, SkDConic> sect2(conic2 PATH_OPS_DEBUG_T_SECT_PARAMS(2)); | 30 SkDEBUGPARAMS(debugGlobalState()) PATH_OPS_DEBUG_T_SECT_PARAMS(1)); |
| 31 SkTSect<SkDConic, SkDConic> sect2(conic2 |
| 32 SkDEBUGPARAMS(debugGlobalState()) PATH_OPS_DEBUG_T_SECT_PARAMS(2)); |
27 SkTSect<SkDConic, SkDConic>::BinarySearch(§1, §2, this); | 33 SkTSect<SkDConic, SkDConic>::BinarySearch(§1, §2, this); |
28 return used(); | 34 return used(); |
29 } | 35 } |
30 | 36 |
31 int SkIntersections::intersect(const SkDCubic& cubic, const SkDQuad& quad) { | 37 int SkIntersections::intersect(const SkDCubic& cubic, const SkDQuad& quad) { |
32 SkTSect<SkDCubic, SkDQuad> sect1(cubic PATH_OPS_DEBUG_T_SECT_PARAMS(1)); | 38 SkTSect<SkDCubic, SkDQuad> sect1(cubic |
33 SkTSect<SkDQuad, SkDCubic> sect2(quad PATH_OPS_DEBUG_T_SECT_PARAMS(2)); | 39 SkDEBUGPARAMS(debugGlobalState()) PATH_OPS_DEBUG_T_SECT_PARAMS(1)); |
| 40 SkTSect<SkDQuad, SkDCubic> sect2(quad |
| 41 SkDEBUGPARAMS(debugGlobalState()) PATH_OPS_DEBUG_T_SECT_PARAMS(2)); |
34 SkTSect<SkDCubic, SkDQuad>::BinarySearch(§1, §2, this); | 42 SkTSect<SkDCubic, SkDQuad>::BinarySearch(§1, §2, this); |
35 return used(); | 43 return used(); |
36 } | 44 } |
37 | 45 |
38 int SkIntersections::intersect(const SkDCubic& cubic, const SkDConic& conic) { | 46 int SkIntersections::intersect(const SkDCubic& cubic, const SkDConic& conic) { |
39 SkTSect<SkDCubic, SkDConic> sect1(cubic PATH_OPS_DEBUG_T_SECT_PARAMS(1)); | 47 SkTSect<SkDCubic, SkDConic> sect1(cubic |
40 SkTSect<SkDConic, SkDCubic> sect2(conic PATH_OPS_DEBUG_T_SECT_PARAMS(2)); | 48 SkDEBUGPARAMS(debugGlobalState()) PATH_OPS_DEBUG_T_SECT_PARAMS(1)); |
| 49 SkTSect<SkDConic, SkDCubic> sect2(conic |
| 50 SkDEBUGPARAMS(debugGlobalState()) PATH_OPS_DEBUG_T_SECT_PARAMS(2)); |
41 SkTSect<SkDCubic, SkDConic>::BinarySearch(§1, §2, this); | 51 SkTSect<SkDCubic, SkDConic>::BinarySearch(§1, §2, this); |
42 return used(); | 52 return used(); |
43 } | 53 } |
44 | 54 |
45 int SkIntersections::intersect(const SkDCubic& cubic1, const SkDCubic& cubic2) { | 55 int SkIntersections::intersect(const SkDCubic& cubic1, const SkDCubic& cubic2) { |
46 SkTSect<SkDCubic, SkDCubic> sect1(cubic1 PATH_OPS_DEBUG_T_SECT_PARAMS(1)); | 56 SkTSect<SkDCubic, SkDCubic> sect1(cubic1 |
47 SkTSect<SkDCubic, SkDCubic> sect2(cubic2 PATH_OPS_DEBUG_T_SECT_PARAMS(2)); | 57 SkDEBUGPARAMS(debugGlobalState()) PATH_OPS_DEBUG_T_SECT_PARAMS(1)); |
| 58 SkTSect<SkDCubic, SkDCubic> sect2(cubic2 |
| 59 SkDEBUGPARAMS(debugGlobalState()) PATH_OPS_DEBUG_T_SECT_PARAMS(2)); |
48 SkTSect<SkDCubic, SkDCubic>::BinarySearch(§1, §2, this); | 60 SkTSect<SkDCubic, SkDCubic>::BinarySearch(§1, §2, this); |
49 return used(); | 61 return used(); |
50 } | 62 } |
OLD | NEW |