HashMap的putAll方法

源码 

public void putAll(Map<? extends K, ? extends V> m) {
        int numKeysToBeAdded = m.size();
        //如果传入的map容量为0，直接返回
        if (numKeysToBeAdded == 0)
            return;

        //如果被添加的map为空，扩容
        if (table == EMPTY_TABLE) {
            inflateTable((int) Math.max(numKeysToBeAdded * loadFactor, threshold));
        }

        /*
         * 判断是否需要扩容
         *若“当前实际容量 < 需要的容量”，则将容量x2。
         *+1为了弥补精度转换
         */
        if (numKeysToBeAdded > threshold) {
            int targetCapacity = (int)(numKeysToBeAdded / loadFactor + 1);
            if (targetCapacity > MAXIMUM_CAPACITY)
                targetCapacity = MAXIMUM_CAPACITY;
            int newCapacity = table.length;
            while (newCapacity < targetCapacity)
                newCapacity <<= 1;
            if (newCapacity > table.length)
                resize(newCapacity);
        }

        //依次遍历键值对，并put
        for (Map.Entry<? extends K, ? extends V> e : m.entrySet())
            put(e.getKey(), e.getValue());
    }

应用

import java.util.ArrayList;
import java.util.Collection;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.Map.Entry;

public class ForHash {
    public static void main(String[] args) {
        Map<String,Integer> map  = new HashMap<String,Integer>();
        //key----value
        map.put("a", 1);
        map.put("b", 2);
        map.put("c", 3);
        map.put("d", 4);
        map.put("d", 5);//不允许key重复 覆盖掉前面key为d的值
        Map<String,Integer> map1  = new HashMap<String,Integer>();
        map1.put("ss", 51);
        map1.put("chenc", 66);
        map1.put("a",1);
        map.putAll(map1);
        System.out.println("????"+map1);
        System.out.println("fsdfsdfds"+map);

    }
}