895 |
|
} |
896 |
|
|
897 |
|
/** |
898 |
< |
* drainTo(c, n) empties first max {n, size} elements of queue into c |
898 |
> |
* drainTo(c, n) empties first min(n, size) elements of queue into c |
899 |
|
*/ |
900 |
|
public void testDrainToN() { |
901 |
|
LinkedBlockingQueue q = new LinkedBlockingQueue(); |
904 |
|
assertTrue(q.offer(new Integer(j))); |
905 |
|
ArrayList l = new ArrayList(); |
906 |
|
q.drainTo(l, i); |
907 |
< |
int k = (i < SIZE)? i : SIZE; |
907 |
> |
int k = (i < SIZE) ? i : SIZE; |
908 |
|
assertEquals(l.size(), k); |
909 |
|
assertEquals(q.size(), SIZE-k); |
910 |
|
for (int j = 0; j < k; ++j) |