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) {
282 int pts = 0;
295 pts = ts.lineHorizontal(wn.pts(), wt.left(),
297 debugShowLineIntersection(pts, wn, wt, ts);
300 pts = ts.quadHorizontal(wn.pts(), wt.left(),
302 debugShowQuadLineIntersection(pts, wn, wt, ts);
305 pts = ts.conicHorizontal(wn.pts(), wn.weight(), wt.left(),
307 debugShowConicLineIntersection(pts, wn, wt, ts);
310 pts = ts.cubicHorizontal(wn.pts(), wt.left(),
312 debugShowCubicLineIntersection(pts, wn, wt, ts);
324 pts = ts.lineVertical(wn.pts(), wt.top(),
326 debugShowLineIntersection(pts, wn, wt, ts);
330 pts = ts.quadVertical(wn.pts(), wt.top(),
332 debugShowQuadLineIntersection(pts, wn, wt, ts);
336 pts = ts.conicVertical(wn.pts(), wn.weight(), wt.top(),
338 debugShowConicLineIntersection(pts, wn, wt, ts);
342 pts = ts.cubicVertical(wn.pts(), wt.top(),
344 debugShowCubicLineIntersection(pts, wn, wt, ts);
354 pts = ts.lineHorizontal(wt.pts(), wn.left(),
356 debugShowLineIntersection(pts, wt, wn, ts);
359 pts = ts.lineVertical(wt.pts(), wn.top(),
361 debugShowLineIntersection(pts, wt, wn, ts);
364 pts = ts.lineLine(wt.pts(), wn.pts());
365 debugShowLineIntersection(pts, wt, wn, ts);
369 pts = ts.quadLine(wn.pts(), wt.pts());
370 debugShowQuadLineIntersection(pts, wn, wt, ts);
374 pts = ts.conicLine(wn.pts(), wn.weight(), wt.pts());
375 debugShowConicLineIntersection(pts, wn, wt, ts);
379 pts = ts.cubicLine(wn.pts(), wt.pts());
380 debugShowCubicLineIntersection(pts, wn, wt, ts);
389 pts = ts.quadHorizontal(wt.pts(), wn.left(),
391 debugShowQuadLineIntersection(pts, wt, wn, ts);
394 pts = ts.quadVertical(wt.pts(), wn.top(),
396 debugShowQuadLineIntersection(pts, wt, wn, ts);
399 pts = ts.quadLine(wt.pts(), wn.pts());
400 debugShowQuadLineIntersection(pts, wt, wn, ts);
403 pts = ts.intersect(quad1.set(wt.pts()), quad2.set(wn.pts()));
404 debugShowQuadIntersection(pts, wt, wn, ts);
409 pts = ts.intersect(conic2.set(wn.pts(), wn.weight()),
410 quad1.set(wt.pts()));
411 debugShowConicQuadIntersection(pts, wn, wt, ts);
416 pts = ts.intersect(cubic2.set(wn.pts()), quad1.set(wt.pts()));
417 debugShowCubicQuadIntersection(pts, wn, wt, ts);
427 pts = ts.conicHorizontal(wt.pts(), wt.weight(), wn.left(),
429 debugShowConicLineIntersection(pts, wt, wn, ts);
432 pts = ts.conicVertical(wt.pts(), wt.weight(), wn.top(),
434 debugShowConicLineIntersection(pts, wt, wn, ts);
437 pts = ts.conicLine(wt.pts(), wt.weight(), wn.pts());
438 debugShowConicLineIntersection(pts, wt, wn, ts);
441 pts = ts.intersect(conic1.set(wt.pts(), wt.weight()),
442 quad2.set(wn.pts()));
443 debugShowConicQuadIntersection(pts, wt, wn, ts);
447 pts = ts.intersect(conic1.set(wt.pts(), wt.weight()),
448 conic2.set(wn.pts(), wn.weight()));
449 debugShowConicIntersection(pts, wt, wn, ts);
454 pts = ts.intersect(cubic2.set(wn.pts()),
455 conic1.set(wt.pts(), wt.weight()));
456 debugShowCubicConicIntersection(pts, wn, wt, ts);
464 pts = ts.cubicHorizontal(wt.pts(), wn.left(),
466 debugShowCubicLineIntersection(pts, wt, wn, ts);
469 pts = ts.cubicVertical(wt.pts(), wn.top(),
471 debugShowCubicLineIntersection(pts, wt, wn, ts);
474 pts = ts.cubicLine(wt.pts(), wn.pts());
475 debugShowCubicLineIntersection(pts, wt, wn, ts);
478 pts = ts.intersect(cubic1.set(wt.pts()), quad2.set(wn.pts()));
479 debugShowCubicQuadIntersection(pts, wt, wn, ts);
483 pts = ts.intersect(cubic1.set(wt.pts()),
484 conic2.set(wn.pts(), wn.weight()));
485 debugShowCubicConicIntersection(pts, wt, wn, ts);
489 pts = ts.intersect(cubic1.set(wt.pts()), cubic2.set(wn.pts()));
490 debugShowCubicIntersection(pts, wt, wn, ts);
505 for (int pt = 0; pt < pts; ++pt) {
