集册 Java实例教程 根据值对映射排序,返回具有可预测迭代初始值的排序映射

根据值对映射排序,返回具有可预测迭代初始值的排序映射

欢马劈雪     最近更新时间:2020-01-02 10:19:05

510
根据值对映射排序,返回具有可预测迭代初始值的排序映射

/*
时 代 J a v a 公 众 号 - nowjava.com 提供
*/

//package com.nowjava;

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 {

    /**

     * Sorts a map based on value, returns sorted map with predictable iteration

     * Initial code from: http://stackoverflow.com/questions/109383/how-to-sort-a-mapkey-value-on-the-values-in-java

     * @param map Map with assumed-Compable values

     * @param doReverse True if comparator's ordering should be reversed, False if normal

     * @return

     */

    public static <K, V extends Comparable<? super V>> Map<K, V> sortByValue(

            Map<K, V> map, boolean doReverse) {

        List<Map.Entry<K, V>> list = new LinkedList<Map.Entry<K, V>>(

                map.entrySet());


        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.getValue()).compareTo(o2.getValue());
                /**
                 * nowjava - 时代Java 提 供 
                **/

            }

        };


        if (doReverse) {

            Collections.sort(list, Collections.reverseOrder(comparator));

        } else {

            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;

    }


    
展开阅读全文