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

  /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-1.0/
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);
30 return isPrime;
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/chromium_org/third_party/WebKit/PerformanceTests/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/chromium_org/third_party/WebKit/PerformanceTests/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;
  /libcore/luni/src/main/java/java/math/
Primality.java 136 if (probPrime.isPrime(100)) {
BigInt.java 345 boolean isPrime(int certainty) {
BigInteger.java     [all...]
  /external/chromium_org/third_party/tlslite/tlslite/utils/
cryptomath.py 338 def isPrime(n, iterations=5, display=False):
383 if isPrime(p, display=display):
407 if isPrime(q, 0, display=display):
409 if isPrime(p, display=display):
410 if isPrime(q, display=display):
  /libcore/luni/src/test/java/tests/api/java/math/
OldBigIntegerTest.java 138 if (isPrime(a)) {
356 private boolean isPrime(long b) {
  /external/chromium_org/v8/test/mjsunit/
apply.js 142 function isPrime(possible_prime) {
154 if (isPrime(i)) {
  /external/v8/test/mjsunit/
apply.js 142 function isPrime(possible_prime) {
154 if (isPrime(i)) {
  /libcore/harmony-tests/src/test/java/tests/api/java/math/
BigIntegerTest.java 186 if (isPrime(a)) {
954 private boolean isPrime(long b) {
  /prebuilts/devtools/tools/lib/
bcprov-jdk15on-1.48.jar 
  /prebuilts/tools/common/m2/repository/org/bouncycastle/bcprov-jdk15on/1.48/
bcprov-jdk15on-1.48.jar 

Completed in 132 milliseconds