关于Java的Hashcode,Object类的方法解释如下:
public int hashCode()
Returns a hash code value for the object. This method is supported for the benefit of hash tables such as those provided by HashMap.
The general contract of hashCode is:
Whenever it is invoked on the same object more than once during an execution of a Java application, the hashCode method must consistently return the same integer, provided no information used in 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.
If two objects are equal according to the equals(Object) method, then calling the hashCode method on each of the two objects must produce the same integer result.
It is not required that if two objects are unequal according to the 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.
As much as is reasonably practical, the hashCode method defined by class Object does return distinct integers for distinct objects. (This is typically implemented by converting the internal address of the object into an integer, but this implementation technique is not required by the Java™ programming language.)
简单来说,就是如果两个对象equals为true,那么hashcode则相同,如果euals不为true,不能保证都不同。
各个类中的hashcode方法的实现是尽量保证不同对象具有不同的hashcode,但是不能保证都不同。
事实上,判断两个变量引用的对象在物理上是不是同一个位置,最好用"=="(equals只是用在判断两个对象的内容是否一样?hashcode一般用在hashmap上?)。