620 |
|
} |
621 |
|
|
622 |
|
/** |
623 |
< |
* toArray() contains all elements |
623 |
> |
* toArray() contains all elements in FIFO order |
624 |
|
*/ |
625 |
|
public void testToArray() { |
626 |
|
ArrayDeque q = populatedDeque(SIZE); |
627 |
|
Object[] o = q.toArray(); |
628 |
– |
Arrays.sort(o); |
628 |
|
for (int i = 0; i < o.length; i++) |
629 |
< |
assertEquals(o[i], q.pollFirst()); |
629 |
> |
assertSame(o[i], q.pollFirst()); |
630 |
|
} |
631 |
|
|
632 |
|
/** |
633 |
< |
* toArray(a) contains all elements |
633 |
> |
* toArray(a) contains all elements in FIFO order |
634 |
|
*/ |
635 |
|
public void testToArray2() { |
636 |
|
ArrayDeque q = populatedDeque(SIZE); |
637 |
|
Integer[] ints = new Integer[SIZE]; |
638 |
< |
ints = (Integer[])q.toArray(ints); |
640 |
< |
Arrays.sort(ints); |
638 |
> |
assertSame(ints, q.toArray(ints)); |
639 |
|
for (int i = 0; i < ints.length; i++) |
640 |
< |
assertEquals(ints[i], q.pollFirst()); |
640 |
> |
assertSame(ints[i], q.remove()); |
641 |
|
} |
642 |
|
|
643 |
|
/** |