620 |
|
it.next(); |
621 |
|
it.remove(); |
622 |
|
it = q.iterator(); |
623 |
< |
assertEquals(it.next(), new PDelay(2)); |
624 |
< |
assertEquals(it.next(), new PDelay(3)); |
623 |
> |
assertEquals(new PDelay(2), it.next()); |
624 |
> |
assertEquals(new PDelay(3), it.next()); |
625 |
|
assertFalse(it.hasNext()); |
626 |
|
} |
627 |
|
|
718 |
|
} |
719 |
|
ArrayList l = new ArrayList(); |
720 |
|
q.drainTo(l); |
721 |
< |
assertEquals(q.size(), 0); |
721 |
> |
assertEquals(0, q.size()); |
722 |
|
for (int i = 0; i < SIZE; ++i) |
723 |
< |
assertEquals(l.get(i), elems[i]); |
723 |
> |
assertEquals(elems[i], l.get(i)); |
724 |
|
q.add(elems[0]); |
725 |
|
q.add(elems[1]); |
726 |
|
assertFalse(q.isEmpty()); |
728 |
|
assertTrue(q.contains(elems[1])); |
729 |
|
l.clear(); |
730 |
|
q.drainTo(l); |
731 |
< |
assertEquals(q.size(), 0); |
732 |
< |
assertEquals(l.size(), 2); |
731 |
> |
assertEquals(0, q.size()); |
732 |
> |
assertEquals(2, l.size()); |
733 |
|
for (int i = 0; i < 2; ++i) |
734 |
< |
assertEquals(l.get(i), elems[i]); |
734 |
> |
assertEquals(elems[i], l.get(i)); |
735 |
|
} |
736 |
|
|
737 |
|
/** |
761 |
|
ArrayList l = new ArrayList(); |
762 |
|
q.drainTo(l, i); |
763 |
|
int k = (i < SIZE) ? i : SIZE; |
764 |
< |
assertEquals(q.size(), SIZE-k); |
765 |
< |
assertEquals(l.size(), k); |
764 |
> |
assertEquals(SIZE-k, q.size()); |
765 |
> |
assertEquals(k, l.size()); |
766 |
|
} |
767 |
|
} |
768 |
|
|