175 |
|
* Queue contains all elements of collection used to initialize |
176 |
|
*/ |
177 |
|
public void testConstructor6() { |
178 |
< |
try { |
179 |
< |
PDelay[] ints = new PDelay[SIZE]; |
180 |
< |
for (int i = 0; i < SIZE; ++i) |
181 |
< |
ints[i] = new PDelay(i); |
182 |
< |
DelayQueue q = new DelayQueue(Arrays.asList(ints)); |
183 |
< |
for (int i = 0; i < SIZE; ++i) |
184 |
< |
assertEquals(ints[i], q.poll()); |
185 |
< |
} |
186 |
< |
finally {} |
178 |
> |
PDelay[] ints = new PDelay[SIZE]; |
179 |
> |
for (int i = 0; i < SIZE; ++i) |
180 |
> |
ints[i] = new PDelay(i); |
181 |
> |
DelayQueue q = new DelayQueue(Arrays.asList(ints)); |
182 |
> |
for (int i = 0; i < SIZE; ++i) |
183 |
> |
assertEquals(ints[i], q.poll()); |
184 |
|
} |
185 |
|
|
186 |
|
/** |
311 |
|
* Queue contains all elements of successful addAll |
312 |
|
*/ |
313 |
|
public void testAddAll5() { |
314 |
< |
try { |
315 |
< |
PDelay[] empty = new PDelay[0]; |
316 |
< |
PDelay[] ints = new PDelay[SIZE]; |
317 |
< |
for (int i = SIZE-1; i >= 0; --i) |
318 |
< |
ints[i] = new PDelay(i); |
319 |
< |
DelayQueue q = new DelayQueue(); |
320 |
< |
assertFalse(q.addAll(Arrays.asList(empty))); |
321 |
< |
assertTrue(q.addAll(Arrays.asList(ints))); |
322 |
< |
for (int i = 0; i < SIZE; ++i) |
326 |
< |
assertEquals(ints[i], q.poll()); |
327 |
< |
} |
328 |
< |
finally {} |
314 |
> |
PDelay[] empty = new PDelay[0]; |
315 |
> |
PDelay[] ints = new PDelay[SIZE]; |
316 |
> |
for (int i = SIZE-1; i >= 0; --i) |
317 |
> |
ints[i] = new PDelay(i); |
318 |
> |
DelayQueue q = new DelayQueue(); |
319 |
> |
assertFalse(q.addAll(Arrays.asList(empty))); |
320 |
> |
assertTrue(q.addAll(Arrays.asList(ints))); |
321 |
> |
for (int i = 0; i < SIZE; ++i) |
322 |
> |
assertEquals(ints[i], q.poll()); |
323 |
|
} |
324 |
|
|
325 |
|
/** |