| /inkscape/src/2geom/ |
| H A D | rect.cpp | 146 /** @brief Returns the smallest distance between p and rect.
148 Coord distance(Point const &p, Rect const &rect) function in namespace:Geom
170 Coord distance(Point const &p, OptRect const &rect) function in namespace:Geom
173 return distance(p, *rect);
|
| H A D | ray.h | 126 double distance(Point const& _point, Ray const& _ray) { function in namespace:Geom
128 return ::Geom::distance(_point, _ray.pointAt(t));
133 return are_near(distance(_point, _ray), 0, eps);
|
| H A D | angle.h | 163 inline Angle distance(Angle const &a, Angle const &b) { function in namespace:Geom
164 // the distance cannot be larger than M_PI.
|
| H A D | point.h | 118 /** @brief Compute the distance from origin.
338 * @return Point on a line between a and b. The ratio of its distance from a
339 * and the distance between a and b will be equal to t.
373 /// Compute the (Euclidean) distance between points.
375 inline Coord distance (Point const &a, Point const &b) { function in namespace:Geom
379 /// Compute the square of the distance between points.
389 // do not use an unqualified calls to distance before the empty
416 // is an iterator and tries to use std::distance instead of Geom::distance.
|
| H A D | line.h | 104 /// Create a line normal to a vector at a specified distance from origin.
162 v *= distance(_initial, _final);
382 if (distance(pointAt(nearestTime(other._initial)), other._initial) != 0) return false;
383 if (distance(pointAt(nearestTime(other._final)), other._final) != 0) return false;
405 /// @brief Compute distance from point to line.
408 double distance(Point const &p, Line const &line) function in namespace:Geom
411 return ::Geom::distance(p, line.initialPoint());
414 return ::Geom::distance(line.pointAt(t), p);
421 return are_near(distance(p, line), 0, eps);
464 double distance(Poin function in namespace:Geom
[all...] |
| /inkscape/share/extensions/ |
| H A D | draw_from_triangle.py | 89 def distance( (x0,y0),(x1,y1)):#find the pythagorean distance function
333 s_a = distance(vtx[1],vtx[2])#get the scalar side lengths
334 s_b = distance(vtx[0],vtx[1])
335 s_c = distance(vtx[0],vtx[2])
|
| H A D | voronoi.py | 215 priorityQ.insert(lbnd,p,newsite.distance(p))
227 priorityQ.insert(bisector,p,newsite.distance(p))
300 priorityQ.insert(llbnd, p, bot.distance(p))
305 priorityQ.insert(bisector, p, bot.distance(p))
342 def distance(self,other): member in class:Site
|
| /inkscape/src/display/ |
| H A D | guideline.cpp | 205 double distance = Geom::dot((p - gl->point_on_line * gl->affine), unit_vector(vec)); local
206 return MAX(fabs(distance)-1, 0);
|
| /inkscape/src/ |
| H A D | deptool.cpp | 153 int distance; member in class:FileRec
175 distance = other.distance;
932 child->distance = depth;
1295 fprintf(f, "## Note: The metric is the 'distance' of inclusion from\n");
1315 citer->second->distance, cfname.c_str());
1334 fprintf(f, "## Note: The metric is the 'distance' of inclusion from\n");
1352 fprintf(f, "%3d %s\n", citer->second->distance,
|
| /inkscape/src/libavoid/ |
| H A D | visibility.cpp | 185 distance = euclideanDist(centerPoint, vInf->point);
193 // distance from the point we are sweeping around.
194 if (distance == rhs.distance)
205 return distance < rhs.distance;
238 double distance; member in class:Avoid::PointPair
259 dist1(p1.distance),
262 angleDist(p1.distance)
418 if (point.distance > closestI
[all...] |
| /inkscape/src/livarot/ |
| H A D | Shape.cpp | 2199 * \return Minimum distance from p to any of the points or edges of s.
2202 double distance(Shape const *s, Geom::Point const &p) function
2208 /* Find the minimum distance from p to one of the points on s.
2210 ** us the distance squared; we can leave the square root
2253 * Returns true iff the L2 distance from \a thePt to this shape is <= \a max_l2.
2254 * Distance = the min of distance to its points and distance to its edges.
2257 * This is largely similar to distance().
2261 * \param max_l2 L2 distance.
|
| /inkscape/src/libnrtype/ |
| H A D | font-lister.cpp | 925 gint distance = abs(pango_font_description_get_weight(a) - local
928 distance += 10000 * abs(pango_font_description_get_stretch(a) -
936 distance += 1000; // Oblique and italic are almost the same
938 distance += 100000; // Normal vs oblique/italic, not so similar
943 distance += 1000000 * abs(pango_font_description_get_variant(a) -
945 return distance;
|
| /inkscape/src/util/ |
| H A D | ziptool.cpp | 221 static const int MAXDCODES = 30; // max number of distance codes
495 static const int dists[30] = { // Offset base for distance codes 0..29
499 static const int dext[30] = { // Extra bits for distance codes 0..29
504 //decode literals and length/distance pairs
531 symbol = doDecode(distcode);//distance
542 error("distance too far back %d/%d", dist, dest.size());
548 // copy length bytes from distance bytes back
632 // distance table
652 Huffman distcode = {distcnt, distsym}; // distance code
688 // read length/literal and distance cod
1274 unsigned int distance = dist - base; local
[all...] |
| /inkscape/src/helper/ |
| H A D | geom-pathstroke.cpp | 75 double distance = Geom::distance( curve[1], curve[0] ); local
77 (distance * distance * distance);
84 // std::cout << "Start k: " << k << " d: " << distance << " normal: " << normal << std::endl;
86 double distance = Geom::distance( curve[3], curve[2] ); local
88 (distance * distance * distanc
[all...] |