Home » openjdk-7 » java » util » concurrent » [javadoc | source]
java.util.concurrent
static final class: ConcurrentSkipListMap.SubMap [javadoc | source]
java.lang.Object
   java.util.AbstractMap<K, V>
      java.util.concurrent.ConcurrentSkipListMap$SubMap

All Implemented Interfaces:
    Cloneable, ConcurrentNavigableMap, java$io$Serializable, Map

Submaps returned by ConcurrentSkipListMap submap operations represent a subrange of mappings of their underlying maps. Instances of this class support all methods of their underlying maps, differing in that mappings outside their range are ignored, and attempts to add mappings outside their ranges result in IllegalArgumentException . Instances of this class are constructed only using the subMap, headMap, and tailMap methods of their underlying maps.
Nested Class Summary:
abstract class  SubMap.SubMapIter  Variant of main Iter class to traverse through submaps. 
final class  SubMap.SubMapValueIterator   
final class  SubMap.SubMapKeyIterator   
final class  SubMap.SubMapEntryIterator   
Fields inherited from java.util.AbstractMap:
keySet,  values
Constructor:
 SubMap(ConcurrentSkipListMap<K, V> map,
    K fromKey,
    boolean fromInclusive,
    K toKey,
    boolean toInclusive,
    boolean isDescending) 
    Creates a new submap, initializing all fields
Method from java.util.concurrent.ConcurrentSkipListMap$SubMap Summary:
ceilingEntry,   ceilingKey,   clear,   comparator,   containsKey,   containsValue,   descendingKeySet,   descendingMap,   entryIterator,   entrySet,   firstEntry,   firstKey,   floorEntry,   floorKey,   get,   headMap,   headMap,   higherEntry,   higherKey,   isEmpty,   keyIterator,   keySet,   lastEntry,   lastKey,   lowerEntry,   lowerKey,   navigableKeySet,   pollFirstEntry,   pollLastEntry,   put,   putIfAbsent,   remove,   remove,   replace,   replace,   size,   subMap,   subMap,   tailMap,   tailMap,   valueIterator,   values
Methods from java.util.AbstractMap:
clear,   clone,   containsKey,   containsValue,   entrySet,   equals,   get,   hashCode,   isEmpty,   keySet,   put,   putAll,   remove,   size,   toString,   values
Methods from java.lang.Object:
clone,   equals,   finalize,   getClass,   hashCode,   notify,   notifyAll,   toString,   wait,   wait,   wait
Method from java.util.concurrent.ConcurrentSkipListMap$SubMap Detail:
 public Entry<K, V> ceilingEntry(K key) 
 public K ceilingKey(K key) 
 public  void clear() 
 public Comparator<? super K> comparator() 
 public boolean containsKey(Object key) 
 public boolean containsValue(Object value) 
 public NavigableSet<K> descendingKeySet() 
 public SubMap<K, V> descendingMap() 
 Iterator<K, V> entryIterator() 
 public Set<K, V> entrySet() 
 public Entry<K, V> firstEntry() 
 public K firstKey() 
 public Entry<K, V> floorEntry(K key) 
 public K floorKey(K key) 
 public V get(Object key) 
 public SubMap<K, V> headMap(K toKey) 
 public SubMap<K, V> headMap(K toKey,
    boolean inclusive) 
 public Entry<K, V> higherEntry(K key) 
 public K higherKey(K key) 
 public boolean isEmpty() 
 Iterator<K> keyIterator() 
 public NavigableSet<K> keySet() 
 public Entry<K, V> lastEntry() 
 public K lastKey() 
 public Entry<K, V> lowerEntry(K key) 
 public K lowerKey(K key) 
 public NavigableSet<K> navigableKeySet() 
 public Entry<K, V> pollFirstEntry() 
 public Entry<K, V> pollLastEntry() 
 public V put(K key,
    V value) 
 public V putIfAbsent(K key,
    V value) 
 public V remove(Object key) 
 public boolean remove(Object key,
    Object value) 
 public V replace(K key,
    V value) 
 public boolean replace(K key,
    V oldValue,
    V newValue) 
 public int size() 
 public SubMap<K, V> subMap(K fromKey,
    K toKey) 
 public SubMap<K, V> subMap(K fromKey,
    boolean fromInclusive,
    K toKey,
    boolean toInclusive) 
 public SubMap<K, V> tailMap(K fromKey) 
 public SubMap<K, V> tailMap(K fromKey,
    boolean inclusive) 
 Iterator<V> valueIterator() 
 public Collection<V> values()