Lines Matching refs:fIntersections
100 , fIntersections(i)
108 SkDEBUGPARAMS(fIntersections(nullptr))
117 int last = fIntersections->used() - 1;
119 double quadMidT = ((*fIntersections)[0][index] + (*fIntersections)[0][index + 1]) / 2;
126 if (fIntersections->isCoincident(index)) {
127 fIntersections->removeOne(index);
129 } else if (fIntersections->isCoincident(index + 1)) {
130 fIntersections->removeOne(index + 1);
133 fIntersections->setCoincident(index++);
135 fIntersections->setCoincident(index);
181 fIntersections->insert(quadT, lineT, pt);
185 return fIntersections->used();
210 fIntersections->insert(quadT, lineT, pt);
214 fIntersections->flip();
217 return fIntersections->used();
221 for (int inner = 0; inner < fIntersections->used(); ++inner) {
222 if (fIntersections->pt(inner) != pt) {
225 double existingQuadT = (*fIntersections)[0][inner];
266 fIntersections->insert(quadT, lineT, pt);
270 fIntersections->flip();
273 return fIntersections->used();
285 fIntersections->insert(quadT, lineT, fQuad[qIndex]);
292 if (fIntersections->hasT(quadT)) {
299 fIntersections->insert(quadT, lineT, fQuad[qIndex]);
307 if (fIntersections->hasOppT(lineT)) {
315 fIntersections->insert(quadT, lineT, (*fLine)[lIndex]);
326 fIntersections->insert(quadT, lineT, fQuad[qIndex]);
333 if (fIntersections->hasT(quadT)) {
340 fIntersections->insert(quadT, lineT, fQuad[qIndex]);
352 fIntersections->insert(quadT, lineT, fQuad[qIndex]);
359 if (fIntersections->hasT(quadT)) {
366 fIntersections->insert(quadT, lineT, fQuad[qIndex]);
403 if (fIntersections->used() > 0 && approximately_equal((*fIntersections)[1][0], *lineT)) {
419 SkIntersections* fIntersections;