| Class | Description |
|---|---|
| AbstractSoftMap<K,V> |
Soft
Map implementation based on
http://www.javaspecialists.eu/archive/Issue015.htmlThe entrySet implementation is from
org.hypergraphdb.utilNote: 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.
|
| SoftHashMap<K,V> |
Soft
HashMap implementation based on
http://www.javaspecialists.eu/archive/Issue015.htmlThe entrySet implementation is from
org.hypergraphdb.utilNote: SoftHashMap is NOT serializable! |
| SoftLinkedHashMap<K,V> |
Soft
HashMap implementation based on
http://www.javaspecialists.eu/archive/Issue015.htmlThe entrySet implementation is from
org.hypergraphdb.utilNote: SoftLinkedHashMap is NOT serializable! |
Copyright © 2014–2017 Philip Helger. All rights reserved.