HashMap源码分析笔记，长更

HashMap学习笔记

一、HashMap源码分析

1.构造方法

 public HashMap(Map<? extends K, ? extends V> m) {
        this.loadFactor = DEFAULT_LOAD_FACTOR;
        putMapEntries(m, false);
    }
========================================================================
final void putMapEntries(Map<? extends K, ? extends V> m, boolean evict) {
//传入集合大小
        int s = m.size();
        if (s > 0) {
            if (table == null) { // pre-size
                float ft = ((float)s / loadFactor) + 1.0F;
                int t = ((ft < (float)MAXIMUM_CAPACITY) ?
                         (int)ft : MAXIMUM_CAPACITY);
                if (t > threshold)
                    threshold = tableSizeFor(t);
            }
            else if (s > threshold)
                resize();
            for (Map.Entry<? extends K, ? extends V> e : m.entrySet()) {
                K key = e.getKey();
                V value = e.getValue();
                putVal(hash(key), key, value, false, evict);
            }
        }
    }

 ========================================================================
    //空参构造方法
 public HashMap() {
  //0.75f负载因子赋值
        this.loadFactor = DEFAULT_LOAD_FACTOR; // all other fields defaulted
    }
      //空参构造方法（初始化容量）
 public HashMap(int initialCapacity) {
        this(initialCapacity, DEFAULT_LOAD_FACTOR);
    }
 ========================================================================
     //int类型构造方法
 public HashMap(int initialCapacity, float loadFactor) {
 //判断容量initialCapacity
        if (initialCapacity < 0)
            throw new IllegalArgumentException("Illegal initial capacity: " +
                                               initialCapacity);
 //判断容量最大值
        if (initialCapacity > MAXIMUM_CAPACITY)
            initialCapacity = MAXIMUM_CAPACITY;
        if (loadFactor <= 0 || Float.isNaN(loadFactor))
            throw new IllegalArgumentException("Illegal load factor: " +
                                               loadFactor);
        this.loadFactor = loadFactor;
         //判断容量最大值
        this.threshold = tableSizeFor(initialCapacity);
    }
========================================================================
static final int tableSizeFor(int cap) {
        int n = cap - 1;
        n |= n >>> 1;
        n |= n >>> 2;
        n |= n >>> 4;
        n |= n >>> 8;
        n |= n >>> 16;
        return (n < 0) ? 1 : (n >= MAXIMUM_CAPACITY) ? MAXIMUM_CAPACITY : n + 1;
    }

2.put源码

//根据key获取hashcode值
public V put(K key, V value) {
        return putVal(hash(key), key, value, false, true);
    }
========================================================================
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)
        //初始化table
            n = (tab = resize()).length;
             //i=元素在table存储的位置，赋值给p
        if ((p = tab[i = (n - 1) & hash]) == null)
       		//创建节点，存储
            tab[i] = newNode(hash, key, value, null);
        else {
        //tab[i]有元素情况
            Node<K,V> e; K k;
            //hash值相同
            if (p.hash == hash &&
                ((k = p.key) == key || (key != null && key.equals(k))))
                e = p;
                //判断是不是树结构   jdk1.8提供红黑树优化方案
            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;
    }

3.remove

public V remove(Object key) {
        Node<K,V> e;
        return (e = removeNode(hash(key), key, null, false, true)) == null ?
            null : e.value;
    }
========================================================================
final Node<K,V> removeNode(int hash, Object key, Object value,
                               boolean matchValue, boolean movable) {
        Node<K,V>[] tab; Node<K,V> p; int n, index;
        
        if ((tab = table) != null && (n = tab.length) > 0 &&
            (p = tab[index = (n - 1) & hash]) != null) {
            Node<K,V> node = null, e; K k; V v;
            if (p.hash == hash &&
                ((k = p.key) == key || (key != null && key.equals(k))))
                node = p;
            else if ((e = p.next) != null) {
                if (p instanceof TreeNode)
                    node = ((TreeNode<K,V>)p).getTreeNode(hash, key);
                else {
                    do {
                        if (e.hash == hash &&
                            ((k = e.key) == key ||
                             (key != null && key.equals(k)))) {
                            node = e;
                            break;
                        }
                        p = e;
                    } while ((e = e.next) != null);
                }
            }
            if (node != null && (!matchValue || (v = node.value) == value ||
                                 (value != null && value.equals(v)))) {
                if (node instanceof TreeNode)
                    ((TreeNode<K,V>)node).removeTreeNode(this, tab, movable);
                else if (node == p)
                    tab[index] = node.next;
                else
                    p.next = node.next;
                ++modCount;
                --size;
                afterNodeRemoval(node);
                return node;
            }
        }
        return null;
    }