Searched refs:eps (Results 1 - 25 of 33) sorted by relevance

12

/inkscape/src/2geom/
H A Daffine.cpp103 * @param eps Numerical tolerance
109 bool Affine::isIdentity(Coord eps) const {
110 return are_near(_c[0], 1.0, eps) && are_near(_c[1], 0.0, eps) &&
111 are_near(_c[2], 0.0, eps) && are_near(_c[3], 1.0, eps) &&
112 are_near(_c[4], 0.0, eps) && are_near(_c[5], 0.0, eps);
117 * @param eps Numerical tolerance
123 bool Affine::isTranslation(Coord eps) cons
504 are_near(Affine const &a, Affine const &b, Coord eps) argument
[all...]
H A Daffine.h140 bool isIdentity(Coord eps = EPSILON) const;
142 bool isTranslation(Coord eps = EPSILON) const;
143 bool isScale(Coord eps = EPSILON) const;
144 bool isUniformScale(Coord eps = EPSILON) const;
145 bool isRotation(Coord eps = EPSILON) const;
146 bool isHShear(Coord eps = EPSILON) const;
147 bool isVShear(Coord eps = EPSILON) const;
149 bool isNonzeroTranslation(Coord eps = EPSILON) const;
150 bool isNonzeroScale(Coord eps = EPSILON) const;
151 bool isNonzeroUniformScale(Coord eps
[all...]
H A Dcoord.h92 inline bool are_near(Coord a, Coord b, double eps=EPSILON) { return a-b <= eps && a-b >= -eps; } argument
93 inline bool rel_error_bound(Coord a, Coord b, double eps=EPSILON) { return a <= eps*b && a >= -eps*b; } argument
H A Dtransforms.h140 inline bool are_near(Translate const &a, Translate const &b, Coord eps=EPSILON) {
141 return are_near(a[X], b[X], eps) && are_near(a[Y], b[Y], eps);
178 inline bool are_near(Scale const &a, Scale const &b, Coord eps=EPSILON) {
179 return are_near(a[X], b[X], eps) && are_near(a[Y], b[Y], eps);
227 inline bool are_near(Rotate const &a, Rotate const &b, Coord eps=EPSILON) {
228 return are_near(a[X], b[X], eps) && are_near(a[Y], b[Y], eps);
265 inline bool are_near(HShear const &a, HShear const &b, Coord eps
[all...]
H A Dlinear.h73 bool isZero(Coord eps=EPSILON) const { return are_near(a[0], 0., eps) && are_near(a[1], 0., eps); }
74 bool isConstant(Coord eps=EPSILON) const { return are_near(a[0], a[1], eps); }
H A Dray.h132 bool are_near(Point const& _point, Ray const& _ray, double eps = EPSILON) {
133 return are_near(distance(_point, _ray), 0, eps);
137 bool are_same(Ray const& r1, Ray const& r2, double eps = EPSILON) {
138 return are_near(r1.vector(), r2.vector(), eps)
139 && are_near(r1.origin(), r2.origin(), eps);
H A Dline.h419 bool are_near(Point const &p, Line const &line, double eps = EPSILON)
421 return are_near(distance(p, line), 0, eps);
425 bool are_parallel(Line const &l1, Line const &l2, double eps = EPSILON)
427 return are_near(cross(l1.vector(), l2.vector()), 0, eps);
438 bool are_same(Line const &l1, Line const &l2, double eps = EPSILON)
440 return are_parallel(l1, l2, eps) && are_near(l1.origin(), l2, eps);
446 bool are_orthogonal(Line const &l1, Line const &l2, double eps = EPSILON)
448 return are_near(dot(l1.vector(), l2.vector()), 0, eps);
471 bool are_near(Point const &p, LineSegment const &seg, double eps
[all...]
H A Dpoint.h216 bool isNormalized(Coord eps=EPSILON) const {
217 return are_near(length(), 1.0, eps);
388 inline bool are_near(Point const &a, Point const &b, double eps = EPSILON) {
391 return are_near((a - b).length(), 0, eps);
397 double eps = EPSILON)
399 return are_near( cross(p3, p2) - cross(p3, p1) + cross(p2, p1), 0, eps);
406 bool is_unit_vector(Point const &p, Coord eps = EPSILON);
H A Dcurve.cpp99 std::vector<CurveIntersection> Curve::intersect(Curve const &/*other*/, Coord /*eps*/) const
105 std::vector<CurveIntersection> Curve::intersectSelf(Coord eps) const
137 std::vector<CurveIntersection> xs = parts[i].intersect(parts[j], eps);
H A Dpoint.cpp150 bool is_unit_vector(Point const &p, Coord eps) { argument
151 return are_near(L2(p), 1.0, eps);
H A Dbezier-curve.cpp153 BezierCurve::intersect(Curve const &other, Coord eps) const
169 find_intersections(xs, inner, bez->inner, eps);
178 result = other.intersect(*this, eps);
298 std::vector<CurveIntersection> BezierCurveN<1>::intersect(Curve const &other, Coord eps) const
312 result = other.intersect(*this, eps);
H A Dbezier.h237 bool isZero(double eps=EPSILON) const {
239 if( ! are_near(c_[i], 0., eps) ) return false;
243 bool isConstant(double eps=EPSILON) const {
245 if( ! are_near(c_[i], c_[0], eps) ) return false;
H A Dcurve.h296 virtual std::vector<CurveIntersection> intersect(Curve const &other, Coord eps = EPSILON) const;
299 virtual std::vector<CurveIntersection> intersectSelf(Coord eps = EPSILON) const;
H A Drect.h112 * @param eps Maximum value of the area to consider empty
114 bool hasZeroArea(Coord eps = EPSILON) const { return (area() <= eps); }
H A Dsbasis.h194 inline bool isZero(double eps=EPSILON) const {
197 if(!(*this)[i].isZero(eps)) return false;
201 inline bool isConstant(double eps=EPSILON) const {
203 if(!(*this)[0].isConstant(eps)) return false;
205 if(!(*this)[i].isZero(eps)) return false;
H A Dbezier-curve.h162 virtual std::vector<CurveIntersection> intersect(Curve const &other, Coord eps = EPSILON) const;
278 virtual std::vector<CurveIntersection> intersect(Curve const &other, Coord eps = EPSILON) const {
280 return BezierCurve::intersect(other, eps);
H A Dcircle.cpp307 bool are_near(Circle const &a, Circle const &b, Coord eps)
309 // to check whether no point on a is further than eps from b,
311 // 1. if radii differ by more than eps, there is definitely a point that fails
315 if (!are_near(a.radius(), b.radius(), eps)) return false;
316 Coord adjusted_eps = eps - fabs(a.radius() - b.radius());
H A Dcircle.h140 bool are_near(Circle const &a, Circle const &b, Coord eps=EPSILON);
H A Dd2.h109 bool isZero(double eps=EPSILON) const {
111 return f[X].isZero(eps) && f[Y].isZero(eps);
113 bool isConstant(double eps=EPSILON) const {
115 return f[X].isConstant(eps) && f[Y].isConstant(eps);
/inkscape/src/2geom/numeric/
H A Dsymmetric-matrix-fs-trace.h233 double eps = std::ldexp (1, -50); local
234 if (std::fabs(d) < eps) return 0;
253 double eps = std::ldexp (1, -50); local
275 if (r < eps) return 0;
288 double eps = std::ldexp (1, -48); local
309 if (r < eps) return 0;
/inkscape/src/util/
H A Dunits.h125 inline bool are_near(Quantity const &a, Quantity const &b, double eps=Geom::EPSILON) argument
127 return Geom::are_near(a.quantity, b.value(a.unit), eps);
/inkscape/src/live_effects/
H A Dlpe-powerstroke-interpolators.h256 double eps = Geom::EPSILON; local
257 if (dt1 < eps)
259 if (dt0 < eps)
261 if (dt2 < eps)
/inkscape/share/extensions/
H A Dinkex.py108 def are_near_relative(a, b, eps):
109 return (a-b <= a*eps) and (a-b >= -a*eps)
374 eps = 0.01 # allow 1% error in factor
376 if are_near_relative(self.__uuconv[key], svgunitfactor, eps):
/inkscape/src/extension/internal/
H A Dcairo-ps-out.cpp69 bool filtertobitmap, int resolution, const gchar * const exportId, bool exportDrawing, bool exportCanvas, float bleedmargin_px, bool eps = false)
98 ctx->setEPS(eps);
389 "<extension>.eps</extension>\n"
391 "<filetypename>" N_("Encapsulated PostScript (*.eps)") "</filetypename>\n"
/inkscape/src/svg/
H A Dsvg-path-geom-test.h407 bool bpathEqual(Geom::PathVector const &a, Geom::PathVector const &b, double eps = 1e-16) {
443 if (!Geom::are_near((*la)[0],(*lb)[0], eps)) {
449 if (!Geom::are_near((*la)[1],(*lb)[1], eps)) {
459 if (!Geom::are_near((*la)[0],(*lb)[0], eps)) {
465 if (!Geom::are_near((*la)[1],(*lb)[1], eps)) {
471 if (!Geom::are_near((*la)[2],(*lb)[2], eps)) {
477 if (!Geom::are_near((*la)[3],(*lb)[3], eps)) {

Completed in 37 milliseconds

12