--- jsr166/src/test/loops/IteratorLoops.java	2005/11/28 15:40:56	1.1
+++ jsr166/src/test/loops/IteratorLoops.java	2012/10/21 06:40:21	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.*;
@@ -10,46 +10,53 @@ import java.util.*;
  * Estimates time per iteration of collection iterators.  Preloads
  * most elements, but adds about 1/8 of them dynamically to preclude
  * overly clever optimizations. The array of collections has
- * approximately exponentially different lengths, so chek both short
+ * approximately exponentially different lengths, so check both short
  * and long iterators.  Reports include times for adds and other
  * checks, so overestimate times per iteration.
  */
-
 public final class IteratorLoops {
     static final int DEFAULT_SIZE = 16384;
-    static final int DEFAULT_TRIALS = 2;
+    static final int DEFAULT_TRIALS = 4;
     static final int NC = 16; // number of collections must be power of 2
     static volatile long mismatches = 0;
     static int randomSeed = 3122688;
 
     public static void main(String[] args) throws Exception {
         Class klass = Class.forName(args[0]);
-        int n = (args.length <= 1)? DEFAULT_SIZE : Integer.parseInt(args[1]);
-        int t = (args.length <= 2)? DEFAULT_TRIALS : Integer.parseInt(args[2]);
+        int n = (args.length <= 1) ? DEFAULT_SIZE : Integer.parseInt(args[1]);
+        int t = (args.length <= 2) ? DEFAULT_TRIALS : Integer.parseInt(args[2]);
 
         System.out.print("Class: " + klass.getName());
-        System.out.print(" ~iters: " + (long)n * (long)n);
+        System.out.print(" ~iters: " + (long) n * (long) n);
         System.out.print(" trials: " + t);
         System.out.println();
 
         Collection<Integer>[] colls =
             (Collection<Integer>[])new Collection[NC];
 
-        for (int k = 0; k < colls.length; ++k) 
-            colls[k] = (Collection<Integer>)klass.newInstance();
+        for (int k = 0; k < colls.length; ++k) {
+            Object x = klass.newInstance();
+            if (x instanceof Collection)
+                colls[k] = (Collection<Integer>) x;
+            else if (x instanceof Map)
+                colls[k] = (Collection<Integer>)
+                    Collections.newSetFromMap((Map) x);
+            else
+                throw new Error("bad class");
+        }
 
-        for (int i = 0; i < t; ++i) 
+        for (int i = 0; i < t; ++i)
             new IteratorLoops(colls).oneRun(n);
 
-        if (mismatches != 0) 
+        if (mismatches != 0)
             throw new Error("Bad checksum :" + mismatches);
     }
 
     private int elementCount;
     private final Collection<Integer>[] cs;
 
-    IteratorLoops(Collection<Integer>[] colls) { 
-        cs = colls; 
+    IteratorLoops(Collection<Integer>[] colls) {
+        cs = colls;
         elementCount = 0;
     }
 
@@ -57,7 +64,7 @@ public final class IteratorLoops {
         preload(n);
         long startTime = System.nanoTime();
         long count = traversals(n);
-        double elapsed = (double)(System.nanoTime() - startTime);
+        double elapsed = (double) (System.nanoTime() - startTime);
         double npi = elapsed / count;
         double secs = elapsed / 1000000000;
         System.out.printf("%7.1f ns/iter  %8.3fs run time\n", npi, secs);
@@ -66,7 +73,7 @@ public final class IteratorLoops {
     long traversals(int n) {
         long count = 0;
         long check = 0;
-	for (int i = 0; i < n; i++) {
+        for (int i = 0; i < n; i++) {
             check += elementCount;
             count += counts();
             maybeAdd();
@@ -85,26 +92,26 @@ public final class IteratorLoops {
             }
         }
         return count;
-    }    
+    }
 
     void maybeAdd() {
         int r = randomSeed;
-        r ^= r << 6; 
-        r ^= r >>> 21; 
+        r ^= r << 6;
+        r ^= r >>> 21;
         r ^= r << 7;
         randomSeed = r;
-        if ((r >>> 29) == 0) 
+        if ((r >>> 29) == 0)
             cs[r & (cs.length-1)].add(new Integer(elementCount++));
-    }    
+    }
 
     void preload(int n) {
-        for (int i = 0; i < cs.length; ++i) 
+        for (int i = 0; i < cs.length; ++i)
             cs[i].clear();
         int k = (n - n / 8) / 2;
         ArrayList<Integer> al = new ArrayList<Integer>(k+1);
         for (int i = 0; i < cs.length; ++i) {
             if (k > 0) {
-                for (int j = 0; j < k; ++j) 
+                for (int j = 0; j < k; ++j)
                     al.add(new Integer(elementCount++));
                 cs[i].addAll(al);
                 al.clear();
@@ -112,8 +119,9 @@ public final class IteratorLoops {
             k >>>= 1;
         }
         // let GC settle down
-        try { Thread.sleep(500); } catch(Exception ex) { return; }
-    }    
+        try { Thread.sleep(500); }
+        catch (Exception ex) { return; }
+    }
 
 
 }