Class WeakConcurrentMap<K,V>
- java.lang.Object
-
- java.lang.ref.ReferenceQueue<K>
-
- org.mockito.internal.util.concurrent.WeakConcurrentMap<K,V>
-
- All Implemented Interfaces:
java.lang.Iterable<java.util.Map.Entry<K,V>>
,java.lang.Runnable
- Direct Known Subclasses:
WeakConcurrentMap.WithInlinedExpunction
public class WeakConcurrentMap<K,V> extends java.lang.ref.ReferenceQueue<K> implements java.lang.Runnable, java.lang.Iterable<java.util.Map.Entry<K,V>>
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 theMap
interface 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.
-
-
Nested Class Summary
Nested Classes Modifier and Type Class Description private class
WeakConcurrentMap.EntryIterator
private static class
WeakConcurrentMap.LatentKey<T>
private class
WeakConcurrentMap.SimpleEntry
private static class
WeakConcurrentMap.WeakKey<T>
static class
WeakConcurrentMap.WithInlinedExpunction<K,V>
AWeakConcurrentMap
where stale entries are removed as a side effect of interacting with this map.
-
Constructor Summary
Constructors Constructor Description WeakConcurrentMap(boolean cleanerThread)
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description int
approximateSize()
Returns the approximate size of this map where the returned number is at least as big as the actual number of entries.void
clear()
Clears the entire map.boolean
containsKey(K key)
protected V
defaultValue(K key)
Creates a default value.void
expungeStaleEntries()
Cleans all unused references.V
get(K key)
java.lang.Thread
getCleanerThread()
java.util.Iterator<java.util.Map.Entry<K,V>>
iterator()
V
put(K key, V value)
V
remove(K key)
void
run()
-
-
-
Field Detail
-
ID
private static final java.util.concurrent.atomic.AtomicLong ID
-
target
public final java.util.concurrent.ConcurrentMap<WeakConcurrentMap.WeakKey<K>,V> target
-
thread
private final java.lang.Thread thread
-
-
Method Detail
-
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.
-
containsKey
public boolean containsKey(K key)
- Parameters:
key
- The key of the entry.- Returns:
true
if 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
null
if it does not exist.
-
remove
public V remove(K key)
- Parameters:
key
- The key of the entry.- Returns:
- The removed entry or
null
if 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
null
for not defining a default value.
-
getCleanerThread
public java.lang.Thread getCleanerThread()
- Returns:
- The cleaner thread or
null
if no such thread was set.
-
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.
-
run
public void run()
- Specified by:
run
in interfacejava.lang.Runnable
-
-