/inkscape/src/ |
H A D | sp-paint-server.h | 68 /* Use a pair of pointers for detecting loops: p1 advances half as fast as p2. If there is a 70 p1 and p2 is a multiple of the loop size. */ 71 PaintServer *p1 = src, *p2 = src; local 74 if (match(p2)) { 75 return p2; 78 p2 = p2->ref->getObject(); 79 if (!p2) { 80 return p2; 87 if ( p2 [all...] |
/inkscape/src/helper/ |
H A D | mathfns.h | 25 triangle_area (Geom::Point p1, Geom::Point p2, Geom::Point p3) argument 29 return (p1[X]*p2[Y] + p1[Y]*p3[X] + p2[X]*p3[Y] - p2[Y]*p3[X] - p1[Y]*p2[X] - p1[X]*p3[Y]);
|
/inkscape/src/libdepixelize/priv/ |
H A D | curvature.h | 41 Curvature(Point<T> p0, Point<T> c1, Point<T> p2) : argument 42 p0(p0), c1(c1), p2(p2) 67 Point<T> p0, c1, p2; member in struct:Tracer::Curvature 81 return (1-t)*2*(c1.x-p0.x) + t*2*(p2.x-c1.x); 87 return (1-t)*2*(c1.y-p0.y) + t*2*(p2.y-c1.y); 93 return 2 * (p2.x - 2*c1.x + p0.x); 99 return 2 * (p2.y - 2*c1.y + p0.y);
|
/inkscape/src/2geom/ |
H A D | cairo-path-sink.cpp | 54 void CairoPathSink::curveTo(Point const &p1, Point const &p2, Point const &p3) argument 56 cairo_curve_to(_cr, p1[X], p1[Y], p2[X], p2[Y], p3[X], p3[Y]); 60 void CairoPathSink::quadTo(Point const &p1, Point const &p2) argument 65 Point q2 = (2./3.) * p1 + (1./3.) * p2; 66 // q3 = p2 67 cairo_curve_to(_cr, q1[X], q1[Y], q2[X], q2[Y], p2[X], p2[Y]); 68 _current_point = p2;
|
H A D | svg-path-writer.cpp | 126 void SVGPathWriter::curveTo(Point const &p1, Point const &p2, Point const &p3) argument 135 _current_pars.push_back(p2[X]); 136 _current_pars.push_back(p2[Y]); 141 _cubic_tangent = p3 + (p3 - p2);
|
/inkscape/src/display/ |
H A D | sp-ctrlcurve.cpp | 76 cl->p1 == cl->p2 && 77 cl->p2 == cl->p3 ) 86 Geom::Point p2 = cl->p2 * cl->affine; local 92 p2[Geom::X] - buf->rect.left(), p2[Geom::Y] - buf->rect.top(), 112 if (cl->p0 == cl->p1 && cl->p1 == cl->p2 && cl->p2 == cl->p3 ) { 118 Geom::Point p2 = cl->p2 * affin local [all...] |
H A D | sp-ctrlquadr.cpp | 26 Geom::Point p1, p2, p3, p4; member in struct:SPCtrlQuadr 54 ctrlquadr->p2 = Geom::Point(0, 0); 82 Geom::Point p2 = (cq->p2 * cq->affine) - min; local 87 cairo_line_to(buf->ct, p2[Geom::X], p2[Geom::Y]); 127 Geom::Point p2(cq->p2 * affine); 131 item->x1 = (int)(MIN4(p1[Geom::X], p2[Geom::X], p3[Geom::X], p4[Geom::X])); 132 item->y1 = (int)(MIN4(p1[Geom::Y], p2[Geo 154 sp_ctrlquadr_set_coords(SPCtrlQuadr *cl, Geom::Point p1, Geom::Point p2, Geom::Point p3, Geom::Point p4) argument [all...] |
H A D | sp-ctrlquadr.h | 27 void sp_ctrlquadr_set_coords (SPCtrlQuadr *cl, const Geom::Point p1, const Geom::Point p2, const Geom::Point p3, const Geom::Point p4);
|
H A D | sp-ctrlcurve.h | 33 Geom::Point p0, p1, p2, p3; member in struct:SPCtrlCurve
|
H A D | drawing-text.cpp | 263 void DrawingText::decorateStyle(DrawingContext &dc, double vextent, double xphase, Geom::Point const &p1, Geom::Point const &p2, double thickness) argument 284 /* For most spans draw the last little bit right to p2 or even a little beyond. 291 Geom::Point pf = Geom::Point(step * round(p2[Geom::X]/step),p2[Geom::Y]); 398 Geom::Point p2; local 408 p2 = Geom::Point(tsp_width_adj,-_nrstyle.underline_position); 409 decorateStyle(dc, tsp_size_adj, xphase, p1, p2, thickness); 414 p2 = Geom::Point(tsp_width_adj,tsp_asc_adj -_nrstyle.underline_position + 1 * final_underline_thickness); 415 decorateStyle(dc, tsp_size_adj, xphase, p1, p2, thickness); 424 p2 [all...] |
H A D | curve.h | 62 void quadto(Geom::Point const &p1, Geom::Point const &p2); 64 void curveto(Geom::Point const &p0, Geom::Point const &p1, Geom::Point const &p2);
|
H A D | drawing-text.h | 73 void decorateStyle(DrawingContext &dc, double vextent, double xphase, Geom::Point const &p1, Geom::Point const &p2, double thickness);
|
/inkscape/share/extensions/ |
H A D | cspsubdiv.py | 8 p2 = Point(p2x,p2y) 12 return max(s1.distanceToPoint(p1),s1.distanceToPoint(p2)) 23 p2 = sp[i][0] 26 b = (p0,p1,p2,p3)
|
/inkscape/src/livarot/ |
H A D | AlphaLigne.h | 75 static int CmpStep(const void * p1, const void * p2) { argument 77 alpha_step* d2=(alpha_step*)p2;
|
H A D | int-line.h | 74 static int CmpBord(void const *p1, void const *p2) { argument 76 int_ligne_bord const *d2 = reinterpret_cast<int_ligne_bord const *>(p2);
|
/inkscape/src/live_effects/ |
H A D | lpe-powerstroke-interpolators.h | 230 Point p2 = points[i+2]; local 233 fit.append(calc_bezier(p0, p1, p2, p3)); 240 CubicBezier calc_bezier(Point p0, Point p1, Point p2, Point p3) const { argument 241 // create interpolating bezier between p1 and p2 251 double dt1 = powf(distanceSq(p1, p2), 0.25); 252 double dt2 = powf(distanceSq(p2, p3), 0.25); 265 Point tan1 = (p1 - p0) / dt0 - (p2 - p0) / (dt0 + dt1) + (p2 - p1) / dt1; 266 Point tan2 = (p2 - p1) / dt1 - (p3 - p1) / (dt1 + dt2) + (p3 - p2) / dt [all...] |
H A D | lpe-show_handles.h | 35 virtual void drawHandleLine(Geom::Point p,Geom::Point p2);
|
H A D | lpe-show_handles.cpp | 189 LPEShowHandles::drawHandleLine(Geom::Point p,Geom::Point p2) argument 193 if(diameter > 0.0 && Geom::distance(p,p2) > (diameter * 0.35)) { 194 Geom::Ray ray2(p, p2); 195 p2 = p2 - Geom::Point::polar(ray2.angle(),(diameter * 0.35)); 198 path.appendNew<Geom::LineSegment>( p2 );
|
H A D | lpe-simplify.cpp | 286 LPESimplify::drawHandleLine(Geom::Point p,Geom::Point p2) argument 291 if(helper_size > 0 && Geom::distance(p,p2) > (diameter * 0.35)) { 292 Geom::Ray ray2(p, p2); 293 p2 = p2 - Geom::Point::polar(ray2.angle(),(diameter * 0.35)); 295 path.appendNew<Geom::LineSegment>( p2 );
|
H A D | lpe-simplify.h | 35 virtual void drawHandleLine(Geom::Point p,Geom::Point p2);
|
/inkscape/src/ui/ |
H A D | control-manager.h | 56 SPCtrlLine *createControlLine(SPCanvasGroup *parent, Geom::Point const &p1, Geom::Point const &p2, CtrlLineType type = CTLINE_PRIMARY); 58 SPCtrlCurve *createControlCurve(SPCanvasGroup *parent, Geom::Point const &p0, Geom::Point const &p1, Geom::Point const &p2, Geom::Point const &p3, CtrlLineType type = CTLINE_PRIMARY);
|
/inkscape/src/libavoid/ |
H A D | makepath.cpp | 117 // points p1--p2 and p2--p3. Return value is in radians. 119 static double angleBetween(const Point& p1, const Point& p2, const Point& p3) argument 121 if ((p1.x == p2.x && p1.y == p2.y) || (p2.x == p3.x && p2.y == p3.y)) 128 Point v1(p1.x - p2.x, p1.y - p2.y); 129 Point v2(p3.x - p2 180 Point p2 = inf2->point; local [all...] |
H A D | router.cpp | 1098 const Point& p2 = i->shNext->point; local 1109 if (p1.y == p2.y) 1118 min = std::min(p1.x, p2.x); 1119 max = std::max(p1.x, p2.x); 1121 else if (p1.x == p2.x) 1130 min = std::min(p1.y, p2.y); 1131 max = std::max(p1.y, p2.y); 1136 Point n_p2(p2.x - p1.x, p2.y - p1.y); 1217 if (p1.x == p2 1667 Point p2 = ptpair.second; local 1697 Point p2 = ptpair.second; local 1721 Point p2 = ptpair.second; local [all...] |
/inkscape/src/extension/internal/ |
H A D | emf-print.cpp | 157 char *p2; local 158 uint32_t lc = strtoul(&p1[1], &p2, 16); // it looks like "#ABC123" 159 if (*p2) { 201 char *p2 = strrchr(ansi_uri, '/'); local 202 char *p = MAX(p1, p2); 624 Geom::Point p2(lg->x2.computed, lg->y2.computed); 628 p2 = p2 * lg->gradientTransform; 1145 rectDir = vector_rect_alignment(angle, (gv.p2 - gv.p1) * fill_transform); 1185 Geom::Point xv = gv.p2 1574 Geom::Point p2 = points[2]; local 1863 Geom::Point p2 = points[2]; local 2104 Geom::Point p2 = p * tf; local [all...] |
H A D | wmf-print.cpp | 154 char *p2; local 155 uint32_t lc = strtoul(&p1[1], &p2, 16); // it looks like "#ABC123" 156 if (*p2) { 693 Geom::Point xv = gv.p2 - gv.p1; // X' vector 745 Geom::Point uv = Geom::unit_vector(gv.p2 - gv.p1); // unit vector 747 double range = Geom::distance(gv.p1, gv.p2); // length along the gradient 764 pathvc = rect_cutter(gv.p2, uv * (-overlap), uv * (50000.0), puv * 50000.0); 989 Geom::Point p2 = points[2]; local 994 p2[X] = (p2[ 1480 Geom::Point p2 = p * tf; local [all...] |