32 |
|
* Create a set of given size containing consecutive |
33 |
|
* Integers 0 ... n. |
34 |
|
*/ |
35 |
< |
private TreeSet populatedSet(int n) { |
36 |
< |
TreeSet q = new TreeSet(); |
35 |
> |
private TreeSet<Integer> populatedSet(int n) { |
36 |
> |
TreeSet<Integer> q = new TreeSet<Integer>(); |
37 |
|
assertTrue(q.isEmpty()); |
38 |
|
for (int i = n-1; i >= 0; i-=2) |
39 |
|
assertTrue(q.add(new Integer(i))); |
452 |
|
* toArray(a) contains all elements in sorted order |
453 |
|
*/ |
454 |
|
public void testToArray2() { |
455 |
< |
TreeSet q = populatedSet(SIZE); |
455 |
> |
TreeSet<Integer> q = populatedSet(SIZE); |
456 |
|
Integer[] ints = new Integer[SIZE]; |
457 |
< |
assertSame(ints, q.toArray(ints)); |
457 |
> |
Integer[] array = q.toArray(ints); |
458 |
> |
assertSame(ints, array); |
459 |
|
for (int i = 0; i < ints.length; i++) |
460 |
|
assertSame(ints[i], q.pollFirst()); |
461 |
|
} |