Lines Matching refs:pts
13 static void debugShowLineIntersection(int pts, const SkIntersectionHelper& wt,
15 SkASSERT(i.used() == pts);
16 if (!pts) {
18 __FUNCTION__, LINE_DEBUG_DATA(wt.pts()), LINE_DEBUG_DATA(wn.pts()));
22 i[0][0], LINE_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0));
23 if (pts == 2) {
26 SkDebugf(" wnTs[0]=%g " LINE_DEBUG_STR, i[1][0], LINE_DEBUG_DATA(wn.pts()));
27 if (pts == 2) {
33 static void debugShowQuadLineIntersection(int pts, const SkIntersectionHelper& wt,
36 SkASSERT(i.used() == pts);
37 if (!pts) {
39 __FUNCTION__, QUAD_DEBUG_DATA(wt.pts()), LINE_DEBUG_DATA(wn.pts()));
43 i[0][0], QUAD_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0));
44 for (int n = 1; n < pts; ++n) {
47 SkDebugf(" wnTs[0]=%g " LINE_DEBUG_STR, i[1][0], LINE_DEBUG_DATA(wn.pts()));
48 for (int n = 1; n < pts; ++n) {
54 static void debugShowQuadIntersection(int pts, const SkIntersectionHelper& wt,
56 SkASSERT(i.used() == pts);
57 if (!pts) {
59 __FUNCTION__, QUAD_DEBUG_DATA(wt.pts()), QUAD_DEBUG_DATA(wn.pts()));
63 i[0][0], QUAD_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0));
64 for (int n = 1; n < pts; ++n) {
67 SkDebugf(" wnTs[0]=%g " QUAD_DEBUG_STR, i[1][0], QUAD_DEBUG_DATA(wn.pts()));
68 for (int n = 1; n < pts; ++n) {
74 static void debugShowConicLineIntersection(int pts, const SkIntersectionHelper& wt,
76 SkASSERT(i.used() == pts);
77 if (!pts) {
79 __FUNCTION__, CONIC_DEBUG_DATA(wt.pts(), wt.weight()), LINE_DEBUG_DATA(wn.pts()));
83 i[0][0], CONIC_DEBUG_DATA(wt.pts(), wt.weight()), PT_DEBUG_DATA(i, 0));
84 for (int n = 1; n < pts; ++n) {
87 SkDebugf(" wnTs[0]=%g " LINE_DEBUG_STR, i[1][0], LINE_DEBUG_DATA(wn.pts()));
88 for (int n = 1; n < pts; ++n) {
94 static void debugShowConicQuadIntersection(int pts, const SkIntersectionHelper& wt,
96 SkASSERT(i.used() == pts);
97 if (!pts) {
99 __FUNCTION__, CONIC_DEBUG_DATA(wt.pts(), wt.weight()), QUAD_DEBUG_DATA(wn.pts()));
103 i[0][0], CONIC_DEBUG_DATA(wt.pts(), wt.weight()), PT_DEBUG_DATA(i, 0));
104 for (int n = 1; n < pts; ++n) {
107 SkDebugf(" wnTs[0]=%g " QUAD_DEBUG_STR, i[1][0], QUAD_DEBUG_DATA(wn.pts()));
108 for (int n = 1; n < pts; ++n) {
114 static void debugShowConicIntersection(int pts, const SkIntersectionHelper& wt,
116 SkASSERT(i.used() == pts);
117 if (!pts) {
119 __FUNCTION__, CONIC_DEBUG_DATA(wt.pts(), wt.weight()),
120 CONIC_DEBUG_DATA(wn.pts(), wn.weight()));
124 i[0][0], CONIC_DEBUG_DATA(wt.pts(), wt.weight()), PT_DEBUG_DATA(i, 0));
125 for (int n = 1; n < pts; ++n) {
128 SkDebugf(" wnTs[0]=%g " CONIC_DEBUG_STR, i[1][0], CONIC_DEBUG_DATA(wn.pts(), wn.weight()));
129 for (int n = 1; n < pts; ++n) {
135 static void debugShowCubicLineIntersection(int pts, const SkIntersectionHelper& wt,
137 SkASSERT(i.used() == pts);
138 if (!pts) {
140 __FUNCTION__, CUBIC_DEBUG_DATA(wt.pts()), LINE_DEBUG_DATA(wn.pts()));
144 i[0][0], CUBIC_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0));
145 for (int n = 1; n < pts; ++n) {
148 SkDebugf(" wnTs[0]=%g " LINE_DEBUG_STR, i[1][0], LINE_DEBUG_DATA(wn.pts()));
149 for (int n = 1; n < pts; ++n) {
155 static void debugShowCubicQuadIntersection(int pts, const SkIntersectionHelper& wt,
157 SkASSERT(i.used() == pts);
158 if (!pts) {
160 __FUNCTION__, CUBIC_DEBUG_DATA(wt.pts()), QUAD_DEBUG_DATA(wn.pts()));
164 i[0][0], CUBIC_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0));
165 for (int n = 1; n < pts; ++n) {
168 SkDebugf(" wnTs[0]=%g " QUAD_DEBUG_STR, i[1][0], QUAD_DEBUG_DATA(wn.pts()));
169 for (int n = 1; n < pts; ++n) {
175 static void debugShowCubicConicIntersection(int pts, const SkIntersectionHelper& wt,
177 SkASSERT(i.used() == pts);
178 if (!pts) {
180 __FUNCTION__, CUBIC_DEBUG_DATA(wt.pts()), CONIC_DEBUG_DATA(wn.pts(), wn.weight()));
184 i[0][0], CUBIC_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0));
185 for (int n = 1; n < pts; ++n) {
188 SkDebugf(" wnTs[0]=%g " CONIC_DEBUG_STR, i[1][0], CONIC_DEBUG_DATA(wn.pts(), wn.weight()));
189 for (int n = 1; n < pts; ++n) {
195 static void debugShowCubicIntersection(int pts, const SkIntersectionHelper& wt,
197 SkASSERT(i.used() == pts);
198 if (!pts) {
200 __FUNCTION__, CUBIC_DEBUG_DATA(wt.pts()), CUBIC_DEBUG_DATA(wn.pts()));
204 i[0][0], CUBIC_DEBUG_DATA(wt.pts()), PT_DEBUG_DATA(i, 0));
205 for (int n = 1; n < pts; ++n) {
208 SkDebugf(" wnTs[0]=%g " CUBIC_DEBUG_STR, i[1][0], CUBIC_DEBUG_DATA(wn.pts()));
209 for (int n = 1; n < pts; ++n) {
281 int pts = 0;
294 pts = ts.lineHorizontal(wn.pts(), wt.left(),
296 debugShowLineIntersection(pts, wn, wt, ts);
299 pts = ts.quadHorizontal(wn.pts(), wt.left(),
301 debugShowQuadLineIntersection(pts, wn, wt, ts);
304 pts = ts.conicHorizontal(wn.pts(), wn.weight(), wt.left(),
306 debugShowConicLineIntersection(pts, wn, wt, ts);
309 pts = ts.cubicHorizontal(wn.pts(), wt.left(),
311 debugShowCubicLineIntersection(pts, wn, wt, ts);
323 pts = ts.lineVertical(wn.pts(), wt.top(),
325 debugShowLineIntersection(pts, wn, wt, ts);
329 pts = ts.quadVertical(wn.pts(), wt.top(),
331 debugShowQuadLineIntersection(pts, wn, wt, ts);
335 pts = ts.conicVertical(wn.pts(), wn.weight(), wt.top(),
337 debugShowConicLineIntersection(pts, wn, wt, ts);
341 pts = ts.cubicVertical(wn.pts(), wt.top(),
343 debugShowCubicLineIntersection(pts, wn, wt, ts);
353 pts = ts.lineHorizontal(wt.pts(), wn.left(),
355 debugShowLineIntersection(pts, wt, wn, ts);
358 pts = ts.lineVertical(wt.pts(), wn.top(),
360 debugShowLineIntersection(pts, wt, wn, ts);
363 pts = ts.lineLine(wt.pts(), wn.pts());
364 debugShowLineIntersection(pts, wt, wn, ts);
368 pts = ts.quadLine(wn.pts(), wt.pts());
369 debugShowQuadLineIntersection(pts, wn, wt, ts);
373 pts = ts.conicLine(wn.pts(), wn.weight(), wt.pts());
374 debugShowConicLineIntersection(pts, wn, wt, ts);
378 pts = ts.cubicLine(wn.pts(), wt.pts());
379 debugShowCubicLineIntersection(pts, wn, wt, ts);
388 pts = ts.quadHorizontal(wt.pts(), wn.left(),
390 debugShowQuadLineIntersection(pts, wt, wn, ts);
393 pts = ts.quadVertical(wt.pts(), wn.top(),
395 debugShowQuadLineIntersection(pts, wt, wn, ts);
398 pts = ts.quadLine(wt.pts(), wn.pts());
399 debugShowQuadLineIntersection(pts, wt, wn, ts);
402 pts = ts.intersect(quad1.set(wt.pts()), quad2.set(wn.pts()));
403 debugShowQuadIntersection(pts, wt, wn, ts);
408 pts = ts.intersect(conic2.set(wn.pts(), wn.weight()),
409 quad1.set(wt.pts()));
410 debugShowConicQuadIntersection(pts, wn, wt, ts);
415 pts = ts.intersect(cubic2.set(wn.pts()), quad1.set(wt.pts()));
416 debugShowCubicQuadIntersection(pts, wn, wt, ts);
426 pts = ts.conicHorizontal(wt.pts(), wt.weight(), wn.left(),
428 debugShowConicLineIntersection(pts, wt, wn, ts);
431 pts = ts.conicVertical(wt.pts(), wt.weight(), wn.top(),
433 debugShowConicLineIntersection(pts, wt, wn, ts);
436 pts = ts.conicLine(wt.pts(), wt.weight(), wn.pts());
437 debugShowConicLineIntersection(pts, wt, wn, ts);
440 pts = ts.intersect(conic1.set(wt.pts(), wt.weight()),
441 quad2.set(wn.pts()));
442 debugShowConicQuadIntersection(pts, wt, wn, ts);
446 pts = ts.intersect(conic1.set(wt.pts(), wt.weight()),
447 conic2.set(wn.pts(), wn.weight()));
448 debugShowConicIntersection(pts, wt, wn, ts);
453 pts = ts.intersect(cubic2.set(wn.pts()
455 conic1.set(wt.pts(), wt.weight()
457 debugShowCubicConicIntersection(pts, wn, wt, ts);
465 pts = ts.cubicHorizontal(wt.pts(), wn.left(),
467 debugShowCubicLineIntersection(pts, wt, wn, ts);
470 pts = ts.cubicVertical(wt.pts(), wn.top(),
472 debugShowCubicLineIntersection(pts, wt, wn, ts);
475 pts = ts.cubicLine(wt.pts(), wn.pts());
476 debugShowCubicLineIntersection(pts, wt, wn, ts);
479 pts = ts.intersect(cubic1.set(wt.pts()), quad2.set(wn.pts()));
480 debugShowCubicQuadIntersection(pts, wt, wn, ts);
484 pts = ts.intersect(cubic1.set(wt.pts()
486 conic2.set(wn.pts(), wn.weight()
488 debugShowCubicConicIntersection(pts, wt, wn, ts);
492 pts = ts.intersect(cubic1.set(wt.pts()), cubic2.set(wn.pts()));
493 debugShowCubicIntersection(pts, wt, wn, ts);
508 for (int pt = 0; pt < pts; ++pt) {
