com.helger.commons.collection.impl

Class AbstractSoftMap<K,V>

java.lang.Object

java.util.AbstractMap<K,V>

com.helger.commons.collection.impl.AbstractSoftMap<K,V>

Type Parameters:

K - Key type

V - Value type

All Implemented Interfaces:

Map<K,V>

Direct Known Subclasses:

SoftHashMap, SoftLinkedHashMap

public abstract class AbstractSoftMap<K,V>
extends AbstractMap<K,V>

Soft Map implementation based on http://www.javaspecialists.eu/archive/Issue015.html
The entrySet implementation is from org.hypergraphdb.util

Author:

Philip Helger

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
protected static class	AbstractSoftMap.SoftValue<K,V> We define our own subclass of SoftReference which contains not only the value but also the key to make it easier to find the entry in the HashMap after it's been garbage collected.

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

AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>

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

Map.Entry<K,V>

Field Summary

Fields

Modifier and Type	Field and Description
protected Map<K,AbstractSoftMap.SoftValue<K,V>>	m_aSrcMap The internal HashMap that will hold the SoftReference.

Constructor Summary

Constructors

Constructor and Description
AbstractSoftMap(Map<K,AbstractSoftMap.SoftValue<K,V>> aSrcMap)

Method Summary

Modifier and Type	Method and Description
void	clear()
Set<Map.Entry<K,V>>	entrySet()
V	get(Object aKey)
protected void	onEntryRemoved(K aKey) Callback method invoked after a map entry is garbage collected
V	put(K aKey, V aValue) Here we put the key, value pair into the HashMap using a SoftValue object.
V	remove(Object aKey)
int	size()

Methods inherited from class java.util.AbstractMap

clone, containsKey, 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.Map

compute, computeIfAbsent, computeIfPresent, forEach, getOrDefault, merge, putIfAbsent, remove, replace, replace, replaceAll

Field Detail

m_aSrcMap

protected final Map<K,AbstractSoftMap.SoftValue<K,V>> m_aSrcMap

The internal HashMap that will hold the SoftReference.

Constructor Detail

AbstractSoftMap

public AbstractSoftMap(@Nonnull
                       Map<K,AbstractSoftMap.SoftValue<K,V>> aSrcMap)

Method Detail

onEntryRemoved

@OverrideOnDemand
protected void onEntryRemoved(K aKey)

Callback method invoked after a map entry is garbage collected

Parameters:

aKey - Key the removed key

get

public V get(Object aKey)

Specified by:

get in interface Map<K,V>

Overrides:

get in class AbstractMap<K,V>

put

public V put(K aKey,
             V aValue)

Here we put the key, value pair into the HashMap using a SoftValue object.

Specified by:

put in interface Map<K,V>

Overrides:

put in class AbstractMap<K,V>

remove

public V remove(Object aKey)

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>

size

public int size()

Specified by:

size in interface Map<K,V>

Overrides:

size in class AbstractMap<K,V>

entrySet

@ReturnsMutableObject(value="design")
public Set<Map.Entry<K,V>> entrySet()

Specified by:

entrySet in interface Map<K,V>

Specified by:

entrySet in class AbstractMap<K,V>