Here you can find the source of sortByKeys( Map
public static <K extends Comparable<? super K>, V> Map<K, V> sortByKeys( Map<K, V> map)
//package com.java2s; //License from project: Open Source License import java.util.Collections; import java.util.Comparator; import java.util.LinkedHashMap; import java.util.LinkedList; import java.util.List; import java.util.Map; public class Main { public static <K extends Comparable<? super K>, V> Map<K, V> sortByKeys( Map<K, V> map) { Comparator<Map.Entry<K, V>> comparator = new Comparator<Map.Entry<K, V>>() { public int compare(Map.Entry<K, V> o1, Map.Entry<K, V> o2) { return (o1.getKey()).compareTo(o2.getKey()); }//w w w . j a va2 s . c o m }; return sortMapByKeys(map, comparator); } public static <K extends Comparable<? super K>, V> Map<K, V> sortMapByKeys( Map<K, V> map, Comparator<Map.Entry<K, V>> comparator) { List<Map.Entry<K, V>> list = new LinkedList<Map.Entry<K, V>>( map.entrySet()); Collections.sort(list, comparator); Map<K, V> result = new LinkedHashMap<K, V>(); for (Map.Entry<K, V> entry : list) { result.put(entry.getKey(), entry.getValue()); } return result; } }