belsrc/worker-promise

View on GitHub
example/prime-numbers/prime-num.js

Summary

Maintainability
A
0 mins
Test Coverage
/* eslint-disable */
// Sieve of Eratosthenes prime implementation
const getPrimes = (max) => {
  const arr = [];

  for (let i = 2; i <= max; ++i) {
    if (arr.every((p) => i % p)) {
      arr.push(i);
    }
  }

  return arr;
};

export default getPrimes;