[@talishboy][¥20]Java 中如何利用泛型写一个 LRU 缓存？

参考网上的代码可以实现一个。List可以换成泛型的类型。
import java.util.LinkedHashMap;
import java.util.Map;

public class LruSimpleCache implements LruCache {

Map<K, V> map = new LinkedHashMap (  );

public LruSimpleCache (final int limit) {
       map = new LinkedHashMap <K, V> (16, 0.75f, true) {
           @Override
           protected boolean removeEldestEntry(final Map.Entry<K, V> eldest) {
               return super.size() > limit;
           }
       };
}
@Override
public void put ( K key, V value ) {
    map.put ( key, value );
}

@Override
public V get ( K key ) {
    return map.get(key);
}

//For testing only
@Override
public V getSilent ( K key ) {
    V value =  map.get ( key );
    if (value!=null) {
        map.remove ( key );
        map.put(key, value);
    }
    return value;
}

@Override
public void remove ( K key ) {
    map.remove ( key );
}

@Override
public int size () {
    return map.size ();
}

public String toString() {
    return map.toString ();
}

}
https://stackoverflow.com/questions/221525/how-would-you-implement-an-lru-cache-in-java