1 |
|
/* |
2 |
< |
* Written by members of JCP JSR-166 Expert Group and released to the |
3 |
< |
* public domain. Use, modify, and redistribute this code in any way |
4 |
< |
* without acknowledgement. Other contributors include Andrew Wright, |
5 |
< |
* Jeffrey Hayes, Pat Fischer, Mike Judd. |
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 |
5 |
> |
* Other contributors include Andrew Wright, Jeffrey Hayes, |
6 |
> |
* Pat Fisher, Mike Judd. |
7 |
|
*/ |
8 |
|
|
9 |
|
import junit.framework.*; |
13 |
|
|
14 |
|
public class PriorityBlockingQueueTest extends JSR166TestCase { |
15 |
|
public static void main(String[] args) { |
16 |
< |
junit.textui.TestRunner.run (suite()); |
16 |
> |
junit.textui.TestRunner.run (suite()); |
17 |
|
} |
17 |
– |
|
18 |
|
public static Test suite() { |
19 |
|
return new TestSuite(PriorityBlockingQueueTest.class); |
20 |
|
} |
22 |
|
private static final int NOCAP = Integer.MAX_VALUE; |
23 |
|
|
24 |
|
/** Sample Comparator */ |
25 |
< |
static class MyReverseComparator implements Comparator { |
25 |
> |
static class MyReverseComparator implements Comparator { |
26 |
|
public int compare(Object x, Object y) { |
27 |
|
int i = ((Integer)x).intValue(); |
28 |
|
int j = ((Integer)y).intValue(); |
32 |
|
} |
33 |
|
} |
34 |
|
|
35 |
– |
|
35 |
|
/** |
36 |
|
* Create a queue of given size containing consecutive |
37 |
|
* Integers 0 ... n. |
39 |
|
private PriorityBlockingQueue populatedQueue(int n) { |
40 |
|
PriorityBlockingQueue q = new PriorityBlockingQueue(n); |
41 |
|
assertTrue(q.isEmpty()); |
42 |
< |
for(int i = n-1; i >= 0; i-=2) |
42 |
> |
for (int i = n-1; i >= 0; i-=2) |
43 |
|
assertTrue(q.offer(new Integer(i))); |
44 |
< |
for(int i = (n & 1); i < n; i+=2) |
44 |
> |
for (int i = (n & 1); i < n; i+=2) |
45 |
|
assertTrue(q.offer(new Integer(i))); |
46 |
|
assertFalse(q.isEmpty()); |
47 |
|
assertEquals(NOCAP, q.remainingCapacity()); |
48 |
|
assertEquals(n, q.size()); |
49 |
|
return q; |
50 |
|
} |
51 |
< |
|
51 |
> |
|
52 |
|
/** |
53 |
< |
* |
53 |
> |
* A new queue has unbounded capacity |
54 |
|
*/ |
55 |
|
public void testConstructor1() { |
56 |
|
assertEquals(NOCAP, new PriorityBlockingQueue(SIZE).remainingCapacity()); |
57 |
|
} |
58 |
|
|
59 |
|
/** |
60 |
< |
* |
60 |
> |
* Constructor throws IAE if capacity argument nonpositive |
61 |
|
*/ |
62 |
|
public void testConstructor2() { |
63 |
|
try { |
68 |
|
} |
69 |
|
|
70 |
|
/** |
71 |
< |
* |
71 |
> |
* Initializing from null Collection throws NPE |
72 |
|
*/ |
73 |
|
public void testConstructor3() { |
75 |
– |
|
74 |
|
try { |
75 |
|
PriorityBlockingQueue q = new PriorityBlockingQueue(null); |
76 |
|
shouldThrow(); |
79 |
|
} |
80 |
|
|
81 |
|
/** |
82 |
< |
* |
82 |
> |
* Initializing from Collection of null elements throws NPE |
83 |
|
*/ |
84 |
|
public void testConstructor4() { |
85 |
|
try { |
91 |
|
} |
92 |
|
|
93 |
|
/** |
94 |
< |
* |
94 |
> |
* Initializing from Collection with some null elements throws NPE |
95 |
|
*/ |
96 |
|
public void testConstructor5() { |
97 |
|
try { |
105 |
|
} |
106 |
|
|
107 |
|
/** |
108 |
< |
* |
108 |
> |
* Queue contains all elements of collection used to initialize |
109 |
|
*/ |
110 |
|
public void testConstructor6() { |
111 |
|
try { |
120 |
|
} |
121 |
|
|
122 |
|
/** |
123 |
< |
* |
123 |
> |
* The comparator used in constructor is used |
124 |
|
*/ |
125 |
|
public void testConstructor7() { |
126 |
|
try { |
138 |
|
} |
139 |
|
|
140 |
|
/** |
141 |
< |
* |
141 |
> |
* isEmpty is true before add, false after |
142 |
|
*/ |
143 |
|
public void testEmpty() { |
144 |
|
PriorityBlockingQueue q = new PriorityBlockingQueue(2); |
145 |
|
assertTrue(q.isEmpty()); |
146 |
|
assertEquals(NOCAP, q.remainingCapacity()); |
147 |
< |
q.add(new Integer(1)); |
147 |
> |
q.add(one); |
148 |
|
assertFalse(q.isEmpty()); |
149 |
< |
q.add(new Integer(2)); |
149 |
> |
q.add(two); |
150 |
|
q.remove(); |
151 |
|
q.remove(); |
152 |
|
assertTrue(q.isEmpty()); |
153 |
|
} |
154 |
|
|
155 |
|
/** |
156 |
< |
* |
156 |
> |
* remainingCapacity does not change when elements added or removed, |
157 |
> |
* but size does |
158 |
|
*/ |
159 |
|
public void testRemainingCapacity() { |
160 |
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
171 |
|
} |
172 |
|
|
173 |
|
/** |
174 |
< |
* |
174 |
> |
* offer(null) throws NPE |
175 |
|
*/ |
176 |
|
public void testOfferNull() { |
177 |
|
try { |
178 |
|
PriorityBlockingQueue q = new PriorityBlockingQueue(1); |
179 |
|
q.offer(null); |
180 |
|
shouldThrow(); |
181 |
< |
} catch (NullPointerException success) { } |
181 |
> |
} catch (NullPointerException success) { } |
182 |
> |
} |
183 |
> |
|
184 |
> |
/** |
185 |
> |
* add(null) throws NPE |
186 |
> |
*/ |
187 |
> |
public void testAddNull() { |
188 |
> |
try { |
189 |
> |
PriorityBlockingQueue q = new PriorityBlockingQueue(1); |
190 |
> |
q.add(null); |
191 |
> |
shouldThrow(); |
192 |
> |
} catch (NullPointerException success) { } |
193 |
|
} |
194 |
|
|
195 |
|
/** |
196 |
< |
* |
196 |
> |
* Offer of comparable element succeeds |
197 |
|
*/ |
198 |
|
public void testOffer() { |
199 |
|
PriorityBlockingQueue q = new PriorityBlockingQueue(1); |
200 |
< |
assertTrue(q.offer(new Integer(0))); |
201 |
< |
assertTrue(q.offer(new Integer(1))); |
200 |
> |
assertTrue(q.offer(zero)); |
201 |
> |
assertTrue(q.offer(one)); |
202 |
|
} |
203 |
|
|
204 |
|
/** |
205 |
< |
* |
205 |
> |
* Offer of non-Comparable throws CCE |
206 |
|
*/ |
207 |
|
public void testOfferNonComparable() { |
208 |
|
try { |
212 |
|
q.offer(new Object()); |
213 |
|
shouldThrow(); |
214 |
|
} |
215 |
< |
catch(ClassCastException success) {} |
215 |
> |
catch (ClassCastException success) {} |
216 |
|
} |
217 |
|
|
218 |
|
/** |
219 |
< |
* |
219 |
> |
* add of comparable succeeds |
220 |
|
*/ |
221 |
|
public void testAdd() { |
222 |
|
PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE); |
227 |
|
} |
228 |
|
|
229 |
|
/** |
230 |
< |
* |
230 |
> |
* addAll(null) throws NPE |
231 |
|
*/ |
232 |
|
public void testAddAll1() { |
233 |
|
try { |
237 |
|
} |
238 |
|
catch (NullPointerException success) {} |
239 |
|
} |
240 |
+ |
|
241 |
+ |
/** |
242 |
+ |
* addAll(this) throws IAE |
243 |
+ |
*/ |
244 |
+ |
public void testAddAllSelf() { |
245 |
+ |
try { |
246 |
+ |
PriorityBlockingQueue q = populatedQueue(SIZE); |
247 |
+ |
q.addAll(q); |
248 |
+ |
shouldThrow(); |
249 |
+ |
} |
250 |
+ |
catch (IllegalArgumentException success) {} |
251 |
+ |
} |
252 |
+ |
|
253 |
|
/** |
254 |
< |
* |
254 |
> |
* addAll of a collection with null elements throws NPE |
255 |
|
*/ |
256 |
|
public void testAddAll2() { |
257 |
|
try { |
263 |
|
catch (NullPointerException success) {} |
264 |
|
} |
265 |
|
/** |
266 |
< |
* |
266 |
> |
* addAll of a collection with any null elements throws NPE after |
267 |
> |
* possibly adding some elements |
268 |
|
*/ |
269 |
|
public void testAddAll3() { |
270 |
|
try { |
279 |
|
} |
280 |
|
|
281 |
|
/** |
282 |
< |
* |
282 |
> |
* Queue contains all elements of successful addAll |
283 |
|
*/ |
284 |
|
public void testAddAll5() { |
285 |
|
try { |
297 |
|
} |
298 |
|
|
299 |
|
/** |
300 |
< |
* |
300 |
> |
* put(null) throws NPE |
301 |
|
*/ |
302 |
|
public void testPutNull() { |
303 |
|
try { |
304 |
|
PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE); |
305 |
|
q.put(null); |
306 |
|
shouldThrow(); |
307 |
< |
} |
307 |
> |
} |
308 |
|
catch (NullPointerException success){ |
309 |
< |
} |
309 |
> |
} |
310 |
|
} |
311 |
|
|
312 |
|
/** |
313 |
< |
* |
313 |
> |
* all elements successfully put are contained |
314 |
|
*/ |
315 |
|
public void testPut() { |
316 |
|
try { |
327 |
|
} |
328 |
|
|
329 |
|
/** |
330 |
< |
* |
330 |
> |
* put doesn't block waiting for take |
331 |
|
*/ |
332 |
|
public void testPutWithTake() { |
333 |
|
final PriorityBlockingQueue q = new PriorityBlockingQueue(2); |
360 |
|
} |
361 |
|
|
362 |
|
/** |
363 |
< |
* |
363 |
> |
* timed offer does not time out |
364 |
|
*/ |
365 |
|
public void testTimedOffer() { |
366 |
|
final PriorityBlockingQueue q = new PriorityBlockingQueue(2); |
374 |
|
} finally { } |
375 |
|
} |
376 |
|
}); |
377 |
< |
|
377 |
> |
|
378 |
|
try { |
379 |
|
t.start(); |
380 |
|
Thread.sleep(SMALL_DELAY_MS); |
386 |
|
} |
387 |
|
|
388 |
|
/** |
389 |
< |
* |
389 |
> |
* take retrieves elements in priority order |
390 |
|
*/ |
391 |
|
public void testTake() { |
392 |
|
try { |
396 |
|
} |
397 |
|
} catch (InterruptedException e){ |
398 |
|
unexpectedException(); |
399 |
< |
} |
399 |
> |
} |
400 |
|
} |
401 |
|
|
402 |
|
/** |
403 |
< |
* |
403 |
> |
* take blocks interruptibly when empty |
404 |
|
*/ |
405 |
|
public void testTakeFromEmpty() { |
406 |
|
final PriorityBlockingQueue q = new PriorityBlockingQueue(2); |
409 |
|
try { |
410 |
|
q.take(); |
411 |
|
threadShouldThrow(); |
412 |
< |
} catch (InterruptedException success){ } |
412 |
> |
} catch (InterruptedException success){ } |
413 |
|
} |
414 |
|
}); |
415 |
|
try { |
423 |
|
} |
424 |
|
|
425 |
|
/** |
426 |
< |
* |
426 |
> |
* Take removes existing elements until empty, then blocks interruptibly |
427 |
|
*/ |
428 |
|
public void testBlockingTake() { |
429 |
|
Thread t = new Thread(new Runnable() { |
436 |
|
q.take(); |
437 |
|
threadShouldThrow(); |
438 |
|
} catch (InterruptedException success){ |
439 |
< |
} |
439 |
> |
} |
440 |
|
}}); |
441 |
|
t.start(); |
442 |
< |
try { |
443 |
< |
Thread.sleep(SHORT_DELAY_MS); |
442 |
> |
try { |
443 |
> |
Thread.sleep(SHORT_DELAY_MS); |
444 |
|
t.interrupt(); |
445 |
|
t.join(); |
446 |
|
} |
451 |
|
|
452 |
|
|
453 |
|
/** |
454 |
< |
* |
454 |
> |
* poll succeeds unless empty |
455 |
|
*/ |
456 |
|
public void testPoll() { |
457 |
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
462 |
|
} |
463 |
|
|
464 |
|
/** |
465 |
< |
* |
465 |
> |
* timed pool with zero timeout succeeds when non-empty, else times out |
466 |
|
*/ |
467 |
|
public void testTimedPoll0() { |
468 |
|
try { |
473 |
|
assertNull(q.poll(0, TimeUnit.MILLISECONDS)); |
474 |
|
} catch (InterruptedException e){ |
475 |
|
unexpectedException(); |
476 |
< |
} |
476 |
> |
} |
477 |
|
} |
478 |
|
|
479 |
|
/** |
480 |
< |
* |
480 |
> |
* timed pool with nonzero timeout succeeds when non-empty, else times out |
481 |
|
*/ |
482 |
|
public void testTimedPoll() { |
483 |
|
try { |
488 |
|
assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); |
489 |
|
} catch (InterruptedException e){ |
490 |
|
unexpectedException(); |
491 |
< |
} |
491 |
> |
} |
492 |
|
} |
493 |
|
|
494 |
|
/** |
495 |
< |
* |
495 |
> |
* Interrupted timed poll throws InterruptedException instead of |
496 |
> |
* returning timeout status |
497 |
|
*/ |
498 |
|
public void testInterruptedTimedPoll() { |
499 |
|
Thread t = new Thread(new Runnable() { |
505 |
|
} |
506 |
|
threadAssertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); |
507 |
|
} catch (InterruptedException success){ |
508 |
< |
} |
508 |
> |
} |
509 |
|
}}); |
510 |
|
t.start(); |
511 |
< |
try { |
512 |
< |
Thread.sleep(SHORT_DELAY_MS); |
511 |
> |
try { |
512 |
> |
Thread.sleep(SHORT_DELAY_MS); |
513 |
|
t.interrupt(); |
514 |
|
t.join(); |
515 |
|
} |
519 |
|
} |
520 |
|
|
521 |
|
/** |
522 |
< |
* |
522 |
> |
* timed poll before a delayed offer fails; after offer succeeds; |
523 |
> |
* on interruption throws |
524 |
|
*/ |
525 |
|
public void testTimedPollWithOffer() { |
526 |
|
final PriorityBlockingQueue q = new PriorityBlockingQueue(2); |
531 |
|
q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS); |
532 |
|
q.poll(LONG_DELAY_MS, TimeUnit.MILLISECONDS); |
533 |
|
threadShouldThrow(); |
534 |
< |
} catch (InterruptedException success) { } |
534 |
> |
} catch (InterruptedException success) { } |
535 |
|
} |
536 |
|
}); |
537 |
|
try { |
543 |
|
} catch (Exception e){ |
544 |
|
unexpectedException(); |
545 |
|
} |
546 |
< |
} |
546 |
> |
} |
547 |
|
|
548 |
|
|
549 |
|
/** |
550 |
< |
* |
550 |
> |
* peek returns next element, or null if empty |
551 |
|
*/ |
552 |
|
public void testPeek() { |
553 |
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
561 |
|
} |
562 |
|
|
563 |
|
/** |
564 |
< |
* |
564 |
> |
* element returns next element, or throws NSEE if empty |
565 |
|
*/ |
566 |
|
public void testElement() { |
567 |
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
577 |
|
} |
578 |
|
|
579 |
|
/** |
580 |
< |
* |
580 |
> |
* remove removes next element, or throws NSEE if empty |
581 |
|
*/ |
582 |
|
public void testRemove() { |
583 |
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
588 |
|
q.remove(); |
589 |
|
shouldThrow(); |
590 |
|
} catch (NoSuchElementException success){ |
591 |
< |
} |
591 |
> |
} |
592 |
|
} |
593 |
|
|
594 |
|
/** |
595 |
< |
* |
595 |
> |
* remove(x) removes x and returns true if present |
596 |
|
*/ |
597 |
|
public void testRemoveElement() { |
598 |
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
605 |
|
} |
606 |
|
assertTrue(q.isEmpty()); |
607 |
|
} |
608 |
< |
|
608 |
> |
|
609 |
|
/** |
610 |
< |
* |
610 |
> |
* contains(x) reports true when elements added but not yet removed |
611 |
|
*/ |
612 |
|
public void testContains() { |
613 |
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
619 |
|
} |
620 |
|
|
621 |
|
/** |
622 |
< |
* |
622 |
> |
* clear removes all elements |
623 |
|
*/ |
624 |
|
public void testClear() { |
625 |
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
626 |
|
q.clear(); |
627 |
|
assertTrue(q.isEmpty()); |
628 |
|
assertEquals(0, q.size()); |
629 |
< |
assertEquals(NOCAP, q.remainingCapacity()); |
604 |
< |
q.add(new Integer(1)); |
629 |
> |
q.add(one); |
630 |
|
assertFalse(q.isEmpty()); |
631 |
+ |
assertTrue(q.contains(one)); |
632 |
|
q.clear(); |
633 |
|
assertTrue(q.isEmpty()); |
634 |
|
} |
635 |
|
|
636 |
|
/** |
637 |
< |
* |
637 |
> |
* containsAll(c) is true when c contains a subset of elements |
638 |
|
*/ |
639 |
|
public void testContainsAll() { |
640 |
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
648 |
|
} |
649 |
|
|
650 |
|
/** |
651 |
< |
* |
651 |
> |
* retainAll(c) retains only those elements of c and reports true if changed |
652 |
|
*/ |
653 |
|
public void testRetainAll() { |
654 |
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
667 |
|
} |
668 |
|
|
669 |
|
/** |
670 |
< |
* |
670 |
> |
* removeAll(c) removes only those elements of c and reports true if changed |
671 |
|
*/ |
672 |
|
public void testRemoveAll() { |
673 |
|
for (int i = 1; i < SIZE; ++i) { |
683 |
|
} |
684 |
|
|
685 |
|
/** |
686 |
< |
* |
686 |
> |
* toArray contains all elements |
687 |
|
*/ |
688 |
|
public void testToArray() { |
689 |
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
690 |
|
Object[] o = q.toArray(); |
691 |
|
Arrays.sort(o); |
692 |
|
try { |
693 |
< |
for(int i = 0; i < o.length; i++) |
693 |
> |
for (int i = 0; i < o.length; i++) |
694 |
|
assertEquals(o[i], q.take()); |
695 |
|
} catch (InterruptedException e){ |
696 |
|
unexpectedException(); |
697 |
< |
} |
697 |
> |
} |
698 |
|
} |
699 |
|
|
700 |
|
/** |
701 |
< |
* |
701 |
> |
* toArray(a) contains all elements |
702 |
|
*/ |
703 |
|
public void testToArray2() { |
704 |
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
706 |
|
ints = (Integer[])q.toArray(ints); |
707 |
|
Arrays.sort(ints); |
708 |
|
try { |
709 |
< |
for(int i = 0; i < ints.length; i++) |
709 |
> |
for (int i = 0; i < ints.length; i++) |
710 |
|
assertEquals(ints[i], q.take()); |
711 |
|
} catch (InterruptedException e){ |
712 |
|
unexpectedException(); |
713 |
< |
} |
713 |
> |
} |
714 |
> |
} |
715 |
> |
|
716 |
> |
/** |
717 |
> |
* toArray(null) throws NPE |
718 |
> |
*/ |
719 |
> |
public void testToArray_BadArg() { |
720 |
> |
try { |
721 |
> |
PriorityBlockingQueue q = populatedQueue(SIZE); |
722 |
> |
Object o[] = q.toArray(null); |
723 |
> |
shouldThrow(); |
724 |
> |
} catch (NullPointerException success){} |
725 |
> |
} |
726 |
> |
|
727 |
> |
/** |
728 |
> |
* toArray with incompatible array type throws CCE |
729 |
> |
*/ |
730 |
> |
public void testToArray1_BadArg() { |
731 |
> |
try { |
732 |
> |
PriorityBlockingQueue q = populatedQueue(SIZE); |
733 |
> |
Object o[] = q.toArray(new String[10] ); |
734 |
> |
shouldThrow(); |
735 |
> |
} catch (ArrayStoreException success){} |
736 |
|
} |
737 |
< |
|
737 |
> |
|
738 |
|
/** |
739 |
< |
* |
739 |
> |
* iterator iterates through all elements |
740 |
|
*/ |
741 |
|
public void testIterator() { |
742 |
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
743 |
|
int i = 0; |
744 |
|
Iterator it = q.iterator(); |
745 |
< |
while(it.hasNext()) { |
745 |
> |
while (it.hasNext()) { |
746 |
|
assertTrue(q.contains(it.next())); |
747 |
|
++i; |
748 |
|
} |
750 |
|
} |
751 |
|
|
752 |
|
/** |
753 |
< |
* |
753 |
> |
* iterator.remove removes current element |
754 |
|
*/ |
755 |
|
public void testIteratorRemove () { |
756 |
|
final PriorityBlockingQueue q = new PriorityBlockingQueue(3); |
770 |
|
|
771 |
|
|
772 |
|
/** |
773 |
< |
* |
773 |
> |
* toString contains toStrings of elements |
774 |
|
*/ |
775 |
|
public void testToString() { |
776 |
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
778 |
|
for (int i = 0; i < SIZE; ++i) { |
779 |
|
assertTrue(s.indexOf(String.valueOf(i)) >= 0); |
780 |
|
} |
781 |
< |
} |
781 |
> |
} |
782 |
|
|
783 |
|
/** |
784 |
< |
* |
784 |
> |
* offer transfers elements across Executor tasks |
785 |
|
*/ |
786 |
|
public void testPollInExecutor() { |
739 |
– |
|
787 |
|
final PriorityBlockingQueue q = new PriorityBlockingQueue(2); |
741 |
– |
|
788 |
|
ExecutorService executor = Executors.newFixedThreadPool(2); |
743 |
– |
|
789 |
|
executor.execute(new Runnable() { |
790 |
|
public void run() { |
791 |
|
threadAssertNull(q.poll()); |
810 |
|
} |
811 |
|
} |
812 |
|
}); |
768 |
– |
|
769 |
– |
joinPool(executor); |
813 |
|
|
814 |
+ |
joinPool(executor); |
815 |
|
} |
816 |
|
|
817 |
|
/** |
818 |
< |
* |
818 |
> |
* A deserialized serialized queue has same elements |
819 |
|
*/ |
820 |
|
public void testSerialization() { |
821 |
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
829 |
|
ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin)); |
830 |
|
PriorityBlockingQueue r = (PriorityBlockingQueue)in.readObject(); |
831 |
|
assertEquals(q.size(), r.size()); |
832 |
< |
while (!q.isEmpty()) |
832 |
> |
while (!q.isEmpty()) |
833 |
|
assertEquals(q.remove(), r.remove()); |
834 |
< |
} catch(Exception e){ |
834 |
> |
} catch (Exception e){ |
835 |
> |
unexpectedException(); |
836 |
> |
} |
837 |
> |
} |
838 |
> |
|
839 |
> |
/** |
840 |
> |
* drainTo(null) throws NPE |
841 |
> |
*/ |
842 |
> |
public void testDrainToNull() { |
843 |
> |
PriorityBlockingQueue q = populatedQueue(SIZE); |
844 |
> |
try { |
845 |
> |
q.drainTo(null); |
846 |
> |
shouldThrow(); |
847 |
> |
} catch (NullPointerException success) { |
848 |
> |
} |
849 |
> |
} |
850 |
> |
|
851 |
> |
/** |
852 |
> |
* drainTo(this) throws IAE |
853 |
> |
*/ |
854 |
> |
public void testDrainToSelf() { |
855 |
> |
PriorityBlockingQueue q = populatedQueue(SIZE); |
856 |
> |
try { |
857 |
> |
q.drainTo(q); |
858 |
> |
shouldThrow(); |
859 |
> |
} catch (IllegalArgumentException success) { |
860 |
> |
} |
861 |
> |
} |
862 |
> |
|
863 |
> |
/** |
864 |
> |
* drainTo(c) empties queue into another collection c |
865 |
> |
*/ |
866 |
> |
public void testDrainTo() { |
867 |
> |
PriorityBlockingQueue q = populatedQueue(SIZE); |
868 |
> |
ArrayList l = new ArrayList(); |
869 |
> |
q.drainTo(l); |
870 |
> |
assertEquals(q.size(), 0); |
871 |
> |
assertEquals(l.size(), SIZE); |
872 |
> |
for (int i = 0; i < SIZE; ++i) |
873 |
> |
assertEquals(l.get(i), new Integer(i)); |
874 |
> |
q.add(zero); |
875 |
> |
q.add(one); |
876 |
> |
assertFalse(q.isEmpty()); |
877 |
> |
assertTrue(q.contains(zero)); |
878 |
> |
assertTrue(q.contains(one)); |
879 |
> |
l.clear(); |
880 |
> |
q.drainTo(l); |
881 |
> |
assertEquals(q.size(), 0); |
882 |
> |
assertEquals(l.size(), 2); |
883 |
> |
for (int i = 0; i < 2; ++i) |
884 |
> |
assertEquals(l.get(i), new Integer(i)); |
885 |
> |
} |
886 |
> |
|
887 |
> |
/** |
888 |
> |
* drainTo empties queue |
889 |
> |
*/ |
890 |
> |
public void testDrainToWithActivePut() { |
891 |
> |
final PriorityBlockingQueue q = populatedQueue(SIZE); |
892 |
> |
Thread t = new Thread(new Runnable() { |
893 |
> |
public void run() { |
894 |
> |
q.put(new Integer(SIZE+1)); |
895 |
> |
} |
896 |
> |
}); |
897 |
> |
try { |
898 |
> |
t.start(); |
899 |
> |
ArrayList l = new ArrayList(); |
900 |
> |
q.drainTo(l); |
901 |
> |
assertTrue(l.size() >= SIZE); |
902 |
> |
for (int i = 0; i < SIZE; ++i) |
903 |
> |
assertEquals(l.get(i), new Integer(i)); |
904 |
> |
t.join(); |
905 |
> |
assertTrue(q.size() + l.size() >= SIZE); |
906 |
> |
} catch (Exception e){ |
907 |
|
unexpectedException(); |
908 |
|
} |
909 |
|
} |
910 |
|
|
911 |
+ |
/** |
912 |
+ |
* drainTo(null, n) throws NPE |
913 |
+ |
*/ |
914 |
+ |
public void testDrainToNullN() { |
915 |
+ |
PriorityBlockingQueue q = populatedQueue(SIZE); |
916 |
+ |
try { |
917 |
+ |
q.drainTo(null, 0); |
918 |
+ |
shouldThrow(); |
919 |
+ |
} catch (NullPointerException success) { |
920 |
+ |
} |
921 |
+ |
} |
922 |
+ |
|
923 |
+ |
/** |
924 |
+ |
* drainTo(this, n) throws IAE |
925 |
+ |
*/ |
926 |
+ |
public void testDrainToSelfN() { |
927 |
+ |
PriorityBlockingQueue q = populatedQueue(SIZE); |
928 |
+ |
try { |
929 |
+ |
q.drainTo(q, 0); |
930 |
+ |
shouldThrow(); |
931 |
+ |
} catch (IllegalArgumentException success) { |
932 |
+ |
} |
933 |
+ |
} |
934 |
+ |
|
935 |
+ |
/** |
936 |
+ |
* drainTo(c, n) empties first max {n, size} elements of queue into c |
937 |
+ |
*/ |
938 |
+ |
public void testDrainToN() { |
939 |
+ |
PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE*2); |
940 |
+ |
for (int i = 0; i < SIZE + 2; ++i) { |
941 |
+ |
for (int j = 0; j < SIZE; j++) |
942 |
+ |
assertTrue(q.offer(new Integer(j))); |
943 |
+ |
ArrayList l = new ArrayList(); |
944 |
+ |
q.drainTo(l, i); |
945 |
+ |
int k = (i < SIZE)? i : SIZE; |
946 |
+ |
assertEquals(l.size(), k); |
947 |
+ |
assertEquals(q.size(), SIZE-k); |
948 |
+ |
for (int j = 0; j < k; ++j) |
949 |
+ |
assertEquals(l.get(j), new Integer(j)); |
950 |
+ |
while (q.poll() != null) ; |
951 |
+ |
} |
952 |
+ |
} |
953 |
+ |
|
954 |
+ |
|
955 |
|
} |