Lines Matching refs:fIntersections
88 , fIntersections(i)
98 int last = fIntersections->used() - 1;
100 double cubicMidT = ((*fIntersections)[0][index] + (*fIntersections)[0][index + 1]) / 2;
107 if (fIntersections->isCoincident(index)) {
108 fIntersections->removeOne(index);
110 } else if (fIntersections->isCoincident(index + 1)) {
111 fIntersections->removeOne(index + 1);
114 fIntersections->setCoincident(index++);
116 fIntersections->setCoincident(index);
125 SkDEBUGCODE(c.fDebugGlobalState = fIntersections->globalState());
160 fIntersections->insert(cubicT, lineT, pt);
164 return fIntersections->used();
196 fIntersections->insert(cubicT, lineT, pt);
200 fIntersections->flip();
203 return fIntersections->used();
207 for (int inner = 0; inner < fIntersections->used(); ++inner) {
208 if (fIntersections->pt(inner) != pt) {
211 double existingCubicT = (*fIntersections)[0][inner];
259 fIntersections->insert(cubicT, lineT, pt);
263 fIntersections->flip();
266 return fIntersections->used();
278 fIntersections->insert(cubicT, lineT, fCubic[cIndex]);
287 if (fIntersections->hasT(cubicT)) {
294 fIntersections->insert(cubicT, lineT, fCubic[cIndex]);
302 if (fIntersections->hasOppT(lineT)) {
310 fIntersections->insert(cubicT, lineT, fLine[lIndex]);
321 fIntersections->insert(cubicT, lineT, fCubic[cIndex]);
328 if (fIntersections->hasT(cubicT)) {
335 fIntersections->insert(cubicT, lineT, fCubic[cIndex]);
347 fIntersections->insert(cubicT, lineT, fCubic[cIndex]);
354 if (fIntersections->hasT(cubicT)) {
361 fIntersections->insert(cubicT, lineT, fCubic[cIndex]);
414 SkIntersections* fIntersections;