Lines Matching refs:intersect
62 i.intersect(simple1, simple2);
64 i.intersect((const SkDLine&) simple1, (const SkDLine&) simple2);
66 i.intersect(simple1, (const SkDLine&) simple2);
69 i.intersect(simple2, (const SkDLine&) simple1);
76 static void intersect(const SkDCubic& cubic1, double t1s, double t1e, const SkDCubic& cubic2,
165 intersect(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i);
207 intersect(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i);
233 intersect(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i);
239 // intersect(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i);
253 // if two ends intersect, check middle for coincidence
282 // intersect the end of the cubic with the other. Try lines from the end to control and opposite
289 // cubic/cubic can't reject so easily since cubics can intersect same point more than once
336 if (!local.intersect(cubic2, line)) {
371 ::intersect(cubic1, tMin1, tMax1, cubic2, tMin2, tMax2, 1, *this);
375 ::intersect(cubic1, tMin1, tMax1, cubic2, tMin2, tMax2, 1, *this);
405 // curves at most intersect at the endpoints
439 int SkIntersections::intersect(const SkDCubic& c1, const SkDCubic& c2) {
515 ::intersect(c1, 0, 1, c2, 0, 1, 1, i);
618 // the intersect 3 loop to avoid the promotion / demotion code
619 int SkIntersections::intersect(const SkDCubic& cubic, const SkDQuad& quad) {
622 (void) intersect(cubic, up);
633 int SkIntersections::intersect(const SkDCubic& c) {
639 (void) intersect(c, c);
