--- jsr166/src/test/loops/UnboundedQueueFillEmptyLoops.java 2009/10/29 23:09:08 1.3 +++ jsr166/src/test/loops/UnboundedQueueFillEmptyLoops.java 2016/10/23 03:03:24 1.12 @@ -1,13 +1,13 @@ /* * 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 java.util.concurrent.locks.*; import java.util.concurrent.atomic.*; +import java.util.concurrent.locks.*; public class UnboundedQueueFillEmptyLoops { static int maxSize = 10000; @@ -16,11 +16,11 @@ public class UnboundedQueueFillEmptyLoop static Integer[] numbers; public static void main(String[] args) throws Exception { - Class klass = null; + Class klass = null; if (args.length > 0) { try { klass = Class.forName(args[0]); - } catch(ClassNotFoundException e) { + } catch (ClassNotFoundException e) { throw new RuntimeException("Class " + args[0] + " not found."); } } @@ -42,10 +42,11 @@ public class UnboundedQueueFillEmptyLoop oneRun(klass, maxSize); if (total == 0) System.out.print(" "); - } + } - static void oneRun(Class klass, int n) throws Exception { - Queue q = (Queue)klass.newInstance(); + static void oneRun(Class klass, int n) throws Exception { + Queue q = + (Queue) klass.getConstructor().newInstance(); int sum = total; int m = rng.nextInt(numbers.length); long startTime = System.nanoTime(); @@ -55,14 +56,13 @@ public class UnboundedQueueFillEmptyLoop m = 0; q.offer(numbers[m++]); } - Integer p; - while ((p = q.poll()) != null) + for (Integer p; (p = q.poll()) != null; ) sum += p.intValue(); } total += sum; long endTime = System.nanoTime(); long time = endTime - startTime; - double secs = (double)(time) / 1000000000.0; + double secs = (double) time / 1000000000.0; System.out.println("Time: " + secs); }