/external/skia/tests/ |
ClipCubicTest.cpp | 44 float tol) { 46 if (SkScalarAbs(c0[i].fX - c1[i].fX) > tol || 47 SkScalarAbs(c0[i].fY - c1[i].fY) > tol 83 const float tol = 1e-4f; local 91 0, 0, 2, 3, 1, 10, 4, 12, shouldbe), tol)); 99 0, 0, 2, 3, 1, 10, 4, 12, shouldbe), tol)); 107 0, 0, 2, 3, 1, 10, 4, 12, shouldbe), tol)); 125 shouldbe), tol)); 137 shouldbe), tol)); 149 shouldbe), tol)); [all...] |
PathCoverageTest.cpp | 59 static inline uint32_t compute_pointCount(SkScalar d, SkScalar tol) { 60 if (d < tol) { 63 int temp = SkScalarCeilToInt(SkScalarSqrt(d / tol)); 74 static uint32_t quadraticPointCount_EC(const SkPoint points[], SkScalar tol) { 76 return compute_pointCount(SkIntToScalar(distance), tol); 84 static uint32_t quadraticPointCount_CC(const SkPoint points[], SkScalar tol) { 86 return compute_pointCount(distance, tol);
|
SkColor4fTest.cpp | 20 static bool nearly_equal(float a, float b, float tol = kTolerance) { 21 SkASSERT(tol >= 0); 22 return fabsf(a - b) <= tol; 25 static bool nearly_equal(const SkPM4f a, const SkPM4f& b, float tol = kTolerance) { 27 if (!nearly_equal(a.fVec[i], b.fVec[i], tol)) {
|
/external/eigen/bench/spbench/ |
spbenchsolver.cpp | 62 double tol = 1e-08; local 65 tol = atof(inval.c_str()); 71 Browse_Matrices<double>(matrix_dir, statFileExists, statFile,maxiters, tol); 74 Browse_Matrices<std::complex<double> >(matrix_dir, statFileExists, statFile, maxiters, tol);
|
/external/ceres-solver/internal/ceres/ |
test_util.cc | 73 double tol) { 104 EXPECT_NEAR(p_norm, q_norm, tol) << "i=" << i; 111 double tol) { 117 EXPECT_NEAR(p[i], q[i], tol) << "i=" << i;
|
/external/eigen/unsupported/test/ |
matrix_exponential.cpp | 27 void test2dRotation(double tol) 40 VERIFY(C.isApprox(B, static_cast<T>(tol))); 44 VERIFY(C.isApprox(B, static_cast<T>(tol))); 49 void test2dHyperbolicRotation(double tol) 65 VERIFY(C.isApprox(B, static_cast<T>(tol))); 69 VERIFY(C.isApprox(B, static_cast<T>(tol))); 74 void testPascal(double tol) 89 VERIFY(C.isApprox(B, static_cast<T>(tol))); 93 VERIFY(C.isApprox(B, static_cast<T>(tol))); 98 void randomTest(const MatrixType& m, double tol) [all...] |
matrix_power.cpp | 40 void test2dRotation(double tol) 56 VERIFY(C.isApprox(B, static_cast<T>(tol))); 61 void test2dHyperbolicRotation(double tol) 78 VERIFY(C.isApprox(B, static_cast<T>(tol))); 83 void testExponentLaws(const MatrixType& m, double tol) 100 VERIFY(m4.isApprox(m5, static_cast<RealScalar>(tol))); 104 VERIFY(m4.isApprox(m5, static_cast<RealScalar>(tol))); 108 VERIFY(m4.isApprox(m5, static_cast<RealScalar>(tol)));
|
/external/eigen/unsupported/Eigen/src/Eigenvalues/ |
ArpackSelfAdjointEigenSolver.h | 93 * \param[in] tol What tolerance to find the eigenvalues to. Default is 0, which 103 int options=ComputeEigenvectors, RealScalar tol=0.0) 111 compute(A, B, nbrEigenvalues, eigs_sigma, options, tol); 127 * \param[in] tol What tolerance to find the eigenvalues to. Default is 0, which 138 int options=ComputeEigenvectors, RealScalar tol=0.0) 146 compute(A, nbrEigenvalues, eigs_sigma, options, tol); 162 * \param[in] tol What tolerance to find the eigenvalues to. Default is 0, which 175 int options=ComputeEigenvectors, RealScalar tol=0.0); 188 * \param[in] tol What tolerance to find the eigenvalues to. Default is 0, which 201 int options=ComputeEigenvectors, RealScalar tol=0.0) [all...] |
/external/opencv3/3rdparty/openexr/Imath/ |
ImathMatrixAlgo.cpp | 322 const T tol) 343 if (std::abs(mu_2) <= tol*std::abs(mu_1)) // Already symmetric (to tolerance) 371 if (std::abs(mu_2) <= tol*std::abs(mu_1)) 463 const T tol) 484 if (std::abs(mu_2) <= tol*std::abs(mu_1)) // Already symmetric (to tolerance) 512 if (std::abs(mu_2) <= tol*std::abs(mu_1)) 663 const T tol, 699 const T absTol = tol * maxOffDiag (A); // Tolerance is in terms of the maximum 706 bool changed = twoSidedJacobiRotation<T, 0, 1, 2> (A, U, V, tol); 707 changed = twoSidedJacobiRotation<T, 0, 2, 1> (A, U, V, tol) || changed [all...] |
/external/apache-commons-math/src/main/java/org/apache/commons/math/ode/nonstiff/ |
DormandPrince54Integrator.java | 146 final double tol = (vecAbsoluteTolerance == null) ? local 149 final double ratio = h * errSum / tol;
|
HighamHall54Integrator.java | 120 final double tol = (vecAbsoluteTolerance == null) ? local 123 final double ratio = h * errSum / tol;
|
DormandPrince853Integrator.java | 265 final double tol = (vecAbsoluteTolerance == null) ? local 268 final double ratio1 = errSum1 / tol; 270 final double ratio2 = errSum2 / tol;
|
AdamsBashforthIntegrator.java | 238 final double tol = (vecAbsoluteTolerance == null) ? local 241 final double ratio = nordsieck.getEntry(lastRow, i) / tol;
|
/external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
LevenbergMarquardt.h | 136 const Scalar tol = std::sqrt(NumTraits<Scalar>::epsilon()) 142 const Scalar tol = std::sqrt(NumTraits<Scalar>::epsilon()) 327 const Scalar tol 334 if (n <= 0 || m < n || tol < 0.) 338 m_ftol = tol; 339 m_xtol = tol; 352 const Scalar tol 359 if (n <= 0 || m < n || tol < 0.) 365 lm.setFtol(tol); 366 lm.setXtol(tol); [all...] |
LMcovar.h | 23 Scalar tol = std::sqrt(NumTraits<Scalar>::epsilon()) ) 34 const Scalar tolr = tol * abs(r(0,0));
|
/external/skia/src/gpu/ |
GrPathUtils.h | 25 /// Since we divide by tol if we're computing exact worst-case bounds, 29 SkScalar tol); 31 /// Since we divide by tol if we're computing exact worst-case bounds, 33 uint32_t quadraticPointCount(const SkPoint points[], SkScalar tol); 42 /// Since we divide by tol if we're computing exact worst-case bounds, 44 uint32_t cubicPointCount(const SkPoint points[], SkScalar tol);
|
GrPathUtils.cpp | 39 SkScalar tol) { 40 if (tol < gMinCurveTol) { 41 tol = gMinCurveTol; 43 SkASSERT(tol > 0); 46 if (d <= tol) { 50 // subdivide x = log4(d/tol) times. x subdivisions creates 2^(x) 53 SkScalar divSqrt = SkScalarSqrt(d / tol); 96 SkScalar tol) { 97 if (tol < gMinCurveTol) { 98 tol = gMinCurveTol [all...] |
/external/skia/src/core/ |
SkCubicClipper.cpp | 37 const SkScalar tol = SK_Scalar1 / 16384; // This leaves 2 fixed noise bits. local 53 converged = SkScalarAbs(t1 - t0) <= tol; // NaN-safe 83 const SkScalar tol = SK_Scalar1 / 65536; // 1 for fixed, 1e-5 for float. 100 } while (!(SkScalarAbs(tPos - tNeg) <= tol)); // Nan-safe
|
SkGeometry.h | 226 bool asQuadTol(SkScalar tol) const; 232 int computeQuadPOW2(SkScalar tol) const; 383 const SkPoint* computeQuads(const SkConic& conic, SkScalar tol) { 384 int pow2 = conic.computeQuadPOW2(tol); 392 SkScalar tol) { 395 return computeQuads(conic, tol);
|
/external/opencv3/modules/core/test/ |
test_conjugate_gradient.cpp | 53 double tol = 1e-2; local 54 ASSERT_TRUE(std::abs(res-etalon_res)<tol); 56 ASSERT_TRUE(std::abs((*it1)-(*it2))<tol);
|
test_downhill_simplex.cpp | 61 double tol=1e-2;//solver->getTermCriteria().epsilon; local 62 ASSERT_TRUE(std::abs(res-etalon_res)<tol); 64 ASSERT_TRUE(std::abs((*it1)-(*it2))<tol);
|
/external/skia/src/gpu/batches/ |
GrTessellatingPathRenderer.cpp | 48 bool cache_match(GrVertexBuffer* vertexBuffer, SkScalar tol, int* actualCount) { 55 if (info->fTolerance == 0 || info->fTolerance < 3.0f * tol) { 128 SkScalar tol = GrPathUtils::scaleToleranceToSrc(screenSpaceTol, fViewMatrix, pathBounds); local 131 int count = GrTessellator::PathToTriangles(path, tol, fClipBounds, resourceProvider, 135 info.fTolerance = isLinear ? 0 : tol; 165 SkScalar tol = GrPathUtils::scaleToleranceToSrc( variable 167 if (!cache_match(vertexBuffer.get(), tol, &actualCount)) {
|
/external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
covar.h | 9 Scalar tol = std::sqrt(NumTraits<Scalar>::epsilon()) ) 21 const Scalar tolr = tol * abs(r(0,0));
|
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 137 if (n <= 0 || m < n || tol < 0.) 141 parameters.ftol = tol; 142 parameters.xtol = tol; 358 const Scalar tol 365 if (n <= 0 || m < n || tol < 0.) 369 parameters.ftol = tol; [all...] |
/external/skia/samplecode/ |
SamplePath.cpp | 333 const SkScalar tol = 4; variable 334 const SkRect r = SkRect::MakeXYWH(x - tol, y - tol, tol * 2, tol * 2);
|