HashMap 如何解决冲突，Android并发原理解析

最新推荐文章于 2023-02-28 19:58:10 发布

m0_61417997

最新推荐文章于 2023-02-28 19:58:10 发布

阅读量160

点赞数

分类专栏： Android 文章标签： android 移动开发

本文链接：https://blog.csdn.net/m0_61417997/article/details/120121382

版权

博客探讨了HashMap如何处理冲突，并深入解析Android并发机制。建议Android开发者通过系统学习和大量练习来提升技能，文中推荐了阿里P7级别的Android高级教程和CodeChina开源项目资源。

摘要由CSDN通过智能技术生成

 static final int hash(Object key) {

    int h;

    return (key == null) ? 0 : (h = key.hashCode()) ^ (h >>> 16);

}




解决冲突的核心逻辑代码:

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;

        }

这里再贴一下创建Node的代码:

Node<K,V> newNode(int hash, K key, V value, Node<K,V> e) {

    LinkedHashMap.Entry<K,V> p =

        new LinkedHashMap.Entry<K,V>(hash, key, value, e);

    linkNodeLast(p);

    return p;

}




**HashMap的扩容**



说道HashMap的扩容，我们先来看看HashMap的resize()方法。

/**

 * Initializes or doubles table size.  If null, allocates in

 * accord with initial capacity target held in field threshold.

 * Otherwise, because we are using power-of-two expansion, the

 * elements from each bin must either stay at same index, or move

 * with a power of two offset in the new table.

 *

 * @return the table

 */

final Node<K,V>[] resize()