HomeSort by relevance Sort by last modified time
    Searched refs:tol (Results 1 - 25 of 51) sorted by null

1 2 3

  /external/chromium_org/third_party/skia/tests/
ClipCubicTest.cpp 43 float tol) {
45 if (SkScalarAbs(c0[i].fX - c1[i].fX) > tol ||
46 SkScalarAbs(c0[i].fY - c1[i].fY) > tol
82 const float tol = 1e-4f; local
90 0, 0, 2, 3, 1, 10, 4, 12, shouldbe), tol));
98 0, 0, 2, 3, 1, 10, 4, 12, shouldbe), tol));
106 0, 0, 2, 3, 1, 10, 4, 12, shouldbe), tol));
124 shouldbe), tol));
136 shouldbe), tol));
148 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(SkScalarDiv(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);
  /external/skia/tests/
ClipCubicTest.cpp 43 float tol) {
45 if (SkScalarAbs(c0[i].fX - c1[i].fX) > tol ||
46 SkScalarAbs(c0[i].fY - c1[i].fY) > tol
82 const float tol = 1e-4f; local
90 0, 0, 2, 3, 1, 10, 4, 12, shouldbe), tol));
98 0, 0, 2, 3, 1, 10, 4, 12, shouldbe), tol));
106 0, 0, 2, 3, 1, 10, 4, 12, shouldbe), tol));
124 shouldbe), tol));
136 shouldbe), tol));
148 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(SkScalarDiv(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);
  /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;
autodiff_test.cc 161 double const tol = 1e-10; // floating-point tolerance. local
201 ASSERT_NEAR(ad_x1[i], b_x[i], tol);
216 ASSERT_NEAR(ad_x2[i], b_x[i], tol);
226 ASSERT_NEAR(J_PX[(12 + 4) * i + j], J_P[12 * i + j], tol);
229 ASSERT_NEAR(J_PX[(12 + 4) * i + 12 + j], J_X[4 * i + j], tol);
282 double const tol = 1e-10; // floating-point tolerance. local
309 ASSERT_NEAR(fd_x[i], b_x[i], tol);
323 ASSERT_NEAR(ad_x[i], b_x[i], tol);
  /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/chromium_org/third_party/skia/src/core/
SkGeometry.h 237 bool asQuadTol(SkScalar tol) const;
243 int computeQuadPOW2(SkScalar tol) const;
290 const SkPoint* computeQuads(const SkConic& conic, SkScalar tol) {
291 int pow2 = conic.computeQuadPOW2(tol);
299 SkScalar tol) {
302 return computeQuads(conic, tol);
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
  /external/skia/src/core/
SkGeometry.h 237 bool asQuadTol(SkScalar tol) const;
243 int computeQuadPOW2(SkScalar tol) const;
290 const SkPoint* computeQuads(const SkConic& conic, SkScalar tol) {
291 int pow2 = conic.computeQuadPOW2(tol);
299 SkScalar tol) {
302 return computeQuads(conic, tol);
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
  /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/chromium_org/third_party/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 40 SkScalar tol) {
41 if (tol < gMinCurveTol) {
42 tol = gMinCurveTol;
44 SkASSERT(tol > 0);
47 if (d <= tol) {
51 // subdivide x = log4(d/tol) times. x subdivisions creates 2^(x)
54 int temp = SkScalarCeilToInt(SkScalarSqrt(SkScalarDiv(d, tol)));
92 SkScalar tol) {
93 if (tol < gMinCurveTol) {
94 tol = gMinCurveTol
    [all...]
  /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 40 SkScalar tol) {
41 if (tol < gMinCurveTol) {
42 tol = gMinCurveTol;
44 SkASSERT(tol > 0);
47 if (d <= tol) {
51 // subdivide x = log4(d/tol) times. x subdivisions creates 2^(x)
54 int temp = SkScalarCeilToInt(SkScalarSqrt(SkScalarDiv(d, tol)));
92 SkScalar tol) {
93 if (tol < gMinCurveTol) {
94 tol = gMinCurveTol
    [all...]
  /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...]
HybridNonLinearSolver.h 73 const Scalar tol = std::sqrt(NumTraits<Scalar>::epsilon())
82 const Scalar tol = std::sqrt(NumTraits<Scalar>::epsilon())
124 const Scalar tol
130 if (n <= 0 || tol < 0.)
135 parameters.xtol = tol;
360 const Scalar tol
366 if (n <= 0 || tol < 0.)
371 parameters.xtol = tol;
  /external/eigen/unsupported/Eigen/src/IterativeSolvers/
Scaling.h 162 void setTolerance(double tol)
164 m_tol = tol;
  /external/eigen/Eigen/src/IterativeLinearSolvers/
BiCGSTAB.h 38 RealScalar tol = tol_error; local
63 RealScalar tol2 = tol*tol;

Completed in 321 milliseconds

1 2 3