GNU Classpath (0.97.2) | |
Prev Class | Next Class | Frames | No Frames |
Summary: Nested | Field | Method | Constr | Detail: Nested | Field | Method | Constr |
public interface ConcurrentNavigableMap<K,V>
extends ConcurrentMap<K,V>, NavigableMap<K,V>
ConcurrentMap
supporting NavigableMap
operations,
and recursively so for its navigable sub-maps.
This interface is a member of the
../../../../technotes/guides/collections/index.html">
Java Collections Framework.
Method Summary | |
NavigableSet |
|
ConcurrentNavigableMap |
|
ConcurrentNavigableMap |
|
ConcurrentNavigableMap |
|
NavigableSet |
|
NavigableSet |
|
ConcurrentNavigableMap |
|
ConcurrentNavigableMap |
|
ConcurrentNavigableMap |
|
ConcurrentNavigableMap |
|
Methods inherited from interface java.util.concurrent.ConcurrentMap<K,V> | |
putIfAbsent , remove , replace , replace |
Methods inherited from interface java.util.Map<K,V> | |
V>> entrySet , clear , containsKey , containsValue , equals , get , hashCode , isEmpty , keySet , put , putAll , remove , size , values |
Methods inherited from interface java.util.NavigableMap<K,V> | |
ceilingEntry , ceilingKey , descendingKeySet , descendingMap , firstEntry , floorEntry , floorKey , headMap , headMap , higherEntry , higherKey , lastEntry , lowerEntry , lowerKey , navigableKeySet , pollFirstEntry , pollLastEntry , subMap , subMap , tailMap , tailMap |
Methods inherited from interface java.util.SortedMap<K,V> | |
V> headMap , V> subMap , V> tailMap , firstKey , lastKey , super K> comparator |
public NavigableSetdescendingKeySet()
Returns a reverse orderNavigableSet
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 theIterator.remove
,Set.remove
,removeAll
,retainAll
, andclear
operations. It does not support theadd
oraddAll
operations. The view'siterator
is a "weakly consistent" iterator that will never throwConcurrentModificationException
, 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.
- Specified by:
- descendingKeySet in interface NavigableMap<K,V>
- Returns:
- a reverse order navigable set view of the keys in this map
public ConcurrentNavigableMapdescendingMap()
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 toCollections.reverseOrder
(comparator()). The expressionm.descendingMap().descendingMap()
returns a view ofm
essentially equivalent tom
.
- Specified by:
- descendingMap in interface NavigableMap<K,V>
- Returns:
- a reverse order view of this map
public ConcurrentNavigableMapheadMap(K toKey)
- Specified by:
- headMap in interface NavigableMap<K,V>
public ConcurrentNavigableMapheadMap(K toKey, boolean inclusive)
- Specified by:
- headMap in interface NavigableMap<K,V>
public NavigableSetkeySet()
Returns aNavigableSet
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 theIterator.remove
,Set.remove
,removeAll
,retainAll
, andclear
operations. It does not support theadd
oraddAll
operations. The view'siterator
is a "weakly consistent" iterator that will never throwConcurrentModificationException
, 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 methodnavigableKeySet
.
- Returns:
- a navigable set view of the keys in this map
public NavigableSetnavigableKeySet()
Returns aNavigableSet
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 theIterator.remove
,Set.remove
,removeAll
,retainAll
, andclear
operations. It does not support theadd
oraddAll
operations. The view'siterator
is a "weakly consistent" iterator that will never throwConcurrentModificationException
, 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.
- Specified by:
- navigableKeySet in interface NavigableMap<K,V>
- Returns:
- a navigable set view of the keys in this map
public ConcurrentNavigableMapsubMap(K fromKey, K toKey)
- Specified by:
- subMap in interface NavigableMap<K,V>
public ConcurrentNavigableMapsubMap(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive)
- Specified by:
- subMap in interface NavigableMap<K,V>
public ConcurrentNavigableMaptailMap(K fromKey)
- Specified by:
- tailMap in interface NavigableMap<K,V>
public ConcurrentNavigableMaptailMap(K fromKey, boolean inclusive)
- Specified by:
- tailMap in interface NavigableMap<K,V>
GNU Classpath (0.97.2) |