33 |
|
* Integers 0 ... n - 1. |
34 |
|
*/ |
35 |
|
private static NavigableSet<Integer> populatedSet(int n) { |
36 |
< |
ConcurrentSkipListSet<Integer> q = |
37 |
< |
new ConcurrentSkipListSet<Integer>(); |
36 |
> |
ConcurrentSkipListSet<Integer> q = new ConcurrentSkipListSet<>(); |
37 |
|
assertTrue(q.isEmpty()); |
38 |
|
|
39 |
|
for (int i = n - 1; i >= 0; i -= 2) |
407 |
|
*/ |
408 |
|
public void testToArray() { |
409 |
|
NavigableSet q = populatedSet(SIZE); |
410 |
< |
Object[] o = q.toArray(); |
411 |
< |
for (int i = 0; i < o.length; i++) |
412 |
< |
assertSame(o[i], q.pollFirst()); |
410 |
> |
Object[] a = q.toArray(); |
411 |
> |
assertSame(Object[].class, a.getClass()); |
412 |
> |
for (Object o : a) |
413 |
> |
assertSame(o, q.pollFirst()); |
414 |
> |
assertTrue(q.isEmpty()); |
415 |
|
} |
416 |
|
|
417 |
|
/** |
422 |
|
Integer[] ints = new Integer[SIZE]; |
423 |
|
Integer[] array = q.toArray(ints); |
424 |
|
assertSame(ints, array); |
425 |
< |
for (int i = 0; i < ints.length; i++) |
426 |
< |
assertSame(ints[i], q.pollFirst()); |
425 |
> |
for (Integer o : ints) |
426 |
> |
assertSame(o, q.pollFirst()); |
427 |
> |
assertTrue(q.isEmpty()); |
428 |
|
} |
429 |
|
|
430 |
|
/** |
478 |
|
} |
479 |
|
|
480 |
|
/** |
481 |
< |
* A deserialized serialized set has same elements |
481 |
> |
* A deserialized/reserialized set equals original |
482 |
|
*/ |
483 |
|
public void testSerialization() throws Exception { |
484 |
|
NavigableSet x = populatedSet(SIZE); |
977 |
|
} |
978 |
|
|
979 |
|
/** |
980 |
< |
* A deserialized serialized set has same elements |
980 |
> |
* A deserialized/reserialized set equals original |
981 |
|
*/ |
982 |
|
public void testDescendingSerialization() throws Exception { |
983 |
|
NavigableSet x = dset5(); |