Package ghidra.util.datastruct
Class AbstractWeakValueMap<K,V>
- java.lang.Object
-
- ghidra.util.datastruct.AbstractWeakValueMap<K,V>
-
- Type Parameters:
K- the type of keysV- the type of values
- All Implemented Interfaces:
java.util.Map<K,V>
- Direct Known Subclasses:
AbstractWeakValueNavigableMap,WeakValueHashMap
public abstract class AbstractWeakValueMap<K,V> extends java.lang.Object implements java.util.Map<K,V>Class to provide a map with weak values, backed by a given map
-
-
Nested Class Summary
Nested Classes Modifier and Type Class Description protected classAbstractWeakValueMap.GeneratedEntryAn entry for the "entrySet" method, since internally, entries are of weak-referenced values.protected static classAbstractWeakValueMap.WeakValueRef<K,V>A weak value ref that also knows its key in the map.
-
Constructor Summary
Constructors Modifier Constructor Description protectedAbstractWeakValueMap()Constructs a new weak map
-
Method Summary
All Methods Instance Methods Abstract Methods Concrete Methods Modifier and Type Method Description voidclear()booleancontainsKey(java.lang.Object key)booleancontainsValue(java.lang.Object value)java.util.Set<java.util.Map.Entry<K,V>>entrySet()Vget(java.lang.Object key)protected abstract java.util.Map<K,AbstractWeakValueMap.WeakValueRef<K,V>>getRefMap()Returns the backing mapbooleanisEmpty()java.util.Set<K>keySet()protected voidprocessQueue()Vput(K key, V value)voidputAll(java.util.Map<? extends K,? extends V> map)Vremove(java.lang.Object key)intsize()java.util.Collection<V>values()
-
-
-
Field Detail
-
refQueue
protected java.lang.ref.ReferenceQueue<V> refQueue
-
-
Method Detail
-
getRefMap
protected abstract java.util.Map<K,AbstractWeakValueMap.WeakValueRef<K,V>> getRefMap()
Returns the backing map- Returns:
- the map
-
containsKey
public boolean containsKey(java.lang.Object key)
-
containsValue
public boolean containsValue(java.lang.Object value)
-
values
public java.util.Collection<V> values()
-
processQueue
protected void processQueue()
-
-