35 |
|
return; |
36 |
|
} |
37 |
|
for (int reps = 0; reps < 2; ++reps) { |
38 |
< |
ForkJoinPool g = (procs == 0) ? |
39 |
< |
new ForkJoinPool() : |
38 |
> |
ForkJoinPool g = (procs == 0) ? new ForkJoinPool() : |
39 |
|
new ForkJoinPool(procs); |
40 |
|
lastStealCount = g.getStealCount(); |
41 |
|
for (int i = FIRST_SIZE; i <= LAST_SIZE; i++) |
53 |
|
g.invoke(task); |
54 |
|
int solutions = task.solutions; |
55 |
|
long time = System.nanoTime() - start; |
56 |
< |
double secs = (double) time / NPS; |
56 |
> |
double secs = ((double)time) / NPS; |
57 |
|
if (solutions != expectedSolutions[i]) |
58 |
|
throw new Error(); |
59 |
|
System.out.printf("NQueensCS %3d", i); |