41 |
|
assertTrue(q.add(new Integer(i))); |
42 |
|
assertTrue(q.add(new Integer(-n))); |
43 |
|
assertTrue(q.add(new Integer(n))); |
44 |
< |
NavigableSet s = q.navigableSubSet(new Integer(0), new Integer(n)); |
44 |
> |
NavigableSet s = q.navigableSubSet(new Integer(0), true, new Integer(n), false); |
45 |
|
assertFalse(s.isEmpty()); |
46 |
|
assertEquals(n, s.size()); |
47 |
|
return s; |
60 |
|
q.add(five); |
61 |
|
q.add(zero); |
62 |
|
q.add(seven); |
63 |
< |
NavigableSet s = q.navigableSubSet(one, seven); |
63 |
> |
NavigableSet s = q.navigableSubSet(one, true, seven, false); |
64 |
|
assertEquals(5, s.size()); |
65 |
|
return s; |
66 |
|
} |
68 |
|
private static NavigableSet set0() { |
69 |
|
ConcurrentSkipListSet set = new ConcurrentSkipListSet(); |
70 |
|
assertTrue(set.isEmpty()); |
71 |
< |
return set.navigableTailSet(m1); |
71 |
> |
return set.navigableTailSet(m1, true); |
72 |
|
} |
73 |
|
|
74 |
|
/** |