/external/eigen/unsupported/test/ |
D | matrix_power.cpp | 13 void test2dRotation(const T& tol) in test2dRotation() argument 29 VERIFY(C.isApprox(B, tol)); in test2dRotation() 34 void test2dHyperbolicRotation(const T& tol) in test2dHyperbolicRotation() argument 51 VERIFY(C.isApprox(B, tol)); in test2dHyperbolicRotation() 56 void test3dRotation(const T& tol) in test3dRotation() argument 65 VERIFY(AngleAxis<T>(angle, v).matrix().isApprox(AngleAxis<T>(1,v).matrix().pow(angle), tol)); in test3dRotation() 70 void testGeneral(const MatrixType& m, const typename MatrixType::RealScalar& tol) in testGeneral() argument 87 VERIFY(m4.isApprox(m5, tol)); in testGeneral() 91 VERIFY(m4.isApprox(m5, tol)); in testGeneral() 95 VERIFY(m4.isApprox(m5, tol)); in testGeneral() [all …]
|
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 …]
|
/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/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 | 21 static bool nearly_equal(float a, float b, float tol = kTolerance) { in nearly_equal() argument 22 SkASSERT(tol >= 0); in nearly_equal() 23 return fabsf(a - b) <= tol; in nearly_equal()
|
/external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
D | LevenbergMarquardt.h | 135 const Scalar tol = std::sqrt(NumTraits<Scalar>::epsilon()) 141 const Scalar tol = std::sqrt(NumTraits<Scalar>::epsilon()) 346 const Scalar tol in lmder1() argument 353 if (n <= 0 || m < n || tol < 0.) in lmder1() 357 m_ftol = tol; in lmder1() 358 m_xtol = tol; in lmder1() 371 const Scalar tol in lmdif1() argument 378 if (n <= 0 || m < n || tol < 0.) in lmdif1() 384 lm.setFtol(tol); in lmdif1() 385 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/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() 49 } else if (d <= tol) { in quadraticPointCount() 56 SkScalar divSqrt = SkScalarSqrt(d / tol); in quadraticPointCount() 99 SkScalar tol) { in cubicPointCount() argument 100 if (tol < gMinCurveTol) { in cubicPointCount() 101 tol = gMinCurveTol; in cubicPointCount() 103 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/skia/src/gpu/ops/ |
D | GrTessellatingPathRenderer.cpp | 51 bool cache_match(GrBuffer* vertexBuffer, SkScalar tol, int* actualCount) { in cache_match() argument 58 if (info->fTolerance == 0 || info->fTolerance < 3.0f * tol) { in cache_match() 223 SkScalar tol = GrPathUtils::kDefaultTolerance; in draw() local 224 tol = GrPathUtils::scaleToleranceToSrc(tol, fViewMatrix, fShape.bounds()); in draw() 225 if (cache_match(cachedVertexBuffer.get(), tol, &actualCount)) { in draw() 240 int count = GrTessellator::PathToTriangles(getPath(), tol, clipBounds, &allocator, in draw() 247 info.fTolerance = isLinear ? 0 : tol; in draw() 261 SkScalar tol = GrPathUtils::kDefaultTolerance; in drawAA() local 264 int count = GrTessellator::PathToTriangles(path, tol, clipBounds, &allocator, in drawAA()
|
/external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
D | LevenbergMarquardt.h | 81 const Scalar tol = sqrt_epsilon() 92 const Scalar tol = sqrt_epsilon() 97 const Scalar tol = sqrt_epsilon() 137 const Scalar tol in lmder1() argument 144 if (n <= 0 || m < n || tol < 0.) in lmder1() 148 parameters.ftol = tol; in lmder1() 149 parameters.xtol = tol; in lmder1() 365 const Scalar tol in lmstr1() argument 372 if (n <= 0 || m < n || tol < 0.) in lmstr1() 376 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/samplecode/ |
D | SamplePath.cpp | 319 const SkScalar tol = 4; in onFindClickHandler() local 320 const SkRect r = SkRect::MakeXYWH(x - tol, y - tol, tol * 2, tol * 2); in onFindClickHandler() 456 const SkScalar tol = 4; in onFindClickHandler() local 457 const SkRect r = SkRect::MakeXYWH(x - tol, y - tol, tol * 2, tol * 2); in onFindClickHandler()
|
/external/eigen/test/ |
D | eigensolver_complex.cpp | 16 template<typename MatrixType> bool find_pivot(typename MatrixType::Scalar tol, MatrixType &diffs, I… in find_pivot() argument 18 bool match = diffs.diagonal().sum() <= tol; in find_pivot() 30 if(diffs.col(col).segment(col,n-i).minCoeff(&best_index) > tol) in find_pivot() 36 if(find_pivot(tol,diffs,col+1)) return true; in find_pivot() 65 …RealScalar tol = test_precision<RealScalar>()*test_precision<RealScalar>()*numext::maxi(vec1.squar… in verify_is_approx_upto_permutation() local 68 VERIFY( find_pivot(tol, diffs) ); in verify_is_approx_upto_permutation()
|
/external/skia/src/core/ |
D | SkCubicClipper.cpp | 36 const SkScalar tol = SK_Scalar1 / 16384; // This leaves 2 fixed noise bits. in ChopMonoAtY() local 52 converged = SkScalarAbs(t1 - t0) <= tol; // NaN-safe in ChopMonoAtY() 82 const SkScalar tol = SK_Scalar1 / 65536; // 1 for fixed, 1e-5 for float. in ChopMonoAtY() local 99 } 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/eigen/Eigen/src/Householder/ |
D | Householder.h | 78 const RealScalar tol = (std::numeric_limits<RealScalar>::min)(); in makeHouseholder() local 80 if(tailSqNorm <= tol && numext::abs2(numext::imag(c0))<=tol) in makeHouseholder()
|
/external/eigen/Eigen/src/IterativeLinearSolvers/ |
D | LeastSquareConjugateGradient.h | 38 RealScalar tol = tol_error; in least_square_conjugate_gradient() local 54 RealScalar threshold = tol*tol*rhsNorm2; in least_square_conjugate_gradient()
|
D | BiCGSTAB.h | 38 RealScalar tol = tol_error; in bicgstab() local 62 RealScalar tol2 = tol*tol*rhs_sqnorm; in bicgstab()
|
D | ConjugateGradient.h | 38 RealScalar tol = tol_error; in conjugate_gradient() local 53 RealScalar threshold = tol*tol*rhsNorm2; in conjugate_gradient()
|
/external/icu/icu4c/source/data/curr/ |
D | yav.txt | 11 "toláal wu ostalalí", 27 "toláal u kanáta",
|