21 |
|
* Here is a complete (although naive) prime filter program: |
22 |
|
* <pre> |
23 |
|
* import java.math.BigInteger; |
24 |
< |
* import jsr166y.forkjoin.*; |
25 |
< |
* import static jsr166y.forkjoin.Ops.*; |
26 |
< |
* import static jsr166y.forkjoin.ParallelLongArray.*; |
24 |
> |
* import jsr166y.*; |
25 |
> |
* import static extra166y.Ops.*; |
26 |
> |
* import static extra166y.ParallelLongArray.*; |
27 |
|
* |
28 |
|
* public class Sieve { |
29 |
|
* public static void main(String[] args) { |
47 |
|
* static LongPredicate notDivisibleBy(final long p) { |
48 |
|
* return new LongPredicate() { |
49 |
|
* public boolean op(long n) { return n <= p || (n % p) != 0; } |
50 |
< |
* } } |
50 |
> |
* }; } |
51 |
|
* static LongPredicate notProbablePrime = new LongPredicate() { |
52 |
|
* private static final int CERTAINTY = 8; |
53 |
|
* public boolean op(long n) { |
54 |
|
* return !BigInteger.valueOf(n).isProbablePrime(CERTAINTY); |
55 |
|
* } |
56 |
< |
* } |
56 |
> |
* }; |
57 |
|
* } |
58 |
|
* </pre> |
59 |
|
*/ |