--- jsr166/src/jsr166y/RecursiveTask.java	2009/07/20 22:40:09	1.4
+++ jsr166/src/jsr166y/RecursiveTask.java	2009/08/01 21:17:11	1.10
@@ -7,8 +7,9 @@
 package jsr166y;
 
 /**
- * Recursive result-bearing ForkJoinTasks.
- * <p> For a classic example, here is a task computing Fibonacci numbers:
+ * A recursive result-bearing {@link ForkJoinTask}.
+ *
+ * <p>For a classic example, here is a task computing Fibonacci numbers:
  *
  *  <pre> {@code
  * class Fibonacci extends RecursiveTask<Integer> {
@@ -32,17 +33,14 @@ 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<V> extends ForkJoinTask<V> {
+    private static final long serialVersionUID = 5232453952276485270L;
 
     /**
-     * Empty constructor for use by subclasses.
-     */
-    protected RecursiveTask() {
-    }
-
-    /**
-     * The result returned by compute method.
+     * The result of the computation.
      */
     V result;
 
@@ -60,7 +58,7 @@ public abstract class RecursiveTask<V> e
     }
 
     /**
-     * Implements execution conventions for RecursiveTask
+     * Implements execution conventions for RecursiveTask.
      */
     protected final boolean exec() {
         result = compute();