java系列-LinkedHashMap怎么实现LRU

最新推荐文章于 2025-05-26 09:26:58 发布

讨厌所有昵称是海洋精灵的

最新推荐文章于 2025-05-26 09:26:58 发布

阅读量470

点赞数 5

CC 4.0 BY-SA版权

分类专栏： Java 文章标签： java LinkedHashMap

本文链接：https://blog.csdn.net/lostfish123/article/details/134961881

1.定义变量accessOrder

public class LinkedHashMap<K,V> extends HashMap<K,V> implements Map<K,V> {
    final boolean accessOrder;

    public LinkedHashMap(int initialCapacity, float loadFactor, boolean accessOrder) {
        super(initialCapacity, loadFactor);
        this.accessOrder = accessOrder;
    }
}

2.最近访问的节点移动到链表末尾

public class LinkedHashMap<K,V> extends HashMap<K,V> implements Map<K,V> {

    void afterNodeAccess(Node<K,V> e) { // move node to last
        LinkedHashMapEntry<K,V> last;
        if (accessOrder && (last = tail) != e) { //e不是tail
            LinkedHashMapEntry<K,V> p =
                (LinkedHashMapEntry<K,V>)e, b = p.before, a = p.after;
            p.after = n