--- jsr166/src/test/loops/OfferPollLoops.java	2010/09/19 12:55:37	1.4
+++ jsr166/src/test/loops/OfferPollLoops.java	2015/01/15 18:34:19	1.8
@@ -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.*;
@@ -54,8 +54,7 @@ public class OfferPollLoops {
 
         warmup();
         print = true;
-        int k = 1;
-        for (int i = 1; i <= maxN;) {
+        for (int k = 1, i = 1; i <= maxN;) {
             System.out.println("Pairs:" + i);
             oneTest(i, ITERS);
             if (i == k) {
@@ -126,7 +125,6 @@ public class OfferPollLoops {
             System.out.print("ArrayBlockingQueue      ");
         oneRun(new ArrayBlockingQueue<Integer>(POOL_SIZE), n, iters);
 
-
         Thread.sleep(100); // System.gc();
         if (print)
             System.out.print("PriorityBlockingQueue   ");
@@ -139,7 +137,7 @@ public class OfferPollLoops {
 
     }
 
-    static abstract class Stage implements Runnable {
+    abstract static class Stage implements Runnable {
         final int iters;
         final Queue<Integer> queue;
         final CyclicBarrier barrier;
@@ -237,5 +235,4 @@ public class OfferPollLoops {
             System.out.println("\t: " + LoopHelpers.rightJustify(time / (iters * n)) + " ns per transfer");
     }
 
-
 }