API Overview API Index Package Overview Direct link to this page
JDK 1.6
  java.util.concurrent. ConcurrentSkipListMap View Source
Author(s)
Doug Lea
Since
1.6
Version
Serial
Hierarchy
 Object
      AbstractMap
          ConcurrentSkipListMap
Implements
 ConcurrentNavigableMap
 Cloneable
 Serializable
Subclasses
Description
public class ConcurrentSkipListMap
  A scalable concurrent ConcurrentNavigableMap implementation.
See also:   
Constructors
public ConcurrentSkipListMap ()
Constructs a new, empty map, sorted according to the natural ordering of the keys.
public ConcurrentSkipListMap (Comparator<Object> comparator)
  Constructs a new, empty map, sorted according to the specified comparator.
public ConcurrentSkipListMap (Map<Object, Object> m)
  Constructs a new map containing the same mappings as the given map, sorted according to the natural ordering of the keys.
public ConcurrentSkipListMap (SortedMap< K, Object> m)
  Constructs a new map containing the same mappings and using the same ordering as the specified sorted map.
Methods
Hide/Show inherited methods
public Entry< K, V> ceilingEntry ( K key)
  Returns a key-value mapping associated with the least key greater than or equal to the given key, or null if there is no such entry.
public K ceilingKey ( K key)
 
public void clear () [Overrides AbstractMap]
Removes all of the mappings from this map.
public ConcurrentSkipListMap< K, V> clone () [Overrides AbstractMap]
  Returns a shallow copy of this ConcurrentSkipListMap instance.
public Comparator<Object> comparator ()
pack-private int compare ( K k1, K k2) throws ClassCastException
  Compares using comparator or natural ordering.
public boolean containsKey (Object key) [Overrides AbstractMap]
  Returns true if this map contains a mapping for the specified key.
public boolean containsValue (Object value) [Overrides AbstractMap]
  Returns true if this map maps one or more keys to the specified value.
public NavigableSet< K> descendingKeySet () [Specified in ConcurrentNavigableMap]
public ConcurrentNavigableMap< K, V> descendingMap () [Specified in ConcurrentNavigableMap]
pack-privatefinal V doRemove (Object okey, Object value)
  Main deletion method.
pack-private Entry< K, V> doRemoveFirstEntry ()
  Removes first entry; returns its snapshot.
pack-private Entry< K, V> doRemoveLastEntry ()
  Removes last entry; returns its snapshot.
pack-private Iterator<Entry< K, V>> entryIterator ()
public Set<Entry< K, V>> entrySet () [Specified in AbstractMap]
  Returns a Set view of the mappings contained in this map.
public boolean equals (Object o) [Overrides AbstractMap]
  Compares the specified object with this map for equality.
pack-private Node< K, V> findFirst ()
  Specialized variant of findNode to get first valid node.
pack-private Node< K, V> findLast ()
  Specialized version of find to get last valid node.
pack-private Node< K, V> findNear ( K kkey, int rel)
  Utility for ceiling, floor, lower, higher methods.
public Entry< K, V> firstEntry ()
  Returns a key-value mapping associated with the least key in this map, or null if the map is empty.
public K firstKey ()
 
public Entry< K, V> floorEntry ( K key)
  Returns a key-value mapping associated with the greatest key less than or equal to the given key, or null if there is no such key.
public K floorKey ( K key)
 
public V get (Object key) [Overrides AbstractMap]
  Returns the value to which the specified key is mapped, or null if this map contains no mapping for the key.
pack-private SimpleImmutableEntry< K, V> getNear ( K key, int rel)
  Returns SimpleImmutableEntry for results of findNear.
public int hashCode () [Inherited From AbstractMap]
  Returns the hash code value for this map.
public ConcurrentNavigableMap< K, V> headMap ( K toKey) [Specified in ConcurrentNavigableMap]
 
public ConcurrentNavigableMap< K, V> headMap ( K toKey, boolean inclusive) [Specified in ConcurrentNavigableMap]
 
public Entry< K, V> higherEntry ( K key)
  Returns a key-value mapping associated with the least key strictly greater than the given key, or null if there is no such key.
public K higherKey ( K key)
 
pack-private boolean inHalfOpenRange ( K key, K least, K fence)
  Returns true if given key greater than or equal to least and strictly less than fence, bypassing either test if least or fence are null.
pack-privatefinal void initialize ()
  Initializes or resets state.
pack-private boolean inOpenRange ( K key, K least, K fence)
  Returns true if given key greater than or equal to least and less or equal to fence.
public boolean isEmpty () [Overrides AbstractMap]
  Returns true if this map contains no key-value mappings.
pack-private Iterator< K> keyIterator ()
public NavigableSet< K> keySet () [Overrides AbstractMap] [Specified in ConcurrentNavigableMap]
  Returns a NavigableSet view of the keys contained in this map.
public Entry< K, V> lastEntry ()
  Returns a key-value mapping associated with the greatest key in this map, or null if the map is empty.
public K lastKey ()
 
public Entry< K, V> lowerEntry ( K key)
  Returns a key-value mapping associated with the greatest key strictly less than the given key, or null if there is no such key.
public K lowerKey ( K key)
 
public NavigableSet< K> navigableKeySet () [Specified in ConcurrentNavigableMap]
public Entry< K, V> pollFirstEntry ()
  Removes and returns a key-value mapping associated with the least key in this map, or null if the map is empty.
public Entry< K, V> pollLastEntry ()
  Removes and returns a key-value mapping associated with the greatest key in this map, or null if the map is empty.
public V put ( K key, V value) [Overrides AbstractMap]
  Associates the specified value with the specified key in this map.
public void putAll (Map<Object, Object> m) [Inherited From AbstractMap]
  Copies all of the mappings from the specified map to this map (optional operation).
public V putIfAbsent ( K key, V value)
  If the specified key is not already associated with a value, associate it with the given value.
public V remove (Object key) [Overrides AbstractMap]
  Removes the mapping for the specified key from this map if present.
public boolean remove (Object key, Object value)
  Removes the entry for a key only if currently mapped to a given value.
public V replace ( K key, V value)
  Replaces the entry for a key only if currently mapped to some value.
public boolean replace ( K key, V oldValue, V newValue)
  Replaces the entry for a key only if currently mapped to a given value.
public int size () [Overrides AbstractMap]
  Returns the number of key-value mappings in this map.
public ConcurrentNavigableMap< K, V> subMap ( K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) [Specified in ConcurrentNavigableMap]
 
public ConcurrentNavigableMap< K, V> subMap ( K fromKey, K toKey) [Specified in ConcurrentNavigableMap]
 
public ConcurrentNavigableMap< K, V> tailMap ( K fromKey) [Specified in ConcurrentNavigableMap]
 
public ConcurrentNavigableMap< K, V> tailMap ( K fromKey, boolean inclusive) [Specified in ConcurrentNavigableMap]
 
pack-privatefinalstatic List< E> toList (Collection< E> c)
public String toString () [Inherited From AbstractMap]
  Returns a string representation of this map.
pack-private Iterator< V> valueIterator ()
public Collection< V> values () [Overrides AbstractMap]
  Returns a Collection view of the values contained in this map.
Fields
Hide/Show inherited fields
Nested Classes
  ConcurrentSkipListMap.Node
Nodes hold keys and values, and are singly linked in sorted order, possibly with some intervening marker nodes.
  ConcurrentSkipListMap.Index
Index nodes represent the levels of the skip list.
  ConcurrentSkipListMap.HeadIndex
Nodes heading each level keep track of their level.
  ConcurrentSkipListMap.ComparableUsingComparator
Represents a key with a comparator as a Comparable.
  ConcurrentSkipListMap.Iter
Base of iterator classes:
  ConcurrentSkipListMap.ValueIterator
  ConcurrentSkipListMap.KeyIterator
  ConcurrentSkipListMap.EntryIterator
  ConcurrentSkipListMap.KeySet
  ConcurrentSkipListMap.Values
  ConcurrentSkipListMap.EntrySet
  ConcurrentSkipListMap.SubMap
Submaps returned by ConcurrentSkipListMap submap operations represent a subrange of mappings of their underlying maps.
  AbstractMap.SimpleEntry
An Entry maintaining a key and a value.
  AbstractMap.SimpleImmutableEntry
An Entry maintaining an immutable key and value.
Generated By: JavaOnTracks Doclet 0.1.4     ©Thibaut Colar