set 排序问题

同时有一篇文章是

Java中Comparable和Comparator实现对象比较

http://chengyue2007.iteye.com/blog/675194

 

 

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

public class PersonTest implements Comparable<Object>{
	private String jgcm;
	private String name;
	
	public PersonTest(String jgcm, String name) {
		 
		this.jgcm = jgcm;
		this.name = name;
	}
	public String getJgcm() {
		return jgcm;
	}
	public void setJgcm(String jgcm) {
		this.jgcm = jgcm;
	}
	public String getName() {
		return name;
	}
	public void setName(String name) {
		this.name = name;
	}
	public int compareTo(Object o) {
		 if (o instanceof PersonTest){
			 PersonTest my=(PersonTest)o;
			  
			 if(my.jgcm.compareTo(this.jgcm) >=0){
				 System.out.println("******************");
				 return -1;
			 }else{
				 return 1;
			 }
			 
		 }
		return 0;
	}
	
	public static void  main(String args []){
		//PersonTest(String jgcm, String name) 
	 
		TreeSet<PersonTest> set= new TreeSet<PersonTest>();
		
 //这里用TreeSet必须的
		PersonTest s5=new PersonTest("02","c02");			set.add(s5);
		PersonTest s2=new PersonTest("0101","c0101");		set.add(s2);
		PersonTest s3=new PersonTest("0102","c0102");		set.add(s3);
		PersonTest s1=new PersonTest("01","c1");			set.add(s1);
		PersonTest s4=new PersonTest("0104","c0104");		set.add(s4);
		PersonTest s41=new PersonTest("010405","c010405");	set.add(s41);
		
		PersonTest s6=new PersonTest("0201","c0201");		set.add(s6);
		PersonTest s7=new PersonTest("0202","c0202");		set.add(s7);
		PersonTest s8=new PersonTest("020292","c020209");	set.add(s8);
		//Collections.sort(list);
	 
		Iterator it=set.iterator();
		for(int i=0;i<set.size();i++){
			PersonTest p=(PersonTest)it.next();
			System.out.println(p.getJgcm());
		}
		
		
	}
}