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