mirror of
https://github.com/Zrips/Jobs.git
synced 2024-11-26 12:35:28 +01:00
98 lines
3.6 KiB
Java
98 lines
3.6 KiB
Java
|
package com.gamingmesh.jobs.stuff;
|
||
|
|
||
|
import java.util.Collections;
|
||
|
import java.util.Comparator;
|
||
|
import java.util.Iterator;
|
||
|
import java.util.LinkedHashMap;
|
||
|
import java.util.LinkedList;
|
||
|
import java.util.List;
|
||
|
import java.util.Map;
|
||
|
|
||
|
import com.gamingmesh.jobs.container.LogAmounts;
|
||
|
|
||
|
public class Sorting {
|
||
|
public static Map<String, Integer> sortDESC(Map<String, Integer> unsortMap) {
|
||
|
|
||
|
// Convert Map to List
|
||
|
List<Map.Entry<String, Integer>> list = new LinkedList<Map.Entry<String, Integer>>(unsortMap.entrySet());
|
||
|
|
||
|
// Sort list with comparator, to compare the Map values
|
||
|
Collections.sort(list, new Comparator<Map.Entry<String, Integer>>() {
|
||
|
public int compare(Map.Entry<String, Integer> o1, Map.Entry<String, Integer> o2) {
|
||
|
return (o2.getValue()).compareTo(o1.getValue());
|
||
|
}
|
||
|
});
|
||
|
|
||
|
// Convert sorted map back to a Map
|
||
|
Map<String, Integer> sortedMap = new LinkedHashMap<String, Integer>();
|
||
|
for (Iterator<Map.Entry<String, Integer>> it = list.iterator(); it.hasNext();) {
|
||
|
Map.Entry<String, Integer> entry = it.next();
|
||
|
sortedMap.put(entry.getKey(), entry.getValue());
|
||
|
}
|
||
|
return sortedMap;
|
||
|
}
|
||
|
|
||
|
public static Map<String, Double> sortDoubleDESC(Map<String, Double> unsortMap) {
|
||
|
|
||
|
// Convert Map to List
|
||
|
List<Map.Entry<String, Double>> list = new LinkedList<Map.Entry<String, Double>>(unsortMap.entrySet());
|
||
|
|
||
|
// Sort list with comparator, to compare the Map values
|
||
|
Collections.sort(list, new Comparator<Map.Entry<String, Double>>() {
|
||
|
public int compare(Map.Entry<String, Double> o1, Map.Entry<String, Double> o2) {
|
||
|
return (o2.getValue()).compareTo(o1.getValue());
|
||
|
}
|
||
|
});
|
||
|
|
||
|
// Convert sorted map back to a Map
|
||
|
Map<String, Double> sortedMap = new LinkedHashMap<String, Double>();
|
||
|
for (Iterator<Map.Entry<String, Double>> it = list.iterator(); it.hasNext();) {
|
||
|
Map.Entry<String, Double> entry = it.next();
|
||
|
sortedMap.put(entry.getKey(), entry.getValue());
|
||
|
}
|
||
|
return sortedMap;
|
||
|
}
|
||
|
|
||
|
public static Map<LogAmounts, Double> sortDoubleDESCByLog(Map<LogAmounts, Double> unsortMap) {
|
||
|
|
||
|
// Convert Map to List
|
||
|
List<Map.Entry<LogAmounts, Double>> list = new LinkedList<Map.Entry<LogAmounts, Double>>(unsortMap.entrySet());
|
||
|
|
||
|
// Sort list with comparator, to compare the Map values
|
||
|
Collections.sort(list, new Comparator<Map.Entry<LogAmounts, Double>>() {
|
||
|
public int compare(Map.Entry<LogAmounts, Double> o1, Map.Entry<LogAmounts, Double> o2) {
|
||
|
return (o2.getValue()).compareTo(o1.getValue());
|
||
|
}
|
||
|
});
|
||
|
|
||
|
// Convert sorted map back to a Map
|
||
|
Map<LogAmounts, Double> sortedMap = new LinkedHashMap<LogAmounts, Double>();
|
||
|
for (Iterator<Map.Entry<LogAmounts, Double>> it = list.iterator(); it.hasNext();) {
|
||
|
Map.Entry<LogAmounts, Double> entry = it.next();
|
||
|
sortedMap.put(entry.getKey(), entry.getValue());
|
||
|
}
|
||
|
return sortedMap;
|
||
|
}
|
||
|
|
||
|
public static Map<String, Integer> sortASC(Map<String, Integer> unsortMap) {
|
||
|
|
||
|
// Convert Map to List
|
||
|
List<Map.Entry<String, Integer>> list = new LinkedList<Map.Entry<String, Integer>>(unsortMap.entrySet());
|
||
|
|
||
|
// Sort list with comparator, to compare the Map values
|
||
|
Collections.sort(list, new Comparator<Map.Entry<String, Integer>>() {
|
||
|
public int compare(Map.Entry<String, Integer> o1, Map.Entry<String, Integer> o2) {
|
||
|
return (o1.getValue()).compareTo(o2.getValue());
|
||
|
}
|
||
|
});
|
||
|
|
||
|
// Convert sorted map back to a Map
|
||
|
Map<String, Integer> sortedMap = new LinkedHashMap<String, Integer>();
|
||
|
for (Iterator<Map.Entry<String, Integer>> it = list.iterator(); it.hasNext();) {
|
||
|
Map.Entry<String, Integer> entry = it.next();
|
||
|
sortedMap.put(entry.getKey(), entry.getValue());
|
||
|
}
|
||
|
return sortedMap;
|
||
|
}
|
||
|
}
|