682 |
|
} |
683 |
|
|
684 |
|
/** |
685 |
– |
* 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 |
– |
/** |
685 |
|
* Take removes existing elements until empty, then blocks interruptibly |
686 |
|
*/ |
687 |
|
public void testBlockingTake() throws InterruptedException { |
1638 |
|
assertTrue(q.offer(new Integer(j))); |
1639 |
|
ArrayList l = new ArrayList(); |
1640 |
|
q.drainTo(l, i); |
1641 |
< |
int k = (i < SIZE)? i : SIZE; |
1641 |
> |
int k = (i < SIZE) ? i : SIZE; |
1642 |
|
assertEquals(l.size(), k); |
1643 |
|
assertEquals(q.size(), SIZE-k); |
1644 |
|
for (int j = 0; j < k; ++j) |