# | Line 7 | Line 7 | import java.util.concurrent.*; | |
---|---|---|
7 | * fibonacci(0) = 0; | |
8 | * fibonacci(1) = 1. | |
9 | * </pre> | |
10 | < | **/ |
11 | < | |
10 | > | */ |
11 | public final class FibTask extends RecursiveTask<Integer> { | |
12 | ||
13 | // Performance-tuning constant: | |
# | Line 34 | Line 33 | public final class FibTask extends Recur | |
33 | } | |
34 | ||
35 | for (int reps = 0; reps < 2; ++reps) { | |
36 | < | ForkJoinPool g = procs == 0? new ForkJoinPool() : |
36 | > | ForkJoinPool g = (procs == 0) ? new ForkJoinPool() : |
37 | new ForkJoinPool(procs); | |
38 | lastStealCount = g.getStealCount(); | |
39 | for (int i = 0; i < 20; ++i) { |
– | Removed lines |
+ | Added lines |
< | Changed lines |
> | Changed lines |