Lines Matching refs:curP
38 int curP = 1;
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.0, false);
79 curP++;
84 PathDescrLineTo *nData = dynamic_cast<PathDescrLineTo *>(descr_cmd[curP]);
86 AddPoint(nextX,curP,1.0,false);
88 curP++;
93 PathDescrCubicTo *nData = dynamic_cast<PathDescrCubicTo *>(descr_cmd[curP]);
95 RecCubicTo(curX, nData->start, nextX, nData->end, treshhold, 8, 0.0, 1.0, curP);
96 AddPoint(nextX, curP, 1.0, false);
98 curP++;
103 PathDescrArcTo *nData = dynamic_cast<PathDescrArcTo *>(descr_cmd[curP]);
105 DoArc(curX, nextX, nData->rx, nData->ry, nData->angle, nData->large, nData->clockwise, treshhold, curP);
106 AddPoint(nextX, curP, 1.0, false);
108 curP++;
113 PathDescrBezierTo *nBData = dynamic_cast<PathDescrBezierTo *>(descr_cmd[curP]);
117 int ip = curP + 1;
139 AddPoint(stx,curP - 1+k,1.0,false);
145 RecBezierTo(cx, stx, mx, treshhold, 8, 0.0, 1.0, curP + k);
159 AddPoint(stx, curP + nbInterm - 2, 1.0, false);
165 RecBezierTo(cx, stx, mx, treshhold, 8, 0.0, 1.0, curP + nbInterm - 1);
172 AddPoint(nextX, curP - 1 + nbInterm, 1.0, false);
175 curP += 1 + nbInterm;
201 int curP = 1;
210 curP = 0;
218 while ( curP < int(descr_cmd.size()) ) {
220 int const nType = descr_cmd[curP]->getType();
225 descr_cmd[curP]->associated = AddForcedPoint(curX);
226 curP++;
231 PathDescrMoveTo *nData = dynamic_cast<PathDescrMoveTo *>(descr_cmd[curP]);
234 descr_cmd[curP]->associated = lastMoveTo;
237 curP++;
243 descr_cmd[curP]->associated = AddPoint(nextX, false);
244 if ( descr_cmd[curP]->associated < 0 ) {
245 if ( curP == 0 ) {
246 descr_cmd[curP]->associated = 0;
248 descr_cmd[curP]->associated = descr_cmd[curP - 1]->associated;
251 if ( descr_cmd[curP]->associated > 0 ) {
252 pts[descr_cmd[curP]->associated].closed = true;
254 curP++;
259 PathDescrLineTo *nData = dynamic_cast<PathDescrLineTo *>(descr_cmd[curP]);
261 descr_cmd[curP]->associated = AddPoint(nextX, false);
262 if ( descr_cmd[curP]->associated < 0 ) {
263 if ( curP == 0 ) {
264 descr_cmd[curP]->associated = 0;
266 descr_cmd[curP]->associated = descr_cmd[curP - 1]->associated;
270 curP++;
275 PathDescrCubicTo *nData = dynamic_cast<PathDescrCubicTo *>(descr_cmd[curP]);
278 descr_cmd[curP]->associated = AddPoint(nextX,false);
279 if ( descr_cmd[curP]->associated < 0 ) {
280 if ( curP == 0 ) {
281 descr_cmd[curP]->associated = 0;
283 descr_cmd[curP]->associated = descr_cmd[curP - 1]->associated;
287 curP++;
292 PathDescrArcTo *nData = dynamic_cast<PathDescrArcTo *>(descr_cmd[curP]);
295 descr_cmd[curP]->associated = AddPoint(nextX, false);
296 if ( descr_cmd[curP]->associated < 0 ) {
297 if ( curP == 0 ) {
298 descr_cmd[curP]->associated = 0;
300 descr_cmd[curP]->associated = descr_cmd[curP - 1]->associated;
304 curP++;
309 PathDescrBezierTo *nBData = dynamic_cast<PathDescrBezierTo *>(descr_cmd[curP]);
312 int curBD = curP;
314 curP++;
315 int ip = curP;
341 if ( curP == 0 ) {
366 if ( curP == 0 ) {
382 if ( curP == 0 ) {
390 curP += nbInterm;
416 int curP = 1;
425 curP = 0;
433 while ( curP < int(descr_cmd.size()) ) {
435 int const nType = descr_cmd[curP]->getType();
440 descr_cmd[curP]->associated = AddForcedPoint(curX);
441 curP++;
446 PathDescrMoveTo* nData = dynamic_cast<PathDescrMoveTo *>(descr_cmd[curP]);
449 descr_cmd[curP]->associated = lastMoveTo;
452 curP++;
472 descr_cmd[curP]->associated = AddPoint(nextX,false);
473 if ( descr_cmd[curP]->associated < 0 ) {
474 if ( curP == 0 ) {
475 descr_cmd[curP]->associated = 0;
477 descr_cmd[curP]->associated = descr_cmd[curP - 1]->associated;
480 if ( descr_cmd[curP]->associated > 0 ) {
481 pts[descr_cmd[curP]->associated].closed = true;
483 curP++;
488 PathDescrLineTo* nData = dynamic_cast<PathDescrLineTo *>(descr_cmd[curP]);
499 descr_cmd[curP]->associated = AddPoint(nextX,false);
500 if ( descr_cmd[curP]->associated < 0 ) {
501 if ( curP == 0 ) {
502 descr_cmd[curP]->associated = 0;
504 descr_cmd[curP]->associated = descr_cmd[curP - 1]->associated;
508 curP++;
513 PathDescrCubicTo *nData = dynamic_cast<PathDescrCubicTo *>(descr_cmd[curP]);
516 descr_cmd[curP]->associated = AddPoint(nextX, false);
517 if ( descr_cmd[curP]->associated < 0 ) {
518 if ( curP == 0 ) {
519 descr_cmd[curP]->associated = 0;
521 descr_cmd[curP]->associated = descr_cmd[curP - 1]->associated;
525 curP++;
530 PathDescrArcTo *nData = dynamic_cast<PathDescrArcTo *>(descr_cmd[curP]);
533 descr_cmd[curP]->associated =AddPoint(nextX, false);
534 if ( descr_cmd[curP]->associated < 0 ) {
535 if ( curP == 0 ) {
536 descr_cmd[curP]->associated = 0;
538 descr_cmd[curP]->associated = descr_cmd[curP - 1]->associated;
543 curP++;
548 PathDescrBezierTo *nBData = dynamic_cast<PathDescrBezierTo *>(descr_cmd[curP]);
551 int curBD = curP;
553 curP++;
554 int ip = curP;
580 if ( curP == 0 ) {
605 if ( curP == 0 ) {
621 if ( curP == 0 ) {
629 curP += nbInterm;
1300 int curP = 1;
1305 while ( curP < int(pts.size()) ) {
1306 int sbp = curP;
1327 lastM = curP;
1328 pathEnd = curP;
1335 lEdge = dest->AddEdge(first + curP, first + pathEnd);
1347 pathEnd = curP;
1356 curP++;
1384 int curP = 1;
1388 while ( curP < int(pts.size()) ) {
1389 int sbp = curP;
1401 lastM = curP;
1402 pathEnd = curP;
1407 lEdge = dest->AddEdge(first+curP, first+pathEnd);
1408 pathEnd = curP;
1416 curP++;
1441 int curP = 1;
1445 while ( curP < int(pts.size()) ) {
1446 int sbp = curP;
1464 lastM = curP;
1465 pathEnd = curP;
1470 lEdge = dest->AddEdge(first + pathEnd, first + curP);
1480 pathEnd = curP;
1488 curP++;
1516 int curP = 1;
1520 while ( curP < int(pts.size()) ) {
1521 int sbp = curP;
1533 lastM = curP;
1534 pathEnd = curP;
1539 lEdge = dest->AddEdge(first+pathEnd, first+curP);
1540 pathEnd = curP;
1548 curP++;