java 集合比较 排序

import java.util.Iterator;
import java.util.Map;
import java.util.TreeMap;


public class Testcollection {
public static void main(String[] args) {
Map<Object,Object>treeMap = new TreeMap<>();
treeMap.put(new Apple(5.12, "a"), 21);
treeMap.put(new Apple(3.15, "Z"), 22);
treeMap.put(new Apple(445.2, "c"), 23);
Iterator iterator = treeMap.entrySet().iterator();
while(iterator.hasNext()){
System.out.println(iterator.next());
}

}
}




class Apple implements Comparable<Apple>{
double weiget;
String name;

public Apple() {

}
public Apple(double weiget, String name) {
this.weiget = weiget;
this.name = name;
}
public double getWeiget() {
return weiget;
}
public void setWeiget(double weiget) {
this.weiget = weiget;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
@Override
public int compareTo(Apple o) {
int ret = 0;

if(this.getName().compareTo(o.getName())>0){
ret = 1;
}else if(this.getName().compareTo(o.getName())==0){
ret = 0;
}else if(this.getName().compareTo(o.getName())<0){
ret = -1;
}
return ret;

}
@Override
public String toString() {
return "Apple [weiget=" + weiget + ", name=" + name + "]";
}





}