20 |
|
* descending ones. This interface additionally defines methods |
21 |
|
* {@code pollFirst} and {@code pollLast} that return and remove the |
22 |
|
* lowest and highest element, if one exists, else returning {@code |
23 |
< |
* null}. Methods {@code navigableSubSet}, {@code navigableHeadSet}, |
24 |
< |
* and {@code navigableTailSet} differ from the similarly named {@code |
23 |
> |
* null}. Methods {@code subSet}, {@code headSet}, |
24 |
> |
* and {@code tailSet} differ from the like-named {@code |
25 |
|
* SortedSet} methods in accepting additional arguments describing |
26 |
|
* whether lower and upper bounds are inclusive versus exclusive. |
27 |
|
* Subsets of any {@code NavigableSet} must implement the {@code |
180 |
|
* has a restricted range, and {@code fromElement} or |
181 |
|
* {@code toElement} lies outside the bounds of the range. |
182 |
|
*/ |
183 |
< |
NavigableSet<E> navigableSubSet(E fromElement, boolean fromInclusive, |
184 |
< |
E toElement, boolean toInclusive); |
183 |
> |
NavigableSet<E> subSet(E fromElement, boolean fromInclusive, |
184 |
> |
E toElement, boolean toInclusive); |
185 |
|
|
186 |
|
/** |
187 |
|
* Returns a view of the portion of this set whose elements are less than |
210 |
|
* restricted range, and {@code toElement} lies outside the |
211 |
|
* bounds of the range |
212 |
|
*/ |
213 |
< |
NavigableSet<E> navigableHeadSet(E toElement, boolean inclusive); |
213 |
> |
NavigableSet<E> headSet(E toElement, boolean inclusive); |
214 |
|
|
215 |
|
/** |
216 |
|
* Returns a view of the portion of this set whose elements are greater |
239 |
|
* restricted range, and {@code fromElement} lies outside the |
240 |
|
* bounds of the range |
241 |
|
*/ |
242 |
< |
NavigableSet<E> navigableTailSet(E fromElement, boolean inclusive); |
242 |
> |
NavigableSet<E> tailSet(E fromElement, boolean inclusive); |
243 |
|
} |