| /external/skia/tests/ |
| D | ClipCubicTest.cpp | 45 float tol) { in CurvesAreEqual() argument
47 if (SkScalarAbs(c0[i].fX - c1[i].fX) > tol || in CurvesAreEqual()
48 SkScalarAbs(c0[i].fY - c1[i].fY) > tol in CurvesAreEqual()
84 const float tol = 1e-4f; in DEF_TEST() local
92 0, 0, 2, 3, 1, 10, 4, 12, shouldbe), tol)); in DEF_TEST()
100 0, 0, 2, 3, 1, 10, 4, 12, shouldbe), tol)); in DEF_TEST()
108 0, 0, 2, 3, 1, 10, 4, 12, shouldbe), tol)); in DEF_TEST()
126 shouldbe), tol)); in DEF_TEST()
138 shouldbe), tol)); in DEF_TEST()
150 shouldbe), tol)); in DEF_TEST()
[all …]
|
| D | PathCoverageTest.cpp | 60 static inline uint32_t compute_pointCount(SkScalar d, SkScalar tol) { in compute_pointCount() argument
61 if (d < tol) { in compute_pointCount()
64 int temp = SkScalarCeilToInt(SkScalarSqrt(SkScalarDiv(d, tol))); in compute_pointCount()
75 static uint32_t quadraticPointCount_EC(const SkPoint points[], SkScalar tol) { in quadraticPointCount_EC() argument
77 return compute_pointCount(SkIntToScalar(distance), tol); in quadraticPointCount_EC()
85 static uint32_t quadraticPointCount_CC(const SkPoint points[], SkScalar tol) { in quadraticPointCount_CC() argument
87 return compute_pointCount(distance, tol); in quadraticPointCount_CC()
|
| D | BlurTest.cpp | 312 static bool match(int* first, int* second, int count, int tol) { in match() argument
316 if (delta > tol || delta < -tol) { in match()
|
| /external/eigen/unsupported/test/ |
| D | matrix_exponential.cpp | 34 void test2dRotation(double tol) in test2dRotation() argument
47 VERIFY(C.isApprox(B, static_cast<T>(tol))); in test2dRotation()
51 VERIFY(C.isApprox(B, static_cast<T>(tol))); in test2dRotation()
56 void test2dHyperbolicRotation(double tol) in test2dHyperbolicRotation() argument
72 VERIFY(C.isApprox(B, static_cast<T>(tol))); in test2dHyperbolicRotation()
76 VERIFY(C.isApprox(B, static_cast<T>(tol))); in test2dHyperbolicRotation()
81 void testPascal(double tol) in testPascal() argument
96 VERIFY(C.isApprox(B, static_cast<T>(tol))); in testPascal()
100 VERIFY(C.isApprox(B, static_cast<T>(tol))); in testPascal()
105 void randomTest(const MatrixType& m, double tol) in randomTest() argument
[all …]
|
| /external/chromium_org/third_party/skia/include/core/ |
| D | SkGeometry.h | 237 bool asQuadTol(SkScalar tol) const;
243 int computeQuadPOW2(SkScalar tol) const;
281 const SkPoint* computeQuads(const SkConic& conic, SkScalar tol) { in computeQuads() argument
282 int pow2 = conic.computeQuadPOW2(tol); in computeQuads()
290 SkScalar tol) { in computeQuads() argument
293 return computeQuads(conic, tol); in computeQuads()
|
| D | SkPoint.h | 368 bool equalsWithinTolerance(const SkPoint& p, SkScalar tol) const { in equalsWithinTolerance()
369 return SkScalarNearlyZero(fX - p.fX, tol) in equalsWithinTolerance()
370 && SkScalarNearlyZero(fY - p.fY, tol); in equalsWithinTolerance()
|
| /external/skia/include/core/ |
| D | SkGeometry.h | 237 bool asQuadTol(SkScalar tol) const;
243 int computeQuadPOW2(SkScalar tol) const;
281 const SkPoint* computeQuads(const SkConic& conic, SkScalar tol) { in computeQuads() argument
282 int pow2 = conic.computeQuadPOW2(tol); in computeQuads()
290 SkScalar tol) { in computeQuads() argument
293 return computeQuads(conic, tol); in computeQuads()
|
| /external/eigen/bench/spbench/ |
| D | spbenchsolver.cpp | 63 double tol = 1e-08; in main() local
66 tol = atof(inval.c_str()); in main()
73 Browse_Matrices<double>(current_dir, statFileExists, statFile,maxiters, tol); in main()
77 Browse_Matrices<std::complex<double> >(current_dir, statFileExists, statFile, maxiters, tol); in main()
|
| /external/ceres-solver/internal/ceres/ |
| D | test_util.cc | 72 double tol) { in ExpectArraysCloseUptoScale() argument
103 EXPECT_NEAR(p_norm, q_norm, tol) << "i=" << i; in ExpectArraysCloseUptoScale()
110 double tol) { in ExpectArraysClose() argument
116 EXPECT_NEAR(p[i], q[i], tol) << "i=" << i; in ExpectArraysClose()
|
| D | autodiff_test.cc | 161 double const tol = 1e-10; // floating-point tolerance. in TEST() local
201 ASSERT_NEAR(ad_x1[i], b_x[i], tol); in TEST()
216 ASSERT_NEAR(ad_x2[i], b_x[i], tol); in TEST()
226 ASSERT_NEAR(J_PX[(12 + 4) * i + j], J_P[12 * i + j], tol); in TEST()
229 ASSERT_NEAR(J_PX[(12 + 4) * i + 12 + j], J_X[4 * i + j], tol); in TEST()
282 double const tol = 1e-10; // floating-point tolerance. in TEST() local
309 ASSERT_NEAR(fd_x[i], b_x[i], tol); in TEST()
323 ASSERT_NEAR(ad_x[i], b_x[i], tol); in TEST()
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| D | LevenbergMarquardt.h | 75 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 in lmder1() argument
137 if (n <= 0 || m < n || tol < 0.) in lmder1()
141 parameters.ftol = tol; in lmder1()
142 parameters.xtol = tol; in lmder1()
355 const Scalar tol in lmstr1() argument
362 if (n <= 0 || m < n || tol < 0.) in lmstr1()
366 parameters.ftol = tol; in lmstr1()
[all …]
|
| D | HybridNonLinearSolver.h | 73 const Scalar tol = internal::sqrt(NumTraits<Scalar>::epsilon())
82 const Scalar tol = internal::sqrt(NumTraits<Scalar>::epsilon())
124 const Scalar tol in hybrj1() argument
130 if (n <= 0 || tol < 0.) in hybrj1()
135 parameters.xtol = tol; in hybrj1()
358 const Scalar tol in hybrd1() argument
364 if (n <= 0 || tol < 0.) in hybrd1()
369 parameters.xtol = tol; in hybrd1()
|
| D | covar.h | 9 Scalar tol = sqrt(NumTraits<Scalar>::epsilon()) )
20 const Scalar tolr = tol * abs(r(0,0));
|
| /external/chromium_org/third_party/skia/src/gpu/ |
| D | GrPathUtils.cpp | 40 SkScalar tol) { in quadraticPointCount() argument
41 if (tol < gMinCurveTol) { in quadraticPointCount()
42 tol = gMinCurveTol; in quadraticPointCount()
44 SkASSERT(tol > 0); in quadraticPointCount()
47 if (d <= tol) { in quadraticPointCount()
54 int temp = SkScalarCeil(SkScalarSqrt(SkScalarDiv(d, tol))); in quadraticPointCount()
92 SkScalar tol) { in cubicPointCount() argument
93 if (tol < gMinCurveTol) { in cubicPointCount()
94 tol = gMinCurveTol; in cubicPointCount()
96 SkASSERT(tol > 0); in cubicPointCount()
[all …]
|
| D | GrPathUtils.h | 30 SkScalar tol);
34 uint32_t quadraticPointCount(const GrPoint points[], SkScalar tol);
45 uint32_t cubicPointCount(const GrPoint points[], SkScalar tol);
|
| D | GrDefaultPathRenderer.cpp | 348 SkScalar tol = SK_Scalar1; in internalDrawPath() local
349 tol = GrPathUtils::scaleToleranceToSrc(tol, viewM, path.getBounds()); in internalDrawPath()
357 tol, in internalDrawPath()
|
| /external/skia/src/gpu/ |
| D | GrPathUtils.cpp | 40 SkScalar tol) { in quadraticPointCount() argument
41 if (tol < gMinCurveTol) { in quadraticPointCount()
42 tol = gMinCurveTol; in quadraticPointCount()
44 SkASSERT(tol > 0); in quadraticPointCount()
47 if (d <= tol) { in quadraticPointCount()
54 int temp = SkScalarCeil(SkScalarSqrt(SkScalarDiv(d, tol))); in quadraticPointCount()
92 SkScalar tol) { in cubicPointCount() argument
93 if (tol < gMinCurveTol) { in cubicPointCount()
94 tol = gMinCurveTol; in cubicPointCount()
96 SkASSERT(tol > 0); in cubicPointCount()
[all …]
|
| D | GrPathUtils.h | 30 SkScalar tol);
34 uint32_t quadraticPointCount(const GrPoint points[], SkScalar tol);
45 uint32_t cubicPointCount(const GrPoint points[], SkScalar tol);
|
| D | GrDefaultPathRenderer.cpp | 348 SkScalar tol = SK_Scalar1; in internalDrawPath() local
349 tol = GrPathUtils::scaleToleranceToSrc(tol, viewM, path.getBounds()); in internalDrawPath()
357 tol, in internalDrawPath()
|
| /external/skia/src/core/ |
| D | SkCubicClipper.cpp | 41 const SkScalar tol = SK_Scalar1 / 16384; // This leaves 2 fixed noise bits. in chopMonoCubicAtY() local
61 converged = SkScalarAbs(t1 - t0) <= tol; // NaN-safe in chopMonoCubicAtY()
91 const SkScalar tol = SK_Scalar1 / 65536; // 1 for fixed, 1e-5 for float. in chopMonoCubicAtY() local
108 } while (!(SkScalarAbs(tPos - tNeg) <= tol)); // Nan-safe in chopMonoCubicAtY()
|
| /external/chromium_org/third_party/skia/src/core/ |
| D | SkCubicClipper.cpp | 41 const SkScalar tol = SK_Scalar1 / 16384; // This leaves 2 fixed noise bits. in chopMonoCubicAtY() local
61 converged = SkScalarAbs(t1 - t0) <= tol; // NaN-safe in chopMonoCubicAtY()
91 const SkScalar tol = SK_Scalar1 / 65536; // 1 for fixed, 1e-5 for float. in chopMonoCubicAtY() local
108 } while (!(SkScalarAbs(tPos - tNeg) <= tol)); // Nan-safe in chopMonoCubicAtY()
|
| /external/icu4c/data/curr/ |
| D | yav.txt | 20 "toláal wu ostalalí",
36 "toláal u kanáta",
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| D | ConjugateGradient.h | 38 RealScalar tol = tol_error; in conjugate_gradient() local
52 RealScalar threshold = tol*tol*rhsNorm2; in conjugate_gradient()
|
| D | BiCGSTAB.h | 38 RealScalar tol = tol_error; in bicgstab() local
56 RealScalar tol2 = tol*tol; in bicgstab()
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| D | Scaling.h | 162 void setTolerance(double tol) in setTolerance() argument
164 m_tol = tol; in setTolerance()
|