P540 TreeSet自然排序和定制排序

TreeSet自然排序

@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",12));
    set.add(new User("Jim",12));
    set.add(new User("Mike",12));
    set.add(new User("Jack",12));
    set.add(new User("Jack",56));
    Iterator iterator = set.iterator();
    while (iterator.hasNext()){
        System.out.println(iterator.next());
    }
}

TreeSet定制排序

@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",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());
    }
}