LinkedHashMap主要源码

最新推荐文章于 2024-11-19 18:44:04 发布

原创最新推荐文章于 2024-11-19 18:44:04 发布 · 199 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Java #LinkHashMap

Java 专栏收录该内容

3 篇文章

订阅专栏

博客聚焦Java中LinkHashMap，指出链表操作主要在特定标红方法中实现，并定位到其核心实现。

LinkedHashMap实现了HashMap

源码开头

public class LinkedHashMap<K,V>
    extends HashMap<K,V>
    implements Map<K,V>
{ 
说明LinkedHashMap是实现了HashMap的，LinkedHashMap没有put方法说明时调用了父类的put方法，HashMap的put源码

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;
}

从上看到链表的操作主要在标红的方法中实现，最终定位到如下的核心实现

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;
    }
}