HashMap、HashTable、ConcurrentHashMap的对比

最新推荐文章于 2024-03-12 20:02:43 发布

无忧草·

最新推荐文章于 2024-03-12 20:02:43 发布

阅读量193

点赞数

CC 4.0 BY-SA版权

分类专栏： concurrentHashMap Map 文章标签： concurrentHashMap Map HashMap HashTable

本文链接：https://blog.youkuaiyun.com/shi611222/article/details/88378339

concurrentHashMap 同时被 2 个专栏收录

1 篇文章

订阅专栏

Map

1 篇文章

订阅专栏

本文详细对比了ConcurrentHashMap、HashTable和HashMap的特性与底层实现。ConcurrentHashMap通过分段加锁提高并发性能，HashTable使用整个表的锁，而HashMap不具备线程安全性。文章深入分析了它们的数据结构和源码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

ConcurrentHashMap：是线程安全的，用于并发，相比于HashTable效率提高显著，HashTable用synchronized锁住整个表，ConcurrentHashMap因为是分段加锁，可以允许多个修改同时并发进行。底层实现是分段的数组加链表。
底层相关源码：

/**
     * Stripped-down version of helper class used in previous version,
     * declared for the sake of serialization compatibility
     */
    static class Segment<K,V> extends ReentrantLock implements Serializable {
        private static final long serialVersionUID = 2249069246763182397L;
        final float loadFactor;
        Segment(float lf) { this.loadFactor = lf; }
    }

    private void writeObject(java.io.ObjectOutputStream s)
        throws java.io.IOException {
        // For serialization compatibility
        // Emulate segment calculation from previous version of this class
        int sshift = 0;
        int ssize = 1;
        while (ssize < DEFAULT_CONCURRENCY_LEVEL) {
            ++sshift;
            ssize <<= 1;
        }
        int segmentShift = 32 - sshift;
        int segmentMask = ssize - 1;
        @SuppressWarnings("unchecked")
        Segment<K,V>[] segments = (Segment<K,V>[])
            new Segment<?,?>[DEFAULT_CONCURRENCY_LEVEL];
        for (int i = 0; i < segments.length; ++i)
            segments[i] = new Segment<K,V>(LOAD_FACTOR);
        s.putFields().put("segments", segments);
        s.putFields().put("segmentShift", segmentShift);
        s.putFields().put("segmentMask", segmentMask);
        s.writeFields();

        Node<K,V>[] t;
        if ((t = table) != null) {
            Traverser<K,V> it = new Traverser<K,V>(t, t.length, 0, t.length);
            for (Node<K,V> p; (p = it.advance()) != null; ) {
                s.writeObject(p.key);
                s.writeObject(p.val);
            }
        }
        s.writeObject(null);
        s.writeObject(null);
        segments = null; // throw away
    }

HashTable：

HashTable是线程安全的，不过相对与性能来说相对较低，因为其使用synchronized锁住整个表让一个线程独占，不释放锁其他线程只能等待，导致CPU资源利用率低，其底层实现的话，是数组加链表，其中key-value不允许有空值

HashMap：

HashMap是线程不安全的，key-vlaue可以为空值，底层实现的话是数组加链表
源码实现：

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;
    }