Lines Matching defs:fi
83 int fi = 0;
84 for (fi = lastPtUsed; fi < numberOfPoints(); fi++)
86 if (getPoint(fi).incidentEdge[FIRST] >= 0 && swdData[getPoint(fi).incidentEdge[FIRST]].misc == 0)
89 lastPtUsed = fi + 1;
90 if (fi < numberOfPoints())
92 int bestB = getPoint(fi).incidentEdge[FIRST];
93 while (bestB >= 0 && getEdge(bestB).st != fi)
94 bestB = NextAt (fi, bestB);
225 int fi = 0;
226 for (fi = lastPtUsed; fi < numberOfPoints(); fi++)
228 if (getPoint(fi).incidentEdge[FIRST] >= 0 && swdData[getPoint(fi).incidentEdge[FIRST]].misc == 0)
231 lastPtUsed = fi + 1;
232 if (fi < numberOfPoints())
234 int bestB = getPoint(fi).incidentEdge[FIRST];
235 while (bestB >= 0 && getEdge(bestB).st != fi)
236 bestB = NextAt (fi, bestB);
381 int fi = 0;
382 for (fi = lastPtUsed; fi < numberOfPoints(); fi++)
384 if (getPoint(fi).incidentEdge[FIRST] >= 0 && swdData[getPoint(fi).incidentEdge[FIRST]].misc == 0)
388 int askTo = pData[fi].askForWindingB;
396 childEdge = getPoint(fi).incidentEdge[FIRST];
399 lastPtUsed = fi + 1;
400 if (fi < numberOfPoints())
402 int bestB = getPoint(fi).incidentEdge[FIRST];
403 while (bestB >= 0 && getEdge(bestB).st != fi)
404 bestB = NextAt (fi, bestB);