Package VASSAL.tools.concurrent

Class ConcurrentSoftHashMap<K,V>

java.lang.Object

java.util.AbstractMap<K,V>

VASSAL.tools.concurrent.ConcurrentSoftHashMap<K,V>

All Implemented Interfaces:

ConcurrentMap<K,V>, Map<K,V>

public class ConcurrentSoftHashMap<K,V>
extends AbstractMap<K,V>
implements ConcurrentMap<K,V>

A memory-sensitive ConcurrentMap which stores the values in SoftReferences. This ConcurrentMap grows without bound, but when the JVM is under memory pressure, values held by it may be garbage collected.

All methods except get(java.lang.Object) cause the Map to be cleared of key-value pairs for which the value has been garbage collected. Processing key-value pairs with dead values is not an atomic operation. Thus, it is possible, though unlikely, that more values will be garbage collected between the removal of dead key-value pairs and the return of the method in which this takes place.

This implementation does not permit null keys or values.

Since:

3.1.0

Author:

Joel Uckelman

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
static class	ConcurrentSoftHashMap.SimpleEntry<K,V>	An implementation of Map.Entry.

Nested classes/interfaces inherited from class java.util.AbstractMap

AbstractMap.SimpleImmutableEntry<K,V>

Nested classes/interfaces inherited from interface java.util.Map

Map.Entry<K,V>

Constructor Summary

Constructors

Constructor	Description
ConcurrentSoftHashMap()

Method Summary

Modifier and Type	Method	Description
void	clear()
boolean	containsKey(Object key)
Set<Map.Entry<K,V>>	entrySet()
V	get(Object key)
V	put(K key, V value)
V	putIfAbsent(K key, V value)
V	remove(Object key)
boolean	remove(Object key, Object value)
V	replace(K key, V value)
boolean	replace(K key, V oldValue, V newValue)
int	size()

Methods inherited from class java.util.AbstractMap

clone, containsValue, equals, hashCode, isEmpty, keySet, putAll, toString, values

Methods inherited from class java.lang.Object

finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.util.concurrent.ConcurrentMap

compute, computeIfAbsent, computeIfPresent, forEach, getOrDefault, merge, replaceAll

Methods inherited from interface java.util.Map

containsValue, equals, hashCode, isEmpty, keySet, putAll, values

Constructor Details

ConcurrentSoftHashMap

public ConcurrentSoftHashMap()

Method Details

size

public int size()

Specified by:

size in interface Map<K,V>

Overrides:

size in class AbstractMap<K,V>

containsKey

public boolean containsKey(Object key)

Specified by:

containsKey in interface Map<K,V>

Overrides:

containsKey in class AbstractMap<K,V>

get

public V get(Object key)

Specified by:

get in interface Map<K,V>

Overrides:

get in class AbstractMap<K,V>

put

public V put(K key,
 V value)

Specified by:

put in interface Map<K,V>

Overrides:

put in class AbstractMap<K,V>

remove

public V remove(Object key)

Specified by:

remove in interface Map<K,V>

Overrides:

remove in class AbstractMap<K,V>

clear

public void clear()

Specified by:

clear in interface Map<K,V>

Overrides:

clear in class AbstractMap<K,V>

entrySet

public Set<Map.Entry<K,V>> entrySet()

Specified by:

entrySet in interface Map<K,V>

Specified by:

entrySet in class AbstractMap<K,V>

putIfAbsent

public V putIfAbsent(K key,
 V value)

Specified by:

putIfAbsent in interface ConcurrentMap<K,V>

Specified by:

putIfAbsent in interface Map<K,V>

remove

public boolean remove(Object key,
 Object value)

Specified by:

remove in interface ConcurrentMap<K,V>

Specified by:

remove in interface Map<K,V>

replace

public boolean replace(K key,
 V oldValue,
 V newValue)

Specified by:

replace in interface ConcurrentMap<K,V>

Specified by:

replace in interface Map<K,V>

replace

public V replace(K key,
 V value)

Specified by:

replace in interface ConcurrentMap<K,V>

Specified by:

replace in interface Map<K,V>