Lines Matching refs:pts
15 static void debugShowLineIntersection(int pts, const SkIntersectionHelper& wt,
17 SkASSERT(i.used() == pts);
18 if (!pts) {
20 __FUNCTION__, LINE_DEBUG_DATA(wt.pts()), LINE_DEBUG_DATA(wn.pts()));
24 i[0][0], LINE_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0));
25 if (pts == 2) {
28 SkDebugf(" wnTs[0]=%g " LINE_DEBUG_STR, i[1][0], LINE_DEBUG_DATA(wn.pts()));
29 if (pts == 2) {
35 static void debugShowQuadLineIntersection(int pts, const SkIntersectionHelper& wt,
38 SkASSERT(i.used() == pts);
39 if (!pts) {
41 __FUNCTION__, QUAD_DEBUG_DATA(wt.pts()), LINE_DEBUG_DATA(wn.pts()));
45 i[0][0], QUAD_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0));
46 for (int n = 1; n < pts; ++n) {
49 SkDebugf(" wnTs[0]=%g " LINE_DEBUG_STR, i[1][0], LINE_DEBUG_DATA(wn.pts()));
50 for (int n = 1; n < pts; ++n) {
56 static void debugShowQuadIntersection(int pts, const SkIntersectionHelper& wt,
58 SkASSERT(i.used() == pts);
59 if (!pts) {
61 __FUNCTION__, QUAD_DEBUG_DATA(wt.pts()), QUAD_DEBUG_DATA(wn.pts()));
65 i[0][0], QUAD_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0));
66 for (int n = 1; n < pts; ++n) {
69 SkDebugf(" wnTs[0]=%g " QUAD_DEBUG_STR, i[1][0], QUAD_DEBUG_DATA(wn.pts()));
70 for (int n = 1; n < pts; ++n) {
76 static void debugShowConicLineIntersection(int pts, const SkIntersectionHelper& wt,
78 SkASSERT(i.used() == pts);
79 if (!pts) {
81 __FUNCTION__, CONIC_DEBUG_DATA(wt.pts(), wt.weight()), LINE_DEBUG_DATA(wn.pts()));
85 i[0][0], CONIC_DEBUG_DATA(wt.pts(), wt.weight()), PT_DEBUG_DATA(i, 0));
86 for (int n = 1; n < pts; ++n) {
89 SkDebugf(" wnTs[0]=%g " LINE_DEBUG_STR, i[1][0], LINE_DEBUG_DATA(wn.pts()));
90 for (int n = 1; n < pts; ++n) {
96 static void debugShowConicQuadIntersection(int pts, const SkIntersectionHelper& wt,
98 SkASSERT(i.used() == pts);
99 if (!pts) {
101 __FUNCTION__, CONIC_DEBUG_DATA(wt.pts(), wt.weight()), QUAD_DEBUG_DATA(wn.pts()));
105 i[0][0], CONIC_DEBUG_DATA(wt.pts(), wt.weight()), PT_DEBUG_DATA(i, 0));
106 for (int n = 1; n < pts; ++n) {
109 SkDebugf(" wnTs[0]=%g " QUAD_DEBUG_STR, i[1][0], QUAD_DEBUG_DATA(wn.pts()));
110 for (int n = 1; n < pts; ++n) {
116 static void debugShowConicIntersection(int pts, const SkIntersectionHelper& wt,
118 SkASSERT(i.used() == pts);
119 if (!pts) {
121 __FUNCTION__, CONIC_DEBUG_DATA(wt.pts(), wt.weight()),
122 CONIC_DEBUG_DATA(wn.pts(), wn.weight()));
126 i[0][0], CONIC_DEBUG_DATA(wt.pts(), wt.weight()), PT_DEBUG_DATA(i, 0));
127 for (int n = 1; n < pts; ++n) {
130 SkDebugf(" wnTs[0]=%g " CONIC_DEBUG_STR, i[1][0], CONIC_DEBUG_DATA(wn.pts(), wn.weight()));
131 for (int n = 1; n < pts; ++n) {
137 static void debugShowCubicLineIntersection(int pts, const SkIntersectionHelper& wt,
139 SkASSERT(i.used() == pts);
140 if (!pts) {
142 __FUNCTION__, CUBIC_DEBUG_DATA(wt.pts()), LINE_DEBUG_DATA(wn.pts()));
146 i[0][0], CUBIC_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0));
147 for (int n = 1; n < pts; ++n) {
150 SkDebugf(" wnTs[0]=%g " LINE_DEBUG_STR, i[1][0], LINE_DEBUG_DATA(wn.pts()));
151 for (int n = 1; n < pts; ++n) {
157 static void debugShowCubicQuadIntersection(int pts, const SkIntersectionHelper& wt,
159 SkASSERT(i.used() == pts);
160 if (!pts) {
162 __FUNCTION__, CUBIC_DEBUG_DATA(wt.pts()), QUAD_DEBUG_DATA(wn.pts()));
166 i[0][0], CUBIC_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0));
167 for (int n = 1; n < pts; ++n) {
170 SkDebugf(" wnTs[0]=%g " QUAD_DEBUG_STR, i[1][0], QUAD_DEBUG_DATA(wn.pts()));
171 for (int n = 1; n < pts; ++n) {
177 static void debugShowCubicConicIntersection(int pts, const SkIntersectionHelper& wt,
179 SkASSERT(i.used() == pts);
180 if (!pts) {
182 __FUNCTION__, CUBIC_DEBUG_DATA(wt.pts()), CONIC_DEBUG_DATA(wn.pts(), wn.weight()));
186 i[0][0], CUBIC_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0));
187 for (int n = 1; n < pts; ++n) {
190 SkDebugf(" wnTs[0]=%g " CONIC_DEBUG_STR, i[1][0], CONIC_DEBUG_DATA(wn.pts(), wn.weight()));
191 for (int n = 1; n < pts; ++n) {
197 static void debugShowCubicIntersection(int pts, const SkIntersectionHelper& wt,
199 SkASSERT(i.used() == pts);
200 if (!pts) {
202 __FUNCTION__, CUBIC_DEBUG_DATA(wt.pts()), CUBIC_DEBUG_DATA(wn.pts()));
206 i[0][0], CUBIC_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0));
207 for (int n = 1; n < pts; ++n) {
210 SkDebugf(" wnTs[0]=%g " CUBIC_DEBUG_STR, i[1][0], CUBIC_DEBUG_DATA(wn.pts()));
211 for (int n = 1; n < pts; ++n) {
283 int pts = 0;
296 pts = ts.lineHorizontal(wn.pts(), wt.left(),
298 debugShowLineIntersection(pts, wn, wt, ts);
301 pts = ts.quadHorizontal(wn.pts(), wt.left(),
303 debugShowQuadLineIntersection(pts, wn, wt, ts);
306 pts = ts.conicHorizontal(wn.pts(), wn.weight(), wt.left(),
308 debugShowConicLineIntersection(pts, wn, wt, ts);
311 pts = ts.cubicHorizontal(wn.pts(), wt.left(),
313 debugShowCubicLineIntersection(pts, wn, wt, ts);
325 pts = ts.lineVertical(wn.pts(), wt.top(),
327 debugShowLineIntersection(pts, wn, wt, ts);
331 pts = ts.quadVertical(wn.pts(), wt.top(),
333 debugShowQuadLineIntersection(pts, wn, wt, ts);
337 pts = ts.conicVertical(wn.pts(), wn.weight(), wt.top(),
339 debugShowConicLineIntersection(pts, wn, wt, ts);
343 pts = ts.cubicVertical(wn.pts(), wt.top(),
345 debugShowCubicLineIntersection(pts, wn, wt, ts);
355 pts = ts.lineHorizontal(wt.pts(), wn.left(),
357 debugShowLineIntersection(pts, wt, wn, ts);
360 pts = ts.lineVertical(wt.pts(), wn.top(),
362 debugShowLineIntersection(pts, wt, wn, ts);
365 pts = ts.lineLine(wt.pts(), wn.pts());
366 debugShowLineIntersection(pts, wt, wn, ts);
370 pts = ts.quadLine(wn.pts(), wt.pts());
371 debugShowQuadLineIntersection(pts, wn, wt, ts);
375 pts = ts.conicLine(wn.pts(), wn.weight(), wt.pts());
376 debugShowConicLineIntersection(pts, wn, wt, ts);
380 pts = ts.cubicLine(wn.pts(), wt.pts());
381 debugShowCubicLineIntersection(pts, wn, wt, ts);
390 pts = ts.quadHorizontal(wt.pts(), wn.left(),
392 debugShowQuadLineIntersection(pts, wt, wn, ts);
395 pts = ts.quadVertical(wt.pts(), wn.top(),
397 debugShowQuadLineIntersection(pts, wt, wn, ts);
400 pts = ts.quadLine(wt.pts(), wn.pts());
401 debugShowQuadLineIntersection(pts, wt, wn, ts);
404 pts = ts.intersect(quad1.set(wt.pts()), quad2.set(wn.pts()));
405 debugShowQuadIntersection(pts, wt, wn, ts);
410 pts = ts.intersect(conic2.set(wn.pts(), wn.weight()),
411 quad1.set(wt.pts()));
412 debugShowConicQuadIntersection(pts, wn, wt, ts);
417 pts = ts.intersect(cubic2.set(wn.pts()), quad1.set(wt.pts()));
418 debugShowCubicQuadIntersection(pts, wn, wt, ts);
428 pts = ts.conicHorizontal(wt.pts(), wt.weight(), wn.left(),
430 debugShowConicLineIntersection(pts, wt, wn, ts);
433 pts = ts.conicVertical(wt.pts(), wt.weight(), wn.top(),
435 debugShowConicLineIntersection(pts, wt, wn, ts);
438 pts = ts.conicLine(wt.pts(), wt.weight(), wn.pts());
439 debugShowConicLineIntersection(pts, wt, wn, ts);
442 pts = ts.intersect(conic1.set(wt.pts(), wt.weight()),
443 quad2.set(wn.pts()));
444 debugShowConicQuadIntersection(pts, wt, wn, ts);
448 pts = ts.intersect(conic1.set(wt.pts(), wt.weight()),
449 conic2.set(wn.pts(), wn.weight()));
450 debugShowConicIntersection(pts, wt, wn, ts);
455 pts = ts.intersect(cubic2.set(wn.pts()
457 conic1.set(wt.pts(), wt.weight()
459 debugShowCubicConicIntersection(pts, wn, wt, ts);
467 pts = ts.cubicHorizontal(wt.pts(), wn.left(),
469 debugShowCubicLineIntersection(pts, wt, wn, ts);
472 pts = ts.cubicVertical(wt.pts(), wn.top(),
474 debugShowCubicLineIntersection(pts, wt, wn, ts);
477 pts = ts.cubicLine(wt.pts(), wn.pts());
478 debugShowCubicLineIntersection(pts, wt, wn, ts);
481 pts = ts.intersect(cubic1.set(wt.pts()), quad2.set(wn.pts()));
482 debugShowCubicQuadIntersection(pts, wt, wn, ts);
486 pts = ts.intersect(cubic1.set(wt.pts()
488 conic2.set(wn.pts(), wn.weight()
490 debugShowCubicConicIntersection(pts, wt, wn, ts);
494 pts = ts.intersect(cubic1.set(wt.pts()), cubic2.set(wn.pts()));
495 debugShowCubicIntersection(pts, wt, wn, ts);
510 for (int pt = 0; pt < pts; ++pt) {