Lines Matching refs:fIntersections
22 , fIntersections(i)
30 SkDEBUGPARAMS(fIntersections(nullptr))
39 int last = fIntersections->used() - 1;
41 double conicMidT = ((*fIntersections)[0][index] + (*fIntersections)[0][index + 1]) / 2;
48 if (fIntersections->isCoincident(index)) {
49 fIntersections->removeOne(index);
51 } else if (fIntersections->isCoincident(index + 1)) {
52 fIntersections->removeOne(index + 1);
55 fIntersections->setCoincident(index++);
57 fIntersections->setCoincident(index);
83 SkOPOBJASSERT(fIntersections, close_to(pt.fY, axisIntercept, conicVals));
87 fIntersections->insert(conicT, lineT, pt);
91 fIntersections->flip();
94 return fIntersections->used();
108 if (!fIntersections->globalState()
109 || !fIntersections->globalState()->debugSkipAssert()) {
118 fIntersections->insert(conicT, lineT, pt);
122 return fIntersections->used();
161 SkOPOBJASSERT(fIntersections, close_to(pt.fX, axisIntercept, conicVals));
165 fIntersections->insert(conicT, lineT, pt);
169 fIntersections->flip();
172 return fIntersections->used();
185 fIntersections->insert(conicT, lineT, fConic[cIndex]);
192 if (fIntersections->hasT(conicT)) {
199 fIntersections->insert(conicT, lineT, fConic[cIndex]);
207 if (fIntersections->hasOppT(lineT)) {
215 fIntersections->insert(conicT, lineT, (*fLine)[lIndex]);
226 fIntersections->insert(conicT, lineT, fConic[cIndex]);
233 if (fIntersections->hasT(conicT)) {
240 fIntersections->insert(conicT, lineT, fConic[cIndex]);
252 fIntersections->insert(conicT, lineT, fConic[cIndex]);
259 if (fIntersections->hasT(conicT)) {
266 fIntersections->insert(conicT, lineT, fConic[cIndex]);
303 if (fIntersections->used() > 0 && approximately_equal((*fIntersections)[1][0], *lineT)) {
317 for (int inner = 0; inner < fIntersections->used(); ++inner) {
318 if (fIntersections->pt(inner) != pt) {
321 double existingConicT = (*fIntersections)[0][inner];
343 SkIntersections* fIntersections;