/external/skia/src/gpu/ |
H A D | GrPathUtils.h | 25 /// Since we divide by tol if we're computing exact worst-case bounds, 29 GrScalar tol); 30 /// Since we divide by tol if we're computing exact worst-case bounds, 32 uint32_t quadraticPointCount(const GrPoint points[], GrScalar tol); 39 /// Since we divide by tol if we're computing exact worst-case bounds, 41 uint32_t cubicPointCount(const GrPoint points[], GrScalar tol);
|
H A D | GrPathUtils.cpp | 41 GrScalar tol) { 42 if (tol < gMinCurveTol) { 43 tol = gMinCurveTol; 45 GrAssert(tol > 0); 48 if (d <= tol) { 52 // subdivide x = log4(d/tol) times. x subdivisions creates 2^(x) 55 int temp = SkScalarCeil(SkScalarSqrt(SkScalarDiv(d, tol))); 93 GrScalar tol) { 94 if (tol < gMinCurveTol) { 95 tol 40 quadraticPointCount(const GrPoint points[], GrScalar tol) argument 92 cubicPointCount(const GrPoint points[], GrScalar tol) argument 148 worstCasePointCount(const GrPath& path, int* subpaths, GrScalar tol) argument [all...] |
H A D | GrTesselatedPathRenderer.cpp | 364 GrScalar tol = GR_Scalar1; local 365 tol = GrPathUtils::scaleToleranceToSrc(tol, viewM, path.getBounds()); 366 GrScalar tolSqd = GrMul(tol, tol); 369 int maxPts = GrPathUtils::worstCasePointCount(path, &subpathCnt, tol); 417 GrPathUtils::quadraticPointCount(pts, tol)); 423 GrPathUtils::cubicPointCount(pts, tol));
|
H A D | GrDefaultPathRenderer.cpp | 346 GrScalar tol = GR_Scalar1; local 347 tol = GrPathUtils::scaleToleranceToSrc(tol, viewM, path.getBounds()); 356 tol,
|
/external/skia/tests/ |
H A D | ClipCubicTest.cpp | 45 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-4); 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 D | PathCoverageTest.cpp | 59 static inline uint32_t compute_pointCount(SkScalar d, SkScalar tol) { argument 60 if (d < tol) { 63 int temp = SkScalarCeil(SkScalarSqrt(SkScalarDiv(d, tol))); 69 uint32_t quadraticPointCount_EE(const SkPoint points[], SkScalar tol) { argument 74 uint32_t quadraticPointCount_EC(const SkPoint points[], SkScalar tol) { argument 76 return compute_pointCount(SkIntToScalar(distance), tol); 79 uint32_t quadraticPointCount_CE(const SkPoint points[], SkScalar tol) { argument 84 uint32_t quadraticPointCount_CC(const SkPoint points[], SkScalar tol) { argument 86 return compute_pointCount(distance, tol);
|
/external/eigen/bench/spbench/ |
H A D | spbenchsolver.cpp | 63 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);
|
H A D | spbenchsolver.h | 488 void Browse_Matrices(const string folder, bool statFileExists, std::string& statFile, int maxiters, double tol) argument 491 RelErr = tol; //Relative residual error as stopping criterion for iterative solvers
|
/external/eigen/unsupported/test/ |
H A D | matrix_exponential.cpp | 34 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/src/core/ |
H A D | SkCubicClipper.cpp | 39 const SkScalar tol = SK_Scalar1 / 16384; // This leaves 2 fixed noise bits. local 59 converged = SkScalarAbs(t1 - t0) <= tol; // NaN-safe 89 const SkScalar tol = SK_Scalar1 / 65536; // 1 for fixed, 1e-5 for float. 106 } while (!(SkScalarAbs(tPos - tNeg) <= tol)); // Nan-safe
|
/external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
H A D | covar.h | 9 Scalar tol = sqrt(NumTraits<Scalar>::epsilon()) ) 20 const Scalar tolr = tol * abs(r(0,0));
|
H A 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 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 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 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 D | Scaling.h | 162 void setTolerance(double tol) argument 164 m_tol = tol;
|
H A D | GMRES.h | 68 RealScalar tol = tol_error; local 147 bool stop=(k==m || abs(w(k)) < tol || iters == maxIters);
|
/external/eigen/Eigen/src/IterativeLinearSolvers/ |
H A D | BiCGSTAB.h | 38 RealScalar tol = tol_error; local 56 RealScalar tol2 = tol*tol;
|
H A D | ConjugateGradient.h | 38 RealScalar tol = tol_error; local 52 RealScalar threshold = tol*tol*rhsNorm2;
|
/external/skia/include/core/ |
H A D | SkPoint.h | 318 /** Return true if this and the given point are componentwise within tol. 320 bool equalsWithinTolerance(const SkPoint& v, SkScalar tol) const { 321 return SkScalarNearlyZero(fX - v.fX, tol) 322 && SkScalarNearlyZero(fY - v.fY, tol);
|