| /inkscape/share/extensions/ |
| H A D | generate_voronoi.py | 11 (at your option) any later version.
35 inkex.errormsg(_("Failed to import the subprocess module. Please report this as a bug at: https://bugs.launchpad.net/inkscape.")) namespace
|
| /inkscape/src/livarot/ |
| H A D | float-line.h | 31 * The idea behind that is that a given edge produces one float_ligne_bord at
97 float RemainingValAt(float at, int pending);
119 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 D | int-line.h | 72 float RemainingValAt(int at);
90 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 D | float-line.cpp | 89 // insert it in the doubly-linked list, knowing that boundary at index n-1 is not too far before me
252 * Add a coverage portion by appending boundaries at the end of the list.
407 float FloatLigne::RemainingValAt(float at, int pending) argument
413 sum+=bords[nn].val+(at-bords[nn].pos)*bords[nn].pente;
414 // sum+=((at-bords[nn].pos)*bords[no].val+(bords[no].pos-at)*bords[nn].val)/(bords[no].pos-bords[nn].pos);
415 // sum+=ValAt(at,bords[nn].pos,bords[no].pos,bords[nn].val,bords[no].val);
418 // for each portion being scanned, compute coverage at position "at" and sum.
419 // we could simply compute the sum of portion coverages as a "f(x)=ux+y" and evaluate it at "
[all...] |
| H A D | LivarotDefs.h | 102 double at; member in struct:grad_stop
115 // double caa,car,cag,cab; // color at gradient position 0
116 // double cba,cbr,cbg,cbb; // color at gradient position 1
|
| H A D | Path.cpp | 16 * at the end of this file, 2 utilitary functions to get the point and tangent to path associated with a (command no;abcissis)
103 void Path::InsertForcePoint(int at) argument
105 if ( at < 0 || at > int(descr_cmd.size()) ) {
109 if ( at == int(descr_cmd.size()) ) {
114 descr_cmd.insert(descr_cmd.begin() + at, new PathDescrForced);
153 void Path::InsertMoveTo(Geom::Point const &iPt, int at) argument
155 if ( at < 0 || at > int(descr_cmd.size()) ) {
159 if ( at
180 InsertLineTo(Geom::Point const &iPt, int at) argument
208 InsertCubicTo(Geom::Point const &iPt, Geom::Point const &iStD, Geom::Point const &iEnD, int at) argument
237 InsertArcTo(Geom::Point const &iPt, double iRx, double iRy, double angle, bool iLargeArc, bool iClockwise, int at) argument
333 InsertIntermBezierTo(Geom::Point const &iPt, int at) argument
367 InsertBezierTo(Geom::Point const &iPt, int iNb, int at) argument
516 PointAt(int piece, double at, Geom::Point &pos) argument
606 PointAndTangentAt(int piece, double at, Geom::Point &pos, Geom::Point &tgt) argument
[all...] |
| H A D | int-line.cpp | 81 float IntLigne::RemainingValAt(int at) argument
87 sum += ValAt(at, bords[nn].pos, bords[no].pos, bords[nn].val, bords[no].val);
680 // what's remaining in the c_full at best we flush an entire c_full, ie 32 bits, or 32/4=8 pixels
|
| H A D | PathOutline.cpp | 906 * \param at Distance along a tangent (0 <= at <= 1).
909 * \param pos Filled in with the position of `at' on the segment.
914 void Path::TangentOnSegAt(double at, Geom::Point const &iS, PathDescrLineTo const &fin, argument
926 pos = (1 - at) * iS + at * iE; // in other words, pos = iS + at * seg
932 void Path::TangentOnArcAt(double at, const Geom::Point &iS, PathDescrArcTo const &fin, argument
1045 double b = sang * (1 - at) + eang * at;
1077 TangentOnCubAt(double at, Geom::Point const &iS, PathDescrCubicTo const &fin, bool before, Geom::Point &pos, Geom::Point &tgt, double &len, double &rad) argument
1131 TangentOnBezAt(double at, Geom::Point const &iS, PathDescrIntermBezierTo & mid, PathDescrBezierTo & fin, bool before, Geom::Point & pos, Geom::Point & tgt, double &len, double &rad) argument
[all...] |
| /inkscape/src/libavoid/ |
| H A D | geomtypes.cpp | 11 * version 2.1 of the License, or (at your option) any later version.
157 const Point& ReferencingPolygon::at(size_t index) const function in class:Avoid::ReferencingPolygon
178 progressiveMinX = std::min(progressiveMinX, at(i).x);
179 progressiveMinY = std::min(progressiveMinY, at(i).y);
180 progressiveMaxX = std::max(progressiveMaxX, at(i).x);
181 progressiveMaxY = std::max(progressiveMaxY, at(i).y);
224 ps[i] = poly.at(i);
254 const Point& Polygon::at(size_t index) const
269 // endpoints of the line to shorten the line by shorten_length at either
|
| /inkscape/src/2geom/ |
| H A D | pathvector.h | 13 * (the "LGPL") or, at your option, under the terms of the Mozilla
26 * compliance with the License. You may obtain a copy of the License at
161 Path &at(size_type index) { function in class:Geom::PathVector
162 return _data.at(index);
164 Path const &at(size_type index) const { function in class:Geom::PathVector
165 return _data.at(index);
171 /// Append a path at the end.
198 * a degenerate closing segment at (0,0). */
235 return at(pos.path_index);
238 return at(po
[all...] |
| H A D | path.h | 6 * Marco Cecchetti <mrcekets at gmail.com>
14 * (the "LGPL") or, at your option, under the terms of the Mozilla
27 * compliance with the License. You may obtain a copy of the License at
148 /// Convert times at or beyond 1 to 0 on the next curve.
155 /// Convert times at or before 0 to 1 on the previous curve.
213 /// Get a time at least @a min_dist away in parameter space from the ends.
350 /// Construct an empty path starting at the specified point.
408 Curve const &at(size_type i) const { return _data->curves.at(i); } function in class:Geom::Path
411 * Since the curve always contains at leas
[all...] |
| H A D | toposweep.cpp | 146 bool SectionSorter::section_order(Section const &a, double at, Section const &b, double bt) const { argument
147 Point ap = a.curve.get(ps).pointAt(at);
|
| /inkscape/src/ |
| H A D | conn-avoid-ref.cpp | 211 double at; local
212 at = 0;
226 at += seg_size;
227 if (at <= 1.0 )
228 poly_points.push_back(cit->pointAt(at));
231 at = 0.0;
|
| /inkscape/src/ui/tool/ |
| H A D | node.cpp | 165 // at its ends, make their handles colinear with the segment
693 * but smooth nodes at ends of linear segments and auto nodes need special treatment */
729 /* Fix smooth handles at the ends of linear segments.
731 * If there is a smooth node at the other end of the segment, rotate it too. */
1056 // this node, because there is at least one unselected node in the subpath,
1580 ListNode *ins_beg = first._node, *ins_end = last._node, *at = pos._node; local
1585 ins_end->ln_prev->ln_next = at;
1586 at->ln_prev->ln_next = ins_beg;
1588 ListNode *atprev = at->ln_prev;
1589 at
[all...] |
| H A D | path-manipulator.cpp | 235 // if at least one of the nodes from this subpath is selected,
282 if (dist < 1e-5) { // 1e-6 is too small, as observed occasionally when inserting a node at a snapped intersection of paths
310 // very rare but: extremum node at the same extreme value!!! so add it to the list
315 /** Insert a new node at the extremum of the selected segments. */
333 // a line segment has is extrema at the start and end, no node should be added
350 // don't insert node at the start or end of a segment, i.e. round values for extr_t
361 /** Insert new nodes exactly at the positions of selected nodes while preserving shape.
540 /** Break the subpath at selected nodes. It also works for single node closed paths. */
547 // Each open path must have at least two nodes so no checks are required.
558 // Move the node to break at t
1450 Geom::Point at = j->pointAt(0.5); local
[all...] |