--- jsr166/src/jsr166y/CountedCompleter.java	2012/11/14 17:20:37	1.10
+++ jsr166/src/jsr166y/CountedCompleter.java	2012/11/18 18:03:10	1.13
@@ -77,7 +77,7 @@ package jsr166y;
  * continuations, other threads need not block waiting to perform
  * them.
  *
- * <p> For example, here is an initial version of a class that uses
+ * <p>For example, here is an initial version of a class that uses
  * divide-by-two recursive decomposition to divide work into single
  * pieces (leaf tasks). Even when work is split into individual calls,
  * tree-based techniques are usually preferable to directly forking
@@ -142,7 +142,7 @@ package jsr166y;
  *
  * As a further improvement, notice that the left task need not even
  * exist.  Instead of creating a new one, we can iterate using the
- * original task, and add a pending count for each fork. 
+ * original task, and add a pending count for each fork.
  *
  * <pre> {@code
  * class ForEach<E> ...
@@ -477,6 +477,7 @@ public abstract class CountedCompleter<T
             throw new Error(e);
         }
     }
+
     /**
      * Returns a sun.misc.Unsafe.  Suitable for use in a 3rd party package.
      * Replace with a simple call to Unsafe.getUnsafe when integrating
@@ -504,5 +505,4 @@ public abstract class CountedCompleter<T
             }
         }
     }
-
 }