Files
openide/java/java-tests/testData/codeInsight/daemonCodeAnalyzer/quickFix/comparatorCanBeSimplified/afterComparingMapEntry.java
Tagir Valeev 6fdffcb1b5 IDEA-207434 Comprator.comparing(Map.Entry::getKey) -> Map.Entry.comparingByKey()
GitOrigin-RevId: 9481f1e30f7262576ae132295fa27f9777396896
2019-10-11 09:06:02 +00:00

26 lines
883 B
Java

// "Fix all 'Comparator can be simplified' problems in file" "true"
import java.util.*;
import java.util.Map.Entry;
import java.util.stream.Collectors;
class Test {
void test() {
Map<String, Integer> unsortMap = new HashMap<>();
unsortMap.put("z", 10);
unsortMap.put("b", 5);
unsortMap.put("a", 6);
unsortMap.put("c", 20);
unsortMap.put("d", 1);
Map<String, Integer> result = unsortMap.entrySet().stream()
.sorted(Entry.comparingByValue(Comparator.reverseOrder()))
.sorted(Entry.comparingByValue())
.sorted(Entry.comparingByKey())
.sorted(Entry.comparingByKey(String.CASE_INSENSITIVE_ORDER))
.collect(Collectors.toMap(Map.Entry::getKey, Map.Entry::getValue,
(oldValue, newValue) -> oldValue, LinkedHashMap::new));
System.out.println("Sorted...");
System.out.println(result);
}
}