1 |
+ |
/* |
2 |
+ |
* Written by Doug Lea with assistance from members of JCP JSR-166 |
3 |
+ |
* Expert Group and released to the public domain, as explained at |
4 |
+ |
* http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
+ |
*/ |
6 |
+ |
|
7 |
|
import java.util.concurrent.*; |
8 |
|
|
9 |
|
public final class DynamicFib extends RecursiveAction { |
27 |
|
return; |
28 |
|
} |
29 |
|
for (int reps = 0; reps < 2; ++reps) { |
30 |
< |
ForkJoinPool pool = procs == 0? new ForkJoinPool() : |
30 |
> |
ForkJoinPool pool = (procs == 0) ? new ForkJoinPool() : |
31 |
|
new ForkJoinPool(procs); |
32 |
< |
for (int i = 0; i < 20; ++i) |
32 |
> |
for (int i = 0; i < 20; ++i) |
33 |
|
test(pool, num); |
34 |
|
System.out.println(pool); |
35 |
|
pool.shutdown(); |
54 |
|
System.out.println(); |
55 |
|
} |
56 |
|
|
51 |
– |
|
57 |
|
int number; // Initialized with argument; replaced with result |
58 |
|
DynamicFib(int n) { number = n; } |
59 |
< |
public void compute() { |
60 |
< |
number = fib(number); |
59 |
> |
public void compute() { |
60 |
> |
number = fib(number); |
61 |
|
} |
62 |
|
|
63 |
|
static int fib(int n) { |
64 |
|
int res; |
65 |
< |
if (n <= 1) |
65 |
> |
if (n <= 1) |
66 |
|
res = n; |
67 |
|
else if (getSurplusQueuedTaskCount() >= 4) |
68 |
|
res = seqFib(n); |
91 |
|
} |
92 |
|
|
93 |
|
} |
89 |
– |
|