java-HashSet

对于自定义数据类型，保证元素唯一性的方式依赖于： hashCode 与 equals 方法。不重写这两个方法会导致元素重复。

import java.util.*;
class Student{
	private String name;
	private int age;
	public Student(){}
	public Student(String name,int age){
		this.name = name;
		this.age = age;
	}
	public String getName(){
		return name;
	}
	public int getAge() {
		return age;
	}

	public int hashCode() {
		return name.hashCode() + age;
	}
	public boolean equals(Object o) {
		Student s;
		if(o instanceof Student) {
			s = (Student)o;
			if(this.getName().equals(s.getName()) && 
					this.getAge() == s.getAge()) {
				return true;
			}
		}
		return false;
	}

	public String toString(){
		StringBuilder sb = new StringBuilder();
		sb.append("name:");
		sb.append(name);
		sb.append(",age:");
		sb.append(age);
		return sb.toString();
	}	
}
public class HashSetTest {
	public static void print(Set set) {
		Iterator iter = set.iterator();
		Student s;
		while(iter.hasNext()) {
			s = (Student)iter.next();
			System.out.println(s);
		}
	}
	public static void main(String[] args) {
		Set set = new HashSet();
		set.add(new Student("Jack",20));
		set.add(new Student("Jack",20));
		set.add(new Student("Tom",22));
		set.add(new Student("Jerry",21));
		set.add(new Student("Kevin",19));
		print(set);
	}
}