org.jboss.netty.util.internal
类 ConcurrentIdentityWeakKeyHashMap<K,V>

java.lang.Object
  继承者 java.util.AbstractMap<K,V>
      继承者 org.jboss.netty.util.internal.ConcurrentIdentityWeakKeyHashMap<K,V>
类型参数:
K - the type of keys maintained by this map
V - the type of mapped values
所有已实现的接口:
java.util.concurrent.ConcurrentMap<K,V>, java.util.Map<K,V>

public final class ConcurrentIdentityWeakKeyHashMap<K,V>
extends java.util.AbstractMap<K,V>
implements java.util.concurrent.ConcurrentMap<K,V>

An alternative weak-key identity-comparing ConcurrentMap which is similar to ConcurrentHashMap.


嵌套类摘要
 
从类 java.util.AbstractMap 继承的嵌套类/接口
java.util.AbstractMap.SimpleImmutableEntry<K,V>
 
从接口 java.util.Map 继承的嵌套类/接口
java.util.Map.Entry<K,V>
 
构造方法摘要
ConcurrentIdentityWeakKeyHashMap()
          Creates a new, empty map with a default initial capacity (16), reference types (weak keys, strong values), default load factor (0.75) and concurrencyLevel (16).
ConcurrentIdentityWeakKeyHashMap(int initialCapacity)
          Creates a new, empty map with the specified initial capacity, and with default reference types (weak keys, strong values), load factor (0.75) and concurrencyLevel (16).
ConcurrentIdentityWeakKeyHashMap(int initialCapacity, float loadFactor)
          Creates a new, empty map with the specified initial capacity and load factor and with the default reference types (weak keys, strong values), and concurrencyLevel (16).
ConcurrentIdentityWeakKeyHashMap(int initialCapacity, float loadFactor, int concurrencyLevel)
          Creates a new, empty map with the specified initial capacity, load factor and concurrency level.
ConcurrentIdentityWeakKeyHashMap(java.util.Map<? extends K,? extends V> m)
          Creates a new map with the same mappings as the given map.
 
方法摘要
 void clear()
          Removes all of the mappings from this map.
 boolean contains(java.lang.Object value)
          Legacy method testing if some key maps into the specified value in this table.
 boolean containsKey(java.lang.Object key)
          Tests if the specified object is a key in this table.
 boolean containsValue(java.lang.Object value)
          Returns true if this map maps one or more keys to the specified value.
 java.util.Enumeration<V> elements()
          Returns an enumeration of the values in this table.
 java.util.Set<java.util.Map.Entry<K,V>> entrySet()
          Returns a Set view of the mappings contained in this map.
 V get(java.lang.Object key)
          Returns the value to which the specified key is mapped, or null if this map contains no mapping for the key.
 boolean isEmpty()
          Returns true if this map contains no key-value mappings.
 java.util.Enumeration<K> keys()
          Returns an enumeration of the keys in this table.
 java.util.Set<K> keySet()
          Returns a Set view of the keys contained in this map.
 void purgeStaleEntries()
          Removes any stale entries whose keys have been finalized.
 V put(K key, V value)
          Maps the specified key to the specified value in this table.
 void putAll(java.util.Map<? extends K,? extends V> m)
          Copies all of the mappings from the specified map to this one.
 V putIfAbsent(K key, V value)
          
 V remove(java.lang.Object key)
          Removes the key (and its corresponding value) from this map.
 boolean remove(java.lang.Object key, java.lang.Object value)
          
 V replace(K key, V value)
          
 boolean replace(K key, V oldValue, V newValue)
          
 int size()
          Returns the number of key-value mappings in this map.
 java.util.Collection<V> values()
          Returns a Collection view of the values contained in this map.
 
从类 java.util.AbstractMap 继承的方法
equals, hashCode, toString
 
从类 java.lang.Object 继承的方法
getClass, notify, notifyAll, wait, wait, wait
 
从接口 java.util.Map 继承的方法
equals, hashCode
 

构造方法详细信息

ConcurrentIdentityWeakKeyHashMap

public ConcurrentIdentityWeakKeyHashMap(int initialCapacity,
                                        float loadFactor,
                                        int concurrencyLevel)
Creates a new, empty map with the specified initial capacity, load factor and concurrency level.

参数:
initialCapacity - the initial capacity. The implementation performs internal sizing to accommodate this many elements.
loadFactor - the load factor threshold, used to control resizing. Resizing may be performed when the average number of elements per bin exceeds this threshold.
concurrencyLevel - the estimated number of concurrently updating threads. The implementation performs internal sizing to try to accommodate this many threads.
抛出:
java.lang.IllegalArgumentException - if the initial capacity is negative or the load factor or concurrencyLevel are nonpositive.

ConcurrentIdentityWeakKeyHashMap

public ConcurrentIdentityWeakKeyHashMap(int initialCapacity,
                                        float loadFactor)
Creates a new, empty map with the specified initial capacity and load factor and with the default reference types (weak keys, strong values), and concurrencyLevel (16).

参数:
initialCapacity - The implementation performs internal sizing to accommodate this many elements.
loadFactor - the load factor threshold, used to control resizing. Resizing may be performed when the average number of elements per bin exceeds this threshold.
抛出:
java.lang.IllegalArgumentException - if the initial capacity of elements is negative or the load factor is nonpositive

ConcurrentIdentityWeakKeyHashMap

public ConcurrentIdentityWeakKeyHashMap(int initialCapacity)
Creates a new, empty map with the specified initial capacity, and with default reference types (weak keys, strong values), load factor (0.75) and concurrencyLevel (16).

参数:
initialCapacity - the initial capacity. The implementation performs internal sizing to accommodate this many elements.
抛出:
java.lang.IllegalArgumentException - if the initial capacity of elements is negative.

ConcurrentIdentityWeakKeyHashMap

public ConcurrentIdentityWeakKeyHashMap()
Creates a new, empty map with a default initial capacity (16), reference types (weak keys, strong values), default load factor (0.75) and concurrencyLevel (16).


ConcurrentIdentityWeakKeyHashMap

public ConcurrentIdentityWeakKeyHashMap(java.util.Map<? extends K,? extends V> m)
Creates a new map with the same mappings as the given map. The map is created with a capacity of 1.5 times the number of mappings in the given map or 16 (whichever is greater), and a default load factor (0.75) and concurrencyLevel (16).

参数:
m - the map
方法详细信息

isEmpty

public boolean isEmpty()
Returns true if this map contains no key-value mappings.

指定者:
接口 java.util.Map<K,V> 中的 isEmpty
覆盖:
java.util.AbstractMap<K,V> 中的 isEmpty
返回:
true if this map contains no key-value mappings

size

public int size()
Returns the number of key-value mappings in this map. If the map contains more than Integer.MAX_VALUE elements, returns Integer.MAX_VALUE.

指定者:
接口 java.util.Map<K,V> 中的 size
覆盖:
java.util.AbstractMap<K,V> 中的 size
返回:
the number of key-value mappings in this map

get

public V get(java.lang.Object key)
Returns the value to which the specified key is mapped, or null if this map contains no mapping for the key.

More formally, if this map contains a mapping from a key k to a value v such that key.equals(k), then this method returns v; otherwise it returns null. (There can be at most one such mapping.)

指定者:
接口 java.util.Map<K,V> 中的 get
覆盖:
java.util.AbstractMap<K,V> 中的 get
抛出:
java.lang.NullPointerException - if the specified key is null

containsKey

public boolean containsKey(java.lang.Object key)
Tests if the specified object is a key in this table.

指定者:
接口 java.util.Map<K,V> 中的 containsKey
覆盖:
java.util.AbstractMap<K,V> 中的 containsKey
参数:
key - possible key
返回:
true if and only if the specified object is a key in this table, as determined by the equals method; false otherwise.
抛出:
java.lang.NullPointerException - if the specified key is null

containsValue

public boolean containsValue(java.lang.Object value)
Returns true if this map maps one or more keys to the specified value. Note: This method requires a full internal traversal of the hash table, and so is much slower than method containsKey.

指定者:
接口 java.util.Map<K,V> 中的 containsValue
覆盖:
java.util.AbstractMap<K,V> 中的 containsValue
参数:
value - value whose presence in this map is to be tested
返回:
true if this map maps one or more keys to the specified value
抛出:
java.lang.NullPointerException - if the specified value is null

contains

public boolean contains(java.lang.Object value)
Legacy method testing if some key maps into the specified value in this table. This method is identical in functionality to containsValue(java.lang.Object), and exists solely to ensure full compatibility with class Hashtable, which supported this method prior to introduction of the Java Collections framework.

参数:
value - a value to search for
返回:
true if and only if some key maps to the value argument in this table as determined by the equals method; false otherwise
抛出:
java.lang.NullPointerException - if the specified value is null

put

public V put(K key,
             V value)
Maps the specified key to the specified value in this table. Neither the key nor the value can be null.

The value can be retrieved by calling the get method with a key that is equal to the original key.

指定者:
接口 java.util.Map<K,V> 中的 put
覆盖:
java.util.AbstractMap<K,V> 中的 put
参数:
key - key with which the specified value is to be associated
value - value to be associated with the specified key
返回:
the previous value associated with key, or null if there was no mapping for key
抛出:
java.lang.NullPointerException - if the specified key or value is null

putIfAbsent

public V putIfAbsent(K key,
                     V value)

指定者:
接口 java.util.concurrent.ConcurrentMap<K,V> 中的 putIfAbsent
返回:
the previous value associated with the specified key, or null if there was no mapping for the key
抛出:
java.lang.NullPointerException - if the specified key or value is null

putAll

public void putAll(java.util.Map<? extends K,? extends V> m)
Copies all of the mappings from the specified map to this one. These mappings replace any mappings that this map had for any of the keys currently in the specified map.

指定者:
接口 java.util.Map<K,V> 中的 putAll
覆盖:
java.util.AbstractMap<K,V> 中的 putAll
参数:
m - mappings to be stored in this map

remove

public V remove(java.lang.Object key)
Removes the key (and its corresponding value) from this map. This method does nothing if the key is not in the map.

指定者:
接口 java.util.Map<K,V> 中的 remove
覆盖:
java.util.AbstractMap<K,V> 中的 remove
参数:
key - the key that needs to be removed
返回:
the previous value associated with key, or null if there was no mapping for key
抛出:
java.lang.NullPointerException - if the specified key is null

remove

public boolean remove(java.lang.Object key,
                      java.lang.Object value)

指定者:
接口 java.util.concurrent.ConcurrentMap<K,V> 中的 remove
抛出:
java.lang.NullPointerException - if the specified key is null

replace

public boolean replace(K key,
                       V oldValue,
                       V newValue)

指定者:
接口 java.util.concurrent.ConcurrentMap<K,V> 中的 replace
抛出:
java.lang.NullPointerException - if any of the arguments are null

replace

public V replace(K key,
                 V value)

指定者:
接口 java.util.concurrent.ConcurrentMap<K,V> 中的 replace
返回:
the previous value associated with the specified key, or null if there was no mapping for the key
抛出:
java.lang.NullPointerException - if the specified key or value is null

clear

public void clear()
Removes all of the mappings from this map.

指定者:
接口 java.util.Map<K,V> 中的 clear
覆盖:
java.util.AbstractMap<K,V> 中的 clear

purgeStaleEntries

public void purgeStaleEntries()
Removes any stale entries whose keys have been finalized. Use of this method is normally not necessary since stale entries are automatically removed lazily, when blocking operations are required. However, there are some cases where this operation should be performed eagerly, such as cleaning up old references to a ClassLoader in a multi-classloader environment. Note: this method will acquire locks, one at a time, across all segments of this table, so if it is to be used, it should be used sparingly.


keySet

public java.util.Set<K> keySet()
Returns a Set view of the keys contained in this map. 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 this 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.

指定者:
接口 java.util.Map<K,V> 中的 keySet
覆盖:
java.util.AbstractMap<K,V> 中的 keySet

values

public java.util.Collection<V> values()
Returns a Collection view of the values contained in this map. The collection is backed by the map, so changes to the map are reflected in the collection, and vice-versa. The collection supports element removal, which removes the corresponding mapping from this map, via the Iterator.remove, Collection.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.

指定者:
接口 java.util.Map<K,V> 中的 values
覆盖:
java.util.AbstractMap<K,V> 中的 values

entrySet

public java.util.Set<java.util.Map.Entry<K,V>> entrySet()
Returns a Set view of the mappings contained in this map. 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.

指定者:
接口 java.util.Map<K,V> 中的 entrySet
指定者:
java.util.AbstractMap<K,V> 中的 entrySet

keys

public java.util.Enumeration<K> keys()
Returns an enumeration of the keys in this table.

返回:
an enumeration of the keys in this table
另请参见:
keySet()

elements

public java.util.Enumeration<V> elements()
Returns an enumeration of the values in this table.

返回:
an enumeration of the values in this table
另请参见:
values()