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; |
14 |
< |
import java.util.ArrayList; |
8 |
> |
import junit.framework.*; |
9 |
|
import java.util.Arrays; |
10 |
+ |
import java.util.ArrayList; |
11 |
+ |
import java.util.Collection; |
12 |
|
import java.util.Iterator; |
13 |
|
import java.util.List; |
14 |
|
import java.util.NoSuchElementException; |
15 |
< |
import java.util.concurrent.*; |
15 |
> |
import java.util.Queue; |
16 |
> |
import java.util.concurrent.BlockingQueue; |
17 |
> |
import java.util.concurrent.CountDownLatch; |
18 |
> |
import java.util.concurrent.Executors; |
19 |
> |
import java.util.concurrent.ExecutorService; |
20 |
> |
import java.util.concurrent.LinkedTransferQueue; |
21 |
|
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
21 |
– |
import static java.util.concurrent.TimeUnit.NANOSECONDS; |
22 |
– |
import junit.framework.Test; |
23 |
– |
import junit.framework.TestSuite; |
22 |
|
|
23 |
|
@SuppressWarnings({"unchecked", "rawtypes"}) |
24 |
|
public class LinkedTransferQueueTest extends JSR166TestCase { |
38 |
|
new Generic().testSuite()); |
39 |
|
} |
40 |
|
|
43 |
– |
void checkEmpty(LinkedTransferQueue q) throws InterruptedException { |
44 |
– |
assertTrue(q.isEmpty()); |
45 |
– |
assertEquals(0, q.size()); |
46 |
– |
assertNull(q.peek()); |
47 |
– |
assertNull(q.poll()); |
48 |
– |
assertNull(q.poll(0, MILLISECONDS)); |
49 |
– |
assertEquals(q.toString(), "[]"); |
50 |
– |
assertTrue(Arrays.equals(q.toArray(), new Object[0])); |
51 |
– |
assertFalse(q.iterator().hasNext()); |
52 |
– |
try { |
53 |
– |
q.element(); |
54 |
– |
shouldThrow(); |
55 |
– |
} catch (NoSuchElementException success) {} |
56 |
– |
try { |
57 |
– |
q.iterator().next(); |
58 |
– |
shouldThrow(); |
59 |
– |
} catch (NoSuchElementException success) {} |
60 |
– |
try { |
61 |
– |
q.remove(); |
62 |
– |
shouldThrow(); |
63 |
– |
} catch (NoSuchElementException success) {} |
64 |
– |
} |
65 |
– |
|
41 |
|
/** |
42 |
|
* Constructor builds new queue with size being zero and empty |
43 |
|
* being true |
63 |
|
* NullPointerException |
64 |
|
*/ |
65 |
|
public void testConstructor3() { |
66 |
+ |
Collection<Integer> elements = Arrays.asList(new Integer[SIZE]); |
67 |
|
try { |
68 |
< |
Integer[] ints = new Integer[SIZE]; |
93 |
< |
new LinkedTransferQueue(Arrays.asList(ints)); |
68 |
> |
new LinkedTransferQueue(elements); |
69 |
|
shouldThrow(); |
70 |
|
} catch (NullPointerException success) {} |
71 |
|
} |
75 |
|
* throws NullPointerException |
76 |
|
*/ |
77 |
|
public void testConstructor4() { |
78 |
+ |
Integer[] ints = new Integer[SIZE]; |
79 |
+ |
for (int i = 0; i < SIZE-1; ++i) |
80 |
+ |
ints[i] = i; |
81 |
+ |
Collection<Integer> elements = Arrays.asList(ints); |
82 |
|
try { |
83 |
< |
Integer[] ints = new Integer[SIZE]; |
105 |
< |
for (int i = 0; i < SIZE - 1; ++i) { |
106 |
< |
ints[i] = i; |
107 |
< |
} |
108 |
< |
new LinkedTransferQueue(Arrays.asList(ints)); |
83 |
> |
new LinkedTransferQueue(elements); |
84 |
|
shouldThrow(); |
85 |
|
} catch (NullPointerException success) {} |
86 |
|
} |
127 |
|
} |
128 |
|
|
129 |
|
/** |
155 |
– |
* offer(null) throws NullPointerException |
156 |
– |
*/ |
157 |
– |
public void testOfferNull() { |
158 |
– |
try { |
159 |
– |
LinkedTransferQueue q = new LinkedTransferQueue(); |
160 |
– |
q.offer(null); |
161 |
– |
shouldThrow(); |
162 |
– |
} catch (NullPointerException success) {} |
163 |
– |
} |
164 |
– |
|
165 |
– |
/** |
166 |
– |
* add(null) throws NullPointerException |
167 |
– |
*/ |
168 |
– |
public void testAddNull() { |
169 |
– |
try { |
170 |
– |
LinkedTransferQueue q = new LinkedTransferQueue(); |
171 |
– |
q.add(null); |
172 |
– |
shouldThrow(); |
173 |
– |
} catch (NullPointerException success) {} |
174 |
– |
} |
175 |
– |
|
176 |
– |
/** |
177 |
– |
* addAll(null) throws NullPointerException |
178 |
– |
*/ |
179 |
– |
public void testAddAll1() { |
180 |
– |
try { |
181 |
– |
LinkedTransferQueue q = new LinkedTransferQueue(); |
182 |
– |
q.addAll(null); |
183 |
– |
shouldThrow(); |
184 |
– |
} catch (NullPointerException success) {} |
185 |
– |
} |
186 |
– |
|
187 |
– |
/** |
130 |
|
* addAll(this) throws IllegalArgumentException |
131 |
|
*/ |
132 |
|
public void testAddAllSelf() { |
138 |
|
} |
139 |
|
|
140 |
|
/** |
199 |
– |
* addAll of a collection with null elements throws NullPointerException |
200 |
– |
*/ |
201 |
– |
public void testAddAll2() { |
202 |
– |
try { |
203 |
– |
LinkedTransferQueue q = new LinkedTransferQueue(); |
204 |
– |
Integer[] ints = new Integer[SIZE]; |
205 |
– |
q.addAll(Arrays.asList(ints)); |
206 |
– |
shouldThrow(); |
207 |
– |
} catch (NullPointerException success) {} |
208 |
– |
} |
209 |
– |
|
210 |
– |
/** |
141 |
|
* addAll of a collection with any null elements throws |
142 |
|
* NullPointerException after possibly adding some elements |
143 |
|
*/ |
171 |
|
} |
172 |
|
|
173 |
|
/** |
244 |
– |
* put(null) throws NullPointerException |
245 |
– |
*/ |
246 |
– |
public void testPutNull() throws InterruptedException { |
247 |
– |
try { |
248 |
– |
LinkedTransferQueue q = new LinkedTransferQueue(); |
249 |
– |
q.put(null); |
250 |
– |
shouldThrow(); |
251 |
– |
} catch (NullPointerException success) {} |
252 |
– |
} |
253 |
– |
|
254 |
– |
/** |
174 |
|
* all elements successfully put are contained |
175 |
|
*/ |
176 |
|
public void testPut() { |
177 |
|
LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>(); |
178 |
|
for (int i = 0; i < SIZE; ++i) { |
179 |
< |
assertEquals(q.size(), i); |
179 |
> |
assertEquals(i, q.size()); |
180 |
|
q.put(i); |
181 |
|
assertTrue(q.contains(i)); |
182 |
|
} |
196 |
|
* take removes existing elements until empty, then blocks interruptibly |
197 |
|
*/ |
198 |
|
public void testBlockingTake() throws InterruptedException { |
199 |
< |
final LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
200 |
< |
Thread t = new Thread(new CheckedRunnable() { |
199 |
> |
final BlockingQueue q = populatedQueue(SIZE); |
200 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
201 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
202 |
|
public void realRun() throws InterruptedException { |
203 |
|
for (int i = 0; i < SIZE; ++i) { |
204 |
< |
assertEquals(i, (int) q.take()); |
204 |
> |
assertEquals(i, q.take()); |
205 |
|
} |
206 |
+ |
|
207 |
+ |
Thread.currentThread().interrupt(); |
208 |
|
try { |
209 |
|
q.take(); |
210 |
|
shouldThrow(); |
211 |
|
} catch (InterruptedException success) {} |
212 |
+ |
assertFalse(Thread.interrupted()); |
213 |
+ |
|
214 |
+ |
pleaseInterrupt.countDown(); |
215 |
+ |
try { |
216 |
+ |
q.take(); |
217 |
+ |
shouldThrow(); |
218 |
+ |
} catch (InterruptedException success) {} |
219 |
+ |
assertFalse(Thread.interrupted()); |
220 |
|
}}); |
221 |
|
|
222 |
< |
t.start(); |
223 |
< |
Thread.sleep(SHORT_DELAY_MS); |
222 |
> |
await(pleaseInterrupt); |
223 |
> |
assertThreadStaysAlive(t); |
224 |
|
t.interrupt(); |
225 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
296 |
< |
checkEmpty(q); |
225 |
> |
awaitTermination(t); |
226 |
|
} |
227 |
|
|
228 |
|
/** |
238 |
|
} |
239 |
|
|
240 |
|
/** |
241 |
< |
* timed pool with zero timeout succeeds when non-empty, else times out |
241 |
> |
* timed poll with zero timeout succeeds when non-empty, else times out |
242 |
|
*/ |
243 |
|
public void testTimedPoll0() throws InterruptedException { |
244 |
|
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
250 |
|
} |
251 |
|
|
252 |
|
/** |
253 |
< |
* timed pool with nonzero timeout succeeds when non-empty, else times out |
253 |
> |
* timed poll with nonzero timeout succeeds when non-empty, else times out |
254 |
|
*/ |
255 |
|
public void testTimedPoll() throws InterruptedException { |
256 |
|
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
257 |
|
for (int i = 0; i < SIZE; ++i) { |
258 |
< |
long t0 = System.nanoTime(); |
258 |
> |
long startTime = System.nanoTime(); |
259 |
|
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
260 |
< |
assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS); |
260 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
261 |
|
} |
262 |
< |
assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
262 |
> |
long startTime = System.nanoTime(); |
263 |
> |
assertNull(q.poll(timeoutMillis(), MILLISECONDS)); |
264 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
265 |
|
checkEmpty(q); |
266 |
|
} |
267 |
|
|
270 |
|
* returning timeout status |
271 |
|
*/ |
272 |
|
public void testInterruptedTimedPoll() throws InterruptedException { |
273 |
< |
final LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
273 |
> |
final BlockingQueue<Integer> q = populatedQueue(SIZE); |
274 |
> |
final CountDownLatch aboutToWait = new CountDownLatch(1); |
275 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
276 |
|
public void realRun() throws InterruptedException { |
277 |
|
for (int i = 0; i < SIZE; ++i) { |
279 |
|
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
280 |
|
assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS); |
281 |
|
} |
282 |
+ |
long t0 = System.nanoTime(); |
283 |
+ |
aboutToWait.countDown(); |
284 |
|
try { |
285 |
< |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
285 |
> |
q.poll(MEDIUM_DELAY_MS, MILLISECONDS); |
286 |
|
shouldThrow(); |
287 |
< |
} catch (InterruptedException success) {} |
287 |
> |
} catch (InterruptedException success) { |
288 |
> |
assertTrue(millisElapsedSince(t0) < MEDIUM_DELAY_MS); |
289 |
> |
} |
290 |
|
}}); |
291 |
|
|
292 |
< |
Thread.sleep(SMALL_DELAY_MS); |
292 |
> |
aboutToWait.await(); |
293 |
> |
waitForThreadToEnterWaitState(t, SMALL_DELAY_MS); |
294 |
|
t.interrupt(); |
295 |
|
awaitTermination(t, MEDIUM_DELAY_MS); |
296 |
|
checkEmpty(q); |
297 |
|
} |
298 |
|
|
299 |
|
/** |
300 |
+ |
* timed poll after thread interrupted throws InterruptedException |
301 |
+ |
* instead of returning timeout status |
302 |
+ |
*/ |
303 |
+ |
public void testTimedPollAfterInterrupt() throws InterruptedException { |
304 |
+ |
final BlockingQueue<Integer> q = populatedQueue(SIZE); |
305 |
+ |
Thread t = newStartedThread(new CheckedRunnable() { |
306 |
+ |
public void realRun() throws InterruptedException { |
307 |
+ |
Thread.currentThread().interrupt(); |
308 |
+ |
for (int i = 0; i < SIZE; ++i) { |
309 |
+ |
long t0 = System.nanoTime(); |
310 |
+ |
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
311 |
+ |
assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS); |
312 |
+ |
} |
313 |
+ |
try { |
314 |
+ |
q.poll(MEDIUM_DELAY_MS, MILLISECONDS); |
315 |
+ |
shouldThrow(); |
316 |
+ |
} catch (InterruptedException success) {} |
317 |
+ |
}}); |
318 |
+ |
|
319 |
+ |
awaitTermination(t, MEDIUM_DELAY_MS); |
320 |
+ |
checkEmpty(q); |
321 |
+ |
} |
322 |
+ |
|
323 |
+ |
/** |
324 |
|
* peek returns next element, or null if empty |
325 |
|
*/ |
326 |
|
public void testPeek() throws InterruptedException { |
367 |
|
} |
368 |
|
|
369 |
|
/** |
409 |
– |
* remove(x) removes x and returns true if present |
410 |
– |
*/ |
411 |
– |
public void testRemoveElement() throws InterruptedException { |
412 |
– |
LinkedTransferQueue q = populatedQueue(SIZE); |
413 |
– |
for (int i = 1; i < SIZE; i += 2) { |
414 |
– |
assertTrue(q.remove(i)); |
415 |
– |
} |
416 |
– |
for (int i = 0; i < SIZE; i += 2) { |
417 |
– |
assertTrue(q.remove(i)); |
418 |
– |
assertFalse(q.remove(i + 1)); |
419 |
– |
} |
420 |
– |
checkEmpty(q); |
421 |
– |
} |
422 |
– |
|
423 |
– |
/** |
370 |
|
* An add following remove(x) succeeds |
371 |
|
*/ |
372 |
|
public void testRemoveElementAndAdd() throws InterruptedException { |
458 |
|
} |
459 |
|
|
460 |
|
/** |
461 |
< |
* toArray() contains all elements |
461 |
> |
* toArray() contains all elements in FIFO order |
462 |
|
*/ |
463 |
< |
public void testToArray() throws InterruptedException { |
463 |
> |
public void testToArray() { |
464 |
|
LinkedTransferQueue q = populatedQueue(SIZE); |
465 |
|
Object[] o = q.toArray(); |
466 |
|
for (int i = 0; i < o.length; i++) { |
467 |
< |
assertEquals(o[i], q.take()); |
467 |
> |
assertSame(o[i], q.poll()); |
468 |
|
} |
469 |
|
} |
470 |
|
|
471 |
|
/** |
472 |
< |
* toArray(a) contains all elements |
472 |
> |
* toArray(a) contains all elements in FIFO order |
473 |
|
*/ |
474 |
< |
public void testToArray2() throws InterruptedException { |
474 |
> |
public void testToArray2() { |
475 |
|
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
476 |
|
Integer[] ints = new Integer[SIZE]; |
477 |
< |
ints = q.toArray(ints); |
477 |
> |
Integer[] array = q.toArray(ints); |
478 |
> |
assertSame(ints, array); |
479 |
|
for (int i = 0; i < ints.length; i++) { |
480 |
< |
assertEquals(ints[i], q.take()); |
480 |
> |
assertSame(ints[i], q.poll()); |
481 |
|
} |
482 |
|
} |
483 |
|
|
484 |
|
/** |
485 |
< |
* toArray(null) throws NullPointerException |
539 |
< |
*/ |
540 |
< |
public void testToArray_BadArg() { |
541 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
542 |
< |
try { |
543 |
< |
Object o[] = q.toArray(null); |
544 |
< |
shouldThrow(); |
545 |
< |
} catch (NullPointerException success) {} |
546 |
< |
} |
547 |
< |
|
548 |
< |
/** |
549 |
< |
* toArray(incompatible array type) throws CCE |
485 |
> |
* toArray(incompatible array type) throws ArrayStoreException |
486 |
|
*/ |
487 |
|
public void testToArray1_BadArg() { |
488 |
|
LinkedTransferQueue q = populatedQueue(SIZE); |
489 |
|
try { |
490 |
< |
Object o[] = q.toArray(new String[10]); |
490 |
> |
q.toArray(new String[10]); |
491 |
|
shouldThrow(); |
492 |
|
} catch (ArrayStoreException success) {} |
493 |
|
} |
564 |
|
LinkedTransferQueue q = populatedQueue(SIZE); |
565 |
|
String s = q.toString(); |
566 |
|
for (int i = 0; i < SIZE; ++i) { |
567 |
< |
assertTrue(s.indexOf(String.valueOf(i)) >= 0); |
567 |
> |
assertTrue(s.contains(String.valueOf(i))); |
568 |
|
} |
569 |
|
} |
570 |
|
|
573 |
|
*/ |
574 |
|
public void testOfferInExecutor() { |
575 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
576 |
< |
q.add(one); |
641 |
< |
q.add(two); |
576 |
> |
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
577 |
|
ExecutorService executor = Executors.newFixedThreadPool(2); |
578 |
|
|
579 |
|
executor.execute(new CheckedRunnable() { |
580 |
< |
public void realRun() { |
581 |
< |
assertTrue(q.offer(three, MEDIUM_DELAY_MS, MILLISECONDS)); |
580 |
> |
public void realRun() throws InterruptedException { |
581 |
> |
threadsStarted.await(); |
582 |
> |
assertTrue(q.offer(one, LONG_DELAY_MS, MILLISECONDS)); |
583 |
|
}}); |
584 |
|
|
585 |
|
executor.execute(new CheckedRunnable() { |
586 |
|
public void realRun() throws InterruptedException { |
587 |
< |
Thread.sleep(SMALL_DELAY_MS); |
587 |
> |
threadsStarted.await(); |
588 |
|
assertSame(one, q.take()); |
589 |
+ |
checkEmpty(q); |
590 |
|
}}); |
591 |
|
|
592 |
|
joinPool(executor); |
597 |
|
*/ |
598 |
|
public void testPollInExecutor() { |
599 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
600 |
+ |
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
601 |
|
ExecutorService executor = Executors.newFixedThreadPool(2); |
602 |
|
|
603 |
|
executor.execute(new CheckedRunnable() { |
604 |
|
public void realRun() throws InterruptedException { |
605 |
|
assertNull(q.poll()); |
606 |
< |
assertSame(one, q.poll(MEDIUM_DELAY_MS, MILLISECONDS)); |
607 |
< |
assertTrue(q.isEmpty()); |
606 |
> |
threadsStarted.await(); |
607 |
> |
assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
608 |
> |
checkEmpty(q); |
609 |
|
}}); |
610 |
|
|
611 |
|
executor.execute(new CheckedRunnable() { |
612 |
|
public void realRun() throws InterruptedException { |
613 |
< |
Thread.sleep(SMALL_DELAY_MS); |
613 |
> |
threadsStarted.await(); |
614 |
|
q.put(one); |
615 |
|
}}); |
616 |
|
|
621 |
|
* A deserialized serialized queue has same elements in same order |
622 |
|
*/ |
623 |
|
public void testSerialization() throws Exception { |
624 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
624 |
> |
Queue x = populatedQueue(SIZE); |
625 |
> |
Queue y = serialClone(x); |
626 |
|
|
627 |
< |
ByteArrayOutputStream bout = new ByteArrayOutputStream(10000); |
628 |
< |
ObjectOutputStream out |
629 |
< |
= new ObjectOutputStream(new BufferedOutputStream(bout)); |
630 |
< |
out.writeObject(q); |
631 |
< |
out.close(); |
632 |
< |
|
633 |
< |
ByteArrayInputStream bin |
694 |
< |
= new ByteArrayInputStream(bout.toByteArray()); |
695 |
< |
ObjectInputStream in |
696 |
< |
= new ObjectInputStream(new BufferedInputStream(bin)); |
697 |
< |
LinkedTransferQueue r = (LinkedTransferQueue) in.readObject(); |
698 |
< |
|
699 |
< |
assertEquals(q.size(), r.size()); |
700 |
< |
while (!q.isEmpty()) { |
701 |
< |
assertEquals(q.remove(), r.remove()); |
627 |
> |
assertNotSame(y, x); |
628 |
> |
assertEquals(x.size(), y.size()); |
629 |
> |
assertEquals(x.toString(), y.toString()); |
630 |
> |
assertTrue(Arrays.equals(x.toArray(), y.toArray())); |
631 |
> |
while (!x.isEmpty()) { |
632 |
> |
assertFalse(y.isEmpty()); |
633 |
> |
assertEquals(x.remove(), y.remove()); |
634 |
|
} |
635 |
< |
} |
704 |
< |
|
705 |
< |
/** |
706 |
< |
* drainTo(null) throws NullPointerException |
707 |
< |
*/ |
708 |
< |
public void testDrainToNull() { |
709 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
710 |
< |
try { |
711 |
< |
q.drainTo(null); |
712 |
< |
shouldThrow(); |
713 |
< |
} catch (NullPointerException success) {} |
714 |
< |
} |
715 |
< |
|
716 |
< |
/** |
717 |
< |
* drainTo(this) throws IllegalArgumentException |
718 |
< |
*/ |
719 |
< |
public void testDrainToSelf() { |
720 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
721 |
< |
try { |
722 |
< |
q.drainTo(q); |
723 |
< |
shouldThrow(); |
724 |
< |
} catch (IllegalArgumentException success) {} |
635 |
> |
assertTrue(y.isEmpty()); |
636 |
|
} |
637 |
|
|
638 |
|
/** |
642 |
|
LinkedTransferQueue q = populatedQueue(SIZE); |
643 |
|
ArrayList l = new ArrayList(); |
644 |
|
q.drainTo(l); |
645 |
< |
assertEquals(q.size(), 0); |
646 |
< |
assertEquals(l.size(), SIZE); |
645 |
> |
assertEquals(0, q.size()); |
646 |
> |
assertEquals(SIZE, l.size()); |
647 |
|
for (int i = 0; i < SIZE; ++i) { |
648 |
< |
assertEquals(l.get(i), i); |
648 |
> |
assertEquals(i, l.get(i)); |
649 |
|
} |
650 |
|
q.add(zero); |
651 |
|
q.add(one); |
654 |
|
assertTrue(q.contains(one)); |
655 |
|
l.clear(); |
656 |
|
q.drainTo(l); |
657 |
< |
assertEquals(q.size(), 0); |
658 |
< |
assertEquals(l.size(), 2); |
657 |
> |
assertEquals(0, q.size()); |
658 |
> |
assertEquals(2, l.size()); |
659 |
|
for (int i = 0; i < 2; ++i) { |
660 |
< |
assertEquals(l.get(i), i); |
660 |
> |
assertEquals(i, l.get(i)); |
661 |
|
} |
662 |
|
} |
663 |
|
|
673 |
|
ArrayList l = new ArrayList(); |
674 |
|
q.drainTo(l); |
675 |
|
assertTrue(l.size() >= SIZE); |
676 |
< |
for (int i = 0; i < SIZE; ++i) { |
677 |
< |
assertEquals(l.get(i), i); |
767 |
< |
} |
676 |
> |
for (int i = 0; i < SIZE; ++i) |
677 |
> |
assertEquals(i, l.get(i)); |
678 |
|
awaitTermination(t, MEDIUM_DELAY_MS); |
679 |
|
assertTrue(q.size() + l.size() >= SIZE); |
680 |
|
} |
681 |
|
|
682 |
|
/** |
773 |
– |
* drainTo(null, n) throws NullPointerException |
774 |
– |
*/ |
775 |
– |
public void testDrainToNullN() { |
776 |
– |
LinkedTransferQueue q = populatedQueue(SIZE); |
777 |
– |
try { |
778 |
– |
q.drainTo(null, SIZE); |
779 |
– |
shouldThrow(); |
780 |
– |
} catch (NullPointerException success) {} |
781 |
– |
} |
782 |
– |
|
783 |
– |
/** |
784 |
– |
* drainTo(this, n) throws IllegalArgumentException |
785 |
– |
*/ |
786 |
– |
public void testDrainToSelfN() { |
787 |
– |
LinkedTransferQueue q = populatedQueue(SIZE); |
788 |
– |
try { |
789 |
– |
q.drainTo(q, SIZE); |
790 |
– |
shouldThrow(); |
791 |
– |
} catch (IllegalArgumentException success) {} |
792 |
– |
} |
793 |
– |
|
794 |
– |
/** |
683 |
|
* drainTo(c, n) empties first min(n, size) elements of queue into c |
684 |
|
*/ |
685 |
|
public void testDrainToN() { |
691 |
|
ArrayList l = new ArrayList(); |
692 |
|
q.drainTo(l, i); |
693 |
|
int k = (i < SIZE) ? i : SIZE; |
694 |
< |
assertEquals(l.size(), k); |
695 |
< |
assertEquals(q.size(), SIZE - k); |
696 |
< |
for (int j = 0; j < k; ++j) { |
697 |
< |
assertEquals(l.get(j), j); |
810 |
< |
} |
694 |
> |
assertEquals(k, l.size()); |
695 |
> |
assertEquals(SIZE - k, q.size()); |
696 |
> |
for (int j = 0; j < k; ++j) |
697 |
> |
assertEquals(j, l.get(j)); |
698 |
|
while (q.poll() != null) |
699 |
|
; |
700 |
|
} |
706 |
|
*/ |
707 |
|
public void testWaitingConsumer() throws InterruptedException { |
708 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
709 |
< |
assertEquals(q.getWaitingConsumerCount(), 0); |
709 |
> |
assertEquals(0, q.getWaitingConsumerCount()); |
710 |
|
assertFalse(q.hasWaitingConsumer()); |
711 |
+ |
final CountDownLatch threadStarted = new CountDownLatch(1); |
712 |
|
|
713 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
714 |
|
public void realRun() throws InterruptedException { |
715 |
< |
Thread.sleep(SMALL_DELAY_MS); |
716 |
< |
assertTrue(q.hasWaitingConsumer()); |
717 |
< |
assertEquals(q.getWaitingConsumerCount(), 1); |
830 |
< |
assertTrue(q.offer(one)); |
715 |
> |
threadStarted.countDown(); |
716 |
> |
assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
717 |
> |
assertEquals(0, q.getWaitingConsumerCount()); |
718 |
|
assertFalse(q.hasWaitingConsumer()); |
832 |
– |
assertEquals(q.getWaitingConsumerCount(), 0); |
719 |
|
}}); |
720 |
|
|
721 |
< |
assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
722 |
< |
assertEquals(q.getWaitingConsumerCount(), 0); |
721 |
> |
threadStarted.await(); |
722 |
> |
waitForThreadToEnterWaitState(t, SMALL_DELAY_MS); |
723 |
> |
assertEquals(1, q.getWaitingConsumerCount()); |
724 |
> |
assertTrue(q.hasWaitingConsumer()); |
725 |
> |
|
726 |
> |
assertTrue(q.offer(one)); |
727 |
> |
assertEquals(0, q.getWaitingConsumerCount()); |
728 |
|
assertFalse(q.hasWaitingConsumer()); |
729 |
+ |
|
730 |
|
awaitTermination(t, MEDIUM_DELAY_MS); |
731 |
|
} |
732 |
|
|
748 |
|
public void testTransfer2() throws InterruptedException { |
749 |
|
final LinkedTransferQueue<Integer> q |
750 |
|
= new LinkedTransferQueue<Integer>(); |
751 |
+ |
final CountDownLatch threadStarted = new CountDownLatch(1); |
752 |
|
|
753 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
754 |
|
public void realRun() throws InterruptedException { |
755 |
< |
q.transfer(SIZE); |
756 |
< |
assertTrue(q.isEmpty()); |
755 |
> |
threadStarted.countDown(); |
756 |
> |
q.transfer(five); |
757 |
> |
checkEmpty(q); |
758 |
|
}}); |
759 |
|
|
760 |
< |
Thread.sleep(SHORT_DELAY_MS); |
760 |
> |
threadStarted.await(); |
761 |
> |
waitForThreadToEnterWaitState(t, SMALL_DELAY_MS); |
762 |
|
assertEquals(1, q.size()); |
763 |
< |
assertEquals(SIZE, (int) q.poll()); |
764 |
< |
assertTrue(q.isEmpty()); |
763 |
> |
assertSame(five, q.poll()); |
764 |
> |
checkEmpty(q); |
765 |
|
awaitTermination(t, MEDIUM_DELAY_MS); |
766 |
|
} |
767 |
|
|
774 |
|
|
775 |
|
Thread first = newStartedThread(new CheckedRunnable() { |
776 |
|
public void realRun() throws InterruptedException { |
777 |
< |
Integer i = SIZE + 1; |
778 |
< |
q.transfer(i); |
884 |
< |
assertTrue(!q.contains(i)); |
777 |
> |
q.transfer(four); |
778 |
> |
assertTrue(!q.contains(four)); |
779 |
|
assertEquals(1, q.size()); |
780 |
|
}}); |
781 |
|
|
782 |
|
Thread interruptedThread = newStartedThread( |
783 |
|
new CheckedInterruptedRunnable() { |
784 |
|
public void realRun() throws InterruptedException { |
785 |
< |
while (q.size() == 0) |
785 |
> |
while (q.isEmpty()) |
786 |
|
Thread.yield(); |
787 |
< |
q.transfer(SIZE); |
787 |
> |
q.transfer(five); |
788 |
|
}}); |
789 |
|
|
790 |
|
while (q.size() < 2) |
791 |
|
Thread.yield(); |
792 |
|
assertEquals(2, q.size()); |
793 |
< |
assertEquals(SIZE + 1, (int) q.poll()); |
793 |
> |
assertSame(four, q.poll()); |
794 |
|
first.join(); |
795 |
|
assertEquals(1, q.size()); |
796 |
|
interruptedThread.interrupt(); |
797 |
|
interruptedThread.join(); |
798 |
< |
assertEquals(0, q.size()); |
905 |
< |
assertTrue(q.isEmpty()); |
798 |
> |
checkEmpty(q); |
799 |
|
} |
800 |
|
|
801 |
|
/** |
812 |
|
assertSame(three, q.poll()); |
813 |
|
}}); |
814 |
|
|
815 |
< |
Thread.sleep(SHORT_DELAY_MS); |
815 |
> |
while (q.isEmpty()) |
816 |
> |
Thread.yield(); |
817 |
> |
assertFalse(q.isEmpty()); |
818 |
> |
assertEquals(1, q.size()); |
819 |
|
assertTrue(q.offer(three)); |
820 |
|
assertSame(four, q.poll()); |
821 |
|
awaitTermination(t, MEDIUM_DELAY_MS); |
831 |
|
|
832 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
833 |
|
public void realRun() throws InterruptedException { |
834 |
< |
q.transfer(SIZE); |
834 |
> |
q.transfer(four); |
835 |
|
checkEmpty(q); |
836 |
|
}}); |
837 |
|
|
838 |
< |
Thread.sleep(SHORT_DELAY_MS); |
839 |
< |
assertEquals(SIZE, (int) q.take()); |
838 |
> |
while (q.isEmpty()) |
839 |
> |
Thread.yield(); |
840 |
> |
assertFalse(q.isEmpty()); |
841 |
> |
assertEquals(1, q.size()); |
842 |
> |
assertSame(four, q.take()); |
843 |
|
checkEmpty(q); |
844 |
|
awaitTermination(t, MEDIUM_DELAY_MS); |
845 |
|
} |
879 |
|
while (! q.hasWaitingConsumer()) |
880 |
|
Thread.yield(); |
881 |
|
assertTrue(q.hasWaitingConsumer()); |
882 |
< |
assertTrue(q.isEmpty()); |
984 |
< |
assertEquals(q.size(), 0); |
882 |
> |
checkEmpty(q); |
883 |
|
assertTrue(q.tryTransfer(hotPotato)); |
884 |
|
}}); |
885 |
|
|
901 |
|
while (! q.hasWaitingConsumer()) |
902 |
|
Thread.yield(); |
903 |
|
assertTrue(q.hasWaitingConsumer()); |
904 |
< |
assertTrue(q.isEmpty()); |
1007 |
< |
assertEquals(q.size(), 0); |
904 |
> |
checkEmpty(q); |
905 |
|
assertTrue(q.tryTransfer(hotPotato)); |
906 |
|
}}); |
907 |
|
|
911 |
|
} |
912 |
|
|
913 |
|
/** |
914 |
< |
* tryTransfer waits the amount given if interrupted, and |
1018 |
< |
* throws interrupted exception |
914 |
> |
* tryTransfer blocks interruptibly if no takers |
915 |
|
*/ |
916 |
|
public void testTryTransfer5() throws InterruptedException { |
917 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
918 |
+ |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
919 |
+ |
assertTrue(q.isEmpty()); |
920 |
|
|
921 |
< |
Thread toInterrupt = newStartedThread(new CheckedInterruptedRunnable() { |
921 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
922 |
|
public void realRun() throws InterruptedException { |
923 |
< |
q.tryTransfer(new Object(), LONG_DELAY_MS, MILLISECONDS); |
923 |
> |
Thread.currentThread().interrupt(); |
924 |
> |
try { |
925 |
> |
q.tryTransfer(new Object(), LONG_DELAY_MS, MILLISECONDS); |
926 |
> |
shouldThrow(); |
927 |
> |
} catch (InterruptedException success) {} |
928 |
> |
assertFalse(Thread.interrupted()); |
929 |
> |
|
930 |
> |
pleaseInterrupt.countDown(); |
931 |
> |
try { |
932 |
> |
q.tryTransfer(new Object(), LONG_DELAY_MS, MILLISECONDS); |
933 |
> |
shouldThrow(); |
934 |
> |
} catch (InterruptedException success) {} |
935 |
> |
assertFalse(Thread.interrupted()); |
936 |
|
}}); |
937 |
|
|
938 |
< |
Thread.sleep(SMALL_DELAY_MS); |
939 |
< |
toInterrupt.interrupt(); |
940 |
< |
toInterrupt.join(); |
938 |
> |
await(pleaseInterrupt); |
939 |
> |
assertThreadStaysAlive(t); |
940 |
> |
t.interrupt(); |
941 |
> |
awaitTermination(t); |
942 |
> |
checkEmpty(q); |
943 |
|
} |
944 |
|
|
945 |
|
/** |
946 |
< |
* tryTransfer gives up after the timeout and return false |
946 |
> |
* tryTransfer gives up after the timeout and returns false |
947 |
|
*/ |
948 |
|
public void testTryTransfer6() throws InterruptedException { |
949 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
952 |
|
public void realRun() throws InterruptedException { |
953 |
|
long t0 = System.nanoTime(); |
954 |
|
assertFalse(q.tryTransfer(new Object(), |
955 |
< |
SHORT_DELAY_MS, MILLISECONDS)); |
956 |
< |
assertTrue(millisElapsedSince(t0) >= SHORT_DELAY_MS); |
955 |
> |
timeoutMillis(), MILLISECONDS)); |
956 |
> |
assertTrue(millisElapsedSince(t0) >= timeoutMillis()); |
957 |
> |
checkEmpty(q); |
958 |
|
}}); |
959 |
|
|
960 |
< |
checkEmpty(q); |
1048 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
960 |
> |
awaitTermination(t); |
961 |
|
checkEmpty(q); |
962 |
|
} |
963 |
|
|
972 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
973 |
|
public void realRun() throws InterruptedException { |
974 |
|
assertTrue(q.tryTransfer(five, MEDIUM_DELAY_MS, MILLISECONDS)); |
975 |
< |
assertTrue(q.isEmpty()); |
975 |
> |
checkEmpty(q); |
976 |
|
}}); |
977 |
|
|
978 |
< |
Thread.sleep(SHORT_DELAY_MS); |
978 |
> |
while (q.size() != 2) |
979 |
> |
Thread.yield(); |
980 |
|
assertEquals(2, q.size()); |
981 |
|
assertSame(four, q.poll()); |
982 |
|
assertSame(five, q.poll()); |
985 |
|
} |
986 |
|
|
987 |
|
/** |
988 |
< |
* tryTransfer attempts to enqueue into the q and fails returning |
989 |
< |
* false not enqueueing and the successive poll is null |
988 |
> |
* tryTransfer attempts to enqueue into the queue and fails |
989 |
> |
* returning false not enqueueing and the successive poll is null |
990 |
|
*/ |
991 |
|
public void testTryTransfer8() throws InterruptedException { |
992 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
993 |
|
assertTrue(q.offer(four)); |
994 |
|
assertEquals(1, q.size()); |
995 |
< |
assertFalse(q.tryTransfer(five, SHORT_DELAY_MS, MILLISECONDS)); |
995 |
> |
long t0 = System.nanoTime(); |
996 |
> |
assertFalse(q.tryTransfer(five, timeoutMillis(), MILLISECONDS)); |
997 |
> |
assertTrue(millisElapsedSince(t0) >= timeoutMillis()); |
998 |
|
assertEquals(1, q.size()); |
999 |
|
assertSame(four, q.poll()); |
1000 |
|
assertNull(q.poll()); |
1003 |
|
|
1004 |
|
private LinkedTransferQueue<Integer> populatedQueue(int n) { |
1005 |
|
LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>(); |
1006 |
< |
assertTrue(q.isEmpty()); |
1006 |
> |
checkEmpty(q); |
1007 |
|
for (int i = 0; i < n; i++) { |
1008 |
|
assertEquals(i, q.size()); |
1009 |
|
assertTrue(q.offer(i)); |
1012 |
|
assertFalse(q.isEmpty()); |
1013 |
|
return q; |
1014 |
|
} |
1015 |
+ |
|
1016 |
+ |
/** |
1017 |
+ |
* remove(null), contains(null) always return false |
1018 |
+ |
*/ |
1019 |
+ |
public void testNeverContainsNull() { |
1020 |
+ |
Collection<?>[] qs = { |
1021 |
+ |
new LinkedTransferQueue<Object>(), |
1022 |
+ |
populatedQueue(2), |
1023 |
+ |
}; |
1024 |
+ |
|
1025 |
+ |
for (Collection<?> q : qs) { |
1026 |
+ |
assertFalse(q.contains(null)); |
1027 |
+ |
assertFalse(q.remove(null)); |
1028 |
+ |
} |
1029 |
+ |
} |
1030 |
|
} |