覆盖equals时总是覆盖hashCode
这是规范,原因:因为在散列集合中要保持equals和hashCode的一致性
而且,equals相等hashCode必须相等,但equals是不想等的,不要求hashCode也不相等
案例:
public final class PhoneNumber {
private final short areaCode;
private final short prefix;
private final short lineNumber;
public PhoneNumber(int areaCode, int prefix, int lineNumber) {
rangeCheck(areaCode, 999, "area code");
rangeCheck(prefix, 999, "prefix");
rangeCheck(lineNumber, 9999, "line number");
this.areaCode = (short) areaCode;
this.prefix = (short) prefix;
this.lineNumber = (short) lineNumber;
}
private static void rangeCheck(int arg, int max, String name) {
if (arg < 0 || arg > max)
throw new IllegalArgumentException(name + ": " + arg);
}
@Override
public boolean equals(Object o) {
if (o == this)
return true;
if (!(o instanceof PhoneNumber))
return false;
PhoneNumber pn = (PhoneNumber) o;
return pn.lineNumber == lineNumber && pn.prefix == prefix
&& pn.areaCode == areaCode;
}
public static void main(String[] args) {
Map<PhoneNumber, String> m = new HashMap<PhoneNumber, String>();
m.put(new PhoneNumber(707, 867, 5309), "Jenny");
//不会返回jenney,因为没有重写hashcode,两者是不是同一个对象
//哪怕是散列到同一个位置,也不能返回,因为hashmap有优化
System.out.println(m.get(new PhoneNumber(707, 867, 5309)));
}
}
重写hashcode
选择31是因为,31是个素数,17是任选的初值
A decent hashCode method - Page 48
@Override public int hashCode() {
int result = 17;
result = 31 * result + areaCode;
result = 31 * result + prefix;
result = 31 * result + lineNumber;
return result;
}
缓存散列码
如果一个类是不可变的,可以将散列码缓存起来(String就是这么干的)
private volatile int hashCode; // (See Item 71)
@Override public int hashCode() {
int result = hashCode;
if (result == 0) {
result = 17;
result = 31 * result + areaCode;
result = 31 * result + prefix;
result = 31 * result + lineNumber;
hashCode = result;
}
return result;
}