--- jsr166/src/jsr166y/RecursiveTask.java 2009/01/06 14:30:31 1.1 +++ jsr166/src/jsr166y/RecursiveTask.java 2011/03/15 19:47:02 1.11 @@ -1,29 +1,29 @@ /* * Written by Doug Lea with assistance from members of JCP JSR-166 * Expert Group and released to the public domain, as explained at - * http://creativecommons.org/licenses/publicdomain + * http://creativecommons.org/publicdomain/zero/1.0/ */ package jsr166y; /** - * Recursive result-bearing ForkJoinTasks. - *
For a classic example, here is a task computing Fibonacci numbers: + * A recursive result-bearing {@link ForkJoinTask}. * - *
- * 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 @@ -31,24 +31,21 @@ package jsr166y; * subtasks are too small to be worthwhile splitting up. Instead, as * is the case for nearly all fork/join applications, you'd pick some * minimum granularity size (for example 10 here) for which you always - * sequentially solve rather than subdividing. + * sequentially solve rather than subdividing. * + * @since 1.7 + * @author Doug Lea */ public abstract class RecursiveTaskFor a classic example, here is a task computing Fibonacci numbers: + * + *
{@code + * class Fibonacci extends RecursiveTask+ * }}{ * final int n; - * Fibonnaci(int n) { this.n = 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(); * } - * } - *