JavaDoc 将设置定义为:
A collection that contains no duplicate elements. More formally, sets contain no pair of elements e1 and e2 such that e1.equals(e2)
为了验证这一点,我创建了一个非常简单的程序:
import java.util.HashSet;
public class CheckHashSet {
public static void main(String[] args) {
HashSet<Employee> set = new HashSet<Employee>();
set.add(new Employee(10));
set.add(new Employee(10));
System.out.println(set.size());
System.out.println(new Employee(10).equals(new Employee(10)));
}
private static class Employee implements Comparable<Employee> {
private final int id;
public Employee(int id) {
this.id = id;
}
@Override
public int compareTo(Employee o) {
return this.id - o.id;
}
@Override
public boolean equals(Object obj) {
if(obj instanceof Employee) {
return compareTo((Employee)obj)==0;
}
return false;
}
}
}
程序的输出是
2
true
这意味着 new Employee(10).equals(new Employee(10))
返回 true,而 set.add(new Employee(10)); set.add(new Employee(10));
添加对象两次。
我的代码有什么问题吗?
最佳答案
您的 Employee
类不会覆盖 hashCode
- 它需要这样做才能使任何基于哈希的集合正常工作。
例如:
@Override
public int hashCode() {
return id;
}
关于Java Set 获取重复条目,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/58016529/