Sort a Map<Key, Value> by values

Here's a generic-friendly version:

public class MapUtil {    public static <K, V extends Comparable<? super V>> Map<K, V> sortByValue(Map<K, V> map) {        List<Entry<K, V>> list = new ArrayList<>(map.entrySet());        list.sort(Entry.comparingByValue());        Map<K, V> result = new LinkedHashMap<>();        for (Entry<K, V> entry : list) {            result.put(entry.getKey(), entry.getValue());        }        return result;    }}

Important note:

This code can break in multiple ways. If you intend to use the code provided, be sure to read the comments as well to be aware of the implications. For example, values can no longer be retrieved by their key. (get always returns null.)

It seems much easier than all of the foregoing. Use a TreeMap as follows:

public class Testing {    public static void main(String[] args) {        HashMap<String, Double> map = new HashMap<String, Double>();        ValueComparator bvc = new ValueComparator(map);        TreeMap<String, Double> sorted_map = new TreeMap<String, Double>(bvc);        map.put("A", 99.5);        map.put("B", 67.4);        map.put("C", 67.4);        map.put("D", 67.3);        System.out.println("unsorted map: " + map);        sorted_map.putAll(map);        System.out.println("results: " + sorted_map);    }}class ValueComparator implements Comparator<String> {    Map<String, Double> base;    public ValueComparator(Map<String, Double> base) {        this.base = base;    }    // Note: this comparator imposes orderings that are inconsistent with    // equals.    public int compare(String a, String b) {        if (base.get(a) >= base.get(b)) {            return -1;        } else {            return 1;        } // returning 0 would merge keys    }}

Output:

unsorted map: {D=67.3, A=99.5, B=67.4, C=67.4}results: {D=67.3, B=67.4, C=67.4, A=99.5}

Java 8 offers a new answer: convert the entries into a stream, and use the comparator combinators from Map.Entry:

Stream<Map.Entry<K,V>> sorted =    map.entrySet().stream()       .sorted(Map.Entry.comparingByValue());

This will let you consume the entries sorted in ascending order of value. If you want descending value, simply reverse the comparator:

Stream<Map.Entry<K,V>> sorted =    map.entrySet().stream()       .sorted(Collections.reverseOrder(Map.Entry.comparingByValue()));

If the values are not comparable, you can pass an explicit comparator:

Stream<Map.Entry<K,V>> sorted =    map.entrySet().stream()       .sorted(Map.Entry.comparingByValue(comparator));

You can then proceed to use other stream operations to consume the data. For example, if you want the top 10 in a new map:

Map<K,V> topTen =    map.entrySet().stream()       .sorted(Map.Entry.comparingByValue(Comparator.reverseOrder()))       .limit(10)       .collect(Collectors.toMap(          Map.Entry::getKey, Map.Entry::getValue, (e1, e2) -> e1, LinkedHashMap::new));

Or print to System.out:

map.entrySet().stream()   .sorted(Map.Entry.comparingByValue())   .forEach(System.out::println);