--- jsr166/src/test/loops/ScalarLongSort.java	2011/10/10 16:59:04	1.10
+++ jsr166/src/test/loops/ScalarLongSort.java	2015/08/10 03:13:33	1.14
@@ -4,8 +4,8 @@
  * http://creativecommons.org/publicdomain/zero/1.0/
  */
 
-import java.util.concurrent.*;
 import java.util.*;
+import java.util.concurrent.*;
 
 class ScalarLongSort {
     static final long NPS = (1000L * 1000 * 1000);
@@ -78,7 +78,6 @@ class ScalarLongSort {
         }
         System.out.println(pool);
 
-
         pool.shutdown();
     }
 
@@ -148,7 +147,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;
@@ -176,7 +174,6 @@ class ScalarLongSort {
             merge(nleft, nright);
             if (rights != null)
                 collectRights(rights);
-
         }
 
         final void merge(int nleft, int nright) {
@@ -247,6 +244,4 @@ class ScalarLongSort {
             }
         }
     }
-
-
 }