5 |
|
* Other contributors include John Vint |
6 |
|
*/ |
7 |
|
|
8 |
< |
import junit.framework.*; |
9 |
< |
import java.util.Arrays; |
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; |
19 |
|
import java.util.concurrent.Executors; |
20 |
|
import java.util.concurrent.ExecutorService; |
21 |
|
import java.util.concurrent.LinkedTransferQueue; |
22 |
< |
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
23 |
< |
import static java.util.concurrent.TimeUnit.NANOSECONDS; |
22 |
> |
|
23 |
> |
import junit.framework.Test; |
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() { |
78 |
|
*/ |
79 |
|
public void testConstructor4() { |
80 |
|
Integer[] ints = new Integer[SIZE]; |
81 |
< |
for (int i = 0; i < SIZE-1; ++i) |
81 |
> |
for (int i = 0; i < SIZE - 1; ++i) |
82 |
|
ints[i] = i; |
83 |
|
Collection<Integer> elements = Arrays.asList(ints); |
84 |
|
try { |
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 |
|
|
132 |
|
* addAll(this) throws IllegalArgumentException |
133 |
|
*/ |
134 |
|
public void testAddAllSelf() { |
135 |
+ |
LinkedTransferQueue q = populatedQueue(SIZE); |
136 |
|
try { |
135 |
– |
LinkedTransferQueue q = populatedQueue(SIZE); |
137 |
|
q.addAll(q); |
138 |
|
shouldThrow(); |
139 |
|
} catch (IllegalArgumentException success) {} |
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 { |
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 |
– |
} |
152 |
|
q.addAll(Arrays.asList(ints)); |
153 |
|
shouldThrow(); |
154 |
|
} catch (NullPointerException success) {} |
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 |
|
} |
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++); |
505 |
< |
} |
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 |
|
/** |
638 |
|
Queue x = populatedQueue(SIZE); |
639 |
|
Queue y = serialClone(x); |
640 |
|
|
641 |
< |
assertTrue(x != y); |
641 |
> |
assertNotSame(y, x); |
642 |
|
assertEquals(x.size(), y.size()); |
643 |
|
assertEquals(x.toString(), y.toString()); |
644 |
|
assertTrue(Arrays.equals(x.toArray(), y.toArray())); |
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); |
679 |
< |
} |
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 |
|
} |
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 |
< |
} |
701 |
< |
while (q.poll() != null) |
702 |
< |
; |
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 { |
855 |
– |
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 |
|
} |