27 |
|
* Create a set of given size containing consecutive |
28 |
|
* Integers 0 ... n. |
29 |
|
*/ |
30 |
< |
private NavigableSet populatedSet(int n) { |
31 |
< |
TreeSet q = new TreeSet(); |
30 |
> |
private NavigableSet<Integer> populatedSet(int n) { |
31 |
> |
TreeSet<Integer> q = new TreeSet<Integer>(); |
32 |
|
assertTrue(q.isEmpty()); |
33 |
|
|
34 |
|
for (int i = n-1; i >= 0; i-=2) |
407 |
|
* toArray(a) contains all elements in sorted order |
408 |
|
*/ |
409 |
|
public void testToArray2() { |
410 |
< |
NavigableSet q = populatedSet(SIZE); |
410 |
> |
NavigableSet<Integer> q = populatedSet(SIZE); |
411 |
|
Integer[] ints = new Integer[SIZE]; |
412 |
< |
assertSame(ints, q.toArray(ints)); |
412 |
> |
Integer[] array = q.toArray(ints); |
413 |
> |
assertSame(ints, array); |
414 |
|
for (int i = 0; i < ints.length; i++) |
415 |
|
assertSame(ints[i], q.pollFirst()); |
416 |
|
} |