--- jsr166/src/jsr166y/RecursiveTask.java 2009/07/20 22:26:04 1.3 +++ jsr166/src/jsr166y/RecursiveTask.java 2009/07/22 19:04:11 1.6 @@ -10,20 +10,19 @@ package jsr166y; * Recursive result-bearing ForkJoinTasks. *
For a classic example, here is a task computing Fibonacci numbers: * - *
- * class Fibonacci extends RecursiveTask<Integer> { + ** * However, besides being a dumb way to compute Fibonacci functions * (there is a simple fast linear algorithm that you'd use in @@ -33,16 +32,12 @@ package jsr166y; * minimum granularity size (for example 10 here) for which you always * sequentially solve rather than subdividing. * + * @since 1.7 + * @author Doug Lea */ public abstract class RecursiveTask{@code + * class Fibonacci extends RecursiveTask+ * }}{ * final int n; * Fibonacci(int n) { this.n = n; } * Integer compute() { - * if (n <= 1) + * if (n <= 1) * return n; * Fibonacci f1 = new Fibonacci(n - 1); * f1.fork(); * Fibonacci f2 = new Fibonacci(n - 2); * return f2.compute() + f1.join(); * } - * } - *