40 |
|
|
41 |
|
/** |
42 |
|
* Returns a new set of given size containing consecutive |
43 |
< |
* Integers 0 ... n. |
43 |
> |
* Integers 0 ... n - 1. |
44 |
|
*/ |
45 |
|
private TreeSet<Integer> populatedSet(int n) { |
46 |
|
TreeSet<Integer> q = new TreeSet<Integer>(); |
695 |
|
} |
696 |
|
|
697 |
|
static NavigableSet<Integer> newSet(Class cl) throws Exception { |
698 |
< |
NavigableSet<Integer> result = (NavigableSet<Integer>) cl.newInstance(); |
698 |
> |
NavigableSet<Integer> result = |
699 |
> |
(NavigableSet<Integer>) cl.getConstructor().newInstance(); |
700 |
|
assertEquals(0, result.size()); |
701 |
|
assertFalse(result.iterator().hasNext()); |
702 |
|
return result; |