java hashmapinteger,在Java中将Integer用作HashMap的键

最新推荐文章于 2024-07-23 18:16:41 发布

Tryuei

最新推荐文章于 2024-07-23 18:16:41 发布

阅读量829

点赞数

文章标签： java hashmapinteger

博客讨论了Java中Integer类的hashCode()方法实现，指出其简单直接地返回内部int值，可能会导致连续整数在HashMap中被分配到同一桶。然而，实际上Integer的实现是最优的，因为每个整数值都映射到唯一的哈希值，减少了哈希冲突。结论是，对于HashMap，Integer并非最糟糕的键类型。文章探讨了为何不采用更复杂的哈希函数，并澄清了关于哈希分布的误解。

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

Recently I was looking for good implementation of hashCode() method in Java API and looked through Integer source code. Didn't expect that, but the hashCode() just returns the backed int value.

public final class Integer ... {

private final int value;

...

public int hashCode() {

return Integer.hashCode(value);

}

public static int hashCode(int value) {

return value;

}

It's really strange as there are a lot of papers and pages as well as packages dedicated to this question - how to design good hash function to distribute values.

Finally I ended up with this conclusion:

Integer is the worst data type candidate for a key when used with HashMap, as all consecutive keys will be places in one bin/bucked. Like in the sample above.

Map map = HashMap<>();

for (int i = 1; i < 10; i++) {

map.put(Integer.valueOf(i), "string" + i);

}

There are two questions, for which I didn't find answers while googled:

Am I right with my conclusion regarding Integer data type?

In case it's true, why Integer's hashCode() method don't implemented in some tricky way when power operation, prime numbers, binary shifting are used?

解决方案

Integer is the worst data type candidate for a key when used with HashMap, as all consecutive keys will be places in one bin

No, that statement is wrong.

In fact, the implementation of Integer's hashCode() is the best possible implementation. It maps each Integer value to a unique hashCode value, which reduces the chance of different keys being mapped into the same bucket.

Sometimes a simple implementation is the best.

From the Javadoc of hashCode() in the Object class:

It is not required that if two objects are unequal according to the java.lang.Object.equals(java.lang.Object) method, then calling the hashCode method on each of the two objects must produce distinct integer results. However, the programmer should be aware that producing distinct integer results for unequal objects may improve the performance of hash tables.

Integer is one of the few classes that actually guarantees that unequal objects will have different hashCode().