Home
last modified time | relevance | path

Searched refs:eps (Results 1 – 25 of 76) sorted by relevance

1234

/external/llvm/test/CodeGen/X86/
Dfp-select-cmp-and.ll3 define double @test1(double %a, double %b, double %eps) {
4 %cmp = fcmp olt double %a, %eps
13 define double @test2(double %a, double %b, double %eps) {
14 %cmp = fcmp ole double %a, %eps
23 define double @test3(double %a, double %b, double %eps) {
24 %cmp = fcmp ogt double %a, %eps
33 define double @test4(double %a, double %b, double %eps) {
34 %cmp = fcmp oge double %a, %eps
43 define double @test5(double %a, double %b, double %eps) {
44 %cmp = fcmp olt double %a, %eps
[all …]
Davx512-select.ll27 define float @select02(float %a, float %b, float %c, float %eps) {
28 %cmp = fcmp oge float %a, %eps
37 define double @select03(double %a, double %b, double %c, double %eps) {
38 %cmp = fcmp oge double %a, %eps
/external/v8/test/mjsunit/
Dnumber-limits.js30 var i; var eps;
31 for (i = 0, eps = 1; i < 1100; i++, eps /= 2) {
32 var mulAboveMax = Number.MAX_VALUE * (1 + eps);
33 var addAboveMax = Number.MAX_VALUE + 1/eps;
34 var mulBelowMin = Number.MIN_VALUE * (1 - eps);
35 var addBelowMin = Number.MIN_VALUE - eps;
/external/eigen/unsupported/Eigen/src/NonLinearOptimization/
Dchkder.h25 const Scalar eps = sqrt(NumTraits<Scalar>::epsilon()); in chkder() local
27 const Scalar epslog = chkder_log10e * log(eps); in chkder()
36 temp = eps * abs(x[j]); in chkder()
38 temp = eps; in chkder()
54 … temp = eps * abs((fvecp[i] - fvec[i]) / eps - err[i]) / (abs(fvec[i]) + abs(fvecp[i])); in chkder()
56 if (temp > NumTraits<Scalar>::epsilon() && temp < eps) in chkder()
58 if (temp >= eps) in chkder()
Dfdjac1.h22 Scalar eps, temp; in fdjac1() local
34 eps = sqrt((std::max)(epsfcn,epsmch)); in fdjac1()
40 h = eps * abs(temp); in fdjac1()
42 h = eps; in fdjac1()
56 h = eps * abs(wa2[j]); in fdjac1()
57 if (h == 0.) h = eps; in fdjac1()
65 h = eps * abs(wa2[j]); in fdjac1()
66 if (h == 0.) h = eps; in fdjac1()
/external/blktrace/btt/doc/
DMakefile5 btt.tex: activity.eps qhist.eps dhist.eps seek.eps
/external/opencv/cv/src/
Dcvmatchcontours.cpp65 double eps = 1.e-5; in cvMatchShapes() local
127 if( ama > eps && amb > eps ) in cvMatchShapes()
157 if( ama > eps && amb > eps ) in cvMatchShapes()
187 if( ama > eps && amb > eps ) in cvMatchShapes()
232 double eps = 1.e-5; in cvMatchContourTrees() local
281 if( area1 < eps || area2 < eps || lpt < 4 ) in cvMatchContourTrees()
Dcvcornersubpix.cpp69 double eps; in cvFindCornerSubPix() local
98 eps = 0.f; in cvFindCornerSubPix()
102 eps = criteria.epsilon; in cvFindCornerSubPix()
106 eps = criteria.epsilon; in cvFindCornerSubPix()
114 eps = MAX( eps, 0 ); in cvFindCornerSubPix()
115 eps *= eps; /* use square of error in comparsion operations. */ in cvFindCornerSubPix()
250 while( ++iter < max_iters && err > eps ); in cvFindCornerSubPix()
Dcvapprox.cpp520 CvSeq** dst_contour, float eps ) in icvApproxPolyDP_32s() argument
546 eps *= eps; in icvApproxPolyDP_32s()
596 le_eps = max_dist <= eps; in icvApproxPolyDP_32s()
649 le_eps = (double)max_dist * max_dist <= eps * ((double)dx * dx + (double)dy * dy); in icvApproxPolyDP_32s()
694 if( (double)dist * dist <= 0.5*eps*((double)dx*dx + (double)dy*dy) && dx != 0 && dy != 0 ) in icvApproxPolyDP_32s()
724 CvSeq** dst_contour, float eps ) in icvApproxPolyDP_32f() argument
750 eps *= eps; in icvApproxPolyDP_32f()
801 le_eps = max_dist <= eps; in icvApproxPolyDP_32f()
854 le_eps = (double)max_dist * max_dist <= eps * ((double)dx * dx + (double)dy * dy); in icvApproxPolyDP_32f()
899 if( (double)dist * dist <= 0.5*eps*((double)dx*dx + (double)dy*dy) ) in icvApproxPolyDP_32f()
/external/deqp/framework/randomshaders/
DrsgBinaryOps.cpp263 const float eps = 0.001f; in operator ()() local
265 DE_ASSERT(de::inRange(aMin*bMin, dstMin-eps, dstMax+eps)); in operator ()()
266 DE_ASSERT(de::inRange(aMin*bMax, dstMin-eps, dstMax+eps)); in operator ()()
267 DE_ASSERT(de::inRange(aMax*bMin, dstMin-eps, dstMax+eps)); in operator ()()
268 DE_ASSERT(de::inRange(aMax*bMax, dstMin-eps, dstMax+eps)); in operator ()()
316 T eps = T(0.001); in operator ()() local
318 DE_ASSERT(de::inRange(aMin+bMin, dstMin-eps, dstMax+eps)); in operator ()()
319 DE_ASSERT(de::inRange(aMin+bMax, dstMin-eps, dstMax+eps)); in operator ()()
320 DE_ASSERT(de::inRange(aMax+bMin, dstMin-eps, dstMax+eps)); in operator ()()
321 DE_ASSERT(de::inRange(aMax+bMax, dstMin-eps, dstMax+eps)); in operator ()()
[all …]
/external/valgrind/drd/tests/
Domp_matinv.c269 elem_t eps; in epsilon() local
270 for (eps = 1; 1 + eps != 1; eps /= 2) in epsilon()
272 return 2 * eps; in epsilon()
293 elem_t eps; in main() local
324 eps = epsilon(); in main()
331 ratio = error / (eps * matrix_size); in main()
335 error, eps, ratio); in main()
Dmatinv.c305 elem_t eps; in epsilon() local
306 for (eps = 1; 1 + eps != 1; eps /= 2) in epsilon()
308 return 2 * eps; in epsilon()
317 elem_t eps; in main() local
344 eps = epsilon(); in main()
351 ratio = error / (eps * matrix_size); in main()
355 error, eps, ratio); in main()
/external/opencv/cxcore/src/
Dcxjacobieigens.cpp69 icvJacobiEigens_32f(float *A, float *V, float *E, int n, float eps) in icvJacobiEigens_32f() argument
79 if( eps < DBL_EPSILON ) in icvJacobiEigens_32f()
80 eps = DBL_EPSILON; in icvJacobiEigens_32f()
97 ax = anorm * eps / n; in icvJacobiEigens_32f()
220 icvJacobiEigens_64d(double *A, double *V, double *E, int n, double eps) in icvJacobiEigens_64d() argument
230 if( eps < DBL_EPSILON ) in icvJacobiEigens_64d()
231 eps = DBL_EPSILON; in icvJacobiEigens_64d()
248 ax = anorm * eps / n; in icvJacobiEigens_64d()
370 cvEigenVV( CvArr* srcarr, CvArr* evectsarr, CvArr* evalsarr, double eps ) in cvEigenVV() argument
411 evals->data.fl, src->cols, (float)eps )); in cvEigenVV()
[all …]
/external/fonttools/Lib/fontTools/misc/
DfixedTools.py30 eps = .5 / scale
33 lo = fmt % (value - eps)
34 hi = fmt % (value + eps)
/external/bison/doc/
DMakefile.am108 $(FIGS_DOT:.dot=.eps) $(FIGS_DOT:.dot=.pdf) $(FIGS_DOT:.dot=.png)
109 SUFFIXES += .dot .eps .pdf .png
111 bison.dvi: $(FIGS_DOT:.dot=.eps)
115 .dot.eps:
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/univariate/
DBrentOptimizer.java84 double eps, double t) in localMin() argument
86 if (eps <= 0) { in localMin()
87 throw new NotStrictlyPositiveException(eps); in localMin()
116 final double tol1 = eps * FastMath.abs(x) + t; in localMin()
/external/mesa3d/src/gallium/drivers/llvmpipe/
Dlp_test_main.c254 compare_vec_with_eps(struct lp_type type, const void *res, const void *ref, double eps) in compare_vec_with_eps() argument
257 eps *= type.floating ? 8.0 : 2.0; in compare_vec_with_eps()
266 if (delta >= eps) { in compare_vec_with_eps()
278 double eps = lp_const_eps(type); in compare_vec() local
279 return compare_vec_with_eps(type, res, ref, eps); in compare_vec()
/external/eigen/bench/
DbenchBlasGemm.cpp183 MyMatrix::Scalar eps = 1e-4; in check_product() local
188 MYVERIFY(meigen.isApprox(mref, eps),". * ."); in check_product()
193 MYVERIFY(meigen.isApprox(mref, eps),"T * ."); in check_product()
198 MYVERIFY(meigen.isApprox(mref, eps),"T * T"); in check_product()
203 MYVERIFY(meigen.isApprox(mref, eps),". * T"); in check_product()
/external/eigen/unsupported/Eigen/src/NumericalDiff/
DNumericalDiff.h72 const Scalar eps = sqrt(((std::max)(epsfcn,NumTraits<Scalar>::epsilon() ))); in df() local
94 h = eps * abs(x[j]); in df()
96 h = eps; in df()
/external/eigen/unsupported/Eigen/
DMPRealSupport107 …nline bool isMuchSmallerThan(const mpfr::mpreal& a, const mpfr::mpreal& b, const mpfr::mpreal& eps)
109 return mpfr::abs(a) <= mpfr::abs(b) * eps;
112 inline bool isApprox(const mpfr::mpreal& a, const mpfr::mpreal& b, const mpfr::mpreal& eps)
114 return mpfr::isEqualFuzzy(a,b,eps);
117 …line bool isApproxOrLessThan(const mpfr::mpreal& a, const mpfr::mpreal& b, const mpfr::mpreal& eps)
119 return a <= b || mpfr::isEqualFuzzy(a,b,eps);
/external/eigen/Eigen/src/Core/
DStableNorm.h62 RealScalar eps; in blueNorm_impl() local
88 eps = RealScalar(pow(double(ibeta), 1-it)); in blueNorm_impl()
89 relerr = sqrt(eps); // tolerance for neglecting asml in blueNorm_impl()
/external/apache-commons-math/src/main/java/org/apache/commons/math/util/
DMathUtils.java391 public static int compareTo(double x, double y, double eps) { in compareTo() argument
392 if (equals(x, y, eps)) { in compareTo()
452 public static boolean equals(float x, float y, float eps) { in equals() argument
453 return equals(x, y, 1) || FastMath.abs(y - x) <= eps; in equals()
467 public static boolean equalsIncludingNaN(float x, float y, float eps) { in equalsIncludingNaN() argument
468 return equalsIncludingNaN(x, y) || (FastMath.abs(y - x) <= eps); in equalsIncludingNaN()
635 public static boolean equals(double x, double y, double eps) {
636 return equals(x, y) || FastMath.abs(y - x) <= eps;
650 public static boolean equalsIncludingNaN(double x, double y, double eps) {
651 return equalsIncludingNaN(x, y) || (FastMath.abs(y - x) <= eps);
/external/deqp/modules/gles3/functional/
Des3fShaderCommonFunctionTests.cpp685 const float eps = getEpsFromBits(1.0f, mantissaBits); // epsilon for rounding bounds in compare() local
691 const int minRes = int(roundEven(in0-eps)); in compare()
692 const int maxRes = int(roundEven(in0+eps)); in compare()
1137 const float eps = getEpsFromBits(1.0f, mantissaBits); // epsilon for rounding bounds in compare() local
1143 const int minRes = int(deFloatFloor(in0-eps)); in compare()
1144 const int maxRes = int(deFloatFloor(in0+eps)); in compare()
1245 const float eps = getEpsFromBits(1.0f, mantissaBits); // epsilon for rounding bounds in compare() local
1251 const int minRes = int(in0-eps); in compare()
1252 const int maxRes = int(in0+eps); in compare()
1373 const float eps = getEpsFromBits(1.0f, mantissaBits); // epsilon for rounding bounds in compare() local
[all …]
/external/eigen/test/eigen2/
Deigen2_sparse_vector.cpp20 Scalar eps = 1e-6; in sparse_vector() local
41 VERIFY_IS_MUCH_SMALLER_THAN( v1.coeff(zerocoords[i]), eps ); in sparse_vector()
/external/eigen/Eigen/src/Eigenvalues/
DEigenSolver.h437 const Scalar eps = NumTraits<Scalar>::epsilon(); in doComputeEigenvectors() local
482 m_matT.coeffRef(i,n) = -r / (eps * norm); in doComputeEigenvectors()
499 if ((eps * t) * t > Scalar(1)) in doComputeEigenvectors()
552 vr = eps * norm * (abs(w) + abs(q) + abs(x) + abs(y) + abs(lastw)); in doComputeEigenvectors()
573 if ((eps * t) * t > Scalar(1)) in doComputeEigenvectors()

1234