--- jsr166/src/jsr166y/RecursiveTask.java	2009/01/06 14:30:31	1.1
+++ jsr166/src/jsr166y/RecursiveTask.java	2009/07/20 22:26:04	1.3
@@ -13,7 +13,7 @@ package jsr166y;
  * <pre>
  * class Fibonacci extends RecursiveTask&lt;Integer&gt; {
  *   final int n;
- *   Fibonnaci(int n) { this.n = n; }
+ *   Fibonacci(int n) { this.n = n; }
  *   Integer compute() {
  *     if (n &lt;= 1)
  *        return n;
@@ -31,13 +31,13 @@ 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.
  *
  */
 public abstract class RecursiveTask<V> extends ForkJoinTask<V> {
 
     /**
-     * Empty contructor for use by subclasses.
+     * Empty constructor for use by subclasses.
      */
     protected RecursiveTask() {
     }
@@ -48,7 +48,7 @@ public abstract class RecursiveTask<V> e
     V result;
 
     /**
-     * The main computation performed by this task. 
+     * The main computation performed by this task.
      */
     protected abstract V compute();