--- jsr166/src/test/loops/BinaryAsyncAction.java	2012/01/28 04:41:18	1.5
+++ jsr166/src/test/loops/BinaryAsyncAction.java	2012/11/25 21:37:28	1.8
@@ -1,7 +1,7 @@
 /*
  * 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/publicdomain/zero/1.0/
  */
 
 import java.util.concurrent.*;
@@ -15,11 +15,11 @@ import java.util.concurrent.atomic.*;
  * BinaryAsyncActions are simpler to use and have less overhead in
  * typical uasges but are restricted to binary computation trees.
  *
- * <p> Upon construction, an BinaryAsyncAction does not bear any
+ * <p>Upon construction, an BinaryAsyncAction does not bear any
  * linkages. For non-root tasks, links must be established using
  * method <tt>linkSubtasks</tt> before use.
  *
- * <p> <b>Sample Usage.</b>  A version of Fibonacci:
+ * <p><b>Sample Usage.</b>  A version of Fibonacci:
  * <pre>
  * class Fib extends BinaryAsyncAction {
  *   final int n;
@@ -34,7 +34,7 @@ import java.util.concurrent.atomic.*;
  *     }
  *   }
  *   protected void onComplete(BinaryAsyncAction x, BinaryAsyncAction y) {
- *      result = ((Fib)x).result + ((Fib)y).result;
+ *     result = ((Fib)x).result + ((Fib)y).result;
  *   }
  * }
  * </pre>