根据map key进行排序

 

package com.kingdee.eas.hr.perf.client;

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.TreeSet;

//add by ypf on 20140410  根据map的key进行排序
public class MapSort {

    private HashMap map = new HashMap();
    private Set keySet = map.keySet();

    public Object get(String key) {
        return map.get(key);
    }

    public void put(String key, Object value) {
        map.put(key, value);
    }

    public Set sort(Map map) {
        List list = new ArrayList(map.keySet());

        Collections.sort(list, new Comparator() {
            public int compare(Object a, Object b) {
                return a.toString().toLowerCase().compareTo(
                        b.toString().toLowerCase());
            }
        });

        this.keySet = new TreeSet(list);
        return keySet;
    }

    public Set keySet() {
        return this.keySet;
    }

    public static void main(String[] args) {
        MapSort map = new MapSort();
        map.put("1", "yi");
        map.put("8", "ba");
        map.put("9", "jiu");
        map.put("7", "qi");
        map.put("5", "wu");
        map.put("6", "liu");
        map.put("4", "si");
        map.put("3", "san");
        map.put("2", "er");

        for (Iterator it = map.keySet().iterator(); it.hasNext();) {
            String key = (String) it.next();
            // System.out.println( "key[ " + key + "],   value[ " + map.get(key)
            // + "] ");
        }

        // System.out.println( "\n ");
//        map.sort();
        for (Iterator it = map.keySet().iterator(); it.hasNext();) {
            String key = (String) it.next();
            System.out.println("key[ " + key + "],   value[ " + map.get(key)
                    + "] ");
        }
    }
}