java.util.sortedmap_利用SortedMap对HashMap进行排序

import java.util.HashMap;

import java.util.Set;

import java.util.SortedMap;

import java.util.TreeMap;

public class SortTest {

public static void main(String[] args) {

HashMap map=new HashMap();

map.put("a","a");

map.put("s", "s");

map.put("o", "o");

map.put("z", "z");

map.put("b", "b");

map.put("t", "t");

/* for (Map.Entry entry: map.entrySet()) {

System.out.println("排序之前:"+entry.getKey()+" 值"+entry.getValue());

}*/

Set set = map.keySet();

for(String s:set){

map.get(s);

System.out.println("排序之前:"+s+" 值"+map.get(s));

}

System.out.println("=========================SortedMap进行处理=============================");

SortedMap sort=new TreeMap(map);

/* Set> entry1=sort.entrySet();

Iterator> it=entry1.iterator();

while(it.hasNext())

{

Map.Entry entry=it.next();

System.out.println("排序之后:"+entry.getKey()+" 值"+entry.getValue());

}*/

Set sortSet = sort.keySet();

for (String s :sortSet){

System.out.println("排序之后:"+s+" 值"+sort.get(s));

}

}

}