42 |
|
* Returns a new set of given size containing consecutive |
43 |
|
* Integers 0 ... n - 1. |
44 |
|
*/ |
45 |
< |
private TreeSet<Integer> populatedSet(int n) { |
46 |
< |
TreeSet<Integer> q = new TreeSet<Integer>(); |
45 |
> |
private static TreeSet<Integer> populatedSet(int n) { |
46 |
> |
TreeSet<Integer> q = new TreeSet<>(); |
47 |
|
assertTrue(q.isEmpty()); |
48 |
|
for (int i = n - 1; i >= 0; i -= 2) |
49 |
|
assertTrue(q.add(new Integer(i))); |
57 |
|
/** |
58 |
|
* Returns a new set of first 5 ints. |
59 |
|
*/ |
60 |
< |
private TreeSet set5() { |
60 |
> |
private static TreeSet set5() { |
61 |
|
TreeSet q = new TreeSet(); |
62 |
|
assertTrue(q.isEmpty()); |
63 |
|
q.add(one); |
454 |
|
*/ |
455 |
|
public void testToArray() { |
456 |
|
TreeSet q = populatedSet(SIZE); |
457 |
< |
Object[] o = q.toArray(); |
458 |
< |
for (int i = 0; i < o.length; i++) |
459 |
< |
assertSame(o[i], q.pollFirst()); |
457 |
> |
Object[] a = q.toArray(); |
458 |
> |
assertSame(Object[].class, a.getClass()); |
459 |
> |
for (Object o : a) |
460 |
> |
assertSame(o, q.pollFirst()); |
461 |
> |
assertTrue(q.isEmpty()); |
462 |
|
} |
463 |
|
|
464 |
|
/** |
469 |
|
Integer[] ints = new Integer[SIZE]; |
470 |
|
Integer[] array = q.toArray(ints); |
471 |
|
assertSame(ints, array); |
472 |
< |
for (int i = 0; i < ints.length; i++) |
473 |
< |
assertSame(ints[i], q.pollFirst()); |
472 |
> |
for (Integer o : ints) |
473 |
> |
assertSame(o, q.pollFirst()); |
474 |
> |
assertTrue(q.isEmpty()); |
475 |
|
} |
476 |
|
|
477 |
|
/** |
525 |
|
} |
526 |
|
|
527 |
|
/** |
528 |
< |
* A deserialized serialized set has same elements |
528 |
> |
* A deserialized/reserialized set equals original |
529 |
|
*/ |
530 |
|
public void testSerialization() throws Exception { |
531 |
|
NavigableSet x = populatedSet(SIZE); |