27 |
|
* Create a set of given size containing consecutive |
28 |
|
* Integers 0 ... n. |
29 |
|
*/ |
30 |
< |
private ConcurrentSkipListSet populatedSet(int n) { |
31 |
< |
ConcurrentSkipListSet q = new ConcurrentSkipListSet(); |
30 |
> |
private ConcurrentSkipListSet<Integer> populatedSet(int n) { |
31 |
> |
ConcurrentSkipListSet<Integer> q = |
32 |
> |
new ConcurrentSkipListSet<Integer>(); |
33 |
|
assertTrue(q.isEmpty()); |
34 |
|
for (int i = n-1; i >= 0; i-=2) |
35 |
|
assertTrue(q.add(new Integer(i))); |
448 |
|
* toArray(a) contains all elements in sorted order |
449 |
|
*/ |
450 |
|
public void testToArray2() { |
451 |
< |
ConcurrentSkipListSet q = populatedSet(SIZE); |
451 |
> |
ConcurrentSkipListSet<Integer> q = populatedSet(SIZE); |
452 |
|
Integer[] ints = new Integer[SIZE]; |
453 |
< |
assertSame(ints, q.toArray(ints)); |
453 |
> |
Integer[] array = q.toArray(ints); |
454 |
> |
assertSame(ints, array); |
455 |
|
for (int i = 0; i < ints.length; i++) |
456 |
|
assertSame(ints[i], q.pollFirst()); |
457 |
|
} |