- Timestamp:
- 2021-02-21T21:49:02+01:00 (3 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/src/org/openstreetmap/josm/data/osm/NodeGraph.java
r16628 r17515 367 367 TreeMap<Integer, Set<Node>> sortedMap = new TreeMap<>(Comparator.reverseOrder()); 368 368 for (Entry<Node, Integer> e : counters.entrySet()) { 369 sortedMap.computeIfAbsent(e.getValue(), LinkedHashSet::new).add(e.getKey());369 sortedMap.computeIfAbsent(e.getValue(), x -> new LinkedHashSet<>()).add(e.getKey()); 370 370 } 371 371 LinkedHashSet<Node> result = new LinkedHashSet<>();
Note:
See TracChangeset
for help on using the changeset viewer.