hashmap的遍历

package com;

import java.util.*;

public class HashMap {
    public static void main(String[] args) {
        Map<String,String> map = new java.util.HashMap<String, String>();
        map.put("A","a");
        map.put("C","c");
        map.put("B","b");
        map.put("D","d");
        //遍历hashmap
        //1.二次取值(性能差)
//        for (String key:map.keySet()) {
//            System.out.println("key:"+key+"value:"+map.get(key));
//        }
        //2.二次取值（强于1） 迭代器
//        Iterator iterator = map.entrySet().iterator();
//        while (iterator.hasNext()){
//            Map.Entry<String,String> entry = (Map.Entry<String, String>) iterator.next();
//            System.out.println(entry.getKey()+entry.getValue());
//        }
        //3.推荐
//        for (Map.Entry<String,String> e:map.entrySet()
//             ) {
//            System.out.println(e.getKey()+e.getValue());
//        }
        //4.（只能遍历value）
//        for (String v:map.values()
//             ) {
//            System.out.println(v);
//        }

        //按照key和value排序
        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) {
                //升序 key
//                return o1.getKey().compareTo(o2.getKey());
                // value
                return o1.getValue().compareTo(o2.getValue());
            }
        });
        for (Map.Entry<String,String> en:list
             ) {
            System.out.println(en.getKey());
        }
//        Set set = map.keySet();
//        Object[] arr = set.toArray();
//        Arrays.sort(arr);
//        for (Object k:arr
//             ) {
//            System.out.println(k);
//        }
    }
}