LinkedHashMap源码分析

-归海

已于 2024-05-25 15:31:30 修改

阅读量171

点赞数 2

CC 4.0 BY-SA版权

分类专栏：源码分析文章标签：算法

于 2024-05-25 14:13:26 首次发布

本文链接：https://blog.csdn.net/2301_78668865/article/details/139195940

源码分析专栏收录该内容

2 篇文章

订阅专栏

部分代码分析

//为true则表示迭代顺序基于访问顺序，意味着最近访问的元素（get 或 put 操作）会被移动到链表的尾部
	final boolean accessOrder;

//相当于尾插一个Entry对象
    private void linkNodeLast(LinkedHashMap.Entry<K,V> p) {
        LinkedHashMap.Entry<K,V> last = tail;
        tail = p;
        if (last == null)
            head = p;
        else {
            p.before = last;
            last.after = p;
        }

//把dst（destination）处的节点用src（source）替换
    private void transferLinks(LinkedHashMap.Entry<K,V> src,LinkedHashMap.Entry<K,V> dst) {
        LinkedHashMap.Entry<K,V> b = dst.before = src.before;
        LinkedHashMap.Entry<K,V> a = dst.after = src.after;
        if (b == null)
            head = dst;
        else
            b.after = dst;
        if (a == null)
            tail = dst;
        else
            a.before = dst;
    }
    
        Node<K,V> replacementNode(Node<K,V> p, Node<K,V> next) {
        LinkedHashMap.Entry<K,V> q = (LinkedHashMap.Entry<K,V>)p;
        LinkedHashMap.Entry<K,V> t =
            new LinkedHashMap.Entry<>(q.hash, q.key, q.value, next);
        transferLinks(q, t);
        return t;
    }
    
    public V get(Object key) {
        Node<K,V> e;
        if ((e = getNode(key)) == null)
            return null;
        if (accessOrder)
            afterNodeAccess(e);
        return e.value;
    }

构造方法

//默认值16和0.75
   public LinkedHashMap() {
        super();
        accessOrder = false;
    }
    public LinkedHashMap(Map<? extends K, ? extends V> m) {
        super();
        accessOrder = false;
        putMapEntries(m, false);
    }
    public LinkedHashMap(int initialCapacity,
                         float loadFactor,
                         boolean accessOrder) {
        super(initialCapacity, loadFactor);
        this.accessOrder = accessOrder;
    }

重要代码分析

//插入节点后的操作，根据给定条件判断是否需要删除头结点
	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);
        }
    }

//获取节点后的操作，根据accessOrder字段判断是否需要移动节点至链表尾部
	void afterNodeAccess(Node<K,V> e) { 
        LinkedHashMap.Entry<K,V> last;
        if (accessOrder && (last = tail) != e) {
            LinkedHashMap.Entry<K,V> p =
                (LinkedHashMap.Entry<K,V>)e, b = p.before, a = p.after;
            p.after = null;
            if (b == null)
                head = a;
            else
                b.after = a;
            if (a != null)
                a.before = b;
            else
                last = b;
            if (last == null)
                head = p;
            else {
                p.before = last;
                last.after = p;
            }
            tail = p;
            ++modCount;
        }
    }
    
//这个方法一般需要我们进行重写，也就是什么条件下，我们需要移除最久未被访问的键值对传入的参数是头节点键值对，也就是最老的键值对
	protected boolean removeEldestEntry(Map.Entry<K,V> eldest) {
        return false;
    }