| 19 |
|
listSize = Integer.parseInt(args[2]); |
| 20 |
|
cl = null; |
| 21 |
|
|
| 22 |
< |
try { |
| 23 |
< |
cl = Class.forName(args[0]); |
| 24 |
< |
} catch (ClassNotFoundException e) { |
| 25 |
< |
fail("Class " + args[0] + " not found."); |
| 26 |
< |
} |
| 22 |
> |
try { |
| 23 |
> |
cl = Class.forName(args[0]); |
| 24 |
> |
} catch (ClassNotFoundException e) { |
| 25 |
> |
fail("Class " + args[0] + " not found."); |
| 26 |
> |
} |
| 27 |
|
|
| 28 |
|
synch = (args.length>3); |
| 29 |
|
oneRun(); |
| 33 |
|
|
| 34 |
|
static void oneRun() { |
| 35 |
|
long startTime = System.nanoTime(); |
| 36 |
< |
for (int i=0; i<numItr; i++) { |
| 36 |
> |
for (int i=0; i<numItr; i++) { |
| 37 |
|
elementLoop(); |
| 38 |
< |
} |
| 39 |
< |
List<Integer> s = newList(cl, synch); |
| 40 |
< |
for (int i=0; i<listSize; i++) |
| 41 |
< |
s.add(new Integer(i)); |
| 42 |
< |
if (s.size() != listSize) |
| 43 |
< |
fail("Size of [0..n-1] != n"); |
| 38 |
> |
} |
| 39 |
> |
List<Integer> s = newList(cl, synch); |
| 40 |
> |
for (int i=0; i<listSize; i++) |
| 41 |
> |
s.add(new Integer(i)); |
| 42 |
> |
if (s.size() != listSize) |
| 43 |
> |
fail("Size of [0..n-1] != n"); |
| 44 |
|
evenOdd(s); |
| 45 |
|
sublists(s); |
| 46 |
|
arrays(); |
| 245 |
|
if (s.hashCode() != a.hashCode()) |
| 246 |
|
fail("Incorrect hashCode computation."); |
| 247 |
|
|
| 248 |
< |
List clone = newList(cl, synch); |
| 249 |
< |
clone.addAll(a); |
| 250 |
< |
if (!s.equals(clone)) |
| 251 |
< |
fail("List not equal to copy."); |
| 252 |
< |
if (!s.containsAll(clone)) |
| 253 |
< |
fail("List does not contain copy."); |
| 254 |
< |
if (!clone.containsAll(s)) |
| 255 |
< |
fail("Copy does not contain list."); |
| 248 |
> |
List clone = newList(cl, synch); |
| 249 |
> |
clone.addAll(a); |
| 250 |
> |
if (!s.equals(clone)) |
| 251 |
> |
fail("List not equal to copy."); |
| 252 |
> |
if (!s.containsAll(clone)) |
| 253 |
> |
fail("List does not contain copy."); |
| 254 |
> |
if (!clone.containsAll(s)) |
| 255 |
> |
fail("Copy does not contain list."); |
| 256 |
|
|
| 257 |
< |
return (List<Integer>) clone; |
| 257 |
> |
return (List<Integer>) clone; |
| 258 |
|
} |
| 259 |
|
|
| 260 |
|
static List<Integer> newList(Class cl, boolean synch) { |
| 261 |
< |
try { |
| 262 |
< |
List<Integer> s = (List<Integer>) cl.newInstance(); |
| 261 |
> |
try { |
| 262 |
> |
List<Integer> s = (List<Integer>) cl.newInstance(); |
| 263 |
|
if (synch) |
| 264 |
|
s = Collections.synchronizedList(s); |
| 265 |
< |
if (!s.isEmpty()) |
| 266 |
< |
fail("New instance non empty."); |
| 267 |
< |
return s; |
| 268 |
< |
} catch (Throwable t) { |
| 269 |
< |
fail("Can't instantiate " + cl + ": " + t); |
| 270 |
< |
} |
| 271 |
< |
return null; //Shut up compiler. |
| 265 |
> |
if (!s.isEmpty()) |
| 266 |
> |
fail("New instance non empty."); |
| 267 |
> |
return s; |
| 268 |
> |
} catch (Throwable t) { |
| 269 |
> |
fail("Can't instantiate " + cl + ": " + t); |
| 270 |
> |
} |
| 271 |
> |
return null; //Shut up compiler. |
| 272 |
|
} |
| 273 |
|
|
| 274 |
|
static void AddRandoms(List<Integer> s, int n) { |
| 275 |
< |
for (int i=0; i<n; i++) { |
| 276 |
< |
int r = rnd.nextInt() % n; |
| 277 |
< |
Integer e = new Integer(r < 0 ? -r : r); |
| 278 |
< |
|
| 279 |
< |
int preSize = s.size(); |
| 280 |
< |
if (!s.add(e)) |
| 281 |
< |
fail ("Add failed."); |
| 282 |
< |
int postSize = s.size(); |
| 283 |
< |
if (postSize-preSize != 1) |
| 284 |
< |
fail ("Add didn't increase size by 1."); |
| 285 |
< |
} |
| 275 |
> |
for (int i=0; i<n; i++) { |
| 276 |
> |
int r = rnd.nextInt() % n; |
| 277 |
> |
Integer e = new Integer(r < 0 ? -r : r); |
| 278 |
> |
|
| 279 |
> |
int preSize = s.size(); |
| 280 |
> |
if (!s.add(e)) |
| 281 |
> |
fail ("Add failed."); |
| 282 |
> |
int postSize = s.size(); |
| 283 |
> |
if (postSize-preSize != 1) |
| 284 |
> |
fail ("Add didn't increase size by 1."); |
| 285 |
> |
} |
| 286 |
|
} |
| 287 |
|
|
| 288 |
|
static void fail(String s) { |
| 289 |
< |
System.out.println(s); |
| 290 |
< |
System.exit(1); |
| 289 |
> |
System.out.println(s); |
| 290 |
> |
System.exit(1); |
| 291 |
|
} |
| 292 |
|
} |
