| java.util.concurrent.ConcurrentNavigableMap
| Method Summary | |
| public NavigableSet<K> | descendingKeySet()
Returns a reverse order
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. | | ConcurrentNavigableMap<K, V> | descendingMap()
Returns a reverse order view of the mappings contained in this map. | | ConcurrentNavigableMap<K, V> | headMap(K toKey, boolean inclusive)
| | ConcurrentNavigableMap<K, V> | headMap(K toKey)
| | NavigableSet<K> | keySet()
Returns a
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. | | public NavigableSet<K> | navigableKeySet()
Returns a
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. | | ConcurrentNavigableMap<K, V> | subMap(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive)
| | ConcurrentNavigableMap<K, V> | subMap(K fromKey, K toKey)
| | ConcurrentNavigableMap<K, V> | tailMap(K fromKey, boolean inclusive)
| | ConcurrentNavigableMap<K, V> | tailMap(K fromKey)
|
| descendingKeySet | | public NavigableSet<K> descendingKeySet()(Code) | | Returns a reverse order
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
Iterator.remove ,
Set.remove ,
removeAll ,
retainAll , and
clear operations. It does not support the
add or
addAll operations.
The view's
iterator is a "weakly consistent" iterator
that will never throw
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.
a reverse order navigable set view of the keys in this map |
| descendingMap | | ConcurrentNavigableMap<K, V> descendingMap()(Code) | | 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
Collections.reverseOrder(Comparator) Collections.reverseOrder (comparator()).
The expression
m.descendingMap().descendingMap() returns a
view of
m essentially equivalent to
m .
a reverse order view of this map |
| keySet | | NavigableSet<K> keySet()(Code) | | Returns a
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
Iterator.remove ,
Set.remove ,
removeAll ,
retainAll , and
clear operations. It does not support the
add or
addAll operations.
The view's
iterator is a "weakly consistent" iterator
that will never throw
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
navigableKeySet .
a navigable set view of the keys in this map |
| navigableKeySet | | public NavigableSet<K> navigableKeySet()(Code) | | Returns a
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
Iterator.remove ,
Set.remove ,
removeAll ,
retainAll , and
clear operations. It does not support the
add or
addAll operations.
The view's
iterator is a "weakly consistent" iterator
that will never throw
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.
a navigable set view of the keys in this map |
|
|