| AbstractSoftMap<K,V> |
Soft Map implementation based on
http://www.javaspecialists.eu/archive/Issue015.html
The entrySet implementation is from
org.hypergraphdb.util
Note: AbstractSoftMap is NOT serializable! |
| 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.
|
| LoggingLRUMap<KEYTYPE,VALUETYPE> |
A specific LRUMap that emits a warning once the map is full and the
oldest entry gets discarded. |
| LRUMap<KEYTYPE,VALUETYPE> |
A special ordered map, that has an upper limit of contained elements.
|
| LRUSet<ELEMENTTYPE> |
A special ordered set, that has an upper limit of contained elements.
|
| MapEntry<KEYTYPE,VALUETYPE> |
Simple implementation of Map.Entry.
Important: The equals and hashCode implementation of this class is different
from the Map.Entry default implementation class!
|
| SoftHashMap<K,V> |
Soft HashMap implementation based on
http://www.javaspecialists.eu/archive/Issue015.html
The entrySet implementation is from
org.hypergraphdb.util
Note: SoftHashMap is NOT serializable! |
| SoftLinkedHashMap<K,V> |
Soft HashMap implementation based on
http://www.javaspecialists.eu/archive/Issue015.html
The entrySet implementation is from
org.hypergraphdb.util
Note: SoftLinkedHashMap is NOT serializable! |