/js/src/jit-test/tests/sunspider/check-bitops-nsieve-bits.js

http://github.com/zpao/v8monkey · JavaScript · 40 lines · 27 code · 9 blank · 4 comment · 7 complexity · 6edba1f5f3ad6508afab2fe283e40429 MD5 · raw file

  1. // The Great Computer Language Shootout
  2. // http://shootout.alioth.debian.org
  3. //
  4. // Contributed by Ian Osgood
  5. var result = [];
  6. function pad(n,width) {
  7. var s = n.toString();
  8. while (s.length < width) s = ' ' + s;
  9. return s;
  10. }
  11. function primes(isPrime, n) {
  12. var i, count = 0, m = 10000<<n, size = m+31>>5;
  13. for (i=0; i<size; i++) isPrime[i] = 0xffffffff;
  14. for (i=2; i<m; i++)
  15. if (isPrime[i>>5] & 1<<(i&31)) {
  16. for (var j=i+i; j<m; j+=i)
  17. result.push(isPrime[j>>5] &= ~(1<<(j&31)));
  18. count++;
  19. }
  20. }
  21. function sieve() {
  22. for (var i = 4; i <= 4; i++) {
  23. var isPrime = new Array((10000<<i)+31>>5);
  24. primes(isPrime, i);
  25. }
  26. }
  27. sieve();
  28. var ret = 0;
  29. for (var i = 0; i < result.length; ++i)
  30. ret += result[i];
  31. assertEq(ret, -211235557404919)