1.从源码角度,hashcode源码上面的注解,即官方规定的需要这样做。
从下面的注释中可以得出以下几点重要信息:
1.如果两个对象通过equals方法比较返回true, 那么这两个对象的hashcode()方法返回值也必须一样.
2.如果用于equals中比较的信息在运行时没有被改变, 那么该对象的hashcode()方法在每次被调用时的返回值应该是相同的.
3.hashcode()返回的hashcode不一定要每次都一致 (比如说用于equals方法中的信息在运行时发生了变化, 那么hashcode应该也会做出相应的变化)
4.不要求两个equals不等的对象, hashcode也要不同. 即允许两个不equals的对象, 有相同的hashcode. 不过, 如果equals不同的对象, hashcode也不同的话, 可能提高hash table (这里应该是泛指使用了哈希的数据结构) 的性能. (本文后面会讲为什么可能提高性能).
/**
* Returns a hash code value for the object. This method is
* supported for the benefit of hash tables such as those provided by
* {@link java.util.HashMap}.
* <p>
* The general contract of {@code hashCode} is:
* <ul>
* <li>Whenever it is invoked on the same object more than once during
* an execution of a Java application, the {@code hashCode} method
* must consistently return the same integer, provided no information
* used in {@code equals} comparisons on the object is modified.
* This integer need not remain consistent from one execution of an
* application to another execution of the same application.
* <li>If two objects are equal according to the {@code equals(Object)}
* method, then calling the {@code hashCode} method on each of
* the two objects must produce the same integer result.
* <li>It is <em>not</em> required that if two objects are unequal
* according to the {@link java.lang.Object#equals(java.lang.Object)}
* method, then calling the {@code 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.
* </ul>
*
* @implSpec
* As far as is reasonably practical, the {@code hashCode} method defined
* by class {@code Object} returns distinct integers for distinct objects.
*
* @return a hash code value for this object.
* @see java.lang.Object#equals(java.lang.Object)
* @see java.lang.System#identityHashCode
*/
@HotSpotIntrinsicCandidate
public native int hashCode();
仅仅根据第一条,equals相同,hashcode必须相同,就需要满足更改equals必须更改hashcode才能满足第一条
2.从set集合说起
set是根据key对象的hashcode来区分不同的key的,也就是key对象的内容相同(更改equals之后,equals想同的情况下,但是没有更改hashcode)这时的对象的hashcode没有更改,所以hashcode是不同的,所以set会存储两个一样的对象,这也违背的set的设计,所以修改equals必须修改hashcode