Lines Matching refs:pts
37 std::vector<path_lineto> orig_pts = pts;
38 pts.clear();
472 * \return Length of the lines in the pts vector.
477 if ( pts.empty() ) {
481 Geom::Point lastP = pts[0].p;
484 for (std::vector<path_lineto>::const_iterator i = pts.begin(); i != pts.end(); ++i) {
499 if ( pts.empty() ) {
503 Geom::Point lastM = pts[0].p;
507 for (std::vector<path_lineto>::const_iterator i = pts.begin(); i != pts.end(); ++i) {
885 if ( nbCv <= 0 || pts.empty() || back == false ) {
899 Geom::Point lastM = pts[0].p;
902 for (std::vector<path_lineto>::const_iterator i = pts.begin(); i != pts.end(); ++i) {
956 for (unsigned i = 1 ; i < pts.size() ; i++) {
957 if (pts[i].isMoveTo == polyline_moveto || (seg > 0 && i != seg)) continue;
962 if (pts[i - 1].p == pts[i].p) {
963 thisRangeSquared = square(pts[i].p[Geom::X] - pos[Geom::X]) + square(pts[i].p[Geom::Y] - pos[Geom::Y]);
967 if (fabs(pts[i - 1].p[Geom::X] - pts[i].p[Geom::X]) < fabs(pts[i - 1].p[Geom::Y] - pts[i].p[Geom::Y])) {
968 p1 = pts[i - 1].p;
969 p2 = pts[i].p;
972 p1 = pts[i - 1].p.cw();
973 p2 = pts[i].p.cw();
1016 result.piece = pts[bestSeg].piece;
1017 if (result.piece == pts[bestSeg - 1].piece) {
1018 result.t = pts[bestSeg - 1].t * (1.0 - bestT) + pts[bestSeg].t * bestT;
1020 result.t = pts[bestSeg].t * bestT;
1036 for (unsigned i = 1 ; i < pts.size() ; i++) {
1037 if (pts[i].isMoveTo == polyline_moveto) continue;
1038 if (pts[i].piece == piece && t < pts[i].t) {
1039 length += Geom::L2((t - pts[i - 1].t) / (pts[i].t - pts[i - 1].t) * (pts[i].p - pts[i - 1].p));
1042 length += Geom::L2(pts[i].p - pts[i - 1].p);