- classPerson
- {
- publicPerson(String name, intage)
- {
- this.name = name;
- this.age = age;
- }
- privateString name;
- privateint age;
- publicString getName()
- {
- returnname;
- }
- publicvoid setName(String name)
- {
- this.name = name;
- }
- publicint getAge()
- {
- returnage;
- }
- publicvoid setAge(intage)
- {
- this.age = age;
- }
- publicString toString()
- {
- return"{" + name + ", " + age + "}";
- }
- }
现在有很多Person类的对象需要存储,很自然联想到用HashSet来存储,于是乎,写了下面的程序来测试一下:
- importjava.util.*;
- publicclass HashSetDemo
- {
- publicstatic void main(String[] args)
- {
- Collection<person> set = newHashSet<person>();
- set.add(newPerson("张三",21));
- set.add(newPerson("李四",19));
- set.add(newPerson("王五",22));
- set.add(newPerson("张三",21));
- sop(set);
- }
- privatestatic void sop(Collection<person> set)
- {
- Iterator<person> it = set.iterator();
- while(it.hasNext())
- {
- Person p = it.next();
- System.out.println(p.toString());
- }
- }
- }
在存储的时候,我故意存了两个“21岁的张三”,我的本意是这是同一个人,也就是说set集合里面只需要出现一个“21岁的张三”,可事实是:
出现了两个一样的张三,为什么会这样呢?
其实,在往HashSet集合放置元素时,会根据其hashCode来判断两个元素是否一样,如果是一样,这后者覆盖前者。而hashCode默认是比较其地址值。于是,对于两个new 出来的“21岁的张三”,其地址值不一样,所以HashSet才将两个均加入其中。
为了达到只存放一个的目的,我们必须重写hashCode方法,当然与其紧密联系的equals方法也要重写,新的Person类如下:
- classPerson
- {
- publicPerson(String name, intage)
- {
- this.name = name;
- this.age = age;
- }
- privateString name;
- privateint age;
- publicString getName()
- {
- returnname;
- }
- publicvoid setName(String name)
- {
- this.name = name;
- }
- publicint getAge()
- {
- returnage;
- }
- publicvoid setAge(intage)
- {
- this.age = age;
- }
- publicString toString()
- {
- return"{" + name + ", " + age + "}";
- }
- publicint hashCode()
- {
- returnname.hashCode() + age * 10;
- }
- publicboolean equals(Object obj)
- {
- if(!(obj instanceofPerson))
- thrownew ClassCastException("类型不匹配");
- Person p = (Person)obj;
- returnthis.name.equals(p.getName()) && this.age == p.getAge();
- }
- }<span style="text-indent: 2em; font-family: 宋体; background-color: rgb(255, 255, 255);"> </span>
此时,再运行重写,结果如下:
总结:一般对于存放到Set集合或者Map中键值对的元素,需要按需要重写hashCode与equals方法,以保证唯一性!