| Methods Summary |
|---|
| public java.util.NavigableSet | descendingKeySet()Returns a reverse order {@link NavigableSet} view of the keys contained in this map.
The set's iterator returns the keys in descending order.
The set is backed by the map, so changes to the map are
reflected in the set, and vice-versa. The set supports element
removal, which removes the corresponding mapping from the map,
via the {@code Iterator.remove}, {@code Set.remove},
{@code removeAll}, {@code retainAll}, and {@code clear}
operations. It does not support the {@code add} or {@code addAll}
operations.
The view's {@code iterator} is a "weakly consistent" iterator
that will never throw {@link ConcurrentModificationException},
and guarantees to traverse elements as they existed upon
construction of the iterator, and may (but is not guaranteed to)
reflect any modifications subsequent to construction.
|
| public java.util.concurrent.ConcurrentNavigableMap | descendingMap()Returns a reverse order view of the mappings contained in this map.
The descending map is backed by this map, so changes to the map are
reflected in the descending map, and vice-versa.
The returned map has an ordering equivalent to
{@link Collections#reverseOrder(Comparator) Collections.reverseOrder}(comparator()).
The expression {@code m.descendingMap().descendingMap()} returns a
view of {@code m} essentially equivalent to {@code m}.
|
| public java.util.concurrent.ConcurrentNavigableMap | headMap(K toKey, boolean inclusive)
|
| public java.util.concurrent.ConcurrentNavigableMap | headMap(K toKey)
|
| public java.util.NavigableSet | keySet()Returns a {@link NavigableSet} view of the keys contained in this map.
The set's iterator returns the keys in ascending order.
The set is backed by the map, so changes to the map are
reflected in the set, and vice-versa. The set supports element
removal, which removes the corresponding mapping from the map,
via the {@code Iterator.remove}, {@code Set.remove},
{@code removeAll}, {@code retainAll}, and {@code clear}
operations. It does not support the {@code add} or {@code addAll}
operations.
The view's {@code iterator} is a "weakly consistent" iterator
that will never throw {@link ConcurrentModificationException},
and guarantees to traverse elements as they existed upon
construction of the iterator, and may (but is not guaranteed to)
reflect any modifications subsequent to construction.
This method is equivalent to method {@code navigableKeySet}.
|
| public java.util.NavigableSet | navigableKeySet()Returns a {@link NavigableSet} view of the keys contained in this map.
The set's iterator returns the keys in ascending order.
The set is backed by the map, so changes to the map are
reflected in the set, and vice-versa. The set supports element
removal, which removes the corresponding mapping from the map,
via the {@code Iterator.remove}, {@code Set.remove},
{@code removeAll}, {@code retainAll}, and {@code clear}
operations. It does not support the {@code add} or {@code addAll}
operations.
The view's {@code iterator} is a "weakly consistent" iterator
that will never throw {@link ConcurrentModificationException},
and guarantees to traverse elements as they existed upon
construction of the iterator, and may (but is not guaranteed to)
reflect any modifications subsequent to construction.
|
| public java.util.concurrent.ConcurrentNavigableMap | subMap(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive)
|
| public java.util.concurrent.ConcurrentNavigableMap | subMap(K fromKey, K toKey)
|
| public java.util.concurrent.ConcurrentNavigableMap | tailMap(K fromKey, boolean inclusive)
|
| public java.util.concurrent.ConcurrentNavigableMap | tailMap(K fromKey)
|
