如果哈希码被覆盖（仅返回一个常数），哈希码键将如何工作？

Question

我对Java有一个小问题Hashmap。如果我重写该hashCode方法，使得：

@Override
public int hashCode(){
  return 9;
}

这将导致所有HashMap键具有相同的索引。是将它们放置在地图的链接列表结构中，还是仅包含替换了所有其他键的最后一个键？

Answer 1

假设您没有覆盖equals始终返回true
的方法，它们将放置在地图的链接列表结构中。不同的键可能具有相同的hashCode，但是如果所有键都具有相同的hashCode，则您的HashMap将成为链接列表，这首先使使用此结构的目的无效。

您可以在HashMap实现中亲自看到它：

/**
 * Associates the specified value with the specified key in this map.
 * If the map previously contained a mapping for the key, the old
 * value is replaced.
 *
 * @param key key with which the specified value is to be associated
 * @param value value to be associated with the specified key
 * @return the previous value associated with <tt>key</tt>, or
 *         <tt>null</tt> if there was no mapping for <tt>key</tt>.
 *         (A <tt>null</tt> return can also indicate that the map
 *         previously associated <tt>null</tt> with <tt>key</tt>.)
 */
public V put(K key, V value) {
    if (key == null)
        return putForNullKey(value);
    int hash = hash(key.hashCode()); // hash would always be the same if hashCode is constant
    int i = indexFor(hash, table.length); // i would always be the same if hashCode is constant
    for (Entry<K,V> e = table[i]; e != null; e = e.next) {
        Object k;
        if (e.hash == hash && ((k = e.key) == key || key.equals(k))) { // the key is searched using the
                                                                       // equals method
            V oldValue = e.value;
            e.value = value;
            e.recordAccess(this);
            return oldValue;
        }
    }

    modCount++;
    addEntry(hash, key, value, i);
    return null;
}