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/licenses/publicdomain |
4 |
> |
* http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
|
*/ |
6 |
|
|
7 |
|
package jsr166y; |
15 |
|
* class Fibonacci extends RecursiveTask<Integer> { |
16 |
|
* final int n; |
17 |
|
* Fibonacci(int n) { this.n = n; } |
18 |
< |
* Integer compute() { |
18 |
> |
* protected Integer compute() { |
19 |
|
* if (n <= 1) |
20 |
< |
* return n; |
20 |
> |
* return n; |
21 |
|
* Fibonacci f1 = new Fibonacci(n - 1); |
22 |
|
* f1.fork(); |
23 |
|
* Fibonacci f2 = new Fibonacci(n - 2); |