Java基础之集合与泛型之map排序

public class Student implements Comparable<Entry>{
String name;
int age;
public Student(String name, int age) {
	super();
	this.name = name;
	this.age = age;
}
public Student() {
	super();
	// TODO Auto-generated constructor stub
}
public String getName() {
	return name;
}
public void setName(String name) {
	this.name = name;
}
public int getAge() {
	return age;
}
public void setAge(int age) {
	this.age = age;
}
@Override
public String toString() {
	return "Student [name=" + name + ", age=" + age + "]";
}
@Override
public int hashCode() {
	final int prime = 31;
	int result = 1;
	result = prime * result + age;
	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 (getClass() != obj.getClass())
		return false;
	Student other = (Student) obj;
	if (age != other.age)
		return false;
	if (name == null) {
		if (other.name != null)
			return false;
	} else if (!name.equals(other.name))
		return false;
	return true;
}
@Override
public int compareTo(Entry o) {
	return this.age;
}
}

public class SortMap {
	public static void main(String[] args) {
		Student s1 = new Student("杨威龙", 23);
		Student s2 = new Student("杨豪", 21);
		Student s3 = new Student("王安石", 22);
		HashMap<Student, String> map = new HashMap<Student, String>();
		map.put(s1, "虾蟆陵");
		map.put(s2, "黄鹤楼");
		map.put(s3, "扬州");
		// keyset+迭代
		// keySet(map);
		// entry
		//entry(map);
		//高级for循环
		//前面已经用到，不再赘述
	}

	private static void entry(HashMap<Student, String> map) {
		Set<Entry<Student, String>> entrySet = map.entrySet();
		LinkedHashSet<Student> lhs = new LinkedHashSet<Student>();
		for (Entry<Student, String> entry : entrySet) {
			lhs.add(entry.getKey());
		}
		TreeSet<Student> treeSet = new TreeSet<Student>(new MyComparator());
		treeSet.addAll(lhs);
		for (Student s : treeSet) {
			System.out.println(s.name + '\t' + s.age + '\t' + map.get(s));
		}
	}

	private static void keySet(HashMap<Student, String> map) {
		Set<Student> keySet = map.keySet();
		Iterator<Student> it = keySet.iterator();
		TreeSet<Student> treeSet = new TreeSet<Student>(new MyComparator());
		while (it.hasNext()) {
			treeSet.add(it.next());
		}
		for (Student s : treeSet) {
			System.out.println(s.name + '\t' + s.age + '\t' + map.get(s));
		}
	}

}

class MyComparator implements Comparator<Student> {

	@Override
	public int compare(Student o1, Student o2) {

		return o1.age - o2.age;
	}

}