K - V - public class ConcurrentWeakIdentityHashMap<K,V>
extends java.util.AbstractMap<K,V>
implements java.util.concurrent.ConcurrentMap<K,V>
| Constructor and Description |
|---|
ConcurrentWeakIdentityHashMap() |
ConcurrentWeakIdentityHashMap(int initialCapacity) |
| Modifier and Type | Method and Description |
|---|---|
void |
clear() |
boolean |
containsKey(java.lang.Object key) |
boolean |
containsValue(java.lang.Object value) |
java.util.Set<java.util.Map.Entry<K,V>> |
entrySet() |
V |
get(java.lang.Object key) |
V |
put(K key,
V value) |
V |
putIfAbsent(K key,
V value) |
V |
remove(java.lang.Object key) |
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() |
clone, equals, hashCode, isEmpty, keySet, putAll, toString, valuesfinalize, getClass, notify, notifyAll, wait, wait, waitpublic ConcurrentWeakIdentityHashMap(int initialCapacity)
public ConcurrentWeakIdentityHashMap()
public V get(java.lang.Object key)
public int size()
public V remove(java.lang.Object key)
public boolean remove(java.lang.Object key,
java.lang.Object value)
public boolean containsKey(java.lang.Object key)
public void clear()