Searched refs:isPrime (Results 1 - 6 of 6) sorted by relevance

/external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9/
H A Dbitops-nsieve-bits.js12 function primes(isPrime, n) {
15 for (i=0; i<size; i++) isPrime[i] = 0xffffffff;
18 if (isPrime[i>>5] & 1<<(i&31)) {
20 isPrime[j>>5] &= ~(1<<(j&31));
27 var isPrime = new Array((10000<<i)+31>>5);
28 primes(isPrime, i);
H A Daccess-nsieve.js15 function nsieve(m, isPrime){
18 for (i=2; i<=m; i++) { isPrime[i] = true; }
22 if (isPrime[i]) {
23 for (k=i+i; k<=m; k+=i) isPrime[k] = false;
/external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/
H A Dbitops-nsieve-bits.js12 function primes(isPrime, n) {
15 for (i=0; i<size; i++) isPrime[i] = 0xffffffff;
18 if (isPrime[i>>5] & 1<<(i&31)) {
20 isPrime[j>>5] &= ~(1<<(j&31));
27 var isPrime = new Array((10000<<i)+31>>5);
28 primes(isPrime, i);
H A Daccess-nsieve.js15 function nsieve(m, isPrime){
18 for (i=2; i<=m; i++) { isPrime[i] = true; }
22 if (isPrime[i]) {
23 for (k=i+i; k<=m; k+=i) isPrime[k] = false;
/external/v8/test/mjsunit/
H A Dapply.js142 function isPrime(possible_prime) { function
154 if (isPrime(i)) {
/external/apache-harmony/math/src/test/java/tests/api/java/math/
H A DBigIntegerTest.java211 if (isPrime(a)) {
979 private boolean isPrime(long b) { method in class:BigIntegerTest

Completed in 152 milliseconds