| /external/skia/tests/ |
| D | ClipCubicTest.cpp | 44 float tol) { in CurvesAreEqual() argument
46 if (SkScalarAbs(c0[i].fX - c1[i].fX) > tol || in CurvesAreEqual()
47 SkScalarAbs(c0[i].fY - c1[i].fY) > tol in CurvesAreEqual()
83 const float tol = 1e-4f; in DEF_TEST() local
91 0, 0, 2, 3, 1, 10, 4, 12, shouldbe), tol)); in DEF_TEST()
99 0, 0, 2, 3, 1, 10, 4, 12, shouldbe), tol)); in DEF_TEST()
107 0, 0, 2, 3, 1, 10, 4, 12, shouldbe), tol)); in DEF_TEST()
125 shouldbe), tol)); in DEF_TEST()
137 shouldbe), tol)); in DEF_TEST()
149 shouldbe), tol)); in DEF_TEST()
[all …]
|
| D | PathCoverageTest.cpp | 59 static inline uint32_t compute_pointCount(SkScalar d, SkScalar tol) { in compute_pointCount() argument
60 if (d < tol) { in compute_pointCount()
63 int temp = SkScalarCeilToInt(SkScalarSqrt(d / tol)); in compute_pointCount()
74 static uint32_t quadraticPointCount_EC(const SkPoint points[], SkScalar tol) { in quadraticPointCount_EC() argument
76 return compute_pointCount(SkIntToScalar(distance), tol); in quadraticPointCount_EC()
84 static uint32_t quadraticPointCount_CC(const SkPoint points[], SkScalar tol) { in quadraticPointCount_CC() argument
86 return compute_pointCount(distance, tol); in quadraticPointCount_CC()
|
| D | SkColor4fTest.cpp | 20 static bool nearly_equal(float a, float b, float tol = kTolerance) { in nearly_equal() argument
21 SkASSERT(tol >= 0); in nearly_equal()
22 return fabsf(a - b) <= tol; in nearly_equal()
25 static bool nearly_equal(const SkPM4f a, const SkPM4f& b, float tol = kTolerance) { in nearly_equal() argument
27 if (!nearly_equal(a.fVec[i], b.fVec[i], tol)) { in nearly_equal()
|
| /external/opencv3/3rdparty/openexr/Imath/ |
| D | ImathMatrixAlgo.cpp | 322 const T tol) in twoSidedJacobiRotation() argument
343 if (std::abs(mu_2) <= tol*std::abs(mu_1)) // Already symmetric (to tolerance) in twoSidedJacobiRotation()
371 if (std::abs(mu_2) <= tol*std::abs(mu_1)) in twoSidedJacobiRotation()
463 const T tol) in twoSidedJacobiRotation() argument
484 if (std::abs(mu_2) <= tol*std::abs(mu_1)) // Already symmetric (to tolerance) in twoSidedJacobiRotation()
512 if (std::abs(mu_2) <= tol*std::abs(mu_1)) in twoSidedJacobiRotation()
663 const T tol, in twoSidedJacobiSVD() argument
699 const T absTol = tol * maxOffDiag (A); // Tolerance is in terms of the maximum in twoSidedJacobiSVD()
706 bool changed = twoSidedJacobiRotation<T, 0, 1, 2> (A, U, V, tol); in twoSidedJacobiSVD()
707 changed = twoSidedJacobiRotation<T, 0, 2, 1> (A, U, V, tol) || changed; in twoSidedJacobiSVD()
[all …]
|
| /external/eigen/unsupported/test/ |
| D | matrix_exponential.cpp | 27 void test2dRotation(double tol) in test2dRotation() argument
40 VERIFY(C.isApprox(B, static_cast<T>(tol))); in test2dRotation()
44 VERIFY(C.isApprox(B, static_cast<T>(tol))); in test2dRotation()
49 void test2dHyperbolicRotation(double tol) in test2dHyperbolicRotation() argument
65 VERIFY(C.isApprox(B, static_cast<T>(tol))); in test2dHyperbolicRotation()
69 VERIFY(C.isApprox(B, static_cast<T>(tol))); in test2dHyperbolicRotation()
74 void testPascal(double tol) in testPascal() argument
89 VERIFY(C.isApprox(B, static_cast<T>(tol))); in testPascal()
93 VERIFY(C.isApprox(B, static_cast<T>(tol))); in testPascal()
98 void randomTest(const MatrixType& m, double tol) in randomTest() argument
[all …]
|
| D | matrix_power.cpp | 40 void test2dRotation(double tol) in test2dRotation() argument
56 VERIFY(C.isApprox(B, static_cast<T>(tol))); in test2dRotation()
61 void test2dHyperbolicRotation(double tol) in test2dHyperbolicRotation() argument
78 VERIFY(C.isApprox(B, static_cast<T>(tol))); in test2dHyperbolicRotation()
83 void testExponentLaws(const MatrixType& m, double tol) in testExponentLaws() argument
100 VERIFY(m4.isApprox(m5, static_cast<RealScalar>(tol))); in testExponentLaws()
104 VERIFY(m4.isApprox(m5, static_cast<RealScalar>(tol))); in testExponentLaws()
108 VERIFY(m4.isApprox(m5, static_cast<RealScalar>(tol))); in testExponentLaws()
|
| /external/eigen/unsupported/Eigen/src/Eigenvalues/ |
| D | ArpackSelfAdjointEigenSolver.h | 103 int options=ComputeEigenvectors, RealScalar tol=0.0)
111 compute(A, B, nbrEigenvalues, eigs_sigma, options, tol); in m_eivec()
138 int options=ComputeEigenvectors, RealScalar tol=0.0)
146 compute(A, nbrEigenvalues, eigs_sigma, options, tol); in m_eivec()
175 int options=ComputeEigenvectors, RealScalar tol=0.0);
201 int options=ComputeEigenvectors, RealScalar tol=0.0);
336 std::string eigs_sigma, int options, RealScalar tol) in compute() argument
339 compute(A, B, nbrEigenvalues, eigs_sigma, options, tol); in compute()
349 std::string eigs_sigma, int options, RealScalar tol) in compute() argument
509 internal::arpack_wrapper<Scalar, RealScalar>::saupd(&ido, bmat, &n, whch, &nev, &tol, resid, in compute()
[all …]
|
| /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
| D | LevenbergMarquardt.h | 136 const Scalar tol = std::sqrt(NumTraits<Scalar>::epsilon())
142 const Scalar tol = std::sqrt(NumTraits<Scalar>::epsilon())
327 const Scalar tol in lmder1() argument
334 if (n <= 0 || m < n || tol < 0.) in lmder1()
338 m_ftol = tol; in lmder1()
339 m_xtol = tol; in lmder1()
352 const Scalar tol in lmdif1() argument
359 if (n <= 0 || m < n || tol < 0.) in lmdif1()
365 lm.setFtol(tol); in lmdif1()
366 lm.setXtol(tol); in lmdif1()
|
| /external/eigen/bench/spbench/ |
| D | spbenchsolver.cpp | 62 double tol = 1e-08; in main() local
65 tol = atof(inval.c_str()); in main()
71 Browse_Matrices<double>(matrix_dir, statFileExists, statFile,maxiters, tol); in main()
74 Browse_Matrices<std::complex<double> >(matrix_dir, statFileExists, statFile, maxiters, tol); in main()
|
| /external/ceres-solver/internal/ceres/ |
| D | test_util.cc | 73 double tol) { in ExpectArraysCloseUptoScale() argument
104 EXPECT_NEAR(p_norm, q_norm, tol) << "i=" << i; in ExpectArraysCloseUptoScale()
111 double tol) { in ExpectArraysClose() argument
117 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/skia/src/gpu/ |
| D | GrPathUtils.cpp | 39 SkScalar tol) { in quadraticPointCount() argument
40 if (tol < gMinCurveTol) { in quadraticPointCount()
41 tol = gMinCurveTol; in quadraticPointCount()
43 SkASSERT(tol > 0); in quadraticPointCount()
46 if (d <= tol) { in quadraticPointCount()
53 SkScalar divSqrt = SkScalarSqrt(d / tol); in quadraticPointCount()
96 SkScalar tol) { in cubicPointCount() argument
97 if (tol < gMinCurveTol) { in cubicPointCount()
98 tol = gMinCurveTol; in cubicPointCount()
100 SkASSERT(tol > 0); in cubicPointCount()
[all …]
|
| D | GrPathUtils.h | 29 SkScalar tol);
33 uint32_t quadraticPointCount(const SkPoint points[], SkScalar tol);
44 uint32_t cubicPointCount(const SkPoint points[], SkScalar tol);
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| D | LevenbergMarquardt.h | 75 const Scalar tol = std::sqrt(NumTraits<Scalar>::epsilon())
86 const Scalar tol = std::sqrt(NumTraits<Scalar>::epsilon())
91 const Scalar tol = std::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()
358 const Scalar tol in lmstr1() argument
365 if (n <= 0 || m < n || tol < 0.) in lmstr1()
369 parameters.ftol = tol; in lmstr1()
[all …]
|
| D | HybridNonLinearSolver.h | 73 const Scalar tol = std::sqrt(NumTraits<Scalar>::epsilon())
82 const Scalar tol = std::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()
360 const Scalar tol in hybrd1() argument
366 if (n <= 0 || tol < 0.) in hybrd1()
371 parameters.xtol = tol; in hybrd1()
|
| /external/skia/src/gpu/batches/ |
| D | GrTessellatingPathRenderer.cpp | 48 bool cache_match(GrVertexBuffer* vertexBuffer, SkScalar tol, int* actualCount) { in cache_match() argument
55 if (info->fTolerance == 0 || info->fTolerance < 3.0f * tol) { in cache_match()
128 SkScalar tol = GrPathUtils::scaleToleranceToSrc(screenSpaceTol, fViewMatrix, pathBounds); in tessellate() local
131 int count = GrTessellator::PathToTriangles(path, tol, fClipBounds, resourceProvider, in tessellate()
135 info.fTolerance = isLinear ? 0 : tol; in tessellate()
165 SkScalar tol = GrPathUtils::scaleToleranceToSrc( in onPrepareDraws() local
167 if (!cache_match(vertexBuffer.get(), tol, &actualCount)) { in onPrepareDraws()
|
| /external/skia/src/core/ |
| D | SkCubicClipper.cpp | 37 const SkScalar tol = SK_Scalar1 / 16384; // This leaves 2 fixed noise bits. in ChopMonoAtY() local
53 converged = SkScalarAbs(t1 - t0) <= tol; // NaN-safe in ChopMonoAtY()
83 const SkScalar tol = SK_Scalar1 / 65536; // 1 for fixed, 1e-5 for float. in ChopMonoAtY() local
100 } while (!(SkScalarAbs(tPos - tNeg) <= tol)); // Nan-safe in ChopMonoAtY()
|
| D | SkGeometry.h | 226 bool asQuadTol(SkScalar tol) const;
232 int computeQuadPOW2(SkScalar tol) const;
383 const SkPoint* computeQuads(const SkConic& conic, SkScalar tol) { in computeQuads() argument
384 int pow2 = conic.computeQuadPOW2(tol); in computeQuads()
392 SkScalar tol) { in computeQuads() argument
395 return computeQuads(conic, tol); in computeQuads()
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/ode/nonstiff/ |
| D | DormandPrince853Integrator.java | 265 final double tol = (vecAbsoluteTolerance == null) ? in estimateError() local
268 final double ratio1 = errSum1 / tol; in estimateError()
270 final double ratio2 = errSum2 / tol; in estimateError()
|
| D | HighamHall54Integrator.java | 120 final double tol = (vecAbsoluteTolerance == null) ? in estimateError() local
123 final double ratio = h * errSum / tol; in estimateError()
|
| D | DormandPrince54Integrator.java | 146 final double tol = (vecAbsoluteTolerance == null) ? in estimateError() local
149 final double ratio = h * errSum / tol; in estimateError()
|
| /external/skia/samplecode/ |
| D | SamplePath.cpp | 333 const SkScalar tol = 4; in onFindClickHandler() local
334 const SkRect r = SkRect::MakeXYWH(x - tol, y - tol, tol * 2, tol * 2); in onFindClickHandler()
|
| /external/icu/icu4c/source/data/curr/ |
| D | yav.txt | 17 "toláal wu ostalalí",
33 "toláal u kanáta",
|
| /external/opencv3/modules/core/test/ |
| D | test_conjugate_gradient.cpp | 53 double tol = 1e-2; in mytest() local
54 ASSERT_TRUE(std::abs(res-etalon_res)<tol); in mytest()
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| D | ConjugateGradient.h | 38 RealScalar tol = tol_error; in conjugate_gradient() local
53 RealScalar threshold = tol*tol*rhsNorm2; in conjugate_gradient()
|