--- jsr166/src/jsr166y/RecursiveTask.java 2009/07/22 19:04:11 1.6 +++ jsr166/src/jsr166y/RecursiveTask.java 2013/07/26 16:36:21 1.13 @@ -1,22 +1,23 @@ /* * 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}. + * + *
For a classic example, here is a task computing Fibonacci numbers: * *
{@code * class Fibonacci extends RecursiveTask{ * final int n; * Fibonacci(int n) { this.n = n; } - * Integer compute() { + * protected Integer compute() { * if (n <= 1) - * return n; + * return n; * Fibonacci f1 = new Fibonacci(n - 1); * f1.fork(); * Fibonacci f2 = new Fibonacci(n - 2); @@ -36,9 +37,10 @@ package jsr166y; * @author Doug Lea */ public abstract class RecursiveTask extends ForkJoinTask { + private static final long serialVersionUID = 5232453952276485270L; /** - * The result returned by compute method. + * The result of the computation. */ V result; @@ -56,7 +58,7 @@ public abstract class RecursiveTask e } /** - * Implements execution conventions for RecursiveTask + * Implements execution conventions for RecursiveTask. */ protected final boolean exec() { result = compute();