11 |
|
|
12 |
|
public class LinkedBlockingDequeTest extends JSR166TestCase { |
13 |
|
public static void main(String[] args) { |
14 |
< |
junit.textui.TestRunner.run (suite()); |
14 |
> |
junit.textui.TestRunner.run (suite()); |
15 |
|
} |
16 |
|
|
17 |
|
public static Test suite() { |
18 |
< |
return new TestSuite(LinkedBlockingDequeTest.class); |
18 |
> |
return new TestSuite(LinkedBlockingDequeTest.class); |
19 |
|
} |
20 |
|
|
21 |
|
/** |
25 |
|
private LinkedBlockingDeque populatedDeque(int n) { |
26 |
|
LinkedBlockingDeque q = new LinkedBlockingDeque(n); |
27 |
|
assertTrue(q.isEmpty()); |
28 |
< |
for (int i = 0; i < n; i++) |
29 |
< |
assertTrue(q.offer(new Integer(i))); |
28 |
> |
for (int i = 0; i < n; i++) |
29 |
> |
assertTrue(q.offer(new Integer(i))); |
30 |
|
assertFalse(q.isEmpty()); |
31 |
|
assertEquals(0, q.remainingCapacity()); |
32 |
< |
assertEquals(n, q.size()); |
32 |
> |
assertEquals(n, q.size()); |
33 |
|
return q; |
34 |
|
} |
35 |
|
|
66 |
|
* offer(null) throws NPE |
67 |
|
*/ |
68 |
|
public void testOfferFirstNull() { |
69 |
< |
try { |
69 |
> |
try { |
70 |
|
LinkedBlockingDeque q = new LinkedBlockingDeque(); |
71 |
|
q.offerFirst(null); |
72 |
|
shouldThrow(); |
100 |
|
for (int i = 0; i < SIZE; ++i) { |
101 |
|
assertEquals(i, ((Integer)q.pollFirst()).intValue()); |
102 |
|
} |
103 |
< |
assertNull(q.pollFirst()); |
103 |
> |
assertNull(q.pollFirst()); |
104 |
|
} |
105 |
|
|
106 |
|
/** |
111 |
|
for (int i = SIZE-1; i >= 0; --i) { |
112 |
|
assertEquals(i, ((Integer)q.pollLast()).intValue()); |
113 |
|
} |
114 |
< |
assertNull(q.pollLast()); |
114 |
> |
assertNull(q.pollLast()); |
115 |
|
} |
116 |
|
|
117 |
|
/** |
125 |
|
assertTrue(q.peekFirst() == null || |
126 |
|
i != ((Integer)q.peekFirst()).intValue()); |
127 |
|
} |
128 |
< |
assertNull(q.peekFirst()); |
128 |
> |
assertNull(q.peekFirst()); |
129 |
|
} |
130 |
|
|
131 |
|
/** |
139 |
|
assertTrue(q.peek() == null || |
140 |
|
i != ((Integer)q.peek()).intValue()); |
141 |
|
} |
142 |
< |
assertNull(q.peek()); |
142 |
> |
assertNull(q.peek()); |
143 |
|
} |
144 |
|
|
145 |
|
/** |
153 |
|
assertTrue(q.peekLast() == null || |
154 |
|
i != ((Integer)q.peekLast()).intValue()); |
155 |
|
} |
156 |
< |
assertNull(q.peekLast()); |
156 |
> |
assertNull(q.peekLast()); |
157 |
|
} |
158 |
|
|
159 |
|
/** |
186 |
|
shouldThrow(); |
187 |
|
} |
188 |
|
catch (NoSuchElementException success) {} |
189 |
< |
assertNull(q.peekLast()); |
189 |
> |
assertNull(q.peekLast()); |
190 |
|
} |
191 |
|
|
192 |
|
/** |
201 |
|
q.removeFirst(); |
202 |
|
shouldThrow(); |
203 |
|
} catch (NoSuchElementException success) { |
204 |
< |
} |
204 |
> |
} |
205 |
|
} |
206 |
|
|
207 |
|
/** |
216 |
|
q.remove(); |
217 |
|
shouldThrow(); |
218 |
|
} catch (NoSuchElementException success) { |
219 |
< |
} |
219 |
> |
} |
220 |
|
} |
221 |
|
|
222 |
|
/** |
255 |
|
public void testAddFirst() { |
256 |
|
LinkedBlockingDeque q = populatedDeque(3); |
257 |
|
q.pollLast(); |
258 |
< |
q.addFirst(four); |
259 |
< |
assertEquals(four,q.peekFirst()); |
258 |
> |
q.addFirst(four); |
259 |
> |
assertEquals(four,q.peekFirst()); |
260 |
|
} |
261 |
|
|
262 |
|
/** |
265 |
|
public void testAddLast() { |
266 |
|
LinkedBlockingDeque q = populatedDeque(3); |
267 |
|
q.pollLast(); |
268 |
< |
q.addLast(four); |
269 |
< |
assertEquals(four,q.peekLast()); |
268 |
> |
q.addLast(four); |
269 |
> |
assertEquals(four,q.peekLast()); |
270 |
|
} |
271 |
|
|
272 |
|
|
378 |
|
* offer(null) throws NPE |
379 |
|
*/ |
380 |
|
public void testOfferNull() { |
381 |
< |
try { |
381 |
> |
try { |
382 |
|
LinkedBlockingDeque q = new LinkedBlockingDeque(1); |
383 |
|
q.offer(null); |
384 |
|
shouldThrow(); |
389 |
|
* add(null) throws NPE |
390 |
|
*/ |
391 |
|
public void testAddNull() { |
392 |
< |
try { |
392 |
> |
try { |
393 |
|
LinkedBlockingDeque q = new LinkedBlockingDeque(1); |
394 |
|
q.add(null); |
395 |
|
shouldThrow(); |
400 |
|
* push(null) throws NPE |
401 |
|
*/ |
402 |
|
public void testPushNull() { |
403 |
< |
try { |
403 |
> |
try { |
404 |
|
LinkedBlockingDeque q = new LinkedBlockingDeque(1); |
405 |
|
q.push(null); |
406 |
|
shouldThrow(); |
411 |
|
* push succeeds if not full; throws ISE if full |
412 |
|
*/ |
413 |
|
public void testPush() { |
414 |
< |
try { |
414 |
> |
try { |
415 |
|
LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE); |
416 |
|
for (int i = 0; i < SIZE; ++i) { |
417 |
|
Integer I = new Integer(i); |
421 |
|
assertEquals(0, q.remainingCapacity()); |
422 |
|
q.push(new Integer(SIZE)); |
423 |
|
} catch (IllegalStateException success) { |
424 |
< |
} |
424 |
> |
} |
425 |
|
} |
426 |
|
|
427 |
|
/** |
430 |
|
public void testPushWithPeek() { |
431 |
|
LinkedBlockingDeque q = populatedDeque(3); |
432 |
|
q.pollLast(); |
433 |
< |
q.push(four); |
434 |
< |
assertEquals(four,q.peekFirst()); |
433 |
> |
q.push(four); |
434 |
> |
assertEquals(four,q.peekFirst()); |
435 |
|
} |
436 |
|
|
437 |
|
|
447 |
|
q.pop(); |
448 |
|
shouldThrow(); |
449 |
|
} catch (NoSuchElementException success) { |
450 |
< |
} |
450 |
> |
} |
451 |
|
} |
452 |
|
|
453 |
|
|
464 |
|
* add succeeds if not full; throws ISE if full |
465 |
|
*/ |
466 |
|
public void testAdd() { |
467 |
< |
try { |
467 |
> |
try { |
468 |
|
LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE); |
469 |
|
for (int i = 0; i < SIZE; ++i) { |
470 |
|
assertTrue(q.add(new Integer(i))); |
472 |
|
assertEquals(0, q.remainingCapacity()); |
473 |
|
q.add(new Integer(SIZE)); |
474 |
|
} catch (IllegalStateException success) { |
475 |
< |
} |
475 |
> |
} |
476 |
|
} |
477 |
|
|
478 |
|
/** |
563 |
|
* put(null) throws NPE |
564 |
|
*/ |
565 |
|
public void testPutNull() { |
566 |
< |
try { |
566 |
> |
try { |
567 |
|
LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE); |
568 |
|
q.put(null); |
569 |
|
shouldThrow(); |
570 |
|
} |
571 |
|
catch (NullPointerException success) { |
572 |
< |
} |
572 |
> |
} |
573 |
|
catch (InterruptedException ie) { |
574 |
< |
unexpectedException(); |
574 |
> |
unexpectedException(); |
575 |
|
} |
576 |
|
} |
577 |
|
|
589 |
|
assertEquals(0, q.remainingCapacity()); |
590 |
|
} |
591 |
|
catch (InterruptedException ie) { |
592 |
< |
unexpectedException(); |
592 |
> |
unexpectedException(); |
593 |
|
} |
594 |
|
} |
595 |
|
|
619 |
|
t.join(); |
620 |
|
} |
621 |
|
catch (InterruptedException ie) { |
622 |
< |
unexpectedException(); |
622 |
> |
unexpectedException(); |
623 |
|
} |
624 |
|
} |
625 |
|
|
640 |
|
++added; |
641 |
|
q.put(new Object()); |
642 |
|
++added; |
643 |
< |
threadShouldThrow(); |
643 |
> |
threadShouldThrow(); |
644 |
|
} catch (InterruptedException e) { |
645 |
|
threadAssertTrue(added >= 2); |
646 |
|
} |
669 |
|
q.put(new Object()); |
670 |
|
threadAssertFalse(q.offer(new Object(), SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); |
671 |
|
q.offer(new Object(), LONG_DELAY_MS, TimeUnit.MILLISECONDS); |
672 |
< |
threadShouldThrow(); |
672 |
> |
threadShouldThrow(); |
673 |
|
} catch (InterruptedException success) {} |
674 |
|
} |
675 |
|
}); |
688 |
|
* take retrieves elements in FIFO order |
689 |
|
*/ |
690 |
|
public void testTake() { |
691 |
< |
try { |
691 |
> |
try { |
692 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
693 |
|
for (int i = 0; i < SIZE; ++i) { |
694 |
|
assertEquals(i, ((Integer)q.take()).intValue()); |
695 |
|
} |
696 |
|
} catch (InterruptedException e) { |
697 |
< |
unexpectedException(); |
698 |
< |
} |
697 |
> |
unexpectedException(); |
698 |
> |
} |
699 |
|
} |
700 |
|
|
701 |
|
/** |
707 |
|
public void run() { |
708 |
|
try { |
709 |
|
q.take(); |
710 |
< |
threadShouldThrow(); |
710 |
> |
threadShouldThrow(); |
711 |
|
} catch (InterruptedException success) { } |
712 |
|
} |
713 |
|
}); |
744 |
|
t.join(); |
745 |
|
} |
746 |
|
catch (InterruptedException ie) { |
747 |
< |
unexpectedException(); |
747 |
> |
unexpectedException(); |
748 |
|
} |
749 |
|
} |
750 |
|
|
757 |
|
for (int i = 0; i < SIZE; ++i) { |
758 |
|
assertEquals(i, ((Integer)q.poll()).intValue()); |
759 |
|
} |
760 |
< |
assertNull(q.poll()); |
760 |
> |
assertNull(q.poll()); |
761 |
|
} |
762 |
|
|
763 |
|
/** |
771 |
|
} |
772 |
|
assertNull(q.poll(0, TimeUnit.MILLISECONDS)); |
773 |
|
} catch (InterruptedException e) { |
774 |
< |
unexpectedException(); |
775 |
< |
} |
774 |
> |
unexpectedException(); |
775 |
> |
} |
776 |
|
} |
777 |
|
|
778 |
|
/** |
786 |
|
} |
787 |
|
assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); |
788 |
|
} catch (InterruptedException e) { |
789 |
< |
unexpectedException(); |
790 |
< |
} |
789 |
> |
unexpectedException(); |
790 |
> |
} |
791 |
|
} |
792 |
|
|
793 |
|
/** |
813 |
|
t.join(); |
814 |
|
} |
815 |
|
catch (InterruptedException ie) { |
816 |
< |
unexpectedException(); |
816 |
> |
unexpectedException(); |
817 |
|
} |
818 |
|
} |
819 |
|
|
829 |
|
threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); |
830 |
|
q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS); |
831 |
|
q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS); |
832 |
< |
threadShouldThrow(); |
832 |
> |
threadShouldThrow(); |
833 |
|
} catch (InterruptedException success) { } |
834 |
|
} |
835 |
|
}); |
849 |
|
* putFirst(null) throws NPE |
850 |
|
*/ |
851 |
|
public void testPutFirstNull() { |
852 |
< |
try { |
852 |
> |
try { |
853 |
|
LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE); |
854 |
|
q.putFirst(null); |
855 |
|
shouldThrow(); |
856 |
|
} |
857 |
|
catch (NullPointerException success) { |
858 |
< |
} |
858 |
> |
} |
859 |
|
catch (InterruptedException ie) { |
860 |
< |
unexpectedException(); |
860 |
> |
unexpectedException(); |
861 |
|
} |
862 |
|
} |
863 |
|
|
875 |
|
assertEquals(0, q.remainingCapacity()); |
876 |
|
} |
877 |
|
catch (InterruptedException ie) { |
878 |
< |
unexpectedException(); |
878 |
> |
unexpectedException(); |
879 |
|
} |
880 |
|
} |
881 |
|
|
905 |
|
t.join(); |
906 |
|
} |
907 |
|
catch (InterruptedException ie) { |
908 |
< |
unexpectedException(); |
908 |
> |
unexpectedException(); |
909 |
|
} |
910 |
|
} |
911 |
|
|
926 |
|
++added; |
927 |
|
q.putFirst(new Object()); |
928 |
|
++added; |
929 |
< |
threadShouldThrow(); |
929 |
> |
threadShouldThrow(); |
930 |
|
} catch (InterruptedException e) { |
931 |
|
threadAssertTrue(added >= 2); |
932 |
|
} |
955 |
|
q.putFirst(new Object()); |
956 |
|
threadAssertFalse(q.offerFirst(new Object(), SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); |
957 |
|
q.offerFirst(new Object(), LONG_DELAY_MS, TimeUnit.MILLISECONDS); |
958 |
< |
threadShouldThrow(); |
958 |
> |
threadShouldThrow(); |
959 |
|
} catch (InterruptedException success) {} |
960 |
|
} |
961 |
|
}); |
974 |
|
* take retrieves elements in FIFO order |
975 |
|
*/ |
976 |
|
public void testTakeFirst() { |
977 |
< |
try { |
977 |
> |
try { |
978 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
979 |
|
for (int i = 0; i < SIZE; ++i) { |
980 |
|
assertEquals(i, ((Integer)q.takeFirst()).intValue()); |
981 |
|
} |
982 |
|
} catch (InterruptedException e) { |
983 |
< |
unexpectedException(); |
984 |
< |
} |
983 |
> |
unexpectedException(); |
984 |
> |
} |
985 |
|
} |
986 |
|
|
987 |
|
/** |
993 |
|
public void run() { |
994 |
|
try { |
995 |
|
q.takeFirst(); |
996 |
< |
threadShouldThrow(); |
996 |
> |
threadShouldThrow(); |
997 |
|
} catch (InterruptedException success) { } |
998 |
|
} |
999 |
|
}); |
1030 |
|
t.join(); |
1031 |
|
} |
1032 |
|
catch (InterruptedException ie) { |
1033 |
< |
unexpectedException(); |
1033 |
> |
unexpectedException(); |
1034 |
|
} |
1035 |
|
} |
1036 |
|
|
1046 |
|
} |
1047 |
|
assertNull(q.pollFirst(0, TimeUnit.MILLISECONDS)); |
1048 |
|
} catch (InterruptedException e) { |
1049 |
< |
unexpectedException(); |
1050 |
< |
} |
1049 |
> |
unexpectedException(); |
1050 |
> |
} |
1051 |
|
} |
1052 |
|
|
1053 |
|
/** |
1061 |
|
} |
1062 |
|
assertNull(q.pollFirst(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); |
1063 |
|
} catch (InterruptedException e) { |
1064 |
< |
unexpectedException(); |
1065 |
< |
} |
1064 |
> |
unexpectedException(); |
1065 |
> |
} |
1066 |
|
} |
1067 |
|
|
1068 |
|
/** |
1088 |
|
t.join(); |
1089 |
|
} |
1090 |
|
catch (InterruptedException ie) { |
1091 |
< |
unexpectedException(); |
1091 |
> |
unexpectedException(); |
1092 |
|
} |
1093 |
|
} |
1094 |
|
|
1104 |
|
threadAssertNull(q.pollFirst(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); |
1105 |
|
q.pollFirst(LONG_DELAY_MS, TimeUnit.MILLISECONDS); |
1106 |
|
q.pollFirst(LONG_DELAY_MS, TimeUnit.MILLISECONDS); |
1107 |
< |
threadShouldThrow(); |
1107 |
> |
threadShouldThrow(); |
1108 |
|
} catch (InterruptedException success) { } |
1109 |
|
} |
1110 |
|
}); |
1123 |
|
* putLast(null) throws NPE |
1124 |
|
*/ |
1125 |
|
public void testPutLastNull() { |
1126 |
< |
try { |
1126 |
> |
try { |
1127 |
|
LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE); |
1128 |
|
q.putLast(null); |
1129 |
|
shouldThrow(); |
1130 |
|
} |
1131 |
|
catch (NullPointerException success) { |
1132 |
< |
} |
1132 |
> |
} |
1133 |
|
catch (InterruptedException ie) { |
1134 |
< |
unexpectedException(); |
1134 |
> |
unexpectedException(); |
1135 |
|
} |
1136 |
|
} |
1137 |
|
|
1149 |
|
assertEquals(0, q.remainingCapacity()); |
1150 |
|
} |
1151 |
|
catch (InterruptedException ie) { |
1152 |
< |
unexpectedException(); |
1152 |
> |
unexpectedException(); |
1153 |
|
} |
1154 |
|
} |
1155 |
|
|
1179 |
|
t.join(); |
1180 |
|
} |
1181 |
|
catch (InterruptedException ie) { |
1182 |
< |
unexpectedException(); |
1182 |
> |
unexpectedException(); |
1183 |
|
} |
1184 |
|
} |
1185 |
|
|
1200 |
|
++added; |
1201 |
|
q.putLast(new Object()); |
1202 |
|
++added; |
1203 |
< |
threadShouldThrow(); |
1203 |
> |
threadShouldThrow(); |
1204 |
|
} catch (InterruptedException e) { |
1205 |
|
threadAssertTrue(added >= 2); |
1206 |
|
} |
1229 |
|
q.putLast(new Object()); |
1230 |
|
threadAssertFalse(q.offerLast(new Object(), SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); |
1231 |
|
q.offerLast(new Object(), LONG_DELAY_MS, TimeUnit.MILLISECONDS); |
1232 |
< |
threadShouldThrow(); |
1232 |
> |
threadShouldThrow(); |
1233 |
|
} catch (InterruptedException success) {} |
1234 |
|
} |
1235 |
|
}); |
1248 |
|
* takeLast retrieves elements in FIFO order |
1249 |
|
*/ |
1250 |
|
public void testTakeLast() { |
1251 |
< |
try { |
1251 |
> |
try { |
1252 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
1253 |
|
for (int i = 0; i < SIZE; ++i) { |
1254 |
|
assertEquals(SIZE-i-1, ((Integer)q.takeLast()).intValue()); |
1255 |
|
} |
1256 |
|
} catch (InterruptedException e) { |
1257 |
< |
unexpectedException(); |
1258 |
< |
} |
1257 |
> |
unexpectedException(); |
1258 |
> |
} |
1259 |
|
} |
1260 |
|
|
1261 |
|
/** |
1267 |
|
public void run() { |
1268 |
|
try { |
1269 |
|
q.takeLast(); |
1270 |
< |
threadShouldThrow(); |
1270 |
> |
threadShouldThrow(); |
1271 |
|
} catch (InterruptedException success) { } |
1272 |
|
} |
1273 |
|
}); |
1304 |
|
t.join(); |
1305 |
|
} |
1306 |
|
catch (InterruptedException ie) { |
1307 |
< |
unexpectedException(); |
1307 |
> |
unexpectedException(); |
1308 |
|
} |
1309 |
|
} |
1310 |
|
|
1320 |
|
} |
1321 |
|
assertNull(q.pollLast(0, TimeUnit.MILLISECONDS)); |
1322 |
|
} catch (InterruptedException e) { |
1323 |
< |
unexpectedException(); |
1324 |
< |
} |
1323 |
> |
unexpectedException(); |
1324 |
> |
} |
1325 |
|
} |
1326 |
|
|
1327 |
|
/** |
1335 |
|
} |
1336 |
|
assertNull(q.pollLast(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); |
1337 |
|
} catch (InterruptedException e) { |
1338 |
< |
unexpectedException(); |
1339 |
< |
} |
1338 |
> |
unexpectedException(); |
1339 |
> |
} |
1340 |
|
} |
1341 |
|
|
1342 |
|
/** |
1362 |
|
t.join(); |
1363 |
|
} |
1364 |
|
catch (InterruptedException ie) { |
1365 |
< |
unexpectedException(); |
1365 |
> |
unexpectedException(); |
1366 |
|
} |
1367 |
|
} |
1368 |
|
|
1378 |
|
threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); |
1379 |
|
q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS); |
1380 |
|
q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS); |
1381 |
< |
threadShouldThrow(); |
1381 |
> |
threadShouldThrow(); |
1382 |
|
} catch (InterruptedException success) { } |
1383 |
|
} |
1384 |
|
}); |
1507 |
|
*/ |
1508 |
|
public void testToArray() { |
1509 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
1510 |
< |
Object[] o = q.toArray(); |
1511 |
< |
try { |
1512 |
< |
for (int i = 0; i < o.length; i++) |
1513 |
< |
assertEquals(o[i], q.take()); |
1514 |
< |
} catch (InterruptedException e) { |
1515 |
< |
unexpectedException(); |
1516 |
< |
} |
1510 |
> |
Object[] o = q.toArray(); |
1511 |
> |
try { |
1512 |
> |
for (int i = 0; i < o.length; i++) |
1513 |
> |
assertEquals(o[i], q.take()); |
1514 |
> |
} catch (InterruptedException e) { |
1515 |
> |
unexpectedException(); |
1516 |
> |
} |
1517 |
|
} |
1518 |
|
|
1519 |
|
/** |
1521 |
|
*/ |
1522 |
|
public void testToArray2() { |
1523 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
1524 |
< |
Integer[] ints = new Integer[SIZE]; |
1525 |
< |
ints = (Integer[])q.toArray(ints); |
1526 |
< |
try { |
1527 |
< |
for (int i = 0; i < ints.length; i++) |
1528 |
< |
assertEquals(ints[i], q.take()); |
1529 |
< |
} catch (InterruptedException e) { |
1530 |
< |
unexpectedException(); |
1531 |
< |
} |
1524 |
> |
Integer[] ints = new Integer[SIZE]; |
1525 |
> |
ints = (Integer[])q.toArray(ints); |
1526 |
> |
try { |
1527 |
> |
for (int i = 0; i < ints.length; i++) |
1528 |
> |
assertEquals(ints[i], q.take()); |
1529 |
> |
} catch (InterruptedException e) { |
1530 |
> |
unexpectedException(); |
1531 |
> |
} |
1532 |
|
} |
1533 |
|
|
1534 |
|
/** |
1535 |
|
* toArray(null) throws NPE |
1536 |
|
*/ |
1537 |
|
public void testToArray_BadArg() { |
1538 |
< |
try { |
1538 |
> |
try { |
1539 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
1540 |
< |
Object o[] = q.toArray(null); |
1541 |
< |
shouldThrow(); |
1542 |
< |
} catch (NullPointerException success) {} |
1540 |
> |
Object o[] = q.toArray(null); |
1541 |
> |
shouldThrow(); |
1542 |
> |
} catch (NullPointerException success) {} |
1543 |
|
} |
1544 |
|
|
1545 |
|
/** |
1546 |
|
* toArray with incompatible array type throws CCE |
1547 |
|
*/ |
1548 |
|
public void testToArray1_BadArg() { |
1549 |
< |
try { |
1549 |
> |
try { |
1550 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
1551 |
< |
Object o[] = q.toArray(new String[10] ); |
1552 |
< |
shouldThrow(); |
1553 |
< |
} catch (ArrayStoreException success) {} |
1551 |
> |
Object o[] = q.toArray(new String[10] ); |
1552 |
> |
shouldThrow(); |
1553 |
> |
} catch (ArrayStoreException success) {} |
1554 |
|
} |
1555 |
|
|
1556 |
|
|
1559 |
|
*/ |
1560 |
|
public void testIterator() { |
1561 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
1562 |
< |
Iterator it = q.iterator(); |
1563 |
< |
try { |
1564 |
< |
while (it.hasNext()) { |
1565 |
< |
assertEquals(it.next(), q.take()); |
1566 |
< |
} |
1567 |
< |
} catch (InterruptedException e) { |
1568 |
< |
unexpectedException(); |
1569 |
< |
} |
1562 |
> |
Iterator it = q.iterator(); |
1563 |
> |
try { |
1564 |
> |
while (it.hasNext()) { |
1565 |
> |
assertEquals(it.next(), q.take()); |
1566 |
> |
} |
1567 |
> |
} catch (InterruptedException e) { |
1568 |
> |
unexpectedException(); |
1569 |
> |
} |
1570 |
|
} |
1571 |
|
|
1572 |
|
/** |
1633 |
|
public void testDescendingIterator() { |
1634 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
1635 |
|
int i = 0; |
1636 |
< |
Iterator it = q.descendingIterator(); |
1636 |
> |
Iterator it = q.descendingIterator(); |
1637 |
|
while (it.hasNext()) { |
1638 |
|
assertTrue(q.contains(it.next())); |
1639 |
|
++i; |