23 |
|
* method returns a view of the map with the senses of all relational |
24 |
|
* and directional methods inverted. The performance of ascending |
25 |
|
* operations and views is likely to be faster than that of descending |
26 |
< |
* ones. Methods {@code navigableSubMap}, {@code navigableHeadMap}, |
27 |
< |
* and {@code navigableTailMap} differ from the similarly named {@code |
26 |
> |
* ones. Methods {@code subMap}, {@code headMap}, |
27 |
> |
* and {@code tailMap} differ from the like-named {@code |
28 |
|
* SortedMap} methods in accepting additional arguments describing |
29 |
|
* whether lower and upper bounds are inclusive versus exclusive. |
30 |
|
* Submaps of any {@code NavigableMap} must implement the {@code |
287 |
|
* range, and {@code fromKey} or {@code toKey} lies |
288 |
|
* outside the bounds of the range |
289 |
|
*/ |
290 |
< |
NavigableMap<K,V> navigableSubMap(K fromKey, boolean fromInclusive, |
291 |
< |
K toKey, boolean toInclusive); |
290 |
> |
NavigableMap<K,V> subMap(K fromKey, boolean fromInclusive, |
291 |
> |
K toKey, boolean toInclusive); |
292 |
|
|
293 |
|
/** |
294 |
|
* Returns a view of the portion of this map whose keys are less than (or |
317 |
|
* restricted range, and {@code toKey} lies outside the |
318 |
|
* bounds of the range |
319 |
|
*/ |
320 |
< |
NavigableMap<K,V> navigableHeadMap(K toKey, boolean inclusive); |
320 |
> |
NavigableMap<K,V> headMap(K toKey, boolean inclusive); |
321 |
|
|
322 |
|
/** |
323 |
|
* Returns a view of the portion of this map whose keys are greater than (or |
346 |
|
* restricted range, and {@code fromKey} lies outside the |
347 |
|
* bounds of the range |
348 |
|
*/ |
349 |
< |
NavigableMap<K,V> navigableTailMap(K fromKey, boolean inclusive); |
349 |
> |
NavigableMap<K,V> tailMap(K fromKey, boolean inclusive); |
350 |
|
} |