V - public class ConcurrentOpenHashMap<K,V> extends Object
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.
| Constructor and Description |
|---|
ConcurrentOpenHashMap() |
ConcurrentOpenHashMap(int expectedItems) |
ConcurrentOpenHashMap(int expectedItems,
int concurrencyLevel) |
| Modifier and Type | Method and Description |
|---|---|
long |
capacity() |
void |
clear() |
V |
computeIfAbsent(K key,
Function<K,V> provider) |
boolean |
containsKey(K key) |
void |
forEach(BiConsumer<? super K,? super V> processor) |
V |
get(K key) |
boolean |
isEmpty() |
List<K> |
keys() |
V |
put(K key,
V value) |
V |
putIfAbsent(K key,
V value) |
V |
remove(K key) |
boolean |
remove(K key,
Object value) |
void |
removeNullValue(K key) |
long |
size() |
List<V> |
values() |
public ConcurrentOpenHashMap()
public ConcurrentOpenHashMap(int expectedItems)
public ConcurrentOpenHashMap(int expectedItems,
int concurrencyLevel)
public long size()
public long capacity()
public boolean isEmpty()
public boolean containsKey(K key)
public void removeNullValue(K key)
public void clear()
public void forEach(BiConsumer<? super K,? super V> processor)
Copyright © 2017–2021 Apache Software Foundation. All rights reserved.