Searched refs:ps (Results 1 - 25 of 32) sorted by relevance

12

/inkscape/src/libavoid/
H A Dgeomtypes.cpp104 ps(poly.size())
113 if ((*sh)->id() == poly.ps[i].id)
121 ps[i] = std::make_pair(polyPtr, poly.ps[i].vn);
135 ps.clear();
141 return ps.empty();
147 return ps.size();
160 const Polygon& poly = *(ps[index].first);
161 unsigned short poly_index = ps[index].second;
164 return poly.ps[poly_inde
[all...]
H A Dconnector.cpp80 x_min = std::min(x_min, poly.ps[i].x);
81 x_max = std::max(x_max, poly.ps[i].x);
82 y_min = std::min(y_min, poly.ps[i].y);
83 y_max = std::max(y_max, poly.ps[i].y);
479 _display_route.ps = route.ps;
734 for (size_t i = 0; i < currRoute.ps.size(); ++i)
736 db_printf("%g, %g ", currRoute.ps[i].x, currRoute.ps[i].y);
742 if (_srcVert->point == currRoute.ps[
[all...]
H A Dgeomtypes.h242 std::vector<Point> ps; member in class:Avoid::Polygon
243 //! @brief If used, denotes whether the corresponding point in ps is
247 //! corresponding point in the ps vector. Possible values are:
284 std::vector<std::pair<const Polygon *, unsigned short> > ps; member in class:Avoid::ReferencingPolygon
H A Dshape.cpp55 node = new VertInf(_router, i, _poly.ps[pt_i], addToRouterNow);
117 curr->Reset(poly.ps[pt_i]);
212 bbox.a = bbox.b = _poly.ps[0];
218 const Point& p = _poly.ps[i];
H A Dvpsc.cpp631 if(ps.A2==0) ps.scale=v->scale;
635 ps.addVariable(v);
636 posn=(ps.AD - ps.AB) / ps.A2;
663 ps.AB=ps.AD=ps.A2=0;
666 ps
[all...]
H A Drouter.cpp883 const Point& pi = poly.ps[pt_i];
884 const Point& pn = poly.ps[pt_n];
1085 Point start = conn->_route.ps[0];
1086 Point end = conn->_route.ps[conn->_route.size() - 1];
1567 fprintf(fp, " poly%u.ps[%lu] = Point(%g, %g);\n",
1751 route.ps[0].x, route.ps[0].y);
1754 fprintf(fp, "L %g,%g ", route.ps[i].x, route.ps[i].y);
1784 route.ps[
[all...]
H A Dmakepath.cpp145 connRoute.ps.resize(routeSize);
146 connRoute.ps[routeSize - 1] = inf3->point;
147 connRoute.ps[routeSize - 2] = inf2->point;
151 connRoute.ps[routeSize] = done[curr].inf->point;
233 COLA_ASSERT(cBoundary.ps[0] != cBoundary.ps[cBoundary.size() - 1]);
H A Dgeometry.cpp277 l += dist(poly.ps[i-1], poly.ps[i]);
305 const std::vector<Point>& P = poly.ps;
341 std::vector<Point>& P = poly.ps;
H A Dvpsc.h79 PositionStats ps; member in class:Avoid::Block
163 return (block->ps.scale*block->posn+offset)/scale;
H A Dorthogonal.cpp91 return connRef->displayRoute().ps[indexLow];
96 return connRef->displayRoute().ps[indexHigh];
101 return connRef->displayRoute().ps[indexLow];
106 return connRef->displayRoute().ps[indexHigh];
1729 if (displayRoute.ps[i - 1][dim] == displayRoute.ps[i][dim])
1734 if (displayRoute.ps[i - 1][altDim] > displayRoute.ps[i][altDim])
1757 double prevPos = displayRoute.ps[i - 2][dim];
1758 double nextPos = displayRoute.ps[
[all...]
/inkscape/src/livarot/
H A Dint-line.h90 inline float ValAt(int at, int ps, int pe, float vs, float ve) { argument
91 return ((at - ps) * ve + (pe - at) * vs) / (pe - ps);
H A Dfloat-line.h119 inline float ValAt(float at, float ps, float pe, float vs, float ve) { argument
120 return ((at - ps) * ve + (pe - at) * vs) / (pe - ps);
H A DShapeMisc.cpp1156 int ps = nPiece, pe = nPiece; local
1225 if (pe == ps)
1227 ReFormeBezierChunk (px, nx, dest, inBezier, nbInterm, from, ps,
1230 else if (ps < pe)
1237 for (int i = ps; i <= pe; i++)
1253 for (int i = ps; i < pe; i++)
1269 PathDescrIntermBezierTo* psData = dynamic_cast<PathDescrIntermBezierTo*>(from->descr_cmd[ps+1]);
1270 PathDescrIntermBezierTo* pnData = dynamic_cast<PathDescrIntermBezierTo*>(from->descr_cmd[ps+2]);
1274 from, ps, ts, 1.0);
1276 for (int i = ps
[all...]
H A DPathConversion.cpp916 Geom::Point ps = iS - iP; local
919 double s = fabs(cross(pe, ps));
1042 Geom::Point ps = iS - iP; local
1044 const double s = fabs(cross(pe, ps));
1204 const Geom::Point ps = iS - iP; local
1206 const double s = fabs(cross(pe, ps));
/inkscape/src/2geom/
H A Dtoposweep.h54 Curve const &get(PathVector const &ps) const {
55 return ps[path][ix];
69 Section(CurveIx cix, double fd, double td, PathVector ps, Dim2 d) : curve(cix), f(fd), t(td) { argument
70 fp = curve.get(ps).pointAt(f), tp = curve.get(ps).pointAt(t);
111 TopoGraph(PathVector const &ps, Dim2 d, double t);
136 //TopoGraph sweep_graph(PathVector const &ps, Dim2 d = X, double tol = 0.00001);
146 PathVector areas_to_paths(PathVector const &ps, Areas const &areas);
149 const PathVector &ps; member in class:Geom::SectionSorter
158 SectionSorter(const PathVector &rs, Dim2 d, double t = 0.00001) : ps(r
188 filter_areas(PathVector const &ps, Areas const & areas, Z const &z) argument
[all...]
H A Dtoposweep.cpp115 std::vector<boost::shared_ptr<Section> > mono_sections(PathVector const &ps, Dim2 d) { argument
117 for(unsigned i = 0; i < ps.size(); i++) {
119 if(ps[i].size()) {
120 for(unsigned j = 0; j < ps[i].size(); j++) {
122 Curve* deriv = ps[i][j].derivative();
129 monos.push_back(boost::shared_ptr<Section>(new Section(CurveIx(i,j), splits[k-1], splits[k], ps, d)));
139 double section_root(Section const &s, PathVector const &ps, double v, Dim2 d) { argument
140 std::vector<double> roots = s.curve.get(ps).roots(v, d);
147 Point ap = a.curve.get(ps).pointAt(at);
148 Point bp = b.curve.get(ps)
198 split_section(boost::shared_ptr<Section> s, PathVector const &ps, std::vector<double> &cuts, Dim2 d) argument
345 TopoGraph(PathVector const &ps, Dim2 d, double t) argument
640 area_to_path(PathVector const &ps, Area const &area) argument
658 areas_to_paths(PathVector const &ps, Areas const &areas) argument
[all...]
H A Dbezier-curve.h82 * @param ps Vector which must contain order() + 1 points.
85 virtual void setPoints(std::vector<Point> const &ps) { argument
87 if (ps.size() != order() + 1)
90 setPoint(i, ps[i]);
/inkscape/src/
H A Dsp-conn-end-pair.cpp339 curve->moveto( Geom::Point(route.ps[0].x, route.ps[0].y) );
342 Geom::Point p(route.ps[i].x, route.ps[i].y);
356 curve->curveto( p, Geom::Point(route.ps[i+1].x, route.ps[i+1].y),
357 Geom::Point(route.ps[i+2].x, route.ps[i+2].y) );
H A Dgradient-chemistry.cpp1406 SPPaintServer *ps = NULL; local
1408 ps = (fill_or_stroke == Inkscape::FOR_FILL) ? SP_STYLE_FILL_SERVER(style) : SP_STYLE_STROKE_SERVER(style);
1411 if (ps
1412 && ( (type == SP_GRADIENT_TYPE_LINEAR && SP_IS_LINEARGRADIENT(ps)) ||
1413 (type == SP_GRADIENT_TYPE_RADIAL && SP_IS_RADIALGRADIENT(ps)) ) )
1417 SPGradient *current = SP_GRADIENT(ps);
/inkscape/src/display/
H A Ddrawing-text.cpp290 Geom::Point ps = Geom::Point(step * round(p1[Geom::X]/step),p1[Geom::Y]); local
295 ps -= Geom::Point(0, vextent/12.0);
297 dc.rectangle( Geom::Rect(ps + poff, pf - poff));
298 ps += Geom::Point(0, vextent/6.0);
300 dc.rectangle( Geom::Rect(ps + poff, pf - poff));
309 Geom::Point pv = ps;
334 Geom::Point pv = ps;
360 double x = ps[Geom::X];
361 double y = ps[Geom::Y] + poff[Geom::Y];
369 y = ps[Geo
[all...]
H A Dnr-style.h60 void set(SPPaintServer *ps);
H A Dnr-style.cpp35 void NRStyle::Paint::set(SPPaintServer *ps) argument
38 if (ps) {
40 server = ps;
/inkscape/src/ui/tools/
H A Dpencil-tool.h43 std::vector<Geom::Point> ps; member in class:Inkscape::UI::Tools::PencilTool
H A Dpencil-tool.cpp296 if (this->ps.empty()) {
297 // Only in freehand mode we have to add the first point also to this->ps (apparently)
301 this->ps.push_back(this->p[0]);
616 this->ps.push_back(p);
629 if ( this->ps.size() <= 1 ) {
651 int n_points = this->ps.size();
658 int const n_segs = Geom::bezier_fit_cubic_r(b.data(), this->ps.data(), n_points, tolerance_sq, max_segs);
699 this->ps.clear();
705 if ( this->ps.size() <= 1 ) {
725 int n_points = this->ps
[all...]
/inkscape/src/extension/param/
H A Dparameter.cpp114 ParamString * ps = dynamic_cast<ParamString *>(param); local
115 ps->setMaxLength(atoi(max_length));

Completed in 73 milliseconds

12