108 |
|
timer.start(nm, n * iters); |
109 |
|
for (int j = 0; j < iters; ++j) { |
110 |
|
for (int i = 0; i < n; i++) { |
111 |
< |
if ((Integer)(s.get(i)) != i) ++sum; |
111 |
> |
if ((Integer) (s.get(i)) != i) ++sum; |
112 |
|
} |
113 |
|
} |
114 |
|
timer.finish(); |
272 |
|
reallyAssert (!s.containsKey(k)); |
273 |
|
while (it.hasNext()) { |
274 |
|
Map.Entry<Integer,Integer> x = (Map.Entry<Integer,Integer>)(it.next()); |
275 |
< |
Integer k2 = (Integer)x.getKey(); |
275 |
> |
Integer k2 = (Integer) x.getKey(); |
276 |
|
seen.put(k2, k2); |
277 |
|
if (k2 != MISSING) |
278 |
|
++sum; |
348 |
|
|
349 |
|
static void entest(Map<Integer,Integer> s, int size) { |
350 |
|
if (s instanceof Hashtable) { |
351 |
< |
Hashtable ht = (Hashtable)s; |
351 |
> |
Hashtable ht = (Hashtable) s; |
352 |
|
// entest3(ht, size); |
353 |
|
// entest4(ht, size); |
354 |
|
entest1(ht, size); |
532 |
|
static void printStats() { |
533 |
|
for (Iterator it = accum.entrySet().iterator(); it.hasNext(); ) { |
534 |
|
Map.Entry e = (Map.Entry)(it.next()); |
535 |
< |
Stats stats = ((Stats)(e.getValue())); |
535 |
> |
Stats stats = ((Stats) (e.getValue())); |
536 |
|
long n = stats.number; |
537 |
|
double t; |
538 |
|
if (n > 0) |