TreeSet使用中的两种比较方式

TreeSet是Set接口的子类，它可以对元素进行排序，是不同步的，可以保证元素的唯一性：其方式为通过指定的比较方式对两个元素进行比较，如果返回值为0，那么视为相同元素，不会再次存储。

第一种比较方式：

public class Person {
	
	private String name;
	private int age;
	
	
	public Person(String name, int age) {
		super();
		this.name = name;
		this.age = age;
	}
	
	public Person() {
		super();
	}

	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;
	}
	
}

import java.util.Comparator;
import java.util.Iterator;
import java.util.TreeSet;
public class TreeSetDemo {

	public static void main(String[] args) {
		TreeSet ts = new TreeSet(new ComparatorImpl());
		/*使用TreeSet参数为Comparator的构造方法，那么TreeSet本身具备比较能力，
		 * 优先级高于元素自身的比较能力。
		 */
		ts.add(new Person("zhangsan",20));
		ts.add(new Person("zhangsan",28));
		ts.add(new Person("lisi",21));
		ts.add(new Person("lisi",23));
		ts.add(new Person("wangwu",22));
		ts.add(new Person("wangwu",24));
		ts.add(new Person("zhaoliu",23));
		ts.add(new Person("zhaoliu",28));
		ts.add(new Person("qianqi",24));
		ts.add(new Person("qianqi",29));
		
		Iterator it = ts.iterator();
		while(it.hasNext()){
			Person p = (Person) it.next();
			System.out.println("name="+p.getName()+"....age="+p.getAge());
		}
	}
}

class ComparatorImpl implements Comparator{   
	//自定义比较器，实现Comparator接口，重写compare方法。
	public int compare(Object o1, Object o2) {
		Person p1 = (Person)o1;
		Person p2 = (Person)o2;
		int temp = p1.getName().compareTo(p2.getName());
		//按照名字排序，如果名字相同，就以年龄排序
		return (temp==0)?p1.getAge()-p2.getAge():temp;
	}
}

第二种比较方式：

public class Student implements Comparable{
	/*
	 * 元素实现Comparable接口，重写compareTo方法，使得元素
	 * 自身具备比较能力
	 */
	private String name;
	private int grade;
	
	public Student() {
		super();
	}
	public Student(String name, int grade) {
		super();
		this.name = name;
		this.grade = grade;
	}
	public String getName() {
		return name;
	}
	public void setName(String name) {
		this.name = name;
	}
	public int getGrade() {
		return grade;
	}
	public void setGrade(int grade) {
		this.grade = grade;
	}
	public int compareTo(Object o) {

		Student s = (Student)o;
		int temp = this.getName().compareTo(s.getName());
		return temp==0?this.getGrade()-s.getGrade():temp;
	}
}

import java.util.Iterator;
import java.util.TreeSet;


public class TreeSetDemo2 {

	public static void main(String[] args) {
		TreeSet ts = new TreeSet();
		ts.add(new Student("zhangsan",20));
		ts.add(new Student("zhangsan",28));
		ts.add(new Student("lisi",21));
		ts.add(new Student("lisi",23));
		ts.add(new Student("wangwu",22));
		ts.add(new Student("wangwu",24));
		ts.add(new Student("zhaoliu",23));
		ts.add(new Student("zhaoliu",28));
		ts.add(new Student("qianqi",24));
		ts.add(new Student("qianqi",29));
		Iterator it = ts.iterator();
		while(it.hasNext()){
			Student s = (Student) it.next();
			System.out.println("name="+s.getName()+"....grade="+s.getGrade());
		}
	}

}

如果将方式一中的compare方法改为return 1，方式二中的compareTo方法也改为return 1，也就是说忽略元素的属性，那么遍历时会按照添加的顺序输出，同理改为-1会按照添加的相反的顺序输出。