26 |
|
new RCCFib(f, n - 2).fork(); |
27 |
|
f = new LCCFib(f, --n); |
28 |
|
} |
29 |
< |
f.number = n <= 1? n : seqFib(n); |
29 |
> |
f.number = (n <= 1) ? n : seqFib(n); |
30 |
|
f.onCompletion(f); |
31 |
|
if ((p = f.getCompleter()) != null) |
32 |
|
p.tryComplete(); |
33 |
< |
else |
34 |
< |
f.quietlyComplete(); |
33 |
> |
else |
34 |
> |
f.quietlyComplete(); |
35 |
|
} |
36 |
|
|
37 |
|
static final class LCCFib extends CCFib { |
47 |
|
number = n; |
48 |
|
} |
49 |
|
} |
50 |
< |
|
50 |
> |
|
51 |
|
static final class RCCFib extends CCFib { |
52 |
|
public RCCFib(CountedCompleter parent, int n) { |
53 |
|
super(parent, n); |
61 |
|
number = n; |
62 |
|
} |
63 |
|
} |
64 |
< |
|
64 |
> |
|
65 |
|
static long lastStealCount; |
66 |
|
|
67 |
|
public static void main(String[] args) throws Exception { |
120 |
|
} |
121 |
|
|
122 |
|
} |
123 |
– |
|
124 |
– |
|