()
| 1 | function* primes() { |
| 2 | let found = []; |
| 3 | for (let n = 2;; n++) { |
| 4 | let skip = false, root = Math.sqrt(n); |
| 5 | for (let prev of found) { |
| 6 | if (prev > root) { |
| 7 | break; |
| 8 | } else if (n % prev == 0) { |
| 9 | skip = true; |
| 10 | break; |
| 11 | } |
| 12 | } |
| 13 | if (!skip) { |
| 14 | found.push(n); |
| 15 | yield n; |
| 16 | } |
| 17 | } |
| 18 | } |
| 19 | |
| 20 | function measurePrimes() { |
| 21 | let iter = primes(), t0 = Date.now(); |