Using SortedMap to sort 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<string,string> map=new hashmap<string, string> (); 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<string,string> Entry:map.entrySet ()) {System.out.println ("before sorting:" +entry.ge TKey () + "value" +entry.getvalue ()); }*/set<string> Set = Map.keyset ();     for (String s:set) {map.get (s); System.out.println ("Before Sorting:" +s+ "value" +map.get (s)); } System.out.println ("=========================sortedmap for processing ============================="); sortedmap<string,string> sort=new treemap<string,string> (map);/* set<map.entry<string,string >> Entry1=sort.entryset (); Iterator<map.entry<string,string>> It=entry1.iterator ();     while (It.hasnext ()) {map.entry<string,string> entry=it.next (); System.out.println ("After sorting:" +entry.getkey () + "value" +entry.getvalue ()); }*/set<string> sortset = Sort.keyset (); for (String s:sortset) {System.out.println ("After sorting:" +s+ "value" +sort.get (s));}}}

　　

Using SortedMap to sort HashMap