27 |
|
* Create a set of given size containing consecutive |
28 |
|
* Integers 0 ... n. |
29 |
|
*/ |
30 |
< |
private NavigableSet populatedSet(int n) { |
31 |
< |
ConcurrentSkipListSet q = new ConcurrentSkipListSet(); |
30 |
> |
private NavigableSet<Integer> populatedSet(int n) { |
31 |
> |
ConcurrentSkipListSet<Integer> q = |
32 |
> |
new ConcurrentSkipListSet<Integer>(); |
33 |
|
assertTrue(q.isEmpty()); |
34 |
|
|
35 |
|
for (int i = n-1; i >= 0; i-=2) |
398 |
|
} |
399 |
|
|
400 |
|
/** |
401 |
< |
* toArray contains all elements |
401 |
> |
* toArray contains all elements in sorted order |
402 |
|
*/ |
403 |
|
public void testToArray() { |
404 |
|
NavigableSet q = populatedSet(SIZE); |
405 |
|
Object[] o = q.toArray(); |
405 |
– |
Arrays.sort(o); |
406 |
|
for (int i = 0; i < o.length; i++) |
407 |
< |
assertEquals(o[i], q.pollFirst()); |
407 |
> |
assertSame(o[i], q.pollFirst()); |
408 |
|
} |
409 |
|
|
410 |
|
/** |
411 |
< |
* toArray(a) contains all elements |
411 |
> |
* toArray(a) contains all elements in sorted order |
412 |
|
*/ |
413 |
|
public void testToArray2() { |
414 |
< |
NavigableSet q = populatedSet(SIZE); |
414 |
> |
NavigableSet<Integer> q = populatedSet(SIZE); |
415 |
|
Integer[] ints = new Integer[SIZE]; |
416 |
< |
ints = (Integer[])q.toArray(ints); |
417 |
< |
Arrays.sort(ints); |
416 |
> |
Integer[] array = q.toArray(ints); |
417 |
> |
assertSame(ints, array); |
418 |
|
for (int i = 0; i < ints.length; i++) |
419 |
< |
assertEquals(ints[i], q.pollFirst()); |
419 |
> |
assertSame(ints[i], q.pollFirst()); |
420 |
|
} |
421 |
|
|
422 |
|
/** |
917 |
|
public void testDescendingToArray2() { |
918 |
|
NavigableSet q = populatedSet(SIZE); |
919 |
|
Integer[] ints = new Integer[SIZE]; |
920 |
< |
ints = (Integer[])q.toArray(ints); |
920 |
> |
assertSame(ints, q.toArray(ints)); |
921 |
|
Arrays.sort(ints); |
922 |
|
for (int i = 0; i < ints.length; i++) |
923 |
|
assertEquals(ints[i], q.pollFirst()); |