具有不同哈希值的键是否也映射到 HashMap 中的相同索引?

Looking at the code specifically line 393, it looks like different hashes have been mapped to same index. I had an understanding that the hashcode is used to determine what bucket in a HashMap is to be used, and the bucket is made up of a linked list of all the entries with the same hashcode. They why have the e.hash == hash check ?

    public V put(K key, V value) {
        if (key == null)
            return putForNullKey(value);
        int hash = hash(key.hashCode());
        int i = indexFor(hash, table.length);
        for (Entry e = table[i]; e != null; e = e.next) {
            Object k;
            if (e.hash == hash && ((k = e.key) == key || key.equals(k))) {
                V oldValue = e.value;
                e.value = value;
                e.recordAccess(this);
                return oldValue;
            }
        }
        modCount++;
        addEntry(hash, key, value, i);
        return null;
    }

推荐答案

由于 hashcode 可以是 2^32 值中的一个，hashmap 很少有这么多桶(仅表需要 16GB 内存).所以是的，您可以在地图的相同存储桶中拥有具有不同哈希值的对象(AFAIK 它是 hachCode % numberOfBuckets 的简单模运算).