Class ConcurrentIdentityHashMap<K,V>
- Type Parameters:
K
- the type of keys maintained by this mapV
- the type of mapped values
- All Implemented Interfaces:
ConcurrentMap<K,
,V> Map<K,
V>
ConcurrentMap
which is similar to
ConcurrentHashMap
.-
Nested Class Summary
Nested ClassesModifier and TypeClassDescription(package private) final class
(package private) final class
(package private) static final class
ConcurrentReferenceHashMap list entry.(package private) class
(package private) final class
(package private) final class
(package private) static final class
Segments are specialized versions of hash tables.(package private) static class
(package private) final class
(package private) final class
(package private) final class
Custom Entry class used by EntryIterator.next(), that relays setValue changes to the underlying map.Nested classes/interfaces inherited from class java.util.AbstractMap
AbstractMap.SimpleImmutableEntry<K,
V> -
Field Summary
FieldsModifier and TypeFieldDescription(package private) static final int
The default concurrency level for this table, used when not otherwise specified in a constructor.(package private) static final int
The default initial capacity for this table, used when not otherwise specified in a constructor.(package private) static final float
The default load factor for this table, used when not otherwise specified in a constructor.(package private) static final int
The maximum number of segments to allow; used to bound constructor arguments.(package private) static final int
The maximum capacity, used if a higher value is implicitly specified by either of the constructors with arguments.(package private) static final int
Number of unsynchronized retries in size and containsValue methods before resorting to locking.(package private) final int
Mask value for indexing into segments.(package private) final ConcurrentIdentityHashMap.Segment<K,
V>[] The segments, each of which is a specialized hash table(package private) final int
Shift value for indexing within segments.(package private) Collection
<V> -
Constructor Summary
ConstructorsConstructorDescriptionCreates a new, empty map with a default initial capacity (16), reference types (weak keys, strong values), default load factor (0.75) and concurrencyLevel (16).ConcurrentIdentityHashMap
(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).ConcurrentIdentityHashMap
(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).ConcurrentIdentityHashMap
(int initialCapacity, float loadFactor, int concurrencyLevel) Creates a new, empty map with the specified initial capacity, load factor and concurrency level.ConcurrentIdentityHashMap
(Map<? extends K, ? extends V> m) Creates a new map with the same mappings as the given map. -
Method Summary
Modifier and TypeMethodDescriptionvoid
clear()
Removes all of the mappings from this map.boolean
Legacy method testing if some key maps into the specified value in this table.boolean
containsKey
(Object key) Tests if the specified object is a key in this table.boolean
containsValue
(Object value) Returns true if this map maps one or more keys to the specified value.elements()
Returns an enumeration of the values in this table.entrySet()
Returns aSet
view of the mappings contained in this map.Returns the value to which the specified key is mapped, ornull
if this map contains no mapping for the key.private static int
hash
(int h) Applies a supplemental hash function to a given hashCode, which defends against poor quality hash functions.private static int
boolean
isEmpty()
Returns true if this map contains no key-value mappings.keys()
Returns an enumeration of the keys in this table.keySet()
Returns aSet
view of the keys contained in this map.Maps the specified key to the specified value in this table.void
Copies all of the mappings from the specified map to this one.putIfAbsent
(K key, V value) Removes the key (and its corresponding value) from this map.boolean
boolean
(package private) ConcurrentIdentityHashMap.Segment
<K, V> segmentFor
(int hash) Returns the segment that should be used for key with given hash.int
size()
Returns the number of key-value mappings in this map.values()
Returns aCollection
view of the values contained in this map.Methods inherited from class java.util.AbstractMap
clone, equals, hashCode, toString
Methods inherited from class java.lang.Object
finalize, getClass, notify, notifyAll, wait, wait, wait
Methods inherited from interface java.util.concurrent.ConcurrentMap
compute, computeIfAbsent, computeIfPresent, forEach, getOrDefault, merge, replaceAll
-
Field Details
-
DEFAULT_INITIAL_CAPACITY
static final int DEFAULT_INITIAL_CAPACITYThe default initial capacity for this table, used when not otherwise specified in a constructor.- See Also:
-
DEFAULT_LOAD_FACTOR
static final float DEFAULT_LOAD_FACTORThe default load factor for this table, used when not otherwise specified in a constructor.- See Also:
-
DEFAULT_CONCURRENCY_LEVEL
static final int DEFAULT_CONCURRENCY_LEVELThe default concurrency level for this table, used when not otherwise specified in a constructor.- See Also:
-
MAXIMUM_CAPACITY
static final int MAXIMUM_CAPACITYThe maximum capacity, used if a higher value is implicitly specified by either of the constructors with arguments. MUST be a power of two <= 1<<30 to ensure that entries are indexable using integers.- See Also:
-
MAX_SEGMENTS
static final int MAX_SEGMENTSThe maximum number of segments to allow; used to bound constructor arguments.- See Also:
-
RETRIES_BEFORE_LOCK
static final int RETRIES_BEFORE_LOCKNumber of unsynchronized retries in size and containsValue methods before resorting to locking. This is used to avoid unbounded retries if tables undergo continuous modification which would make it impossible to obtain an accurate result.- See Also:
-
segmentMask
final int segmentMaskMask value for indexing into segments. The upper bits of a key's hash code are used to choose the segment. -
segmentShift
final int segmentShiftShift value for indexing within segments. -
segments
The segments, each of which is a specialized hash table -
keySet
-
entrySet
-
values
Collection<V> values
-
-
Constructor Details
-
ConcurrentIdentityHashMap
public ConcurrentIdentityHashMap(int initialCapacity, float loadFactor, int concurrencyLevel) Creates a new, empty map with the specified initial capacity, load factor and concurrency level.- Parameters:
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.- Throws:
IllegalArgumentException
- if the initial capacity is negative or the load factor or concurrencyLevel are nonpositive.
-
ConcurrentIdentityHashMap
public ConcurrentIdentityHashMap(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).- Parameters:
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.- Throws:
IllegalArgumentException
- if the initial capacity of elements is negative or the load factor is nonpositive
-
ConcurrentIdentityHashMap
public ConcurrentIdentityHashMap(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).- Parameters:
initialCapacity
- the initial capacity. The implementation performs internal sizing to accommodate this many elements.- Throws:
IllegalArgumentException
- if the initial capacity of elements is negative.
-
ConcurrentIdentityHashMap
public ConcurrentIdentityHashMap()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). -
ConcurrentIdentityHashMap
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).- Parameters:
m
- the map
-
-
Method Details
-
hash
private static int hash(int h) Applies a supplemental hash function to a given hashCode, which defends against poor quality hash functions. This is critical because ConcurrentReferenceHashMap uses power-of-two length hash tables, that otherwise encounter collisions for hashCodes that do not differ in lower or upper bits. -
segmentFor
Returns the segment that should be used for key with given hash.- Parameters:
hash
- the hash code for the key- Returns:
- the segment
-
hashOf
-
isEmpty
public boolean isEmpty()Returns 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. -
get
Returns the value to which the specified key is mapped, ornull
if this map contains no mapping for the key.More formally, if this map contains a mapping from a key
k
to a valuev
such thatkey.equals(k)
, then this method returnsv
; otherwise it returnsnull
. (There can be at most one such mapping.)- Specified by:
get
in interfaceMap<K,
V> - Overrides:
get
in classAbstractMap<K,
V> - Throws:
NullPointerException
- if the specified key is null
-
containsKey
Tests if the specified object is a key in this table.- Specified by:
containsKey
in interfaceMap<K,
V> - Overrides:
containsKey
in classAbstractMap<K,
V> - Parameters:
key
- possible key- Returns:
- true if and only if the specified object is a key in this table, as determined by the equals method; false otherwise.
- Throws:
NullPointerException
- if the specified key is null
-
containsValue
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.- Specified by:
containsValue
in interfaceMap<K,
V> - Overrides:
containsValue
in classAbstractMap<K,
V> - Parameters:
value
- value whose presence in this map is to be tested- Returns:
- true if this map maps one or more keys to the specified value
- Throws:
NullPointerException
- if the specified value is null
-
contains
Legacy method testing if some key maps into the specified value in this table. This method is identical in functionality tocontainsValue(java.lang.Object)
, and exists solely to ensure full compatibility with classHashtable
, which supported this method prior to introduction of the Java Collections framework.- Parameters:
value
- a value to search for- Returns:
- true if and only if some key maps to the value argument in this table as determined by the equals method; false otherwise
- Throws:
NullPointerException
- if the specified value is null
-
put
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.
- Specified by:
put
in interfaceMap<K,
V> - Overrides:
put
in classAbstractMap<K,
V> - Parameters:
key
- key with which the specified value is to be associatedvalue
- value to be associated with the specified key- Returns:
- the previous value associated with key, or null if there was no mapping for key
- Throws:
NullPointerException
- if the specified key or value is null
-
putIfAbsent
- Specified by:
putIfAbsent
in interfaceConcurrentMap<K,
V> - Specified by:
putIfAbsent
in interfaceMap<K,
V> - Returns:
- the previous value associated with the specified key, or null if there was no mapping for the key
- Throws:
NullPointerException
- if the specified key or value is null
-
putAll
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. -
remove
Removes the key (and its corresponding value) from this map. This method does nothing if the key is not in the map.- Specified by:
remove
in interfaceMap<K,
V> - Overrides:
remove
in classAbstractMap<K,
V> - Parameters:
key
- the key that needs to be removed- Returns:
- the previous value associated with key, or null if there was no mapping for key
- Throws:
NullPointerException
- if the specified key is null
-
remove
- Specified by:
remove
in interfaceConcurrentMap<K,
V> - Specified by:
remove
in interfaceMap<K,
V> - Throws:
NullPointerException
- if the specified key is null
-
replace
- Specified by:
replace
in interfaceConcurrentMap<K,
V> - Specified by:
replace
in interfaceMap<K,
V> - Throws:
NullPointerException
- if any of the arguments are null
-
replace
- Specified by:
replace
in interfaceConcurrentMap<K,
V> - Specified by:
replace
in interfaceMap<K,
V> - Returns:
- the previous value associated with the specified key, or null if there was no mapping for the key
- Throws:
NullPointerException
- if the specified key or value is null
-
clear
public void clear()Removes all of the mappings from this map. -
keySet
Returns aSet
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. -
values
Returns aCollection
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. -
entrySet
Returns aSet
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. -
keys
Returns an enumeration of the keys in this table.- Returns:
- an enumeration of the keys in this table
- See Also:
-
elements
Returns an enumeration of the values in this table.- Returns:
- an enumeration of the values in this table
- See Also:
-