| 12 |
|
* {@link #floor}, {@link #ceiling}, and {@link #higher} return elements |
| 13 |
|
* respectively less than, less than or equal, greater than or equal, |
| 14 |
|
* and greater than a given element, returning {@code null} if there |
| 15 |
< |
* is no such element. A {@code NavigableSet} may be accessed and |
| 16 |
< |
* traversed in either ascending or descending order. The {@code |
| 17 |
< |
* descendingSet} method returns a view of the set with the senses of |
| 18 |
< |
* all relational and directional methods inverted. The performance of |
| 19 |
< |
* ascending operations and views is likely to be faster than that of |
| 20 |
< |
* descending ones. This interface additionally defines methods |
| 21 |
< |
* {@link #pollFirst} and {@link #pollLast} that return and remove the |
| 22 |
< |
* lowest and highest element, if one exists, else returning {@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 |
| 28 |
< |
* NavigableSet} interface. |
| 15 |
> |
* is no such element. |
| 16 |
> |
* |
| 17 |
> |
* <p>A {@code NavigableSet} may be accessed and traversed in either |
| 18 |
> |
* ascending or descending order. The {@link #descendingSet} method |
| 19 |
> |
* returns a view of the set with the senses of all relational and |
| 20 |
> |
* directional methods inverted. The performance of ascending |
| 21 |
> |
* operations and views is likely to be faster than that of descending |
| 22 |
> |
* ones. This interface additionally defines methods {@link |
| 23 |
> |
* #pollFirst} and {@link #pollLast} that return and remove the lowest |
| 24 |
> |
* and highest element, if one exists, else returning {@code null}. |
| 25 |
> |
* Methods |
| 26 |
> |
* {@link #subSet(Object, boolean, Object, boolean) subSet(E, boolean, E, boolean)}, |
| 27 |
> |
* {@link #headSet(Object, boolean) headSet(E, boolean)}, and |
| 28 |
> |
* {@link #tailSet(Object, boolean) tailSet(E, boolean)} |
| 29 |
> |
* differ from the like-named {@code SortedSet} methods in accepting |
| 30 |
> |
* additional arguments describing whether lower and upper bounds are |
| 31 |
> |
* inclusive versus exclusive. Subsets of any {@code NavigableSet} |
| 32 |
> |
* must implement the {@code NavigableSet} interface. |
| 33 |
|
* |
| 34 |
|
* <p>The return values of navigation methods may be ambiguous in |
| 35 |
|
* implementations that permit {@code null} elements. However, even |
