Searched defs:closest (Results 1 - 5 of 5) sorted by relevance

/inkscape/src/2geom/
H A Dnearest-time.cpp118 double closest = from; local
125 closest = zeros[i];
130 closest = to;
131 return closest;
171 unsigned closest = 0; local
175 closest = i;
180 if (distsq[closest] == distsq[i]) {
/inkscape/src/
H A Dunclump.cpp197 SPItem *closest = NULL; local
208 closest = other;
212 return closest;
239 Removes from the \a rest list those items that are "behind" \a closest as seen from \a item,
240 i.e. those on the other side of the line through \a closest perpendicular to the direction from \a
241 item to \a closest. Returns a newly created list which must be freed.
244 unclump_remove_behind (SPItem *item, SPItem *closest, std::list<SPItem*> &rest) argument
247 Geom::Point p1 = unclump_center (closest);
249 // perpendicular through closest to the direction to item:
351 SPItem *closest local
368 SPItem *closest = unclump_closest (item, nei); local
[all...]
H A Dgradient-drag.cpp429 double closest = 1e10; local
446 if ( dist_screen < closest ) {
447 closest = dist_screen;
464 if ( dist_screen < closest ) {
465 closest = dist_screen;
482 if ( dist_screen < closest ) {
483 closest = dist_screen;
500 if ( dist_screen < closest ) {
501 closest = dist_screen;
511 if( closest < toleranc
[all...]
/inkscape/src/ui/tool/
H A Dmulti-path-manipulator.cpp67 // Below we find the closest pairs. The algorithm is O(N^3).
71 double closest = DBL_MAX; local
76 if (dist < closest) {
77 closest = dist;
H A Dpath-manipulator.cpp1065 /** Find the node that is closest/farthest from the origin
1069 * @param closest If true, return closest node, if false, return farthest
1073 bool search_unselected, bool closest)
1076 double extr_dist = closest ? HUGE_VAL : -HUGE_VAL;
1087 bool cond = closest ? (dist < extr_dist) : (dist > extr_dist);
1072 extremeNode(NodeList::iterator origin, bool search_selected, bool search_unselected, bool closest) argument

Completed in 22 milliseconds