Cross Reference: /inkscape/src/livarot/PathSimplify.cpp

Lines Matching refs:curP
158     int curP = 0;
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;
521                 curP[Geom::X] = data.Xk[i];
522                 curP[Geom::Y] = data.Yk[i];
535                 midP = 0.5 * (curP + prevP);
537                 Geom::Point diff = curAppP - curP;
550                 prevP = curP;
560                 Geom::Point curP;
573                 curP[Geom::X] = data.Xk[i];
574                 curP[Geom::Y] = data.Yk[i];
576                 Geom::Point diff = curAppP-curP;
587                 prevP = curP;
628                     Geom::Point curP;
644                     curP[Geom::X] = data.Xk[i];
645                     curP[Geom::Y] = data.Yk[i];
658                     midP = 0.5 * (curP + prevP);
660                     Geom::Point diff = curAppP - curP;
676                     prevP = curP;
685                     Geom::Point curP;
698                     curP[Geom::X] = data.Xk[i];
699                     curP[Geom::Y] = data.Yk[i];
701                     Geom::Point diff = curAppP - curP;
713                     prevP = curP;
900         Geom::Point curP;
908         curP[0] = Xk[i];
909         curP[1] = Yk[i];
912         midP=0.5*(curP+prevP);
915         diff = curAppP-curP;
930         prevP = curP;
940         Geom::Point curP;
945         curP[0] = Xk[i];
946         curP[1] = Yk[i];
949         diff = curAppP-curP;
959         prevP = curP;
1019           Geom::Point curP;
1027           curP[0] = Xk[i];
1028           curP[1] = Yk[i];
1031           midP = 0.5*(curP+prevP);
1034           diff = curAppP-curP;
1048           prevP = curP;
1058           Geom::Point curP;
1063           curP[0]=Xk[i];
1064           curP[1]=Yk[i];
1067           diff=curAppP-curP;
1078           prevP=curP;
1198     for (int curP = 0; curP < int(descr_cmd.size()); curP++) {
1199         int typ = descr_cmd[curP]->getType();
1207             lastAddition = descr_cmd[curP];
1208             lastAP = curP;
1214             PathDescrMoveTo *nData = dynamic_cast<PathDescrMoveTo *>(descr_cmd[curP]);
1216             lastA = descr_cmd[curP]->associated;
1218             lastP = curP;
1221             nextA = descr_cmd[curP]->associated;
1235                 FlushPendingAddition(tempDest, descr_cmd[curP], pending_cubic, curP);
1238                 FlushPendingAddition(tempDest,descr_cmd[curP],pending_cubic,curP);
1244             lastP = curP;
1245             lastAP = curP;
1249             nextA = descr_cmd[curP]->associated;
1264                     lastP = curP;
1265                     lastAP = curP;
1272             nextA = descr_cmd[curP]->associated;
1283                     lastP = curP;
1289                     lastAddition = descr_cmd[curP];
1291                         pending_cubic = *(dynamic_cast<PathDescrCubicTo*>(descr_cmd[curP]));
1293                     lastAP = curP;
1298                 lastA = prevA /*descr_cmd[curP-1]->associated */ ;
1299                 lastAddition = descr_cmd[curP];
1301                     pending_cubic = *(dynamic_cast<PathDescrCubicTo*>(descr_cmd[curP]));
1303                 lastAP = curP;
1315             lastA = descr_cmd[curP]->associated;
1316             lastP = curP;
1317             PathDescrBezierTo *nBData = dynamic_cast<PathDescrBezierTo*>(descr_cmd[curP]);
1319                 FlushPendingAddition(tempDest, descr_cmd[curP + i], pending_cubic, curP + i);
1321             curP += nBData->nb;