5 |
|
* Other contributors include John Vint |
6 |
|
*/ |
7 |
|
|
8 |
< |
import java.io.BufferedInputStream; |
9 |
< |
import java.io.BufferedOutputStream; |
10 |
< |
import java.io.ByteArrayInputStream; |
11 |
< |
import java.io.ByteArrayOutputStream; |
12 |
< |
import java.io.ObjectInputStream; |
13 |
< |
import java.io.ObjectOutputStream; |
8 |
> |
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
9 |
> |
|
10 |
|
import java.util.ArrayList; |
11 |
|
import java.util.Arrays; |
12 |
+ |
import java.util.Collection; |
13 |
|
import java.util.Iterator; |
14 |
|
import java.util.List; |
15 |
|
import java.util.NoSuchElementException; |
16 |
< |
import java.util.concurrent.*; |
17 |
< |
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
18 |
< |
import static java.util.concurrent.TimeUnit.NANOSECONDS; |
16 |
> |
import java.util.Queue; |
17 |
> |
import java.util.concurrent.BlockingQueue; |
18 |
> |
import java.util.concurrent.CountDownLatch; |
19 |
> |
import java.util.concurrent.Executors; |
20 |
> |
import java.util.concurrent.ExecutorService; |
21 |
> |
import java.util.concurrent.LinkedTransferQueue; |
22 |
> |
|
23 |
|
import junit.framework.Test; |
23 |
– |
import junit.framework.TestSuite; |
24 |
|
|
25 |
|
@SuppressWarnings({"unchecked", "rawtypes"}) |
26 |
|
public class LinkedTransferQueueTest extends JSR166TestCase { |
32 |
|
} |
33 |
|
|
34 |
|
public static void main(String[] args) { |
35 |
< |
junit.textui.TestRunner.run(suite()); |
35 |
> |
main(suite(), args); |
36 |
|
} |
37 |
|
|
38 |
|
public static Test suite() { |
65 |
|
* NullPointerException |
66 |
|
*/ |
67 |
|
public void testConstructor3() { |
68 |
+ |
Collection<Integer> elements = Arrays.asList(new Integer[SIZE]); |
69 |
|
try { |
70 |
< |
Integer[] ints = new Integer[SIZE]; |
70 |
< |
new LinkedTransferQueue(Arrays.asList(ints)); |
70 |
> |
new LinkedTransferQueue(elements); |
71 |
|
shouldThrow(); |
72 |
|
} catch (NullPointerException success) {} |
73 |
|
} |
77 |
|
* throws NullPointerException |
78 |
|
*/ |
79 |
|
public void testConstructor4() { |
80 |
+ |
Integer[] ints = new Integer[SIZE]; |
81 |
+ |
for (int i = 0; i < SIZE - 1; ++i) |
82 |
+ |
ints[i] = i; |
83 |
+ |
Collection<Integer> elements = Arrays.asList(ints); |
84 |
|
try { |
85 |
< |
Integer[] ints = new Integer[SIZE]; |
82 |
< |
for (int i = 0; i < SIZE - 1; ++i) { |
83 |
< |
ints[i] = i; |
84 |
< |
} |
85 |
< |
new LinkedTransferQueue(Arrays.asList(ints)); |
85 |
> |
new LinkedTransferQueue(elements); |
86 |
|
shouldThrow(); |
87 |
|
} catch (NullPointerException success) {} |
88 |
|
} |
115 |
|
* remainingCapacity() always returns Integer.MAX_VALUE |
116 |
|
*/ |
117 |
|
public void testRemainingCapacity() { |
118 |
< |
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
118 |
> |
BlockingQueue q = populatedQueue(SIZE); |
119 |
|
for (int i = 0; i < SIZE; ++i) { |
120 |
|
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
121 |
|
assertEquals(SIZE - i, q.size()); |
122 |
< |
q.remove(); |
122 |
> |
assertEquals(i, q.remove()); |
123 |
|
} |
124 |
|
for (int i = 0; i < SIZE; ++i) { |
125 |
|
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
126 |
|
assertEquals(i, q.size()); |
127 |
< |
q.add(i); |
127 |
> |
assertTrue(q.add(i)); |
128 |
|
} |
129 |
|
} |
130 |
|
|
131 |
|
/** |
132 |
– |
* offer(null) throws NullPointerException |
133 |
– |
*/ |
134 |
– |
public void testOfferNull() { |
135 |
– |
try { |
136 |
– |
LinkedTransferQueue q = new LinkedTransferQueue(); |
137 |
– |
q.offer(null); |
138 |
– |
shouldThrow(); |
139 |
– |
} catch (NullPointerException success) {} |
140 |
– |
} |
141 |
– |
|
142 |
– |
/** |
143 |
– |
* add(null) throws NullPointerException |
144 |
– |
*/ |
145 |
– |
public void testAddNull() { |
146 |
– |
try { |
147 |
– |
LinkedTransferQueue q = new LinkedTransferQueue(); |
148 |
– |
q.add(null); |
149 |
– |
shouldThrow(); |
150 |
– |
} catch (NullPointerException success) {} |
151 |
– |
} |
152 |
– |
|
153 |
– |
/** |
154 |
– |
* addAll(null) throws NullPointerException |
155 |
– |
*/ |
156 |
– |
public void testAddAll1() { |
157 |
– |
try { |
158 |
– |
LinkedTransferQueue q = new LinkedTransferQueue(); |
159 |
– |
q.addAll(null); |
160 |
– |
shouldThrow(); |
161 |
– |
} catch (NullPointerException success) {} |
162 |
– |
} |
163 |
– |
|
164 |
– |
/** |
132 |
|
* addAll(this) throws IllegalArgumentException |
133 |
|
*/ |
134 |
|
public void testAddAllSelf() { |
135 |
+ |
LinkedTransferQueue q = populatedQueue(SIZE); |
136 |
|
try { |
169 |
– |
LinkedTransferQueue q = populatedQueue(SIZE); |
137 |
|
q.addAll(q); |
138 |
|
shouldThrow(); |
139 |
|
} catch (IllegalArgumentException success) {} |
140 |
|
} |
141 |
|
|
142 |
|
/** |
176 |
– |
* addAll of a collection with null elements throws NullPointerException |
177 |
– |
*/ |
178 |
– |
public void testAddAll2() { |
179 |
– |
try { |
180 |
– |
LinkedTransferQueue q = new LinkedTransferQueue(); |
181 |
– |
Integer[] ints = new Integer[SIZE]; |
182 |
– |
q.addAll(Arrays.asList(ints)); |
183 |
– |
shouldThrow(); |
184 |
– |
} catch (NullPointerException success) {} |
185 |
– |
} |
186 |
– |
|
187 |
– |
/** |
143 |
|
* addAll of a collection with any null elements throws |
144 |
|
* NullPointerException after possibly adding some elements |
145 |
|
*/ |
146 |
|
public void testAddAll3() { |
147 |
+ |
LinkedTransferQueue q = new LinkedTransferQueue(); |
148 |
+ |
Integer[] ints = new Integer[SIZE]; |
149 |
+ |
for (int i = 0; i < SIZE - 1; ++i) |
150 |
+ |
ints[i] = i; |
151 |
|
try { |
193 |
– |
LinkedTransferQueue q = new LinkedTransferQueue(); |
194 |
– |
Integer[] ints = new Integer[SIZE]; |
195 |
– |
for (int i = 0; i < SIZE - 1; ++i) { |
196 |
– |
ints[i] = i; |
197 |
– |
} |
152 |
|
q.addAll(Arrays.asList(ints)); |
153 |
|
shouldThrow(); |
154 |
|
} catch (NullPointerException success) {} |
172 |
|
} |
173 |
|
|
174 |
|
/** |
221 |
– |
* put(null) throws NullPointerException |
222 |
– |
*/ |
223 |
– |
public void testPutNull() throws InterruptedException { |
224 |
– |
try { |
225 |
– |
LinkedTransferQueue q = new LinkedTransferQueue(); |
226 |
– |
q.put(null); |
227 |
– |
shouldThrow(); |
228 |
– |
} catch (NullPointerException success) {} |
229 |
– |
} |
230 |
– |
|
231 |
– |
/** |
175 |
|
* all elements successfully put are contained |
176 |
|
*/ |
177 |
|
public void testPut() { |
178 |
|
LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>(); |
179 |
|
for (int i = 0; i < SIZE; ++i) { |
180 |
< |
assertEquals(q.size(), i); |
180 |
> |
assertEquals(i, q.size()); |
181 |
|
q.put(i); |
182 |
|
assertTrue(q.contains(i)); |
183 |
|
} |
368 |
|
} |
369 |
|
|
370 |
|
/** |
428 |
– |
* remove(x) removes x and returns true if present |
429 |
– |
*/ |
430 |
– |
public void testRemoveElement() throws InterruptedException { |
431 |
– |
LinkedTransferQueue q = populatedQueue(SIZE); |
432 |
– |
for (int i = 1; i < SIZE; i+=2) { |
433 |
– |
assertTrue(q.contains(i)); |
434 |
– |
assertTrue(q.remove(i)); |
435 |
– |
assertFalse(q.contains(i)); |
436 |
– |
assertTrue(q.contains(i-1)); |
437 |
– |
} |
438 |
– |
for (int i = 0; i < SIZE; i+=2) { |
439 |
– |
assertTrue(q.contains(i)); |
440 |
– |
assertTrue(q.remove(i)); |
441 |
– |
assertFalse(q.contains(i)); |
442 |
– |
assertFalse(q.remove(i+1)); |
443 |
– |
assertFalse(q.contains(i+1)); |
444 |
– |
} |
445 |
– |
checkEmpty(q); |
446 |
– |
} |
447 |
– |
|
448 |
– |
/** |
371 |
|
* An add following remove(x) succeeds |
372 |
|
*/ |
373 |
|
public void testRemoveElementAndAdd() throws InterruptedException { |
483 |
|
} |
484 |
|
|
485 |
|
/** |
564 |
– |
* toArray(null) throws NullPointerException |
565 |
– |
*/ |
566 |
– |
public void testToArray_NullArg() { |
567 |
– |
LinkedTransferQueue q = populatedQueue(SIZE); |
568 |
– |
try { |
569 |
– |
q.toArray(null); |
570 |
– |
shouldThrow(); |
571 |
– |
} catch (NullPointerException success) {} |
572 |
– |
} |
573 |
– |
|
574 |
– |
/** |
486 |
|
* toArray(incompatible array type) throws ArrayStoreException |
487 |
|
*/ |
488 |
|
public void testToArray1_BadArg() { |
499 |
|
public void testIterator() throws InterruptedException { |
500 |
|
LinkedTransferQueue q = populatedQueue(SIZE); |
501 |
|
Iterator it = q.iterator(); |
502 |
< |
int i = 0; |
503 |
< |
while (it.hasNext()) { |
504 |
< |
assertEquals(it.next(), i++); |
594 |
< |
} |
502 |
> |
int i; |
503 |
> |
for (i = 0; it.hasNext(); i++) |
504 |
> |
assertTrue(q.contains(it.next())); |
505 |
|
assertEquals(i, SIZE); |
506 |
+ |
assertIteratorExhausted(it); |
507 |
+ |
|
508 |
+ |
it = q.iterator(); |
509 |
+ |
for (i = 0; it.hasNext(); i++) |
510 |
+ |
assertEquals(it.next(), q.take()); |
511 |
+ |
assertEquals(i, SIZE); |
512 |
+ |
assertIteratorExhausted(it); |
513 |
+ |
} |
514 |
+ |
|
515 |
+ |
/** |
516 |
+ |
* iterator of empty collection has no elements |
517 |
+ |
*/ |
518 |
+ |
public void testEmptyIterator() { |
519 |
+ |
assertIteratorExhausted(new LinkedTransferQueue().iterator()); |
520 |
|
} |
521 |
|
|
522 |
|
/** |
635 |
|
* A deserialized serialized queue has same elements in same order |
636 |
|
*/ |
637 |
|
public void testSerialization() throws Exception { |
638 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
638 |
> |
Queue x = populatedQueue(SIZE); |
639 |
> |
Queue y = serialClone(x); |
640 |
|
|
641 |
< |
ByteArrayOutputStream bout = new ByteArrayOutputStream(10000); |
642 |
< |
ObjectOutputStream out |
643 |
< |
= new ObjectOutputStream(new BufferedOutputStream(bout)); |
644 |
< |
out.writeObject(q); |
645 |
< |
out.close(); |
646 |
< |
|
647 |
< |
ByteArrayInputStream bin |
723 |
< |
= new ByteArrayInputStream(bout.toByteArray()); |
724 |
< |
ObjectInputStream in |
725 |
< |
= new ObjectInputStream(new BufferedInputStream(bin)); |
726 |
< |
LinkedTransferQueue r = (LinkedTransferQueue) in.readObject(); |
727 |
< |
|
728 |
< |
assertEquals(q.size(), r.size()); |
729 |
< |
assertEquals(q.toString(), r.toString()); |
730 |
< |
assertTrue(Arrays.equals(q.toArray(), r.toArray())); |
731 |
< |
while (!q.isEmpty()) { |
732 |
< |
assertEquals(q.remove(), r.remove()); |
641 |
> |
assertNotSame(y, x); |
642 |
> |
assertEquals(x.size(), y.size()); |
643 |
> |
assertEquals(x.toString(), y.toString()); |
644 |
> |
assertTrue(Arrays.equals(x.toArray(), y.toArray())); |
645 |
> |
while (!x.isEmpty()) { |
646 |
> |
assertFalse(y.isEmpty()); |
647 |
> |
assertEquals(x.remove(), y.remove()); |
648 |
|
} |
649 |
< |
} |
735 |
< |
|
736 |
< |
/** |
737 |
< |
* drainTo(null) throws NullPointerException |
738 |
< |
*/ |
739 |
< |
public void testDrainToNull() { |
740 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
741 |
< |
try { |
742 |
< |
q.drainTo(null); |
743 |
< |
shouldThrow(); |
744 |
< |
} catch (NullPointerException success) {} |
745 |
< |
} |
746 |
< |
|
747 |
< |
/** |
748 |
< |
* drainTo(this) throws IllegalArgumentException |
749 |
< |
*/ |
750 |
< |
public void testDrainToSelf() { |
751 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
752 |
< |
try { |
753 |
< |
q.drainTo(q); |
754 |
< |
shouldThrow(); |
755 |
< |
} catch (IllegalArgumentException success) {} |
649 |
> |
assertTrue(y.isEmpty()); |
650 |
|
} |
651 |
|
|
652 |
|
/** |
656 |
|
LinkedTransferQueue q = populatedQueue(SIZE); |
657 |
|
ArrayList l = new ArrayList(); |
658 |
|
q.drainTo(l); |
659 |
< |
assertEquals(q.size(), 0); |
660 |
< |
assertEquals(l.size(), SIZE); |
659 |
> |
assertEquals(0, q.size()); |
660 |
> |
assertEquals(SIZE, l.size()); |
661 |
|
for (int i = 0; i < SIZE; ++i) { |
662 |
< |
assertEquals(l.get(i), i); |
662 |
> |
assertEquals(i, l.get(i)); |
663 |
|
} |
664 |
|
q.add(zero); |
665 |
|
q.add(one); |
668 |
|
assertTrue(q.contains(one)); |
669 |
|
l.clear(); |
670 |
|
q.drainTo(l); |
671 |
< |
assertEquals(q.size(), 0); |
672 |
< |
assertEquals(l.size(), 2); |
671 |
> |
assertEquals(0, q.size()); |
672 |
> |
assertEquals(2, l.size()); |
673 |
|
for (int i = 0; i < 2; ++i) { |
674 |
< |
assertEquals(l.get(i), i); |
674 |
> |
assertEquals(i, l.get(i)); |
675 |
|
} |
676 |
|
} |
677 |
|
|
687 |
|
ArrayList l = new ArrayList(); |
688 |
|
q.drainTo(l); |
689 |
|
assertTrue(l.size() >= SIZE); |
690 |
< |
for (int i = 0; i < SIZE; ++i) { |
691 |
< |
assertEquals(l.get(i), i); |
798 |
< |
} |
690 |
> |
for (int i = 0; i < SIZE; ++i) |
691 |
> |
assertEquals(i, l.get(i)); |
692 |
|
awaitTermination(t, MEDIUM_DELAY_MS); |
693 |
|
assertTrue(q.size() + l.size() >= SIZE); |
694 |
|
} |
695 |
|
|
696 |
|
/** |
804 |
– |
* drainTo(null, n) throws NullPointerException |
805 |
– |
*/ |
806 |
– |
public void testDrainToNullN() { |
807 |
– |
LinkedTransferQueue q = populatedQueue(SIZE); |
808 |
– |
try { |
809 |
– |
q.drainTo(null, SIZE); |
810 |
– |
shouldThrow(); |
811 |
– |
} catch (NullPointerException success) {} |
812 |
– |
} |
813 |
– |
|
814 |
– |
/** |
815 |
– |
* drainTo(this, n) throws IllegalArgumentException |
816 |
– |
*/ |
817 |
– |
public void testDrainToSelfN() { |
818 |
– |
LinkedTransferQueue q = populatedQueue(SIZE); |
819 |
– |
try { |
820 |
– |
q.drainTo(q, SIZE); |
821 |
– |
shouldThrow(); |
822 |
– |
} catch (IllegalArgumentException success) {} |
823 |
– |
} |
824 |
– |
|
825 |
– |
/** |
697 |
|
* drainTo(c, n) empties first min(n, size) elements of queue into c |
698 |
|
*/ |
699 |
|
public void testDrainToN() { |
705 |
|
ArrayList l = new ArrayList(); |
706 |
|
q.drainTo(l, i); |
707 |
|
int k = (i < SIZE) ? i : SIZE; |
708 |
< |
assertEquals(l.size(), k); |
709 |
< |
assertEquals(q.size(), SIZE - k); |
710 |
< |
for (int j = 0; j < k; ++j) { |
711 |
< |
assertEquals(l.get(j), j); |
712 |
< |
} |
842 |
< |
while (q.poll() != null) |
843 |
< |
; |
708 |
> |
assertEquals(k, l.size()); |
709 |
> |
assertEquals(SIZE - k, q.size()); |
710 |
> |
for (int j = 0; j < k; ++j) |
711 |
> |
assertEquals(j, l.get(j)); |
712 |
> |
do {} while (q.poll() != null); |
713 |
|
} |
714 |
|
} |
715 |
|
|
719 |
|
*/ |
720 |
|
public void testWaitingConsumer() throws InterruptedException { |
721 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
722 |
< |
assertEquals(q.getWaitingConsumerCount(), 0); |
722 |
> |
assertEquals(0, q.getWaitingConsumerCount()); |
723 |
|
assertFalse(q.hasWaitingConsumer()); |
724 |
|
final CountDownLatch threadStarted = new CountDownLatch(1); |
725 |
|
|
727 |
|
public void realRun() throws InterruptedException { |
728 |
|
threadStarted.countDown(); |
729 |
|
assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
730 |
< |
assertEquals(q.getWaitingConsumerCount(), 0); |
730 |
> |
assertEquals(0, q.getWaitingConsumerCount()); |
731 |
|
assertFalse(q.hasWaitingConsumer()); |
732 |
|
}}); |
733 |
|
|
734 |
|
threadStarted.await(); |
735 |
|
waitForThreadToEnterWaitState(t, SMALL_DELAY_MS); |
736 |
< |
assertEquals(q.getWaitingConsumerCount(), 1); |
736 |
> |
assertEquals(1, q.getWaitingConsumerCount()); |
737 |
|
assertTrue(q.hasWaitingConsumer()); |
738 |
|
|
739 |
|
assertTrue(q.offer(one)); |
740 |
< |
assertEquals(q.getWaitingConsumerCount(), 0); |
740 |
> |
assertEquals(0, q.getWaitingConsumerCount()); |
741 |
|
assertFalse(q.hasWaitingConsumer()); |
742 |
|
|
743 |
|
awaitTermination(t, MEDIUM_DELAY_MS); |
861 |
|
* tryTransfer(null) throws NullPointerException |
862 |
|
*/ |
863 |
|
public void testTryTransfer1() { |
864 |
+ |
final LinkedTransferQueue q = new LinkedTransferQueue(); |
865 |
|
try { |
996 |
– |
final LinkedTransferQueue q = new LinkedTransferQueue(); |
866 |
|
q.tryTransfer(null); |
867 |
|
shouldThrow(); |
868 |
|
} catch (NullPointerException success) {} |
1025 |
|
assertFalse(q.isEmpty()); |
1026 |
|
return q; |
1027 |
|
} |
1028 |
+ |
|
1029 |
+ |
/** |
1030 |
+ |
* remove(null), contains(null) always return false |
1031 |
+ |
*/ |
1032 |
+ |
public void testNeverContainsNull() { |
1033 |
+ |
Collection<?>[] qs = { |
1034 |
+ |
new LinkedTransferQueue<Object>(), |
1035 |
+ |
populatedQueue(2), |
1036 |
+ |
}; |
1037 |
+ |
|
1038 |
+ |
for (Collection<?> q : qs) { |
1039 |
+ |
assertFalse(q.contains(null)); |
1040 |
+ |
assertFalse(q.remove(null)); |
1041 |
+ |
} |
1042 |
+ |
} |
1043 |
|
} |