--- jsr166/src/test/loops/ScalarLongSort.java	2011/08/19 11:25:04	1.9
+++ jsr166/src/test/loops/ScalarLongSort.java	2012/10/21 06:14:12	1.11
@@ -13,7 +13,7 @@ class ScalarLongSort {
     static int THRESHOLD = -1;
     static final boolean warmup = true;
 
-    public static void main (String[] args) throws Exception {
+    public static void main(String[] args) throws Exception {
         int procs = 0;
         int n = 1 << 22;
         int reps = 20;
@@ -148,7 +148,6 @@ class ScalarLongSort {
          * and finding index of right closest to split point.
          * Uses left-spine decomposition to generate all
          * merge tasks before bottomming out at base case.
-         *
          */
         public final void compute() {
             Merger rights = null;
@@ -209,7 +208,7 @@ class ScalarLongSort {
 
     }
 
-    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]) {