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; |
22 |
|
import static java.util.concurrent.TimeUnit.NANOSECONDS; |
22 |
– |
import junit.framework.Test; |
23 |
– |
import junit.framework.TestSuite; |
23 |
|
|
24 |
|
@SuppressWarnings({"unchecked", "rawtypes"}) |
25 |
|
public class LinkedTransferQueueTest extends JSR166TestCase { |
39 |
|
new Generic().testSuite()); |
40 |
|
} |
41 |
|
|
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 |
– |
|
42 |
|
/** |
43 |
|
* Constructor builds new queue with size being zero and empty |
44 |
|
* being true |
64 |
|
* NullPointerException |
65 |
|
*/ |
66 |
|
public void testConstructor3() { |
67 |
+ |
Collection<Integer> elements = Arrays.asList(new Integer[SIZE]); |
68 |
|
try { |
69 |
< |
Integer[] ints = new Integer[SIZE]; |
93 |
< |
new LinkedTransferQueue(Arrays.asList(ints)); |
69 |
> |
new LinkedTransferQueue(elements); |
70 |
|
shouldThrow(); |
71 |
|
} catch (NullPointerException success) {} |
72 |
|
} |
76 |
|
* throws NullPointerException |
77 |
|
*/ |
78 |
|
public void testConstructor4() { |
79 |
+ |
Integer[] ints = new Integer[SIZE]; |
80 |
+ |
for (int i = 0; i < SIZE-1; ++i) |
81 |
+ |
ints[i] = i; |
82 |
+ |
Collection<Integer> elements = Arrays.asList(ints); |
83 |
|
try { |
84 |
< |
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)); |
84 |
> |
new LinkedTransferQueue(elements); |
85 |
|
shouldThrow(); |
86 |
|
} catch (NullPointerException success) {} |
87 |
|
} |
128 |
|
} |
129 |
|
|
130 |
|
/** |
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 |
– |
/** |
131 |
|
* addAll(this) throws IllegalArgumentException |
132 |
|
*/ |
133 |
|
public void testAddAllSelf() { |
139 |
|
} |
140 |
|
|
141 |
|
/** |
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 |
– |
/** |
142 |
|
* addAll of a collection with any null elements throws |
143 |
|
* NullPointerException after possibly adding some elements |
144 |
|
*/ |
172 |
|
} |
173 |
|
|
174 |
|
/** |
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 |
– |
/** |
175 |
|
* all elements successfully put are contained |
176 |
|
*/ |
177 |
|
public void testPut() { |
197 |
|
* take removes existing elements until empty, then blocks interruptibly |
198 |
|
*/ |
199 |
|
public void testBlockingTake() throws InterruptedException { |
200 |
< |
final LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
201 |
< |
Thread t = new Thread(new CheckedRunnable() { |
200 |
> |
final BlockingQueue q = populatedQueue(SIZE); |
201 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
202 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
203 |
|
public void realRun() throws InterruptedException { |
204 |
|
for (int i = 0; i < SIZE; ++i) { |
205 |
< |
assertEquals(i, (int) q.take()); |
205 |
> |
assertEquals(i, q.take()); |
206 |
|
} |
207 |
+ |
|
208 |
+ |
Thread.currentThread().interrupt(); |
209 |
|
try { |
210 |
|
q.take(); |
211 |
|
shouldThrow(); |
212 |
|
} catch (InterruptedException success) {} |
213 |
+ |
assertFalse(Thread.interrupted()); |
214 |
+ |
|
215 |
+ |
pleaseInterrupt.countDown(); |
216 |
+ |
try { |
217 |
+ |
q.take(); |
218 |
+ |
shouldThrow(); |
219 |
+ |
} catch (InterruptedException success) {} |
220 |
+ |
assertFalse(Thread.interrupted()); |
221 |
|
}}); |
222 |
|
|
223 |
< |
t.start(); |
224 |
< |
Thread.sleep(SHORT_DELAY_MS); |
223 |
> |
await(pleaseInterrupt); |
224 |
> |
assertThreadStaysAlive(t); |
225 |
|
t.interrupt(); |
226 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
296 |
< |
checkEmpty(q); |
226 |
> |
awaitTermination(t); |
227 |
|
} |
228 |
|
|
229 |
|
/** |
239 |
|
} |
240 |
|
|
241 |
|
/** |
242 |
< |
* timed pool with zero timeout succeeds when non-empty, else times out |
242 |
> |
* timed poll with zero timeout succeeds when non-empty, else times out |
243 |
|
*/ |
244 |
|
public void testTimedPoll0() throws InterruptedException { |
245 |
|
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
251 |
|
} |
252 |
|
|
253 |
|
/** |
254 |
< |
* timed pool with nonzero timeout succeeds when non-empty, else times out |
254 |
> |
* timed poll with nonzero timeout succeeds when non-empty, else times out |
255 |
|
*/ |
256 |
|
public void testTimedPoll() throws InterruptedException { |
257 |
|
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
258 |
|
for (int i = 0; i < SIZE; ++i) { |
259 |
< |
long t0 = System.nanoTime(); |
259 |
> |
long startTime = System.nanoTime(); |
260 |
|
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
261 |
< |
assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS); |
261 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
262 |
|
} |
263 |
< |
assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
263 |
> |
long startTime = System.nanoTime(); |
264 |
> |
assertNull(q.poll(timeoutMillis(), MILLISECONDS)); |
265 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
266 |
|
checkEmpty(q); |
267 |
|
} |
268 |
|
|
271 |
|
* returning timeout status |
272 |
|
*/ |
273 |
|
public void testInterruptedTimedPoll() throws InterruptedException { |
274 |
< |
final LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
274 |
> |
final BlockingQueue<Integer> q = populatedQueue(SIZE); |
275 |
> |
final CountDownLatch aboutToWait = new CountDownLatch(1); |
276 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
277 |
|
public void realRun() throws InterruptedException { |
278 |
|
for (int i = 0; i < SIZE; ++i) { |
280 |
|
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
281 |
|
assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS); |
282 |
|
} |
283 |
+ |
long t0 = System.nanoTime(); |
284 |
+ |
aboutToWait.countDown(); |
285 |
|
try { |
286 |
< |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
286 |
> |
q.poll(MEDIUM_DELAY_MS, MILLISECONDS); |
287 |
|
shouldThrow(); |
288 |
< |
} catch (InterruptedException success) {} |
288 |
> |
} catch (InterruptedException success) { |
289 |
> |
assertTrue(millisElapsedSince(t0) < MEDIUM_DELAY_MS); |
290 |
> |
} |
291 |
|
}}); |
292 |
|
|
293 |
< |
Thread.sleep(SMALL_DELAY_MS); |
293 |
> |
aboutToWait.await(); |
294 |
> |
waitForThreadToEnterWaitState(t, SMALL_DELAY_MS); |
295 |
|
t.interrupt(); |
296 |
|
awaitTermination(t, MEDIUM_DELAY_MS); |
297 |
|
checkEmpty(q); |
298 |
|
} |
299 |
|
|
300 |
|
/** |
301 |
+ |
* timed poll after thread interrupted throws InterruptedException |
302 |
+ |
* instead of returning timeout status |
303 |
+ |
*/ |
304 |
+ |
public void testTimedPollAfterInterrupt() throws InterruptedException { |
305 |
+ |
final BlockingQueue<Integer> q = populatedQueue(SIZE); |
306 |
+ |
Thread t = newStartedThread(new CheckedRunnable() { |
307 |
+ |
public void realRun() throws InterruptedException { |
308 |
+ |
Thread.currentThread().interrupt(); |
309 |
+ |
for (int i = 0; i < SIZE; ++i) { |
310 |
+ |
long t0 = System.nanoTime(); |
311 |
+ |
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
312 |
+ |
assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS); |
313 |
+ |
} |
314 |
+ |
try { |
315 |
+ |
q.poll(MEDIUM_DELAY_MS, MILLISECONDS); |
316 |
+ |
shouldThrow(); |
317 |
+ |
} catch (InterruptedException success) {} |
318 |
+ |
}}); |
319 |
+ |
|
320 |
+ |
awaitTermination(t, MEDIUM_DELAY_MS); |
321 |
+ |
checkEmpty(q); |
322 |
+ |
} |
323 |
+ |
|
324 |
+ |
/** |
325 |
|
* peek returns next element, or null if empty |
326 |
|
*/ |
327 |
|
public void testPeek() throws InterruptedException { |
368 |
|
} |
369 |
|
|
370 |
|
/** |
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 |
– |
/** |
371 |
|
* An add following remove(x) succeeds |
372 |
|
*/ |
373 |
|
public void testRemoveElementAndAdd() throws InterruptedException { |
459 |
|
} |
460 |
|
|
461 |
|
/** |
462 |
< |
* toArray() contains all elements |
462 |
> |
* toArray() contains all elements in FIFO order |
463 |
|
*/ |
464 |
< |
public void testToArray() throws InterruptedException { |
464 |
> |
public void testToArray() { |
465 |
|
LinkedTransferQueue q = populatedQueue(SIZE); |
466 |
|
Object[] o = q.toArray(); |
467 |
|
for (int i = 0; i < o.length; i++) { |
468 |
< |
assertEquals(o[i], q.take()); |
468 |
> |
assertSame(o[i], q.poll()); |
469 |
|
} |
470 |
|
} |
471 |
|
|
472 |
|
/** |
473 |
< |
* toArray(a) contains all elements |
473 |
> |
* toArray(a) contains all elements in FIFO order |
474 |
|
*/ |
475 |
< |
public void testToArray2() throws InterruptedException { |
475 |
> |
public void testToArray2() { |
476 |
|
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
477 |
|
Integer[] ints = new Integer[SIZE]; |
478 |
< |
ints = q.toArray(ints); |
478 |
> |
Integer[] array = q.toArray(ints); |
479 |
> |
assertSame(ints, array); |
480 |
|
for (int i = 0; i < ints.length; i++) { |
481 |
< |
assertEquals(ints[i], q.take()); |
481 |
> |
assertSame(ints[i], q.poll()); |
482 |
|
} |
483 |
|
} |
484 |
|
|
485 |
|
/** |
486 |
< |
* 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 |
486 |
> |
* toArray(incompatible array type) throws ArrayStoreException |
487 |
|
*/ |
488 |
|
public void testToArray1_BadArg() { |
489 |
|
LinkedTransferQueue q = populatedQueue(SIZE); |
490 |
|
try { |
491 |
< |
Object o[] = q.toArray(new String[10]); |
491 |
> |
q.toArray(new String[10]); |
492 |
|
shouldThrow(); |
493 |
|
} catch (ArrayStoreException success) {} |
494 |
|
} |
565 |
|
LinkedTransferQueue q = populatedQueue(SIZE); |
566 |
|
String s = q.toString(); |
567 |
|
for (int i = 0; i < SIZE; ++i) { |
568 |
< |
assertTrue(s.indexOf(String.valueOf(i)) >= 0); |
568 |
> |
assertTrue(s.contains(String.valueOf(i))); |
569 |
|
} |
570 |
|
} |
571 |
|
|
574 |
|
*/ |
575 |
|
public void testOfferInExecutor() { |
576 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
577 |
< |
q.add(one); |
641 |
< |
q.add(two); |
577 |
> |
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
578 |
|
ExecutorService executor = Executors.newFixedThreadPool(2); |
579 |
|
|
580 |
|
executor.execute(new CheckedRunnable() { |
581 |
< |
public void realRun() { |
582 |
< |
assertTrue(q.offer(three, MEDIUM_DELAY_MS, MILLISECONDS)); |
581 |
> |
public void realRun() throws InterruptedException { |
582 |
> |
threadsStarted.await(); |
583 |
> |
assertTrue(q.offer(one, LONG_DELAY_MS, MILLISECONDS)); |
584 |
|
}}); |
585 |
|
|
586 |
|
executor.execute(new CheckedRunnable() { |
587 |
|
public void realRun() throws InterruptedException { |
588 |
< |
Thread.sleep(SMALL_DELAY_MS); |
588 |
> |
threadsStarted.await(); |
589 |
|
assertSame(one, q.take()); |
590 |
+ |
checkEmpty(q); |
591 |
|
}}); |
592 |
|
|
593 |
|
joinPool(executor); |
598 |
|
*/ |
599 |
|
public void testPollInExecutor() { |
600 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
601 |
+ |
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
602 |
|
ExecutorService executor = Executors.newFixedThreadPool(2); |
603 |
|
|
604 |
|
executor.execute(new CheckedRunnable() { |
605 |
|
public void realRun() throws InterruptedException { |
606 |
|
assertNull(q.poll()); |
607 |
< |
assertSame(one, q.poll(MEDIUM_DELAY_MS, MILLISECONDS)); |
608 |
< |
assertTrue(q.isEmpty()); |
607 |
> |
threadsStarted.await(); |
608 |
> |
assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
609 |
> |
checkEmpty(q); |
610 |
|
}}); |
611 |
|
|
612 |
|
executor.execute(new CheckedRunnable() { |
613 |
|
public void realRun() throws InterruptedException { |
614 |
< |
Thread.sleep(SMALL_DELAY_MS); |
614 |
> |
threadsStarted.await(); |
615 |
|
q.put(one); |
616 |
|
}}); |
617 |
|
|
622 |
|
* A deserialized serialized queue has same elements in same order |
623 |
|
*/ |
624 |
|
public void testSerialization() throws Exception { |
625 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
626 |
< |
|
687 |
< |
ByteArrayOutputStream bout = new ByteArrayOutputStream(10000); |
688 |
< |
ObjectOutputStream out |
689 |
< |
= new ObjectOutputStream(new BufferedOutputStream(bout)); |
690 |
< |
out.writeObject(q); |
691 |
< |
out.close(); |
692 |
< |
|
693 |
< |
ByteArrayInputStream bin |
694 |
< |
= new ByteArrayInputStream(bout.toByteArray()); |
695 |
< |
ObjectInputStream in |
696 |
< |
= new ObjectInputStream(new BufferedInputStream(bin)); |
697 |
< |
LinkedTransferQueue r = (LinkedTransferQueue) in.readObject(); |
625 |
> |
Queue x = populatedQueue(SIZE); |
626 |
> |
Queue y = serialClone(x); |
627 |
|
|
628 |
< |
assertEquals(q.size(), r.size()); |
629 |
< |
while (!q.isEmpty()) { |
630 |
< |
assertEquals(q.remove(), r.remove()); |
628 |
> |
assertTrue(x != y); |
629 |
> |
assertEquals(x.size(), y.size()); |
630 |
> |
assertEquals(x.toString(), y.toString()); |
631 |
> |
assertTrue(Arrays.equals(x.toArray(), y.toArray())); |
632 |
> |
while (!x.isEmpty()) { |
633 |
> |
assertFalse(y.isEmpty()); |
634 |
> |
assertEquals(x.remove(), y.remove()); |
635 |
|
} |
636 |
< |
} |
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) {} |
636 |
> |
assertTrue(y.isEmpty()); |
637 |
|
} |
638 |
|
|
639 |
|
/** |
682 |
|
} |
683 |
|
|
684 |
|
/** |
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 |
– |
/** |
685 |
|
* drainTo(c, n) empties first min(n, size) elements of queue into c |
686 |
|
*/ |
687 |
|
public void testDrainToN() { |
711 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
712 |
|
assertEquals(q.getWaitingConsumerCount(), 0); |
713 |
|
assertFalse(q.hasWaitingConsumer()); |
714 |
+ |
final CountDownLatch threadStarted = new CountDownLatch(1); |
715 |
|
|
716 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
717 |
|
public void realRun() throws InterruptedException { |
718 |
< |
Thread.sleep(SMALL_DELAY_MS); |
719 |
< |
assertTrue(q.hasWaitingConsumer()); |
829 |
< |
assertEquals(q.getWaitingConsumerCount(), 1); |
830 |
< |
assertTrue(q.offer(one)); |
831 |
< |
assertFalse(q.hasWaitingConsumer()); |
718 |
> |
threadStarted.countDown(); |
719 |
> |
assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
720 |
|
assertEquals(q.getWaitingConsumerCount(), 0); |
721 |
+ |
assertFalse(q.hasWaitingConsumer()); |
722 |
|
}}); |
723 |
|
|
724 |
< |
assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
724 |
> |
threadStarted.await(); |
725 |
> |
waitForThreadToEnterWaitState(t, SMALL_DELAY_MS); |
726 |
> |
assertEquals(q.getWaitingConsumerCount(), 1); |
727 |
> |
assertTrue(q.hasWaitingConsumer()); |
728 |
> |
|
729 |
> |
assertTrue(q.offer(one)); |
730 |
|
assertEquals(q.getWaitingConsumerCount(), 0); |
731 |
|
assertFalse(q.hasWaitingConsumer()); |
732 |
+ |
|
733 |
|
awaitTermination(t, MEDIUM_DELAY_MS); |
734 |
|
} |
735 |
|
|
751 |
|
public void testTransfer2() throws InterruptedException { |
752 |
|
final LinkedTransferQueue<Integer> q |
753 |
|
= new LinkedTransferQueue<Integer>(); |
754 |
+ |
final CountDownLatch threadStarted = new CountDownLatch(1); |
755 |
|
|
756 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
757 |
|
public void realRun() throws InterruptedException { |
758 |
< |
q.transfer(SIZE); |
759 |
< |
assertTrue(q.isEmpty()); |
758 |
> |
threadStarted.countDown(); |
759 |
> |
q.transfer(five); |
760 |
> |
checkEmpty(q); |
761 |
|
}}); |
762 |
|
|
763 |
< |
Thread.sleep(SHORT_DELAY_MS); |
763 |
> |
threadStarted.await(); |
764 |
> |
waitForThreadToEnterWaitState(t, SMALL_DELAY_MS); |
765 |
|
assertEquals(1, q.size()); |
766 |
< |
assertEquals(SIZE, (int) q.poll()); |
767 |
< |
assertTrue(q.isEmpty()); |
766 |
> |
assertSame(five, q.poll()); |
767 |
> |
checkEmpty(q); |
768 |
|
awaitTermination(t, MEDIUM_DELAY_MS); |
769 |
|
} |
770 |
|
|
777 |
|
|
778 |
|
Thread first = newStartedThread(new CheckedRunnable() { |
779 |
|
public void realRun() throws InterruptedException { |
780 |
< |
Integer i = SIZE + 1; |
781 |
< |
q.transfer(i); |
884 |
< |
assertTrue(!q.contains(i)); |
780 |
> |
q.transfer(four); |
781 |
> |
assertTrue(!q.contains(four)); |
782 |
|
assertEquals(1, q.size()); |
783 |
|
}}); |
784 |
|
|
785 |
|
Thread interruptedThread = newStartedThread( |
786 |
|
new CheckedInterruptedRunnable() { |
787 |
|
public void realRun() throws InterruptedException { |
788 |
< |
while (q.size() == 0) |
788 |
> |
while (q.isEmpty()) |
789 |
|
Thread.yield(); |
790 |
< |
q.transfer(SIZE); |
790 |
> |
q.transfer(five); |
791 |
|
}}); |
792 |
|
|
793 |
|
while (q.size() < 2) |
794 |
|
Thread.yield(); |
795 |
|
assertEquals(2, q.size()); |
796 |
< |
assertEquals(SIZE + 1, (int) q.poll()); |
796 |
> |
assertSame(four, q.poll()); |
797 |
|
first.join(); |
798 |
|
assertEquals(1, q.size()); |
799 |
|
interruptedThread.interrupt(); |
800 |
|
interruptedThread.join(); |
801 |
< |
assertEquals(0, q.size()); |
905 |
< |
assertTrue(q.isEmpty()); |
801 |
> |
checkEmpty(q); |
802 |
|
} |
803 |
|
|
804 |
|
/** |
815 |
|
assertSame(three, q.poll()); |
816 |
|
}}); |
817 |
|
|
818 |
< |
Thread.sleep(SHORT_DELAY_MS); |
818 |
> |
while (q.isEmpty()) |
819 |
> |
Thread.yield(); |
820 |
> |
assertFalse(q.isEmpty()); |
821 |
> |
assertEquals(1, q.size()); |
822 |
|
assertTrue(q.offer(three)); |
823 |
|
assertSame(four, q.poll()); |
824 |
|
awaitTermination(t, MEDIUM_DELAY_MS); |
834 |
|
|
835 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
836 |
|
public void realRun() throws InterruptedException { |
837 |
< |
q.transfer(SIZE); |
837 |
> |
q.transfer(four); |
838 |
|
checkEmpty(q); |
839 |
|
}}); |
840 |
|
|
841 |
< |
Thread.sleep(SHORT_DELAY_MS); |
842 |
< |
assertEquals(SIZE, (int) q.take()); |
841 |
> |
while (q.isEmpty()) |
842 |
> |
Thread.yield(); |
843 |
> |
assertFalse(q.isEmpty()); |
844 |
> |
assertEquals(1, q.size()); |
845 |
> |
assertSame(four, q.take()); |
846 |
|
checkEmpty(q); |
847 |
|
awaitTermination(t, MEDIUM_DELAY_MS); |
848 |
|
} |
882 |
|
while (! q.hasWaitingConsumer()) |
883 |
|
Thread.yield(); |
884 |
|
assertTrue(q.hasWaitingConsumer()); |
885 |
< |
assertTrue(q.isEmpty()); |
984 |
< |
assertEquals(q.size(), 0); |
885 |
> |
checkEmpty(q); |
886 |
|
assertTrue(q.tryTransfer(hotPotato)); |
887 |
|
}}); |
888 |
|
|
904 |
|
while (! q.hasWaitingConsumer()) |
905 |
|
Thread.yield(); |
906 |
|
assertTrue(q.hasWaitingConsumer()); |
907 |
< |
assertTrue(q.isEmpty()); |
1007 |
< |
assertEquals(q.size(), 0); |
907 |
> |
checkEmpty(q); |
908 |
|
assertTrue(q.tryTransfer(hotPotato)); |
909 |
|
}}); |
910 |
|
|
914 |
|
} |
915 |
|
|
916 |
|
/** |
917 |
< |
* tryTransfer waits the amount given if interrupted, and |
1018 |
< |
* throws interrupted exception |
917 |
> |
* tryTransfer blocks interruptibly if no takers |
918 |
|
*/ |
919 |
|
public void testTryTransfer5() throws InterruptedException { |
920 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
921 |
+ |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
922 |
+ |
assertTrue(q.isEmpty()); |
923 |
|
|
924 |
< |
Thread toInterrupt = newStartedThread(new CheckedInterruptedRunnable() { |
924 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
925 |
|
public void realRun() throws InterruptedException { |
926 |
< |
q.tryTransfer(new Object(), LONG_DELAY_MS, MILLISECONDS); |
926 |
> |
Thread.currentThread().interrupt(); |
927 |
> |
try { |
928 |
> |
q.tryTransfer(new Object(), LONG_DELAY_MS, MILLISECONDS); |
929 |
> |
shouldThrow(); |
930 |
> |
} catch (InterruptedException success) {} |
931 |
> |
assertFalse(Thread.interrupted()); |
932 |
> |
|
933 |
> |
pleaseInterrupt.countDown(); |
934 |
> |
try { |
935 |
> |
q.tryTransfer(new Object(), LONG_DELAY_MS, MILLISECONDS); |
936 |
> |
shouldThrow(); |
937 |
> |
} catch (InterruptedException success) {} |
938 |
> |
assertFalse(Thread.interrupted()); |
939 |
|
}}); |
940 |
|
|
941 |
< |
Thread.sleep(SMALL_DELAY_MS); |
942 |
< |
toInterrupt.interrupt(); |
943 |
< |
toInterrupt.join(); |
941 |
> |
await(pleaseInterrupt); |
942 |
> |
assertThreadStaysAlive(t); |
943 |
> |
t.interrupt(); |
944 |
> |
awaitTermination(t); |
945 |
> |
checkEmpty(q); |
946 |
|
} |
947 |
|
|
948 |
|
/** |
949 |
< |
* tryTransfer gives up after the timeout and return false |
949 |
> |
* tryTransfer gives up after the timeout and returns false |
950 |
|
*/ |
951 |
|
public void testTryTransfer6() throws InterruptedException { |
952 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
955 |
|
public void realRun() throws InterruptedException { |
956 |
|
long t0 = System.nanoTime(); |
957 |
|
assertFalse(q.tryTransfer(new Object(), |
958 |
< |
SHORT_DELAY_MS, MILLISECONDS)); |
959 |
< |
assertTrue(millisElapsedSince(t0) >= SHORT_DELAY_MS); |
958 |
> |
timeoutMillis(), MILLISECONDS)); |
959 |
> |
assertTrue(millisElapsedSince(t0) >= timeoutMillis()); |
960 |
> |
checkEmpty(q); |
961 |
|
}}); |
962 |
|
|
963 |
< |
checkEmpty(q); |
1048 |
< |
awaitTermination(t, MEDIUM_DELAY_MS); |
963 |
> |
awaitTermination(t); |
964 |
|
checkEmpty(q); |
965 |
|
} |
966 |
|
|
975 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
976 |
|
public void realRun() throws InterruptedException { |
977 |
|
assertTrue(q.tryTransfer(five, MEDIUM_DELAY_MS, MILLISECONDS)); |
978 |
< |
assertTrue(q.isEmpty()); |
978 |
> |
checkEmpty(q); |
979 |
|
}}); |
980 |
|
|
981 |
< |
Thread.sleep(SHORT_DELAY_MS); |
981 |
> |
while (q.size() != 2) |
982 |
> |
Thread.yield(); |
983 |
|
assertEquals(2, q.size()); |
984 |
|
assertSame(four, q.poll()); |
985 |
|
assertSame(five, q.poll()); |
988 |
|
} |
989 |
|
|
990 |
|
/** |
991 |
< |
* tryTransfer attempts to enqueue into the q and fails returning |
992 |
< |
* false not enqueueing and the successive poll is null |
991 |
> |
* tryTransfer attempts to enqueue into the queue and fails |
992 |
> |
* returning false not enqueueing and the successive poll is null |
993 |
|
*/ |
994 |
|
public void testTryTransfer8() throws InterruptedException { |
995 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
996 |
|
assertTrue(q.offer(four)); |
997 |
|
assertEquals(1, q.size()); |
998 |
< |
assertFalse(q.tryTransfer(five, SHORT_DELAY_MS, MILLISECONDS)); |
998 |
> |
long t0 = System.nanoTime(); |
999 |
> |
assertFalse(q.tryTransfer(five, timeoutMillis(), MILLISECONDS)); |
1000 |
> |
assertTrue(millisElapsedSince(t0) >= timeoutMillis()); |
1001 |
|
assertEquals(1, q.size()); |
1002 |
|
assertSame(four, q.poll()); |
1003 |
|
assertNull(q.poll()); |
1006 |
|
|
1007 |
|
private LinkedTransferQueue<Integer> populatedQueue(int n) { |
1008 |
|
LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>(); |
1009 |
< |
assertTrue(q.isEmpty()); |
1009 |
> |
checkEmpty(q); |
1010 |
|
for (int i = 0; i < n; i++) { |
1011 |
|
assertEquals(i, q.size()); |
1012 |
|
assertTrue(q.offer(i)); |