HomeSort by relevance Sort by last modified time
    Searched refs:isPrime (Results 1 - 9 of 9) sorted by null

  /external/webkit/SunSpider/tests/sunspider-0.9/
bitops-nsieve-bits.js 12 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);
access-nsieve.js 15 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/SunSpider/tests/sunspider-0.9.1/
bitops-nsieve-bits.js 12 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);
access-nsieve.js 15 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;
  /dalvik/libcore/math/src/main/java/java/math/
Primality.java 143 if (probPrime.isPrime(100, null, null)) {
BigInt.java 392 public boolean isPrime(int certainty, Random rnd, Context t) {
BigInteger.java     [all...]
  /external/v8/test/mjsunit/
apply.js 146 function isPrime(possible_prime) {
158 if (isPrime(i)) {
  /dalvik/libcore/math/src/test/java/tests/api/java/math/
BigIntegerTest.java 306 if (isPrime(a)) {
    [all...]

Completed in 46 milliseconds