15 #include "primeNumberGenerator.h"
23 PrimeNumberGenerator::
24 PrimeNumberGenerator() {
42 int candidate = _primes.back() + 1;
43 while ((
int)_primes.size() <= n) {
46 bool maybe_prime =
true;
48 while (maybe_prime && _primes[j] * _primes[j] <= candidate) {
49 if ((_primes[j] * (candidate / _primes[j])) == candidate) {
54 nassertr(j < (
int)_primes.size(), 0);
58 _primes.push_back(candidate);