| 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 |
| 4 |
> |
* http://creativecommons.org/publicdomain/zero/1.0/ |
| 5 |
|
*/ |
| 6 |
|
|
| 7 |
|
import java.util.*; |
| 11 |
|
/** |
| 12 |
|
* A micro-benchmark with key types and operation mixes roughly |
| 13 |
|
* corresponding to some real programs. |
| 14 |
< |
* |
| 14 |
> |
* |
| 15 |
|
* The main results are a table of approximate nanoseconds per |
| 16 |
|
* element-operation (averaged across get, put etc) for each type, |
| 17 |
|
* across a range of map sizes. It also includes category "Mixed" |
| 24 |
|
* dynamic type specialization. Some test classes, like Float and |
| 25 |
|
* BigDecimal are included not because they are commonly used as keys, |
| 26 |
|
* but because they can be problematic for some map implementations. |
| 27 |
< |
* |
| 27 |
> |
* |
| 28 |
|
* By default, it creates and inserts in order dense numerical keys |
| 29 |
|
* and searches for keys in scrambled order. Use "s" as second arg to |
| 30 |
|
* instead insert and search in unscrambled order. |
| 31 |
|
* |
| 32 |
|
* For String keys, the program tries to use file "testwords.txt", which |
| 33 |
|
* is best used with real words. We can't check in this file, but you |
| 34 |
< |
* can create one from a real dictonary (1 line per word) and then run |
| 34 |
> |
* can create one from a real dictionary (1 line per word) and then run |
| 35 |
|
* linux "shuf" to randomize entries. If no file exists, it uses |
| 36 |
|
* String.valueOf(i) for element i. |
| 37 |
|
*/ |
| 61 |
|
System.out.println("Usage: java MapMicroBenchmark className [r|s]keys [r|s]searches"); |
| 62 |
|
return; |
| 63 |
|
} |
| 64 |
< |
|
| 64 |
> |
|
| 65 |
|
mapClass = Class.forName(args[0]); |
| 66 |
|
|
| 67 |
|
if (args.length > 1) { |
| 102 |
|
jobs[2] = new Job("Integer ", is, Integer.class); |
| 103 |
|
|
| 104 |
|
Object[] ls = new Object[n]; |
| 105 |
< |
for (int i = 0; i < n; i++) ls[i] = Long.valueOf((long)i); |
| 105 |
> |
for (int i = 0; i < n; i++) ls[i] = Long.valueOf((long) i); |
| 106 |
|
jobs[3] = new Job("Long ", ls, Long.class); |
| 107 |
|
|
| 108 |
|
Object[] fs = new Object[n]; |
| 109 |
< |
for (int i = 0; i < n; i++) fs[i] = Float.valueOf((float)i); |
| 109 |
> |
for (int i = 0; i < n; i++) fs[i] = Float.valueOf((float) i); |
| 110 |
|
jobs[4] = new Job("Float ", fs, Float.class); |
| 111 |
|
|
| 112 |
|
Object[] ds = new Object[n]; |
| 113 |
< |
for (int i = 0; i < n; i++) ds[i] = Double.valueOf((double)i); |
| 113 |
> |
for (int i = 0; i < n; i++) ds[i] = Double.valueOf((double) i); |
| 114 |
|
jobs[5] = new Job("Double ", ds, Double.class); |
| 115 |
|
|
| 116 |
|
Object[] bs = new Object[n]; |
| 143 |
|
warmup1(mixed); |
| 144 |
|
warmup3(jobs); |
| 145 |
|
Thread.sleep(500); |
| 146 |
< |
time(jobs); |
| 146 |
> |
time(jobs); |
| 147 |
|
} |
| 148 |
|
|
| 149 |
|
static void runWork(Job[] jobs, int minIters, int maxIters, long timeLimit) throws Throwable { |
| 193 |
|
long[] aves = new long[nsizes]; |
| 194 |
|
int njobs = jobs.length; |
| 195 |
|
|
| 196 |
< |
for (int i = 0; i < njobs; i++) { |
| 196 |
> |
for (int i = 0; i < njobs; i++) { |
| 197 |
|
System.out.print(jobs[i].name); |
| 198 |
|
for (int k = 0; k < nsizes; ++k) { |
| 199 |
|
long nanos = jobs[i].nanos[k]; |
| 212 |
|
|
| 213 |
|
|
| 214 |
|
static final class Job { |
| 215 |
< |
final String name; |
| 215 |
> |
final String name; |
| 216 |
|
final Class elementClass; |
| 217 |
|
long[] nanos = new long[nsizes]; |
| 218 |
|
final Object[] items; |
| 236 |
|
public long work(int len, int minIters, int maxIters, long timeLimit) { |
| 237 |
|
Map m; |
| 238 |
|
try { |
| 239 |
< |
m = (Map)mapClass.newInstance(); |
| 240 |
< |
} catch(Exception e) { |
| 239 |
> |
m = (Map) mapClass.newInstance(); |
| 240 |
> |
} catch (Exception e) { |
| 241 |
|
throw new RuntimeException("Can't instantiate " + mapClass + ": " + e); |
| 242 |
|
} |
| 243 |
|
Object[] ins = items; |
| 261 |
|
sum += len - half; |
| 262 |
|
for (int i = 0; i < len; ++i) { |
| 263 |
|
Object x = keys[i]; |
| 264 |
< |
Object v = m.get(x); |
| 264 |
> |
Object v = m.get(x); |
| 265 |
|
if (elementClass.isInstance(v)) // touch v |
| 266 |
|
++sum; |
| 267 |
|
} |
| 273 |
|
} |
| 274 |
|
checkSum += sum ^ (sum << 3); |
| 275 |
|
for (Object e : m.keySet()) { |
| 276 |
< |
if (elementClass.isInstance(e)) |
| 276 |
> |
if (elementClass.isInstance(e)) |
| 277 |
|
++sum; |
| 278 |
|
} |
| 279 |
|
checkSum += sum ^ (sum << 4); |
| 280 |
|
for (Object e : m.values()) { |
| 281 |
< |
if (elementClass.isInstance(e)) |
| 281 |
> |
if (elementClass.isInstance(e)) |
| 282 |
|
++sum; |
| 283 |
|
} |
| 284 |
|
checkSum += sum ^ (sum << 5); |
| 340 |
|
|
| 341 |
|
if (j == 0 && sum != lastSum + len * OPS_PER_ITER) |
| 342 |
|
throw new Error(name); |
| 343 |
< |
|
| 343 |
> |
|
| 344 |
|
elapsed = System.nanoTime() - startTime; |
| 345 |
|
++j; |
| 346 |
|
if (j >= minIters && |
| 347 |
|
(j >= maxIters || elapsed >= timeLimit)) |
| 348 |
|
break; |
| 349 |
|
// non-warmup - swap some keys for next insert |
| 350 |
< |
if (minIters != 1 && randomSearches) |
| 350 |
> |
if (minIters != 1 && randomSearches) |
| 351 |
|
shuffleSome(ins, len, len >>> 3); |
| 352 |
|
} |
| 353 |
< |
long ops = ((long)j) * len * OPS_PER_ITER; |
| 353 |
> |
long ops = ((long) j) * len * OPS_PER_ITER; |
| 354 |
|
lastSum = sum; |
| 355 |
|
return elapsed / ops; |
| 356 |
|
} |
| 365 |
|
// more realistic |
| 366 |
|
static void scramble(Object[] a) { |
| 367 |
|
for (int k = 0; k < sizes.length; ++k) { |
| 368 |
< |
int origin = k == 0? 0 : sizes[k-1]; |
| 368 |
> |
int origin = (k == 0) ? 0 : sizes[k-1]; |
| 369 |
|
for (int i = sizes[k]; i > origin + 1; i--) { |
| 370 |
|
Object t = a[i-1]; |
| 371 |
|
int r = rng.nextInt(i - origin) + origin; |
| 373 |
|
a[r] = t; |
| 374 |
|
} |
| 375 |
|
} |
| 376 |
< |
} |
| 376 |
> |
} |
| 377 |
|
|
| 378 |
|
// plain array shuffle |
| 379 |
|
static void shuffle(Object[] a, int size) { |
| 425 |
|
} |
| 426 |
|
|
| 427 |
|
// Read in String keys from file if possible |
| 428 |
< |
static void initStringKeys(Object[] keys, int n) throws Exception { |
| 428 |
> |
static void initStringKeys(Object[] keys, int n) throws Exception { |
| 429 |
|
FileInputStream fr = null; |
| 430 |
|
try { |
| 431 |
|
fr = new FileInputStream(wordFile); |
| 442 |
|
StringBuffer sb = new StringBuffer(); |
| 443 |
|
for (;;) { |
| 444 |
|
int c = in.read(); |
| 445 |
< |
if (c < 0) |
| 445 |
> |
if (c < 0) |
| 446 |
|
break outer; |
| 447 |
< |
char ch = (char)c; |
| 447 |
> |
char ch = (char) c; |
| 448 |
|
if (ch == '\n') { |
| 449 |
|
keys[k++] = sb.toString(); |
| 450 |
|
break; |
| 458 |
|
// fill up remaining keys with path-like compounds of previous pairs |
| 459 |
|
int j = 0; |
| 460 |
|
while (k < n) |
| 461 |
< |
keys[k++] = (String)keys[j++] + "/" + (String)keys[j]; |
| 461 |
> |
keys[k++] = (String) keys[j++] + "/" + (String) keys[j]; |
| 462 |
|
} |
| 463 |
|
|
| 464 |
|
} |
| 465 |
– |
|
