hashmap中的put方法存放数据源码解析

第一步创建一个hashmap对象

//hashmap底层结构是一个Node<K,V>的数组
//无参构造
Map<Person, Integer> hashmap1 = new HashMap<Person, Integer>();
transient Node<K,V>[] table;
final float loadFactor;
static final float DEFAULT_LOAD_FACTOR = 0.75f;
 public HashMap() {
        this.loadFactor = DEFAULT_LOAD_FACTOR; // all other fields defaulted
    }
/*
设置加载因子0.75
底层数组table为空
*/
//有参
//
Map<Person, Integer> hashmap2 = new HashMap<Person, Integer>(initialCapacity);
public HashMap(int initialCapacity) {
        this(initialCapacity, DEFAULT_LOAD_FACTOR);
}
public HashMap(int initialCapacity, float loadFactor) {
        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;
    }
//单参构造方法，调用自己的多参构造方法
/*
单参构造：自定义初始容量，加载因子为默认的0.75
多参构造方法：
1.判断初始容量和加载因子是否合法（初始容量的边界判断），不合发报错
2.合法通过tableSizeFor将设置容量变成2的幂次
*/
Map<Person, Integer> hashmap4 = new HashMap<Person, Integer>(initialCapacity, loadFactor);
//双参，自定义初始容量和加载因子

//单参传map，加载因子为默认值0.75
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);
            }
        }
    }
/*
通过putMapEntries方法将传入map中的数据加入我们自己创建的hashmap对象中
如果map的长度大于0就进行添加操作否则什么也不做
当map值大于0，先判断原始hashmap中有没有数据，有的话再比较阈值threshold，大于阈值通过resize()方法扩容
如果原始hashmap中没有数据，先对传入map的长度进行
*/

第二步放数据

public V put(K key, V value) {
        return putVal(hash(key), key, value, false, true);
    }
//put方法存放数据用到putVal，传入参数依次为key的hash值，key，value
//放第一个元素时，扩容初始长度16，扩容阈值12（长度*加载因子）
//当哈希冲突时，冲突下的链表长度小于8或底层数组长度小于64，仍然通过链表解决冲突
//当哈希冲突时，冲突链表长度大于8，底层数组长度超过64，将链表转成树形
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;
    }