| Package | Description | 
|---|---|
| java.util.concurrent | 
 Utility classes commonly useful in concurrent programming. 
 | 
| Modifier and Type | Class and Description | 
|---|---|
class  | 
ConcurrentSkipListMap<K,V>
A scalable concurrent  
ConcurrentNavigableMap implementation. | 
| Modifier and Type | Method and Description | 
|---|---|
ConcurrentNavigableMap<K,V> | 
ConcurrentNavigableMap.descendingMap()
Returns a reverse order view of the mappings contained in this map. 
 | 
ConcurrentNavigableMap<K,V> | 
ConcurrentSkipListMap.descendingMap()  | 
ConcurrentNavigableMap<K,V> | 
ConcurrentNavigableMap.headMap(K toKey)  | 
ConcurrentNavigableMap<K,V> | 
ConcurrentSkipListMap.headMap(K toKey)  | 
ConcurrentNavigableMap<K,V> | 
ConcurrentNavigableMap.headMap(K toKey,
       boolean inclusive)  | 
ConcurrentNavigableMap<K,V> | 
ConcurrentSkipListMap.headMap(K toKey,
       boolean inclusive)  | 
ConcurrentNavigableMap<K,V> | 
ConcurrentNavigableMap.subMap(K fromKey,
      boolean fromInclusive,
      K toKey,
      boolean toInclusive)  | 
ConcurrentNavigableMap<K,V> | 
ConcurrentSkipListMap.subMap(K fromKey,
      boolean fromInclusive,
      K toKey,
      boolean toInclusive)  | 
ConcurrentNavigableMap<K,V> | 
ConcurrentNavigableMap.subMap(K fromKey,
      K toKey)  | 
ConcurrentNavigableMap<K,V> | 
ConcurrentSkipListMap.subMap(K fromKey,
      K toKey)  | 
ConcurrentNavigableMap<K,V> | 
ConcurrentNavigableMap.tailMap(K fromKey)  | 
ConcurrentNavigableMap<K,V> | 
ConcurrentSkipListMap.tailMap(K fromKey)  | 
ConcurrentNavigableMap<K,V> | 
ConcurrentNavigableMap.tailMap(K fromKey,
       boolean inclusive)  | 
ConcurrentNavigableMap<K,V> | 
ConcurrentSkipListMap.tailMap(K fromKey,
       boolean inclusive)  | 
 Submit a bug or feature 
For further API reference and developer documentation, see Java SE Documentation. That documentation contains more detailed, developer-targeted descriptions, with conceptual overviews, definitions of terms, workarounds, and working code examples.
 Copyright © 1993, 2014, Oracle and/or its affiliates.  All rights reserved.