先写一个Person类
import java.util.Objects;
public class Person {
int id;
String name;
public Person(int id, String name) {
this.id = id;
this.name = name;
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
Person person = (Person) o;
return id == person.id && Objects.equals(name, person.name);
}
@Override
public int hashCode() {
return Objects.hash(id, name);
}
@Override
public String toString() {
return "Person{" +
"id=" + id +
", name='" + name + '\'' +
'}';
}
}
主函数(用注释分析)
package com.utkvrjan.homework;
import java.util.HashSet;
public class Homework{
public static void main(String[] args) {
HashSet set=new HashSet();
Person p1=new Person(1001,"AA");
Person p2=new Person(1002,"BB");
set.add(p1);
set.add(p2);
p1.name="CC";
set.remove(p1);//删除不成功,因为第一次p1(1001-AA)的hash值跟修改完之后的p1(1001-CC)的hash值不同,所以找不到p1
System.out.println(set);
set.add(new Person(1001,"CC"));//可以添加成功,因为新建的元素和原先p1的算出来的hash值不同
System.out.println(set);
set.add(new Person(1001,"AA"));//可以添加成功,虽然hash值跟原先的p1的hash值相同,但是equals方法比较之后发现一个是“AA”,一个是“CC”(被修改后),就说明是两个元素
System.out.println(set);
}
}
结果:
[Person{id=1002, name='BB'}, Person{id=1001, name='CC'}]
[Person{id=1002, name='BB'}, Person{id=1001, name='CC'}, Person{id=1001, name='CC'}]
[Person{id=1002, name='BB'}, Person{id=1001, name='CC'}, Person{id=1001, name='CC'}, Person{id=1001, name='AA'}]
table表的结构: