451 |
|
*/ |
452 |
|
public void testDescendingIteratorRemove () { |
453 |
|
final LinkedList q = new LinkedList(); |
454 |
< |
q.add(new Integer(3)); |
455 |
< |
q.add(new Integer(2)); |
456 |
< |
q.add(new Integer(1)); |
454 |
> |
q.add(three); |
455 |
> |
q.add(two); |
456 |
> |
q.add(one); |
457 |
|
Iterator it = q.descendingIterator(); |
458 |
|
it.next(); |
459 |
|
it.remove(); |
460 |
|
it = q.descendingIterator(); |
461 |
< |
assertEquals(it.next(), 2); |
462 |
< |
assertEquals(it.next(), 3); |
461 |
> |
assertSame(it.next(), two); |
462 |
> |
assertSame(it.next(), three); |
463 |
|
assertFalse(it.hasNext()); |
464 |
|
} |
465 |
|
|
481 |
|
public void testAddFirst() { |
482 |
|
LinkedList q = populatedQueue(3); |
483 |
|
q.addFirst(four); |
484 |
< |
assertEquals(four,q.peek()); |
484 |
> |
assertSame(four, q.peek()); |
485 |
|
} |
486 |
|
|
487 |
|
/** |
489 |
|
*/ |
490 |
|
public void testPush() { |
491 |
|
LinkedList q = populatedQueue(3); |
492 |
– |
q.pollLast(); |
492 |
|
q.push(four); |
493 |
< |
assertEquals(four,q.peekFirst()); |
493 |
> |
assertSame(four, q.peekFirst()); |
494 |
|
} |
495 |
|
|
496 |
|
/** |