Home
last modified time | relevance | path

Searched refs:accurate (Results 1 – 25 of 242) sorted by relevance

12345678910

/external/python/rsa/
Dcreate_timing_table.py22 accurate = True variable
32 rsa.newkeys(bitsize, accurate=accurate, poolsize=poolsize)
/external/autotest/server/cros/
Dtradefed_test_unittest.py126 _, accurate = tradefed_test.parse_tradefed_result(
129 self.assertTrue(accurate)
131 _, accurate = tradefed_test.parse_tradefed_result(
134 self.assertFalse(accurate)
Dtradefed_utils.py134 accurate = True
159 accurate = False
180 return waived, accurate
/external/python/rsa/rsa/
Dkey.py573 def find_p_q(nbits, getprime_func=rsa.prime.getprime, accurate=True): argument
628 if not accurate:
694 def gen_keys(nbits, getprime_func, accurate=True, exponent=DEFAULT_EXPONENT): argument
712 (p, q) = find_p_q(nbits // 2, getprime_func, accurate)
722 def newkeys(nbits, accurate=True, poolsize=1, exponent=DEFAULT_EXPONENT): argument
764 (p, q, e, d) = gen_keys(nbits, getprime_func, accurate=accurate, exponent=exponent)
/external/libjpeg-turbo/simd/i386/
Djfdctint-mmx.asm2 ; jfdctint.asm - accurate integer FDCT (MMX)
17 ; This file contains a slow-but-accurate integer implementation of the
Djidctint-sse2.asm2 ; jidctint.asm - accurate integer IDCT (SSE2)
17 ; This file contains a slow-but-accurate integer implementation of the
Djidctint-mmx.asm2 ; jidctint.asm - accurate integer IDCT (MMX)
17 ; This file contains a slow-but-accurate integer implementation of the
Djfdctint-avx2.asm2 ; jfdctint.asm - accurate integer FDCT (AVX2)
17 ; This file contains a slow-but-accurate integer implementation of the
Djidctint-avx2.asm2 ; jidctint.asm - accurate integer IDCT (AVX2)
17 ; This file contains a slow-but-accurate integer implementation of the
Djfdctint-sse2.asm2 ; jfdctint.asm - accurate integer FDCT (SSE2)
17 ; This file contains a slow-but-accurate integer implementation of the
Djfdctfst-sse2.asm17 ; This file contains a fast, not so accurate integer implementation of
Djidctfst-sse2.asm17 ; This file contains a fast, not so accurate integer implementation of
Djfdctfst-mmx.asm17 ; This file contains a fast, not so accurate integer implementation of
Djidctfst-mmx.asm17 ; This file contains a fast, not so accurate integer implementation of
/external/libjpeg-turbo/simd/x86_64/
Djfdctint-sse2.asm2 ; jfdctint.asm - accurate integer FDCT (64-bit SSE2)
17 ; This file contains a slow-but-accurate integer implementation of the
Djidctint-avx2.asm2 ; jidctint.asm - accurate integer IDCT (64-bit AVX2)
17 ; This file contains a slow-but-accurate integer implementation of the
Djidctint-sse2.asm2 ; jidctint.asm - accurate integer IDCT (64-bit SSE2)
17 ; This file contains a slow-but-accurate integer implementation of the
Djfdctint-avx2.asm2 ; jfdctint.asm - accurate integer FDCT (64-bit AVX2)
17 ; This file contains a slow-but-accurate integer implementation of the
Djfdctfst-sse2.asm17 ; This file contains a fast, not so accurate integer implementation of
Djidctfst-sse2.asm17 ; This file contains a fast, not so accurate integer implementation of
/external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/Inline/
Dinline-cold-callsite-samplepgo.ll1 ; For SamplePGO, if -profile-sample-accurate is specified, cold callsite
31 attributes #0 = { "profile-sample-accurate" }
/external/eigen/doc/
DLeastSquares.dox11 equations. Of these, the SVD decomposition is generally the most accurate but the slowest, normal
12 equations is the fastest but least accurate, and the QR decomposition is in between.
39 ColPivHouseholderQR (column pivoting, thus a bit slower but more accurate) and FullPivHouseholderQR
/external/python/cpython2/Doc/library/
Dmath.rst89 Return an accurate floating point sum of values in the iterable. Avoids
104 recipes for accurate floating point summation
174 >>> exp(1e-5) - 1 # gives result accurate to 11 places
176 >>> expm1(1e-5) # result accurate to full precision
196 result is calculated in a way which is accurate for *x* near zero.
203 Return the base-10 logarithm of *x*. This is usually more accurate
/external/python/cpython3/Doc/library/
Dmath.rst89 Return an accurate floating point sum of values in the iterable. Avoids
104 recipes for accurate floating point summation
227 of natural logarithms. This is usually more accurate than ``math.e ** x``
240 >>> exp(1e-5) - 1 # gives result accurate to 11 places
242 >>> expm1(1e-5) # result accurate to full precision
259 result is calculated in a way which is accurate for *x* near zero.
264 Return the base-2 logarithm of *x*. This is usually more accurate than
277 Return the base-10 logarithm of *x*. This is usually more accurate
/external/ltp/testcases/open_posix_testsuite/conformance/interfaces/timer_settime/
Dcoverage.txt19 to get an accurate test.

12345678910