Lines Matching full:intersections
233 SkIntersections* intersections);
1417 // construct the tangent lines from the intersections
1965 const SkTSect<OppCurve, TCurve>* sect2, SkIntersections* intersections) {
1969 intersections->insert(0, 0, sect1->fCurve[0]);
1973 intersections->insert(0, 1, sect1->fCurve[0]);
1977 intersections->insert(1, 0, sect1->fCurve[TCurve::kPointLast]);
1981 intersections->insert(1, 1, sect1->fCurve[TCurve::kPointLast]);
1987 intersections->insertNear(0, 0, sect1->fCurve[0], sect2->fCurve[0]);
1992 intersections->insertNear(0, 1, sect1->fCurve[0], sect2->fCurve[OppCurve::kPointLast]);
1998 intersections->insertNear(1, 0, sect1->fCurve[TCurve::kPointLast], sect2->fCurve[0]);
2004 intersections->insertNear(1, 1, sect1->fCurve[TCurve::kPointLast],
2016 void addIntersection(SkIntersections* intersections) const {
2019 intersections->insert(r1t, r2t, fC1Span->part()[fC1Index]);
2122 void finish(SkIntersections* intersections) const {
2132 test->addIntersection(intersections);
2144 SkTSect<OppCurve, TCurve>* sect2, SkIntersections* intersections) {
2150 intersections->reset();
2151 intersections->setMax(TCurve::kMaxIntersections + 4); // give extra for slop
2160 (void) EndsEqual(sect1, sect2, intersections);
2191 SkOPOBJASSERT(intersections, 0);
2195 SkOPOBJASSERT(intersections, 0);
2211 SkOPOBJASSERT(intersections, 0);
2215 SkOPOBJASSERT(intersections, 0);
2222 intersections->debugBumpLoopCount(SkIntersections::kIterations_DebugLoop);
2237 intersections->debugBumpLoopCount(SkIntersections::kCoinCheck_DebugLoop);
2264 intersections->debugBumpLoopCount(SkIntersections::kComputePerp_DebugLoop);
2299 int index = intersections->insertCoincident(coincident->fStartT,
2301 if ((intersections->insertCoincident(coincident->fEndT,
2304 intersections->clearCoincidence(index);
2308 int zeroOneSet = EndsEqual(sect1, sect2, intersections);
2315 intersections->insert(0, perp.perpT(), perp.perpPt());
2322 intersections->insert(1, perp.perpT(), perp.perpPt());
2329 intersections->insert(perp.perpT(), 0, perp.perpPt());
2336 intersections->insert(perp.perpT(), 1, perp.perpPt());
2353 intersections->insert(0, t, start1);
2363 intersections->insert(t, 0, start2);
2373 intersections->insert(1, t, end1);
2383 intersections->insert(t, 1, end2);
2398 found |= closest.find(result1, result2 SkDEBUGPARAMS(intersections));
2402 closest.finish(intersections);
2404 int last = intersections->used() - 1;
2406 if (intersections->isCoincident(index) && intersections->isCoincident(index + 1)) {
2410 double midT = ((*intersections)[0][index] + (*intersections)[0][index + 1]) / 2;
2419 if (intersections->isCoincident(index)) {
2420 intersections->removeOne(index);
2422 } else if (intersections->isCoincident(index + 1)) {
2423 intersections->removeOne(index + 1);
2426 intersections->setCoincident(index++);
2428 intersections->setCoincident(index);
2430 SkOPOBJASSERT(intersections, intersections->used() <= TCurve::kMaxIntersections);
