394 |
|
} |
395 |
|
|
396 |
|
/** |
397 |
< |
* toArray contains all elements |
397 |
> |
* toArray contains all elements in sorted order |
398 |
|
*/ |
399 |
|
public void testToArray() { |
400 |
|
NavigableSet q = populatedSet(SIZE); |
401 |
|
Object[] o = q.toArray(); |
402 |
– |
Arrays.sort(o); |
402 |
|
for (int i = 0; i < o.length; i++) |
403 |
< |
assertEquals(o[i], q.pollFirst()); |
403 |
> |
assertSame(o[i], q.pollFirst()); |
404 |
|
} |
405 |
|
|
406 |
|
/** |
407 |
< |
* toArray(a) contains all elements |
407 |
> |
* toArray(a) contains all elements in sorted order |
408 |
|
*/ |
409 |
|
public void testToArray2() { |
410 |
|
NavigableSet q = populatedSet(SIZE); |
411 |
|
Integer[] ints = new Integer[SIZE]; |
412 |
< |
ints = (Integer[])q.toArray(ints); |
414 |
< |
Arrays.sort(ints); |
412 |
> |
assertSame(ints, q.toArray(ints)); |
413 |
|
for (int i = 0; i < ints.length; i++) |
414 |
< |
assertEquals(ints[i], q.pollFirst()); |
414 |
> |
assertSame(ints[i], q.pollFirst()); |
415 |
|
} |
416 |
|
|
417 |
|
/** |
901 |
|
public void testDescendingToArray2() { |
902 |
|
NavigableSet q = populatedSet(SIZE); |
903 |
|
Integer[] ints = new Integer[SIZE]; |
904 |
< |
ints = (Integer[])q.toArray(ints); |
904 |
> |
assertSame(ints, q.toArray(ints)); |
905 |
|
Arrays.sort(ints); |
906 |
|
for (int i = 0; i < ints.length; i++) |
907 |
|
assertEquals(ints[i], q.pollFirst()); |