| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-0.9/ |
| access-nsieve.js | 30 function sieve() { function
38 sieve();
|
| bitops-nsieve-bits.js | 25 function sieve() { function
32 sieve();
|
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/ |
| access-nsieve.js | 30 function sieve() { function
38 sieve();
|
| bitops-nsieve-bits.js | 25 function sieve() { function
32 sieve();
|
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-1.0/ |
| access-nsieve.js | 30 function sieve() { function
38 sieve();
|
| bitops-nsieve-bits.js | 25 function sieve() { function
33 var result = sieve();
|
| /external/icu4c/test/perf/howExpensiveIs/ |
| sieve.h | 17 * Calculate the standardized sieve time (1 run)
31 * Get the standardized sieve time. (Doesn't recalculate if already computed.
|
| sieve.cpp | 13 #include "sieve.h"
15 /* prime number sieve */
26 char sieve[SIEVE_SIZE]; local
32 sieve[j]=1;
34 sieve[0]=0;
45 sieve[k]=0;
50 printf("sieve %d: %.9f\n", SIEVE_SIZE,utimer_getDeltaSeconds(&a,&b));
55 if(sieve[i]) {
65 if(sieve[i]) k++;
202 printf("sieve: %d/%d: %.9f\n", i,SAMPLES, times[i])
[all...] |
| Makefile.in | 26 OBJECTS = howExpensiveIs.o sieve.o
|
| readme.txt | 22 ***** Attribute 'standardizedTime': The SieveTest by definition has a standardized test of 1, it runs a prime number sieve as a benchmark. All other standardizedTimes are normalized against this value.
|
| /external/chromium_org/sync/tools/testserver/ |
| chromiumsync_test.py | 318 sieve = chromiumsync.UpdateSieve(msg)
319 self.assertEqual(sieve._state,
325 sieve.SaveProgress(15412, response)
330 sieve.SaveProgress(15413, response)
343 sieve = chromiumsync.UpdateSieve(msg)
344 self.assertEqual(sieve._state,
350 sieve.SaveProgress(15413, response)
366 sieve = chromiumsync.UpdateSieve(msg)
367 self.assertEqual(sieve._state,
372 sieve.SaveProgress(1, response
[all...] |
| chromiumsync.py | 707 def GetChanges(self, sieve):
714 sieve: An update sieve to use to filter out updates the client
723 if not sieve.HasAnyTimestamp():
725 min_timestamp = sieve.GetMinTimestamp()
726 first_time_types = sieve.GetFirstTimeTypes()
730 if (sieve.GetCreateMobileBookmarks() and
749 if item.deleted or sieve.ClientWantsItem(item)]
[all...] |
| /external/chromium_org/third_party/tlslite/tlslite/utils/ |
| cryptomath.py | 323 #Pre-calculate a sieve of the ~100 primes < 1000:
325 sieve = range(n)
327 if sieve[count] == 0:
329 x = sieve[count] * 2
330 while x < len(sieve):
331 sieve[x] = 0
332 x += sieve[count]
333 sieve = [x for x in sieve[2:] if x]
334 return sieve
336 sieve = makeSieve(1000) variable
[all...] |
| /external/chromium/net/tools/testserver/ |
| chromiumsync_test.py | 353 sieve = chromiumsync.UpdateSieve(msg)
354 self.assertEqual(sieve._state,
360 sieve.SaveProgress(15412, response)
365 sieve.SaveProgress(15413, response)
378 sieve = chromiumsync.UpdateSieve(msg)
379 self.assertEqual(sieve._state,
385 sieve.SaveProgress(15413, response)
401 sieve = chromiumsync.UpdateSieve(msg)
402 self.assertEqual(sieve._state,
407 sieve.SaveProgress(1, response
[all...] |
| chromiumsync.py | 455 def GetChanges(self, sieve):
462 sieve: An update sieve to use to filter out updates the client
471 if not sieve.HasAnyTimestamp():
473 min_timestamp = sieve.GetMinTimestamp()
474 self._CreatePermanentItems(sieve.GetFirstTimeTypes())
488 if item.deleted or sieve.ClientWantsItem(item)]
[all...] |
| /external/chromium_org/third_party/WebKit/PerformanceTests/Dromaeo/resources/dromaeo/web/tests/ |
| sunspider-access-nsieve.html | 36 test( "N-Sieve", function(){
|
| sunspider-bitops-nsieve-bits.html | 33 test( "N-Sieve Bits", function(){
|
| /external/openssh/ |
| moduli.c | 32 * Sieve candidates for "safe" primes,
98 * Constant: when used with 32-bit integers, the largest sieve prime
103 /* Constant: can sieve all primes less than 2**32, as 65537**2 > 2**32-1. */
128 /* sieve 2**16 */
131 /* sieve 2**30 in 2**16 parts */
134 /* sieve relative to the initial value */
175 ** Sieve p's and q's with small factors
193 * The sieve omits p's and q's divisible by 2, so ensure that
194 * largebase+u is odd. Then, step through the sieve in
214 * The sieve omits p's divisible by 4, so ensure tha
[all...] |
| moduli.0 | 42 0x02 Sieve of Eratosthenes.
46 Sieve of Eratosthenes (flag 0x02). Subsequent
|
| moduli.5 | 85 Sieve of Eratosthenes.
92 moduli candidate generation uses the Sieve of Eratosthenes (flag 0x02).
|
| /external/dropbear/libtommath/ |
| bn_mp_prime_next_prime.c | 69 /* fall through to the sieve */
79 /* at this point we will use a combination of a sieve and Miller-Rabin */
139 /* if didn't pass sieve and step == MAX then skip test */
|
| /libcore/luni/src/main/java/java/math/ |
| Primality.java | 78 * It uses the sieve of Eratosthenes to discard several composite numbers in
81 * not discarded in the sieve.
|
| /external/chromium_org/third_party/openssl/openssl/crypto/dh/ |
| generate | 51 If you want this, you should restrict your sieve accordingly.
|
| /external/openssl/crypto/dh/ |
| generate | 51 If you want this, you should restrict your sieve accordingly.
|
| /external/llvm/test/Transforms/IndVarSimplify/ |
| udiv.ll | 9 ; original code. This comes from SingleSource/Benchmarks/Shootout/sieve.c.
|
