180 |
|
* Queue contains all elements, in traversal order, of successful addAll |
181 |
|
*/ |
182 |
|
public void testAddAll5() { |
183 |
< |
try { |
184 |
< |
Integer[] empty = new Integer[0]; |
185 |
< |
Integer[] ints = new Integer[SIZE]; |
186 |
< |
for (int i = 0; i < SIZE; ++i) |
187 |
< |
ints[i] = new Integer(i); |
188 |
< |
ArrayDeque q = new ArrayDeque(); |
189 |
< |
assertFalse(q.addAll(Arrays.asList(empty))); |
190 |
< |
assertTrue(q.addAll(Arrays.asList(ints))); |
191 |
< |
for (int i = 0; i < SIZE; ++i) |
192 |
< |
assertEquals(ints[i], q.pollFirst()); |
193 |
< |
} |
194 |
< |
finally {} |
183 |
> |
Integer[] empty = new Integer[0]; |
184 |
> |
Integer[] ints = new Integer[SIZE]; |
185 |
> |
for (int i = 0; i < SIZE; ++i) |
186 |
> |
ints[i] = new Integer(i); |
187 |
> |
ArrayDeque q = new ArrayDeque(); |
188 |
> |
assertFalse(q.addAll(Arrays.asList(empty))); |
189 |
> |
assertTrue(q.addAll(Arrays.asList(ints))); |
190 |
> |
for (int i = 0; i < SIZE; ++i) |
191 |
> |
assertEquals(ints[i], q.pollFirst()); |
192 |
|
} |
193 |
|
|
194 |
|
/** |
552 |
|
assertFalse(it.hasNext()); |
553 |
|
try { |
554 |
|
it.next(); |
555 |
+ |
shouldThrow(); |
556 |
|
} catch (NoSuchElementException success) {} |
557 |
|
} |
558 |
|
|