Like WeakHashMap, except that the keys of the n most recently-accessed entries are kept as {@link SoftReference softreferences}. Accessing an element means creating it, or retrieving it with {@link #get(Object) get}. Because these entries are kept with soft references, they will tend to remain even if their keys are not referenced elsewhere. But if memory is short, they will be removed.
|
|