Searched defs:fi (Results 1 - 6 of 6) sorted by relevance

/inkscape/src/2geom/
H A Dsvg-path-parser.h153 void parse_svg_path_file(FILE *fi, PathSink &sink);
168 inline PathVector read_svgd_f(FILE * fi) { argument
173 parse_svg_path_file(fi, generator);
180 FILE* fi = fopen(filename, "r"); local
181 if(fi == NULL) throw(std::runtime_error("Error opening file"));
182 PathVector out = read_svgd_f(fi);
183 fclose(fi);
H A Dbezier.cpp221 const double fi = choose<double>(m,i)*f[i]; local
223 h[i+j] += fi * choose<double>(n,j)*g[j];
H A Dpiecewise.h327 unsigned fi = f.segN(m.min()), ti = f.segN(m.max()); local
328 double ft = f.segT(m.min(), fi), tt = f.segT(m.max(), ti);
330 if(fi == ti) return bounds_local(f[fi], Interval(ft, tt));
332 typename FragmentConcept<T>::BoundsType ret(bounds_local(f[fi], Interval(ft, 1.)));
333 for(unsigned i = fi + 1; i < ti; i++)
448 unsigned fi = pw.segN(to, i);
449 ret.reserve(fi - i + 1);
450 if (to == pw.cuts[fi]) fi
[all...]
H A Dsvg-path-parser.cpp1578 void parse_svg_path_file(FILE *fi, PathSink &sink) argument
1586 bytes_read = fread(buffer, 1, BUFFER_SIZE, fi);
/inkscape/src/livarot/
H A DShapeMisc.cpp83 int fi = 0; local
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)
225 int fi = 0; local
381 int fi = 0; local
[all...]
H A DShapeSweep.cpp2372 int fi = 0; local
2373 for (fi = lastPtUsed; fi < numberOfPoints(); fi++)
2375 if (getPoint(fi).incidentEdge[FIRST] >= 0 && swdData[getPoint(fi).incidentEdge[FIRST]].misc == 0)
2378 lastPtUsed = fi + 1;
2379 if (fi < numberOfPoints())
2381 int bestB = getPoint(fi).incidentEdge[FIRST];
2385 if (fi
[all...]

Completed in 3348 milliseconds