LinkedHashMap实现LRU缓存的底层原理及实现步骤

如何通过linkedhashmap实现高速缓存?

要求:存储特定个数的热点数据,不常访问的数据自动删除掉.

只需要:自定义LinkedHashMap的匿名子类,重写removeEldestEntry方法.

 

LinkedHashMap<Object, Object> map = new LinkedHashMap<Object, Object>(5, 0.75F,
    true) {
  @Override//重写的这个方法会在调用afterNodeInsertion方法时被使用到.
  protected boolean removeEldestEntry(Entry eldest) {
    return size() > 5;
  }
};
map.put(1, 1);
map.put(2, 2);
map.put(3, 3);
map.put(4, 4);

Object o = map.get(2);

map.put(5, 5);
map.put(6, 6);
Set<Object> objects = map.keySet();
objects.forEach(e -> System.out.print(e + " "));
System.out.println();
map.values().forEach(e -> System.out.print(e + " "));

//控制台输出

3 4 2 5 6
3 4 2 5 6

2放到了"末尾",1被"顶出".

常用的数据会一直在尾部

源码解释:

hashmap的put方法会调用afterNodeInsertion方法,afterNodeInsertion方法中会用到removeEldestEntry方法进行判断.所以需要重写这个方法.

final V putVal(int hash, K key, V value, boolean onlyIfAbsent,
               boolean evict) {
    Node<K,V>[] tab; Node<K,V> p; int n, i;
    if ((tab = table) == null || (n = tab.length) == 0)
        n = (tab = resize()).length;
    if ((p = tab[i = (n - 1) & hash]) == null)
        tab[i] = newNode(hash, key, value, null);
    else {
        Node<K,V> e; K k;
        if (p.hash == hash &&
            ((k = p.key) == key || (key != null && key.equals(k))))
            e = p;
        else if (p instanceof TreeNode)
            e = ((TreeNode<K,V>)p).putTreeVal(this, tab, hash, key, value);
        else {
            for (int binCount = 0; ; ++binCount) {
                if ((e = p.next) == null) {
                    p.next = newNode(hash, key, value, null);
                    if (binCount >= TREEIFY_THRESHOLD - 1) // -1 for 1st
                        treeifyBin(tab, hash);
                    break;
                }
                if (e.hash == hash &&
                    ((k = e.key) == key || (key != null && key.equals(k))))
                    break;
                p = e;
            }
        }
        if (e != null) { // existing mapping for key
            V oldValue = e.value;
            if (!onlyIfAbsent || oldValue == null)
                e.value = value;
            afterNodeAccess(e);
            return oldValue;
        }
    }
    ++modCount;
    if (++size > threshold)
        resize();
    afterNodeInsertion(evict);
    return null;
}

void afterNodeInsertion(boolean evict) { // possibly remove eldest
    LinkedHashMap.Entry<K,V> first;
    if (evict && (first = head) != null && removeEldestEntry(first)) {
        K key = first.key;
        removeNode(hash(key), key, null, false, true);
    }
}