Here's a fixed precision implementation of a prime iterator, along the lines Chris Menzel described.
package foo;
import java.util.Iterator;
public class PrimeIterator implements Iterator<Integer> {
private Integer n = 2;
@Override
public boolean hasNext() {
// Thanks to Euclid :-D
return true;
}
private boolean isPrime(Integer n) {
Integer i = 2;
while (i < n) {
if ((n % i) == 0) {
// divisible by i < n
return false;
}
i++;
}
return true;
}
@Override
public Integer next() {
while (!isPrime(n)) {
n++;
}
Integer tmp = n;
n++;
return tmp;
}
@Override
public void remove() {
throw new UnsupportedOperationException();
}
public static void main(String[] argz) {
PrimeIterator iter = new PrimeIterator();
while (iter.hasNext()) {
System.out.println(iter.next());
}
}
}
Bill Andersen
3600 O'Donnell Street, Suite 600
Baltimore, MD 21224
Office: +1.410.675.1201
Cell: +1.443.858.6444
Fax: +1.410.675.1204