Class WeakConcurrentMap<K,V>
- java.lang.Object
-
- java.lang.ref.ReferenceQueue<K>
-
- io.opentelemetry.instrumentation.api.cache.weaklockfree.WeakConcurrentMap<K,V>
-
- Direct Known Subclasses:
WeakConcurrentMap.WithInlinedExpunction
public class WeakConcurrentMap<K,V> extends ReferenceQueue<K>
A thread-safe map with weak keys. Entries are based on a key's system hash code and keys are considered equal only by reference equality. This class does not implement theMapinterface because this implementation is incompatible with the map contract. While iterating over a map's entries, any key that has not passed iteration is referenced non-weakly.This class has been copied as is from https://github.com/raphw/weak-lock-free/blob/ad0e5e0c04d4a31f9485bf12b89afbc9d75473b3/src/main/java/com/blogspot/mydailyjava/weaklockfree/WeakConcurrentMap.java
-
-
Nested Class Summary
Nested Classes Modifier and Type Class Description static classWeakConcurrentMap.WithInlinedExpunction<K,V>AWeakConcurrentMapwhere stale entries are removed as a side effect of interacting with this map.
-
Constructor Summary
Constructors Constructor Description WeakConcurrentMap(boolean cleanerThread)WeakConcurrentMap(boolean cleanerThread, boolean reuseKeys)WeakConcurrentMap(boolean cleanerThread, boolean reuseKeys, ConcurrentMap<io.opentelemetry.instrumentation.api.cache.weaklockfree.AbstractWeakConcurrentMap.WeakKey<K>,V> target)
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description intapproximateSize()Returns the approximate size of this map where the returned number is at least as big as the actual number of entries.voidclear()Clears the entire map.booleancontainsKey(K key)protected VdefaultValue(K key)Creates a default value.voidexpungeStaleEntries()Cleans all unused references.Vget(K key)ThreadgetCleanerThread()VgetIfPresent(K key)protected io.opentelemetry.instrumentation.api.cache.weaklockfree.WeakConcurrentMap.LookupKey<K>getLookupKey(K key)Override with care as it can cause lookup failures if done incorrectly.Iterator<Map.Entry<K,V>>iterator()Vput(K key, V value)VputIfAbsent(K key, V value)VputIfProbablyAbsent(K key, V value)Vremove(K key)protected voidresetLookupKey(io.opentelemetry.instrumentation.api.cache.weaklockfree.WeakConcurrentMap.LookupKey<K> lookupKey)Resets any reusable state in the lookup key.voidrun()StringtoString()-
Methods inherited from class java.lang.ref.ReferenceQueue
poll, remove, remove
-
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
-
Methods inherited from interface java.lang.Iterable
forEach, spliterator
-
-
-
-
Constructor Detail
-
WeakConcurrentMap
public WeakConcurrentMap(boolean cleanerThread)
- Parameters:
cleanerThread-trueif a thread should be started that removes stale entries.
-
WeakConcurrentMap
public WeakConcurrentMap(boolean cleanerThread, boolean reuseKeys)- Parameters:
cleanerThread-trueif a thread should be started that removes stale entries.reuseKeys-trueif the lookup keys should be reused via aThreadLocal. Note that setting this totruemay result in class loader leaks. SeeisPersistentClassLoader(ClassLoader)for more details.
-
WeakConcurrentMap
public WeakConcurrentMap(boolean cleanerThread, boolean reuseKeys, ConcurrentMap<io.opentelemetry.instrumentation.api.cache.weaklockfree.AbstractWeakConcurrentMap.WeakKey<K>,V> target)- Parameters:
cleanerThread-trueif a thread should be started that removes stale entries.reuseKeys-trueif the lookup keys should be reused via aThreadLocal. Note that setting this totruemay result in class loader leaks. SeeisPersistentClassLoader(ClassLoader)for more details.target- ConcurrentMap implementation that this class wraps.
-
-
Method Detail
-
getLookupKey
protected io.opentelemetry.instrumentation.api.cache.weaklockfree.WeakConcurrentMap.LookupKey<K> getLookupKey(K key)
Override with care as it can cause lookup failures if done incorrectly. The result must have the sameObject.hashCode()as the input and beequal toa weak reference of the key. When overriding this, also overrideresetLookupKey(L).
-
resetLookupKey
protected void resetLookupKey(io.opentelemetry.instrumentation.api.cache.weaklockfree.WeakConcurrentMap.LookupKey<K> lookupKey)
Resets any reusable state in the lookup key.
-
getCleanerThread
public Thread getCleanerThread()
- Returns:
- The cleaner thread or
nullif no such thread was set.
-
get
public V get(K key)
- Parameters:
key- The key of the entry.- Returns:
- The value of the entry or the default value if it did not exist.
-
getIfPresent
public V getIfPresent(K key)
- Parameters:
key- The key of the entry.- Returns:
- The value of the entry or null if it did not exist.
-
containsKey
public boolean containsKey(K key)
- Parameters:
key- The key of the entry.- Returns:
trueif the key already defines a value.
-
put
public V put(K key, V value)- Parameters:
key- The key of the entry.value- The value of the entry.- Returns:
- The previous entry or
nullif it does not exist.
-
putIfAbsent
public V putIfAbsent(K key, V value)- Parameters:
key- The key of the entry.value- The value of the entry.- Returns:
- The previous entry or
nullif it does not exist.
-
putIfProbablyAbsent
public V putIfProbablyAbsent(K key, V value)- Parameters:
key- The key of the entry.value- The value of the entry.- Returns:
- The previous entry or
nullif it does not exist.
-
remove
public V remove(K key)
- Parameters:
key- The key of the entry.- Returns:
- The removed entry or
nullif it does not exist.
-
clear
public void clear()
Clears the entire map.
-
defaultValue
protected V defaultValue(K key)
Creates a default value. There is no guarantee that the requested value will be set as a once it is created in case that another thread requests a value for a key concurrently.- Parameters:
key- The key for which to create a default value.- Returns:
- The default value for a key without value or
nullfor not defining a default value.
-
expungeStaleEntries
public void expungeStaleEntries()
Cleans all unused references.
-
approximateSize
public int approximateSize()
Returns the approximate size of this map where the returned number is at least as big as the actual number of entries.- Returns:
- The minimum size of this map.
-
-