Upstream/addon-level
1
0
Fork 0
mirror of https://github.com/BentoBoxWorld/Level.git synced 2024-11-05 18:33:10 +01:00
Code Issues Projects Releases Wiki Activity

Removed extraneous class.

Browse Source
This commit is contained in:
tastybento 2017-10-24 20:56:26 -07:00
parent 8d3d6edd66
commit c6fbd2c6fa
1 changed files with 0 additions and 53 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

53
Level/src/bskyblock/addin/level/util/MapUtil.java
View File

@ -1,53 +0,0 @@
/*******************************************************************************
* This file is part of ASkyBlock.
*
* ASkyBlock is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* ASkyBlock is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with ASkyBlock. If not, see <http://www.gnu.org/licenses/>.
*******************************************************************************/
package bskyblock.addin.level.util;
import java.util.Collections;
import java.util.Comparator;
import java.util.LinkedHashMap;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
/**
* @author tastybento
*/
public class MapUtil {
/**
* Sorts map in descending order
*
* @param map
* @return
*/
public static <Key, Value extends Comparable<? super Value>> LinkedHashMap<Key, Value> sortByValue(Map<Key, Value> map) {
List<Map.Entry<Key, Value>> list = new LinkedList<Map.Entry<Key, Value>>(map.entrySet());
Collections.sort(list, new Comparator<Map.Entry<Key, Value>>() {
public int compare(Map.Entry<Key, Value> o1, Map.Entry<Key, Value> o2) {
// Switch these two if you want ascending
return (o2.getValue()).compareTo(o1.getValue());
}
});
LinkedHashMap<Key, Value> result = new LinkedHashMap<Key, Value>();
for (Map.Entry<Key, Value> entry : list) {
result.put(entry.getKey(), entry.getValue());
if (result.size() > 20)
break;
}
return result;
}
}