--- jsr166/src/jsr166y/CountedCompleter.java	2012/11/23 17:50:59	1.15
+++ jsr166/src/jsr166y/CountedCompleter.java	2012/11/25 18:54:50	1.21
@@ -126,14 +126,14 @@ package jsr166y;
  *       op.apply(array[lo]);
  *     tryComplete();
  *   }
- * } }</pre>
+ * }}</pre>
  *
  * This design can be improved by noticing that in the recursive case,
  * the task has nothing to do after forking its right task, so can
  * directly invoke its left task before returning. (This is an analog
  * of tail recursion removal.)  Also, because the task returns upon
  * executing its left task (rather than falling through to invoke
- * tryComplete) the pending count is set to one:
+ * {@code tryComplete}) the pending count is set to one:
  *
  * <pre> {@code
  * class ForEach<E> ...
@@ -291,7 +291,7 @@ package jsr166y;
  *     return new MapReducer<E>(null, array, mapper, reducer,
  *                              0, array.length).invoke();
  *   }
- * } }</pre>
+ * }}</pre>
  *
  * Here, method {@code onCompletion} takes a form common to many
  * completion designs that combine results. This callback-style method
@@ -303,7 +303,7 @@ package jsr166y;
  * distinguishes cases.  Most often, when the caller is {@code this},
  * no action is necessary. Otherwise the caller argument can be used
  * (usually via a cast) to supply a value (and/or links to other
- * values) to be combined.  Asuuming proper use of pending counts, the
+ * values) to be combined.  Assuming proper use of pending counts, the
  * actions inside {@code onCompletion} occur (once) upon completion of
  * a task and its subtasks. No additional synchronization is required
  * within this method to ensure thread safety of accesses to fields of
@@ -509,7 +509,7 @@ public abstract class CountedCompleter<T
     /**
      * If the pending count is nonzero, (atomically) decrements it.
      *
-     * @return the initial (undecremented) pending count holding on entry 
+     * @return the initial (undecremented) pending count holding on entry
      * to this method
      */
     public final int decrementPendingCountUnlessZero() {
@@ -626,10 +626,12 @@ public abstract class CountedCompleter<T
      * this task's pending count is non-zero, decrements its pending
      * count and returns {@code null}.  Otherwise, returns the
      * completer.  This method can be used as part of a completion
-     * traversal loop for homogenous task hierarchies:
+     * traversal loop for homogeneous task hierarchies:
      *
      * <pre> {@code
-     * for(CountedCompleter<?> c = firstComplete(); c != null; c = c.nextComplete()) {
+     * for (CountedCompleter<?> c = firstComplete();
+     *      c != null;
+     *      c = c.nextComplete()) {
      *   // ... process c ...
      * }}</pre>
      *