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.*; |
22 |
|
private static final int NOCAP = Integer.MAX_VALUE; |
23 |
|
|
24 |
|
/** |
25 |
< |
* A delayed implmentation for testing. |
25 |
> |
* A delayed implementation for testing. |
26 |
|
* Most tests use Pseudodelays, where delays are all elapsed |
27 |
|
* (so, no blocking solely for delays) but are still ordered |
28 |
|
*/ |
29 |
|
static class PDelay implements Delayed { |
30 |
|
int pseudodelay; |
31 |
|
PDelay(int i) { pseudodelay = Integer.MIN_VALUE + i; } |
32 |
< |
public int compareTo(Object y) { |
32 |
> |
public int compareTo(PDelay y) { |
33 |
|
int i = pseudodelay; |
34 |
|
int j = ((PDelay)y).pseudodelay; |
35 |
|
if (i < j) return -1; |
37 |
|
return 0; |
38 |
|
} |
39 |
|
|
40 |
< |
public int compareTo(PDelay y) { |
40 |
> |
public int compareTo(Delayed y) { |
41 |
|
int i = pseudodelay; |
42 |
|
int j = ((PDelay)y).pseudodelay; |
43 |
|
if (i < j) return -1; |
74 |
|
NanoDelay(long i) { |
75 |
|
trigger = System.nanoTime() + i; |
76 |
|
} |
77 |
< |
public int compareTo(Object y) { |
77 |
> |
public int compareTo(NanoDelay y) { |
78 |
|
long i = trigger; |
79 |
|
long j = ((NanoDelay)y).trigger; |
80 |
|
if (i < j) return -1; |
82 |
|
return 0; |
83 |
|
} |
84 |
|
|
85 |
< |
public int compareTo(NanoDelay y) { |
85 |
> |
public int compareTo(Delayed y) { |
86 |
|
long i = trigger; |
87 |
|
long j = ((NanoDelay)y).trigger; |
88 |
|
if (i < j) return -1; |
233 |
|
} |
234 |
|
|
235 |
|
/** |
236 |
+ |
* add(null) throws NPE |
237 |
+ |
*/ |
238 |
+ |
public void testAddNull() { |
239 |
+ |
try { |
240 |
+ |
DelayQueue q = new DelayQueue(); |
241 |
+ |
q.add(null); |
242 |
+ |
shouldThrow(); |
243 |
+ |
} catch (NullPointerException success) { } |
244 |
+ |
} |
245 |
+ |
|
246 |
+ |
/** |
247 |
|
* offer non-null succeeds |
248 |
|
*/ |
249 |
|
public void testOffer() { |
274 |
|
} |
275 |
|
catch (NullPointerException success) {} |
276 |
|
} |
277 |
+ |
|
278 |
+ |
|
279 |
+ |
/** |
280 |
+ |
* addAll(this) throws IAE |
281 |
+ |
*/ |
282 |
+ |
public void testAddAllSelf() { |
283 |
+ |
try { |
284 |
+ |
DelayQueue q = populatedQueue(SIZE); |
285 |
+ |
q.addAll(q); |
286 |
+ |
shouldThrow(); |
287 |
+ |
} |
288 |
+ |
catch (IllegalArgumentException success) {} |
289 |
+ |
} |
290 |
+ |
|
291 |
|
/** |
292 |
|
* addAll of a collection with null elements throws NPE |
293 |
|
*/ |
592 |
|
for (int i = 0; i < SIZE; ++i) { |
593 |
|
assertEquals(new PDelay(i), ((PDelay)q.peek())); |
594 |
|
q.poll(); |
595 |
< |
assertTrue(q.peek() == null || |
596 |
< |
i != ((PDelay)q.peek()).intValue()); |
595 |
> |
if (q.isEmpty()) |
596 |
> |
assertNull(q.peek()); |
597 |
> |
else |
598 |
> |
assertTrue(i != ((PDelay)q.peek()).intValue()); |
599 |
|
} |
600 |
|
assertNull(q.peek()); |
601 |
|
} |
667 |
|
assertTrue(q.isEmpty()); |
668 |
|
assertEquals(0, q.size()); |
669 |
|
assertEquals(NOCAP, q.remainingCapacity()); |
670 |
< |
q.add(new PDelay(1)); |
670 |
> |
PDelay x = new PDelay(1); |
671 |
> |
q.add(x); |
672 |
|
assertFalse(q.isEmpty()); |
673 |
+ |
assertTrue(q.contains(x)); |
674 |
|
q.clear(); |
675 |
|
assertTrue(q.isEmpty()); |
676 |
|
} |
754 |
|
unexpectedException(); |
755 |
|
} |
756 |
|
} |
757 |
+ |
|
758 |
+ |
|
759 |
+ |
/** |
760 |
+ |
* toArray(null) throws NPE |
761 |
+ |
*/ |
762 |
+ |
public void testToArray_BadArg() { |
763 |
+ |
try { |
764 |
+ |
DelayQueue q = populatedQueue(SIZE); |
765 |
+ |
Object o[] = q.toArray(null); |
766 |
+ |
shouldThrow(); |
767 |
+ |
} catch(NullPointerException success){} |
768 |
+ |
} |
769 |
+ |
|
770 |
+ |
/** |
771 |
+ |
* toArray with incompatible array type throws CCE |
772 |
+ |
*/ |
773 |
+ |
public void testToArray1_BadArg() { |
774 |
+ |
try { |
775 |
+ |
DelayQueue q = populatedQueue(SIZE); |
776 |
+ |
Object o[] = q.toArray(new String[10] ); |
777 |
+ |
shouldThrow(); |
778 |
+ |
} catch(ArrayStoreException success){} |
779 |
+ |
} |
780 |
|
|
781 |
|
/** |
782 |
|
* iterator iterates through all elements |
857 |
|
|
858 |
|
|
859 |
|
/** |
860 |
< |
* Dekayed actions do not occur until their delay elapses |
860 |
> |
* Delayed actions do not occur until their delay elapses |
861 |
|
*/ |
862 |
|
public void testDelay() { |
863 |
|
DelayQueue q = new DelayQueue(); |
885 |
|
} |
886 |
|
} |
887 |
|
|
888 |
+ |
/** |
889 |
+ |
* peek of a non-empty queue returns non-null even if not expired |
890 |
+ |
*/ |
891 |
+ |
public void testPeekDelayed() { |
892 |
+ |
DelayQueue q = new DelayQueue(); |
893 |
+ |
q.add(new NanoDelay(Long.MAX_VALUE)); |
894 |
+ |
assert(q.peek() != null); |
895 |
+ |
} |
896 |
+ |
|
897 |
+ |
|
898 |
+ |
/** |
899 |
+ |
* poll of a non-empty queue returns null if no expired elements. |
900 |
+ |
*/ |
901 |
+ |
public void testPollDelayed() { |
902 |
+ |
DelayQueue q = new DelayQueue(); |
903 |
+ |
q.add(new NanoDelay(Long.MAX_VALUE)); |
904 |
+ |
assertNull(q.poll()); |
905 |
+ |
} |
906 |
+ |
|
907 |
+ |
/** |
908 |
+ |
* timed poll of a non-empty queue returns null if no expired elements. |
909 |
+ |
*/ |
910 |
+ |
public void testTimedPollDelayed() { |
911 |
+ |
DelayQueue q = new DelayQueue(); |
912 |
+ |
q.add(new NanoDelay(LONG_DELAY_MS * 1000000L)); |
913 |
+ |
try { |
914 |
+ |
assertNull(q.poll(SHORT_DELAY_MS, TimeUnit.MILLISECONDS)); |
915 |
+ |
} catch (Exception ex) { |
916 |
+ |
unexpectedException(); |
917 |
+ |
} |
918 |
+ |
} |
919 |
+ |
|
920 |
+ |
/** |
921 |
+ |
* drainTo(null) throws NPE |
922 |
+ |
*/ |
923 |
+ |
public void testDrainToNull() { |
924 |
+ |
DelayQueue q = populatedQueue(SIZE); |
925 |
+ |
try { |
926 |
+ |
q.drainTo(null); |
927 |
+ |
shouldThrow(); |
928 |
+ |
} catch(NullPointerException success) { |
929 |
+ |
} |
930 |
+ |
} |
931 |
+ |
|
932 |
+ |
/** |
933 |
+ |
* drainTo(this) throws IAE |
934 |
+ |
*/ |
935 |
+ |
public void testDrainToSelf() { |
936 |
+ |
DelayQueue q = populatedQueue(SIZE); |
937 |
+ |
try { |
938 |
+ |
q.drainTo(q); |
939 |
+ |
shouldThrow(); |
940 |
+ |
} catch(IllegalArgumentException success) { |
941 |
+ |
} |
942 |
+ |
} |
943 |
+ |
|
944 |
+ |
/** |
945 |
+ |
* drainTo(c) empties queue into another collection c |
946 |
+ |
*/ |
947 |
+ |
public void testDrainTo() { |
948 |
+ |
DelayQueue q = new DelayQueue(); |
949 |
+ |
PDelay[] elems = new PDelay[SIZE]; |
950 |
+ |
for (int i = 0; i < SIZE; ++i) { |
951 |
+ |
elems[i] = new PDelay(i); |
952 |
+ |
q.add(elems[i]); |
953 |
+ |
} |
954 |
+ |
ArrayList l = new ArrayList(); |
955 |
+ |
q.drainTo(l); |
956 |
+ |
assertEquals(q.size(), 0); |
957 |
+ |
for (int i = 0; i < SIZE; ++i) |
958 |
+ |
assertEquals(l.get(i), elems[i]); |
959 |
+ |
q.add(elems[0]); |
960 |
+ |
q.add(elems[1]); |
961 |
+ |
assertFalse(q.isEmpty()); |
962 |
+ |
assertTrue(q.contains(elems[0])); |
963 |
+ |
assertTrue(q.contains(elems[1])); |
964 |
+ |
l.clear(); |
965 |
+ |
q.drainTo(l); |
966 |
+ |
assertEquals(q.size(), 0); |
967 |
+ |
assertEquals(l.size(), 2); |
968 |
+ |
for (int i = 0; i < 2; ++i) |
969 |
+ |
assertEquals(l.get(i), elems[i]); |
970 |
+ |
} |
971 |
+ |
|
972 |
+ |
/** |
973 |
+ |
* drainTo empties queue |
974 |
+ |
*/ |
975 |
+ |
public void testDrainToWithActivePut() { |
976 |
+ |
final DelayQueue q = populatedQueue(SIZE); |
977 |
+ |
Thread t = new Thread(new Runnable() { |
978 |
+ |
public void run() { |
979 |
+ |
q.put(new PDelay(SIZE+1)); |
980 |
+ |
} |
981 |
+ |
}); |
982 |
+ |
try { |
983 |
+ |
t.start(); |
984 |
+ |
ArrayList l = new ArrayList(); |
985 |
+ |
q.drainTo(l); |
986 |
+ |
assertTrue(l.size() >= SIZE); |
987 |
+ |
t.join(); |
988 |
+ |
assertTrue(q.size() + l.size() >= SIZE); |
989 |
+ |
} catch(Exception e){ |
990 |
+ |
unexpectedException(); |
991 |
+ |
} |
992 |
+ |
} |
993 |
+ |
|
994 |
+ |
/** |
995 |
+ |
* drainTo(null, n) throws NPE |
996 |
+ |
*/ |
997 |
+ |
public void testDrainToNullN() { |
998 |
+ |
DelayQueue q = populatedQueue(SIZE); |
999 |
+ |
try { |
1000 |
+ |
q.drainTo(null, 0); |
1001 |
+ |
shouldThrow(); |
1002 |
+ |
} catch(NullPointerException success) { |
1003 |
+ |
} |
1004 |
+ |
} |
1005 |
+ |
|
1006 |
+ |
/** |
1007 |
+ |
* drainTo(this, n) throws IAE |
1008 |
+ |
*/ |
1009 |
+ |
public void testDrainToSelfN() { |
1010 |
+ |
DelayQueue q = populatedQueue(SIZE); |
1011 |
+ |
try { |
1012 |
+ |
q.drainTo(q, 0); |
1013 |
+ |
shouldThrow(); |
1014 |
+ |
} catch(IllegalArgumentException success) { |
1015 |
+ |
} |
1016 |
+ |
} |
1017 |
+ |
|
1018 |
+ |
/** |
1019 |
+ |
* drainTo(c, n) empties first max {n, size} elements of queue into c |
1020 |
+ |
*/ |
1021 |
+ |
public void testDrainToN() { |
1022 |
+ |
for (int i = 0; i < SIZE + 2; ++i) { |
1023 |
+ |
DelayQueue q = populatedQueue(SIZE); |
1024 |
+ |
ArrayList l = new ArrayList(); |
1025 |
+ |
q.drainTo(l, i); |
1026 |
+ |
int k = (i < SIZE)? i : SIZE; |
1027 |
+ |
assertEquals(q.size(), SIZE-k); |
1028 |
+ |
assertEquals(l.size(), k); |
1029 |
+ |
} |
1030 |
+ |
} |
1031 |
+ |
|
1032 |
+ |
|
1033 |
|
} |