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 |
timer.start("Iter Entry ", size); |
234 |
for (Iterator it = s.entrySet().iterator(); it.hasNext(); ) { |
235 |
if(it.next() != MISSING) |
236 |
++sum; |
237 |
} |
238 |
timer.finish(); |
239 |
reallyAssert (sum == size); |
240 |
} |
241 |
|
242 |
static void ittest4(Map s, int size, int pos) { |
243 |
IdentityHashMap seen = new IdentityHashMap(size); |
244 |
reallyAssert (s.size() == size); |
245 |
int sum = 0; |
246 |
timer.start("Iter XEntry ", size); |
247 |
Iterator it = s.entrySet().iterator(); |
248 |
Object k = null; |
249 |
Object v = null; |
250 |
for (int i = 0; i < size-pos; ++i) { |
251 |
Map.Entry x = (Map.Entry)(it.next()); |
252 |
k = x.getKey(); |
253 |
v = x.getValue(); |
254 |
seen.put(k, k); |
255 |
if (x != MISSING) |
256 |
++sum; |
257 |
} |
258 |
reallyAssert (s.containsKey(k)); |
259 |
it.remove(); |
260 |
reallyAssert (!s.containsKey(k)); |
261 |
while (it.hasNext()) { |
262 |
Map.Entry x = (Map.Entry)(it.next()); |
263 |
Object k2 = x.getKey(); |
264 |
seen.put(k2, k2); |
265 |
if (x != MISSING) |
266 |
++sum; |
267 |
} |
268 |
|
269 |
reallyAssert (s.size() == size-1); |
270 |
s.put(k, v); |
271 |
reallyAssert (seen.size() == size); |
272 |
timer.finish(); |
273 |
reallyAssert (sum == size); |
274 |
reallyAssert (s.size() == size); |
275 |
} |
276 |
|
277 |
|
278 |
static void ittest(Map s, int size) { |
279 |
ittest1(s, size); |
280 |
ittest2(s, size); |
281 |
ittest3(s, size); |
282 |
// for (int i = 0; i < size-1; ++i) |
283 |
// ittest4(s, size, i); |
284 |
} |
285 |
|
286 |
static void entest1(Hashtable ht, int size) { |
287 |
int sum = 0; |
288 |
|
289 |
timer.start("Iter Enumeration Key ", size); |
290 |
for (Enumeration en = ht.keys(); en.hasMoreElements(); ) { |
291 |
if (en.nextElement() != MISSING) |
292 |
++sum; |
293 |
} |
294 |
timer.finish(); |
295 |
reallyAssert (sum == size); |
296 |
} |
297 |
|
298 |
static void entest2(Hashtable ht, int size) { |
299 |
int sum = 0; |
300 |
timer.start("Iter Enumeration Value ", size); |
301 |
for (Enumeration en = ht.elements(); en.hasMoreElements(); ) { |
302 |
if (en.nextElement() != MISSING) |
303 |
++sum; |
304 |
} |
305 |
timer.finish(); |
306 |
reallyAssert (sum == size); |
307 |
} |
308 |
|
309 |
|
310 |
static void entest3(Hashtable ht, int size) { |
311 |
int sum = 0; |
312 |
|
313 |
timer.start("Iterf Enumeration Key ", size); |
314 |
Enumeration en = ht.keys(); |
315 |
for (int i = 0; i < size; ++i) { |
316 |
if (en.nextElement() != MISSING) |
317 |
++sum; |
318 |
} |
319 |
timer.finish(); |
320 |
reallyAssert (sum == size); |
321 |
} |
322 |
|
323 |
static void entest4(Hashtable ht, int size) { |
324 |
int sum = 0; |
325 |
timer.start("Iterf Enumeration Value", size); |
326 |
Enumeration en = ht.elements(); |
327 |
for (int i = 0; i < size; ++i) { |
328 |
if (en.nextElement() != MISSING) |
329 |
++sum; |
330 |
} |
331 |
timer.finish(); |
332 |
reallyAssert (sum == size); |
333 |
} |
334 |
|
335 |
static void entest(Map s, int size) { |
336 |
if (s instanceof Hashtable) { |
337 |
Hashtable ht = (Hashtable)s; |
338 |
// entest3(ht, size); |
339 |
// entest4(ht, size); |
340 |
entest1(ht, size); |
341 |
entest2(ht, size); |
342 |
entest1(ht, size); |
343 |
entest2(ht, size); |
344 |
entest1(ht, size); |
345 |
entest2(ht, size); |
346 |
} |
347 |
} |
348 |
|
349 |
static void rtest(Map s, int size) { |
350 |
timer.start("Remove (iterator) ", size); |
351 |
for (Iterator it = s.keySet().iterator(); it.hasNext(); ) { |
352 |
it.next(); |
353 |
it.remove(); |
354 |
} |
355 |
timer.finish(); |
356 |
} |
357 |
|
358 |
static void rvtest(Map s, int size) { |
359 |
timer.start("Remove (iterator) ", size); |
360 |
for (Iterator it = s.values().iterator(); it.hasNext(); ) { |
361 |
it.next(); |
362 |
it.remove(); |
363 |
} |
364 |
timer.finish(); |
365 |
} |
366 |
|
367 |
|
368 |
static void dtest(Map s, int size, Object[] key) { |
369 |
timer.start("Put (putAll) ", size * 2); |
370 |
Map s2 = null; |
371 |
try { |
372 |
s2 = (Map) (s.getClass().newInstance()); |
373 |
s2.putAll(s); |
374 |
} |
375 |
catch (Exception e) { e.printStackTrace(); return; } |
376 |
timer.finish(); |
377 |
|
378 |
timer.start("Iter Equals ", size * 2); |
379 |
boolean eqt = s2.equals(s) && s.equals(s2); |
380 |
reallyAssert (eqt); |
381 |
timer.finish(); |
382 |
|
383 |
timer.start("Iter HashCode ", size * 2); |
384 |
int shc = s.hashCode(); |
385 |
int s2hc = s2.hashCode(); |
386 |
reallyAssert (shc == s2hc); |
387 |
timer.finish(); |
388 |
|
389 |
timer.start("Put (present) ", size); |
390 |
s2.putAll(s); |
391 |
timer.finish(); |
392 |
|
393 |
timer.start("Iter EntrySet contains ", size * 2); |
394 |
Set es2 = s2.entrySet(); |
395 |
int sum = 0; |
396 |
for (Iterator i1 = s.entrySet().iterator(); i1.hasNext(); ) { |
397 |
Object entry = i1.next(); |
398 |
if (es2.contains(entry)) ++sum; |
399 |
} |
400 |
timer.finish(); |
401 |
reallyAssert (sum == size); |
402 |
|
403 |
t6("Get ", size, s2, key, absent); |
404 |
|
405 |
Object hold = s2.get(key[size-1]); |
406 |
s2.put(key[size-1], absent[0]); |
407 |
timer.start("Iter Equals ", size * 2); |
408 |
eqt = s2.equals(s) && s.equals(s2); |
409 |
reallyAssert (!eqt); |
410 |
timer.finish(); |
411 |
|
412 |
timer.start("Iter HashCode ", size * 2); |
413 |
int s1h = s.hashCode(); |
414 |
int s2h = s2.hashCode(); |
415 |
reallyAssert (s1h != s2h); |
416 |
timer.finish(); |
417 |
|
418 |
s2.put(key[size-1], hold); |
419 |
timer.start("Remove (iterator) ", size * 2); |
420 |
Iterator s2i = s2.entrySet().iterator(); |
421 |
Set es = s.entrySet(); |
422 |
while (s2i.hasNext()) |
423 |
es.remove(s2i.next()); |
424 |
timer.finish(); |
425 |
|
426 |
reallyAssert (s.isEmpty()); |
427 |
|
428 |
timer.start("Clear ", size); |
429 |
s2.clear(); |
430 |
timer.finish(); |
431 |
reallyAssert (s2.isEmpty() && s.isEmpty()); |
432 |
} |
433 |
|
434 |
static void stest(Map s, int size) throws Exception { |
435 |
if (!(s instanceof Serializable)) |
436 |
return; |
437 |
System.out.print("Serialize : "); |
438 |
|
439 |
for (int i = 0; i < size; i++) { |
440 |
s.put(new Integer(i), Boolean.TRUE); |
441 |
} |
442 |
|
443 |
long startTime = System.currentTimeMillis(); |
444 |
|
445 |
FileOutputStream fs = new FileOutputStream("MapCheck.dat"); |
446 |
ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(fs)); |
447 |
out.writeObject(s); |
448 |
out.close(); |
449 |
|
450 |
FileInputStream is = new FileInputStream("MapCheck.dat"); |
451 |
ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(is)); |
452 |
Map m = (Map)in.readObject(); |
453 |
|
454 |
long endTime = System.currentTimeMillis(); |
455 |
long time = endTime - startTime; |
456 |
|
457 |
System.out.print(time + "ms"); |
458 |
|
459 |
if (s instanceof IdentityHashMap) return; |
460 |
reallyAssert (s.equals(m)); |
461 |
} |
462 |
|
463 |
|
464 |
static void test(Map s, Object[] key) { |
465 |
int size = key.length; |
466 |
|
467 |
t3("Put (absent) ", size, s, key, size); |
468 |
t3("Put (present) ", size, s, key, 0); |
469 |
t7("ContainsKey ", size, s, key, absent); |
470 |
t4("ContainsKey ", size, s, key, size); |
471 |
ktest(s, size, key); |
472 |
t4("ContainsKey ", absentSize, s, absent, 0); |
473 |
t6("Get ", size, s, key, absent); |
474 |
t1("Get (present) ", size, s, key, size); |
475 |
t1("Get (absent) ", absentSize, s, absent, 0); |
476 |
t2("Remove (absent) ", absentSize, s, absent, 0); |
477 |
t5("Remove (present) ", size, s, key, size / 2); |
478 |
t3("Put (half present) ", size, s, key, size / 2); |
479 |
|
480 |
ittest(s, size); |
481 |
entest(s, size); |
482 |
t9(s); |
483 |
rtest(s, size); |
484 |
|
485 |
t4("ContainsKey ", size, s, key, 0); |
486 |
t2("Remove (absent) ", size, s, key, 0); |
487 |
t3("Put (presized) ", size, s, key, size); |
488 |
dtest(s, size, key); |
489 |
} |
490 |
|
491 |
static class TestTimer { |
492 |
private String name; |
493 |
private long numOps; |
494 |
private long startTime; |
495 |
private String cname; |
496 |
|
497 |
static final java.util.TreeMap accum = new java.util.TreeMap(); |
498 |
|
499 |
static void printStats() { |
500 |
for (Iterator it = accum.entrySet().iterator(); it.hasNext(); ) { |
501 |
Map.Entry e = (Map.Entry)(it.next()); |
502 |
Stats stats = ((Stats)(e.getValue())); |
503 |
int n = stats.number; |
504 |
double t; |
505 |
if (n > 0) |
506 |
t = stats.sum / n; |
507 |
else |
508 |
t = stats.least; |
509 |
long nano = Math.round(1000000.0 * t); |
510 |
System.out.println(e.getKey() + ": " + nano); |
511 |
} |
512 |
} |
513 |
|
514 |
void start(String name, long numOps) { |
515 |
this.name = name; |
516 |
this.cname = classify(); |
517 |
this.numOps = numOps; |
518 |
startTime = System.currentTimeMillis(); |
519 |
} |
520 |
|
521 |
|
522 |
String classify() { |
523 |
if (name.startsWith("Get")) |
524 |
return "Get "; |
525 |
else if (name.startsWith("Put")) |
526 |
return "Put "; |
527 |
else if (name.startsWith("Remove")) |
528 |
return "Remove "; |
529 |
else if (name.startsWith("Iter")) |
530 |
return "Iter "; |
531 |
else |
532 |
return null; |
533 |
} |
534 |
|
535 |
void finish() { |
536 |
long endTime = System.currentTimeMillis(); |
537 |
long time = endTime - startTime; |
538 |
double timePerOp = ((double)time)/numOps; |
539 |
|
540 |
Object st = accum.get(name); |
541 |
if (st == null) |
542 |
accum.put(name, new Stats(timePerOp)); |
543 |
else { |
544 |
Stats stats = (Stats) st; |
545 |
stats.sum += timePerOp; |
546 |
stats.number++; |
547 |
if (timePerOp < stats.least) stats.least = timePerOp; |
548 |
} |
549 |
|
550 |
if (cname != null) { |
551 |
st = accum.get(cname); |
552 |
if (st == null) |
553 |
accum.put(cname, new Stats(timePerOp)); |
554 |
else { |
555 |
Stats stats = (Stats) st; |
556 |
stats.sum += timePerOp; |
557 |
stats.number++; |
558 |
if (timePerOp < stats.least) stats.least = timePerOp; |
559 |
} |
560 |
} |
561 |
|
562 |
} |
563 |
|
564 |
} |
565 |
|
566 |
static class Stats { |
567 |
double sum = 0; |
568 |
double least; |
569 |
int number = 0; |
570 |
Stats(double t) { least = t; } |
571 |
} |
572 |
|
573 |
static Random rng = new Random(); |
574 |
|
575 |
static void shuffle(Object[] keys) { |
576 |
int size = keys.length; |
577 |
for (int i=size; i>1; i--) { |
578 |
int r = rng.nextInt(i); |
579 |
Object t = keys[i-1]; |
580 |
keys[i-1] = keys[r]; |
581 |
keys[r] = t; |
582 |
} |
583 |
} |
584 |
|
585 |
} |
586 |
|