41 |
|
} |
42 |
|
|
43 |
|
public static Test suite() { |
44 |
+ |
class Implementation implements CollectionImplementation { |
45 |
+ |
public Class<?> klazz() { return LinkedBlockingDeque.class; } |
46 |
+ |
public Collection emptyCollection() { return new LinkedBlockingDeque(); } |
47 |
+ |
public Object makeElement(int i) { return i; } |
48 |
+ |
public boolean isConcurrent() { return true; } |
49 |
+ |
public boolean permitsNulls() { return false; } |
50 |
+ |
} |
51 |
|
return newTestSuite(LinkedBlockingDequeTest.class, |
52 |
|
new Unbounded().testSuite(), |
53 |
< |
new Bounded().testSuite()); |
53 |
> |
new Bounded().testSuite(), |
54 |
> |
CollectionTest.testSuite(new Implementation())); |
55 |
|
} |
56 |
|
|
57 |
|
/** |
58 |
|
* Returns a new deque of given size containing consecutive |
59 |
< |
* Integers 0 ... n. |
59 |
> |
* Integers 0 ... n - 1. |
60 |
|
*/ |
61 |
< |
private LinkedBlockingDeque<Integer> populatedDeque(int n) { |
61 |
> |
private static LinkedBlockingDeque<Integer> populatedDeque(int n) { |
62 |
|
LinkedBlockingDeque<Integer> q = |
63 |
|
new LinkedBlockingDeque<Integer>(n); |
64 |
|
assertTrue(q.isEmpty()); |
67 |
|
assertFalse(q.isEmpty()); |
68 |
|
assertEquals(0, q.remainingCapacity()); |
69 |
|
assertEquals(n, q.size()); |
70 |
+ |
assertEquals((Integer) 0, q.peekFirst()); |
71 |
+ |
assertEquals((Integer) (n - 1), q.peekLast()); |
72 |
|
return q; |
73 |
|
} |
74 |
|
|
442 |
|
} |
443 |
|
|
444 |
|
/** |
445 |
< |
* push succeeds if not full; throws ISE if full |
445 |
> |
* push succeeds if not full; throws IllegalStateException if full |
446 |
|
*/ |
447 |
|
public void testPush() { |
448 |
|
LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE); |
492 |
|
} |
493 |
|
|
494 |
|
/** |
495 |
< |
* add succeeds if not full; throws ISE if full |
495 |
> |
* add succeeds if not full; throws IllegalStateException if full |
496 |
|
*/ |
497 |
|
public void testAdd() { |
498 |
|
LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE); |
506 |
|
} |
507 |
|
|
508 |
|
/** |
509 |
< |
* addAll(this) throws IAE |
509 |
> |
* addAll(this) throws IllegalArgumentException |
510 |
|
*/ |
511 |
|
public void testAddAllSelf() { |
512 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
604 |
|
}}); |
605 |
|
|
606 |
|
await(pleaseInterrupt); |
607 |
< |
assertThreadStaysAlive(t); |
607 |
> |
if (randomBoolean()) assertThreadBlocks(t, Thread.State.WAITING); |
608 |
|
t.interrupt(); |
609 |
|
awaitTermination(t); |
610 |
|
assertEquals(SIZE, q.size()); |
626 |
|
pleaseTake.countDown(); |
627 |
|
q.put(86); |
628 |
|
|
629 |
+ |
Thread.currentThread().interrupt(); |
630 |
+ |
try { |
631 |
+ |
q.put(99); |
632 |
+ |
shouldThrow(); |
633 |
+ |
} catch (InterruptedException success) {} |
634 |
+ |
assertFalse(Thread.interrupted()); |
635 |
+ |
|
636 |
|
pleaseInterrupt.countDown(); |
637 |
|
try { |
638 |
|
q.put(99); |
646 |
|
assertEquals(0, q.take()); |
647 |
|
|
648 |
|
await(pleaseInterrupt); |
649 |
< |
assertThreadStaysAlive(t); |
649 |
> |
if (randomBoolean()) assertThreadBlocks(t, Thread.State.WAITING); |
650 |
|
t.interrupt(); |
651 |
|
awaitTermination(t); |
652 |
|
assertEquals(0, q.remainingCapacity()); |
655 |
|
/** |
656 |
|
* timed offer times out if full and elements not taken |
657 |
|
*/ |
658 |
< |
public void testTimedOffer() throws InterruptedException { |
658 |
> |
public void testTimedOffer() { |
659 |
|
final LinkedBlockingDeque q = new LinkedBlockingDeque(2); |
660 |
|
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
661 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
663 |
|
q.put(new Object()); |
664 |
|
q.put(new Object()); |
665 |
|
long startTime = System.nanoTime(); |
666 |
+ |
|
667 |
|
assertFalse(q.offer(new Object(), timeoutMillis(), MILLISECONDS)); |
668 |
|
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
669 |
+ |
|
670 |
+ |
Thread.currentThread().interrupt(); |
671 |
+ |
try { |
672 |
+ |
q.offer(new Object(), randomTimeout(), randomTimeUnit()); |
673 |
+ |
shouldThrow(); |
674 |
+ |
} catch (InterruptedException success) {} |
675 |
+ |
assertFalse(Thread.interrupted()); |
676 |
+ |
|
677 |
|
pleaseInterrupt.countDown(); |
678 |
|
try { |
679 |
< |
q.offer(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS); |
679 |
> |
q.offer(new Object(), LONGER_DELAY_MS, MILLISECONDS); |
680 |
|
shouldThrow(); |
681 |
|
} catch (InterruptedException success) {} |
682 |
+ |
assertFalse(Thread.interrupted()); |
683 |
|
}}); |
684 |
|
|
685 |
|
await(pleaseInterrupt); |
686 |
< |
assertThreadStaysAlive(t); |
686 |
> |
if (randomBoolean()) assertThreadBlocks(t, Thread.State.TIMED_WAITING); |
687 |
|
t.interrupt(); |
688 |
|
awaitTermination(t); |
689 |
|
} |
706 |
|
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
707 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
708 |
|
public void realRun() throws InterruptedException { |
709 |
< |
for (int i = 0; i < SIZE; ++i) { |
683 |
< |
assertEquals(i, q.take()); |
684 |
< |
} |
709 |
> |
for (int i = 0; i < SIZE; i++) assertEquals(i, q.take()); |
710 |
|
|
711 |
|
Thread.currentThread().interrupt(); |
712 |
|
try { |
724 |
|
}}); |
725 |
|
|
726 |
|
await(pleaseInterrupt); |
727 |
< |
assertThreadStaysAlive(t); |
727 |
> |
if (randomBoolean()) assertThreadBlocks(t, Thread.State.WAITING); |
728 |
|
t.interrupt(); |
729 |
|
awaitTermination(t); |
730 |
|
} |
773 |
|
*/ |
774 |
|
public void testInterruptedTimedPoll() throws InterruptedException { |
775 |
|
final BlockingQueue<Integer> q = populatedDeque(SIZE); |
776 |
< |
final CountDownLatch aboutToWait = new CountDownLatch(1); |
776 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
777 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
778 |
|
public void realRun() throws InterruptedException { |
779 |
|
long startTime = System.nanoTime(); |
780 |
< |
for (int i = 0; i < SIZE; ++i) { |
780 |
> |
for (int i = 0; i < SIZE; i++) |
781 |
|
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
782 |
< |
} |
783 |
< |
aboutToWait.countDown(); |
782 |
> |
|
783 |
> |
Thread.currentThread().interrupt(); |
784 |
> |
try { |
785 |
> |
q.poll(randomTimeout(), randomTimeUnit()); |
786 |
> |
shouldThrow(); |
787 |
> |
} catch (InterruptedException success) {} |
788 |
> |
assertFalse(Thread.interrupted()); |
789 |
> |
|
790 |
> |
pleaseInterrupt.countDown(); |
791 |
|
try { |
792 |
|
q.poll(LONG_DELAY_MS, MILLISECONDS); |
793 |
|
shouldThrow(); |
794 |
< |
} catch (InterruptedException success) { |
795 |
< |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
796 |
< |
} |
794 |
> |
} catch (InterruptedException success) {} |
795 |
> |
assertFalse(Thread.interrupted()); |
796 |
> |
|
797 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
798 |
|
}}); |
799 |
|
|
800 |
< |
aboutToWait.await(); |
801 |
< |
waitForThreadToEnterWaitState(t); |
800 |
> |
await(pleaseInterrupt); |
801 |
> |
if (randomBoolean()) assertThreadBlocks(t, Thread.State.TIMED_WAITING); |
802 |
|
t.interrupt(); |
803 |
|
awaitTermination(t); |
804 |
|
checkEmpty(q); |
857 |
|
}}); |
858 |
|
|
859 |
|
await(pleaseInterrupt); |
860 |
< |
assertThreadStaysAlive(t); |
860 |
> |
if (randomBoolean()) assertThreadBlocks(t, Thread.State.WAITING); |
861 |
|
t.interrupt(); |
862 |
|
awaitTermination(t); |
863 |
|
assertEquals(SIZE, q.size()); |
892 |
|
assertEquals(capacity - 1, q.take()); |
893 |
|
|
894 |
|
await(pleaseInterrupt); |
895 |
< |
assertThreadStaysAlive(t); |
895 |
> |
if (randomBoolean()) assertThreadBlocks(t, Thread.State.WAITING); |
896 |
|
t.interrupt(); |
897 |
|
awaitTermination(t); |
898 |
|
assertEquals(0, q.remainingCapacity()); |
901 |
|
/** |
902 |
|
* timed offerFirst times out if full and elements not taken |
903 |
|
*/ |
904 |
< |
public void testTimedOfferFirst() throws InterruptedException { |
904 |
> |
public void testTimedOfferFirst() { |
905 |
|
final LinkedBlockingDeque q = new LinkedBlockingDeque(2); |
906 |
|
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
907 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
909 |
|
q.putFirst(new Object()); |
910 |
|
q.putFirst(new Object()); |
911 |
|
long startTime = System.nanoTime(); |
912 |
+ |
|
913 |
|
assertFalse(q.offerFirst(new Object(), timeoutMillis(), MILLISECONDS)); |
914 |
|
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
915 |
+ |
|
916 |
+ |
Thread.currentThread().interrupt(); |
917 |
+ |
try { |
918 |
+ |
q.offerFirst(new Object(), randomTimeout(), randomTimeUnit()); |
919 |
+ |
shouldThrow(); |
920 |
+ |
} catch (InterruptedException success) {} |
921 |
+ |
assertFalse(Thread.interrupted()); |
922 |
+ |
|
923 |
|
pleaseInterrupt.countDown(); |
924 |
|
try { |
925 |
< |
q.offerFirst(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS); |
925 |
> |
q.offerFirst(new Object(), LONG_DELAY_MS, MILLISECONDS); |
926 |
|
shouldThrow(); |
927 |
|
} catch (InterruptedException success) {} |
928 |
+ |
assertFalse(Thread.interrupted()); |
929 |
+ |
|
930 |
+ |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
931 |
|
}}); |
932 |
|
|
933 |
|
await(pleaseInterrupt); |
934 |
< |
assertThreadStaysAlive(t); |
934 |
> |
if (randomBoolean()) assertThreadBlocks(t, Thread.State.TIMED_WAITING); |
935 |
|
t.interrupt(); |
936 |
|
awaitTermination(t); |
937 |
|
} |
963 |
|
}}); |
964 |
|
|
965 |
|
await(threadStarted); |
966 |
< |
assertThreadStaysAlive(t); |
966 |
> |
if (randomBoolean()) assertThreadBlocks(t, Thread.State.WAITING); |
967 |
|
t.interrupt(); |
968 |
|
awaitTermination(t); |
969 |
|
} |
1004 |
|
}}); |
1005 |
|
|
1006 |
|
await(threadStarted); |
1007 |
< |
assertThreadStaysAlive(t); |
1007 |
> |
if (randomBoolean()) assertThreadBlocks(t, Thread.State.WAITING); |
1008 |
|
t.interrupt(); |
1009 |
|
awaitTermination(t); |
1010 |
|
} |
1036 |
|
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
1037 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
1038 |
|
public void realRun() throws InterruptedException { |
1039 |
< |
for (int i = 0; i < SIZE; ++i) { |
995 |
< |
assertEquals(i, q.takeFirst()); |
996 |
< |
} |
1039 |
> |
for (int i = 0; i < SIZE; i++) assertEquals(i, q.takeFirst()); |
1040 |
|
|
1041 |
|
Thread.currentThread().interrupt(); |
1042 |
|
try { |
1054 |
|
}}); |
1055 |
|
|
1056 |
|
await(pleaseInterrupt); |
1057 |
< |
assertThreadStaysAlive(t); |
1057 |
> |
if (randomBoolean()) assertThreadBlocks(t, Thread.State.WAITING); |
1058 |
|
t.interrupt(); |
1059 |
|
awaitTermination(t); |
1060 |
|
} |
1096 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
1097 |
|
public void realRun() throws InterruptedException { |
1098 |
|
long startTime = System.nanoTime(); |
1099 |
< |
for (int i = 0; i < SIZE; ++i) { |
1099 |
> |
for (int i = 0; i < SIZE; i++) |
1100 |
|
assertEquals(i, q.pollFirst(LONG_DELAY_MS, MILLISECONDS)); |
1058 |
– |
} |
1101 |
|
|
1102 |
|
Thread.currentThread().interrupt(); |
1103 |
|
try { |
1104 |
< |
q.pollFirst(LONG_DELAY_MS, MILLISECONDS); |
1104 |
> |
q.pollFirst(randomTimeout(), randomTimeUnit()); |
1105 |
|
shouldThrow(); |
1106 |
|
} catch (InterruptedException success) {} |
1107 |
|
assertFalse(Thread.interrupted()); |
1112 |
|
shouldThrow(); |
1113 |
|
} catch (InterruptedException success) {} |
1114 |
|
assertFalse(Thread.interrupted()); |
1115 |
+ |
|
1116 |
|
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
1117 |
|
}}); |
1118 |
|
|
1119 |
|
await(pleaseInterrupt); |
1120 |
< |
assertThreadStaysAlive(t); |
1120 |
> |
if (randomBoolean()) assertThreadBlocks(t, Thread.State.TIMED_WAITING); |
1121 |
|
t.interrupt(); |
1122 |
|
awaitTermination(t); |
1123 |
|
} |
1141 |
|
|
1142 |
|
Thread.currentThread().interrupt(); |
1143 |
|
try { |
1144 |
< |
q.pollFirst(LONG_DELAY_MS, MILLISECONDS); |
1144 |
> |
q.pollFirst(randomTimeout(), randomTimeUnit()); |
1145 |
|
shouldThrow(); |
1146 |
|
} catch (InterruptedException success) {} |
1147 |
|
|
1150 |
|
q.pollFirst(LONG_DELAY_MS, MILLISECONDS); |
1151 |
|
shouldThrow(); |
1152 |
|
} catch (InterruptedException success) {} |
1153 |
+ |
assertFalse(Thread.interrupted()); |
1154 |
+ |
|
1155 |
|
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
1156 |
|
}}); |
1157 |
|
|
1160 |
|
assertTrue(q.offerFirst(zero, LONG_DELAY_MS, MILLISECONDS)); |
1161 |
|
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
1162 |
|
barrier.await(); |
1163 |
< |
assertThreadStaysAlive(t); |
1163 |
> |
if (randomBoolean()) assertThreadBlocks(t, Thread.State.TIMED_WAITING); |
1164 |
|
t.interrupt(); |
1165 |
|
awaitTermination(t); |
1166 |
|
} |
1218 |
|
}}); |
1219 |
|
|
1220 |
|
await(pleaseInterrupt); |
1221 |
< |
assertThreadStaysAlive(t); |
1221 |
> |
if (randomBoolean()) assertThreadBlocks(t, Thread.State.WAITING); |
1222 |
|
t.interrupt(); |
1223 |
|
awaitTermination(t); |
1224 |
|
assertEquals(SIZE, q.size()); |
1240 |
|
pleaseTake.countDown(); |
1241 |
|
q.putLast(86); |
1242 |
|
|
1243 |
+ |
Thread.currentThread().interrupt(); |
1244 |
+ |
try { |
1245 |
+ |
q.putLast(99); |
1246 |
+ |
shouldThrow(); |
1247 |
+ |
} catch (InterruptedException success) {} |
1248 |
+ |
assertFalse(Thread.interrupted()); |
1249 |
+ |
|
1250 |
|
pleaseInterrupt.countDown(); |
1251 |
|
try { |
1252 |
|
q.putLast(99); |
1260 |
|
assertEquals(0, q.take()); |
1261 |
|
|
1262 |
|
await(pleaseInterrupt); |
1263 |
< |
assertThreadStaysAlive(t); |
1263 |
> |
if (randomBoolean()) assertThreadBlocks(t, Thread.State.WAITING); |
1264 |
|
t.interrupt(); |
1265 |
|
awaitTermination(t); |
1266 |
|
assertEquals(0, q.remainingCapacity()); |
1269 |
|
/** |
1270 |
|
* timed offerLast times out if full and elements not taken |
1271 |
|
*/ |
1272 |
< |
public void testTimedOfferLast() throws InterruptedException { |
1272 |
> |
public void testTimedOfferLast() { |
1273 |
|
final LinkedBlockingDeque q = new LinkedBlockingDeque(2); |
1274 |
|
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
1275 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
1277 |
|
q.putLast(new Object()); |
1278 |
|
q.putLast(new Object()); |
1279 |
|
long startTime = System.nanoTime(); |
1280 |
+ |
|
1281 |
|
assertFalse(q.offerLast(new Object(), timeoutMillis(), MILLISECONDS)); |
1282 |
|
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
1283 |
+ |
|
1284 |
+ |
Thread.currentThread().interrupt(); |
1285 |
+ |
try { |
1286 |
+ |
q.offerLast(new Object(), randomTimeout(), randomTimeUnit()); |
1287 |
+ |
shouldThrow(); |
1288 |
+ |
} catch (InterruptedException success) {} |
1289 |
+ |
|
1290 |
|
pleaseInterrupt.countDown(); |
1291 |
|
try { |
1292 |
< |
q.offerLast(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS); |
1292 |
> |
q.offerLast(new Object(), LONG_DELAY_MS, MILLISECONDS); |
1293 |
|
shouldThrow(); |
1294 |
|
} catch (InterruptedException success) {} |
1295 |
+ |
|
1296 |
+ |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
1297 |
|
}}); |
1298 |
|
|
1299 |
|
await(pleaseInterrupt); |
1300 |
< |
assertThreadStaysAlive(t); |
1300 |
> |
if (randomBoolean()) assertThreadBlocks(t, Thread.State.TIMED_WAITING); |
1301 |
|
t.interrupt(); |
1302 |
|
awaitTermination(t); |
1303 |
|
} |
1320 |
|
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
1321 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
1322 |
|
public void realRun() throws InterruptedException { |
1323 |
< |
for (int i = 0; i < SIZE; ++i) { |
1323 |
> |
for (int i = 0; i < SIZE; i++) |
1324 |
|
assertEquals(SIZE - i - 1, q.takeLast()); |
1263 |
– |
} |
1325 |
|
|
1326 |
|
Thread.currentThread().interrupt(); |
1327 |
|
try { |
1339 |
|
}}); |
1340 |
|
|
1341 |
|
await(pleaseInterrupt); |
1342 |
< |
assertThreadStaysAlive(t); |
1342 |
> |
if (randomBoolean()) assertThreadBlocks(t, Thread.State.WAITING); |
1343 |
|
t.interrupt(); |
1344 |
|
awaitTermination(t); |
1345 |
|
} |
1381 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
1382 |
|
public void realRun() throws InterruptedException { |
1383 |
|
long startTime = System.nanoTime(); |
1384 |
< |
for (int i = 0; i < SIZE; ++i) { |
1384 |
> |
for (int i = 0; i < SIZE; i++) |
1385 |
|
assertEquals(SIZE - i - 1, |
1386 |
|
q.pollLast(LONG_DELAY_MS, MILLISECONDS)); |
1326 |
– |
} |
1387 |
|
|
1388 |
|
Thread.currentThread().interrupt(); |
1389 |
|
try { |
1390 |
< |
q.pollLast(LONG_DELAY_MS, MILLISECONDS); |
1390 |
> |
q.pollLast(randomTimeout(), randomTimeUnit()); |
1391 |
|
shouldThrow(); |
1392 |
|
} catch (InterruptedException success) {} |
1393 |
|
assertFalse(Thread.interrupted()); |
1403 |
|
}}); |
1404 |
|
|
1405 |
|
await(pleaseInterrupt); |
1406 |
< |
assertThreadStaysAlive(t); |
1406 |
> |
if (randomBoolean()) assertThreadBlocks(t, Thread.State.TIMED_WAITING); |
1407 |
|
t.interrupt(); |
1408 |
|
awaitTermination(t); |
1409 |
|
checkEmpty(q); |
1428 |
|
|
1429 |
|
Thread.currentThread().interrupt(); |
1430 |
|
try { |
1431 |
< |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
1431 |
> |
q.poll(randomTimeout(), randomTimeUnit()); |
1432 |
|
shouldThrow(); |
1433 |
|
} catch (InterruptedException success) {} |
1434 |
|
assertFalse(Thread.interrupted()); |
1449 |
|
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
1450 |
|
|
1451 |
|
barrier.await(); |
1452 |
< |
assertThreadStaysAlive(t); |
1452 |
> |
if (randomBoolean()) assertThreadBlocks(t, Thread.State.TIMED_WAITING); |
1453 |
|
t.interrupt(); |
1454 |
|
awaitTermination(t); |
1455 |
|
} |
1551 |
|
*/ |
1552 |
|
public void testToArray() throws InterruptedException { |
1553 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
1554 |
< |
Object[] o = q.toArray(); |
1555 |
< |
for (int i = 0; i < o.length; i++) |
1556 |
< |
assertSame(o[i], q.poll()); |
1554 |
> |
Object[] a = q.toArray(); |
1555 |
> |
assertSame(Object[].class, a.getClass()); |
1556 |
> |
for (Object o : a) |
1557 |
> |
assertSame(o, q.poll()); |
1558 |
> |
assertTrue(q.isEmpty()); |
1559 |
|
} |
1560 |
|
|
1561 |
|
/** |
1566 |
|
Integer[] ints = new Integer[SIZE]; |
1567 |
|
Integer[] array = q.toArray(ints); |
1568 |
|
assertSame(ints, array); |
1569 |
< |
for (int i = 0; i < ints.length; i++) |
1570 |
< |
assertSame(ints[i], q.remove()); |
1569 |
> |
for (Integer o : ints) |
1570 |
> |
assertSame(o, q.remove()); |
1571 |
> |
assertTrue(q.isEmpty()); |
1572 |
|
} |
1573 |
|
|
1574 |
|
/** |
1784 |
|
} |
1785 |
|
|
1786 |
|
/** |
1787 |
< |
* A deserialized serialized deque has same elements in same order |
1787 |
> |
* A deserialized/reserialized deque has same elements in same order |
1788 |
|
*/ |
1789 |
|
public void testSerialization() throws Exception { |
1790 |
|
Queue x = populatedDeque(SIZE); |