首先解释下泛型:
List<? extends T>表示该集合中存在的都是类型T的子类,包括T自己;
List<? super T>表示该集合中存的都是类型T的父类,包括T自己;
以? extends T这种方式可以取元素而不能添加,这个叫get原则;
以? super T可以添加元素但是没法取出来,这个叫put原则;
public class TypeTest {
public static void main(String[] args) {
Boat<? extends Fish> fishBoat = new Boat<Shark>(new Shark());
Boat<? super Shark> sharkBoat = new Boat<Fish>(new Fish());
Boat<? super Fish> fishBoat2 = new Boat<Animal>();
fishBoat2.set(new Fish());
fishBoat2.set(new Shark());
fishBoat2.set(new Carp());
}
}
1. Treemap
TreeMap默认是升序的,如果我们需要改变排序方式,则需要使用比较器:Comparator。
Comparator是可以对集合对象或者数组进行排序的比较器接口,实现该接口的public compare(T o1,To2)方法即可实现排序,该方法主要是根据第一个参数o1,小于、等于或者大于o2分别返回负整数、0或者正整数;
import java.util.*;
/**
* @Auther: 13213
* @Date: 2020/5/14 10:56
* @Description:
*/
public class MapTest {
public static void main(String[] args) {
Map<String, Object> map = new TreeMap<String, Object>(
new Comparator<String>() {
@Override
public int compare(String obj1, String obj2) {
// 降序排序
return obj2.compareTo(obj1);
}
});
map.put("2019-03", "ccccc");
map.put("2018-12", "aaaaa");
map.put("2019-01", "bbbbb");
map.put("2019-02", "ddddd");
Set<String> keySet = map.keySet();
Iterator<String> iter = keySet.iterator();
while (iter.hasNext()) {
String key = iter.next();
System.out.println(key + ":" + map.get(key));
}
}
}
运行结果:
2. 根据TreeMap的value来进行排序
import java.util.*;
/**
* @Auther: 13213
* @Date: 2020/5/14 13:30
* @Description:
*/
public class MapTest2 {
public static void main(String[] args) {
Map<String, String> map = new TreeMap<String, String>();
map.put("c", "2019-03");
map.put("a", "2018-12");
map.put("b", "2019-01");
map.put("d", "2019-02");
//这里将map.entrySet()转换成list
List<Map.Entry<String,String>> list = new ArrayList<Map.Entry<String,String>>(map.entrySet());
//然后通过比较器来实现排序
Collections.sort(list,new Comparator<Map.Entry<String,String>>() {
//升序排序
@Override
public int compare(Map.Entry<String, String> o1,
Map.Entry<String, String> o2) {
return o1.getValue().compareTo(o2.getValue());
}
});
for(Map.Entry<String,String> mapping:list){
System.out.println(mapping.getKey()+":"+mapping.getValue());
}
}
}
3. HsahMap排序
import java.util.*;
/**
* @Auther: 13213
* @Date: 2020/5/14 13:35
* @Description:
*/
public class MapTest3 {
public static void main(String[] args) {
Map<String, String> map = new HashMap<String, String>();
map.put("c", "2019-03");
map.put("a", "2018-12");
map.put("b", "2019-01");
map.put("d", "2019-02");
List<Map.Entry<String,String>> list = new ArrayList<Map.Entry<String,String>>(map.entrySet());
Collections.sort(list,new Comparator<Map.Entry<String,String>>() {
//升序排序
@Override
public int compare(Map.Entry<String, String> o1,
Map.Entry<String, String> o2) {
return o1.getValue().compareTo(o2.getValue());
}
});
for(Map.Entry<String,String> mapping:list){
System.out.println(mapping.getKey()+":"+mapping.getValue());
}
}
}