--- jsr166/src/test/loops/BoxedLongSort.java	2010/09/20 20:42:37	1.2
+++ jsr166/src/test/loops/BoxedLongSort.java	2011/03/15 19:47:05	1.5
@@ -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.*;
@@ -30,7 +30,7 @@ class BoxedLongSort {
             System.out.println("Usage: java BoxedLongSort threads n reps");
             return;
         }
-        ForkJoinPool pool = procs == 0? new ForkJoinPool() :
+        ForkJoinPool pool = (procs == 0) ? new ForkJoinPool() :
             new ForkJoinPool(procs);
 
         Long[] a = new Long[n];
@@ -88,7 +88,7 @@ class BoxedLongSort {
             this.a = a; this.w = w; this.origin = origin; this.n = n;
         }
 
-        public void compute()  {
+        public void compute() {
             int l = origin;
             if (n <= THRESHOLD)
                 Arrays.sort(a, l, l+n);
@@ -206,7 +206,7 @@ class BoxedLongSort {
 
     }
 
-    static void checkSorted (Long[] a)  {
+    static void checkSorted (Long[] a) {
         int n = a.length;
         for (int i = 0; i < n - 1; i++) {
             if (a[i] > a[i+1]) {