比较类的某两个实例 需重写equals与hashcode方法,如图是eclipse中自动重写对象的equals与hashcode方法
public class DeliveryRes {
private String id;
private String name;
@Override
public int hashCode() {
final int prime = 31;
int result = 1;
result = prime * result + ((id == null) ? 0 : id.hashCode());
result = prime * result + ((name == null) ? 0 : name.hashCode());
return result;
}
@Override
public boolean equals(Object obj) {
if (this == obj)
return true;
if (obj == null)
return false;
//同 if(!(other instanceof Coder))
if (getClass() != obj.getClass())
return false;
DeliveryRes other = (DeliveryRes) obj;
if (id == null) {
if (other.id != null)
return false;
} else if (!id.equals(other.id))
return false;
if (name == null) {
if (other.name != null)
return false;
} else if (!name.equals(other.name))
return false;
return true;
}
public String getId() {
return id;
}
public void setId(String id) {
this.id = id;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public DeliveryRes(String id, String name) {
super();
this.id = id;
this.name = name;
}
}
测试代码如下:
@Test
public void te(){
DeliveryRes res1 = new DeliveryRes("123","wjq");
DeliveryRes res2 = new DeliveryRes("123","wjq2");
DeliveryRes res3 = new DeliveryRes("123","wjq2");
System.out.println("res1.equals(res2)"+res1.equals(res2));
System.out.println("res2.equals(res3)"+res2.equals(res3));
System.out.println("res2 == res3 ?)"+ (res2 == res3));
List<DeliveryRes> res = new ArrayList<DeliveryRes>();
res.add(res2);
System.out.println("res.contains(res1) ?"+res.contains(res1));
System.out.println("res.contains(res3) ?"+res.contains(res3));
}
console如下:
res1.equals(res2)false
res2.equals(res3)true
res2 == res3 ?)false
res.contains(res1) ?false
res.contains(res3) ?true
为什么数字31做计算:
为什么是31而不是别的素数呢,因为:
31可以 由i*31== (i<<5)-1来表示,现在很多虚拟机里面都有做相关优化,使用31的原因可能是为了更好的分配hash地址,并且31只占用5bits!
所以从效率上 它是2的5次减1,对计算机来说2的乘除操作只需要做位移操作,例如*32就是左移5位。
也就是说31对计算机的角度来说运算更快、切占内存不多不少,而且形成惯例,虚拟机甚至都专门对他做了优化。所以常用31做系数算hashcode