/external/eigen/Eigen/src/SparseCore/ |
AmbiVector.h | 287 * \param epsilon the minimal value used to prune zero coefficients. 288 * In practice, all coefficients having a magnitude smaller than \a epsilon 291 Iterator(const AmbiVector& vec, const RealScalar& epsilon = 0) 295 m_epsilon = epsilon; 363 RealScalar m_epsilon; // epsilon used to prune zero coefficients
|
SparseVector.h | 191 void prune(const Scalar& reference, const RealScalar& epsilon = NumTraits<RealScalar>::dummy_precision()) 193 m_data.prune(reference,epsilon);
|
/external/eigen/unsupported/Eigen/src/SparseExtra/ |
DynamicSparseMatrix.h | 188 /** Suppress all nonzeros which are smaller than \a reference under the tolerence \a epsilon */ 189 void prune(Scalar reference, RealScalar epsilon = NumTraits<RealScalar>::dummy_precision()) 192 m_data[j].prune(reference,epsilon);
|
/external/opencv/cv/src/ |
cvcamshift.cpp | 93 eps = cvRound( criteria.epsilon * criteria.epsilon );
|
/external/opencv3/modules/core/include/opencv2/core/ |
types_c.h | 841 double epsilon; member in struct:CvTermCriteria 844 CvTermCriteria(int _type = 0, int _iter = 0, double _eps = 0) : type(_type), max_iter(_iter), epsilon(_eps) {} 845 CvTermCriteria(const cv::TermCriteria& t) : type(t.type), max_iter(t.maxCount), epsilon(t.epsilon) {} 846 operator cv::TermCriteria() const { return cv::TermCriteria(type, max_iter, epsilon); } 852 CV_INLINE CvTermCriteria cvTermCriteria( int type, int max_iter, double epsilon ) 858 t.epsilon = (float)epsilon; [all...] |
/external/valgrind/drd/tests/ |
matinv.c | 298 /** Compute epsilon for the numeric type elem_t. Epsilon is defined as the 303 static elem_t epsilon() function 344 eps = epsilon(); 354 printf("error = %g; epsilon = %g; error / (epsilon * n) = %g\n",
|
omp_matinv.c | 262 /** Compute epsilon for the numeric type elem_t. Epsilon is defined as the 267 static elem_t epsilon() function 324 eps = epsilon(); 334 printf("error = %g; epsilon = %g; error / (epsilon * n) = %g\n",
|
/ndk/tests/device/test-gnustl-full/unit/ |
num_put_get_test.cpp | 58 float epsilon = numeric_limits<float>::epsilon(); local 59 return val <= ref + epsilon && val >= ref - epsilon; 64 double epsilon = numeric_limits<double>::epsilon(); local 65 return val <= ref + epsilon && val >= ref - epsilon; [all...] |
/ndk/tests/device/test-stlport/unit/ |
num_put_get_test.cpp | 58 float epsilon = numeric_limits<float>::epsilon(); local 59 return val <= ref + epsilon && val >= ref - epsilon; 64 double epsilon = numeric_limits<double>::epsilon(); local 65 return val <= ref + epsilon && val >= ref - epsilon; [all...] |
/external/opencv3/modules/calib3d/src/ |
rho.cpp | 304 double epsilon; /* Epsilon */ member in struct:cv::RHO_HEST_REFC::__anon20601 [all...] |
ptsetreg.cpp | 521 const double epsilon = DBL_EPSILON; local 523 param2 = (param2 < epsilon) ? 0.99 : (param2 > 1 - epsilon) ? 0.99 : param2;
|
/cts/tests/tests/animation/src/android/animation/cts/ |
ValueAnimatorTest.java | 99 * Test for equality within some epsilon. This accounts for minor differences 103 final float epsilon = .001f; local 104 assertTrue(actual > (expected - epsilon) && actual < (expected + epsilon));
|
/external/eigen/Eigen/src/Eigenvalues/ |
SelfAdjointEigenSolver.h | 590 if((eivals(2)-eivals(0))<=Eigen::NumTraits<Scalar>::epsilon()) 618 if(d0<=2*Eigen::NumTraits<Scalar>::epsilon()*d1) 690 if((eivals(1)-eivals(0))<=abs(eivals(1))*Eigen::NumTraits<Scalar>::epsilon())
|
ComplexEigenSolver.h | 305 numext::real_ref(z) = NumTraits<RealScalar>::epsilon() * matrixnorm;
|
/external/eigen/test/ |
jacobisvd.cpp | 99 y.row(k).array() += 2*NumTraits<RealScalar>::epsilon(); 103 y.row(k) = x.row(k).array() - 2*NumTraits<RealScalar>::epsilon(); 338 m << 0, 2*NumTraits<Scalar>::epsilon(), 0.5,
|
/external/deqp/modules/gles31/functional/ |
es31fSampleShadingTests.cpp | 312 // Minimum number of samples is max(ceil(<mss> * <samples>),1). Decrease mss with epsilon to prevent 314 const float epsilon = 0.25f / (float)m_numTargetSamples; 315 const float ratio = ((float)sampleCount / (float)m_numTargetSamples) - epsilon;
|
/external/eigen/Eigen/src/QR/ |
ColPivHouseholderQR.h | 353 : NumTraits<Scalar>::epsilon() * RealScalar(m_qr.diagonalSize()); 453 RealScalar threshold_helper = m_colSqNorms.maxCoeff() * numext::abs2(NumTraits<Scalar>::epsilon()) / RealScalar(rows);
|
FullPivHouseholderQR.h | 349 : NumTraits<Scalar>::epsilon() * RealScalar(m_qr.diagonalSize()); 428 m_precision = NumTraits<Scalar>::epsilon() * RealScalar(size);
|
/external/libgdx/gdx/src/com/badlogic/gdx/utils/ |
FloatArray.java | 344 public boolean equals (Object object, float epsilon) {
355 if (Math.abs(items1[i] - items2[i]) > epsilon) return false;
|
/external/opencv/ml/src/ |
mlboost.cpp | 246 const float epsilon = FLT_EPSILON*2; local 287 if( sorted[i].val + epsilon < sorted[i+1].val ) 308 if( sorted[i].val + epsilon < sorted[i+1].val ) 442 const float epsilon = FLT_EPSILON*2; local 470 if( sorted[i].val + epsilon < sorted[i+1].val ) 573 const float epsilon = FLT_EPSILON*2; local 613 if( LL + RR > best_val && sorted[i].val + epsilon < sorted[i+1].val ) 622 if( RL + LR > best_val && sorted[i].val + epsilon < sorted[i+1].val ) [all...] |
/external/opencv3/modules/ml/src/ |
rtrees.cpp | 134 rparams.termCrit.epsilon > 0 ? rparams.termCrit.epsilon : 0.;
|
/frameworks/ml/bordeaux/learning/stochastic_linear_ranker/native/ |
sparse_weight_vector.cpp | 251 const double epsilon) const { 256 if (fabs(iter->second / normalizer_) > epsilon)
|
/external/ceres-solver/internal/ceres/ |
dogleg_strategy_test.cc | 122 const double kEpsilon = std::numeric_limits<double>::epsilon();
|
/external/eigen/Eigen/src/Core/ |
IO.h | 132 return cast<RealScalar,int>(ceil(-log(NumTraits<RealScalar>::epsilon())/log(RealScalar(10))));
|
/external/eigen/Eigen/src/Geometry/ |
Hyperplane.h | 106 if(norm <= v0.norm() * v1.norm() * NumTraits<RealScalar>::epsilon())
|