Searched refs:tol (Results 1 - 25 of 38) sorted by relevance

12

/external/eigen/bench/spbench/
H A Dspbenchsolver.cpp63 double tol = 1e-08; local
66 tol = atof(inval.c_str());
73 Browse_Matrices<double>(current_dir, statFileExists, statFile,maxiters, tol);
77 Browse_Matrices<std::complex<double> >(current_dir, statFileExists, statFile, maxiters, tol);
/external/ceres-solver/internal/ceres/
H A Dtest_util.cc72 double tol) {
103 EXPECT_NEAR(p_norm, q_norm, tol) << "i=" << i;
110 double tol) {
116 EXPECT_NEAR(p[i], q[i], tol) << "i=" << i;
69 ExpectArraysCloseUptoScale(int n, const double* p, const double* q, double tol) argument
107 ExpectArraysClose(int n, const double* p, const double* q, double tol) argument
H A Dautodiff_test.cc161 double const tol = 1e-10; // floating-point tolerance. local
201 ASSERT_NEAR(ad_x1[i], b_x[i], tol);
216 ASSERT_NEAR(ad_x2[i], b_x[i], tol);
226 ASSERT_NEAR(J_PX[(12 + 4) * i + j], J_P[12 * i + j], tol);
229 ASSERT_NEAR(J_PX[(12 + 4) * i + 12 + j], J_X[4 * i + j], tol);
282 double const tol = 1e-10; // floating-point tolerance. local
309 ASSERT_NEAR(fd_x[i], b_x[i], tol);
323 ASSERT_NEAR(ad_x[i], b_x[i], tol);
/external/eigen/unsupported/test/
H A Dmatrix_exponential.cpp34 void test2dRotation(double tol) argument
47 VERIFY(C.isApprox(B, static_cast<T>(tol)));
51 VERIFY(C.isApprox(B, static_cast<T>(tol)));
56 void test2dHyperbolicRotation(double tol) argument
72 VERIFY(C.isApprox(B, static_cast<T>(tol)));
76 VERIFY(C.isApprox(B, static_cast<T>(tol)));
81 void testPascal(double tol) argument
96 VERIFY(C.isApprox(B, static_cast<T>(tol)));
100 VERIFY(C.isApprox(B, static_cast<T>(tol)));
105 void randomTest(const MatrixType& m, double tol) argument
[all...]
/external/skia/tests/
H A DClipCubicTest.cpp45 float tol) {
47 if (SkScalarAbs(c0[i].fX - c1[i].fX) > SkFloatToScalar(tol) ||
48 SkScalarAbs(c0[i].fY - c1[i].fY) > SkFloatToScalar(tol)
84 const float tol = SkFloatToScalar(1e-4f); local
92 0, 0, 2, 3, 1, 10, 4, 12, shouldbe), tol));
100 0, 0, 2, 3, 1, 10, 4, 12, shouldbe), tol));
108 0, 0, 2, 3, 1, 10, 4, 12, shouldbe), tol));
126 shouldbe), tol));
138 shouldbe), tol));
150 shouldbe), tol));
43 CurvesAreEqual(const SkPoint c0[4], const SkPoint c1[4], float tol) argument
[all...]
H A DPathCoverageTest.cpp59 static inline uint32_t compute_pointCount(SkScalar d, SkScalar tol) { argument
60 if (d < tol) {
63 int temp = SkScalarCeilToInt(SkScalarSqrt(SkScalarDiv(d, tol)));
74 static uint32_t quadraticPointCount_EC(const SkPoint points[], SkScalar tol) { argument
76 return compute_pointCount(SkIntToScalar(distance), tol);
84 static uint32_t quadraticPointCount_CC(const SkPoint points[], SkScalar tol) { argument
86 return compute_pointCount(distance, tol);
/external/chromium_org/third_party/skia/include/core/
H A DSkGeometry.h237 bool asQuadTol(SkScalar tol) const;
243 int computeQuadPOW2(SkScalar tol) const;
281 const SkPoint* computeQuads(const SkConic& conic, SkScalar tol) { argument
282 int pow2 = conic.computeQuadPOW2(tol);
290 SkScalar tol) {
293 return computeQuads(conic, tol);
289 computeQuads(const SkPoint pts[3], SkScalar weight, SkScalar tol) argument
H A DSkPoint.h367 within tolerance "tol".
373 bool equalsWithinTolerance(const SkPoint& p, SkScalar tol) const {
374 return SkScalarNearlyZero(fX - p.fX, tol)
375 && SkScalarNearlyZero(fY - p.fY, tol);
/external/skia/include/core/
H A DSkGeometry.h237 bool asQuadTol(SkScalar tol) const;
243 int computeQuadPOW2(SkScalar tol) const;
281 const SkPoint* computeQuads(const SkConic& conic, SkScalar tol) { argument
282 int pow2 = conic.computeQuadPOW2(tol);
290 SkScalar tol) {
293 return computeQuads(conic, tol);
289 computeQuads(const SkPoint pts[3], SkScalar weight, SkScalar tol) argument
H A DSkPoint.h367 within tolerance "tol".
373 bool equalsWithinTolerance(const SkPoint& p, SkScalar tol) const {
374 return SkScalarNearlyZero(fX - p.fX, tol)
375 && SkScalarNearlyZero(fY - p.fY, tol);
/external/chromium_org/third_party/skia/src/gpu/
H A DGrPathUtils.h26 /// Since we divide by tol if we're computing exact worst-case bounds,
30 SkScalar tol);
32 /// Since we divide by tol if we're computing exact worst-case bounds,
34 uint32_t quadraticPointCount(const GrPoint points[], SkScalar tol);
43 /// Since we divide by tol if we're computing exact worst-case bounds,
45 uint32_t cubicPointCount(const GrPoint points[], SkScalar tol);
H A DGrPathUtils.cpp40 SkScalar tol) {
41 if (tol < gMinCurveTol) {
42 tol = gMinCurveTol;
44 GrAssert(tol > 0);
47 if (d <= tol) {
51 // subdivide x = log4(d/tol) times. x subdivisions creates 2^(x)
54 int temp = SkScalarCeil(SkScalarSqrt(SkScalarDiv(d, tol)));
92 SkScalar tol) {
93 if (tol < gMinCurveTol) {
94 tol
39 quadraticPointCount(const GrPoint points[], SkScalar tol) argument
91 cubicPointCount(const GrPoint points[], SkScalar tol) argument
147 worstCasePointCount(const SkPath& path, int* subpaths, SkScalar tol) argument
[all...]
H A DGrDefaultPathRenderer.cpp333 SkScalar tol = SK_Scalar1; local
334 tol = GrPathUtils::scaleToleranceToSrc(tol, viewM, path.getBounds());
342 tol,
/external/skia/src/gpu/
H A DGrPathUtils.h26 /// Since we divide by tol if we're computing exact worst-case bounds,
30 SkScalar tol);
32 /// Since we divide by tol if we're computing exact worst-case bounds,
34 uint32_t quadraticPointCount(const GrPoint points[], SkScalar tol);
43 /// Since we divide by tol if we're computing exact worst-case bounds,
45 uint32_t cubicPointCount(const GrPoint points[], SkScalar tol);
H A DGrPathUtils.cpp40 SkScalar tol) {
41 if (tol < gMinCurveTol) {
42 tol = gMinCurveTol;
44 GrAssert(tol > 0);
47 if (d <= tol) {
51 // subdivide x = log4(d/tol) times. x subdivisions creates 2^(x)
54 int temp = SkScalarCeil(SkScalarSqrt(SkScalarDiv(d, tol)));
92 SkScalar tol) {
93 if (tol < gMinCurveTol) {
94 tol
39 quadraticPointCount(const GrPoint points[], SkScalar tol) argument
91 cubicPointCount(const GrPoint points[], SkScalar tol) argument
147 worstCasePointCount(const SkPath& path, int* subpaths, SkScalar tol) argument
[all...]
H A DGrDefaultPathRenderer.cpp333 SkScalar tol = SK_Scalar1; local
334 tol = GrPathUtils::scaleToleranceToSrc(tol, viewM, path.getBounds());
342 tol,
/external/chromium_org/third_party/skia/src/core/
H A DSkCubicClipper.cpp41 const SkScalar tol = SK_Scalar1 / 16384; // This leaves 2 fixed noise bits. local
61 converged = SkScalarAbs(t1 - t0) <= tol; // NaN-safe
91 const SkScalar tol = SK_Scalar1 / 65536; // 1 for fixed, 1e-5 for float.
108 } while (!(SkScalarAbs(tPos - tNeg) <= tol)); // Nan-safe
/external/skia/src/core/
H A DSkCubicClipper.cpp41 const SkScalar tol = SK_Scalar1 / 16384; // This leaves 2 fixed noise bits. local
61 converged = SkScalarAbs(t1 - t0) <= tol; // NaN-safe
91 const SkScalar tol = SK_Scalar1 / 65536; // 1 for fixed, 1e-5 for float.
108 } while (!(SkScalarAbs(tPos - tNeg) <= tol)); // Nan-safe
/external/eigen/unsupported/Eigen/src/NonLinearOptimization/
H A Dcovar.h9 Scalar tol = sqrt(NumTraits<Scalar>::epsilon()) )
20 const Scalar tolr = tol * abs(r(0,0));
H A DLevenbergMarquardt.h75 const Scalar tol = internal::sqrt(NumTraits<Scalar>::epsilon())
86 const Scalar tol = internal::sqrt(NumTraits<Scalar>::epsilon())
91 const Scalar tol = internal::sqrt(NumTraits<Scalar>::epsilon())
130 const Scalar tol
137 if (n <= 0 || m < n || tol < 0.)
141 parameters.ftol = tol;
142 parameters.xtol = tol;
355 const Scalar tol
362 if (n <= 0 || m < n || tol < 0.)
366 parameters.ftol = tol;
[all...]
H A DHybridNonLinearSolver.h73 const Scalar tol = internal::sqrt(NumTraits<Scalar>::epsilon())
82 const Scalar tol = internal::sqrt(NumTraits<Scalar>::epsilon())
124 const Scalar tol
130 if (n <= 0 || tol < 0.)
135 parameters.xtol = tol;
358 const Scalar tol
364 if (n <= 0 || tol < 0.)
369 parameters.xtol = tol;
/external/eigen/unsupported/Eigen/src/IterativeSolvers/
H A DScaling.h162 void setTolerance(double tol) argument
164 m_tol = tol;
H A DGMRES.h68 RealScalar tol = tol_error; local
147 bool stop=(k==m || abs(w(k)) < tol || iters == maxIters);
/external/eigen/Eigen/src/IterativeLinearSolvers/
H A DBiCGSTAB.h38 RealScalar tol = tol_error; local
56 RealScalar tol2 = tol*tol;
H A DConjugateGradient.h38 RealScalar tol = tol_error; local
52 RealScalar threshold = tol*tol*rhsNorm2;

Completed in 568 milliseconds

12