1 |
|
/* |
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 |
4 |
> |
* http://creativecommons.org/publicdomain/zero/1.0/ |
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.Callable; |
19 |
> |
import java.util.concurrent.CountDownLatch; |
20 |
> |
import java.util.concurrent.Executors; |
21 |
> |
import java.util.concurrent.ExecutorService; |
22 |
> |
import java.util.concurrent.LinkedTransferQueue; |
23 |
> |
|
24 |
|
import junit.framework.Test; |
23 |
– |
import junit.framework.TestSuite; |
25 |
|
|
26 |
|
@SuppressWarnings({"unchecked", "rawtypes"}) |
27 |
|
public class LinkedTransferQueueTest extends JSR166TestCase { |
27 |
– |
|
28 |
|
public static class Generic extends BlockingQueueTest { |
29 |
|
protected BlockingQueue emptyCollection() { |
30 |
|
return new LinkedTransferQueue(); |
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() { |
39 |
< |
return newTestSuite(LinkedTransferQueueTest.class, |
40 |
< |
new Generic().testSuite()); |
41 |
< |
} |
42 |
< |
|
43 |
< |
void checkEmpty(BlockingQueue q) { |
44 |
< |
try { |
45 |
< |
assertTrue(q.isEmpty()); |
46 |
< |
assertEquals(0, q.size()); |
47 |
< |
assertNull(q.peek()); |
48 |
< |
assertNull(q.poll()); |
49 |
< |
assertNull(q.poll(0, MILLISECONDS)); |
50 |
< |
assertEquals(q.toString(), "[]"); |
51 |
< |
assertTrue(Arrays.equals(q.toArray(), new Object[0])); |
52 |
< |
assertFalse(q.iterator().hasNext()); |
53 |
< |
try { |
54 |
< |
q.element(); |
55 |
< |
shouldThrow(); |
56 |
< |
} catch (NoSuchElementException success) {} |
57 |
< |
try { |
58 |
< |
q.iterator().next(); |
59 |
< |
shouldThrow(); |
60 |
< |
} catch (NoSuchElementException success) {} |
61 |
< |
try { |
62 |
< |
q.remove(); |
63 |
< |
shouldThrow(); |
64 |
< |
} catch (NoSuchElementException success) {} |
65 |
< |
} catch (InterruptedException ie) { |
66 |
< |
threadUnexpectedException(ie); |
39 |
> |
class Implementation implements CollectionImplementation { |
40 |
> |
public Class<?> klazz() { return LinkedTransferQueue.class; } |
41 |
> |
public Collection emptyCollection() { return new LinkedTransferQueue(); } |
42 |
> |
public Object makeElement(int i) { return i; } |
43 |
> |
public boolean isConcurrent() { return true; } |
44 |
> |
public boolean permitsNulls() { return false; } |
45 |
|
} |
46 |
+ |
return newTestSuite(LinkedTransferQueueTest.class, |
47 |
+ |
new Generic().testSuite(), |
48 |
+ |
CollectionTest.testSuite(new Implementation())); |
49 |
|
} |
50 |
|
|
51 |
|
/** |
73 |
|
* NullPointerException |
74 |
|
*/ |
75 |
|
public void testConstructor3() { |
76 |
+ |
Collection<Integer> elements = Arrays.asList(new Integer[SIZE]); |
77 |
|
try { |
78 |
< |
Integer[] ints = new Integer[SIZE]; |
97 |
< |
new LinkedTransferQueue(Arrays.asList(ints)); |
78 |
> |
new LinkedTransferQueue(elements); |
79 |
|
shouldThrow(); |
80 |
|
} catch (NullPointerException success) {} |
81 |
|
} |
85 |
|
* throws NullPointerException |
86 |
|
*/ |
87 |
|
public void testConstructor4() { |
88 |
+ |
Integer[] ints = new Integer[SIZE]; |
89 |
+ |
for (int i = 0; i < SIZE - 1; ++i) |
90 |
+ |
ints[i] = i; |
91 |
+ |
Collection<Integer> elements = Arrays.asList(ints); |
92 |
|
try { |
93 |
< |
Integer[] ints = new Integer[SIZE]; |
109 |
< |
for (int i = 0; i < SIZE - 1; ++i) { |
110 |
< |
ints[i] = i; |
111 |
< |
} |
112 |
< |
new LinkedTransferQueue(Arrays.asList(ints)); |
93 |
> |
new LinkedTransferQueue(elements); |
94 |
|
shouldThrow(); |
95 |
|
} catch (NullPointerException success) {} |
96 |
|
} |
123 |
|
* remainingCapacity() always returns Integer.MAX_VALUE |
124 |
|
*/ |
125 |
|
public void testRemainingCapacity() { |
126 |
< |
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
126 |
> |
BlockingQueue q = populatedQueue(SIZE); |
127 |
|
for (int i = 0; i < SIZE; ++i) { |
128 |
|
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
129 |
|
assertEquals(SIZE - i, q.size()); |
130 |
< |
q.remove(); |
130 |
> |
assertEquals(i, q.remove()); |
131 |
|
} |
132 |
|
for (int i = 0; i < SIZE; ++i) { |
133 |
|
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
134 |
|
assertEquals(i, q.size()); |
135 |
< |
q.add(i); |
135 |
> |
assertTrue(q.add(i)); |
136 |
|
} |
137 |
|
} |
138 |
|
|
139 |
|
/** |
159 |
– |
* offer(null) throws NullPointerException |
160 |
– |
*/ |
161 |
– |
public void testOfferNull() { |
162 |
– |
try { |
163 |
– |
LinkedTransferQueue q = new LinkedTransferQueue(); |
164 |
– |
q.offer(null); |
165 |
– |
shouldThrow(); |
166 |
– |
} catch (NullPointerException success) {} |
167 |
– |
} |
168 |
– |
|
169 |
– |
/** |
170 |
– |
* add(null) throws NullPointerException |
171 |
– |
*/ |
172 |
– |
public void testAddNull() { |
173 |
– |
try { |
174 |
– |
LinkedTransferQueue q = new LinkedTransferQueue(); |
175 |
– |
q.add(null); |
176 |
– |
shouldThrow(); |
177 |
– |
} catch (NullPointerException success) {} |
178 |
– |
} |
179 |
– |
|
180 |
– |
/** |
181 |
– |
* addAll(null) throws NullPointerException |
182 |
– |
*/ |
183 |
– |
public void testAddAll1() { |
184 |
– |
try { |
185 |
– |
LinkedTransferQueue q = new LinkedTransferQueue(); |
186 |
– |
q.addAll(null); |
187 |
– |
shouldThrow(); |
188 |
– |
} catch (NullPointerException success) {} |
189 |
– |
} |
190 |
– |
|
191 |
– |
/** |
140 |
|
* addAll(this) throws IllegalArgumentException |
141 |
|
*/ |
142 |
|
public void testAddAllSelf() { |
143 |
+ |
LinkedTransferQueue q = populatedQueue(SIZE); |
144 |
|
try { |
196 |
– |
LinkedTransferQueue q = populatedQueue(SIZE); |
145 |
|
q.addAll(q); |
146 |
|
shouldThrow(); |
147 |
|
} catch (IllegalArgumentException success) {} |
148 |
|
} |
149 |
|
|
150 |
|
/** |
203 |
– |
* addAll of a collection with null elements throws NullPointerException |
204 |
– |
*/ |
205 |
– |
public void testAddAll2() { |
206 |
– |
try { |
207 |
– |
LinkedTransferQueue q = new LinkedTransferQueue(); |
208 |
– |
Integer[] ints = new Integer[SIZE]; |
209 |
– |
q.addAll(Arrays.asList(ints)); |
210 |
– |
shouldThrow(); |
211 |
– |
} catch (NullPointerException success) {} |
212 |
– |
} |
213 |
– |
|
214 |
– |
/** |
151 |
|
* addAll of a collection with any null elements throws |
152 |
|
* NullPointerException after possibly adding some elements |
153 |
|
*/ |
154 |
|
public void testAddAll3() { |
155 |
+ |
LinkedTransferQueue q = new LinkedTransferQueue(); |
156 |
+ |
Integer[] ints = new Integer[SIZE]; |
157 |
+ |
for (int i = 0; i < SIZE - 1; ++i) |
158 |
+ |
ints[i] = i; |
159 |
|
try { |
220 |
– |
LinkedTransferQueue q = new LinkedTransferQueue(); |
221 |
– |
Integer[] ints = new Integer[SIZE]; |
222 |
– |
for (int i = 0; i < SIZE - 1; ++i) { |
223 |
– |
ints[i] = i; |
224 |
– |
} |
160 |
|
q.addAll(Arrays.asList(ints)); |
161 |
|
shouldThrow(); |
162 |
|
} catch (NullPointerException success) {} |
180 |
|
} |
181 |
|
|
182 |
|
/** |
248 |
– |
* put(null) throws NullPointerException |
249 |
– |
*/ |
250 |
– |
public void testPutNull() throws InterruptedException { |
251 |
– |
try { |
252 |
– |
LinkedTransferQueue q = new LinkedTransferQueue(); |
253 |
– |
q.put(null); |
254 |
– |
shouldThrow(); |
255 |
– |
} catch (NullPointerException success) {} |
256 |
– |
} |
257 |
– |
|
258 |
– |
/** |
183 |
|
* all elements successfully put are contained |
184 |
|
*/ |
185 |
|
public void testPut() { |
186 |
< |
LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>(); |
186 |
> |
LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>(); |
187 |
|
for (int i = 0; i < SIZE; ++i) { |
188 |
< |
assertEquals(q.size(), i); |
188 |
> |
assertEquals(i, q.size()); |
189 |
|
q.put(i); |
190 |
|
assertTrue(q.contains(i)); |
191 |
|
} |
205 |
|
* take removes existing elements until empty, then blocks interruptibly |
206 |
|
*/ |
207 |
|
public void testBlockingTake() throws InterruptedException { |
208 |
< |
final BlockingQueue<Integer> q = populatedQueue(SIZE); |
209 |
< |
final CountDownLatch aboutToWait = new CountDownLatch(1); |
208 |
> |
final BlockingQueue q = populatedQueue(SIZE); |
209 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
210 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
211 |
|
public void realRun() throws InterruptedException { |
212 |
< |
for (int i = 0; i < SIZE; ++i) { |
213 |
< |
assertEquals(i, (int) q.take()); |
214 |
< |
} |
215 |
< |
aboutToWait.countDown(); |
212 |
> |
for (int i = 0; i < SIZE; i++) assertEquals(i, q.take()); |
213 |
> |
|
214 |
> |
Thread.currentThread().interrupt(); |
215 |
> |
try { |
216 |
> |
q.take(); |
217 |
> |
shouldThrow(); |
218 |
> |
} catch (InterruptedException success) {} |
219 |
> |
assertFalse(Thread.interrupted()); |
220 |
> |
|
221 |
> |
pleaseInterrupt.countDown(); |
222 |
|
try { |
223 |
|
q.take(); |
224 |
|
shouldThrow(); |
225 |
|
} catch (InterruptedException success) {} |
226 |
+ |
assertFalse(Thread.interrupted()); |
227 |
|
}}); |
228 |
|
|
229 |
< |
aboutToWait.await(); |
230 |
< |
waitForThreadToEnterWaitState(t, SMALL_DELAY_MS); |
229 |
> |
await(pleaseInterrupt); |
230 |
> |
if (randomBoolean()) assertThreadBlocks(t, Thread.State.WAITING); |
231 |
|
t.interrupt(); |
232 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
302 |
< |
checkEmpty(q); |
232 |
> |
awaitTermination(t); |
233 |
|
} |
234 |
|
|
235 |
|
/** |
261 |
|
*/ |
262 |
|
public void testTimedPoll() throws InterruptedException { |
263 |
|
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
264 |
< |
for (int i = 0; i < SIZE; ++i) { |
265 |
< |
long t0 = System.nanoTime(); |
266 |
< |
assertEquals(i, (int) q.poll(SMALL_DELAY_MS, MILLISECONDS)); |
267 |
< |
assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS); |
268 |
< |
} |
269 |
< |
long t0 = System.nanoTime(); |
270 |
< |
assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
271 |
< |
assertTrue(millisElapsedSince(t0) >= SHORT_DELAY_MS); |
264 |
> |
long startTime = System.nanoTime(); |
265 |
> |
for (int i = 0; i < SIZE; ++i) |
266 |
> |
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
267 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
268 |
> |
|
269 |
> |
startTime = System.nanoTime(); |
270 |
> |
assertNull(q.poll(timeoutMillis(), MILLISECONDS)); |
271 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
272 |
|
checkEmpty(q); |
273 |
|
} |
274 |
|
|
278 |
|
*/ |
279 |
|
public void testInterruptedTimedPoll() throws InterruptedException { |
280 |
|
final BlockingQueue<Integer> q = populatedQueue(SIZE); |
281 |
< |
final CountDownLatch aboutToWait = new CountDownLatch(1); |
281 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
282 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
283 |
|
public void realRun() throws InterruptedException { |
284 |
< |
for (int i = 0; i < SIZE; ++i) { |
355 |
< |
long t0 = System.nanoTime(); |
284 |
> |
for (int i = 0; i < SIZE; i++) |
285 |
|
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
286 |
< |
assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS); |
287 |
< |
} |
288 |
< |
long t0 = System.nanoTime(); |
289 |
< |
aboutToWait.countDown(); |
286 |
> |
|
287 |
> |
Thread.currentThread().interrupt(); |
288 |
> |
try { |
289 |
> |
q.poll(randomTimeout(), randomTimeUnit()); |
290 |
> |
shouldThrow(); |
291 |
> |
} catch (InterruptedException success) {} |
292 |
> |
assertFalse(Thread.interrupted()); |
293 |
> |
|
294 |
> |
pleaseInterrupt.countDown(); |
295 |
|
try { |
296 |
< |
q.poll(MEDIUM_DELAY_MS, MILLISECONDS); |
296 |
> |
q.poll(LONGER_DELAY_MS, MILLISECONDS); |
297 |
|
shouldThrow(); |
298 |
< |
} catch (InterruptedException success) { |
299 |
< |
assertTrue(millisElapsedSince(t0) < MEDIUM_DELAY_MS); |
366 |
< |
} |
298 |
> |
} catch (InterruptedException success) {} |
299 |
> |
assertFalse(Thread.interrupted()); |
300 |
|
}}); |
301 |
|
|
302 |
< |
aboutToWait.await(); |
303 |
< |
waitForThreadToEnterWaitState(t, SMALL_DELAY_MS); |
302 |
> |
await(pleaseInterrupt); |
303 |
> |
if (randomBoolean()) assertThreadBlocks(t, Thread.State.TIMED_WAITING); |
304 |
|
t.interrupt(); |
305 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
305 |
> |
awaitTermination(t); |
306 |
|
checkEmpty(q); |
307 |
|
} |
308 |
|
|
315 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
316 |
|
public void realRun() throws InterruptedException { |
317 |
|
Thread.currentThread().interrupt(); |
318 |
< |
for (int i = 0; i < SIZE; ++i) { |
319 |
< |
long t0 = System.nanoTime(); |
387 |
< |
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
388 |
< |
assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS); |
389 |
< |
} |
318 |
> |
for (int i = 0; i < SIZE; ++i) |
319 |
> |
assertEquals(i, (int) q.poll(randomTimeout(), randomTimeUnit())); |
320 |
|
try { |
321 |
< |
q.poll(MEDIUM_DELAY_MS, MILLISECONDS); |
321 |
> |
q.poll(randomTimeout(), randomTimeUnit()); |
322 |
|
shouldThrow(); |
323 |
|
} catch (InterruptedException success) {} |
324 |
+ |
assertFalse(Thread.interrupted()); |
325 |
|
}}); |
326 |
|
|
327 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
327 |
> |
awaitTermination(t); |
328 |
|
checkEmpty(q); |
329 |
|
} |
330 |
|
|
375 |
|
} |
376 |
|
|
377 |
|
/** |
447 |
– |
* remove(x) removes x and returns true if present |
448 |
– |
*/ |
449 |
– |
public void testRemoveElement() throws InterruptedException { |
450 |
– |
LinkedTransferQueue q = populatedQueue(SIZE); |
451 |
– |
for (int i = 1; i < SIZE; i += 2) { |
452 |
– |
assertTrue(q.remove(i)); |
453 |
– |
} |
454 |
– |
for (int i = 0; i < SIZE; i += 2) { |
455 |
– |
assertTrue(q.remove(i)); |
456 |
– |
assertFalse(q.remove(i + 1)); |
457 |
– |
} |
458 |
– |
checkEmpty(q); |
459 |
– |
} |
460 |
– |
|
461 |
– |
/** |
378 |
|
* An add following remove(x) succeeds |
379 |
|
*/ |
380 |
|
public void testRemoveElementAndAdd() throws InterruptedException { |
420 |
|
*/ |
421 |
|
public void testContainsAll() { |
422 |
|
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
423 |
< |
LinkedTransferQueue<Integer> p = new LinkedTransferQueue<Integer>(); |
423 |
> |
LinkedTransferQueue<Integer> p = new LinkedTransferQueue<>(); |
424 |
|
for (int i = 0; i < SIZE; ++i) { |
425 |
|
assertTrue(q.containsAll(p)); |
426 |
|
assertFalse(p.containsAll(q)); |
470 |
|
*/ |
471 |
|
public void testToArray() { |
472 |
|
LinkedTransferQueue q = populatedQueue(SIZE); |
473 |
< |
Object[] o = q.toArray(); |
474 |
< |
for (int i = 0; i < o.length; i++) { |
475 |
< |
assertSame(o[i], q.poll()); |
476 |
< |
} |
473 |
> |
Object[] a = q.toArray(); |
474 |
> |
assertSame(Object[].class, a.getClass()); |
475 |
> |
for (Object o : a) |
476 |
> |
assertSame(o, q.poll()); |
477 |
> |
assertTrue(q.isEmpty()); |
478 |
|
} |
479 |
|
|
480 |
|
/** |
485 |
|
Integer[] ints = new Integer[SIZE]; |
486 |
|
Integer[] array = q.toArray(ints); |
487 |
|
assertSame(ints, array); |
488 |
< |
for (int i = 0; i < ints.length; i++) { |
489 |
< |
assertSame(ints[i], q.poll()); |
490 |
< |
} |
574 |
< |
} |
575 |
< |
|
576 |
< |
/** |
577 |
< |
* toArray(null) throws NullPointerException |
578 |
< |
*/ |
579 |
< |
public void testToArray_NullArg() { |
580 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
581 |
< |
try { |
582 |
< |
q.toArray(null); |
583 |
< |
shouldThrow(); |
584 |
< |
} catch (NullPointerException success) {} |
488 |
> |
for (Integer o : ints) |
489 |
> |
assertSame(o, q.poll()); |
490 |
> |
assertTrue(q.isEmpty()); |
491 |
|
} |
492 |
|
|
493 |
|
/** |
507 |
|
public void testIterator() throws InterruptedException { |
508 |
|
LinkedTransferQueue q = populatedQueue(SIZE); |
509 |
|
Iterator it = q.iterator(); |
510 |
< |
int i = 0; |
511 |
< |
while (it.hasNext()) { |
512 |
< |
assertEquals(it.next(), i++); |
513 |
< |
} |
510 |
> |
int i; |
511 |
> |
for (i = 0; it.hasNext(); i++) |
512 |
> |
assertTrue(q.contains(it.next())); |
513 |
> |
assertEquals(i, SIZE); |
514 |
> |
assertIteratorExhausted(it); |
515 |
> |
|
516 |
> |
it = q.iterator(); |
517 |
> |
for (i = 0; it.hasNext(); i++) |
518 |
> |
assertEquals(it.next(), q.take()); |
519 |
|
assertEquals(i, SIZE); |
520 |
+ |
assertIteratorExhausted(it); |
521 |
+ |
} |
522 |
+ |
|
523 |
+ |
/** |
524 |
+ |
* iterator of empty collection has no elements |
525 |
+ |
*/ |
526 |
+ |
public void testEmptyIterator() { |
527 |
+ |
assertIteratorExhausted(new LinkedTransferQueue().iterator()); |
528 |
|
} |
529 |
|
|
530 |
|
/** |
550 |
|
* iterator ordering is FIFO |
551 |
|
*/ |
552 |
|
public void testIteratorOrdering() { |
553 |
< |
final LinkedTransferQueue<Integer> q |
635 |
< |
= new LinkedTransferQueue<Integer>(); |
553 |
> |
final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>(); |
554 |
|
assertEquals(Integer.MAX_VALUE, q.remainingCapacity()); |
555 |
|
q.add(one); |
556 |
|
q.add(two); |
585 |
|
LinkedTransferQueue q = populatedQueue(SIZE); |
586 |
|
String s = q.toString(); |
587 |
|
for (int i = 0; i < SIZE; ++i) { |
588 |
< |
assertTrue(s.indexOf(String.valueOf(i)) >= 0); |
588 |
> |
assertTrue(s.contains(String.valueOf(i))); |
589 |
|
} |
590 |
|
} |
591 |
|
|
594 |
|
*/ |
595 |
|
public void testOfferInExecutor() { |
596 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
597 |
< |
final CountDownLatch threadsStarted = new CountDownLatch(2); |
598 |
< |
ExecutorService executor = Executors.newFixedThreadPool(2); |
599 |
< |
|
682 |
< |
executor.execute(new CheckedRunnable() { |
683 |
< |
public void realRun() throws InterruptedException { |
684 |
< |
threadsStarted.countDown(); |
685 |
< |
threadsStarted.await(); |
686 |
< |
assertTrue(q.offer(one, MEDIUM_DELAY_MS, MILLISECONDS)); |
687 |
< |
}}); |
597 |
> |
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
598 |
> |
final ExecutorService executor = Executors.newFixedThreadPool(2); |
599 |
> |
try (PoolCleaner cleaner = cleaner(executor)) { |
600 |
|
|
601 |
< |
executor.execute(new CheckedRunnable() { |
602 |
< |
public void realRun() throws InterruptedException { |
603 |
< |
threadsStarted.countDown(); |
604 |
< |
threadsStarted.await(); |
605 |
< |
assertSame(one, q.take()); |
606 |
< |
checkEmpty(q); |
607 |
< |
}}); |
601 |
> |
executor.execute(new CheckedRunnable() { |
602 |
> |
public void realRun() throws InterruptedException { |
603 |
> |
threadsStarted.await(); |
604 |
> |
long startTime = System.nanoTime(); |
605 |
> |
assertTrue(q.offer(one, LONG_DELAY_MS, MILLISECONDS)); |
606 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
607 |
> |
}}); |
608 |
|
|
609 |
< |
joinPool(executor); |
609 |
> |
executor.execute(new CheckedRunnable() { |
610 |
> |
public void realRun() throws InterruptedException { |
611 |
> |
threadsStarted.await(); |
612 |
> |
assertSame(one, q.take()); |
613 |
> |
checkEmpty(q); |
614 |
> |
}}); |
615 |
> |
} |
616 |
|
} |
617 |
|
|
618 |
|
/** |
620 |
|
*/ |
621 |
|
public void testPollInExecutor() { |
622 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
623 |
< |
final CountDownLatch threadsStarted = new CountDownLatch(2); |
624 |
< |
ExecutorService executor = Executors.newFixedThreadPool(2); |
625 |
< |
|
708 |
< |
executor.execute(new CheckedRunnable() { |
709 |
< |
public void realRun() throws InterruptedException { |
710 |
< |
assertNull(q.poll()); |
711 |
< |
threadsStarted.countDown(); |
712 |
< |
threadsStarted.await(); |
713 |
< |
assertSame(one, q.poll(SMALL_DELAY_MS, MILLISECONDS)); |
714 |
< |
checkEmpty(q); |
715 |
< |
}}); |
623 |
> |
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
624 |
> |
final ExecutorService executor = Executors.newFixedThreadPool(2); |
625 |
> |
try (PoolCleaner cleaner = cleaner(executor)) { |
626 |
|
|
627 |
< |
executor.execute(new CheckedRunnable() { |
628 |
< |
public void realRun() throws InterruptedException { |
629 |
< |
threadsStarted.countDown(); |
630 |
< |
threadsStarted.await(); |
631 |
< |
q.put(one); |
632 |
< |
}}); |
627 |
> |
executor.execute(new CheckedRunnable() { |
628 |
> |
public void realRun() throws InterruptedException { |
629 |
> |
assertNull(q.poll()); |
630 |
> |
threadsStarted.await(); |
631 |
> |
long startTime = System.nanoTime(); |
632 |
> |
assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
633 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
634 |
> |
checkEmpty(q); |
635 |
> |
}}); |
636 |
|
|
637 |
< |
joinPool(executor); |
637 |
> |
executor.execute(new CheckedRunnable() { |
638 |
> |
public void realRun() throws InterruptedException { |
639 |
> |
threadsStarted.await(); |
640 |
> |
q.put(one); |
641 |
> |
}}); |
642 |
> |
} |
643 |
|
} |
644 |
|
|
645 |
|
/** |
646 |
< |
* A deserialized serialized queue has same elements in same order |
646 |
> |
* A deserialized/reserialized queue has same elements in same order |
647 |
|
*/ |
648 |
|
public void testSerialization() throws Exception { |
649 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
650 |
< |
|
733 |
< |
ByteArrayOutputStream bout = new ByteArrayOutputStream(10000); |
734 |
< |
ObjectOutputStream out |
735 |
< |
= new ObjectOutputStream(new BufferedOutputStream(bout)); |
736 |
< |
out.writeObject(q); |
737 |
< |
out.close(); |
738 |
< |
|
739 |
< |
ByteArrayInputStream bin |
740 |
< |
= new ByteArrayInputStream(bout.toByteArray()); |
741 |
< |
ObjectInputStream in |
742 |
< |
= new ObjectInputStream(new BufferedInputStream(bin)); |
743 |
< |
LinkedTransferQueue r = (LinkedTransferQueue) in.readObject(); |
649 |
> |
Queue x = populatedQueue(SIZE); |
650 |
> |
Queue y = serialClone(x); |
651 |
|
|
652 |
< |
assertEquals(q.size(), r.size()); |
653 |
< |
assertEquals(q.toString(), r.toString()); |
654 |
< |
assertTrue(Arrays.equals(q.toArray(), r.toArray())); |
655 |
< |
while (!q.isEmpty()) { |
656 |
< |
assertEquals(q.remove(), r.remove()); |
652 |
> |
assertNotSame(y, x); |
653 |
> |
assertEquals(x.size(), y.size()); |
654 |
> |
assertEquals(x.toString(), y.toString()); |
655 |
> |
assertTrue(Arrays.equals(x.toArray(), y.toArray())); |
656 |
> |
while (!x.isEmpty()) { |
657 |
> |
assertFalse(y.isEmpty()); |
658 |
> |
assertEquals(x.remove(), y.remove()); |
659 |
|
} |
660 |
< |
} |
752 |
< |
|
753 |
< |
/** |
754 |
< |
* drainTo(null) throws NullPointerException |
755 |
< |
*/ |
756 |
< |
public void testDrainToNull() { |
757 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
758 |
< |
try { |
759 |
< |
q.drainTo(null); |
760 |
< |
shouldThrow(); |
761 |
< |
} catch (NullPointerException success) {} |
762 |
< |
} |
763 |
< |
|
764 |
< |
/** |
765 |
< |
* drainTo(this) throws IllegalArgumentException |
766 |
< |
*/ |
767 |
< |
public void testDrainToSelf() { |
768 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
769 |
< |
try { |
770 |
< |
q.drainTo(q); |
771 |
< |
shouldThrow(); |
772 |
< |
} catch (IllegalArgumentException success) {} |
660 |
> |
assertTrue(y.isEmpty()); |
661 |
|
} |
662 |
|
|
663 |
|
/** |
667 |
|
LinkedTransferQueue q = populatedQueue(SIZE); |
668 |
|
ArrayList l = new ArrayList(); |
669 |
|
q.drainTo(l); |
670 |
< |
assertEquals(q.size(), 0); |
671 |
< |
assertEquals(l.size(), SIZE); |
670 |
> |
assertEquals(0, q.size()); |
671 |
> |
assertEquals(SIZE, l.size()); |
672 |
|
for (int i = 0; i < SIZE; ++i) { |
673 |
< |
assertEquals(l.get(i), i); |
673 |
> |
assertEquals(i, l.get(i)); |
674 |
|
} |
675 |
|
q.add(zero); |
676 |
|
q.add(one); |
679 |
|
assertTrue(q.contains(one)); |
680 |
|
l.clear(); |
681 |
|
q.drainTo(l); |
682 |
< |
assertEquals(q.size(), 0); |
683 |
< |
assertEquals(l.size(), 2); |
682 |
> |
assertEquals(0, q.size()); |
683 |
> |
assertEquals(2, l.size()); |
684 |
|
for (int i = 0; i < 2; ++i) { |
685 |
< |
assertEquals(l.get(i), i); |
685 |
> |
assertEquals(i, l.get(i)); |
686 |
|
} |
687 |
|
} |
688 |
|
|
698 |
|
ArrayList l = new ArrayList(); |
699 |
|
q.drainTo(l); |
700 |
|
assertTrue(l.size() >= SIZE); |
701 |
< |
for (int i = 0; i < SIZE; ++i) { |
702 |
< |
assertEquals(l.get(i), i); |
703 |
< |
} |
816 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
701 |
> |
for (int i = 0; i < SIZE; ++i) |
702 |
> |
assertEquals(i, l.get(i)); |
703 |
> |
awaitTermination(t); |
704 |
|
assertTrue(q.size() + l.size() >= SIZE); |
705 |
|
} |
706 |
|
|
707 |
|
/** |
821 |
– |
* drainTo(null, n) throws NullPointerException |
822 |
– |
*/ |
823 |
– |
public void testDrainToNullN() { |
824 |
– |
LinkedTransferQueue q = populatedQueue(SIZE); |
825 |
– |
try { |
826 |
– |
q.drainTo(null, SIZE); |
827 |
– |
shouldThrow(); |
828 |
– |
} catch (NullPointerException success) {} |
829 |
– |
} |
830 |
– |
|
831 |
– |
/** |
832 |
– |
* drainTo(this, n) throws IllegalArgumentException |
833 |
– |
*/ |
834 |
– |
public void testDrainToSelfN() { |
835 |
– |
LinkedTransferQueue q = populatedQueue(SIZE); |
836 |
– |
try { |
837 |
– |
q.drainTo(q, SIZE); |
838 |
– |
shouldThrow(); |
839 |
– |
} catch (IllegalArgumentException success) {} |
840 |
– |
} |
841 |
– |
|
842 |
– |
/** |
708 |
|
* drainTo(c, n) empties first min(n, size) elements of queue into c |
709 |
|
*/ |
710 |
|
public void testDrainToN() { |
716 |
|
ArrayList l = new ArrayList(); |
717 |
|
q.drainTo(l, i); |
718 |
|
int k = (i < SIZE) ? i : SIZE; |
719 |
< |
assertEquals(l.size(), k); |
720 |
< |
assertEquals(q.size(), SIZE - k); |
721 |
< |
for (int j = 0; j < k; ++j) { |
722 |
< |
assertEquals(l.get(j), j); |
723 |
< |
} |
859 |
< |
while (q.poll() != null) |
860 |
< |
; |
719 |
> |
assertEquals(k, l.size()); |
720 |
> |
assertEquals(SIZE - k, q.size()); |
721 |
> |
for (int j = 0; j < k; ++j) |
722 |
> |
assertEquals(j, l.get(j)); |
723 |
> |
do {} while (q.poll() != null); |
724 |
|
} |
725 |
|
} |
726 |
|
|
730 |
|
*/ |
731 |
|
public void testWaitingConsumer() throws InterruptedException { |
732 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
733 |
< |
assertEquals(q.getWaitingConsumerCount(), 0); |
733 |
> |
assertEquals(0, q.getWaitingConsumerCount()); |
734 |
|
assertFalse(q.hasWaitingConsumer()); |
735 |
|
final CountDownLatch threadStarted = new CountDownLatch(1); |
736 |
|
|
737 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
738 |
|
public void realRun() throws InterruptedException { |
739 |
|
threadStarted.countDown(); |
740 |
+ |
long startTime = System.nanoTime(); |
741 |
|
assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
742 |
< |
assertEquals(q.getWaitingConsumerCount(), 0); |
742 |
> |
assertEquals(0, q.getWaitingConsumerCount()); |
743 |
|
assertFalse(q.hasWaitingConsumer()); |
744 |
+ |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
745 |
|
}}); |
746 |
|
|
747 |
|
threadStarted.await(); |
748 |
< |
waitForThreadToEnterWaitState(t, SMALL_DELAY_MS); |
749 |
< |
assertEquals(q.getWaitingConsumerCount(), 1); |
750 |
< |
assertTrue(q.hasWaitingConsumer()); |
748 |
> |
Callable<Boolean> oneConsumer |
749 |
> |
= new Callable<Boolean>() { public Boolean call() { |
750 |
> |
return q.hasWaitingConsumer() |
751 |
> |
&& q.getWaitingConsumerCount() == 1; }}; |
752 |
> |
waitForThreadToEnterWaitState(t, oneConsumer); |
753 |
|
|
754 |
|
assertTrue(q.offer(one)); |
755 |
< |
assertEquals(q.getWaitingConsumerCount(), 0); |
755 |
> |
assertEquals(0, q.getWaitingConsumerCount()); |
756 |
|
assertFalse(q.hasWaitingConsumer()); |
757 |
|
|
758 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
758 |
> |
awaitTermination(t); |
759 |
|
} |
760 |
|
|
761 |
|
/** |
770 |
|
} |
771 |
|
|
772 |
|
/** |
773 |
< |
* transfer waits until a poll occurs. The transfered element |
774 |
< |
* is returned by this associated poll. |
773 |
> |
* transfer waits until a poll occurs. The transferred element |
774 |
> |
* is returned by the associated poll. |
775 |
|
*/ |
776 |
|
public void testTransfer2() throws InterruptedException { |
777 |
< |
final LinkedTransferQueue<Integer> q |
911 |
< |
= new LinkedTransferQueue<Integer>(); |
777 |
> |
final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>(); |
778 |
|
final CountDownLatch threadStarted = new CountDownLatch(1); |
779 |
|
|
780 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
785 |
|
}}); |
786 |
|
|
787 |
|
threadStarted.await(); |
788 |
< |
waitForThreadToEnterWaitState(t, SMALL_DELAY_MS); |
789 |
< |
assertEquals(1, q.size()); |
788 |
> |
Callable<Boolean> oneElement |
789 |
> |
= new Callable<Boolean>() { public Boolean call() { |
790 |
> |
return !q.isEmpty() && q.size() == 1; }}; |
791 |
> |
waitForThreadToEnterWaitState(t, oneElement); |
792 |
> |
|
793 |
|
assertSame(five, q.poll()); |
794 |
|
checkEmpty(q); |
795 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
795 |
> |
awaitTermination(t); |
796 |
|
} |
797 |
|
|
798 |
|
/** |
799 |
|
* transfer waits until a poll occurs, and then transfers in fifo order |
800 |
|
*/ |
801 |
|
public void testTransfer3() throws InterruptedException { |
802 |
< |
final LinkedTransferQueue<Integer> q |
934 |
< |
= new LinkedTransferQueue<Integer>(); |
802 |
> |
final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>(); |
803 |
|
|
804 |
|
Thread first = newStartedThread(new CheckedRunnable() { |
805 |
|
public void realRun() throws InterruptedException { |
806 |
|
q.transfer(four); |
807 |
< |
assertTrue(!q.contains(four)); |
807 |
> |
assertFalse(q.contains(four)); |
808 |
|
assertEquals(1, q.size()); |
809 |
|
}}); |
810 |
|
|
847 |
|
assertEquals(1, q.size()); |
848 |
|
assertTrue(q.offer(three)); |
849 |
|
assertSame(four, q.poll()); |
850 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
850 |
> |
awaitTermination(t); |
851 |
|
} |
852 |
|
|
853 |
|
/** |
854 |
< |
* transfer waits until a take occurs. The transfered element |
855 |
< |
* is returned by this associated take. |
854 |
> |
* transfer waits until a take occurs. The transferred element |
855 |
> |
* is returned by the associated take. |
856 |
|
*/ |
857 |
|
public void testTransfer5() throws InterruptedException { |
858 |
< |
final LinkedTransferQueue<Integer> q |
991 |
< |
= new LinkedTransferQueue<Integer>(); |
858 |
> |
final LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>(); |
859 |
|
|
860 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
861 |
|
public void realRun() throws InterruptedException { |
869 |
|
assertEquals(1, q.size()); |
870 |
|
assertSame(four, q.take()); |
871 |
|
checkEmpty(q); |
872 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
872 |
> |
awaitTermination(t); |
873 |
|
} |
874 |
|
|
875 |
|
/** |
876 |
|
* tryTransfer(null) throws NullPointerException |
877 |
|
*/ |
878 |
|
public void testTryTransfer1() { |
879 |
+ |
final LinkedTransferQueue q = new LinkedTransferQueue(); |
880 |
|
try { |
1013 |
– |
final LinkedTransferQueue q = new LinkedTransferQueue(); |
881 |
|
q.tryTransfer(null); |
882 |
|
shouldThrow(); |
883 |
|
} catch (NullPointerException success) {} |
911 |
|
assertTrue(q.tryTransfer(hotPotato)); |
912 |
|
}}); |
913 |
|
|
914 |
< |
assertSame(hotPotato, q.poll(MEDIUM_DELAY_MS, MILLISECONDS)); |
914 |
> |
long startTime = System.nanoTime(); |
915 |
> |
assertSame(hotPotato, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
916 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
917 |
|
checkEmpty(q); |
918 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
918 |
> |
awaitTermination(t); |
919 |
|
} |
920 |
|
|
921 |
|
/** |
937 |
|
|
938 |
|
assertSame(q.take(), hotPotato); |
939 |
|
checkEmpty(q); |
940 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
940 |
> |
awaitTermination(t); |
941 |
|
} |
942 |
|
|
943 |
|
/** |
944 |
< |
* tryTransfer waits the amount given, and throws |
1076 |
< |
* InterruptedException when interrupted. |
944 |
> |
* tryTransfer blocks interruptibly if no takers |
945 |
|
*/ |
946 |
|
public void testTryTransfer5() throws InterruptedException { |
947 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
948 |
< |
final CountDownLatch threadStarted = new CountDownLatch(1); |
948 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
949 |
|
assertTrue(q.isEmpty()); |
950 |
|
|
951 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
952 |
|
public void realRun() throws InterruptedException { |
953 |
< |
long t0 = System.nanoTime(); |
1086 |
< |
threadStarted.countDown(); |
953 |
> |
Thread.currentThread().interrupt(); |
954 |
|
try { |
955 |
< |
q.tryTransfer(new Object(), LONG_DELAY_MS, MILLISECONDS); |
955 |
> |
q.tryTransfer(new Object(), randomTimeout(), randomTimeUnit()); |
956 |
|
shouldThrow(); |
957 |
|
} catch (InterruptedException success) {} |
958 |
< |
assertTrue(millisElapsedSince(t0) >= SHORT_DELAY_MS); |
959 |
< |
assertTrue(millisElapsedSince(t0) < MEDIUM_DELAY_MS); |
958 |
> |
assertFalse(Thread.interrupted()); |
959 |
> |
|
960 |
> |
pleaseInterrupt.countDown(); |
961 |
> |
try { |
962 |
> |
q.tryTransfer(new Object(), LONGER_DELAY_MS, MILLISECONDS); |
963 |
> |
shouldThrow(); |
964 |
> |
} catch (InterruptedException success) {} |
965 |
> |
assertFalse(Thread.interrupted()); |
966 |
|
}}); |
967 |
|
|
968 |
< |
threadStarted.await(); |
969 |
< |
while (q.isEmpty()) |
1097 |
< |
Thread.yield(); |
1098 |
< |
Thread.sleep(SHORT_DELAY_MS); |
968 |
> |
await(pleaseInterrupt); |
969 |
> |
if (randomBoolean()) assertThreadBlocks(t, Thread.State.TIMED_WAITING); |
970 |
|
t.interrupt(); |
971 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
971 |
> |
awaitTermination(t); |
972 |
|
checkEmpty(q); |
973 |
|
} |
974 |
|
|
980 |
|
|
981 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
982 |
|
public void realRun() throws InterruptedException { |
983 |
< |
long t0 = System.nanoTime(); |
983 |
> |
long startTime = System.nanoTime(); |
984 |
|
assertFalse(q.tryTransfer(new Object(), |
985 |
< |
SHORT_DELAY_MS, MILLISECONDS)); |
986 |
< |
assertTrue(millisElapsedSince(t0) >= SHORT_DELAY_MS); |
985 |
> |
timeoutMillis(), MILLISECONDS)); |
986 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
987 |
|
checkEmpty(q); |
988 |
|
}}); |
989 |
|
|
990 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
990 |
> |
awaitTermination(t); |
991 |
|
checkEmpty(q); |
992 |
|
} |
993 |
|
|
1001 |
|
|
1002 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
1003 |
|
public void realRun() throws InterruptedException { |
1004 |
< |
assertTrue(q.tryTransfer(five, MEDIUM_DELAY_MS, MILLISECONDS)); |
1004 |
> |
long startTime = System.nanoTime(); |
1005 |
> |
assertTrue(q.tryTransfer(five, LONG_DELAY_MS, MILLISECONDS)); |
1006 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
1007 |
|
checkEmpty(q); |
1008 |
|
}}); |
1009 |
|
|
1013 |
|
assertSame(four, q.poll()); |
1014 |
|
assertSame(five, q.poll()); |
1015 |
|
checkEmpty(q); |
1016 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
1016 |
> |
awaitTermination(t); |
1017 |
|
} |
1018 |
|
|
1019 |
|
/** |
1020 |
< |
* tryTransfer attempts to enqueue into the q and fails returning |
1021 |
< |
* false not enqueueing and the successive poll is null |
1020 |
> |
* tryTransfer attempts to enqueue into the queue and fails |
1021 |
> |
* returning false not enqueueing and the successive poll is null |
1022 |
|
*/ |
1023 |
|
public void testTryTransfer8() throws InterruptedException { |
1024 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
1025 |
|
assertTrue(q.offer(four)); |
1026 |
|
assertEquals(1, q.size()); |
1027 |
< |
long t0 = System.nanoTime(); |
1028 |
< |
assertFalse(q.tryTransfer(five, SHORT_DELAY_MS, MILLISECONDS)); |
1029 |
< |
assertTrue(millisElapsedSince(t0) >= SHORT_DELAY_MS); |
1027 |
> |
long startTime = System.nanoTime(); |
1028 |
> |
assertFalse(q.tryTransfer(five, timeoutMillis(), MILLISECONDS)); |
1029 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
1030 |
|
assertEquals(1, q.size()); |
1031 |
|
assertSame(four, q.poll()); |
1032 |
|
assertNull(q.poll()); |
1034 |
|
} |
1035 |
|
|
1036 |
|
private LinkedTransferQueue<Integer> populatedQueue(int n) { |
1037 |
< |
LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>(); |
1037 |
> |
LinkedTransferQueue<Integer> q = new LinkedTransferQueue<>(); |
1038 |
|
checkEmpty(q); |
1039 |
|
for (int i = 0; i < n; i++) { |
1040 |
|
assertEquals(i, q.size()); |
1044 |
|
assertFalse(q.isEmpty()); |
1045 |
|
return q; |
1046 |
|
} |
1047 |
+ |
|
1048 |
+ |
/** |
1049 |
+ |
* remove(null), contains(null) always return false |
1050 |
+ |
*/ |
1051 |
+ |
public void testNeverContainsNull() { |
1052 |
+ |
Collection<?>[] qs = { |
1053 |
+ |
new LinkedTransferQueue<Object>(), |
1054 |
+ |
populatedQueue(2), |
1055 |
+ |
}; |
1056 |
+ |
|
1057 |
+ |
for (Collection<?> q : qs) { |
1058 |
+ |
assertFalse(q.contains(null)); |
1059 |
+ |
assertFalse(q.remove(null)); |
1060 |
+ |
} |
1061 |
+ |
} |
1062 |
|
} |