# | Line 13 | Line 13 | import java.util.concurrent.*; | |
---|---|---|
13 | * fibonacci(0) = 0; | |
14 | * fibonacci(1) = 1. | |
15 | * </pre> | |
16 | < | **/ |
17 | < | |
16 | > | */ |
17 | public final class Fib extends RecursiveAction { | |
18 | ||
19 | // Performance-tuning constant: | |
# | Line 40 | Line 39 | public final class Fib extends Recursive | |
39 | } | |
40 | ||
41 | for (int reps = 0; reps < 2; ++reps) { | |
42 | < | ForkJoinPool g = procs == 0? new ForkJoinPool() : |
42 | > | ForkJoinPool g = (procs == 0) ? new ForkJoinPool() : |
43 | new ForkJoinPool(procs); | |
44 | lastStealCount = g.getStealCount(); | |
45 | for (int i = 0; i < 20; ++i) { |
– | Removed lines |
+ | Added lines |
< | Changed lines |
> | Changed lines |