| /inkscape/src/livarot/ |
| H A D | Path.cpp | 485 pts.push_back(path_lineto(polyline_forced, pts[n - 1].p, pts[n - 1].piece, pts[n - 1].t));
511 * \param piece Index of a one of our commands.
512 * \param at Distance along the segment that corresponds to `piece' (0 <= at <= 1)
513 * \param pos Filled in with the point at `at' on `piece'.
516 void Path::PointAt(int piece, double at, Geom::Point &pos) argument
518 if (piece < 0 || piece >= int(descr_cmd.size())) {
519 // this shouldn't happen: the piece we are asked for doesn't
525 PathDescr const *theD = descr_cmd[piece];
533 return PointAt (piece
606 PointAndTangentAt(int piece, double at, Geom::Point &pos, Geom::Point &tgt) argument
921 IsLineSegment(int piece) argument
[all...] |
| H A D | Path.h | 78 // also back data: info on where this polyline's segment comes from, ie wich command in the path description: "piece"
83 path_lineto(bool m, Geom::Point pp) : isMoveTo(m), p(pp), piece(-1), t(0), closed(false) {}
84 path_lineto(bool m, Geom::Point pp, int pie, double tt) : isMoveTo(m), p(pp), piece(pie), t(tt), closed(false) {}
88 int piece; member in struct:Path::path_lineto
167 // piece is a command no in the command list
170 void PointAt (int piece, double at, Geom::Point & pos);
171 void PointAndTangentAt (int piece, double at, Geom::Point & pos, Geom::Point & tgt);
209 int piece; member in struct:Path::cut_position
215 double PositionToLength(int piece, double t);
224 bool IsLineSegment(int piece);
261 int piece; member in struct:Path::offset_orig
284 int piece; member in struct:Path::outline_callback_data
[all...] |
| H A D | PathConversion.cpp | 946 bool const large, bool const wise, double const /*tresh*/, int const piece)
977 AddPoint(cb.vector() * ar * cbangle + dr, piece, (sang - b) / (sang - eang));
989 AddPoint(cb.vector() * ar * cbangle + dr, piece, (b - sang) / (eang - sang));
996 double tresh, int lev, double st, double et, int piece)
1025 RecCubicTo(iS, hisD, m, md, tresh, lev - 1, st, mt, piece);
1026 AddPoint(m, piece, mt);
1027 RecCubicTo(m, md, iE, hieD, tresh, lev - 1, mt, et, piece);
1036 double tresh, int lev, double st, double et, int piece)
1052 RecBezierTo(0.5 * (iS + iP), iS, m, tresh, lev - 1, st, mt, piece);
1053 AddPoint(m, piece, m
944 DoArc(Geom::Point const &iS, Geom::Point const &iE, double const rx, double const ry, double const angle, bool const large, bool const wise, double const , int const piece) argument
994 RecCubicTo(Geom::Point const &iS, Geom::Point const &isD, Geom::Point const &iE, Geom::Point const &ieD, double tresh, int lev, double st, double et, int piece) argument
1033 RecBezierTo(Geom::Point const &iP, Geom::Point const &iS, Geom::Point const &iE, double tresh, int lev, double st, double et, int piece) argument
1060 DoArc(Geom::Point const &iS, Geom::Point const &iE, double const rx, double const ry, double const angle, bool const large, bool const wise, double const , int const piece, offset_orig & ) argument
1113 RecCubicTo(Geom::Point const &iS, Geom::Point const &isD, Geom::Point const &iE, Geom::Point const &ieD, double tresh, int lev, double st, double et, int piece, offset_orig &orig) argument
1195 RecBezierTo(Geom::Point const &iP, Geom::Point const &iS,Geom::Point const &iE, double tresh, int lev, double st, double et, int piece, offset_orig& orig) argument
[all...] |
| H A D | PathCutting.cpp | 128 nPiece = orig_pts[spP + i].piece;
868 if ( cp1->piece < cp2->piece ) return -1;
869 if ( cp1->piece > cp2->piece ) return 1;
908 lastPiece = i->piece;
919 res[nbCut].piece = i->piece;
920 res[nbCut].t = theta * i->t + (1 - theta) * ( (lastPiece != i->piece) ? 0 : lastT);
928 lastPiece = i->piece;
1033 PositionToLength(int piece, double t) argument
[all...] |
| H A D | PathOutline.cpp | 558 callsData.piece = curP;
614 callsData.piece = curP;
703 callsData.piece = curP;
761 callsData.piece = curP + k;
791 callsData.piece = curP + nbInterm - 1;
1325 data->dest->descr_cmd[n_d]->associated = data->piece;
1351 data->dest->descr_cmd[n_d]->associated = data->piece;
1466 data->dest->descr_cmd[n_d]->associated = data->piece;
1490 data->dest->descr_cmd[n_d]->associated = data->piece;
|
| /inkscape/src/live_effects/ |
| H A D | lpe-sketch.cpp | 227 Piecewise<D2<SBasis> > piece = pieces_in[pieceidx]; local
228 Piecewise<SBasis> piecelength = arcLengthSb(piece,.1);
235 bool closed = piece.segs.front().at0() == piece.segs.back().at1();
237 piece.concat(piece);
244 //- Pick a rdm perturbation delta(s), collect 'piece(t)+delta(s(t))' over [t0,t1] into output.
280 //pick a rdm perturbation, and collect the perturbed piece into output.
284 output.concat(portion(piece,t0,t1)+pwperturb);
|
| /inkscape/src/libnrtype/ |
| H A D | Layout-TNG-Output.cpp | 669 if (offset >= 0.0 && point_otp != NULL && point_otp[0].piece >= 0) {
672 const_cast<Path&>(path).PointAndTangentAt(point_otp[0].piece, point_otp[0].t, point, tangent);
718 if (midpoint_offset >= 0.0 && midpoint_otp != NULL && midpoint_otp[0].piece >= 0) {
721 const_cast<Path&>(path).PointAndTangentAt(midpoint_otp[0].piece, midpoint_otp[0].t, midpoint, tangent);
725 if (start_otp != NULL && start_otp[0].piece >= 0) {
727 if (end_otp != NULL && end_otp[0].piece >= 0) {
730 if (path.pts[i].piece <= start_otp[0].piece) continue;
731 if (path.pts[i].piece >= end_otp[0].piece) brea
[all...] |
| H A D | Layout-TNG-OutIter.cpp | 90 local_x = const_cast<Path*>(_path_fitted)->PositionToLength(position.piece, position.t);
312 if (midpoint_offset >= 0.0 && midpoint_otp != NULL && midpoint_otp[0].piece >= 0) {
317 const_cast<Path*>(_path_fitted)->PointAndTangentAt(midpoint_otp[0].piece, midpoint_otp[0].t, midpoint, tangent);
464 if (path_parameter_list != NULL && path_parameter_list[0].piece >= 0)
467 path_parameter.piece = _path_fitted->descr_cmd.size() - 1;
474 const_cast<Path*>(_path_fitted)->PointAndTangentAt(path_parameter.piece, path_parameter.t, point, tangent);
|
| /inkscape/src/ |
| H A D | splivarot.h | 69 Geom::Point get_point_on_Path(Path *path, int piece, double t);
|
| H A D | splivarot.cpp | 248 int piece=-1; local
253 piece=theShape->ebData[cb].pieceID;
269 toCut[nbToCut].piece=piece;
602 int piece=-1; local
607 piece=theShape->ebData[cb].pieceID;
623 toCut[nbToCut].piece=piece;
788 // a better algorithm might figure out e.g. the biggest piece
2420 Geom::Point get_point_on_Path(Path *path, int piece, doubl argument
[all...] |
| /inkscape/src/2geom/ |
| H A D | d2-sbasis.cpp | 209 Piecewise<D2<SBasis> > piece; local
210 piece.cuts.push_back(pwsbin.cuts[piece_start]);
212 piece.segs.push_back(pwsbin.segs[j]);
213 piece.cuts.push_back(pwsbin.cuts[j+1]);
215 ret.push_back(piece);
|
| /inkscape/src/ui/tools/ |
| H A D | calligraphic-tool.cpp | 517 nearest = get_point_on_Path(this->hatch_livarot_path, position->piece, position->t);
586 //g_print ("\nlast_nearest %g %g nearest %g %g pointer %g %g pos %d %g\n", dc->last_nearest[Geom::X], dc->last_nearest[Geom::Y], nearest[Geom::X], nearest[Geom::Y], pointer[Geom::X], pointer[Geom::Y], position->piece, position->t);
|
| /inkscape/src/ui/ |
| H A D | interface.cpp | 1078 Geom::Point nearest = get_point_on_Path(livarot_path, position->piece, position->t);
1181 Geom::Point nearest = get_point_on_Path(livarot_path, position->piece, position->t);
|