核心类库-集合-Set接口2-TreeSet

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

import org.junit.Test;

public class TreeSetTest {

	/*
	 1.向TreeSet中添加的数据,要求是相同类的对象
	 2.两种排序方式:自然排序(实现Comparable) 和 定制排序
	 
	 3.自然排序中,比较两个对象是否相同的标准为:compareTo()返回0,不再是equals().
	 4.定制排序中,比较两个对象是否相同的标准为:compare()返回0,不再是equals().
	 */
	@Test
	public void test1() {
		TreeSet set=new TreeSet();
		
//		//失败:不能添加不同类的对象
//		set.add(123);
//		set.add(456);
//		set.add("AA");
//		set.add(new User("Tom",12));
		
//			//举例一:
//		set.add(34);
//		set.add(-34);
//		set.add(43);
//		set.add(11);
//		set.add(8);
		
		//举例二:
		set.add(new User("Tom",12));
		set.add(new User("Jerry",32));
		set.add(new User("Jim",2));
		set.add(new User("Mike",65));
		set.add(new User("Jack",33));
		set.add(new User("Jack",56));
		
		Iterator iterator = set.iterator();
		while(iterator.hasNext()) {
			System.out.println(iterator.next());
		}
	}
	
	@Test
	public void test2() {
		Comparator com=new Comparator() {
			//按照年龄从小到大排列
			@Override
			public int compare(Object o1, Object o2) {
				if(o1 instanceof User && o2 instanceof User) {
					User u1=(User)o1;
					User u2=(User)o2;
					return Integer.compare(u1.getAge(), u2.getAge());
				}else {
					throw new RuntimeException("输入的数据类型不匹配");
				}
			}
			
		};
		
		TreeSet set=new TreeSet(com);
		set.add(new User("Tom",12));
		set.add(new User("Jerry",32));
		set.add(new User("Jim",2));
		set.add(new User("Mike",65));
		set.add(new User("Mary",33));
		set.add(new User("Jack",33));
		set.add(new User("Jack",56));
		
		Iterator iterator = set.iterator();
		while(iterator.hasNext()) {
			System.out.println(iterator.next());
	}
	}
}

public class User implements Comparable{
	private String name;
	private int age;
	@Override
	public String toString() {
		return "User [name=" + name + ", age=" + age + "]";
	}
	public User() {
		super();
	}
	public User(String name, int age) {
		super();
		this.name = name;
		this.age = age;
	}
	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 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) {
		System.out.println("User equals()..");
		if (this == obj)
			return true;
		if (obj == null)
			return false;
		if (getClass() != obj.getClass())
			return false;
		User other = (User) 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(Object o) {
		if(o instanceof User) {
			User user=(User)o;
//			return this.name.compareTo(user.name);
//			return -this.name.compareTo(user.name); //从大到小
			int compare = -this.name.compareTo(user.name);
			if(compare != 0) {
				return compare;
			}else {
				return Integer.compare(this.age, user.age);
			}
		}else {
			throw new RuntimeException("输入的类型不匹配");
		}
	}
	
}




评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值