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 |
|
*/ |
6 |
|
|
7 |
|
import junit.framework.*; |
8 |
< |
import java.util.*; |
9 |
< |
import java.util.concurrent.*; |
8 |
> |
import java.util.Arrays; |
9 |
> |
import java.util.ArrayList; |
10 |
> |
import java.util.Collection; |
11 |
> |
import java.util.Deque; |
12 |
> |
import java.util.Iterator; |
13 |
> |
import java.util.NoSuchElementException; |
14 |
> |
import java.util.Queue; |
15 |
> |
import java.util.concurrent.BlockingDeque; |
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.LinkedBlockingDeque; |
21 |
|
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
11 |
– |
import java.io.*; |
22 |
|
|
23 |
|
public class LinkedBlockingDequeTest extends JSR166TestCase { |
24 |
|
|
30 |
|
|
31 |
|
public static class Bounded extends BlockingQueueTest { |
32 |
|
protected BlockingQueue emptyCollection() { |
33 |
< |
return new LinkedBlockingDeque(20); |
33 |
> |
return new LinkedBlockingDeque(SIZE); |
34 |
|
} |
35 |
|
} |
36 |
|
|
45 |
|
} |
46 |
|
|
47 |
|
/** |
48 |
< |
* Create a deque of given size containing consecutive |
48 |
> |
* Returns a new deque of given size containing consecutive |
49 |
|
* Integers 0 ... n. |
50 |
|
*/ |
51 |
< |
private LinkedBlockingDeque populatedDeque(int n) { |
52 |
< |
LinkedBlockingDeque q = new LinkedBlockingDeque(n); |
51 |
> |
private LinkedBlockingDeque<Integer> populatedDeque(int n) { |
52 |
> |
LinkedBlockingDeque<Integer> q = |
53 |
> |
new LinkedBlockingDeque<Integer>(n); |
54 |
|
assertTrue(q.isEmpty()); |
55 |
|
for (int i = 0; i < n; i++) |
56 |
|
assertTrue(q.offer(new Integer(i))); |
90 |
|
} |
91 |
|
|
92 |
|
/** |
93 |
< |
* offer(null) throws NPE |
93 |
> |
* offerFirst(null) throws NullPointerException |
94 |
|
*/ |
95 |
|
public void testOfferFirstNull() { |
96 |
+ |
LinkedBlockingDeque q = new LinkedBlockingDeque(); |
97 |
|
try { |
86 |
– |
LinkedBlockingDeque q = new LinkedBlockingDeque(); |
98 |
|
q.offerFirst(null); |
99 |
|
shouldThrow(); |
100 |
|
} catch (NullPointerException success) {} |
101 |
|
} |
102 |
|
|
103 |
|
/** |
104 |
+ |
* offerLast(null) throws NullPointerException |
105 |
+ |
*/ |
106 |
+ |
public void testOfferLastNull() { |
107 |
+ |
LinkedBlockingDeque q = new LinkedBlockingDeque(); |
108 |
+ |
try { |
109 |
+ |
q.offerLast(null); |
110 |
+ |
shouldThrow(); |
111 |
+ |
} catch (NullPointerException success) {} |
112 |
+ |
} |
113 |
+ |
|
114 |
+ |
/** |
115 |
|
* OfferFirst succeeds |
116 |
|
*/ |
117 |
|
public void testOfferFirst() { |
130 |
|
} |
131 |
|
|
132 |
|
/** |
133 |
< |
* pollFirst succeeds unless empty |
133 |
> |
* pollFirst succeeds unless empty |
134 |
|
*/ |
135 |
|
public void testPollFirst() { |
136 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
141 |
|
} |
142 |
|
|
143 |
|
/** |
144 |
< |
* pollLast succeeds unless empty |
144 |
> |
* pollLast succeeds unless empty |
145 |
|
*/ |
146 |
|
public void testPollLast() { |
147 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
152 |
|
} |
153 |
|
|
154 |
|
/** |
155 |
< |
* peekFirst returns next element, or null if empty |
155 |
> |
* peekFirst returns next element, or null if empty |
156 |
|
*/ |
157 |
|
public void testPeekFirst() { |
158 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
166 |
|
} |
167 |
|
|
168 |
|
/** |
169 |
< |
* peek returns next element, or null if empty |
169 |
> |
* peek returns next element, or null if empty |
170 |
|
*/ |
171 |
|
public void testPeek() { |
172 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
180 |
|
} |
181 |
|
|
182 |
|
/** |
183 |
< |
* peekLast returns next element, or null if empty |
183 |
> |
* peekLast returns next element, or null if empty |
184 |
|
*/ |
185 |
|
public void testPeekLast() { |
186 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
210 |
|
} |
211 |
|
|
212 |
|
/** |
213 |
< |
* getLast() returns last element, or throws NSEE if empty |
213 |
> |
* getLast() returns last element, or throws NSEE if empty |
214 |
|
*/ |
215 |
|
public void testLastElement() { |
216 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
256 |
|
} |
257 |
|
|
258 |
|
/** |
259 |
< |
* remove removes next element, or throws NSEE if empty |
259 |
> |
* remove removes next element, or throws NSEE if empty |
260 |
|
*/ |
261 |
|
public void testRemove() { |
262 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
319 |
|
assertSame(four, q.peekLast()); |
320 |
|
} |
321 |
|
|
300 |
– |
|
322 |
|
/** |
323 |
|
* A new deque has the indicated capacity, or Integer.MAX_VALUE if |
324 |
|
* none given |
329 |
|
} |
330 |
|
|
331 |
|
/** |
332 |
< |
* Constructor throws IAE if capacity argument nonpositive |
332 |
> |
* Constructor throws IllegalArgumentException if capacity argument nonpositive |
333 |
|
*/ |
334 |
|
public void testConstructor2() { |
335 |
|
try { |
336 |
< |
LinkedBlockingDeque q = new LinkedBlockingDeque(0); |
336 |
> |
new LinkedBlockingDeque(0); |
337 |
|
shouldThrow(); |
338 |
|
} catch (IllegalArgumentException success) {} |
339 |
|
} |
340 |
|
|
341 |
|
/** |
342 |
< |
* Initializing from null Collection throws NPE |
342 |
> |
* Initializing from null Collection throws NullPointerException |
343 |
|
*/ |
344 |
|
public void testConstructor3() { |
345 |
|
try { |
346 |
< |
LinkedBlockingDeque q = new LinkedBlockingDeque(null); |
346 |
> |
new LinkedBlockingDeque(null); |
347 |
|
shouldThrow(); |
348 |
|
} catch (NullPointerException success) {} |
349 |
|
} |
350 |
|
|
351 |
|
/** |
352 |
< |
* Initializing from Collection of null elements throws NPE |
352 |
> |
* Initializing from Collection of null elements throws NullPointerException |
353 |
|
*/ |
354 |
|
public void testConstructor4() { |
355 |
+ |
Collection<Integer> elements = Arrays.asList(new Integer[SIZE]); |
356 |
|
try { |
357 |
< |
Integer[] ints = new Integer[SIZE]; |
336 |
< |
LinkedBlockingDeque q = new LinkedBlockingDeque(Arrays.asList(ints)); |
357 |
> |
new LinkedBlockingDeque(elements); |
358 |
|
shouldThrow(); |
359 |
|
} catch (NullPointerException success) {} |
360 |
|
} |
361 |
|
|
362 |
|
/** |
363 |
< |
* Initializing from Collection with some null elements throws NPE |
363 |
> |
* Initializing from Collection with some null elements throws |
364 |
> |
* NullPointerException |
365 |
|
*/ |
366 |
|
public void testConstructor5() { |
367 |
+ |
Integer[] ints = new Integer[SIZE]; |
368 |
+ |
for (int i = 0; i < SIZE-1; ++i) |
369 |
+ |
ints[i] = i; |
370 |
+ |
Collection<Integer> elements = Arrays.asList(ints); |
371 |
|
try { |
372 |
< |
Integer[] ints = new Integer[SIZE]; |
347 |
< |
for (int i = 0; i < SIZE-1; ++i) |
348 |
< |
ints[i] = new Integer(i); |
349 |
< |
LinkedBlockingDeque q = new LinkedBlockingDeque(Arrays.asList(ints)); |
372 |
> |
new LinkedBlockingDeque(elements); |
373 |
|
shouldThrow(); |
374 |
|
} catch (NullPointerException success) {} |
375 |
|
} |
380 |
|
public void testConstructor6() { |
381 |
|
Integer[] ints = new Integer[SIZE]; |
382 |
|
for (int i = 0; i < SIZE; ++i) |
383 |
< |
ints[i] = new Integer(i); |
383 |
> |
ints[i] = i; |
384 |
|
LinkedBlockingDeque q = new LinkedBlockingDeque(Arrays.asList(ints)); |
385 |
|
for (int i = 0; i < SIZE; ++i) |
386 |
|
assertEquals(ints[i], q.poll()); |
419 |
|
} |
420 |
|
|
421 |
|
/** |
399 |
– |
* offer(null) throws NPE |
400 |
– |
*/ |
401 |
– |
public void testOfferNull() { |
402 |
– |
try { |
403 |
– |
LinkedBlockingDeque q = new LinkedBlockingDeque(1); |
404 |
– |
q.offer(null); |
405 |
– |
shouldThrow(); |
406 |
– |
} catch (NullPointerException success) {} |
407 |
– |
} |
408 |
– |
|
409 |
– |
/** |
410 |
– |
* add(null) throws NPE |
411 |
– |
*/ |
412 |
– |
public void testAddNull() { |
413 |
– |
try { |
414 |
– |
LinkedBlockingDeque q = new LinkedBlockingDeque(1); |
415 |
– |
q.add(null); |
416 |
– |
shouldThrow(); |
417 |
– |
} catch (NullPointerException success) {} |
418 |
– |
} |
419 |
– |
|
420 |
– |
/** |
422 |
|
* push(null) throws NPE |
423 |
|
*/ |
424 |
|
public void testPushNull() { |
456 |
|
assertSame(four, q.peekFirst()); |
457 |
|
} |
458 |
|
|
458 |
– |
|
459 |
|
/** |
460 |
< |
* pop removes next element, or throws NSEE if empty |
460 |
> |
* pop removes next element, or throws NSEE if empty |
461 |
|
*/ |
462 |
|
public void testPop() { |
463 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
470 |
|
} catch (NoSuchElementException success) {} |
471 |
|
} |
472 |
|
|
473 |
– |
|
473 |
|
/** |
474 |
|
* Offer succeeds if not full; fails if full |
475 |
|
*/ |
483 |
|
* add succeeds if not full; throws ISE if full |
484 |
|
*/ |
485 |
|
public void testAdd() { |
486 |
+ |
LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE); |
487 |
+ |
for (int i = 0; i < SIZE; ++i) |
488 |
+ |
assertTrue(q.add(new Integer(i))); |
489 |
+ |
assertEquals(0, q.remainingCapacity()); |
490 |
|
try { |
488 |
– |
LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE); |
489 |
– |
for (int i = 0; i < SIZE; ++i) { |
490 |
– |
assertTrue(q.add(new Integer(i))); |
491 |
– |
} |
492 |
– |
assertEquals(0, q.remainingCapacity()); |
491 |
|
q.add(new Integer(SIZE)); |
492 |
|
shouldThrow(); |
493 |
|
} catch (IllegalStateException success) {} |
494 |
|
} |
495 |
|
|
496 |
|
/** |
499 |
– |
* addAll(null) throws NPE |
500 |
– |
*/ |
501 |
– |
public void testAddAll1() { |
502 |
– |
try { |
503 |
– |
LinkedBlockingDeque q = new LinkedBlockingDeque(1); |
504 |
– |
q.addAll(null); |
505 |
– |
shouldThrow(); |
506 |
– |
} catch (NullPointerException success) {} |
507 |
– |
} |
508 |
– |
|
509 |
– |
/** |
497 |
|
* addAll(this) throws IAE |
498 |
|
*/ |
499 |
|
public void testAddAllSelf() { |
500 |
+ |
LinkedBlockingDeque q = populatedDeque(SIZE); |
501 |
|
try { |
514 |
– |
LinkedBlockingDeque q = populatedDeque(SIZE); |
502 |
|
q.addAll(q); |
503 |
|
shouldThrow(); |
504 |
|
} catch (IllegalArgumentException success) {} |
505 |
|
} |
506 |
|
|
507 |
|
/** |
521 |
– |
* addAll of a collection with null elements throws NPE |
522 |
– |
*/ |
523 |
– |
public void testAddAll2() { |
524 |
– |
try { |
525 |
– |
LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE); |
526 |
– |
Integer[] ints = new Integer[SIZE]; |
527 |
– |
q.addAll(Arrays.asList(ints)); |
528 |
– |
shouldThrow(); |
529 |
– |
} catch (NullPointerException success) {} |
530 |
– |
} |
531 |
– |
|
532 |
– |
/** |
508 |
|
* addAll of a collection with any null elements throws NPE after |
509 |
|
* possibly adding some elements |
510 |
|
*/ |
511 |
|
public void testAddAll3() { |
512 |
+ |
LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE); |
513 |
+ |
Integer[] ints = new Integer[SIZE]; |
514 |
+ |
for (int i = 0; i < SIZE-1; ++i) |
515 |
+ |
ints[i] = new Integer(i); |
516 |
+ |
Collection<Integer> elements = Arrays.asList(ints); |
517 |
|
try { |
518 |
< |
LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE); |
539 |
< |
Integer[] ints = new Integer[SIZE]; |
540 |
< |
for (int i = 0; i < SIZE-1; ++i) |
541 |
< |
ints[i] = new Integer(i); |
542 |
< |
q.addAll(Arrays.asList(ints)); |
518 |
> |
q.addAll(elements); |
519 |
|
shouldThrow(); |
520 |
|
} catch (NullPointerException success) {} |
521 |
|
} |
522 |
|
|
523 |
|
/** |
524 |
< |
* addAll throws ISE if not enough room |
524 |
> |
* addAll throws IllegalStateException if not enough room |
525 |
|
*/ |
526 |
|
public void testAddAll4() { |
527 |
+ |
LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE - 1); |
528 |
+ |
Integer[] ints = new Integer[SIZE]; |
529 |
+ |
for (int i = 0; i < SIZE; ++i) |
530 |
+ |
ints[i] = new Integer(i); |
531 |
+ |
Collection<Integer> elements = Arrays.asList(ints); |
532 |
|
try { |
533 |
< |
LinkedBlockingDeque q = new LinkedBlockingDeque(1); |
553 |
< |
Integer[] ints = new Integer[SIZE]; |
554 |
< |
for (int i = 0; i < SIZE; ++i) |
555 |
< |
ints[i] = new Integer(i); |
556 |
< |
q.addAll(Arrays.asList(ints)); |
533 |
> |
q.addAll(elements); |
534 |
|
shouldThrow(); |
535 |
|
} catch (IllegalStateException success) {} |
536 |
|
} |
550 |
|
assertEquals(ints[i], q.poll()); |
551 |
|
} |
552 |
|
|
576 |
– |
|
577 |
– |
/** |
578 |
– |
* put(null) throws NPE |
579 |
– |
*/ |
580 |
– |
public void testPutNull() throws InterruptedException { |
581 |
– |
try { |
582 |
– |
LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE); |
583 |
– |
q.put(null); |
584 |
– |
shouldThrow(); |
585 |
– |
} catch (NullPointerException success) {} |
586 |
– |
} |
587 |
– |
|
553 |
|
/** |
554 |
|
* all elements successfully put are contained |
555 |
|
*/ |
568 |
|
*/ |
569 |
|
public void testBlockingPut() throws InterruptedException { |
570 |
|
final LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE); |
571 |
< |
Thread t = new Thread(new CheckedRunnable() { |
571 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
572 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
573 |
|
public void realRun() throws InterruptedException { |
574 |
|
for (int i = 0; i < SIZE; ++i) |
575 |
|
q.put(i); |
576 |
|
assertEquals(SIZE, q.size()); |
577 |
|
assertEquals(0, q.remainingCapacity()); |
578 |
+ |
|
579 |
+ |
Thread.currentThread().interrupt(); |
580 |
+ |
try { |
581 |
+ |
q.put(99); |
582 |
+ |
shouldThrow(); |
583 |
+ |
} catch (InterruptedException success) {} |
584 |
+ |
assertFalse(Thread.interrupted()); |
585 |
+ |
|
586 |
+ |
pleaseInterrupt.countDown(); |
587 |
|
try { |
588 |
|
q.put(99); |
589 |
|
shouldThrow(); |
590 |
|
} catch (InterruptedException success) {} |
591 |
+ |
assertFalse(Thread.interrupted()); |
592 |
|
}}); |
593 |
|
|
594 |
< |
t.start(); |
595 |
< |
Thread.sleep(SHORT_DELAY_MS); |
594 |
> |
await(pleaseInterrupt); |
595 |
> |
assertThreadStaysAlive(t); |
596 |
|
t.interrupt(); |
597 |
< |
t.join(); |
597 |
> |
awaitTermination(t); |
598 |
|
assertEquals(SIZE, q.size()); |
599 |
|
assertEquals(0, q.remainingCapacity()); |
600 |
|
} |
601 |
|
|
602 |
|
/** |
603 |
< |
* put blocks waiting for take when full |
603 |
> |
* put blocks interruptibly waiting for take when full |
604 |
|
*/ |
605 |
|
public void testPutWithTake() throws InterruptedException { |
606 |
|
final int capacity = 2; |
607 |
|
final LinkedBlockingDeque q = new LinkedBlockingDeque(capacity); |
608 |
< |
Thread t = new Thread(new CheckedRunnable() { |
608 |
> |
final CountDownLatch pleaseTake = new CountDownLatch(1); |
609 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
610 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
611 |
|
public void realRun() throws InterruptedException { |
612 |
< |
for (int i = 0; i < capacity + 1; i++) |
612 |
> |
for (int i = 0; i < capacity; i++) |
613 |
|
q.put(i); |
614 |
+ |
pleaseTake.countDown(); |
615 |
+ |
q.put(86); |
616 |
+ |
|
617 |
+ |
pleaseInterrupt.countDown(); |
618 |
|
try { |
619 |
|
q.put(99); |
620 |
|
shouldThrow(); |
621 |
|
} catch (InterruptedException success) {} |
622 |
+ |
assertFalse(Thread.interrupted()); |
623 |
|
}}); |
624 |
|
|
625 |
< |
t.start(); |
626 |
< |
Thread.sleep(SHORT_DELAY_MS); |
644 |
< |
assertEquals(q.remainingCapacity(), 0); |
625 |
> |
await(pleaseTake); |
626 |
> |
assertEquals(0, q.remainingCapacity()); |
627 |
|
assertEquals(0, q.take()); |
628 |
< |
Thread.sleep(SHORT_DELAY_MS); |
628 |
> |
|
629 |
> |
await(pleaseInterrupt); |
630 |
> |
assertThreadStaysAlive(t); |
631 |
|
t.interrupt(); |
632 |
< |
t.join(); |
633 |
< |
assertEquals(q.remainingCapacity(), 0); |
632 |
> |
awaitTermination(t); |
633 |
> |
assertEquals(0, q.remainingCapacity()); |
634 |
|
} |
635 |
|
|
636 |
|
/** |
638 |
|
*/ |
639 |
|
public void testTimedOffer() throws InterruptedException { |
640 |
|
final LinkedBlockingDeque q = new LinkedBlockingDeque(2); |
641 |
< |
Thread t = new Thread(new CheckedRunnable() { |
641 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
642 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
643 |
|
public void realRun() throws InterruptedException { |
644 |
|
q.put(new Object()); |
645 |
|
q.put(new Object()); |
646 |
< |
assertFalse(q.offer(new Object(), SHORT_DELAY_MS, MILLISECONDS)); |
646 |
> |
long startTime = System.nanoTime(); |
647 |
> |
assertFalse(q.offer(new Object(), timeoutMillis(), MILLISECONDS)); |
648 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
649 |
> |
pleaseInterrupt.countDown(); |
650 |
|
try { |
651 |
< |
q.offer(new Object(), LONG_DELAY_MS, MILLISECONDS); |
651 |
> |
q.offer(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS); |
652 |
|
shouldThrow(); |
653 |
|
} catch (InterruptedException success) {} |
654 |
|
}}); |
655 |
|
|
656 |
< |
t.start(); |
657 |
< |
Thread.sleep(SMALL_DELAY_MS); |
656 |
> |
await(pleaseInterrupt); |
657 |
> |
assertThreadStaysAlive(t); |
658 |
|
t.interrupt(); |
659 |
< |
t.join(); |
659 |
> |
awaitTermination(t); |
660 |
|
} |
661 |
|
|
662 |
|
/** |
670 |
|
} |
671 |
|
|
672 |
|
/** |
673 |
< |
* take blocks interruptibly when empty |
686 |
< |
*/ |
687 |
< |
public void testTakeFromEmpty() throws InterruptedException { |
688 |
< |
final LinkedBlockingDeque q = new LinkedBlockingDeque(2); |
689 |
< |
Thread t = new ThreadShouldThrow(InterruptedException.class) { |
690 |
< |
public void realRun() throws InterruptedException { |
691 |
< |
q.take(); |
692 |
< |
}}; |
693 |
< |
|
694 |
< |
t.start(); |
695 |
< |
Thread.sleep(SHORT_DELAY_MS); |
696 |
< |
t.interrupt(); |
697 |
< |
t.join(); |
698 |
< |
} |
699 |
< |
|
700 |
< |
/** |
701 |
< |
* Take removes existing elements until empty, then blocks interruptibly |
673 |
> |
* take removes existing elements until empty, then blocks interruptibly |
674 |
|
*/ |
675 |
|
public void testBlockingTake() throws InterruptedException { |
676 |
|
final LinkedBlockingDeque q = populatedDeque(SIZE); |
677 |
< |
Thread t = new Thread(new CheckedRunnable() { |
677 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
678 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
679 |
|
public void realRun() throws InterruptedException { |
680 |
|
for (int i = 0; i < SIZE; ++i) { |
681 |
|
assertEquals(i, q.take()); |
682 |
|
} |
683 |
+ |
|
684 |
+ |
Thread.currentThread().interrupt(); |
685 |
+ |
try { |
686 |
+ |
q.take(); |
687 |
+ |
shouldThrow(); |
688 |
+ |
} catch (InterruptedException success) {} |
689 |
+ |
assertFalse(Thread.interrupted()); |
690 |
+ |
|
691 |
+ |
pleaseInterrupt.countDown(); |
692 |
|
try { |
693 |
|
q.take(); |
694 |
|
shouldThrow(); |
695 |
|
} catch (InterruptedException success) {} |
696 |
+ |
assertFalse(Thread.interrupted()); |
697 |
|
}}); |
698 |
|
|
699 |
< |
t.start(); |
700 |
< |
Thread.sleep(SHORT_DELAY_MS); |
699 |
> |
await(pleaseInterrupt); |
700 |
> |
assertThreadStaysAlive(t); |
701 |
|
t.interrupt(); |
702 |
< |
t.join(); |
702 |
> |
awaitTermination(t); |
703 |
|
} |
704 |
|
|
722 |
– |
|
705 |
|
/** |
706 |
|
* poll succeeds unless empty |
707 |
|
*/ |
730 |
|
public void testTimedPoll() throws InterruptedException { |
731 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
732 |
|
for (int i = 0; i < SIZE; ++i) { |
733 |
< |
assertEquals(i, q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
734 |
< |
} |
735 |
< |
assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
733 |
> |
long startTime = System.nanoTime(); |
734 |
> |
assertEquals(i, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
735 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
736 |
> |
} |
737 |
> |
long startTime = System.nanoTime(); |
738 |
> |
assertNull(q.poll(timeoutMillis(), MILLISECONDS)); |
739 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
740 |
> |
checkEmpty(q); |
741 |
|
} |
742 |
|
|
743 |
|
/** |
745 |
|
* returning timeout status |
746 |
|
*/ |
747 |
|
public void testInterruptedTimedPoll() throws InterruptedException { |
748 |
< |
Thread t = new Thread(new CheckedRunnable() { |
748 |
> |
final BlockingQueue<Integer> q = populatedDeque(SIZE); |
749 |
> |
final CountDownLatch aboutToWait = new CountDownLatch(1); |
750 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
751 |
|
public void realRun() throws InterruptedException { |
763 |
– |
LinkedBlockingDeque q = populatedDeque(SIZE); |
752 |
|
for (int i = 0; i < SIZE; ++i) { |
753 |
< |
assertEquals(i, q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
753 |
> |
long t0 = System.nanoTime(); |
754 |
> |
assertEquals(i, (int) q.poll(LONG_DELAY_MS, MILLISECONDS)); |
755 |
> |
assertTrue(millisElapsedSince(t0) < SMALL_DELAY_MS); |
756 |
|
} |
757 |
+ |
long t0 = System.nanoTime(); |
758 |
+ |
aboutToWait.countDown(); |
759 |
|
try { |
760 |
< |
q.poll(SMALL_DELAY_MS, MILLISECONDS); |
760 |
> |
q.poll(MEDIUM_DELAY_MS, MILLISECONDS); |
761 |
|
shouldThrow(); |
762 |
< |
} catch (InterruptedException success) {} |
762 |
> |
} catch (InterruptedException success) { |
763 |
> |
assertTrue(millisElapsedSince(t0) < MEDIUM_DELAY_MS); |
764 |
> |
} |
765 |
|
}}); |
766 |
|
|
767 |
< |
t.start(); |
768 |
< |
Thread.sleep(SHORT_DELAY_MS); |
767 |
> |
aboutToWait.await(); |
768 |
> |
waitForThreadToEnterWaitState(t, SMALL_DELAY_MS); |
769 |
|
t.interrupt(); |
770 |
< |
t.join(); |
770 |
> |
awaitTermination(t, MEDIUM_DELAY_MS); |
771 |
> |
checkEmpty(q); |
772 |
|
} |
773 |
|
|
774 |
|
/** |
775 |
|
* putFirst(null) throws NPE |
776 |
|
*/ |
777 |
< |
public void testPutFirstNull() throws InterruptedException { |
777 |
> |
public void testPutFirstNull() throws InterruptedException { |
778 |
> |
LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE); |
779 |
|
try { |
784 |
– |
LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE); |
780 |
|
q.putFirst(null); |
781 |
|
shouldThrow(); |
782 |
|
} catch (NullPointerException success) {} |
783 |
< |
} |
783 |
> |
} |
784 |
|
|
785 |
|
/** |
786 |
|
* all elements successfully putFirst are contained |
787 |
|
*/ |
788 |
< |
public void testPutFirst() throws InterruptedException { |
789 |
< |
LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE); |
790 |
< |
for (int i = 0; i < SIZE; ++i) { |
791 |
< |
Integer I = new Integer(i); |
792 |
< |
q.putFirst(I); |
793 |
< |
assertTrue(q.contains(I)); |
794 |
< |
} |
795 |
< |
assertEquals(0, q.remainingCapacity()); |
788 |
> |
public void testPutFirst() throws InterruptedException { |
789 |
> |
LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE); |
790 |
> |
for (int i = 0; i < SIZE; ++i) { |
791 |
> |
Integer I = new Integer(i); |
792 |
> |
q.putFirst(I); |
793 |
> |
assertTrue(q.contains(I)); |
794 |
> |
} |
795 |
> |
assertEquals(0, q.remainingCapacity()); |
796 |
|
} |
797 |
|
|
798 |
|
/** |
800 |
|
*/ |
801 |
|
public void testBlockingPutFirst() throws InterruptedException { |
802 |
|
final LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE); |
803 |
< |
Thread t = new Thread(new CheckedRunnable() { |
803 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
804 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
805 |
|
public void realRun() throws InterruptedException { |
806 |
|
for (int i = 0; i < SIZE; ++i) |
807 |
|
q.putFirst(i); |
808 |
|
assertEquals(SIZE, q.size()); |
809 |
|
assertEquals(0, q.remainingCapacity()); |
810 |
+ |
|
811 |
+ |
Thread.currentThread().interrupt(); |
812 |
|
try { |
813 |
|
q.putFirst(99); |
814 |
|
shouldThrow(); |
815 |
|
} catch (InterruptedException success) {} |
816 |
+ |
assertFalse(Thread.interrupted()); |
817 |
+ |
|
818 |
+ |
pleaseInterrupt.countDown(); |
819 |
+ |
try { |
820 |
+ |
q.putFirst(99); |
821 |
+ |
shouldThrow(); |
822 |
+ |
} catch (InterruptedException success) {} |
823 |
+ |
assertFalse(Thread.interrupted()); |
824 |
|
}}); |
825 |
|
|
826 |
< |
t.start(); |
827 |
< |
Thread.sleep(SHORT_DELAY_MS); |
826 |
> |
await(pleaseInterrupt); |
827 |
> |
assertThreadStaysAlive(t); |
828 |
|
t.interrupt(); |
829 |
< |
t.join(); |
829 |
> |
awaitTermination(t); |
830 |
|
assertEquals(SIZE, q.size()); |
831 |
|
assertEquals(0, q.remainingCapacity()); |
832 |
|
} |
833 |
|
|
834 |
|
/** |
835 |
< |
* putFirst blocks waiting for take when full |
835 |
> |
* putFirst blocks interruptibly waiting for take when full |
836 |
|
*/ |
837 |
|
public void testPutFirstWithTake() throws InterruptedException { |
838 |
|
final int capacity = 2; |
839 |
|
final LinkedBlockingDeque q = new LinkedBlockingDeque(capacity); |
840 |
< |
Thread t = new Thread(new CheckedRunnable() { |
840 |
> |
final CountDownLatch pleaseTake = new CountDownLatch(1); |
841 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
842 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
843 |
|
public void realRun() throws InterruptedException { |
844 |
< |
for (int i = 0; i < capacity + 1; i++) |
844 |
> |
for (int i = 0; i < capacity; i++) |
845 |
|
q.putFirst(i); |
846 |
+ |
pleaseTake.countDown(); |
847 |
+ |
q.putFirst(86); |
848 |
+ |
|
849 |
+ |
pleaseInterrupt.countDown(); |
850 |
|
try { |
851 |
|
q.putFirst(99); |
852 |
|
shouldThrow(); |
853 |
|
} catch (InterruptedException success) {} |
854 |
+ |
assertFalse(Thread.interrupted()); |
855 |
|
}}); |
856 |
|
|
857 |
< |
t.start(); |
858 |
< |
Thread.sleep(SHORT_DELAY_MS); |
846 |
< |
assertEquals(q.remainingCapacity(), 0); |
857 |
> |
await(pleaseTake); |
858 |
> |
assertEquals(0, q.remainingCapacity()); |
859 |
|
assertEquals(capacity - 1, q.take()); |
860 |
< |
Thread.sleep(SHORT_DELAY_MS); |
860 |
> |
|
861 |
> |
await(pleaseInterrupt); |
862 |
> |
assertThreadStaysAlive(t); |
863 |
|
t.interrupt(); |
864 |
< |
t.join(); |
865 |
< |
assertEquals(q.remainingCapacity(), 0); |
864 |
> |
awaitTermination(t); |
865 |
> |
assertEquals(0, q.remainingCapacity()); |
866 |
|
} |
867 |
|
|
868 |
|
/** |
870 |
|
*/ |
871 |
|
public void testTimedOfferFirst() throws InterruptedException { |
872 |
|
final LinkedBlockingDeque q = new LinkedBlockingDeque(2); |
873 |
< |
Thread t = new Thread(new CheckedRunnable() { |
873 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
874 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
875 |
|
public void realRun() throws InterruptedException { |
876 |
|
q.putFirst(new Object()); |
877 |
|
q.putFirst(new Object()); |
878 |
< |
assertFalse(q.offerFirst(new Object(), SHORT_DELAY_MS, MILLISECONDS)); |
878 |
> |
long startTime = System.nanoTime(); |
879 |
> |
assertFalse(q.offerFirst(new Object(), timeoutMillis(), MILLISECONDS)); |
880 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
881 |
> |
pleaseInterrupt.countDown(); |
882 |
|
try { |
883 |
< |
q.offerFirst(new Object(), LONG_DELAY_MS, MILLISECONDS); |
883 |
> |
q.offerFirst(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS); |
884 |
|
shouldThrow(); |
885 |
|
} catch (InterruptedException success) {} |
886 |
|
}}); |
887 |
|
|
888 |
< |
t.start(); |
889 |
< |
Thread.sleep(SMALL_DELAY_MS); |
888 |
> |
await(pleaseInterrupt); |
889 |
> |
assertThreadStaysAlive(t); |
890 |
|
t.interrupt(); |
891 |
< |
t.join(); |
891 |
> |
awaitTermination(t); |
892 |
|
} |
893 |
|
|
894 |
|
/** |
902 |
|
} |
903 |
|
|
904 |
|
/** |
905 |
< |
* takeFirst blocks interruptibly when empty |
905 |
> |
* takeFirst() blocks interruptibly when empty |
906 |
|
*/ |
907 |
< |
public void testTakeFirstFromEmpty() throws InterruptedException { |
908 |
< |
final LinkedBlockingDeque q = new LinkedBlockingDeque(2); |
909 |
< |
Thread t = new ThreadShouldThrow(InterruptedException.class) { |
910 |
< |
public void realRun() throws InterruptedException { |
911 |
< |
q.takeFirst(); |
912 |
< |
}}; |
907 |
> |
public void testTakeFirstFromEmptyBlocksInterruptibly() { |
908 |
> |
final BlockingDeque q = new LinkedBlockingDeque(); |
909 |
> |
final CountDownLatch threadStarted = new CountDownLatch(1); |
910 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
911 |
> |
public void realRun() { |
912 |
> |
threadStarted.countDown(); |
913 |
> |
try { |
914 |
> |
q.takeFirst(); |
915 |
> |
shouldThrow(); |
916 |
> |
} catch (InterruptedException success) {} |
917 |
> |
assertFalse(Thread.interrupted()); |
918 |
> |
}}); |
919 |
|
|
920 |
< |
t.start(); |
921 |
< |
Thread.sleep(SHORT_DELAY_MS); |
920 |
> |
await(threadStarted); |
921 |
> |
assertThreadStaysAlive(t); |
922 |
|
t.interrupt(); |
923 |
< |
t.join(); |
923 |
> |
awaitTermination(t); |
924 |
|
} |
925 |
|
|
926 |
|
/** |
927 |
< |
* TakeFirst removes existing elements until empty, then blocks interruptibly |
927 |
> |
* takeFirst() throws InterruptedException immediately if interrupted |
928 |
> |
* before waiting |
929 |
> |
*/ |
930 |
> |
public void testTakeFirstFromEmptyAfterInterrupt() { |
931 |
> |
final BlockingDeque q = new LinkedBlockingDeque(); |
932 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
933 |
> |
public void realRun() { |
934 |
> |
Thread.currentThread().interrupt(); |
935 |
> |
try { |
936 |
> |
q.takeFirst(); |
937 |
> |
shouldThrow(); |
938 |
> |
} catch (InterruptedException success) {} |
939 |
> |
assertFalse(Thread.interrupted()); |
940 |
> |
}}); |
941 |
> |
|
942 |
> |
awaitTermination(t); |
943 |
> |
} |
944 |
> |
|
945 |
> |
/** |
946 |
> |
* takeLast() blocks interruptibly when empty |
947 |
> |
*/ |
948 |
> |
public void testTakeLastFromEmptyBlocksInterruptibly() { |
949 |
> |
final BlockingDeque q = new LinkedBlockingDeque(); |
950 |
> |
final CountDownLatch threadStarted = new CountDownLatch(1); |
951 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
952 |
> |
public void realRun() { |
953 |
> |
threadStarted.countDown(); |
954 |
> |
try { |
955 |
> |
q.takeLast(); |
956 |
> |
shouldThrow(); |
957 |
> |
} catch (InterruptedException success) {} |
958 |
> |
assertFalse(Thread.interrupted()); |
959 |
> |
}}); |
960 |
> |
|
961 |
> |
await(threadStarted); |
962 |
> |
assertThreadStaysAlive(t); |
963 |
> |
t.interrupt(); |
964 |
> |
awaitTermination(t); |
965 |
> |
} |
966 |
> |
|
967 |
> |
/** |
968 |
> |
* takeLast() throws InterruptedException immediately if interrupted |
969 |
> |
* before waiting |
970 |
> |
*/ |
971 |
> |
public void testTakeLastFromEmptyAfterInterrupt() { |
972 |
> |
final BlockingDeque q = new LinkedBlockingDeque(); |
973 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
974 |
> |
public void realRun() { |
975 |
> |
Thread.currentThread().interrupt(); |
976 |
> |
try { |
977 |
> |
q.takeLast(); |
978 |
> |
shouldThrow(); |
979 |
> |
} catch (InterruptedException success) {} |
980 |
> |
assertFalse(Thread.interrupted()); |
981 |
> |
}}); |
982 |
> |
|
983 |
> |
awaitTermination(t); |
984 |
> |
} |
985 |
> |
|
986 |
> |
/** |
987 |
> |
* takeFirst removes existing elements until empty, then blocks interruptibly |
988 |
|
*/ |
989 |
|
public void testBlockingTakeFirst() throws InterruptedException { |
990 |
|
final LinkedBlockingDeque q = populatedDeque(SIZE); |
991 |
< |
Thread t = new Thread(new CheckedRunnable() { |
991 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
992 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
993 |
|
public void realRun() throws InterruptedException { |
994 |
< |
for (int i = 0; i < SIZE; ++i) |
994 |
> |
for (int i = 0; i < SIZE; ++i) { |
995 |
|
assertEquals(i, q.takeFirst()); |
996 |
+ |
} |
997 |
+ |
|
998 |
+ |
Thread.currentThread().interrupt(); |
999 |
|
try { |
1000 |
|
q.takeFirst(); |
1001 |
|
shouldThrow(); |
1002 |
|
} catch (InterruptedException success) {} |
1003 |
+ |
assertFalse(Thread.interrupted()); |
1004 |
+ |
|
1005 |
+ |
pleaseInterrupt.countDown(); |
1006 |
+ |
try { |
1007 |
+ |
q.takeFirst(); |
1008 |
+ |
shouldThrow(); |
1009 |
+ |
} catch (InterruptedException success) {} |
1010 |
+ |
assertFalse(Thread.interrupted()); |
1011 |
|
}}); |
1012 |
|
|
1013 |
< |
t.start(); |
1014 |
< |
Thread.sleep(SHORT_DELAY_MS); |
1013 |
> |
await(pleaseInterrupt); |
1014 |
> |
assertThreadStaysAlive(t); |
1015 |
|
t.interrupt(); |
1016 |
< |
t.join(); |
1016 |
> |
awaitTermination(t); |
1017 |
|
} |
1018 |
|
|
923 |
– |
|
1019 |
|
/** |
1020 |
|
* timed pollFirst with zero timeout succeeds when non-empty, else times out |
1021 |
|
*/ |
1033 |
|
public void testTimedPollFirst() throws InterruptedException { |
1034 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
1035 |
|
for (int i = 0; i < SIZE; ++i) { |
1036 |
< |
assertEquals(i, q.pollFirst(SHORT_DELAY_MS, MILLISECONDS)); |
1037 |
< |
} |
1038 |
< |
assertNull(q.pollFirst(SHORT_DELAY_MS, MILLISECONDS)); |
1036 |
> |
long startTime = System.nanoTime(); |
1037 |
> |
assertEquals(i, q.pollFirst(LONG_DELAY_MS, MILLISECONDS)); |
1038 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
1039 |
> |
} |
1040 |
> |
long startTime = System.nanoTime(); |
1041 |
> |
assertNull(q.pollFirst(timeoutMillis(), MILLISECONDS)); |
1042 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
1043 |
> |
checkEmpty(q); |
1044 |
|
} |
1045 |
|
|
1046 |
|
/** |
1048 |
|
* returning timeout status |
1049 |
|
*/ |
1050 |
|
public void testInterruptedTimedPollFirst() throws InterruptedException { |
1051 |
< |
Thread t = new Thread(new CheckedRunnable() { |
1051 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
1052 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
1053 |
|
public void realRun() throws InterruptedException { |
1054 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
1055 |
|
for (int i = 0; i < SIZE; ++i) { |
1056 |
< |
assertEquals(i, q.pollFirst(SHORT_DELAY_MS, MILLISECONDS)); |
1056 |
> |
assertEquals(i, q.pollFirst(LONG_DELAY_MS, MILLISECONDS)); |
1057 |
|
} |
1058 |
+ |
|
1059 |
+ |
Thread.currentThread().interrupt(); |
1060 |
|
try { |
1061 |
|
q.pollFirst(SMALL_DELAY_MS, MILLISECONDS); |
1062 |
|
shouldThrow(); |
1063 |
|
} catch (InterruptedException success) {} |
1064 |
+ |
assertFalse(Thread.interrupted()); |
1065 |
+ |
|
1066 |
+ |
pleaseInterrupt.countDown(); |
1067 |
+ |
try { |
1068 |
+ |
q.pollFirst(LONG_DELAY_MS, MILLISECONDS); |
1069 |
+ |
shouldThrow(); |
1070 |
+ |
} catch (InterruptedException success) {} |
1071 |
+ |
assertFalse(Thread.interrupted()); |
1072 |
|
}}); |
1073 |
|
|
1074 |
< |
t.start(); |
1075 |
< |
Thread.sleep(SHORT_DELAY_MS); |
1074 |
> |
await(pleaseInterrupt); |
1075 |
> |
assertThreadStaysAlive(t); |
1076 |
|
t.interrupt(); |
1077 |
< |
t.join(); |
1077 |
> |
awaitTermination(t); |
1078 |
|
} |
1079 |
|
|
1080 |
|
/** |
1081 |
< |
* timed pollFirst before a delayed offerFirst fails; after offerFirst succeeds; |
1082 |
< |
* on interruption throws |
1081 |
> |
* timed pollFirst before a delayed offerFirst fails; after offerFirst succeeds; |
1082 |
> |
* on interruption throws |
1083 |
|
*/ |
1084 |
|
public void testTimedPollFirstWithOfferFirst() throws InterruptedException { |
1085 |
|
final LinkedBlockingDeque q = new LinkedBlockingDeque(2); |
1086 |
< |
Thread t = new Thread(new CheckedRunnable() { |
1086 |
> |
final CheckedBarrier barrier = new CheckedBarrier(2); |
1087 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
1088 |
|
public void realRun() throws InterruptedException { |
1089 |
< |
assertNull(q.pollFirst(SHORT_DELAY_MS, MILLISECONDS)); |
1089 |
> |
long startTime = System.nanoTime(); |
1090 |
> |
assertNull(q.pollFirst(timeoutMillis(), MILLISECONDS)); |
1091 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
1092 |
> |
|
1093 |
> |
barrier.await(); |
1094 |
> |
|
1095 |
|
assertSame(zero, q.pollFirst(LONG_DELAY_MS, MILLISECONDS)); |
1096 |
+ |
|
1097 |
+ |
Thread.currentThread().interrupt(); |
1098 |
|
try { |
1099 |
|
q.pollFirst(LONG_DELAY_MS, MILLISECONDS); |
1100 |
|
shouldThrow(); |
1101 |
|
} catch (InterruptedException success) {} |
1102 |
+ |
|
1103 |
+ |
barrier.await(); |
1104 |
+ |
try { |
1105 |
+ |
q.pollFirst(LONG_DELAY_MS, MILLISECONDS); |
1106 |
+ |
shouldThrow(); |
1107 |
+ |
} catch (InterruptedException success) {} |
1108 |
+ |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
1109 |
|
}}); |
1110 |
|
|
1111 |
< |
t.start(); |
1112 |
< |
Thread.sleep(SMALL_DELAY_MS); |
1113 |
< |
assertTrue(q.offerFirst(zero, SHORT_DELAY_MS, MILLISECONDS)); |
1111 |
> |
barrier.await(); |
1112 |
> |
long startTime = System.nanoTime(); |
1113 |
> |
assertTrue(q.offerFirst(zero, LONG_DELAY_MS, MILLISECONDS)); |
1114 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
1115 |
> |
barrier.await(); |
1116 |
> |
assertThreadStaysAlive(t); |
1117 |
|
t.interrupt(); |
1118 |
< |
t.join(); |
1118 |
> |
awaitTermination(t); |
1119 |
|
} |
1120 |
|
|
1121 |
|
/** |
1122 |
|
* putLast(null) throws NPE |
1123 |
|
*/ |
1124 |
< |
public void testPutLastNull() throws InterruptedException { |
1124 |
> |
public void testPutLastNull() throws InterruptedException { |
1125 |
> |
LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE); |
1126 |
|
try { |
997 |
– |
LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE); |
1127 |
|
q.putLast(null); |
1128 |
|
shouldThrow(); |
1129 |
|
} catch (NullPointerException success) {} |
1130 |
< |
} |
1130 |
> |
} |
1131 |
|
|
1132 |
|
/** |
1133 |
|
* all elements successfully putLast are contained |
1134 |
|
*/ |
1135 |
< |
public void testPutLast() throws InterruptedException { |
1136 |
< |
LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE); |
1137 |
< |
for (int i = 0; i < SIZE; ++i) { |
1138 |
< |
Integer I = new Integer(i); |
1139 |
< |
q.putLast(I); |
1140 |
< |
assertTrue(q.contains(I)); |
1141 |
< |
} |
1142 |
< |
assertEquals(0, q.remainingCapacity()); |
1135 |
> |
public void testPutLast() throws InterruptedException { |
1136 |
> |
LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE); |
1137 |
> |
for (int i = 0; i < SIZE; ++i) { |
1138 |
> |
Integer I = new Integer(i); |
1139 |
> |
q.putLast(I); |
1140 |
> |
assertTrue(q.contains(I)); |
1141 |
> |
} |
1142 |
> |
assertEquals(0, q.remainingCapacity()); |
1143 |
|
} |
1144 |
|
|
1145 |
|
/** |
1147 |
|
*/ |
1148 |
|
public void testBlockingPutLast() throws InterruptedException { |
1149 |
|
final LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE); |
1150 |
< |
Thread t = new Thread(new CheckedRunnable() { |
1150 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
1151 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
1152 |
|
public void realRun() throws InterruptedException { |
1153 |
|
for (int i = 0; i < SIZE; ++i) |
1154 |
|
q.putLast(i); |
1155 |
|
assertEquals(SIZE, q.size()); |
1156 |
|
assertEquals(0, q.remainingCapacity()); |
1157 |
+ |
|
1158 |
+ |
Thread.currentThread().interrupt(); |
1159 |
+ |
try { |
1160 |
+ |
q.putLast(99); |
1161 |
+ |
shouldThrow(); |
1162 |
+ |
} catch (InterruptedException success) {} |
1163 |
+ |
assertFalse(Thread.interrupted()); |
1164 |
+ |
|
1165 |
+ |
pleaseInterrupt.countDown(); |
1166 |
|
try { |
1167 |
|
q.putLast(99); |
1168 |
|
shouldThrow(); |
1169 |
|
} catch (InterruptedException success) {} |
1170 |
+ |
assertFalse(Thread.interrupted()); |
1171 |
|
}}); |
1172 |
|
|
1173 |
< |
t.start(); |
1174 |
< |
Thread.sleep(SHORT_DELAY_MS); |
1173 |
> |
await(pleaseInterrupt); |
1174 |
> |
assertThreadStaysAlive(t); |
1175 |
|
t.interrupt(); |
1176 |
< |
t.join(); |
1176 |
> |
awaitTermination(t); |
1177 |
|
assertEquals(SIZE, q.size()); |
1178 |
|
assertEquals(0, q.remainingCapacity()); |
1179 |
|
} |
1180 |
|
|
1181 |
|
/** |
1182 |
< |
* putLast blocks waiting for take when full |
1182 |
> |
* putLast blocks interruptibly waiting for take when full |
1183 |
|
*/ |
1184 |
|
public void testPutLastWithTake() throws InterruptedException { |
1185 |
|
final int capacity = 2; |
1186 |
|
final LinkedBlockingDeque q = new LinkedBlockingDeque(capacity); |
1187 |
< |
Thread t = new Thread(new CheckedRunnable() { |
1187 |
> |
final CountDownLatch pleaseTake = new CountDownLatch(1); |
1188 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
1189 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
1190 |
|
public void realRun() throws InterruptedException { |
1191 |
< |
for (int i = 0; i < capacity + 1; i++) |
1191 |
> |
for (int i = 0; i < capacity; i++) |
1192 |
|
q.putLast(i); |
1193 |
+ |
pleaseTake.countDown(); |
1194 |
+ |
q.putLast(86); |
1195 |
+ |
|
1196 |
+ |
pleaseInterrupt.countDown(); |
1197 |
|
try { |
1198 |
|
q.putLast(99); |
1199 |
|
shouldThrow(); |
1200 |
|
} catch (InterruptedException success) {} |
1201 |
+ |
assertFalse(Thread.interrupted()); |
1202 |
|
}}); |
1203 |
|
|
1204 |
< |
t.start(); |
1205 |
< |
Thread.sleep(SHORT_DELAY_MS); |
1059 |
< |
assertEquals(q.remainingCapacity(), 0); |
1204 |
> |
await(pleaseTake); |
1205 |
> |
assertEquals(0, q.remainingCapacity()); |
1206 |
|
assertEquals(0, q.take()); |
1207 |
< |
Thread.sleep(SHORT_DELAY_MS); |
1207 |
> |
|
1208 |
> |
await(pleaseInterrupt); |
1209 |
> |
assertThreadStaysAlive(t); |
1210 |
|
t.interrupt(); |
1211 |
< |
t.join(); |
1212 |
< |
assertEquals(q.remainingCapacity(), 0); |
1211 |
> |
awaitTermination(t); |
1212 |
> |
assertEquals(0, q.remainingCapacity()); |
1213 |
|
} |
1214 |
|
|
1215 |
|
/** |
1217 |
|
*/ |
1218 |
|
public void testTimedOfferLast() throws InterruptedException { |
1219 |
|
final LinkedBlockingDeque q = new LinkedBlockingDeque(2); |
1220 |
< |
Thread t = new Thread(new CheckedRunnable() { |
1220 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
1221 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
1222 |
|
public void realRun() throws InterruptedException { |
1223 |
|
q.putLast(new Object()); |
1224 |
|
q.putLast(new Object()); |
1225 |
< |
assertFalse(q.offerLast(new Object(), SHORT_DELAY_MS, MILLISECONDS)); |
1225 |
> |
long startTime = System.nanoTime(); |
1226 |
> |
assertFalse(q.offerLast(new Object(), timeoutMillis(), MILLISECONDS)); |
1227 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
1228 |
> |
pleaseInterrupt.countDown(); |
1229 |
|
try { |
1230 |
< |
q.offerLast(new Object(), LONG_DELAY_MS, MILLISECONDS); |
1230 |
> |
q.offerLast(new Object(), 2 * LONG_DELAY_MS, MILLISECONDS); |
1231 |
|
shouldThrow(); |
1232 |
|
} catch (InterruptedException success) {} |
1233 |
|
}}); |
1234 |
|
|
1235 |
< |
t.start(); |
1236 |
< |
Thread.sleep(SMALL_DELAY_MS); |
1235 |
> |
await(pleaseInterrupt); |
1236 |
> |
assertThreadStaysAlive(t); |
1237 |
|
t.interrupt(); |
1238 |
< |
t.join(); |
1238 |
> |
awaitTermination(t); |
1239 |
|
} |
1240 |
|
|
1241 |
|
/** |
1249 |
|
} |
1250 |
|
|
1251 |
|
/** |
1252 |
< |
* takeLast blocks interruptibly when empty |
1101 |
< |
*/ |
1102 |
< |
public void testTakeLastFromEmpty() throws InterruptedException { |
1103 |
< |
final LinkedBlockingDeque q = new LinkedBlockingDeque(2); |
1104 |
< |
Thread t = new ThreadShouldThrow(InterruptedException.class) { |
1105 |
< |
public void realRun() throws InterruptedException { |
1106 |
< |
q.takeLast(); |
1107 |
< |
}}; |
1108 |
< |
|
1109 |
< |
t.start(); |
1110 |
< |
Thread.sleep(SHORT_DELAY_MS); |
1111 |
< |
t.interrupt(); |
1112 |
< |
t.join(); |
1113 |
< |
} |
1114 |
< |
|
1115 |
< |
/** |
1116 |
< |
* TakeLast removes existing elements until empty, then blocks interruptibly |
1252 |
> |
* takeLast removes existing elements until empty, then blocks interruptibly |
1253 |
|
*/ |
1254 |
|
public void testBlockingTakeLast() throws InterruptedException { |
1255 |
|
final LinkedBlockingDeque q = populatedDeque(SIZE); |
1256 |
< |
Thread t = new Thread(new CheckedRunnable() { |
1256 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
1257 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
1258 |
|
public void realRun() throws InterruptedException { |
1259 |
< |
for (int i = 0; i < SIZE; ++i) |
1260 |
< |
assertEquals(SIZE - 1 - i, q.takeLast()); |
1259 |
> |
for (int i = 0; i < SIZE; ++i) { |
1260 |
> |
assertEquals(SIZE-i-1, q.takeLast()); |
1261 |
> |
} |
1262 |
> |
|
1263 |
> |
Thread.currentThread().interrupt(); |
1264 |
|
try { |
1265 |
|
q.takeLast(); |
1266 |
|
shouldThrow(); |
1267 |
|
} catch (InterruptedException success) {} |
1268 |
+ |
assertFalse(Thread.interrupted()); |
1269 |
+ |
|
1270 |
+ |
pleaseInterrupt.countDown(); |
1271 |
+ |
try { |
1272 |
+ |
q.takeLast(); |
1273 |
+ |
shouldThrow(); |
1274 |
+ |
} catch (InterruptedException success) {} |
1275 |
+ |
assertFalse(Thread.interrupted()); |
1276 |
|
}}); |
1277 |
|
|
1278 |
< |
t.start(); |
1279 |
< |
Thread.sleep(SHORT_DELAY_MS); |
1278 |
> |
await(pleaseInterrupt); |
1279 |
> |
assertThreadStaysAlive(t); |
1280 |
|
t.interrupt(); |
1281 |
< |
t.join(); |
1281 |
> |
awaitTermination(t); |
1282 |
|
} |
1283 |
|
|
1284 |
|
/** |
1298 |
|
public void testTimedPollLast() throws InterruptedException { |
1299 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
1300 |
|
for (int i = 0; i < SIZE; ++i) { |
1301 |
< |
assertEquals(SIZE-i-1, q.pollLast(SHORT_DELAY_MS, MILLISECONDS)); |
1302 |
< |
} |
1303 |
< |
assertNull(q.pollLast(SHORT_DELAY_MS, MILLISECONDS)); |
1301 |
> |
long startTime = System.nanoTime(); |
1302 |
> |
assertEquals(SIZE-i-1, q.pollLast(LONG_DELAY_MS, MILLISECONDS)); |
1303 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
1304 |
> |
} |
1305 |
> |
long startTime = System.nanoTime(); |
1306 |
> |
assertNull(q.pollLast(timeoutMillis(), MILLISECONDS)); |
1307 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
1308 |
> |
checkEmpty(q); |
1309 |
|
} |
1310 |
|
|
1311 |
|
/** |
1313 |
|
* returning timeout status |
1314 |
|
*/ |
1315 |
|
public void testInterruptedTimedPollLast() throws InterruptedException { |
1316 |
< |
Thread t = new Thread(new CheckedRunnable() { |
1316 |
> |
final CountDownLatch pleaseInterrupt = new CountDownLatch(1); |
1317 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
1318 |
|
public void realRun() throws InterruptedException { |
1319 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
1320 |
|
for (int i = 0; i < SIZE; ++i) { |
1321 |
< |
assertEquals(SIZE-i-1, q.pollLast(SHORT_DELAY_MS, MILLISECONDS)); |
1321 |
> |
assertEquals(SIZE-i-1, q.pollLast(LONG_DELAY_MS, MILLISECONDS)); |
1322 |
|
} |
1323 |
+ |
|
1324 |
+ |
Thread.currentThread().interrupt(); |
1325 |
+ |
try { |
1326 |
+ |
q.pollLast(LONG_DELAY_MS, MILLISECONDS); |
1327 |
+ |
shouldThrow(); |
1328 |
+ |
} catch (InterruptedException success) {} |
1329 |
+ |
assertFalse(Thread.interrupted()); |
1330 |
+ |
|
1331 |
+ |
pleaseInterrupt.countDown(); |
1332 |
|
try { |
1333 |
< |
q.pollLast(SMALL_DELAY_MS, MILLISECONDS); |
1333 |
> |
q.pollLast(LONG_DELAY_MS, MILLISECONDS); |
1334 |
|
shouldThrow(); |
1335 |
|
} catch (InterruptedException success) {} |
1336 |
+ |
assertFalse(Thread.interrupted()); |
1337 |
|
}}); |
1338 |
|
|
1339 |
< |
t.start(); |
1340 |
< |
Thread.sleep(SHORT_DELAY_MS); |
1339 |
> |
await(pleaseInterrupt); |
1340 |
> |
assertThreadStaysAlive(t); |
1341 |
|
t.interrupt(); |
1342 |
< |
t.join(); |
1342 |
> |
awaitTermination(t); |
1343 |
|
} |
1344 |
|
|
1345 |
|
/** |
1348 |
|
*/ |
1349 |
|
public void testTimedPollWithOfferLast() throws InterruptedException { |
1350 |
|
final LinkedBlockingDeque q = new LinkedBlockingDeque(2); |
1351 |
< |
Thread t = new Thread(new CheckedRunnable() { |
1351 |
> |
final CheckedBarrier barrier = new CheckedBarrier(2); |
1352 |
> |
Thread t = newStartedThread(new CheckedRunnable() { |
1353 |
|
public void realRun() throws InterruptedException { |
1354 |
< |
assertNull(q.poll(SHORT_DELAY_MS, MILLISECONDS)); |
1354 |
> |
long startTime = System.nanoTime(); |
1355 |
> |
assertNull(q.poll(timeoutMillis(), MILLISECONDS)); |
1356 |
> |
assertTrue(millisElapsedSince(startTime) >= timeoutMillis()); |
1357 |
> |
|
1358 |
> |
barrier.await(); |
1359 |
> |
|
1360 |
|
assertSame(zero, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
1361 |
+ |
|
1362 |
+ |
Thread.currentThread().interrupt(); |
1363 |
|
try { |
1364 |
|
q.poll(LONG_DELAY_MS, MILLISECONDS); |
1365 |
|
shouldThrow(); |
1366 |
|
} catch (InterruptedException success) {} |
1367 |
+ |
assertFalse(Thread.interrupted()); |
1368 |
+ |
|
1369 |
+ |
barrier.await(); |
1370 |
+ |
try { |
1371 |
+ |
q.poll(LONG_DELAY_MS, MILLISECONDS); |
1372 |
+ |
shouldThrow(); |
1373 |
+ |
} catch (InterruptedException success) {} |
1374 |
+ |
assertFalse(Thread.interrupted()); |
1375 |
|
}}); |
1376 |
|
|
1377 |
< |
t.start(); |
1378 |
< |
Thread.sleep(SMALL_DELAY_MS); |
1379 |
< |
assertTrue(q.offerLast(zero, SHORT_DELAY_MS, MILLISECONDS)); |
1377 |
> |
barrier.await(); |
1378 |
> |
long startTime = System.nanoTime(); |
1379 |
> |
assertTrue(q.offerLast(zero, LONG_DELAY_MS, MILLISECONDS)); |
1380 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
1381 |
> |
|
1382 |
> |
barrier.await(); |
1383 |
> |
assertThreadStaysAlive(t); |
1384 |
|
t.interrupt(); |
1385 |
< |
t.join(); |
1385 |
> |
awaitTermination(t); |
1386 |
|
} |
1387 |
|
|
1204 |
– |
|
1388 |
|
/** |
1389 |
|
* element returns next element, or throws NSEE if empty |
1390 |
|
*/ |
1401 |
|
} |
1402 |
|
|
1403 |
|
/** |
1221 |
– |
* remove(x) removes x and returns true if present |
1222 |
– |
*/ |
1223 |
– |
public void testRemoveElement() { |
1224 |
– |
LinkedBlockingDeque q = populatedDeque(SIZE); |
1225 |
– |
for (int i = 1; i < SIZE; i+=2) { |
1226 |
– |
assertTrue(q.remove(new Integer(i))); |
1227 |
– |
} |
1228 |
– |
for (int i = 0; i < SIZE; i+=2) { |
1229 |
– |
assertTrue(q.remove(new Integer(i))); |
1230 |
– |
assertFalse(q.remove(new Integer(i+1))); |
1231 |
– |
} |
1232 |
– |
assertTrue(q.isEmpty()); |
1233 |
– |
} |
1234 |
– |
|
1235 |
– |
/** |
1404 |
|
* contains(x) reports true when elements added but not yet removed |
1405 |
|
*/ |
1406 |
|
public void testContains() { |
1478 |
|
} |
1479 |
|
|
1480 |
|
/** |
1481 |
< |
* toArray contains all elements |
1481 |
> |
* toArray contains all elements in FIFO order |
1482 |
|
*/ |
1483 |
< |
public void testToArray() throws InterruptedException{ |
1483 |
> |
public void testToArray() throws InterruptedException { |
1484 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
1485 |
|
Object[] o = q.toArray(); |
1486 |
|
for (int i = 0; i < o.length; i++) |
1487 |
< |
assertEquals(o[i], q.take()); |
1487 |
> |
assertSame(o[i], q.poll()); |
1488 |
|
} |
1489 |
|
|
1490 |
|
/** |
1491 |
< |
* toArray(a) contains all elements |
1491 |
> |
* toArray(a) contains all elements in FIFO order |
1492 |
|
*/ |
1493 |
< |
public void testToArray2() throws InterruptedException { |
1494 |
< |
LinkedBlockingDeque q = populatedDeque(SIZE); |
1493 |
> |
public void testToArray2() { |
1494 |
> |
LinkedBlockingDeque<Integer> q = populatedDeque(SIZE); |
1495 |
|
Integer[] ints = new Integer[SIZE]; |
1496 |
< |
ints = (Integer[])q.toArray(ints); |
1496 |
> |
Integer[] array = q.toArray(ints); |
1497 |
> |
assertSame(ints, array); |
1498 |
|
for (int i = 0; i < ints.length; i++) |
1499 |
< |
assertEquals(ints[i], q.take()); |
1499 |
> |
assertSame(ints[i], q.remove()); |
1500 |
|
} |
1501 |
|
|
1502 |
|
/** |
1503 |
< |
* toArray(null) throws NPE |
1335 |
< |
*/ |
1336 |
< |
public void testToArray_BadArg() { |
1337 |
< |
LinkedBlockingDeque q = populatedDeque(SIZE); |
1338 |
< |
try { |
1339 |
< |
Object o[] = q.toArray(null); |
1340 |
< |
shouldThrow(); |
1341 |
< |
} catch (NullPointerException success) {} |
1342 |
< |
} |
1343 |
< |
|
1344 |
< |
/** |
1345 |
< |
* toArray with incompatible array type throws CCE |
1503 |
> |
* toArray(incompatible array type) throws ArrayStoreException |
1504 |
|
*/ |
1505 |
|
public void testToArray1_BadArg() { |
1506 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
1507 |
|
try { |
1508 |
< |
Object o[] = q.toArray(new String[10]); |
1508 |
> |
q.toArray(new String[10]); |
1509 |
|
shouldThrow(); |
1510 |
|
} catch (ArrayStoreException success) {} |
1511 |
|
} |
1512 |
|
|
1355 |
– |
|
1513 |
|
/** |
1514 |
|
* iterator iterates through all elements |
1515 |
|
*/ |
1540 |
|
assertFalse(it.hasNext()); |
1541 |
|
} |
1542 |
|
|
1386 |
– |
|
1543 |
|
/** |
1544 |
|
* iterator ordering is FIFO |
1545 |
|
*/ |
1571 |
|
assertEquals(0, q.size()); |
1572 |
|
} |
1573 |
|
|
1418 |
– |
|
1574 |
|
/** |
1575 |
< |
* Descending iterator iterates through all elements |
1575 |
> |
* Descending iterator iterates through all elements |
1576 |
|
*/ |
1577 |
|
public void testDescendingIterator() { |
1578 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
1591 |
|
} |
1592 |
|
|
1593 |
|
/** |
1594 |
< |
* Descending iterator ordering is reverse FIFO |
1594 |
> |
* Descending iterator ordering is reverse FIFO |
1595 |
|
*/ |
1596 |
|
public void testDescendingIteratorOrdering() { |
1597 |
|
final LinkedBlockingDeque q = new LinkedBlockingDeque(); |
1633 |
|
} |
1634 |
|
} |
1635 |
|
|
1481 |
– |
|
1636 |
|
/** |
1637 |
|
* toString contains toStrings of elements |
1638 |
|
*/ |
1640 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
1641 |
|
String s = q.toString(); |
1642 |
|
for (int i = 0; i < SIZE; ++i) { |
1643 |
< |
assertTrue(s.indexOf(String.valueOf(i)) >= 0); |
1643 |
> |
assertTrue(s.contains(String.valueOf(i))); |
1644 |
|
} |
1645 |
|
} |
1646 |
|
|
1493 |
– |
|
1647 |
|
/** |
1648 |
|
* offer transfers elements across Executor tasks |
1649 |
|
*/ |
1652 |
|
q.add(one); |
1653 |
|
q.add(two); |
1654 |
|
ExecutorService executor = Executors.newFixedThreadPool(2); |
1655 |
+ |
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
1656 |
|
executor.execute(new CheckedRunnable() { |
1657 |
|
public void realRun() throws InterruptedException { |
1658 |
|
assertFalse(q.offer(three)); |
1659 |
< |
assertTrue(q.offer(three, MEDIUM_DELAY_MS, MILLISECONDS)); |
1659 |
> |
threadsStarted.await(); |
1660 |
> |
assertTrue(q.offer(three, LONG_DELAY_MS, MILLISECONDS)); |
1661 |
|
assertEquals(0, q.remainingCapacity()); |
1662 |
|
}}); |
1663 |
|
|
1664 |
|
executor.execute(new CheckedRunnable() { |
1665 |
|
public void realRun() throws InterruptedException { |
1666 |
< |
Thread.sleep(SMALL_DELAY_MS); |
1666 |
> |
threadsStarted.await(); |
1667 |
|
assertSame(one, q.take()); |
1668 |
|
}}); |
1669 |
|
|
1671 |
|
} |
1672 |
|
|
1673 |
|
/** |
1674 |
< |
* poll retrieves elements across Executor threads |
1674 |
> |
* timed poll retrieves elements across Executor threads |
1675 |
|
*/ |
1676 |
|
public void testPollInExecutor() { |
1677 |
|
final LinkedBlockingDeque q = new LinkedBlockingDeque(2); |
1678 |
+ |
final CheckedBarrier threadsStarted = new CheckedBarrier(2); |
1679 |
|
ExecutorService executor = Executors.newFixedThreadPool(2); |
1680 |
|
executor.execute(new CheckedRunnable() { |
1681 |
|
public void realRun() throws InterruptedException { |
1682 |
|
assertNull(q.poll()); |
1683 |
< |
assertSame(one, q.poll(MEDIUM_DELAY_MS, MILLISECONDS)); |
1684 |
< |
assertTrue(q.isEmpty()); |
1683 |
> |
threadsStarted.await(); |
1684 |
> |
assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS)); |
1685 |
> |
checkEmpty(q); |
1686 |
|
}}); |
1687 |
|
|
1688 |
|
executor.execute(new CheckedRunnable() { |
1689 |
|
public void realRun() throws InterruptedException { |
1690 |
< |
Thread.sleep(SMALL_DELAY_MS); |
1690 |
> |
threadsStarted.await(); |
1691 |
|
q.put(one); |
1692 |
|
}}); |
1693 |
|
|
1698 |
|
* A deserialized serialized deque has same elements in same order |
1699 |
|
*/ |
1700 |
|
public void testSerialization() throws Exception { |
1701 |
< |
LinkedBlockingDeque q = populatedDeque(SIZE); |
1702 |
< |
|
1546 |
< |
ByteArrayOutputStream bout = new ByteArrayOutputStream(10000); |
1547 |
< |
ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout)); |
1548 |
< |
out.writeObject(q); |
1549 |
< |
out.close(); |
1550 |
< |
|
1551 |
< |
ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray()); |
1552 |
< |
ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin)); |
1553 |
< |
LinkedBlockingDeque r = (LinkedBlockingDeque)in.readObject(); |
1554 |
< |
assertEquals(q.size(), r.size()); |
1555 |
< |
while (!q.isEmpty()) |
1556 |
< |
assertEquals(q.remove(), r.remove()); |
1557 |
< |
} |
1558 |
< |
|
1559 |
< |
/** |
1560 |
< |
* drainTo(null) throws NPE |
1561 |
< |
*/ |
1562 |
< |
public void testDrainToNull() { |
1563 |
< |
LinkedBlockingDeque q = populatedDeque(SIZE); |
1564 |
< |
try { |
1565 |
< |
q.drainTo(null); |
1566 |
< |
shouldThrow(); |
1567 |
< |
} catch (NullPointerException success) {} |
1568 |
< |
} |
1701 |
> |
Queue x = populatedDeque(SIZE); |
1702 |
> |
Queue y = serialClone(x); |
1703 |
|
|
1704 |
< |
/** |
1705 |
< |
* drainTo(this) throws IAE |
1706 |
< |
*/ |
1707 |
< |
public void testDrainToSelf() { |
1708 |
< |
LinkedBlockingDeque q = populatedDeque(SIZE); |
1709 |
< |
try { |
1710 |
< |
q.drainTo(q); |
1711 |
< |
shouldThrow(); |
1712 |
< |
} catch (IllegalArgumentException success) {} |
1704 |
> |
assertNotSame(y, x); |
1705 |
> |
assertEquals(x.size(), y.size()); |
1706 |
> |
assertEquals(x.toString(), y.toString()); |
1707 |
> |
assertTrue(Arrays.equals(x.toArray(), y.toArray())); |
1708 |
> |
while (!x.isEmpty()) { |
1709 |
> |
assertFalse(y.isEmpty()); |
1710 |
> |
assertEquals(x.remove(), y.remove()); |
1711 |
> |
} |
1712 |
> |
assertTrue(y.isEmpty()); |
1713 |
|
} |
1714 |
|
|
1715 |
|
/** |
1719 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
1720 |
|
ArrayList l = new ArrayList(); |
1721 |
|
q.drainTo(l); |
1722 |
< |
assertEquals(q.size(), 0); |
1723 |
< |
assertEquals(l.size(), SIZE); |
1722 |
> |
assertEquals(0, q.size()); |
1723 |
> |
assertEquals(SIZE, l.size()); |
1724 |
|
for (int i = 0; i < SIZE; ++i) |
1725 |
|
assertEquals(l.get(i), new Integer(i)); |
1726 |
|
q.add(zero); |
1730 |
|
assertTrue(q.contains(one)); |
1731 |
|
l.clear(); |
1732 |
|
q.drainTo(l); |
1733 |
< |
assertEquals(q.size(), 0); |
1734 |
< |
assertEquals(l.size(), 2); |
1733 |
> |
assertEquals(0, q.size()); |
1734 |
> |
assertEquals(2, l.size()); |
1735 |
|
for (int i = 0; i < 2; ++i) |
1736 |
|
assertEquals(l.get(i), new Integer(i)); |
1737 |
|
} |
1757 |
|
} |
1758 |
|
|
1759 |
|
/** |
1760 |
< |
* drainTo(null, n) throws NPE |
1627 |
< |
*/ |
1628 |
< |
public void testDrainToNullN() { |
1629 |
< |
LinkedBlockingDeque q = populatedDeque(SIZE); |
1630 |
< |
try { |
1631 |
< |
q.drainTo(null, 0); |
1632 |
< |
shouldThrow(); |
1633 |
< |
} catch (NullPointerException success) {} |
1634 |
< |
} |
1635 |
< |
|
1636 |
< |
/** |
1637 |
< |
* drainTo(this, n) throws IAE |
1638 |
< |
*/ |
1639 |
< |
public void testDrainToSelfN() { |
1640 |
< |
LinkedBlockingDeque q = populatedDeque(SIZE); |
1641 |
< |
try { |
1642 |
< |
q.drainTo(q, 0); |
1643 |
< |
shouldThrow(); |
1644 |
< |
} catch (IllegalArgumentException success) {} |
1645 |
< |
} |
1646 |
< |
|
1647 |
< |
/** |
1648 |
< |
* drainTo(c, n) empties first max {n, size} elements of deque into c |
1760 |
> |
* drainTo(c, n) empties first min(n, size) elements of queue into c |
1761 |
|
*/ |
1762 |
|
public void testDrainToN() { |
1763 |
|
LinkedBlockingDeque q = new LinkedBlockingDeque(); |
1766 |
|
assertTrue(q.offer(new Integer(j))); |
1767 |
|
ArrayList l = new ArrayList(); |
1768 |
|
q.drainTo(l, i); |
1769 |
< |
int k = (i < SIZE)? i : SIZE; |
1770 |
< |
assertEquals(l.size(), k); |
1771 |
< |
assertEquals(q.size(), SIZE-k); |
1769 |
> |
int k = (i < SIZE) ? i : SIZE; |
1770 |
> |
assertEquals(k, l.size()); |
1771 |
> |
assertEquals(SIZE-k, q.size()); |
1772 |
|
for (int j = 0; j < k; ++j) |
1773 |
|
assertEquals(l.get(j), new Integer(j)); |
1774 |
|
while (q.poll() != null) ; |
1775 |
|
} |
1776 |
|
} |
1777 |
|
|
1778 |
+ |
/** |
1779 |
+ |
* remove(null), contains(null) always return false |
1780 |
+ |
*/ |
1781 |
+ |
public void testNeverContainsNull() { |
1782 |
+ |
Deque<?>[] qs = { |
1783 |
+ |
new LinkedBlockingDeque<Object>(), |
1784 |
+ |
populatedDeque(2), |
1785 |
+ |
}; |
1786 |
+ |
|
1787 |
+ |
for (Deque<?> q : qs) { |
1788 |
+ |
assertFalse(q.contains(null)); |
1789 |
+ |
assertFalse(q.remove(null)); |
1790 |
+ |
assertFalse(q.removeFirstOccurrence(null)); |
1791 |
+ |
assertFalse(q.removeLastOccurrence(null)); |
1792 |
+ |
} |
1793 |
+ |
} |
1794 |
+ |
|
1795 |
|
} |