33 |
|
* Returns a new set of given size containing consecutive |
34 |
|
* Integers 0 ... n - 1. |
35 |
|
*/ |
36 |
< |
private NavigableSet<Integer> populatedSet(int n) { |
36 |
> |
private static NavigableSet<Integer> populatedSet(int n) { |
37 |
|
TreeSet<Integer> q = new TreeSet<>(); |
38 |
|
assertTrue(q.isEmpty()); |
39 |
|
|
52 |
|
/** |
53 |
|
* Returns a new set of first 5 ints. |
54 |
|
*/ |
55 |
< |
private NavigableSet set5() { |
55 |
> |
private static NavigableSet set5() { |
56 |
|
TreeSet q = new TreeSet(); |
57 |
|
assertTrue(q.isEmpty()); |
58 |
|
q.add(one); |
67 |
|
return s; |
68 |
|
} |
69 |
|
|
70 |
< |
private NavigableSet dset5() { |
70 |
> |
private static NavigableSet dset5() { |
71 |
|
TreeSet q = new TreeSet(); |
72 |
|
assertTrue(q.isEmpty()); |
73 |
|
q.add(m1); |