| /frameworks/native/libs/vr/libdvrcommon/include/private/dvr/test/ |
| test_macros.h | 92 #define EXPECT_VEC3_NEAR(expected, actual, tol) \
94 tol)
96 #define EXPECT_VEC3_NOT_NEAR(expected, actual, tol) \
98 tol)
100 #define EXPECT_QUAT_NEAR(expected, actual, tol) \
102 actual.coeffs(), tol)
104 #define EXPECT_QUAT_NOT_NEAR(expected, actual, tol) \
106 actual.coeffs(), tol)
108 #define EXPECT_MAT4_NEAR(expected, actual, tol) \
110 tol)
[all...] |
| /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/eigen/unsupported/test/ |
| matrix_power.cpp | 13 void test2dRotation(const T& tol)
29 VERIFY(C.isApprox(B, tol));
34 void test2dHyperbolicRotation(const T& tol)
51 VERIFY(C.isApprox(B, tol));
56 void test3dRotation(const T& tol)
65 VERIFY(AngleAxis<T>(angle, v).matrix().isApprox(AngleAxis<T>(1,v).matrix().pow(angle), tol)); local
70 void testGeneral(const MatrixType& m, const typename MatrixType::RealScalar& tol)
87 VERIFY(m4.isApprox(m5, tol));
91 VERIFY(m4.isApprox(m5, tol));
95 VERIFY(m4.isApprox(m5, tol));
[all...] |
| 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...] |
| /external/skia/tests/ |
| ClipCubicTest.cpp | 45 float tol) {
47 if (SkScalarAbs(c0[i].fX - c1[i].fX) > tol ||
48 SkScalarAbs(c0[i].fY - c1[i].fY) > tol
84 const float tol = 1e-4f; 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));
[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 | 21 static bool nearly_equal(float a, float b, float tol = kTolerance) {
22 SkASSERT(tol >= 0);
23 return fabsf(a - b) <= 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/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;
|
| /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
| LevenbergMarquardt.h | 135 const Scalar tol = std::sqrt(NumTraits<Scalar>::epsilon())
141 const Scalar tol = std::sqrt(NumTraits<Scalar>::epsilon())
346 const Scalar tol
353 if (n <= 0 || m < n || tol < 0.)
357 m_ftol = tol;
358 m_xtol = tol;
371 const Scalar tol
378 if (n <= 0 || m < n || tol < 0.)
384 lm.setFtol(tol);
385 lm.setXtol(tol);
[all...] |
| LMcovar.h | 23 Scalar tol = std::sqrt(NumTraits<Scalar>::epsilon()) )
33 const Scalar tolr = tol * abs(r(0,0));
|
| /external/eigen/Eigen/src/Householder/ |
| Householder.h | 78 const RealScalar tol = (std::numeric_limits<RealScalar>::min)(); local
80 if(tailSqNorm <= tol && numext::abs2(numext::imag(c0))<=tol)
|
| /external/skia/src/gpu/ |
| GrPathUtils.h | 30 SkScalar tol);
32 uint32_t quadraticPointCount(const SkPoint points[], SkScalar tol);
41 uint32_t cubicPointCount(const SkPoint points[], SkScalar tol);
|
| GrPathUtils.cpp | 40 uint32_t GrPathUtils::quadraticPointCount(const SkPoint points[], SkScalar tol) {
42 SkASSERT(tol >= gMinCurveTol);
47 } else if (d <= tol) {
51 // subdivide x = log4(d/tol) times. x subdivisions creates 2^(x)
54 SkScalar divSqrt = SkScalarSqrt(d / tol);
97 SkScalar tol) {
99 SkASSERT(tol >= gMinCurveTol);
107 } else if (d <= tol) {
110 SkScalar divSqrt = SkScalarSqrt(d / tol);
114 int temp = SkScalarCeilToInt(SkScalarSqrt(d / tol));
[all...] |
| /external/skia/src/core/ |
| SkCubicClipper.cpp | 36 const SkScalar tol = SK_Scalar1 / 16384; // This leaves 2 fixed noise bits. local
52 converged = SkScalarAbs(t1 - t0) <= tol; // NaN-safe
82 const SkScalar tol = SK_Scalar1 / 65536; // 1 for fixed, 1e-5 for float.
99 } while (!(SkScalarAbs(tPos - tNeg) <= tol)); // Nan-safe
|
| SkGeometry.h | 239 bool asQuadTol(SkScalar tol) const;
245 int computeQuadPOW2(SkScalar tol) const;
396 const SkPoint* computeQuads(const SkConic& conic, SkScalar tol) {
397 int pow2 = conic.computeQuadPOW2(tol);
405 SkScalar tol) {
408 return computeQuads(conic, tol);
|
| /external/eigen/test/ |
| eigensolver_complex.cpp | 16 template<typename MatrixType> bool find_pivot(typename MatrixType::Scalar tol, MatrixType &diffs, Index col=0)
18 bool match = diffs.diagonal().sum() <= tol;
30 if(diffs.col(col).segment(col,n-i).minCoeff(&best_index) > tol)
36 if(find_pivot(tol,diffs,col+1)) return true;
65 RealScalar tol = test_precision<RealScalar>()*test_precision<RealScalar>()*numext::maxi(vec1.squaredNorm(),vec2.squaredNorm()); local
68 VERIFY( find_pivot(tol, diffs) );
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| LevenbergMarquardt.h | 81 const Scalar tol = sqrt_epsilon()
92 const Scalar tol = sqrt_epsilon()
97 const Scalar tol = sqrt_epsilon()
137 const Scalar tol
144 if (n <= 0 || m < n || tol < 0.)
148 parameters.ftol = tol;
149 parameters.xtol = tol;
365 const Scalar tol
372 if (n <= 0 || m < n || tol < 0.)
376 parameters.ftol = tol;
[all...] |
| covar.h | 9 Scalar tol = std::sqrt(NumTraits<Scalar>::epsilon()) )
21 const Scalar tolr = tol * abs(r(0,0));
|
| /external/skia/samplecode/ |
| SamplePath.cpp | 319 const SkScalar tol = 4; variable
320 const SkRect r = SkRect::MakeXYWH(x - tol, y - tol, tol * 2, tol * 2);
456 const SkScalar tol = 4; variable
457 const SkRect r = SkRect::MakeXYWH(x - tol, y - tol, tol * 2, tol * 2)
[all...] |
| /external/skia/src/gpu/ops/ |
| GrTessellatingPathRenderer.cpp | 51 bool cache_match(GrBuffer* vertexBuffer, SkScalar tol, int* actualCount) {
58 if (info->fTolerance == 0 || info->fTolerance < 3.0f * tol) {
249 SkScalar tol = GrPathUtils::kDefaultTolerance; local
250 tol = GrPathUtils::scaleToleranceToSrc(tol, fViewMatrix, fShape.bounds());
251 if (cache_match(cachedVertexBuffer.get(), tol, &actualCount)) {
266 int count = GrTessellator::PathToTriangles(getPath(), tol, clipBounds, &allocator,
273 info.fTolerance = isLinear ? 0 : tol;
287 SkScalar tol = GrPathUtils::kDefaultTolerance; local
291 GrTessellator::PathToTriangles(path, tol, clipBounds, &allocator, true, fColor
[all...] |
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| LeastSquareConjugateGradient.h | 38 RealScalar tol = tol_error; local
54 RealScalar threshold = tol*tol*rhsNorm2;
|
| /frameworks/native/libs/vr/libdvrcommon/include/private/dvr/ |
| numeric.h | 90 const T& tol = std::numeric_limits<T>::epsilon()) {
91 return std::abs(v) <= tol;
96 const T& tol = std::numeric_limits<T>::epsilon()) {
97 return std::abs(b - a) <= tol;
|
