--- jsr166/src/test/loops/BoxedLongSort.java	2012/05/05 17:09:23	1.8
+++ jsr166/src/test/loops/BoxedLongSort.java	2015/08/10 03:13:33	1.12
@@ -4,8 +4,8 @@
  * http://creativecommons.org/publicdomain/zero/1.0/
  */
 
-import java.util.concurrent.*;
 import java.util.*;
+import java.util.concurrent.*;
 
 class BoxedLongSort {
     static final long NPS = (1000L * 1000 * 1000);
@@ -165,7 +165,6 @@ class BoxedLongSort {
          * 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;
@@ -218,7 +217,6 @@ class BoxedLongSort {
             //            merge(nleft, nright);
             if (rights != null)
                 collectRights(rights);
-
         }
 
         final void merge(int nleft, int nright) {
@@ -290,7 +288,6 @@ class BoxedLongSort {
         }
     }
 
-
     static final class RandomRepacker extends RecursiveAction {
         final Long[] src;
         final Long[] dst;