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 |
|
|
13 |
|
import java.io.ObjectOutputStream; |
14 |
|
import java.util.ArrayList; |
15 |
|
import java.util.Arrays; |
16 |
+ |
import java.util.Collection; |
17 |
|
import java.util.Iterator; |
18 |
|
import java.util.List; |
19 |
|
import java.util.NoSuchElementException; |
20 |
< |
import java.util.concurrent.*; |
20 |
> |
import java.util.concurrent.BlockingQueue; |
21 |
> |
import java.util.concurrent.CountDownLatch; |
22 |
> |
import java.util.concurrent.Executors; |
23 |
> |
import java.util.concurrent.ExecutorService; |
24 |
> |
import java.util.concurrent.LinkedTransferQueue; |
25 |
|
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
26 |
+ |
import static java.util.concurrent.TimeUnit.NANOSECONDS; |
27 |
|
import junit.framework.Test; |
28 |
|
import junit.framework.TestSuite; |
29 |
|
|
30 |
|
@SuppressWarnings({"unchecked", "rawtypes"}) |
31 |
|
public class LinkedTransferQueueTest extends JSR166TestCase { |
32 |
|
|
33 |
+ |
public static class Generic extends BlockingQueueTest { |
34 |
+ |
protected BlockingQueue emptyCollection() { |
35 |
+ |
return new LinkedTransferQueue(); |
36 |
+ |
} |
37 |
+ |
} |
38 |
+ |
|
39 |
|
public static void main(String[] args) { |
40 |
|
junit.textui.TestRunner.run(suite()); |
41 |
|
} |
42 |
|
|
43 |
|
public static Test suite() { |
44 |
< |
return new TestSuite(LinkedTransferQueueTest.class); |
45 |
< |
} |
34 |
< |
|
35 |
< |
void checkEmpty(LinkedTransferQueue q) throws InterruptedException { |
36 |
< |
assertTrue(q.isEmpty()); |
37 |
< |
assertEquals(0, q.size()); |
38 |
< |
assertNull(q.peek()); |
39 |
< |
assertNull(q.poll()); |
40 |
< |
assertNull(q.poll(0, MILLISECONDS)); |
41 |
< |
assertEquals(q.toString(), "[]"); |
42 |
< |
assertTrue(Arrays.equals(q.toArray(), new Object[0])); |
43 |
< |
assertFalse(q.iterator().hasNext()); |
44 |
< |
try { |
45 |
< |
q.element(); |
46 |
< |
shouldThrow(); |
47 |
< |
} catch (NoSuchElementException success) {} |
48 |
< |
try { |
49 |
< |
q.iterator().next(); |
50 |
< |
shouldThrow(); |
51 |
< |
} catch (NoSuchElementException success) {} |
52 |
< |
try { |
53 |
< |
q.remove(); |
54 |
< |
shouldThrow(); |
55 |
< |
} catch (NoSuchElementException success) {} |
44 |
> |
return newTestSuite(LinkedTransferQueueTest.class, |
45 |
> |
new Generic().testSuite()); |
46 |
|
} |
47 |
|
|
48 |
|
/** |
70 |
|
* NullPointerException |
71 |
|
*/ |
72 |
|
public void testConstructor3() { |
73 |
+ |
Collection<Integer> elements = Arrays.asList(new Integer[SIZE]); |
74 |
|
try { |
75 |
< |
Integer[] ints = new Integer[SIZE]; |
85 |
< |
new LinkedTransferQueue(Arrays.asList(ints)); |
75 |
> |
new LinkedTransferQueue(elements); |
76 |
|
shouldThrow(); |
77 |
|
} catch (NullPointerException success) {} |
78 |
|
} |
82 |
|
* throws NullPointerException |
83 |
|
*/ |
84 |
|
public void testConstructor4() { |
85 |
+ |
Integer[] ints = new Integer[SIZE]; |
86 |
+ |
for (int i = 0; i < SIZE-1; ++i) |
87 |
+ |
ints[i] = i; |
88 |
+ |
Collection<Integer> elements = Arrays.asList(ints); |
89 |
|
try { |
90 |
< |
Integer[] ints = new Integer[SIZE]; |
97 |
< |
for (int i = 0; i < SIZE - 1; ++i) { |
98 |
< |
ints[i] = i; |
99 |
< |
} |
100 |
< |
new LinkedTransferQueue(Arrays.asList(ints)); |
90 |
> |
new LinkedTransferQueue(elements); |
91 |
|
shouldThrow(); |
92 |
|
} catch (NullPointerException success) {} |
93 |
|
} |
134 |
|
} |
135 |
|
|
136 |
|
/** |
147 |
– |
* offer(null) throws NullPointerException |
148 |
– |
*/ |
149 |
– |
public void testOfferNull() { |
150 |
– |
try { |
151 |
– |
LinkedTransferQueue q = new LinkedTransferQueue(); |
152 |
– |
q.offer(null); |
153 |
– |
shouldThrow(); |
154 |
– |
} catch (NullPointerException success) {} |
155 |
– |
} |
156 |
– |
|
157 |
– |
/** |
158 |
– |
* add(null) throws NullPointerException |
159 |
– |
*/ |
160 |
– |
public void testAddNull() { |
161 |
– |
try { |
162 |
– |
LinkedTransferQueue q = new LinkedTransferQueue(); |
163 |
– |
q.add(null); |
164 |
– |
shouldThrow(); |
165 |
– |
} catch (NullPointerException success) {} |
166 |
– |
} |
167 |
– |
|
168 |
– |
/** |
169 |
– |
* addAll(null) throws NullPointerException |
170 |
– |
*/ |
171 |
– |
public void testAddAll1() { |
172 |
– |
try { |
173 |
– |
LinkedTransferQueue q = new LinkedTransferQueue(); |
174 |
– |
q.addAll(null); |
175 |
– |
shouldThrow(); |
176 |
– |
} catch (NullPointerException success) {} |
177 |
– |
} |
178 |
– |
|
179 |
– |
/** |
137 |
|
* addAll(this) throws IllegalArgumentException |
138 |
|
*/ |
139 |
|
public void testAddAllSelf() { |
145 |
|
} |
146 |
|
|
147 |
|
/** |
191 |
– |
* addAll of a collection with null elements throws NullPointerException |
192 |
– |
*/ |
193 |
– |
public void testAddAll2() { |
194 |
– |
try { |
195 |
– |
LinkedTransferQueue q = new LinkedTransferQueue(); |
196 |
– |
Integer[] ints = new Integer[SIZE]; |
197 |
– |
q.addAll(Arrays.asList(ints)); |
198 |
– |
shouldThrow(); |
199 |
– |
} catch (NullPointerException success) {} |
200 |
– |
} |
201 |
– |
|
202 |
– |
/** |
148 |
|
* addAll of a collection with any null elements throws |
149 |
|
* NullPointerException after possibly adding some elements |
150 |
|
*/ |
178 |
|
} |
179 |
|
|
180 |
|
/** |
236 |
– |
* put(null) throws NullPointerException |
237 |
– |
*/ |
238 |
– |
public void testPutNull() throws InterruptedException { |
239 |
– |
try { |
240 |
– |
LinkedTransferQueue q = new LinkedTransferQueue(); |
241 |
– |
q.put(null); |
242 |
– |
shouldThrow(); |
243 |
– |
} catch (NullPointerException success) {} |
244 |
– |
} |
245 |
– |
|
246 |
– |
/** |
181 |
|
* all elements successfully put are contained |
182 |
|
*/ |
183 |
|
public void testPut() { |
200 |
|
} |
201 |
|
|
202 |
|
/** |
203 |
< |
* take blocks interruptibly when empty |
270 |
< |
*/ |
271 |
< |
public void testTakeFromEmpty() throws InterruptedException { |
272 |
< |
final LinkedTransferQueue q = new LinkedTransferQueue(); |
273 |
< |
Thread t = newStartedThread(new CheckedInterruptedRunnable() { |
274 |
< |
void realRun() throws InterruptedException { |
275 |
< |
q.take(); |
276 |
< |
}}); |
277 |
< |
Thread.sleep(SHORT_DELAY_MS); |
278 |
< |
t.interrupt(); |
279 |
< |
t.join(); |
280 |
< |
} |
281 |
< |
|
282 |
< |
/** |
283 |
< |
* Take removes existing elements until empty, then blocks interruptibly |
203 |
> |
* take removes existing elements until empty, then blocks interruptibly |
204 |
|
*/ |
205 |
|
public void testBlockingTake() throws InterruptedException { |
206 |
< |
final LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
207 |
< |
Thread t = newStartedThread(new CheckedInterruptedRunnable() { |
208 |
< |
void realRun() throws InterruptedException { |
206 |
> |
final BlockingQueue q = populatedQueue(SIZE); |
207 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
208 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
209 |
> |
public void realRun() throws InterruptedException { |
210 |
|
for (int i = 0; i < SIZE; ++i) { |
211 |
< |
threadAssertEquals(i, (int) q.take()); |
211 |
> |
assertEquals(i, q.take()); |
212 |
|
} |
213 |
< |
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 |
< |
Thread.sleep(SMALL_DELAY_MS); |
228 |
> |
|
229 |
> |
await(pleaseInterrupt); |
230 |
> |
assertThreadStaysAlive(t); |
231 |
|
t.interrupt(); |
232 |
< |
t.join(); |
297 |
< |
checkEmpty(q); |
232 |
> |
awaitTermination(t); |
233 |
|
} |
234 |
|
|
235 |
|
/** |
245 |
|
} |
246 |
|
|
247 |
|
/** |
248 |
< |
* timed pool with zero timeout succeeds when non-empty, else times out |
248 |
> |
* timed poll with zero timeout succeeds when non-empty, else times out |
249 |
|
*/ |
250 |
|
public void testTimedPoll0() throws InterruptedException { |
251 |
|
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
257 |
|
} |
258 |
|
|
259 |
|
/** |
260 |
< |
* timed pool with nonzero timeout succeeds when non-empty, else times out |
260 |
> |
* timed poll with nonzero timeout succeeds when non-empty, else times out |
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(); |
265 |
> |
long startTime = System.nanoTime(); |
266 |
|
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
267 |
< |
long millisElapsed = (System.nanoTime() - t0)/(1024 * 1024); |
333 |
< |
assertTrue(millisElapsed < SMALL_DELAY_MS); |
267 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
268 |
|
} |
269 |
< |
assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
269 |
> |
long startTime = System.nanoTime(); |
270 |
> |
assertNull(q.poll(timeoutMillis(), MILLISECONDS)); |
271 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
272 |
|
checkEmpty(q); |
273 |
|
} |
274 |
|
|
277 |
|
* returning timeout status |
278 |
|
*/ |
279 |
|
public void testInterruptedTimedPoll() throws InterruptedException { |
280 |
< |
final LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
280 |
> |
final BlockingQueue<Integer> q = populatedQueue(SIZE); |
281 |
> |
final CountDownLatch aboutToWait = new CountDownLatch(1); |
282 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
283 |
< |
void realRun() throws InterruptedException { |
283 |
> |
public void realRun() throws InterruptedException { |
284 |
|
for (int i = 0; i < SIZE; ++i) { |
285 |
|
long t0 = System.nanoTime(); |
286 |
< |
threadAssertEquals(i, (int) q.poll(LONG_DELAY_MS, |
287 |
< |
MILLISECONDS)); |
351 |
< |
long millisElapsed = (System.nanoTime() - t0)/(1024 * 1024); |
352 |
< |
assertTrue(millisElapsed < SMALL_DELAY_MS); |
286 |
> |
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
287 |
> |
assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS); |
288 |
|
} |
289 |
+ |
long t0 = System.nanoTime(); |
290 |
+ |
aboutToWait.countDown(); |
291 |
|
try { |
292 |
< |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
292 |
> |
q.poll(MEDIUM_DELAY_MS, MILLISECONDS); |
293 |
|
shouldThrow(); |
294 |
< |
} catch (InterruptedException success) {} |
294 |
> |
} catch (InterruptedException success) { |
295 |
> |
assertTrue(millisElapsedSince(t0) < MEDIUM_DELAY_MS); |
296 |
> |
} |
297 |
|
}}); |
298 |
|
|
299 |
< |
Thread.sleep(SMALL_DELAY_MS); |
299 |
> |
aboutToWait.await(); |
300 |
> |
waitForThreadToEnterWaitState(t, SMALL_DELAY_MS); |
301 |
|
t.interrupt(); |
302 |
< |
t.join(); |
302 |
> |
awaitTermination(t, MEDIUM_DELAY_MS); |
303 |
|
checkEmpty(q); |
304 |
|
} |
305 |
|
|
306 |
|
/** |
307 |
< |
* timed poll before a delayed offer fails; after offer succeeds; |
308 |
< |
* on interruption throws |
307 |
> |
* timed poll after thread interrupted throws InterruptedException |
308 |
> |
* instead of returning timeout status |
309 |
|
*/ |
310 |
< |
public void testTimedPollWithOffer() throws InterruptedException { |
311 |
< |
final LinkedTransferQueue q = new LinkedTransferQueue(); |
312 |
< |
Thread t = newStartedThread(new CheckedInterruptedRunnable() { |
313 |
< |
void realRun() throws InterruptedException { |
314 |
< |
threadAssertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
315 |
< |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
316 |
< |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
310 |
> |
public void testTimedPollAfterInterrupt() throws InterruptedException { |
311 |
> |
final BlockingQueue<Integer> q = populatedQueue(SIZE); |
312 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
313 |
> |
public void realRun() throws InterruptedException { |
314 |
> |
Thread.currentThread().interrupt(); |
315 |
> |
for (int i = 0; i < SIZE; ++i) { |
316 |
> |
long t0 = System.nanoTime(); |
317 |
> |
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
318 |
> |
assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS); |
319 |
> |
} |
320 |
> |
try { |
321 |
> |
q.poll(MEDIUM_DELAY_MS, MILLISECONDS); |
322 |
> |
shouldThrow(); |
323 |
> |
} catch (InterruptedException success) {} |
324 |
|
}}); |
325 |
< |
Thread.sleep(SMALL_DELAY_MS); |
326 |
< |
assertTrue(q.offer(zero, SHORT_DELAY_MS, MILLISECONDS)); |
327 |
< |
t.interrupt(); |
381 |
< |
t.join(); |
325 |
> |
|
326 |
> |
awaitTermination(t, MEDIUM_DELAY_MS); |
327 |
> |
checkEmpty(q); |
328 |
|
} |
329 |
|
|
330 |
|
/** |
378 |
|
*/ |
379 |
|
public void testRemoveElement() throws InterruptedException { |
380 |
|
LinkedTransferQueue q = populatedQueue(SIZE); |
381 |
< |
for (int i = 1; i < SIZE; i += 2) { |
381 |
> |
for (int i = 1; i < SIZE; i+=2) { |
382 |
> |
assertTrue(q.contains(i)); |
383 |
|
assertTrue(q.remove(i)); |
384 |
+ |
assertFalse(q.contains(i)); |
385 |
+ |
assertTrue(q.contains(i-1)); |
386 |
|
} |
387 |
< |
for (int i = 0; i < SIZE; i += 2) { |
387 |
> |
for (int i = 0; i < SIZE; i+=2) { |
388 |
> |
assertTrue(q.contains(i)); |
389 |
|
assertTrue(q.remove(i)); |
390 |
< |
assertFalse(q.remove(i + 1)); |
390 |
> |
assertFalse(q.contains(i)); |
391 |
> |
assertFalse(q.remove(i+1)); |
392 |
> |
assertFalse(q.contains(i+1)); |
393 |
|
} |
394 |
|
checkEmpty(q); |
395 |
|
} |
404 |
|
assertTrue(q.remove(one)); |
405 |
|
assertTrue(q.remove(two)); |
406 |
|
assertTrue(q.add(three)); |
407 |
< |
assertTrue(q.take() == three); |
407 |
> |
assertSame(q.take(), three); |
408 |
|
} |
409 |
|
|
410 |
|
/** |
486 |
|
} |
487 |
|
|
488 |
|
/** |
489 |
< |
* toArray() contains all elements |
489 |
> |
* toArray() contains all elements in FIFO order |
490 |
|
*/ |
491 |
< |
public void testToArray() throws InterruptedException { |
491 |
> |
public void testToArray() { |
492 |
|
LinkedTransferQueue q = populatedQueue(SIZE); |
493 |
|
Object[] o = q.toArray(); |
494 |
|
for (int i = 0; i < o.length; i++) { |
495 |
< |
assertEquals(o[i], q.take()); |
495 |
> |
assertSame(o[i], q.poll()); |
496 |
|
} |
497 |
|
} |
498 |
|
|
499 |
|
/** |
500 |
< |
* toArray(a) contains all elements |
500 |
> |
* toArray(a) contains all elements in FIFO order |
501 |
|
*/ |
502 |
< |
public void testToArray2() throws InterruptedException { |
502 |
> |
public void testToArray2() { |
503 |
|
LinkedTransferQueue<Integer> q = populatedQueue(SIZE); |
504 |
|
Integer[] ints = new Integer[SIZE]; |
505 |
< |
ints = q.toArray(ints); |
505 |
> |
Integer[] array = q.toArray(ints); |
506 |
> |
assertSame(ints, array); |
507 |
|
for (int i = 0; i < ints.length; i++) { |
508 |
< |
assertEquals(ints[i], q.take()); |
508 |
> |
assertSame(ints[i], q.poll()); |
509 |
|
} |
510 |
|
} |
511 |
|
|
512 |
|
/** |
513 |
< |
* toArray(null) throws NullPointerException |
561 |
< |
*/ |
562 |
< |
public void testToArray_BadArg() { |
563 |
< |
try { |
564 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
565 |
< |
Object o[] = q.toArray(null); |
566 |
< |
shouldThrow(); |
567 |
< |
} catch (NullPointerException success) {} |
568 |
< |
} |
569 |
< |
|
570 |
< |
/** |
571 |
< |
* toArray(incompatible array type) throws CCE |
513 |
> |
* toArray(incompatible array type) throws ArrayStoreException |
514 |
|
*/ |
515 |
|
public void testToArray1_BadArg() { |
516 |
+ |
LinkedTransferQueue q = populatedQueue(SIZE); |
517 |
|
try { |
518 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
576 |
< |
Object o[] = q.toArray(new String[10]); |
518 |
> |
q.toArray(new String[10]); |
519 |
|
shouldThrow(); |
520 |
|
} catch (ArrayStoreException success) {} |
521 |
|
} |
547 |
|
it.remove(); |
548 |
|
|
549 |
|
it = q.iterator(); |
550 |
< |
assertEquals(it.next(), one); |
551 |
< |
assertEquals(it.next(), three); |
550 |
> |
assertSame(it.next(), one); |
551 |
> |
assertSame(it.next(), three); |
552 |
|
assertFalse(it.hasNext()); |
553 |
|
} |
554 |
|
|
592 |
|
LinkedTransferQueue q = populatedQueue(SIZE); |
593 |
|
String s = q.toString(); |
594 |
|
for (int i = 0; i < SIZE; ++i) { |
595 |
< |
assertTrue(s.indexOf(String.valueOf(i)) >= 0); |
595 |
> |
assertTrue(s.contains(String.valueOf(i))); |
596 |
|
} |
597 |
|
} |
598 |
|
|
601 |
|
*/ |
602 |
|
public void testOfferInExecutor() { |
603 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
604 |
< |
q.add(one); |
663 |
< |
q.add(two); |
604 |
> |
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
605 |
|
ExecutorService executor = Executors.newFixedThreadPool(2); |
606 |
|
|
607 |
|
executor.execute(new CheckedRunnable() { |
608 |
< |
void realRun() { |
609 |
< |
threadAssertTrue(q.offer(three, MEDIUM_DELAY_MS, |
610 |
< |
MILLISECONDS)); |
608 |
> |
public void realRun() throws InterruptedException { |
609 |
> |
threadsStarted.await(); |
610 |
> |
assertTrue(q.offer(one, LONG_DELAY_MS, MILLISECONDS)); |
611 |
|
}}); |
612 |
|
|
613 |
|
executor.execute(new CheckedRunnable() { |
614 |
< |
void realRun() throws InterruptedException { |
615 |
< |
Thread.sleep(SMALL_DELAY_MS); |
616 |
< |
threadAssertEquals(one, q.take()); |
614 |
> |
public void realRun() throws InterruptedException { |
615 |
> |
threadsStarted.await(); |
616 |
> |
assertSame(one, q.take()); |
617 |
> |
checkEmpty(q); |
618 |
|
}}); |
619 |
|
|
620 |
|
joinPool(executor); |
625 |
|
*/ |
626 |
|
public void testPollInExecutor() { |
627 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
628 |
+ |
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
629 |
|
ExecutorService executor = Executors.newFixedThreadPool(2); |
630 |
|
|
631 |
|
executor.execute(new CheckedRunnable() { |
632 |
< |
void realRun() throws InterruptedException { |
633 |
< |
threadAssertNull(q.poll()); |
634 |
< |
threadAssertTrue(null != q.poll(MEDIUM_DELAY_MS, |
635 |
< |
MILLISECONDS)); |
636 |
< |
threadAssertTrue(q.isEmpty()); |
632 |
> |
public void realRun() throws InterruptedException { |
633 |
> |
assertNull(q.poll()); |
634 |
> |
threadsStarted.await(); |
635 |
> |
assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
636 |
> |
checkEmpty(q); |
637 |
|
}}); |
638 |
|
|
639 |
|
executor.execute(new CheckedRunnable() { |
640 |
< |
void realRun() throws InterruptedException { |
641 |
< |
Thread.sleep(SMALL_DELAY_MS); |
640 |
> |
public void realRun() throws InterruptedException { |
641 |
> |
threadsStarted.await(); |
642 |
|
q.put(one); |
643 |
|
}}); |
644 |
|
|
664 |
|
LinkedTransferQueue r = (LinkedTransferQueue) in.readObject(); |
665 |
|
|
666 |
|
assertEquals(q.size(), r.size()); |
667 |
+ |
assertEquals(q.toString(), r.toString()); |
668 |
+ |
assertTrue(Arrays.equals(q.toArray(), r.toArray())); |
669 |
|
while (!q.isEmpty()) { |
670 |
|
assertEquals(q.remove(), r.remove()); |
671 |
|
} |
672 |
|
} |
673 |
|
|
674 |
|
/** |
730 |
– |
* drainTo(null) throws NullPointerException |
731 |
– |
*/ |
732 |
– |
public void testDrainToNull() { |
733 |
– |
LinkedTransferQueue q = populatedQueue(SIZE); |
734 |
– |
try { |
735 |
– |
q.drainTo(null); |
736 |
– |
shouldThrow(); |
737 |
– |
} catch (NullPointerException success) {} |
738 |
– |
} |
739 |
– |
|
740 |
– |
/** |
741 |
– |
* drainTo(this) throws IllegalArgumentException |
742 |
– |
*/ |
743 |
– |
public void testDrainToSelf() { |
744 |
– |
LinkedTransferQueue q = populatedQueue(SIZE); |
745 |
– |
try { |
746 |
– |
q.drainTo(q); |
747 |
– |
shouldThrow(); |
748 |
– |
} catch (IllegalArgumentException success) {} |
749 |
– |
} |
750 |
– |
|
751 |
– |
/** |
675 |
|
* drainTo(c) empties queue into another collection c |
676 |
|
*/ |
677 |
|
public void testDrainTo() { |
703 |
|
public void testDrainToWithActivePut() throws InterruptedException { |
704 |
|
final LinkedTransferQueue q = populatedQueue(SIZE); |
705 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
706 |
< |
void realRun() { |
706 |
> |
public void realRun() { |
707 |
|
q.put(SIZE + 1); |
708 |
|
}}); |
709 |
|
ArrayList l = new ArrayList(); |
712 |
|
for (int i = 0; i < SIZE; ++i) { |
713 |
|
assertEquals(l.get(i), i); |
714 |
|
} |
715 |
< |
t.join(); |
715 |
> |
awaitTermination(t, MEDIUM_DELAY_MS); |
716 |
|
assertTrue(q.size() + l.size() >= SIZE); |
717 |
|
} |
718 |
|
|
719 |
|
/** |
720 |
< |
* drainTo(null, n) throws NullPointerException |
798 |
< |
*/ |
799 |
< |
public void testDrainToNullN() { |
800 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
801 |
< |
try { |
802 |
< |
q.drainTo(null, SIZE); |
803 |
< |
shouldThrow(); |
804 |
< |
} catch (NullPointerException success) {} |
805 |
< |
} |
806 |
< |
|
807 |
< |
/** |
808 |
< |
* drainTo(this, n) throws IllegalArgumentException |
809 |
< |
*/ |
810 |
< |
public void testDrainToSelfN() { |
811 |
< |
LinkedTransferQueue q = populatedQueue(SIZE); |
812 |
< |
try { |
813 |
< |
q.drainTo(q, SIZE); |
814 |
< |
shouldThrow(); |
815 |
< |
} catch (IllegalArgumentException success) {} |
816 |
< |
} |
817 |
< |
|
818 |
< |
/** |
819 |
< |
* drainTo(c, n) empties first max {n, size} elements of queue into c |
720 |
> |
* drainTo(c, n) empties first min(n, size) elements of queue into c |
721 |
|
*/ |
722 |
|
public void testDrainToN() { |
723 |
|
LinkedTransferQueue q = new LinkedTransferQueue(); |
746 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
747 |
|
assertEquals(q.getWaitingConsumerCount(), 0); |
748 |
|
assertFalse(q.hasWaitingConsumer()); |
749 |
+ |
final CountDownLatch threadStarted = new CountDownLatch(1); |
750 |
|
|
751 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
752 |
< |
void realRun() throws InterruptedException { |
753 |
< |
Thread.sleep(SMALL_DELAY_MS); |
754 |
< |
threadAssertTrue(q.hasWaitingConsumer()); |
755 |
< |
threadAssertEquals(q.getWaitingConsumerCount(), 1); |
756 |
< |
threadAssertTrue(q.offer(new Object())); |
855 |
< |
threadAssertFalse(q.hasWaitingConsumer()); |
856 |
< |
threadAssertEquals(q.getWaitingConsumerCount(), 0); |
752 |
> |
public void realRun() throws InterruptedException { |
753 |
> |
threadStarted.countDown(); |
754 |
> |
assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
755 |
> |
assertEquals(q.getWaitingConsumerCount(), 0); |
756 |
> |
assertFalse(q.hasWaitingConsumer()); |
757 |
|
}}); |
758 |
|
|
759 |
< |
assertTrue(q.poll(LONG_DELAY_MS, MILLISECONDS) != null); |
759 |
> |
threadStarted.await(); |
760 |
> |
waitForThreadToEnterWaitState(t, SMALL_DELAY_MS); |
761 |
> |
assertEquals(q.getWaitingConsumerCount(), 1); |
762 |
> |
assertTrue(q.hasWaitingConsumer()); |
763 |
> |
|
764 |
> |
assertTrue(q.offer(one)); |
765 |
|
assertEquals(q.getWaitingConsumerCount(), 0); |
766 |
|
assertFalse(q.hasWaitingConsumer()); |
767 |
< |
t.join(); |
767 |
> |
|
768 |
> |
awaitTermination(t, MEDIUM_DELAY_MS); |
769 |
|
} |
770 |
|
|
771 |
|
/** |
786 |
|
public void testTransfer2() throws InterruptedException { |
787 |
|
final LinkedTransferQueue<Integer> q |
788 |
|
= new LinkedTransferQueue<Integer>(); |
789 |
+ |
final CountDownLatch threadStarted = new CountDownLatch(1); |
790 |
|
|
791 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
792 |
< |
void realRun() throws InterruptedException { |
793 |
< |
q.transfer(SIZE); |
794 |
< |
threadAssertTrue(q.isEmpty()); |
792 |
> |
public void realRun() throws InterruptedException { |
793 |
> |
threadStarted.countDown(); |
794 |
> |
q.transfer(five); |
795 |
> |
checkEmpty(q); |
796 |
|
}}); |
797 |
|
|
798 |
< |
Thread.sleep(SHORT_DELAY_MS); |
798 |
> |
threadStarted.await(); |
799 |
> |
waitForThreadToEnterWaitState(t, SMALL_DELAY_MS); |
800 |
|
assertEquals(1, q.size()); |
801 |
< |
assertEquals(SIZE, (int) q.poll()); |
802 |
< |
assertTrue(q.isEmpty()); |
803 |
< |
t.join(); |
801 |
> |
assertSame(five, q.poll()); |
802 |
> |
checkEmpty(q); |
803 |
> |
awaitTermination(t, MEDIUM_DELAY_MS); |
804 |
|
} |
805 |
|
|
806 |
|
/** |
811 |
|
= new LinkedTransferQueue<Integer>(); |
812 |
|
|
813 |
|
Thread first = newStartedThread(new CheckedRunnable() { |
814 |
< |
void realRun() throws InterruptedException { |
815 |
< |
Integer i = SIZE + 1; |
816 |
< |
q.transfer(i); |
817 |
< |
threadAssertTrue(!q.contains(i)); |
909 |
< |
threadAssertEquals(1, q.size()); |
814 |
> |
public void realRun() throws InterruptedException { |
815 |
> |
q.transfer(four); |
816 |
> |
assertTrue(!q.contains(four)); |
817 |
> |
assertEquals(1, q.size()); |
818 |
|
}}); |
819 |
|
|
820 |
|
Thread interruptedThread = newStartedThread( |
821 |
|
new CheckedInterruptedRunnable() { |
822 |
< |
void realRun() throws InterruptedException { |
823 |
< |
while (q.size() == 0) |
822 |
> |
public void realRun() throws InterruptedException { |
823 |
> |
while (q.isEmpty()) |
824 |
|
Thread.yield(); |
825 |
< |
q.transfer(SIZE); |
825 |
> |
q.transfer(five); |
826 |
|
}}); |
827 |
|
|
828 |
|
while (q.size() < 2) |
829 |
|
Thread.yield(); |
830 |
|
assertEquals(2, q.size()); |
831 |
< |
assertEquals(SIZE + 1, (int) q.poll()); |
831 |
> |
assertSame(four, q.poll()); |
832 |
|
first.join(); |
833 |
|
assertEquals(1, q.size()); |
834 |
|
interruptedThread.interrupt(); |
835 |
|
interruptedThread.join(); |
836 |
< |
assertEquals(0, q.size()); |
929 |
< |
assertTrue(q.isEmpty()); |
836 |
> |
checkEmpty(q); |
837 |
|
} |
838 |
|
|
839 |
|
/** |
844 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
845 |
|
|
846 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
847 |
< |
void realRun() throws InterruptedException { |
847 |
> |
public void realRun() throws InterruptedException { |
848 |
|
q.transfer(four); |
849 |
< |
threadAssertFalse(q.contains(four)); |
850 |
< |
threadAssertEquals(three, q.poll()); |
849 |
> |
assertFalse(q.contains(four)); |
850 |
> |
assertSame(three, q.poll()); |
851 |
|
}}); |
852 |
|
|
853 |
< |
Thread.sleep(SHORT_DELAY_MS); |
853 |
> |
while (q.isEmpty()) |
854 |
> |
Thread.yield(); |
855 |
> |
assertFalse(q.isEmpty()); |
856 |
> |
assertEquals(1, q.size()); |
857 |
|
assertTrue(q.offer(three)); |
858 |
< |
assertEquals(four, q.poll()); |
859 |
< |
t.join(); |
858 |
> |
assertSame(four, q.poll()); |
859 |
> |
awaitTermination(t, MEDIUM_DELAY_MS); |
860 |
|
} |
861 |
|
|
862 |
|
/** |
868 |
|
= new LinkedTransferQueue<Integer>(); |
869 |
|
|
870 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
871 |
< |
void realRun() throws InterruptedException { |
872 |
< |
q.transfer(SIZE); |
871 |
> |
public void realRun() throws InterruptedException { |
872 |
> |
q.transfer(four); |
873 |
|
checkEmpty(q); |
874 |
|
}}); |
875 |
|
|
876 |
< |
Thread.sleep(SHORT_DELAY_MS); |
877 |
< |
assertEquals(SIZE, (int) q.take()); |
876 |
> |
while (q.isEmpty()) |
877 |
> |
Thread.yield(); |
878 |
> |
assertFalse(q.isEmpty()); |
879 |
> |
assertEquals(1, q.size()); |
880 |
> |
assertSame(four, q.take()); |
881 |
|
checkEmpty(q); |
882 |
< |
t.join(); |
882 |
> |
awaitTermination(t, MEDIUM_DELAY_MS); |
883 |
|
} |
884 |
|
|
885 |
|
/** |
913 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
914 |
|
|
915 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
916 |
< |
void realRun() { |
916 |
> |
public void realRun() { |
917 |
|
while (! q.hasWaitingConsumer()) |
918 |
|
Thread.yield(); |
919 |
< |
threadAssertTrue(q.hasWaitingConsumer()); |
920 |
< |
threadAssertTrue(q.isEmpty()); |
921 |
< |
threadAssertTrue(q.size() == 0); |
1009 |
< |
threadAssertTrue(q.tryTransfer(hotPotato)); |
919 |
> |
assertTrue(q.hasWaitingConsumer()); |
920 |
> |
checkEmpty(q); |
921 |
> |
assertTrue(q.tryTransfer(hotPotato)); |
922 |
|
}}); |
923 |
|
|
924 |
< |
assertTrue(q.poll(MEDIUM_DELAY_MS, MILLISECONDS) == hotPotato); |
924 |
> |
assertSame(hotPotato, q.poll(MEDIUM_DELAY_MS, MILLISECONDS)); |
925 |
|
checkEmpty(q); |
926 |
< |
t.join(); |
926 |
> |
awaitTermination(t, MEDIUM_DELAY_MS); |
927 |
|
} |
928 |
|
|
929 |
|
/** |
935 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
936 |
|
|
937 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
938 |
< |
void realRun() { |
938 |
> |
public void realRun() { |
939 |
|
while (! q.hasWaitingConsumer()) |
940 |
|
Thread.yield(); |
941 |
< |
threadAssertTrue(q.hasWaitingConsumer()); |
942 |
< |
threadAssertTrue(q.isEmpty()); |
943 |
< |
threadAssertTrue(q.size() == 0); |
1032 |
< |
threadAssertTrue(q.tryTransfer(hotPotato)); |
941 |
> |
assertTrue(q.hasWaitingConsumer()); |
942 |
> |
checkEmpty(q); |
943 |
> |
assertTrue(q.tryTransfer(hotPotato)); |
944 |
|
}}); |
945 |
|
|
946 |
< |
assertTrue(q.take() == hotPotato); |
946 |
> |
assertSame(q.take(), hotPotato); |
947 |
|
checkEmpty(q); |
948 |
< |
t.join(); |
948 |
> |
awaitTermination(t, MEDIUM_DELAY_MS); |
949 |
|
} |
950 |
|
|
951 |
|
/** |
952 |
< |
* tryTransfer waits the amount given if interrupted, and |
1042 |
< |
* throws interrupted exception |
952 |
> |
* tryTransfer blocks interruptibly if no takers |
953 |
|
*/ |
954 |
|
public void testTryTransfer5() throws InterruptedException { |
955 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
956 |
+ |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
957 |
+ |
assertTrue(q.isEmpty()); |
958 |
|
|
959 |
< |
Thread toInterrupt = newStartedThread(new CheckedInterruptedRunnable() { |
960 |
< |
void realRun() throws InterruptedException { |
961 |
< |
q.tryTransfer(new Object(), LONG_DELAY_MS, MILLISECONDS); |
959 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
960 |
> |
public void realRun() throws InterruptedException { |
961 |
> |
Thread.currentThread().interrupt(); |
962 |
> |
try { |
963 |
> |
q.tryTransfer(new Object(), LONG_DELAY_MS, MILLISECONDS); |
964 |
> |
shouldThrow(); |
965 |
> |
} catch (InterruptedException success) {} |
966 |
> |
assertFalse(Thread.interrupted()); |
967 |
> |
|
968 |
> |
pleaseInterrupt.countDown(); |
969 |
> |
try { |
970 |
> |
q.tryTransfer(new Object(), LONG_DELAY_MS, MILLISECONDS); |
971 |
> |
shouldThrow(); |
972 |
> |
} catch (InterruptedException success) {} |
973 |
> |
assertFalse(Thread.interrupted()); |
974 |
|
}}); |
975 |
|
|
976 |
< |
Thread.sleep(SMALL_DELAY_MS); |
977 |
< |
toInterrupt.interrupt(); |
978 |
< |
toInterrupt.join(); |
976 |
> |
await(pleaseInterrupt); |
977 |
> |
assertThreadStaysAlive(t); |
978 |
> |
t.interrupt(); |
979 |
> |
awaitTermination(t); |
980 |
> |
checkEmpty(q); |
981 |
|
} |
982 |
|
|
983 |
|
/** |
984 |
< |
* tryTransfer gives up after the timeout and return false |
984 |
> |
* tryTransfer gives up after the timeout and returns false |
985 |
|
*/ |
986 |
|
public void testTryTransfer6() throws InterruptedException { |
987 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
988 |
|
|
989 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
990 |
< |
void realRun() throws InterruptedException { |
991 |
< |
threadAssertFalse |
992 |
< |
(q.tryTransfer(new Object(), |
993 |
< |
SHORT_DELAY_MS, MILLISECONDS)); |
990 |
> |
public void realRun() throws InterruptedException { |
991 |
> |
long t0 = System.nanoTime(); |
992 |
> |
assertFalse(q.tryTransfer(new Object(), |
993 |
> |
timeoutMillis(), MILLISECONDS)); |
994 |
> |
assertTrue(millisElapsedSince(t0) >= timeoutMillis()); |
995 |
> |
checkEmpty(q); |
996 |
|
}}); |
997 |
|
|
998 |
< |
Thread.sleep(SMALL_DELAY_MS); |
998 |
> |
awaitTermination(t); |
999 |
|
checkEmpty(q); |
1072 |
– |
t.join(); |
1000 |
|
} |
1001 |
|
|
1002 |
|
/** |
1008 |
|
assertTrue(q.offer(four)); |
1009 |
|
|
1010 |
|
Thread t = newStartedThread(new CheckedRunnable() { |
1011 |
< |
void realRun() throws InterruptedException { |
1012 |
< |
threadAssertTrue(q.tryTransfer(five, |
1013 |
< |
MEDIUM_DELAY_MS, MILLISECONDS)); |
1087 |
< |
threadAssertTrue(q.isEmpty()); |
1011 |
> |
public void realRun() throws InterruptedException { |
1012 |
> |
assertTrue(q.tryTransfer(five, MEDIUM_DELAY_MS, MILLISECONDS)); |
1013 |
> |
checkEmpty(q); |
1014 |
|
}}); |
1015 |
|
|
1016 |
< |
Thread.sleep(SHORT_DELAY_MS); |
1016 |
> |
while (q.size() != 2) |
1017 |
> |
Thread.yield(); |
1018 |
|
assertEquals(2, q.size()); |
1019 |
< |
assertEquals(four, q.poll()); |
1020 |
< |
assertEquals(five, q.poll()); |
1019 |
> |
assertSame(four, q.poll()); |
1020 |
> |
assertSame(five, q.poll()); |
1021 |
|
checkEmpty(q); |
1022 |
< |
t.join(); |
1022 |
> |
awaitTermination(t, MEDIUM_DELAY_MS); |
1023 |
|
} |
1024 |
|
|
1025 |
|
/** |
1026 |
< |
* tryTransfer attempts to enqueue into the q and fails returning |
1027 |
< |
* false not enqueueing and the successive poll is null |
1026 |
> |
* tryTransfer attempts to enqueue into the queue and fails |
1027 |
> |
* returning false not enqueueing and the successive poll is null |
1028 |
|
*/ |
1029 |
|
public void testTryTransfer8() throws InterruptedException { |
1030 |
|
final LinkedTransferQueue q = new LinkedTransferQueue(); |
1031 |
|
assertTrue(q.offer(four)); |
1032 |
|
assertEquals(1, q.size()); |
1033 |
< |
assertFalse(q.tryTransfer(five, SHORT_DELAY_MS, MILLISECONDS)); |
1033 |
> |
long t0 = System.nanoTime(); |
1034 |
> |
assertFalse(q.tryTransfer(five, timeoutMillis(), MILLISECONDS)); |
1035 |
> |
assertTrue(millisElapsedSince(t0) >= timeoutMillis()); |
1036 |
|
assertEquals(1, q.size()); |
1037 |
< |
assertEquals(four, q.poll()); |
1037 |
> |
assertSame(four, q.poll()); |
1038 |
|
assertNull(q.poll()); |
1039 |
|
checkEmpty(q); |
1040 |
|
} |
1041 |
|
|
1042 |
|
private LinkedTransferQueue<Integer> populatedQueue(int n) { |
1043 |
|
LinkedTransferQueue<Integer> q = new LinkedTransferQueue<Integer>(); |
1044 |
< |
assertTrue(q.isEmpty()); |
1044 |
> |
checkEmpty(q); |
1045 |
|
for (int i = 0; i < n; i++) { |
1046 |
|
assertEquals(i, q.size()); |
1047 |
|
assertTrue(q.offer(i)); |