--- jsr166/src/test/loops/ConcurrentDequeLoops.java 2009/11/02 23:42:46 1.4 +++ jsr166/src/test/loops/ConcurrentDequeLoops.java 2014/12/18 18:13:06 1.10 @@ -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.*; @@ -43,8 +43,7 @@ public class ConcurrentDequeLoops { Thread.sleep(100); print = true; - int k = 1; - for (int i = 1; i <= maxStages;) { + for (int k = 1, i = 1; i <= maxStages;) { oneRun(klass, i, items); if (i == k) { k = i << 1; @@ -54,14 +53,14 @@ public class ConcurrentDequeLoops { i = k; } pool.shutdown(); - } + } static class Stage implements Callable { final Deque queue; final CyclicBarrier barrier; final LoopHelpers.SimpleRandom rng = new LoopHelpers.SimpleRandom(); int items; - Stage (Deque q, CyclicBarrier b, int items) { + Stage(Deque q, CyclicBarrier b, int items) { queue = q; barrier = b; this.items = items; @@ -72,7 +71,7 @@ public class ConcurrentDequeLoops { // transform it, and put back in. try { barrier.await(); - int l = (int)System.nanoTime(); + int l = (int) System.nanoTime(); int takes = 0; for (;;) { Integer item; @@ -118,7 +117,7 @@ public class ConcurrentDequeLoops { } static void oneRun(Class klass, int n, int items) throws Exception { - Deque q = (Deque)klass.newInstance(); + Deque q = (Deque) klass.newInstance(); LoopHelpers.BarrierTimer timer = new LoopHelpers.BarrierTimer(); CyclicBarrier barrier = new CyclicBarrier(n + 1, timer); totalItems = new AtomicInteger(n * items);