--- jsr166/src/test/loops/Fib.java	2010/09/20 20:42:37	1.2
+++ jsr166/src/test/loops/Fib.java	2015/01/15 18:34:19	1.7
@@ -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/licenses/publicdomain
+ * http://creativecommons.org/publicdomain/zero/1.0/
  */
 
 import java.util.concurrent.*;
@@ -13,8 +13,7 @@ import java.util.concurrent.*;
  *          fibonacci(0) = 0;
  *          fibonacci(1) = 1.
  * </pre>
- **/
-
+ */
 public final class Fib extends RecursiveAction {
 
     // Performance-tuning constant:
@@ -40,7 +39,7 @@ public final class Fib extends Recursive
         }
 
         for (int reps = 0; reps < 2; ++reps) {
-            ForkJoinPool g = procs == 0? new ForkJoinPool() :
+            ForkJoinPool g = (procs == 0) ? new ForkJoinPool() :
                 new ForkJoinPool(procs);
             lastStealCount = g.getStealCount();
             for (int i = 0; i < 20; ++i) {
@@ -57,7 +56,6 @@ public final class Fib extends Recursive
         }
     }
 
-
     /** for time conversion */
     static final long NPS = (1000L * 1000 * 1000);
 
@@ -81,7 +79,6 @@ public final class Fib extends Recursive
         System.out.println();
     }
 
-
     // Initialized with argument; replaced with result
     int number;
 
@@ -117,4 +114,3 @@ public final class Fib extends Recursive
     }
 
 }
-