| 9 |
|
/** |
| 10 |
|
* A {@link SortedMap} extended with navigation methods returning the |
| 11 |
|
* closest matches for given search targets. Methods |
| 12 |
< |
* {@code lowerEntry}, {@code floorEntry}, {@code ceilingEntry}, |
| 13 |
< |
* and {@code higherEntry} return {@code Map.Entry} objects |
| 12 |
> |
* {@link #lowerEntry}, {@link #floorEntry}, {@link #ceilingEntry}, |
| 13 |
> |
* and {@link #higherEntry} return {@code Map.Entry} objects |
| 14 |
|
* associated with keys respectively less than, less than or equal, |
| 15 |
|
* greater than or equal, and greater than a given key, returning |
| 16 |
|
* {@code null} if there is no such key. Similarly, methods |
| 17 |
< |
* {@code lowerKey}, {@code floorKey}, {@code ceilingKey}, and |
| 18 |
< |
* {@code higherKey} return only the associated keys. All of these |
| 17 |
> |
* {@link #lowerKey}, {@link #floorKey}, {@link #ceilingKey}, and |
| 18 |
> |
* {@link #higherKey} return only the associated keys. All of these |
| 19 |
|
* methods are designed for locating, not traversing entries. |
| 20 |
|
* |
| 21 |
|
* <p>A {@code NavigableMap} may be accessed and traversed in either |
| 30 |
|
* Submaps of any {@code NavigableMap} must implement the {@code |
| 31 |
|
* NavigableMap} interface. |
| 32 |
|
* |
| 33 |
< |
* <p>This interface additionally defines methods {@code firstEntry}, |
| 34 |
< |
* {@code pollFirstEntry}, {@code lastEntry}, and |
| 35 |
< |
* {@code pollLastEntry} that return and/or remove the least and |
| 33 |
> |
* <p>This interface additionally defines methods {@link #firstEntry}, |
| 34 |
> |
* {@link #pollFirstEntry}, {@link #lastEntry}, and |
| 35 |
> |
* {@link #pollLastEntry} that return and/or remove the least and |
| 36 |
|
* greatest mappings, if any exist, else returning {@code null}. |
| 37 |
|
* |
| 38 |
|
* <p>Implementations of entry-returning methods are expected to |
