edu.stanford.nlp.util

Class LeastRecentlyUsedCache<K,V>

java.lang.Object

edu.stanford.nlp.util.LeastRecentlyUsedCache<K,V>

public class LeastRecentlyUsedCache<K,V>
extends java.lang.Object

LRU cache for whatever. Maps key K to value V.
If too many things are stored, values start falling out in the order they were inserted. Values that are accessed get their position in the queue refreshed.
Works by keeping a linked list of nodes, implemented as a private static inner class, and a map from K to the nodes. Needing to keep track of the nodes is the reason for not using a java.util.LinkedList.
Could theoretically include most or all of the Map interface, but so far only what was actually used has been implemented.

Author:

John Bauer

Constructor Summary

Constructors

Constructor and Description
LeastRecentlyUsedCache(int maxSize)

Method Summary

Modifier and Type	Method and Description
void	add(K key, V value)
V	getOrDefault(K key, V defaultValue)
int	size()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

LeastRecentlyUsedCache

public LeastRecentlyUsedCache(int maxSize)

Method Detail

getOrDefault

public V getOrDefault(K key,
                      V defaultValue)

add

public void add(K key,
                V value)

size

public int size()