/** * Find next prime number greater than minimum. * * @param minimum The minimum (exclusive) value of the next prime number. * @return The next prime number greater than minimum. */ private long nextPrime(final long minimum) { long candidate = ((minimum + 1) / 2) * 2 + 1; while (!isPrime(candidate)) { candidate += 2; } return candidate; }
return; nextCapacity = nextPrime(nextCapacity); if (nextCapacity > Integer.MAX_VALUE) { return;