42 |
|
* Returns a new set of given size containing consecutive |
43 |
|
* Integers 0 ... n - 1. |
44 |
|
*/ |
45 |
< |
private TreeSet<Integer> populatedSet(int n) { |
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) |
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); |