323 |
|
* Deque contains all elements of collection used to initialize |
324 |
|
*/ |
325 |
|
public void testConstructor6() { |
326 |
< |
try { |
327 |
< |
Integer[] ints = new Integer[SIZE]; |
328 |
< |
for (int i = 0; i < SIZE; ++i) |
329 |
< |
ints[i] = new Integer(i); |
330 |
< |
LinkedBlockingDeque q = new LinkedBlockingDeque(Arrays.asList(ints)); |
331 |
< |
for (int i = 0; i < SIZE; ++i) |
332 |
< |
assertEquals(ints[i], q.poll()); |
333 |
< |
} |
334 |
< |
finally {} |
326 |
> |
Integer[] ints = new Integer[SIZE]; |
327 |
> |
for (int i = 0; i < SIZE; ++i) |
328 |
> |
ints[i] = new Integer(i); |
329 |
> |
LinkedBlockingDeque q = new LinkedBlockingDeque(Arrays.asList(ints)); |
330 |
> |
for (int i = 0; i < SIZE; ++i) |
331 |
> |
assertEquals(ints[i], q.poll()); |
332 |
|
} |
333 |
|
|
334 |
|
/** |
527 |
|
* Deque contains all elements, in traversal order, of successful addAll |
528 |
|
*/ |
529 |
|
public void testAddAll5() { |
530 |
< |
try { |
531 |
< |
Integer[] empty = new Integer[0]; |
532 |
< |
Integer[] ints = new Integer[SIZE]; |
533 |
< |
for (int i = 0; i < SIZE; ++i) |
534 |
< |
ints[i] = new Integer(i); |
535 |
< |
LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE); |
536 |
< |
assertFalse(q.addAll(Arrays.asList(empty))); |
537 |
< |
assertTrue(q.addAll(Arrays.asList(ints))); |
538 |
< |
for (int i = 0; i < SIZE; ++i) |
542 |
< |
assertEquals(ints[i], q.poll()); |
543 |
< |
} |
544 |
< |
finally {} |
530 |
> |
Integer[] empty = new Integer[0]; |
531 |
> |
Integer[] ints = new Integer[SIZE]; |
532 |
> |
for (int i = 0; i < SIZE; ++i) |
533 |
> |
ints[i] = new Integer(i); |
534 |
> |
LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE); |
535 |
> |
assertFalse(q.addAll(Arrays.asList(empty))); |
536 |
> |
assertTrue(q.addAll(Arrays.asList(ints))); |
537 |
> |
for (int i = 0; i < SIZE; ++i) |
538 |
> |
assertEquals(ints[i], q.poll()); |
539 |
|
} |
540 |
|
|
541 |
|
|