--- jsr166/src/test/loops/CyclicBarrierLoops.java	2009/11/01 21:28:56	1.1
+++ jsr166/src/test/loops/CyclicBarrierLoops.java	2015/01/15 18:34:19	1.7
@@ -1,17 +1,16 @@
 /*
  * 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.*;
 import java.util.concurrent.*;
 //import jsr166y.*;
 
-/*
+/**
  * Based loosely on Java Grande Forum barrierBench
  */
-
 public class CyclicBarrierLoops {
     static final int NCPUS = Runtime.getRuntime().availableProcessors();
     static final ExecutorService pool = Executors.newCachedThreadPool();
@@ -30,15 +29,14 @@ public class CyclicBarrierLoops {
             this.size = size;
         }
 
-
         public void run() {
             try {
                 int n = size;
                 CyclicBarrier b = barrier;
-                for(int i = 0; i < n; ++i)
+                for (int i = 0; i < n; ++i)
                     b.await();
             }
-            catch(Exception ex) {
+            catch (Exception ex) {
                 throw new Error(ex);
             }
         }
@@ -51,18 +49,18 @@ public class CyclicBarrierLoops {
             nthreads = Integer.parseInt(args[0]);
 
         System.out.printf("max %d Threads\n", nthreads);
-        
+
         for (int k = 2; k <= nthreads; k *= 2) {
             for (int size = FIRST_SIZE; size <= LAST_SIZE; size *= 10) {
                 long startTime = System.nanoTime();
-                
+
                 CyclicBarrier barrier = new CyclicBarrier(k);
                 CyclicBarrierAction[] actions = new CyclicBarrierAction[k];
                 for (int i = 0; i < k; ++i) {
                     actions[i] = new CyclicBarrierAction(i, barrier, size);
                 }
-                
-                Future[] futures = new Future[k];
+
+                Future<?>[] futures = new Future<?>[k];
                 for (int i = 0; i < k; ++i) {
                     futures[i] = pool.submit(actions[i]);
                 }
@@ -77,7 +75,5 @@ public class CyclicBarrierLoops {
         }
         pool.shutdown();
     }
-    
-}
-
 
+}