635 |
|
} |
636 |
|
|
637 |
|
/** |
638 |
< |
* toArray() contains all elements |
638 |
> |
* toArray() contains all elements in FIFO order |
639 |
|
*/ |
640 |
|
public void testToArray() { |
641 |
|
ConcurrentLinkedDeque q = populatedDeque(SIZE); |
642 |
|
Object[] o = q.toArray(); |
643 |
– |
Arrays.sort(o); |
643 |
|
for (int i = 0; i < o.length; i++) |
644 |
< |
assertEquals(o[i], q.poll()); |
644 |
> |
assertSame(o[i], q.poll()); |
645 |
|
} |
646 |
|
|
647 |
|
/** |
648 |
< |
* toArray(a) contains all elements |
648 |
> |
* toArray(a) contains all elements in FIFO order |
649 |
|
*/ |
650 |
|
public void testToArray2() { |
651 |
|
ConcurrentLinkedDeque q = populatedDeque(SIZE); |
652 |
|
Integer[] ints = new Integer[SIZE]; |
653 |
< |
ints = (Integer[])q.toArray(ints); |
655 |
< |
Arrays.sort(ints); |
653 |
> |
assertSame(ints, q.toArray(ints)); |
654 |
|
for (int i = 0; i < ints.length; i++) |
655 |
< |
assertEquals(ints[i], q.poll()); |
655 |
> |
assertSame(ints[i], q.poll()); |
656 |
|
} |
657 |
|
|
658 |
|
/** |