HashMap相关知识点和底层源码分析

最新推荐文章于 2024-09-19 13:19:42 发布

摸索前进-guang

最新推荐文章于 2024-09-19 13:19:42 发布

阅读量452

点赞数 20

文章标签： java 数据结构面试

本文链接：https://blog.csdn.net/weixin_42917779/article/details/139111851

版权

知识点

1.HashMap继承AbstractMap类实现Map接口，是一个双列 key value 结构集合。

public class HashMap<K,V> extends AbstractMap<K,V>
    implements Map<K,V>, Cloneable, Serializable

2.hashMap是一个线程不安全（方法没加synchronized关键字），高并发情况下可以使用JUC下的ConcurrentHashMap或者Collections.synchronizedMap()。

3.HashMap key和value都可以为null(hashtable key不能为null）,当key相同时，value会覆盖。

4.hashMap扩容机制(2倍扩容)

#无参构造
HashMap()加载因子默认为0.75 默认容量为16
0--->16--->32(个数达到24=32*0.75扩容)-->64(个数达到48=64*0.75扩容)...
#有参构造
HashMap(int n, float f)
n-->2n--->4n--->8n...

5.Hashmap底层是数组+链表+红黑树(jdk1.8后)

6.HashMap几种常见的遍历

#6.1使用entrySet()
public static void main(String[] args) {
        Map map = new HashMap();
        map.put("name", "张三");
        map.put("sex", "男");
        map.put("age", 30);
        map.put("tel", "15675321234");
        Set<Map.Entry> entrySet = map.entrySet();
        for (Map.Entry entry : entrySet) {
            System.out.println(entry.getKey() + "==" + entry.getValue());
        }
 }

#6.2 使用keySet
 public static void main(String[] args) {
        Map map = new HashMap();
        map.put("name", "张三");
        map.put("sex", "男");
        map.put("age", 30);
        map.put("tel", "15675321234");
        Set<String> set = map.keySet();
        for (String str : set) {
            System.out.println(str + "===" + map.get(str));
        }
 }
#6.3使用迭代器iterator遍历
public static void main(String[] args) {
        Map map = new HashMap();
        map.put("name", "张三");
        map.put("sex", "男");
        map.put("age", 30);
        map.put("tel", "15675321234");
        Iterator iterator = map.entrySet().iterator();
        while(iterator.hasNext()){
            Map.Entry entry = (Map.Entry) iterator.next();
            System.out.println(entry.getKey()+"=="+entry.getValue());
        }
 }

源码分析（建议debug追踪一下）

数组+链表图

数组+链表+红黑树图

#链表树达到8 第九个元素，数组长度达到64，进行树化treeifyBin(tab, hash);

#源码

1.调用put方法
public V put(K key, V value) {
        return putVal(hash(key), key, value, false, true);

}

2.调用hash(key)方法  获取hash值：>>>代表右移16位 ^代表按位异或(相同为0不同为1)
例如：int a=15(二进制1111); int b=a^8(1000)=7(二进制0111);
static final int hash(Object key) {
        int h;
        return (key == null) ? 0 : (h = key.hashCode()) ^ (h >>> 16);
}
3.调用putVal方法
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位置 挂载newNode对象
            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;
    }

4.调用resize()方法  初始容量默认为16 加载因子为0.75  2倍扩容(达到16*0.75就扩容) 
final Node<K,V>[] resize() {
        Node<K,V>[] oldTab = table;
        int oldCap = (oldTab == null) ? 0 : oldTab.length;
        int oldThr = threshold;
        int newCap, newThr = 0;
        if (oldCap > 0) {
            if (oldCap >= MAXIMUM_CAPACITY) {
                threshold = Integer.MAX_VALUE;
                return oldTab;
            }
            else if ((newCap = oldCap << 1) < MAXIMUM_CAPACITY &&
                     oldCap >= DEFAULT_INITIAL_CAPACITY)
                newThr = oldThr << 1; // double threshold
        }
        else if (oldThr > 0) // initial capacity was placed in threshold
            newCap = oldThr;
        else {               // zero initial threshold signifies using defaults
            newCap = DEFAULT_INITIAL_CAPACITY;
            newThr = (int)(DEFAULT_LOAD_FACTOR * DEFAULT_INITIAL_CAPACITY);
        }
        if (newThr == 0) {
            float ft = (float)newCap * loadFactor;
            newThr = (newCap < MAXIMUM_CAPACITY && ft < (float)MAXIMUM_CAPACITY ?
                      (int)ft : Integer.MAX_VALUE);
        }
        threshold = newThr;
        @SuppressWarnings({"rawtypes","unchecked"})
        Node<K,V>[] newTab = (Node<K,V>[])new Node[newCap];
        table = newTab;
        if (oldTab != null) {
            for (int j = 0; j < oldCap; ++j) {
                Node<K,V> e;
                if ((e = oldTab[j]) != null) {
                    oldTab[j] = null;
                    if (e.next == null)
                        newTab[e.hash & (newCap - 1)] = e;
                    else if (e instanceof TreeNode)
                        ((TreeNode<K,V>)e).split(this, newTab, j, oldCap);
                    else { // preserve order
                        Node<K,V> loHead = null, loTail = null;
                        Node<K,V> hiHead = null, hiTail = null;
                        Node<K,V> next;
                        do {
                            next = e.next;
                            if ((e.hash & oldCap) == 0) {
                                if (loTail == null)
                                    loHead = e;
                                else
                                    loTail.next = e;
                                loTail = e;
                            }
                            else {
                                if (hiTail == null)
                                    hiHead = e;
                                else
                                    hiTail.next = e;
                                hiTail = e;
                            }
                        } while ((e = next) != null);
                        if (loTail != null) {
                            loTail.next = null;
                            newTab[j] = loHead;
                        }
                        if (hiTail != null) {
                            hiTail.next = null;
                            newTab[j + oldCap] = hiHead;
                        }
                    }
                }
            }
        }
        return newTab;
    }

5.调用treeifyBin方法(红黑树) TREEIFY_THRESHOLD=8 MIN_TREEIFY_CAPACITY=64
  条件：if (binCount >= TREEIFY_THRESHOLD - 1) && 
       if (tab == null || (n = tab.length) < MIN_TREEIFY_CAPACITY)
  #链表个数到第八个(第9个元素)并且tab长度大于等于64才(否则resize())进行树化
 
final void treeifyBin(Node<K,V>[] tab, int hash) {
        int n, index; Node<K,V> e;
        if (tab == null || (n = tab.length) < MIN_TREEIFY_CAPACITY)
            resize();
        else if ((e = tab[index = (n - 1) & hash]) != null) {
            TreeNode<K,V> hd = null, tl = null;
            do {
                TreeNode<K,V> p = replacementTreeNode(e, null);
                if (tl == null)
                    hd = p;
                else {
                    p.prev = tl;
                    tl.next = p;
                }
                tl = p;
            } while ((e = e.next) != null);
            if ((tab[index] = hd) != null)
                hd.treeify(tab);
        }
    }

#Node静态方法   
static class Node<K,V> implements Map.Entry<K,V> {
        final int hash;
        final K key;
        V value;
        Node<K,V> next;

        Node(int hash, K key, V value, Node<K,V> next) {
            this.hash = hash;
            this.key = key;
            this.value = value;
            this.next = next;
        }

        public final K getKey()        { return key; }
        public final V getValue()      { return value; }
        public final String toString() { return key + "=" + value; }

        public final int hashCode() {
            return Objects.hashCode(key) ^ Objects.hashCode(value);
        }

        public final V setValue(V newValue) {
            V oldValue = value;
            value = newValue;
            return oldValue;
        }

        public final boolean equals(Object o) {
            if (o == this)
                return true;
            if (o instanceof Map.Entry) {
                Map.Entry<?,?> e = (Map.Entry<?,?>)o;
                if (Objects.equals(key, e.getKey()) &&
                    Objects.equals(value, e.getValue()))
                    return true;
            }
            return false;
        }
    }