/inkscape/src/helper/ |
H A D | geom-nodetype.cpp | 32 Geom::Curve *crv = c_incoming.reverse();
|
H A D | geom-pathstroke.cpp | 376 Geom::Circle circle1 = touching_circle(Geom::reverse(incoming.toSBasis()), 0.); 704 Geom::Point tang1 = Geom::unitTangentAt(reverse(incoming.toSBasis()), 0.); 713 Geom::Point tang2 = Geom::rot90(unitTangentAt(reverse(l.toSBasis()), 0.)); 762 Geom::Point end_normal = -Geom::rot90(Geom::unitTangentAt(Geom::reverse(bez.toSBasis()), 0.)); 888 Geom::Point normal_1 = -Geom::unitTangentAt(Geom::reverse(with_dir.back().toSBasis()), 0.); 898 Geom::Point normal_1 = -Geom::unitTangentAt(Geom::reverse(with_dir.back().toSBasis()), 0.);
|
/inkscape/src/live_effects/ |
H A D | lpe-extrude.cpp | 147 part.continuousConcat(reverse(cut) + extrude_vector.getVector()); 148 part.continuousConcat(reverse(connector) + cut.firstValue()); 156 part.continuousConcat(reverse(cut) + extrude_vector.getVector()); 157 part.continuousConcat(reverse(connector) + cut.firstValue()); 163 part.continuousConcat(reverse(cut) + extrude_vector.getVector()); 164 part.continuousConcat(reverse(connector) + cut.firstValue());
|
H A D | lpe-offset.cpp | 76 output.continuousConcat(reverse(pwd2_in - n * offset));
|
H A D | lpe-powerstroke.cpp | 345 Geom::Point tang1 = -unitTangentAt(reverse(B[prev_i]),0.); // = unitTangentAt(B[prev_i],1); 397 Geom::CubicBezier bzr1 = sbasis_to_cubicbezier( reverse(newcurve1) ); 400 Geom::CubicBezier bzr2 = sbasis_to_cubicbezier( reverse(newcurve2) ); 424 Geom::Circle circle1 = Geom::touching_circle(reverse(B[prev_i]), 0.0); 638 Piecewise<D2<SBasis> > mirrorpath = reverse(compose(pwd2_in,x) - y*compose(n,x)); 641 Geom::Path fixed_mirrorpath = path_from_piecewise_fix_cusps( mirrorpath, reverse(y), jointype, miter_limit, LPE_CONVERSION_TOLERANCE); 656 Geom::Point end_deriv = -unitTangentAt( reverse(pwd2_in.segs.back()), 0.); 665 Geom::Point end_deriv = -unitTangentAt( reverse(pwd2_in.segs.back()), 0.);
|
/inkscape/src/2geom/ |
H A D | crossing.cpp | 54 bool rev = ret[i].edges[j].reverse; 167 if(i < split) std::reverse(res.begin(), res.end()); 177 if(i >= split) std::reverse(res.begin(), res.end());
|
H A D | ray.h | 108 Ray reverse() const { function in class:Geom::Ray 176 return (cw ? bisector : bisector.reverse());
|
H A D | pathvector.cpp | 53 void PathVector::reverse(bool reverse_paths) function in class:Geom::PathVector 56 std::reverse(begin(), end()); 70 std::reverse(ret.begin(), ret.end());
|
H A D | bezier-curve.h | 128 virtual Curve *reverse() const { function in class:Geom::BezierCurve 129 return new BezierCurve(Geom::reverse(inner)); 266 virtual Curve *reverse() const { function in class:Geom::BezierCurveN 270 return new BezierCurveN(Geom::reverse(inner));
|
H A D | intersection-graph.cpp | 372 bool reverse = false; local 374 reverse = (i->next_edge == INSIDE) ^ enter_a; 376 reverse = (i->next_edge == INSIDE) ^ enter_b; 380 if (reverse) { 389 reverse, _pv[i->which][pi].size());
|
H A D | path.cpp | 811 bool reverse = ival.reverse(); 812 int di = reverse ? -1 : 1; 825 Curve *c_first = (*this)[from.curve_index].portion(from.t, reverse ? 0 : 1); 834 if (reverse) { 835 target.append((*this)[i].reverse()); 841 Curve *c_last = (*this)[to.curve_index].portion(reverse ? 1 : 0, to.t); 874 // when the path is open, we reverse all real curves, and add a reversed closing segment. 875 ret._closing_seg = static_cast<ClosingSegment *>(_closing_seg->reverse()); 879 ret._data->curves.push_back(iter->reverse()); [all...] |
H A D | linear.h | 148 inline Linear reverse(Linear const &a) { return Linear(a[1], a[0]); }
|
H A D | angle.h | 275 void reverse() { function in class:Geom::AngleInterval 283 result.reverse();
|
H A D | solve-bezier.cpp | 242 Left = reverse(Left); 249 Left = reverse(Left);
|
H A D | sbasis-math.cpp | 313 //TODO: define reverse(pw<sb>); 317 reciprocal_fn_neg.push_seg(-reverse(reciprocal_fn.segs.at(idx))); 358 SBasis bump_out = reverse( bump_in );
|
H A D | concepts.h | 89 t = reverse(t);
|
H A D | curve.h | 228 virtual Curve *reverse() const { return portion(1, 0); } function in class:Geom::Curve
|
H A D | elliptical-arc.h | 301 virtual Curve *reverse() const;
|
/inkscape/src/ui/tool/ |
H A D | transform-handle-set.h | 103 void getNextClosestPoint(bool reverse);
|
/inkscape/src/ui/tools/ |
H A D | tweak-tool.cpp | 360 sp_tweak_dilate_recursive (Inkscape::Selection *selection, SPItem *item, Geom::Point p, Geom::Point vector, gint mode, double radius, double force, double fidelity, bool reverse) argument 397 if (sp_tweak_dilate_recursive (selection, child, p, vector, mode, radius, force, fidelity, reverse)) { 426 (reverse? (a->midpoint() - p) : (p - a->midpoint())); 454 double scale = 1 + (reverse? force : -force) * 0.05 * (cos(M_PI * x) + 1); 467 double angle = (reverse? force : -force) * 0.05 * (cos(M_PI * x) + 1) * M_PI; 483 if (reverse) { // delete 567 reverse? force : -force, 573 reverse? force : -force, 890 bool do_blur, bool reverse, 904 do_blur, reverse, 886 sp_tweak_color_recursive(guint mode, SPItem *item, SPItem *item_at_point, guint32 fill_goal, bool do_fill, guint32 stroke_goal, bool do_stroke, float opacity_goal, bool do_opacity, bool do_blur, bool reverse, Geom::Point p, double radius, double force, bool do_h, bool do_s, bool do_l, bool do_o) argument 1021 sp_tweak_dilate(TweakTool *tc, Geom::Point event_p, Geom::Point p, Geom::Point vector, bool reverse) argument [all...] |
H A D | pen-tool.cpp | 1584 bool reverse = false; local 1590 reverse = true; 1595 reverse = true; 1622 if (reverse) { 1640 bool reverse = false; local 1647 reverse = true; 1652 reverse = true; 1673 if (reverse) {
|
/inkscape/src/display/ |
H A D | nr-filter-convolve-matrix.cpp | 55 // which corresponds to reverse element order 56 std::reverse(_kernel.begin(), _kernel.end());
|
/inkscape/src/ |
H A D | seltrans.h | 99 void getNextClosestPoint(bool reverse);
|
H A D | selection-chemistry.h | 46 static void reverse(SPDesktop *dt);
|
/inkscape/CMakeScripts/ |
H A D | cmake_consistency_check.py | 246 errs.reverse()
|