Searched refs:curP (Results 1 - 7 of 7) sorted by relevance

/inkscape/src/livarot/
H A DPathConversion.cpp38 int curP = 1; local
47 curP = 0;
54 while ( curP < int(descr_cmd.size()) ) {
56 int const nType = descr_cmd[curP]->getType();
61 AddForcedPoint(curX, curP, 1.0);
62 curP++;
67 PathDescrMoveTo *nData = dynamic_cast<PathDescrMoveTo*>(descr_cmd[curP]);
69 lastMoveTo = AddPoint(nextX, curP, 0.0, true);
71 curP++;
77 int n = AddPoint(nextX, curP, 1.
201 int curP = 1; local
416 int curP = 1; local
1300 int curP = 1; local
1384 int curP = 1; local
1441 int curP = 1; local
1516 int curP = 1; local
[all...]
H A DPathSimplify.cpp158 int curP = 0; local
171 while (curP < N - 1) {
173 int lastP = curP + 1;
194 } while (lastP < N && ExtendFit(off + curP, M, data,
209 M = lastP - curP + 1;
212 AttemptSimplify(off + curP, M, treshhold, res, worstP); // ca passe forcement
224 curP = lastP;
505 Geom::Point curP; local
521 curP[Geom::X] = data.Xk[i];
522 curP[Geo
560 Geom::Point curP; local
628 Geom::Point curP; local
685 Geom::Point curP; local
900 Geom::Point curP; local
940 Geom::Point curP; local
1019 Geom::Point curP; local
1058 Geom::Point curP; local
[all...]
H A DPathOutline.cpp52 int curP = 0; local
54 int lastM = curP;
56 curP++;
57 if (curP >= int(descr_cmd.size())) {
60 int typ = descr_cmd[curP]->getType();
64 } while (curP < int(descr_cmd.size()));
66 if (curP >= int(descr_cmd.size())) {
67 curP = descr_cmd.size();
70 if (curP > lastM + 1) {
74 int curD = curP
248 int curP = 0; local
351 int curP = 1; local
[all...]
H A DPathStroke.cpp106 Geom::Point curP = pts[off].p; local
113 Geom::Point diff = curP - prevP;
127 prevP = curP;
136 Geom::Point diff = curP - nextP;
149 DoButt(dest, width, butt, curP, dir, last[RIGHT], last[LEFT]);
152 DoButt(dest, width, butt, curP, dir, end[LEFT], end[RIGHT]);
162 Geom::Point prevD = curP - prevP;
163 Geom::Point nextD = nextP - curP;
170 DoJoin(dest, width, join, curP, prevD, nextD, miter, prevLe, nextLe, start, last);
173 DoButt(dest, width, butt, curP, next
[all...]
H A DShape.h306 void Scan(float &pos, int &curP, float to, float step);
307 void QuickScan(float &pos, int &curP, float to, bool doSort, float step);
308 void DirectScan(float &pos, int &curP, float to, float step);
309 void DirectQuickScan(float &pos, int &curP, float to, bool doSort, float step);
311 void Scan(float &pos, int &curP, float to, FloatLigne *line, bool exact, float step);
312 void Scan(float &pos, int &curP, float to, FillRule directed, BitLigne *line, bool exact, float step);
313 void Scan(float &pos, int &curP, float to, AlphaLigne *line, bool exact, float step);
315 void QuickScan(float &pos, int &curP, float to, FloatLigne* line, float step);
316 void QuickScan(float &pos, int &curP, float to, FillRule directed, BitLigne* line, float step);
317 void QuickScan(float &pos, int &curP, floa
[all...]
H A DShapeRaster.cpp118 void Shape::Scan(float &pos, int &curP, float to, float step) argument
135 // points of the polygon are sorted top-down, so we take them in order, starting with the one at index curP,
137 // don't forget to update curP and pos when we're done
138 int curPt = curP;
253 curP = curPt;
275 void Shape::QuickScan(float &pos,int &curP, float to, bool /*doSort*/, float step) argument
292 int curPt = curP;
354 curP = curPt;
609 void Shape::DirectScan(float &pos, int &curP, float to, float step) argument
621 // points of the polygon are sorted top-down, so we take them in order, starting with the one at index curP,
708 DirectQuickScan(float &pos, int &curP, float to, bool , float step) argument
801 Scan(float &pos, int &curP, float to, FloatLigne *line, bool exact, float step) argument
949 Scan(float &pos, int &curP, float to, FillRule directed, BitLigne *line, bool exact, float step) argument
1122 Scan(float &pos, int &curP, float to, AlphaLigne *line, bool exact, float step) argument
1232 QuickScan(float &pos, int &curP, float to, FloatLigne* line, float step) argument
1371 QuickScan(float &pos, int &curP, float to, FillRule directed, BitLigne* line, float step) argument
1521 QuickScan(float &pos, int &curP, float to, AlphaLigne* line, float step) argument
[all...]
H A DPathCutting.cpp41 int curP = 0; local
45 if ( orig_pts[curP].isMoveTo == polyline_moveto ) {
50 lastMP=curP;
52 curP++;
1133 for (int curP=0;curP<nbPos;curP++) {
1134 int cp=poss[curP].piece;
1136 float ct=poss[curP].t;
1171 for (int j=curP
[all...]

Completed in 33 milliseconds