82 |
|
} |
83 |
|
int pass = 0; |
84 |
|
int ps = 2; |
85 |
< |
ForkJoinPool fjp = new ForkJoinPool(ps); |
85 |
> |
ForkJoinPool fjp = new ForkJoinPool(); |
86 |
|
ParallelArray<Rand> pa = ParallelArray.createUsingHandoff(array, fjp); |
87 |
|
for (;;) { |
88 |
|
last = System.nanoTime(); |
111 |
|
ps >>>= 1; |
112 |
|
} |
113 |
|
// pa.apply(nextRand); |
114 |
< |
fjp.setParallelism(ps); |
114 |
> |
// fjp.setParallelism(ps); |
115 |
|
} |
116 |
|
fjp.shutdownNow(); |
117 |
|
fjp.awaitTermination(1, TimeUnit.SECONDS); |
121 |
|
* Unsynchronized version of java.util.Random algorithm. |
122 |
|
*/ |
123 |
|
static final class Rand { |
124 |
< |
private final static long multiplier = 0x5DEECE66DL; |
125 |
< |
private final static long addend = 0xBL; |
126 |
< |
private final static long mask = (1L << 48) - 1; |
124 |
> |
private static final long multiplier = 0x5DEECE66DL; |
125 |
> |
private static final long addend = 0xBL; |
126 |
> |
private static final long mask = (1L << 48) - 1; |
127 |
|
private long seed; |
128 |
|
|
129 |
|
Rand(long s) { |