Java tutorial
//package com.java2s; /* * #%L * BroadleafCommerce Common Libraries * %% * Copyright (C) 2009 - 2013 Broadleaf Commerce * %% * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. * #L% */ import java.util.Comparator; import java.util.LinkedHashMap; import java.util.Map; import java.util.Map.Entry; import java.util.Set; import java.util.TreeSet; public class Main { public static <K, V> Map<K, V> valueSortedMap(Map<K, V> map, Comparator<Entry<K, V>> comparator) { Set<Entry<K, V>> valueSortedEntries = new TreeSet<Entry<K, V>>(comparator); for (Entry<K, V> entry : map.entrySet()) { valueSortedEntries.add(entry); } Map<K, V> sortedMap = new LinkedHashMap<K, V>(map.size()); for (Entry<K, V> entry : valueSortedEntries) { sortedMap.put(entry.getKey(), entry.getValue()); } return sortedMap; } }