--- jsr166/src/test/loops/CancelledProducerConsumerLoops.java	2009/10/29 23:09:07	1.5
+++ jsr166/src/test/loops/CancelledProducerConsumerLoops.java	2016/12/31 19:16:42	1.17
@@ -1,12 +1,24 @@
 /*
  * 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.concurrent.*;
+
+import java.util.concurrent.BrokenBarrierException;
+import java.util.concurrent.Callable;
+import java.util.concurrent.CyclicBarrier;
+import java.util.concurrent.ExecutorService;
+import java.util.concurrent.Executors;
+import java.util.concurrent.ArrayBlockingQueue;
+import java.util.concurrent.BlockingQueue;
+import java.util.concurrent.Future;
+import java.util.concurrent.LinkedBlockingQueue;
+import java.util.concurrent.LinkedTransferQueue;
+import java.util.concurrent.SynchronousQueue;
+import java.util.concurrent.TimeUnit;
 
 public class CancelledProducerConsumerLoops {
-    static final int CAPACITY =      100;
+    static final int CAPACITY = 100;
     static final long TIMEOUT = 100;
 
     static final ExecutorService pool = Executors.newCachedThreadPool();
@@ -26,19 +38,19 @@ public class CancelledProducerConsumerLo
             try {
                 oneTest(i, iters);
             }
-            catch(BrokenBarrierException bb) {
+            catch (BrokenBarrierException bb) {
                 // OK, ignore
             }
             Thread.sleep(100);
         }
         pool.shutdown();
-   }
+    }
 
     static void oneRun(BlockingQueue<Integer> q, int npairs, int iters) throws Exception {
         LoopHelpers.BarrierTimer timer = new LoopHelpers.BarrierTimer();
         CyclicBarrier barrier = new CyclicBarrier(npairs * 2 + 1, timer);
-        Future[] prods = new Future[npairs];
-        Future[] cons = new Future[npairs];
+        Future<?>[] prods = new Future<?>[npairs];
+        Future<?>[] cons = new Future<?>[npairs];
 
         for (int i = 0; i < npairs; ++i) {
             prods[i] = pool.submit(new Producer(q, barrier, iters));
@@ -72,7 +84,7 @@ public class CancelledProducerConsumerLo
         long endTime = System.nanoTime();
         long time = endTime - timer.startTime;
         if (print) {
-            double secs = (double)(time) / 1000000000.0;
+            double secs = (double) time / 1000000000.0;
             System.out.println("\t " + secs + "s run time");
         }
     }
@@ -87,12 +99,14 @@ public class CancelledProducerConsumerLo
             System.out.print("LinkedBlockingQueue     ");
         oneRun(new LinkedBlockingQueue<Integer>(CAPACITY), pairs, iters);
 
+        if (print)
+            System.out.print("LinkedTransferQueue     ");
+        oneRun(new LinkedTransferQueue<Integer>(), pairs, iters);
 
         if (print)
             System.out.print("SynchronousQueue        ");
         oneRun(new SynchronousQueue<Integer>(), pairs, iters / 8);
 
-
         if (print)
             System.out.print("SynchronousQueue(fair)  ");
         oneRun(new SynchronousQueue<Integer>(true), pairs, iters / 8);
@@ -104,11 +118,11 @@ public class CancelledProducerConsumerLo
         */
     }
 
-    static abstract class Stage implements Callable {
+    abstract static class Stage implements Callable {
         final BlockingQueue<Integer> queue;
         final CyclicBarrier barrier;
         final int iters;
-        Stage (BlockingQueue<Integer> q, CyclicBarrier b, int iters) {
+        Stage(BlockingQueue<Integer> q, CyclicBarrier b, int iters) {
             queue = q;
             barrier = b;
             this.iters = iters;
@@ -153,6 +167,4 @@ public class CancelledProducerConsumerLo
             return new Integer(s);
         }
     }
-
-
 }