类 ConcurrentOpenHashMap<K,V>
- 类型参数:
V-
Provides similar methods as a ConcurrentMap<K,V> but since it's an open hash map with linear probing,
no node allocations are required to store the values.
WARN: method forEach do not guarantee thread safety, nor do the keys and values method.
The forEach method is specifically designed for single-threaded usage. When iterating over a map
with concurrent writes, it becomes possible for new values to be either observed or not observed.
There is no guarantee that if we write value1 and value2, and are able to see value2, then we will also see value1.
In some cases, it is even possible to encounter two mappings with the same key,
leading the keys method to return a List containing two identical keys.
It is crucial to understand that the results obtained from aggregate status methods such as keys and values
are typically reliable only when the map is not undergoing concurrent updates from other threads.
When concurrent updates are involved, the results of these methods reflect transient states
that may be suitable for monitoring or estimation purposes, but not for program control.
-
嵌套类概要
嵌套类 -
构造器概要
构造器构造器说明已过时。ConcurrentOpenHashMap(int expectedItems) 已过时。ConcurrentOpenHashMap(int expectedItems, int concurrencyLevel) 已过时。ConcurrentOpenHashMap(int expectedItems, int concurrencyLevel, float mapFillFactor, float mapIdleFactor, boolean autoShrink, float expandFactor, float shrinkFactor) -
方法概要
修饰符和类型方法说明longcapacity()voidclear()computeIfAbsent(K key, Function<K, V> provider) booleancontainsKey(K key) static <K,V> ConcurrentOpenHashMap<K, V> emptyMap()voidforEach(BiConsumer<? super K, ? super V> processor) Iterate over all the entries in the map and apply the processor function to each of them.booleanisEmpty()keys()static <K,V> ConcurrentOpenHashMap.Builder<K, V> putIfAbsent(K key, V value) booleanvoidremoveNullValue(K key) longsize()values()
-
构造器详细资料
-
ConcurrentOpenHashMap
已过时。 -
ConcurrentOpenHashMap
已过时。 -
ConcurrentOpenHashMap
已过时。 -
ConcurrentOpenHashMap
public ConcurrentOpenHashMap(int expectedItems, int concurrencyLevel, float mapFillFactor, float mapIdleFactor, boolean autoShrink, float expandFactor, float shrinkFactor)
-
-
方法详细资料
-
newBuilder
-
emptyMap
-
size
public long size() -
capacity
public long capacity() -
isEmpty
public boolean isEmpty() -
get
-
containsKey
-
put
-
putIfAbsent
-
computeIfAbsent
-
remove
-
remove
-
removeNullValue
-
clear
public void clear() -
forEach
Iterate over all the entries in the map and apply the processor function to each of them.Warning: Do Not Guarantee Thread-Safety.
- 参数:
processor- the function to apply to each entry
-
keys
- 返回:
- a new list of all keys (makes a copy)
-
values
-