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

Lines Matching defs:worstP
185             int worstP = -1;
196                                             res, worstP) );
212                 AttemptSimplify(off + curP, M, treshhold, res, worstP);       // ca passe forcement
321 bool Path::ExtendFit(int off, int N, fitting_tables &data, double treshhold, PathDescrCubicTo &res, int &worstP)
393     worstP = 1;
401         worstP = -1;
413                 if ( worstP < 0 || 2*nle > worstD ) {
414                     worstP = i;
418                 if ( worstP < 0 || nle > worstD ) {
419                     worstP = i;
428     return AttemptSimplify(data, treshhold, res, worstP);
434 bool Path::AttemptSimplify (fitting_tables &data,double treshhold, PathDescrCubicTo & res,int &worstP)
440     worstP = 1;
457         worstP = 1;
467         worstP = -1;
475                 if ( worstP < 0 || 2 * nle > worstD ) {
476                     worstP = i;
480                 if ( worstP < 0 || nle > worstD ) {
481                     worstP = i;
493         worstP = -1;
545                     worstP = i;
548                     worstP = i;
582                     worstP = i;
585                     worstP = i;
619             worstP = -1;
670                         worstP = i;
673                         worstP = i;
708                         worstP = i;
711                         worstP = i;
737 bool Path::AttemptSimplify(int off, int N, double treshhold, PathDescrCubicTo &res,int &worstP)
754         worstP = 1;
769         worstP = 1;
809         worstP = -1;
819                 if ( worstP < 0 || 2 * nle > worstD ) {
820                     worstP = i;
824                 if ( worstP < 0 || nle > worstD ) {
825                     worstP = i;
855         worstP = -1;
862                 if ( worstP < 0 || 2 * nle > worstD ) {
863                     worstP = i;
867                 if ( worstP < 0 || nle > worstD ) {
868                     worstP = i;
887         worstP = -1;
925           worstP = i;
928           worstP = i;
954           worstP = i;
957           worstP = i;
1006       worstP = -1;
1043             worstP = i;
1046             worstP = i;
1073             worstP=i;
1076             worstP=i;
1225                 int worstP = -1;
1226                 if (AttemptSimplify(lastA, nextA - lastA + 1, (containsForced) ? 0.05 * tresh : tresh, res, worstP)) {
1253                 int worstP = -1;
1254                 if (AttemptSimplify(lastA, nextA - lastA + 1, 0.05 * tresh, res, worstP)) {
1276                 int worstP = -1;
1277                 if (AttemptSimplify(lastA, nextA - lastA + 1, tresh, res, worstP)) {