1645 |
|
} |
1646 |
|
|
1647 |
|
/** |
1648 |
< |
* drainTo(c, n) empties first max {n, size} elements of deque into c |
1648 |
> |
* drainTo(c, n) empties first min(n, size) elements of queue into c |
1649 |
|
*/ |
1650 |
|
public void testDrainToN() { |
1651 |
|
LinkedBlockingDeque q = new LinkedBlockingDeque(); |
1654 |
|
assertTrue(q.offer(new Integer(j))); |
1655 |
|
ArrayList l = new ArrayList(); |
1656 |
|
q.drainTo(l, i); |
1657 |
< |
int k = (i < SIZE)? i : SIZE; |
1657 |
> |
int k = (i < SIZE) ? i : SIZE; |
1658 |
|
assertEquals(l.size(), k); |
1659 |
|
assertEquals(q.size(), SIZE-k); |
1660 |
|
for (int j = 0; j < k; ++j) |