blob: 9bff5af4f0a7e9f1c1118061ec6631dd0b0e4284 [file] [log] [blame]
caryclark1049f122015-04-20 08:31:59 -07001/*
2 * Copyright 2014 Google Inc.
3 *
4 * Use of this source code is governed by a BSD-style license that can be
5 * found in the LICENSE file.
6 */
7
8#include "SkPathOpsTSect.h"
9
10int SkIntersections::intersect(const SkDQuad& quad1, const SkDQuad& quad2) {
caryclarke25a4f62016-07-26 09:26:29 -070011 SkTSect<SkDQuad, SkDQuad> sect1(quad1
caryclarka35ab3e2016-10-20 08:32:18 -070012 SkDEBUGPARAMS(globalState()) PATH_OPS_DEBUG_T_SECT_PARAMS(1));
caryclarke25a4f62016-07-26 09:26:29 -070013 SkTSect<SkDQuad, SkDQuad> sect2(quad2
caryclarka35ab3e2016-10-20 08:32:18 -070014 SkDEBUGPARAMS(globalState()) PATH_OPS_DEBUG_T_SECT_PARAMS(2));
caryclark1049f122015-04-20 08:31:59 -070015 SkTSect<SkDQuad, SkDQuad>::BinarySearch(&sect1, &sect2, this);
16 return used();
17}
18
19int SkIntersections::intersect(const SkDConic& conic, const SkDQuad& quad) {
caryclarke25a4f62016-07-26 09:26:29 -070020 SkTSect<SkDConic, SkDQuad> sect1(conic
caryclarka35ab3e2016-10-20 08:32:18 -070021 SkDEBUGPARAMS(globalState()) PATH_OPS_DEBUG_T_SECT_PARAMS(1));
caryclarke25a4f62016-07-26 09:26:29 -070022 SkTSect<SkDQuad, SkDConic> sect2(quad
caryclarka35ab3e2016-10-20 08:32:18 -070023 SkDEBUGPARAMS(globalState()) PATH_OPS_DEBUG_T_SECT_PARAMS(2));
caryclark1049f122015-04-20 08:31:59 -070024 SkTSect<SkDConic, SkDQuad>::BinarySearch(&sect1, &sect2, this);
25 return used();
26}
27
28int SkIntersections::intersect(const SkDConic& conic1, const SkDConic& conic2) {
caryclarke25a4f62016-07-26 09:26:29 -070029 SkTSect<SkDConic, SkDConic> sect1(conic1
caryclarka35ab3e2016-10-20 08:32:18 -070030 SkDEBUGPARAMS(globalState()) PATH_OPS_DEBUG_T_SECT_PARAMS(1));
caryclarke25a4f62016-07-26 09:26:29 -070031 SkTSect<SkDConic, SkDConic> sect2(conic2
caryclarka35ab3e2016-10-20 08:32:18 -070032 SkDEBUGPARAMS(globalState()) PATH_OPS_DEBUG_T_SECT_PARAMS(2));
caryclark1049f122015-04-20 08:31:59 -070033 SkTSect<SkDConic, SkDConic>::BinarySearch(&sect1, &sect2, this);
34 return used();
35}
36
37int SkIntersections::intersect(const SkDCubic& cubic, const SkDQuad& quad) {
caryclarke25a4f62016-07-26 09:26:29 -070038 SkTSect<SkDCubic, SkDQuad> sect1(cubic
caryclarka35ab3e2016-10-20 08:32:18 -070039 SkDEBUGPARAMS(globalState()) PATH_OPS_DEBUG_T_SECT_PARAMS(1));
caryclarke25a4f62016-07-26 09:26:29 -070040 SkTSect<SkDQuad, SkDCubic> sect2(quad
caryclarka35ab3e2016-10-20 08:32:18 -070041 SkDEBUGPARAMS(globalState()) PATH_OPS_DEBUG_T_SECT_PARAMS(2));
caryclark1049f122015-04-20 08:31:59 -070042 SkTSect<SkDCubic, SkDQuad>::BinarySearch(&sect1, &sect2, this);
43 return used();
44}
45
46int SkIntersections::intersect(const SkDCubic& cubic, const SkDConic& conic) {
caryclarke25a4f62016-07-26 09:26:29 -070047 SkTSect<SkDCubic, SkDConic> sect1(cubic
caryclarka35ab3e2016-10-20 08:32:18 -070048 SkDEBUGPARAMS(globalState()) PATH_OPS_DEBUG_T_SECT_PARAMS(1));
caryclarke25a4f62016-07-26 09:26:29 -070049 SkTSect<SkDConic, SkDCubic> sect2(conic
caryclarka35ab3e2016-10-20 08:32:18 -070050 SkDEBUGPARAMS(globalState()) PATH_OPS_DEBUG_T_SECT_PARAMS(2));
caryclark1049f122015-04-20 08:31:59 -070051 SkTSect<SkDCubic, SkDConic>::BinarySearch(&sect1, &sect2, this);
52 return used();
53}
54
55int SkIntersections::intersect(const SkDCubic& cubic1, const SkDCubic& cubic2) {
caryclarke25a4f62016-07-26 09:26:29 -070056 SkTSect<SkDCubic, SkDCubic> sect1(cubic1
caryclarka35ab3e2016-10-20 08:32:18 -070057 SkDEBUGPARAMS(globalState()) PATH_OPS_DEBUG_T_SECT_PARAMS(1));
caryclarke25a4f62016-07-26 09:26:29 -070058 SkTSect<SkDCubic, SkDCubic> sect2(cubic2
caryclarka35ab3e2016-10-20 08:32:18 -070059 SkDEBUGPARAMS(globalState()) PATH_OPS_DEBUG_T_SECT_PARAMS(2));
caryclark1049f122015-04-20 08:31:59 -070060 SkTSect<SkDCubic, SkDCubic>::BinarySearch(&sect1, &sect2, this);
61 return used();
62}