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. |
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 |
|
} |
18 |
|
public static Test suite() { |
19 |
|
return new TestSuite(PriorityBlockingQueueTest.class); |
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(); |
48 |
|
assertEquals(n, q.size()); |
49 |
|
return q; |
50 |
|
} |
51 |
< |
|
51 |
> |
|
52 |
|
/** |
53 |
|
* A new queue has unbounded capacity |
54 |
|
*/ |
178 |
|
PriorityBlockingQueue q = new PriorityBlockingQueue(1); |
179 |
|
q.offer(null); |
180 |
|
shouldThrow(); |
181 |
< |
} catch (NullPointerException success) { } |
181 |
> |
} catch (NullPointerException success) { } |
182 |
|
} |
183 |
|
|
184 |
|
/** |
189 |
|
PriorityBlockingQueue q = new PriorityBlockingQueue(1); |
190 |
|
q.add(null); |
191 |
|
shouldThrow(); |
192 |
< |
} catch (NullPointerException success) { } |
192 |
> |
} catch (NullPointerException success) { } |
193 |
|
} |
194 |
|
|
195 |
|
/** |
304 |
|
PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE); |
305 |
|
q.put(null); |
306 |
|
shouldThrow(); |
307 |
< |
} |
307 |
> |
} |
308 |
|
catch (NullPointerException success){ |
309 |
< |
} |
309 |
> |
} |
310 |
|
} |
311 |
|
|
312 |
|
/** |
374 |
|
} finally { } |
375 |
|
} |
376 |
|
}); |
377 |
< |
|
377 |
> |
|
378 |
|
try { |
379 |
|
t.start(); |
380 |
|
Thread.sleep(SMALL_DELAY_MS); |
396 |
|
} |
397 |
|
} catch (InterruptedException e){ |
398 |
|
unexpectedException(); |
399 |
< |
} |
399 |
> |
} |
400 |
|
} |
401 |
|
|
402 |
|
/** |
409 |
|
try { |
410 |
|
q.take(); |
411 |
|
threadShouldThrow(); |
412 |
< |
} catch (InterruptedException success){ } |
412 |
> |
} catch (InterruptedException success){ } |
413 |
|
} |
414 |
|
}); |
415 |
|
try { |
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 |
|
} |
473 |
|
assertNull(q.poll(0, TimeUnit.MILLISECONDS)); |
474 |
|
} catch (InterruptedException e){ |
475 |
|
unexpectedException(); |
476 |
< |
} |
476 |
> |
} |
477 |
|
} |
478 |
|
|
479 |
|
/** |
488 |
|
assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); |
489 |
|
} catch (InterruptedException e){ |
490 |
|
unexpectedException(); |
491 |
< |
} |
491 |
> |
} |
492 |
|
} |
493 |
|
|
494 |
|
/** |
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 |
|
} |
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 |
|
/** |
588 |
|
q.remove(); |
589 |
|
shouldThrow(); |
590 |
|
} catch (NoSuchElementException success){ |
591 |
< |
} |
591 |
> |
} |
592 |
|
} |
593 |
|
|
594 |
|
/** |
605 |
|
} |
606 |
|
assertTrue(q.isEmpty()); |
607 |
|
} |
608 |
< |
|
608 |
> |
|
609 |
|
/** |
610 |
|
* contains(x) reports true when elements added but not yet removed |
611 |
|
*/ |
694 |
|
assertEquals(o[i], q.take()); |
695 |
|
} catch (InterruptedException e){ |
696 |
|
unexpectedException(); |
697 |
< |
} |
697 |
> |
} |
698 |
|
} |
699 |
|
|
700 |
|
/** |
710 |
|
assertEquals(ints[i], q.take()); |
711 |
|
} catch (InterruptedException e){ |
712 |
|
unexpectedException(); |
713 |
< |
} |
713 |
> |
} |
714 |
|
} |
715 |
|
|
716 |
|
/** |
734 |
|
shouldThrow(); |
735 |
|
} catch(ArrayStoreException success){} |
736 |
|
} |
737 |
< |
|
737 |
> |
|
738 |
|
/** |
739 |
|
* iterator iterates through all elements |
740 |
|
*/ |
778 |
|
for (int i = 0; i < SIZE; ++i) { |
779 |
|
assertTrue(s.indexOf(String.valueOf(i)) >= 0); |
780 |
|
} |
781 |
< |
} |
781 |
> |
} |
782 |
|
|
783 |
|
/** |
784 |
|
* offer transfers elements across Executor tasks |
810 |
|
} |
811 |
|
} |
812 |
|
}); |
813 |
< |
|
813 |
> |
|
814 |
|
joinPool(executor); |
815 |
|
} |
816 |
|
|
817 |
|
/** |
818 |
< |
* A deserialized serialized queue has same elements |
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){ |
835 |
|
unexpectedException(); |
838 |
|
|
839 |
|
/** |
840 |
|
* drainTo(null) throws NPE |
841 |
< |
*/ |
841 |
> |
*/ |
842 |
|
public void testDrainToNull() { |
843 |
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
844 |
|
try { |
850 |
|
|
851 |
|
/** |
852 |
|
* drainTo(this) throws IAE |
853 |
< |
*/ |
853 |
> |
*/ |
854 |
|
public void testDrainToSelf() { |
855 |
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
856 |
|
try { |
862 |
|
|
863 |
|
/** |
864 |
|
* drainTo(c) empties queue into another collection c |
865 |
< |
*/ |
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) |
872 |
> |
for (int i = 0; i < SIZE; ++i) |
873 |
|
assertEquals(l.get(i), new Integer(i)); |
874 |
|
q.add(zero); |
875 |
|
q.add(one); |
880 |
|
q.drainTo(l); |
881 |
|
assertEquals(q.size(), 0); |
882 |
|
assertEquals(l.size(), 2); |
883 |
< |
for (int i = 0; i < 2; ++i) |
883 |
> |
for (int i = 0; i < 2; ++i) |
884 |
|
assertEquals(l.get(i), new Integer(i)); |
885 |
|
} |
886 |
|
|
887 |
|
/** |
888 |
|
* drainTo empties queue |
889 |
< |
*/ |
889 |
> |
*/ |
890 |
|
public void testDrainToWithActivePut() { |
891 |
|
final PriorityBlockingQueue q = populatedQueue(SIZE); |
892 |
|
Thread t = new Thread(new Runnable() { |
899 |
|
ArrayList l = new ArrayList(); |
900 |
|
q.drainTo(l); |
901 |
|
assertTrue(l.size() >= SIZE); |
902 |
< |
for (int i = 0; i < SIZE; ++i) |
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); |
910 |
|
|
911 |
|
/** |
912 |
|
* drainTo(null, n) throws NPE |
913 |
< |
*/ |
913 |
> |
*/ |
914 |
|
public void testDrainToNullN() { |
915 |
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
916 |
|
try { |
922 |
|
|
923 |
|
/** |
924 |
|
* drainTo(this, n) throws IAE |
925 |
< |
*/ |
925 |
> |
*/ |
926 |
|
public void testDrainToSelfN() { |
927 |
|
PriorityBlockingQueue q = populatedQueue(SIZE); |
928 |
|
try { |
934 |
|
|
935 |
|
/** |
936 |
|
* drainTo(c, n) empties first max {n, size} elements of queue into c |
937 |
< |
*/ |
937 |
> |
*/ |
938 |
|
public void testDrainToN() { |
939 |
|
PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE*2); |
940 |
|
for (int i = 0; i < SIZE + 2; ++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) |
948 |
> |
for (int j = 0; j < k; ++j) |
949 |
|
assertEquals(l.get(j), new Integer(j)); |
950 |
|
while (q.poll() != null) ; |
951 |
|
} |