| 1 |
|
/* |
| 2 |
|
* Written by Josh Bloch of Google Inc. and released to the public domain, |
| 3 |
< |
* as explained at http://creativecommons.org/licenses/publicdomain. |
| 3 |
> |
* as explained at http://creativecommons.org/publicdomain/zero/1.0/. |
| 4 |
|
*/ |
| 5 |
|
|
| 6 |
– |
import java.util.*; |
| 6 |
|
import java.io.*; |
| 7 |
+ |
import java.util.*; |
| 8 |
|
|
| 9 |
|
/** |
| 10 |
|
* Interface-based Deque tester. This test currently makes three |
| 22 |
|
static int nextHead = -1; |
| 23 |
|
static int size() { return nextTail - nextHead - 1; } |
| 24 |
|
|
| 25 |
– |
|
| 26 |
– |
static int random(int bound) { |
| 27 |
– |
int x = seed; |
| 28 |
– |
int t = (x % 127773) * 16807 - (x / 127773) * 2836; |
| 29 |
– |
seed = (t > 0) ? t : t + 0x7fffffff; |
| 30 |
– |
return (t & 0x7fffffff) % bound; |
| 31 |
– |
} |
| 32 |
– |
|
| 25 |
|
static int random() { |
| 26 |
< |
int x = seed; |
| 27 |
< |
int t = (x % 127773) * 16807 - (x / 127773) * 2836; |
| 28 |
< |
seed = (t > 0) ? t : t + 0x7fffffff; |
| 29 |
< |
return (t & 0x7fffffff); |
| 26 |
> |
int r = seed; |
| 27 |
> |
r ^= r << 13; // xorshift |
| 28 |
> |
r ^= r >>> 17; |
| 29 |
> |
return seed = r ^ (r << 5); |
| 30 |
|
} |
| 31 |
|
|
| 32 |
< |
public static void main(String args[]) throws Exception { |
| 33 |
< |
Class cls = Class.forName(args[0]); |
| 34 |
< |
int n = 1000000; |
| 32 |
> |
static int random(int bound) { |
| 33 |
> |
return (random() & 0x7fffffff) % bound; |
| 34 |
> |
} |
| 35 |
|
|
| 36 |
< |
for (int j = 0; j < 3; ++j) { |
| 36 |
> |
public static void main(String[] args) throws Exception { |
| 37 |
> |
Class<?> cls = Class.forName(args[0]); |
| 38 |
> |
long startTime = System.nanoTime(); |
| 39 |
> |
for (int j = 0; j < 200; ++j) { |
| 40 |
> |
@SuppressWarnings("unchecked") |
| 41 |
|
Deque<Integer> deque = (Deque<Integer>) cls.newInstance(); |
| 42 |
|
nextTail = 0; |
| 43 |
|
nextHead = -1; |
| 44 |
< |
long start = System.currentTimeMillis(); |
| 49 |
< |
mainTest(deque, n); |
| 50 |
< |
long end = System.currentTimeMillis(); |
| 51 |
< |
System.out.println("Time: " + (end - start) + "ms"); |
| 44 |
> |
mainTest(deque, (random() & ((1 << 20) - 1))); |
| 45 |
|
if (deque.isEmpty()) System.out.print(" "); |
| 46 |
+ |
if ((j % 10) == 9) System.out.print("."); |
| 47 |
|
} |
| 48 |
+ |
long now = System.nanoTime(); |
| 49 |
+ |
long elapsedTimeMillis = (now - startTime) / (1000L * 1000L); |
| 50 |
+ |
System.out.printf("\ntotal time %d ms\n", elapsedTimeMillis); |
| 51 |
|
|
| 52 |
|
} |
| 53 |
|
|
| 68 |
|
|
| 69 |
|
// Test serialization and copying |
| 70 |
|
if ((i & 4095) == 0) { |
| 71 |
< |
testEqual(deque, deepCopy(deque)); |
| 72 |
< |
testEqual(deque, (Deque<Integer>) deque.getClass(). |
| 76 |
< |
getConstructor(Collection.class).newInstance(deque)); |
| 71 |
> |
testEqual(deque, serialClone(deque)); |
| 72 |
> |
testEqual(deque, copyConstructorClone(deque)); |
| 73 |
|
} |
| 74 |
|
|
| 75 |
|
// Test fancy removal stuff once in a blue moon |
| 76 |
|
if ((i & 8191) == 0) |
| 77 |
|
testRemove(deque); |
| 78 |
< |
|
| 83 |
< |
} |
| 78 |
> |
} |
| 79 |
|
|
| 80 |
|
// Stupid tests for clear, toString |
| 81 |
|
deque.clear(); |
| 148 |
|
deque.getLast() + " expecting " + (nextTail - 1)); |
| 149 |
|
} |
| 150 |
|
|
| 156 |
– |
|
| 151 |
|
static void randomOp(Deque<Integer> deque) throws Exception { |
| 152 |
|
|
| 153 |
|
// Perform a random operation |
| 224 |
|
} |
| 225 |
|
} |
| 226 |
|
|
| 233 |
– |
|
| 227 |
|
private static void testEqual(Deque<Integer> d1, Deque<Integer> d2) |
| 228 |
|
throws Exception |
| 229 |
|
{ |
| 263 |
|
throw new Exception("d2 contains all of {Integer.MIN_VALUE }"); |
| 264 |
|
} |
| 265 |
|
|
| 266 |
< |
private static <T> T deepCopy(T o) { |
| 267 |
< |
try { |
| 268 |
< |
ByteArrayOutputStream bos = new ByteArrayOutputStream(); |
| 269 |
< |
ObjectOutputStream oos = new ObjectOutputStream(bos); |
| 270 |
< |
oos.writeObject(o); |
| 271 |
< |
oos.flush(); |
| 272 |
< |
ByteArrayInputStream bin = new ByteArrayInputStream( |
| 273 |
< |
bos.toByteArray()); |
| 274 |
< |
ObjectInputStream ois = new ObjectInputStream(bin); |
| 266 |
> |
@SuppressWarnings("unchecked") |
| 267 |
> |
private static <T> T copyConstructorClone(T o) throws Exception { |
| 268 |
> |
return (T) o.getClass().getConstructor(Collection.class).newInstance(o); |
| 269 |
> |
} |
| 270 |
> |
|
| 271 |
> |
@SuppressWarnings("unchecked") |
| 272 |
> |
private static <T> T serialClone(T o) throws Exception { |
| 273 |
> |
ByteArrayOutputStream bos = new ByteArrayOutputStream(); |
| 274 |
> |
ObjectOutputStream oos = new ObjectOutputStream(bos); |
| 275 |
> |
oos.writeObject(o); |
| 276 |
> |
oos.flush(); |
| 277 |
> |
oos.close(); |
| 278 |
> |
ByteArrayInputStream bin = |
| 279 |
> |
new ByteArrayInputStream(bos.toByteArray()); |
| 280 |
> |
ObjectInputStream ois = new ObjectInputStream(bin); |
| 281 |
|
return (T) ois.readObject(); |
| 283 |
– |
} catch (Exception e) { |
| 284 |
– |
throw new IllegalArgumentException(e); |
| 285 |
– |
} |
| 282 |
|
} |
| 283 |
|
|
| 284 |
|
private static void testRemove(Deque<Integer> deque) throws Exception { |
| 285 |
< |
Deque<Integer> copy = null; |
| 286 |
< |
switch (random() & 1) { |
| 287 |
< |
case 0: |
| 292 |
< |
copy = (Deque<Integer>) deque.getClass(). |
| 293 |
< |
getConstructor(Collection.class).newInstance(deque); |
| 294 |
< |
break; |
| 295 |
< |
case 1: |
| 296 |
< |
copy = deepCopy(deque); |
| 297 |
< |
break; |
| 298 |
< |
default: |
| 299 |
< |
throw new Exception("How'd we get here"); |
| 300 |
< |
} |
| 285 |
> |
Deque<Integer> copy = ((random() & 1) == 0) ? |
| 286 |
> |
copyConstructorClone(deque) : |
| 287 |
> |
serialClone(deque); |
| 288 |
|
|
| 289 |
|
int numRemoved = 0; |
| 290 |
|
for (Iterator<Integer> it = copy.iterator(); it.hasNext(); ) { |
| 322 |
|
|
| 323 |
|
testEmpty(copy); |
| 324 |
|
|
| 325 |
< |
copy = (Deque<Integer>) deque.getClass(). |
| 339 |
< |
getConstructor(Collection.class).newInstance(deque); |
| 325 |
> |
copy = copyConstructorClone(deque); |
| 326 |
|
copy.retainAll(deque); |
| 327 |
|
testEqual(deque, copy); |
| 328 |
|
copy.removeAll(deque); |
