| /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/chromium_org/third_party/icu/source/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.
|
| howExpensiveIs.cpp | 10 #include "sieve.h"
59 fprintf(stderr, "** Standard sieve time: %.9fs +/- %.9fs (%d iterations)\n", s,m, (int)U_LOTS_OF_TIMES);
|
| /external/icu/icu4c/source/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.
|
| howExpensiveIs.cpp | 10 #include "sieve.h"
63 fprintf(stderr, "** Standard sieve time: %.9fs +/- %.9fs (%d iterations)\n", s,m, (int)U_LOTS_OF_TIMES);
|
| /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 | 750 def GetChanges(self, sieve):
757 sieve: An update sieve to use to filter out updates the client
766 if not sieve.HasAnyTimestamp():
768 min_timestamp = sieve.GetMinTimestamp()
769 first_time_types = sieve.GetFirstTimeTypes()
773 if (sieve.GetCreateMobileBookmarks() and
792 if item.deleted or sieve.ClientWantsItem(item)]
[all...] |
| /external/chromium_org/third_party/tlslite/tlslite/utils/ |
| cryptomath.py | 218 #Pre-calculate a sieve of the ~100 primes < 1000:
220 sieve = list(range(n))
222 if sieve[count] == 0:
224 x = sieve[count] * 2
225 while x < len(sieve):
226 sieve[x] = 0
227 x += sieve[count]
228 sieve = [x for x in sieve[2:] if x]
229 return sieve
231 sieve = makeSieve(1000) variable
[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(){
|
| /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/openssl/crypto/dh/ |
| generate | 51 If you want this, you should restrict your sieve accordingly.
|
| /external/chromium_org/sync/test/fake_server/ |
| fake_server.cc | 277 scoped_ptr<UpdateSieve> sieve = UpdateSieve::Create(get_updates); local
289 if (sieve->ClientWantsItem(entity)) {
311 sieve->UpdateProgressMarkers(max_response_version, response);
|
| /external/llvm/test/Transforms/IndVarSimplify/ |
| udiv.ll | 9 ; original code. This comes from SingleSource/Benchmarks/Shootout/sieve.c.
|
