108 |
|
ArrayDeque q = populatedDeque(3); |
109 |
|
q.pollLast(); |
110 |
|
q.push(four); |
111 |
< |
assertEquals(four,q.peekFirst()); |
111 |
> |
assertSame(four, q.peekFirst()); |
112 |
|
} |
113 |
|
|
114 |
|
/** |
117 |
|
public void testPop() { |
118 |
|
ArrayDeque q = populatedDeque(SIZE); |
119 |
|
for (int i = 0; i < SIZE; ++i) { |
120 |
< |
assertEquals(i, ((Integer)q.pop()).intValue()); |
120 |
> |
assertEquals(i, q.pop()); |
121 |
|
} |
122 |
|
try { |
123 |
|
q.pop(); |
197 |
|
public void testPollFirst() { |
198 |
|
ArrayDeque q = populatedDeque(SIZE); |
199 |
|
for (int i = 0; i < SIZE; ++i) { |
200 |
< |
assertEquals(i, ((Integer)q.pollFirst()).intValue()); |
200 |
> |
assertEquals(i, q.pollFirst()); |
201 |
|
} |
202 |
|
assertNull(q.pollFirst()); |
203 |
|
} |
208 |
|
public void testPollLast() { |
209 |
|
ArrayDeque q = populatedDeque(SIZE); |
210 |
|
for (int i = SIZE-1; i >= 0; --i) { |
211 |
< |
assertEquals(i, ((Integer)q.pollLast()).intValue()); |
211 |
> |
assertEquals(i, q.pollLast()); |
212 |
|
} |
213 |
|
assertNull(q.pollLast()); |
214 |
|
} |
219 |
|
public void testPoll() { |
220 |
|
ArrayDeque q = populatedDeque(SIZE); |
221 |
|
for (int i = 0; i < SIZE; ++i) { |
222 |
< |
assertEquals(i, ((Integer)q.poll()).intValue()); |
222 |
> |
assertEquals(i, q.poll()); |
223 |
|
} |
224 |
|
assertNull(q.poll()); |
225 |
|
} |
230 |
|
public void testRemove() { |
231 |
|
ArrayDeque q = populatedDeque(SIZE); |
232 |
|
for (int i = 0; i < SIZE; ++i) { |
233 |
< |
assertEquals(i, ((Integer)q.remove()).intValue()); |
233 |
> |
assertEquals(i, q.remove()); |
234 |
|
} |
235 |
|
try { |
236 |
|
q.remove(); |
244 |
|
public void testPeekFirst() { |
245 |
|
ArrayDeque q = populatedDeque(SIZE); |
246 |
|
for (int i = 0; i < SIZE; ++i) { |
247 |
< |
assertEquals(i, ((Integer)q.peekFirst()).intValue()); |
248 |
< |
q.pollFirst(); |
247 |
> |
assertEquals(i, q.peekFirst()); |
248 |
> |
assertEquals(i, q.pollFirst()); |
249 |
|
assertTrue(q.peekFirst() == null || |
250 |
< |
i != ((Integer)q.peekFirst()).intValue()); |
250 |
> |
!q.peekFirst().equals(i)); |
251 |
|
} |
252 |
|
assertNull(q.peekFirst()); |
253 |
|
} |
258 |
|
public void testPeek() { |
259 |
|
ArrayDeque q = populatedDeque(SIZE); |
260 |
|
for (int i = 0; i < SIZE; ++i) { |
261 |
< |
assertEquals(i, ((Integer)q.peek()).intValue()); |
262 |
< |
q.poll(); |
261 |
> |
assertEquals(i, q.peek()); |
262 |
> |
assertEquals(i, q.poll()); |
263 |
|
assertTrue(q.peek() == null || |
264 |
< |
i != ((Integer)q.peek()).intValue()); |
264 |
> |
!q.peek().equals(i)); |
265 |
|
} |
266 |
|
assertNull(q.peek()); |
267 |
|
} |
272 |
|
public void testPeekLast() { |
273 |
|
ArrayDeque q = populatedDeque(SIZE); |
274 |
|
for (int i = SIZE-1; i >= 0; --i) { |
275 |
< |
assertEquals(i, ((Integer)q.peekLast()).intValue()); |
276 |
< |
q.pollLast(); |
275 |
> |
assertEquals(i, q.peekLast()); |
276 |
> |
assertEquals(i, q.pollLast()); |
277 |
|
assertTrue(q.peekLast() == null || |
278 |
< |
i != ((Integer)q.peekLast()).intValue()); |
278 |
> |
!q.peekLast().equals(i)); |
279 |
|
} |
280 |
|
assertNull(q.peekLast()); |
281 |
|
} |
286 |
|
public void testFirstElement() { |
287 |
|
ArrayDeque q = populatedDeque(SIZE); |
288 |
|
for (int i = 0; i < SIZE; ++i) { |
289 |
< |
assertEquals(i, ((Integer)q.getFirst()).intValue()); |
290 |
< |
q.pollFirst(); |
289 |
> |
assertEquals(i, q.getFirst()); |
290 |
> |
assertEquals(i, q.pollFirst()); |
291 |
|
} |
292 |
|
try { |
293 |
|
q.getFirst(); |
301 |
|
public void testLastElement() { |
302 |
|
ArrayDeque q = populatedDeque(SIZE); |
303 |
|
for (int i = SIZE-1; i >= 0; --i) { |
304 |
< |
assertEquals(i, ((Integer)q.getLast()).intValue()); |
305 |
< |
q.pollLast(); |
304 |
> |
assertEquals(i, q.getLast()); |
305 |
> |
assertEquals(i, q.pollLast()); |
306 |
|
} |
307 |
|
try { |
308 |
|
q.getLast(); |
318 |
|
public void testRemoveFirst() { |
319 |
|
ArrayDeque q = populatedDeque(SIZE); |
320 |
|
for (int i = 0; i < SIZE; ++i) { |
321 |
< |
assertEquals(i, ((Integer)q.removeFirst()).intValue()); |
321 |
> |
assertEquals(i, q.removeFirst()); |
322 |
|
} |
323 |
|
try { |
324 |
|
q.removeFirst(); |
363 |
|
ArrayDeque q = populatedDeque(SIZE); |
364 |
|
for (int i = 0; i < SIZE; ++i) { |
365 |
|
assertTrue(q.contains(new Integer(i))); |
366 |
< |
q.pollFirst(); |
366 |
> |
assertEquals(i, q.pollFirst()); |
367 |
|
assertFalse(q.contains(new Integer(i))); |
368 |
|
} |
369 |
|
} |
376 |
|
q.clear(); |
377 |
|
assertTrue(q.isEmpty()); |
378 |
|
assertEquals(0, q.size()); |
379 |
< |
q.add(new Integer(1)); |
379 |
> |
assertTrue(q.add(new Integer(1))); |
380 |
|
assertFalse(q.isEmpty()); |
381 |
|
q.clear(); |
382 |
|
assertTrue(q.isEmpty()); |
391 |
|
for (int i = 0; i < SIZE; ++i) { |
392 |
|
assertTrue(q.containsAll(p)); |
393 |
|
assertFalse(p.containsAll(q)); |
394 |
< |
p.add(new Integer(i)); |
394 |
> |
assertTrue(p.add(new Integer(i))); |
395 |
|
} |
396 |
|
assertTrue(p.containsAll(q)); |
397 |
|
} |
404 |
|
ArrayDeque p = populatedDeque(SIZE); |
405 |
|
for (int i = 0; i < SIZE; ++i) { |
406 |
|
boolean changed = q.retainAll(p); |
407 |
< |
if (i == 0) |
408 |
< |
assertFalse(changed); |
409 |
< |
else |
410 |
< |
assertTrue(changed); |
411 |
< |
|
407 |
> |
assertEquals(changed, (i > 0)); |
408 |
|
assertTrue(q.containsAll(p)); |
409 |
|
assertEquals(SIZE-i, q.size()); |
410 |
|
p.removeFirst(); |
421 |
|
assertTrue(q.removeAll(p)); |
422 |
|
assertEquals(SIZE-i, q.size()); |
423 |
|
for (int j = 0; j < i; ++j) { |
424 |
< |
Integer I = (Integer)(p.removeFirst()); |
429 |
< |
assertFalse(q.contains(I)); |
424 |
> |
assertFalse(q.contains(p.removeFirst())); |
425 |
|
} |
426 |
|
} |
427 |
|
} |
453 |
|
* toArray(null) throws NPE |
454 |
|
*/ |
455 |
|
public void testToArray_BadArg() { |
456 |
+ |
ArrayDeque l = new ArrayDeque(); |
457 |
+ |
l.add(new Object()); |
458 |
|
try { |
462 |
– |
ArrayDeque l = new ArrayDeque(); |
463 |
– |
l.add(new Object()); |
459 |
|
Object o[] = l.toArray(null); |
460 |
|
shouldThrow(); |
461 |
|
} catch (NullPointerException success) {} |
462 |
|
} |
463 |
|
|
464 |
|
/** |
465 |
< |
* toArray with incompatable aray type throws CCE |
465 |
> |
* toArray with incompatible array type throws CCE |
466 |
|
*/ |
467 |
|
public void testToArray1_BadArg() { |
468 |
+ |
ArrayDeque l = new ArrayDeque(); |
469 |
+ |
l.add(new Integer(5)); |
470 |
|
try { |
471 |
< |
ArrayDeque l = new ArrayDeque(); |
475 |
< |
l.add(new Integer(5)); |
476 |
< |
Object o[] = l.toArray(new String[10] ); |
471 |
> |
Object o[] = l.toArray(new String[10]); |
472 |
|
shouldThrow(); |
473 |
|
} catch (ArrayStoreException success) {} |
474 |
|
} |
497 |
|
q.add(new Integer(3)); |
498 |
|
int k = 0; |
499 |
|
for (Iterator it = q.iterator(); it.hasNext();) { |
500 |
< |
int i = ((Integer)(it.next())).intValue(); |
506 |
< |
assertEquals(++k, i); |
500 |
> |
assertEquals(++k, it.next()); |
501 |
|
} |
502 |
|
|
503 |
|
assertEquals(3, k); |
546 |
|
assertFalse(it.hasNext()); |
547 |
|
try { |
548 |
|
it.next(); |
549 |
+ |
shouldThrow(); |
550 |
|
} catch (NoSuchElementException success) {} |
551 |
|
} |
552 |
|
|
561 |
|
q.add(new Integer(1)); |
562 |
|
int k = 0; |
563 |
|
for (Iterator it = q.descendingIterator(); it.hasNext();) { |
564 |
< |
int i = ((Integer)(it.next())).intValue(); |
570 |
< |
assertEquals(++k, i); |
564 |
> |
assertEquals(++k, it.next()); |
565 |
|
} |
566 |
|
|
567 |
|
assertEquals(3, k); |
617 |
|
public void testAddFirst() { |
618 |
|
ArrayDeque q = populatedDeque(3); |
619 |
|
q.addFirst(four); |
620 |
< |
assertEquals(four,q.peekFirst()); |
620 |
> |
assertSame(four, q.peekFirst()); |
621 |
|
} |
622 |
|
|
623 |
|
/** |
626 |
|
public void testAddLast() { |
627 |
|
ArrayDeque q = populatedDeque(3); |
628 |
|
q.addLast(four); |
629 |
< |
assertEquals(four,q.peekLast()); |
629 |
> |
assertSame(four, q.peekLast()); |
630 |
|
} |
631 |
|
|
632 |
|
} |