test/loops/MapCheck.java

/*
 * 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
 */
/**
 * @test
 * @synopsis Times and checks basic map operations
 */
import java.util.*;
import java.io.*;

public class MapCheck {

    static final int absentSize = 1 << 17;
    static final int absentMask = absentSize - 1;
    static Object[] absent = new Object[absentSize];

    static final Object MISSING = new Object();

    static TestTimer timer = new TestTimer();

    static void reallyAssert(boolean b) {
        if (!b) throw new Error("Failed Assertion");
    }

    public static void main(String[] args) throws Exception {
        Class mapClass = java.util.concurrent.ConcurrentHashMap.class;
        int numTests = 50;
        int size = 50000;

        if (args.length > 0) {
            try {
                mapClass = Class.forName(args[0]);
            } catch(ClassNotFoundException e) {
                throw new RuntimeException("Class " + args[0] + " not found.");
            }
        }


        if (args.length > 1) 
            numTests = Integer.parseInt(args[1]);

        if (args.length > 2) 
            size = Integer.parseInt(args[2]);

        boolean doSerializeTest = args.length > 3;

        System.out.println("Testing " + mapClass.getName() + " trials: " + numTests + " size: " + size);

        for (int i = 0; i < absentSize; ++i) absent[i] = new Object();

        Object[] key = new Object[size];
        for (int i = 0; i < size; ++i) key[i] = new Object();

        forceMem(size * 8);

        for (int rep = 0; rep < numTests; ++rep) {
            runTest(newMap(mapClass), key);
        }

        TestTimer.printStats();


        if (doSerializeTest)
            stest(newMap(mapClass), size);
    }

    static Map newMap(Class cl) {
        try {
            Map m = (Map)cl.newInstance();
            return m;
        } catch(Exception e) {
            throw new RuntimeException("Can't instantiate " + cl + ": " + e);
        }
    }


    static void runTest(Map s, Object[] key) {
        shuffle(key);
        int size = key.length;
        long startTime = System.currentTimeMillis();
        test(s, key);
        long time = System.currentTimeMillis() - startTime;
    }

    static void forceMem(int n) {
        // force enough memory
        Long[] junk = new Long[n];
        for (int i = 0; i < junk.length; ++i) junk[i] = new Long(i);
        int sum = 0;
        for (int i = 0; i < junk.length; ++i) 
            sum += (int)(junk[i].longValue() + i);
        if (sum == 0) System.out.println("Useless number = " + sum);
        junk = null;
        //        System.gc();
    }


    static void t1(String nm, int n, Map s, Object[] key, int expect) {
        int sum = 0;
        int iters = 4;
        timer.start(nm, n * iters);
        for (int j = 0; j < iters; ++j) {
            for (int i = 0; i < n; i++) {
                if (s.get(key[i]) != null) ++sum;
            }
        }
        timer.finish(); 
        reallyAssert (sum == expect * iters);
    }

    static void t2(String nm, int n, Map s, Object[] key, int expect) {
        int sum = 0;
        timer.start(nm, n);
        for (int i = 0; i < n; i++) {
            if (s.remove(key[i]) != null) ++sum;
        }
        timer.finish(); 
        reallyAssert (sum == expect);
    }

    static void t3(String nm, int n, Map s, Object[] key, int expect) {
        int sum = 0;
        timer.start(nm, n);
        for (int i = 0; i < n; i++) {
            if (s.put(key[i], absent[i & absentMask]) == null) ++sum;
        }
        timer.finish(); 
        reallyAssert (sum == expect);
    }

    static void t4(String nm, int n, Map s, Object[] key, int expect) {
        int sum = 0;
        timer.start(nm, n);
        for (int i = 0; i < n; i++) {
            if (s.containsKey(key[i])) ++sum;
        }
        timer.finish(); 
        reallyAssert (sum == expect);
    }

    static void t5(String nm, int n, Map s, Object[] key, int expect) {
        int sum = 0;
        timer.start(nm, n/2);
        for (int i = n-2; i >= 0; i-=2) {
            if (s.remove(key[i]) != null) ++sum;
        }
        timer.finish(); 
        reallyAssert (sum == expect);
    }

    static void t6(String nm, int n, Map s, Object[] k1, Object[] k2) {
        int sum = 0;
        timer.start(nm, n * 2);
        for (int i = 0; i < n; i++) {
            if (s.get(k1[i]) != null) ++sum;
            if (s.get(k2[i & absentMask]) != null) ++sum;
        }
        timer.finish(); 
        reallyAssert (sum == n);
    }

    static void t7(String nm, int n, Map s, Object[] k1, Object[] k2) {
        int sum = 0;
        timer.start(nm, n * 2);
        for (int i = 0; i < n; i++) {
            if (s.containsKey(k1[i])) ++sum;
            if (s.containsKey(k2[i & absentMask])) ++sum;
        }
        timer.finish(); 
        reallyAssert (sum == n);
    }

    static void t8(String nm, int n, Map s, Object[] key, int expect) {
        int sum = 0;
        timer.start(nm, n);
        for (int i = 0; i < n; i++) {
            if (s.get(key[i]) != null) ++sum;
        }
        timer.finish(); 
        reallyAssert (sum == expect);
    }


    static void t9(Map s) {
        int sum = 0;
        int iters = 20;
        timer.start("ContainsValue (/n)     ", iters * s.size());
        int step = absentSize / iters;
        for (int i = 0; i < absentSize; i += step)
            if (s.containsValue(absent[i])) ++sum;
        timer.finish(); 
        reallyAssert (sum != 0);
    }


    static void ktest(Map s, int size, Object[] key) {
        timer.start("ContainsKey            ", size);
        Set ks = s.keySet();
        int sum = 0;
        for (int i = 0; i < size; i++) {
            if (ks.contains(key[i])) ++sum;
        }
        timer.finish(); 
        reallyAssert (sum == size);
    }


    static void ittest1(Map s, int size) {
        int sum = 0;
        timer.start("Iter Key               ", size);
        for (Iterator it = s.keySet().iterator(); it.hasNext(); ) {
            if(it.next() != MISSING)
                ++sum;
        }
        timer.finish(); 
        reallyAssert (sum == size);
    }

    static void ittest2(Map s, int size) {
        int sum = 0;
        timer.start("Iter Value             ", size);
        for (Iterator it = s.values().iterator(); it.hasNext(); ) {
            if(it.next() != MISSING)
                ++sum;
        }
        timer.finish(); 
        reallyAssert (sum == size);
    }
    static void ittest3(Map s, int size) {
        int sum = 0;
        int hsum = 0;
        timer.start("Iter Entry             ", size);
        for (Iterator it = s.entrySet().iterator(); it.hasNext(); ) {
            Map.Entry e = (Map.Entry)it.next();
            if(e != MISSING) {
                hsum += System.identityHashCode(e.getKey());
                hsum += System.identityHashCode(e.getValue());
                hsum >>>= 1;
                ++sum;
            }
        }
        timer.finish(); 
        reallyAssert(size == 0 || hsum >= 0);
        reallyAssert (sum == size);
    }

    static void ittest4(Map s, int size, int pos) {
        IdentityHashMap seen = new IdentityHashMap(size);
        reallyAssert (s.size() == size);
        int sum = 0;
        timer.start("Iter XEntry            ", size);
        Iterator it = s.entrySet().iterator(); 
        Object k = null;
        Object v = null;
        for (int i = 0; i < size-pos; ++i) {
            Map.Entry x = (Map.Entry)(it.next());
            k = x.getKey();
            v = x.getValue();
            seen.put(k, k);
            if (x != MISSING)
                ++sum;
        }
        reallyAssert (s.containsKey(k));
        it.remove();
        reallyAssert (!s.containsKey(k));
        while (it.hasNext()) {
            Map.Entry x = (Map.Entry)(it.next());
            Object k2 = x.getKey();
            seen.put(k2, k2);
            if (x != MISSING)
                ++sum;
        }

        reallyAssert (s.size() == size-1);
        s.put(k, v);
        reallyAssert (seen.size() == size);
        timer.finish(); 
        reallyAssert (sum == size);
        reallyAssert (s.size() == size);
    }


    static void ittest(Map s, int size) {
        ittest1(s, size);
        ittest2(s, size);
        ittest3(s, size);
        //        for (int i = 0; i < size-1; ++i) 
        //            ittest4(s, size, i);
    }

    static void entest1(Hashtable ht, int size) {
        int sum = 0;

        timer.start("Iter Enumeration Key   ", size);
        for (Enumeration en = ht.keys(); en.hasMoreElements(); ) {
            if (en.nextElement() != MISSING)
                ++sum;
        }
        timer.finish(); 
        reallyAssert (sum == size);
    }

    static void entest2(Hashtable ht, int size) {
        int sum = 0;
        timer.start("Iter Enumeration Value ", size);
        for (Enumeration en = ht.elements(); en.hasMoreElements(); ) {
            if (en.nextElement() != MISSING)
                ++sum;
        }
        timer.finish(); 
        reallyAssert (sum == size);
    }


    static void entest3(Hashtable ht, int size) {
        int sum = 0;

        timer.start("Iterf Enumeration Key  ", size);
        Enumeration en = ht.keys(); 
        for (int i = 0; i < size; ++i) {
            if (en.nextElement() != MISSING)
                ++sum;
        }
        timer.finish(); 
        reallyAssert (sum == size);
    }

    static void entest4(Hashtable ht, int size) {
        int sum = 0;
        timer.start("Iterf Enumeration Value", size);
        Enumeration en = ht.elements(); 
        for (int i = 0; i < size; ++i) {
            if (en.nextElement() != MISSING)
                ++sum;
        }
        timer.finish(); 
        reallyAssert (sum == size);
    }

    static void entest(Map s, int size) {
        if (s instanceof Hashtable) {
            Hashtable ht = (Hashtable)s;
            //            entest3(ht, size);
            //            entest4(ht, size);
            entest1(ht, size);
            entest2(ht, size);
            entest1(ht, size);
            entest2(ht, size);
            entest1(ht, size);
            entest2(ht, size);
        }
    }

    static void rtest(Map s, int size) {
        timer.start("Remove (iterator)      ", size);
        for (Iterator it = s.keySet().iterator(); it.hasNext(); ) {
            it.next();
            it.remove();
        }
        timer.finish(); 
    }

    static void rvtest(Map s, int size) {
        timer.start("Remove (iterator)      ", size);
        for (Iterator it = s.values().iterator(); it.hasNext(); ) {
            it.next();
            it.remove();
        }
        timer.finish(); 
    }


    static void dtest(Map s, int size, Object[] key) {
        timer.start("Put (putAll)           ", size * 2);
        Map s2 = null;
        try {
            s2 = (Map) (s.getClass().newInstance());
            s2.putAll(s);
        }
        catch (Exception e) { e.printStackTrace(); return; }
        timer.finish(); 
    
        timer.start("Iter Equals            ", size * 2);
        boolean eqt = s2.equals(s) && s.equals(s2);
        reallyAssert (eqt);
        timer.finish(); 

        timer.start("Iter HashCode          ", size * 2);
        int shc = s.hashCode();
        int s2hc = s2.hashCode();
        reallyAssert (shc == s2hc);
        timer.finish(); 

        timer.start("Put (present)          ", size);
        s2.putAll(s);
        timer.finish(); 

        timer.start("Iter EntrySet contains ", size * 2);
        Set es2 = s2.entrySet();
        int sum = 0;
        for (Iterator i1 = s.entrySet().iterator(); i1.hasNext(); ) {
            Object entry = i1.next();
            if (es2.contains(entry)) ++sum;
        }
        timer.finish(); 
        reallyAssert (sum == size);

        t6("Get                    ", size, s2, key, absent);

        Object hold = s2.get(key[size-1]);
        s2.put(key[size-1], absent[0]);
        timer.start("Iter Equals            ", size * 2);
        eqt = s2.equals(s) && s.equals(s2);
        reallyAssert (!eqt);
        timer.finish(); 

        timer.start("Iter HashCode          ", size * 2);
        int s1h = s.hashCode();
        int s2h = s2.hashCode();
        reallyAssert (s1h != s2h);
        timer.finish(); 

        s2.put(key[size-1], hold);
        timer.start("Remove (iterator)      ", size * 2);
        Iterator s2i = s2.entrySet().iterator();
        Set es = s.entrySet();
        while (s2i.hasNext())
            es.remove(s2i.next());
        timer.finish(); 

        reallyAssert (s.isEmpty());

        timer.start("Clear                  ", size);
        s2.clear();
        timer.finish(); 
        reallyAssert (s2.isEmpty() && s.isEmpty());
    }

    static void stest(Map s, int size) throws Exception {
        if (!(s instanceof Serializable)) 
            return;
        System.out.print("Serialize              : ");
      
        for (int i = 0; i < size; i++) {
            s.put(new Integer(i), Boolean.TRUE);
        }

        long startTime = System.currentTimeMillis();

        FileOutputStream fs = new FileOutputStream("MapCheck.dat");
        ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(fs));
        out.writeObject(s);
        out.close();

        FileInputStream is = new FileInputStream("MapCheck.dat");
        ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(is));
        Map m = (Map)in.readObject();

        long endTime = System.currentTimeMillis();
        long time = endTime - startTime;

        System.out.print(time + "ms");

        if (s instanceof IdentityHashMap) return;
        reallyAssert (s.equals(m));
    }

    
    static void test(Map s, Object[] key) {
        int size = key.length;

        t3("Put (absent)           ", size, s, key, size);
        t3("Put (present)          ", size, s, key, 0);
        t7("ContainsKey            ", size, s, key, absent);
        t4("ContainsKey            ", size, s, key, size);
        ktest(s, size, key);
        t4("ContainsKey            ", absentSize, s, absent, 0);
        t6("Get                    ", size, s, key, absent);
        t1("Get (present)          ", size, s, key, size);
        t1("Get (absent)           ", absentSize, s, absent, 0);
        t2("Remove (absent)        ", absentSize, s, absent, 0);
        t5("Remove (present)       ", size, s, key, size / 2);
        t3("Put (half present)     ", size, s, key, size / 2);

        ittest(s, size);
        entest(s, size);
        t9(s);
        rtest(s, size);

        t4("ContainsKey            ", size, s, key, 0);
        t2("Remove (absent)        ", size, s, key, 0);
        t3("Put (presized)         ", size, s, key, size);
        dtest(s, size, key);
    }

    static class TestTimer {
        private String name;
        private long numOps;
        private long startTime;
        private String cname;

        static final java.util.TreeMap accum = new java.util.TreeMap();
    
        static void printStats() {
            for (Iterator it = accum.entrySet().iterator(); it.hasNext(); ) {
                Map.Entry e = (Map.Entry)(it.next());
                Stats stats = ((Stats)(e.getValue()));
                int n = stats.number;
                double t;
                if (n > 0) 
                    t = stats.sum / n;
                else
                    t = stats.least;
                long nano = Math.round(1000000.0 * t);
                System.out.println(e.getKey() + ": " + nano);
            }
        }
    
        void start(String name, long numOps) {
            this.name = name;
            this.cname = classify();
            this.numOps = numOps;
            startTime = System.currentTimeMillis();
        }
    

        String classify() {
            if (name.startsWith("Get"))
                return "Get                    ";
            else if (name.startsWith("Put"))
                return "Put                    ";
            else if (name.startsWith("Remove"))
                return "Remove                 ";
            else if (name.startsWith("Iter"))
                return "Iter                   ";
            else 
                return null;
        }

        void finish() {
            long endTime = System.currentTimeMillis();
            long time = endTime - startTime;
            double timePerOp = ((double)time)/numOps;

            Object st = accum.get(name);
            if (st == null)
                accum.put(name, new Stats(timePerOp));
            else {
                Stats stats = (Stats) st;
                stats.sum += timePerOp;
                stats.number++;
                if (timePerOp < stats.least) stats.least = timePerOp;
            }

            if (cname != null) {
                st = accum.get(cname);
                if (st == null)
                    accum.put(cname, new Stats(timePerOp));
                else {
                    Stats stats = (Stats) st;
                    stats.sum += timePerOp;
                    stats.number++;
                    if (timePerOp < stats.least) stats.least = timePerOp;
                }
            }

        }

    }

    static class Stats {
        double sum = 0;
        double least;
        int number = 0;
        Stats(double t) { least = t; }
    }

    static Random rng = new Random();

    static void shuffle(Object[] keys) {
        int size = keys.length;
        for (int i=size; i>1; i--) {
            int r = rng.nextInt(i);
            Object t = keys[i-1];
            keys[i-1] = keys[r];
            keys[r] = t;
        }
    }

}

Revision:	1.3
Committed:	Thu Sep 15 16:55:40 2005 UTC (18 years, 8 months ago) by dl
Branch:	MAIN
Changes since 1.2:	+8 -1 lines
Log Message:	Misc minor test improvements
#	Content
1	/*
2	* Written by Doug Lea with assistance from members of JCP JSR-166
3	* Expert Group and released to the public domain, as explained at
4	* http://creativecommons.org/licenses/publicdomain
5	*/
6	/**
7	* @test
8	* @synopsis Times and checks basic map operations
9	*/
10	import java.util.*;
11	import java.io.*;
12
13	public class MapCheck {
14
15	static final int absentSize = 1 << 17;
16	static final int absentMask = absentSize - 1;
17	static Object[] absent = new Object[absentSize];
18
19	static final Object MISSING = new Object();
20
21	static TestTimer timer = new TestTimer();
22
23	static void reallyAssert(boolean b) {
24	if (!b) throw new Error("Failed Assertion");
25	}
26
27	public static void main(String[] args) throws Exception {
28	Class mapClass = java.util.concurrent.ConcurrentHashMap.class;
29	int numTests = 50;
30	int size = 50000;
31
32	if (args.length > 0) {
33	try {
34	mapClass = Class.forName(args[0]);
35	} catch(ClassNotFoundException e) {
36	throw new RuntimeException("Class " + args[0] + " not found.");
37	}
38	}
39
40
41	if (args.length > 1)
42	numTests = Integer.parseInt(args[1]);
43
44	if (args.length > 2)
45	size = Integer.parseInt(args[2]);
46
47	boolean doSerializeTest = args.length > 3;
48
49	System.out.println("Testing " + mapClass.getName() + " trials: " + numTests + " size: " + size);
50
51	for (int i = 0; i < absentSize; ++i) absent[i] = new Object();
52
53	Object[] key = new Object[size];
54	for (int i = 0; i < size; ++i) key[i] = new Object();
55
56	forceMem(size * 8);
57
58	for (int rep = 0; rep < numTests; ++rep) {
59	runTest(newMap(mapClass), key);
60	}
61
62	TestTimer.printStats();
63
64
65	if (doSerializeTest)
66	stest(newMap(mapClass), size);
67	}
68
69	static Map newMap(Class cl) {
70	try {
71	Map m = (Map)cl.newInstance();
72	return m;
73	} catch(Exception e) {
74	throw new RuntimeException("Can't instantiate " + cl + ": " + e);
75	}
76	}
77
78
79	static void runTest(Map s, Object[] key) {
80	shuffle(key);
81	int size = key.length;
82	long startTime = System.currentTimeMillis();
83	test(s, key);
84	long time = System.currentTimeMillis() - startTime;
85	}
86
87	static void forceMem(int n) {
88	// force enough memory
89	Long[] junk = new Long[n];
90	for (int i = 0; i < junk.length; ++i) junk[i] = new Long(i);
91	int sum = 0;
92	for (int i = 0; i < junk.length; ++i)
93	sum += (int)(junk[i].longValue() + i);
94	if (sum == 0) System.out.println("Useless number = " + sum);
95	junk = null;
96	// System.gc();
97	}
98
99
100	static void t1(String nm, int n, Map s, Object[] key, int expect) {
101	int sum = 0;
102	int iters = 4;
103	timer.start(nm, n * iters);
104	for (int j = 0; j < iters; ++j) {
105	for (int i = 0; i < n; i++) {
106	if (s.get(key[i]) != null) ++sum;
107	}
108	}
109	timer.finish();
110	reallyAssert (sum == expect * iters);
111	}
112
113	static void t2(String nm, int n, Map s, Object[] key, int expect) {
114	int sum = 0;
115	timer.start(nm, n);
116	for (int i = 0; i < n; i++) {
117	if (s.remove(key[i]) != null) ++sum;
118	}
119	timer.finish();
120	reallyAssert (sum == expect);
121	}
122
123	static void t3(String nm, int n, Map s, Object[] key, int expect) {
124	int sum = 0;
125	timer.start(nm, n);
126	for (int i = 0; i < n; i++) {
127	if (s.put(key[i], absent[i & absentMask]) == null) ++sum;
128	}
129	timer.finish();
130	reallyAssert (sum == expect);
131	}
132
133	static void t4(String nm, int n, Map s, Object[] key, int expect) {
134	int sum = 0;
135	timer.start(nm, n);
136	for (int i = 0; i < n; i++) {
137	if (s.containsKey(key[i])) ++sum;
138	}
139	timer.finish();
140	reallyAssert (sum == expect);
141	}
142
143	static void t5(String nm, int n, Map s, Object[] key, int expect) {
144	int sum = 0;
145	timer.start(nm, n/2);
146	for (int i = n-2; i >= 0; i-=2) {
147	if (s.remove(key[i]) != null) ++sum;
148	}
149	timer.finish();
150	reallyAssert (sum == expect);
151	}
152
153	static void t6(String nm, int n, Map s, Object[] k1, Object[] k2) {
154	int sum = 0;
155	timer.start(nm, n * 2);
156	for (int i = 0; i < n; i++) {
157	if (s.get(k1[i]) != null) ++sum;
158	if (s.get(k2[i & absentMask]) != null) ++sum;
159	}
160	timer.finish();
161	reallyAssert (sum == n);
162	}
163
164	static void t7(String nm, int n, Map s, Object[] k1, Object[] k2) {
165	int sum = 0;
166	timer.start(nm, n * 2);
167	for (int i = 0; i < n; i++) {
168	if (s.containsKey(k1[i])) ++sum;
169	if (s.containsKey(k2[i & absentMask])) ++sum;
170	}
171	timer.finish();
172	reallyAssert (sum == n);
173	}
174
175	static void t8(String nm, int n, Map s, Object[] key, int expect) {
176	int sum = 0;
177	timer.start(nm, n);
178	for (int i = 0; i < n; i++) {
179	if (s.get(key[i]) != null) ++sum;
180	}
181	timer.finish();
182	reallyAssert (sum == expect);
183	}
184
185
186	static void t9(Map s) {
187	int sum = 0;
188	int iters = 20;
189	timer.start("ContainsValue (/n) ", iters * s.size());
190	int step = absentSize / iters;
191	for (int i = 0; i < absentSize; i += step)
192	if (s.containsValue(absent[i])) ++sum;
193	timer.finish();
194	reallyAssert (sum != 0);
195	}
196
197
198	static void ktest(Map s, int size, Object[] key) {
199	timer.start("ContainsKey ", size);
200	Set ks = s.keySet();
201	int sum = 0;
202	for (int i = 0; i < size; i++) {
203	if (ks.contains(key[i])) ++sum;
204	}
205	timer.finish();
206	reallyAssert (sum == size);
207	}
208
209
210	static void ittest1(Map s, int size) {
211	int sum = 0;
212	timer.start("Iter Key ", size);
213	for (Iterator it = s.keySet().iterator(); it.hasNext(); ) {
214	if(it.next() != MISSING)
215	++sum;
216	}
217	timer.finish();
218	reallyAssert (sum == size);
219	}
220
221	static void ittest2(Map s, int size) {
222	int sum = 0;
223	timer.start("Iter Value ", size);
224	for (Iterator it = s.values().iterator(); it.hasNext(); ) {
225	if(it.next() != MISSING)
226	++sum;
227	}
228	timer.finish();
229	reallyAssert (sum == size);
230	}
231	static void ittest3(Map s, int size) {
232	int sum = 0;
233	int hsum = 0;
234	timer.start("Iter Entry ", size);
235	for (Iterator it = s.entrySet().iterator(); it.hasNext(); ) {
236	Map.Entry e = (Map.Entry)it.next();
237	if(e != MISSING) {
238	hsum += System.identityHashCode(e.getKey());
239	hsum += System.identityHashCode(e.getValue());
240	hsum >>>= 1;
241	++sum;
242	}
243	}
244	timer.finish();
245	reallyAssert(size == 0 \|\| hsum >= 0);
246	reallyAssert (sum == size);
247	}
248
249	static void ittest4(Map s, int size, int pos) {
250	IdentityHashMap seen = new IdentityHashMap(size);
251	reallyAssert (s.size() == size);
252	int sum = 0;
253	timer.start("Iter XEntry ", size);
254	Iterator it = s.entrySet().iterator();
255	Object k = null;
256	Object v = null;
257	for (int i = 0; i < size-pos; ++i) {
258	Map.Entry x = (Map.Entry)(it.next());
259	k = x.getKey();
260	v = x.getValue();
261	seen.put(k, k);
262	if (x != MISSING)
263	++sum;
264	}
265	reallyAssert (s.containsKey(k));
266	it.remove();
267	reallyAssert (!s.containsKey(k));
268	while (it.hasNext()) {
269	Map.Entry x = (Map.Entry)(it.next());
270	Object k2 = x.getKey();
271	seen.put(k2, k2);
272	if (x != MISSING)
273	++sum;
274	}
275
276	reallyAssert (s.size() == size-1);
277	s.put(k, v);
278	reallyAssert (seen.size() == size);
279	timer.finish();
280	reallyAssert (sum == size);
281	reallyAssert (s.size() == size);
282	}
283
284
285	static void ittest(Map s, int size) {
286	ittest1(s, size);
287	ittest2(s, size);
288	ittest3(s, size);
289	// for (int i = 0; i < size-1; ++i)
290	// ittest4(s, size, i);
291	}
292
293	static void entest1(Hashtable ht, int size) {
294	int sum = 0;
295
296	timer.start("Iter Enumeration Key ", size);
297	for (Enumeration en = ht.keys(); en.hasMoreElements(); ) {
298	if (en.nextElement() != MISSING)
299	++sum;
300	}
301	timer.finish();
302	reallyAssert (sum == size);
303	}
304
305	static void entest2(Hashtable ht, int size) {
306	int sum = 0;
307	timer.start("Iter Enumeration Value ", size);
308	for (Enumeration en = ht.elements(); en.hasMoreElements(); ) {
309	if (en.nextElement() != MISSING)
310	++sum;
311	}
312	timer.finish();
313	reallyAssert (sum == size);
314	}
315
316
317	static void entest3(Hashtable ht, int size) {
318	int sum = 0;
319
320	timer.start("Iterf Enumeration Key ", size);
321	Enumeration en = ht.keys();
322	for (int i = 0; i < size; ++i) {
323	if (en.nextElement() != MISSING)
324	++sum;
325	}
326	timer.finish();
327	reallyAssert (sum == size);
328	}
329
330	static void entest4(Hashtable ht, int size) {
331	int sum = 0;
332	timer.start("Iterf Enumeration Value", size);
333	Enumeration en = ht.elements();
334	for (int i = 0; i < size; ++i) {
335	if (en.nextElement() != MISSING)
336	++sum;
337	}
338	timer.finish();
339	reallyAssert (sum == size);
340	}
341
342	static void entest(Map s, int size) {
343	if (s instanceof Hashtable) {
344	Hashtable ht = (Hashtable)s;
345	// entest3(ht, size);
346	// entest4(ht, size);
347	entest1(ht, size);
348	entest2(ht, size);
349	entest1(ht, size);
350	entest2(ht, size);
351	entest1(ht, size);
352	entest2(ht, size);
353	}
354	}
355
356	static void rtest(Map s, int size) {
357	timer.start("Remove (iterator) ", size);
358	for (Iterator it = s.keySet().iterator(); it.hasNext(); ) {
359	it.next();
360	it.remove();
361	}
362	timer.finish();
363	}
364
365	static void rvtest(Map s, int size) {
366	timer.start("Remove (iterator) ", size);
367	for (Iterator it = s.values().iterator(); it.hasNext(); ) {
368	it.next();
369	it.remove();
370	}
371	timer.finish();
372	}
373
374
375	static void dtest(Map s, int size, Object[] key) {
376	timer.start("Put (putAll) ", size * 2);
377	Map s2 = null;
378	try {
379	s2 = (Map) (s.getClass().newInstance());
380	s2.putAll(s);
381	}
382	catch (Exception e) { e.printStackTrace(); return; }
383	timer.finish();
384
385	timer.start("Iter Equals ", size * 2);
386	boolean eqt = s2.equals(s) && s.equals(s2);
387	reallyAssert (eqt);
388	timer.finish();
389
390	timer.start("Iter HashCode ", size * 2);
391	int shc = s.hashCode();
392	int s2hc = s2.hashCode();
393	reallyAssert (shc == s2hc);
394	timer.finish();
395
396	timer.start("Put (present) ", size);
397	s2.putAll(s);
398	timer.finish();
399
400	timer.start("Iter EntrySet contains ", size * 2);
401	Set es2 = s2.entrySet();
402	int sum = 0;
403	for (Iterator i1 = s.entrySet().iterator(); i1.hasNext(); ) {
404	Object entry = i1.next();
405	if (es2.contains(entry)) ++sum;
406	}
407	timer.finish();
408	reallyAssert (sum == size);
409
410	t6("Get ", size, s2, key, absent);
411
412	Object hold = s2.get(key[size-1]);
413	s2.put(key[size-1], absent[0]);
414	timer.start("Iter Equals ", size * 2);
415	eqt = s2.equals(s) && s.equals(s2);
416	reallyAssert (!eqt);
417	timer.finish();
418
419	timer.start("Iter HashCode ", size * 2);
420	int s1h = s.hashCode();
421	int s2h = s2.hashCode();
422	reallyAssert (s1h != s2h);
423	timer.finish();
424
425	s2.put(key[size-1], hold);
426	timer.start("Remove (iterator) ", size * 2);
427	Iterator s2i = s2.entrySet().iterator();
428	Set es = s.entrySet();
429	while (s2i.hasNext())
430	es.remove(s2i.next());
431	timer.finish();
432
433	reallyAssert (s.isEmpty());
434
435	timer.start("Clear ", size);
436	s2.clear();
437	timer.finish();
438	reallyAssert (s2.isEmpty() && s.isEmpty());
439	}
440
441	static void stest(Map s, int size) throws Exception {
442	if (!(s instanceof Serializable))
443	return;
444	System.out.print("Serialize : ");
445
446	for (int i = 0; i < size; i++) {
447	s.put(new Integer(i), Boolean.TRUE);
448	}
449
450	long startTime = System.currentTimeMillis();
451
452	FileOutputStream fs = new FileOutputStream("MapCheck.dat");
453	ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(fs));
454	out.writeObject(s);
455	out.close();
456
457	FileInputStream is = new FileInputStream("MapCheck.dat");
458	ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(is));
459	Map m = (Map)in.readObject();
460
461	long endTime = System.currentTimeMillis();
462	long time = endTime - startTime;
463
464	System.out.print(time + "ms");
465
466	if (s instanceof IdentityHashMap) return;
467	reallyAssert (s.equals(m));
468	}
469
470
471	static void test(Map s, Object[] key) {
472	int size = key.length;
473
474	t3("Put (absent) ", size, s, key, size);
475	t3("Put (present) ", size, s, key, 0);
476	t7("ContainsKey ", size, s, key, absent);
477	t4("ContainsKey ", size, s, key, size);
478	ktest(s, size, key);
479	t4("ContainsKey ", absentSize, s, absent, 0);
480	t6("Get ", size, s, key, absent);
481	t1("Get (present) ", size, s, key, size);
482	t1("Get (absent) ", absentSize, s, absent, 0);
483	t2("Remove (absent) ", absentSize, s, absent, 0);
484	t5("Remove (present) ", size, s, key, size / 2);
485	t3("Put (half present) ", size, s, key, size / 2);
486
487	ittest(s, size);
488	entest(s, size);
489	t9(s);
490	rtest(s, size);
491
492	t4("ContainsKey ", size, s, key, 0);
493	t2("Remove (absent) ", size, s, key, 0);
494	t3("Put (presized) ", size, s, key, size);
495	dtest(s, size, key);
496	}
497
498	static class TestTimer {
499	private String name;
500	private long numOps;
501	private long startTime;
502	private String cname;
503
504	static final java.util.TreeMap accum = new java.util.TreeMap();
505
506	static void printStats() {
507	for (Iterator it = accum.entrySet().iterator(); it.hasNext(); ) {
508	Map.Entry e = (Map.Entry)(it.next());
509	Stats stats = ((Stats)(e.getValue()));
510	int n = stats.number;
511	double t;
512	if (n > 0)
513	t = stats.sum / n;
514	else
515	t = stats.least;
516	long nano = Math.round(1000000.0 * t);
517	System.out.println(e.getKey() + ": " + nano);
518	}
519	}
520
521	void start(String name, long numOps) {
522	this.name = name;
523	this.cname = classify();
524	this.numOps = numOps;
525	startTime = System.currentTimeMillis();
526	}
527
528
529	String classify() {
530	if (name.startsWith("Get"))
531	return "Get ";
532	else if (name.startsWith("Put"))
533	return "Put ";
534	else if (name.startsWith("Remove"))
535	return "Remove ";
536	else if (name.startsWith("Iter"))
537	return "Iter ";
538	else
539	return null;
540	}
541
542	void finish() {
543	long endTime = System.currentTimeMillis();
544	long time = endTime - startTime;
545	double timePerOp = ((double)time)/numOps;
546
547	Object st = accum.get(name);
548	if (st == null)
549	accum.put(name, new Stats(timePerOp));
550	else {
551	Stats stats = (Stats) st;
552	stats.sum += timePerOp;
553	stats.number++;
554	if (timePerOp < stats.least) stats.least = timePerOp;
555	}
556
557	if (cname != null) {
558	st = accum.get(cname);
559	if (st == null)
560	accum.put(cname, new Stats(timePerOp));
561	else {
562	Stats stats = (Stats) st;
563	stats.sum += timePerOp;
564	stats.number++;
565	if (timePerOp < stats.least) stats.least = timePerOp;
566	}
567	}
568
569	}
570
571	}
572
573	static class Stats {
574	double sum = 0;
575	double least;
576	int number = 0;
577	Stats(double t) { least = t; }
578	}
579
580	static Random rng = new Random();
581
582	static void shuffle(Object[] keys) {
583	int size = keys.length;
584	for (int i=size; i>1; i--) {
585	int r = rng.nextInt(i);
586	Object t = keys[i-1];
587	keys[i-1] = keys[r];
588	keys[r] = t;
589	}
590	}
591
592	}
593