Minor rename

Author: easbar

core/src/main/java/com/graphhopper/storage/index/LocationIndexTree.java

@@ -77,12 +77,7 @@ public class LocationIndexTree implements LocationIndex {
     private double deltaLon;
     private int initSizeLeafEntries = 4;
     private boolean initialized = false;
-    private static final Comparator<Snap> Snap_COMPARATOR = new Comparator<Snap>() {
-        @Override
-        public int compare(Snap o1, Snap o2) {
-            return Double.compare(o1.getQueryDistance(), o2.getQueryDistance());
-        }
-    };
+    private static final Comparator<Snap> SNAP_COMPARATOR = Comparator.comparingDouble(Snap::getQueryDistance);
     /**
      * If normed distance is smaller than this value the node or edge is 'identical' and the
      * algorithm can stop search.
@@ -734,7 +729,7 @@ protected boolean check(int node, double normedDist, int wayIndex, EdgeIteratorS
         }
 
         // TODO: pass boolean argument for whether or not to sort? Can be expensive if not required.
-        Collections.sort(snaps, Snap_COMPARATOR);
+        Collections.sort(snaps, SNAP_COMPARATOR);
 
         for (Snap snap : snaps) {
             if (snap.isValid()) {

core/src/test/java/com/graphhopper/routing/RandomizedRoutingTest.java

@@ -244,7 +244,7 @@ public void randomGraph_withQueryGraph() {
         List<String> strictViolations = new ArrayList<>();
         for (int i = 0; i < numQueries; i++) {
             List<GHPoint> points = getRandomPoints(graph.getBounds(), 2, index, rnd);
-            List<Snap> snaps = findSnap(index, points);
+            List<Snap> snaps = findSnaps(index, points);
             QueryGraph queryGraph = QueryGraph.create(graph, snaps);
 
             int source = snaps.get(0).getClosestNode();
@@ -279,7 +279,7 @@ static List<GHPoint> getRandomPoints(BBox bounds, int numPoints, LocationIndex i
         return points;
     }
 
-    private List<Snap> findSnap(LocationIndexTree index, List<GHPoint> ghPoints) {
+    private List<Snap> findSnaps(LocationIndexTree index, List<GHPoint> ghPoints) {
         List<Snap> result = new ArrayList<>(ghPoints.size());
         for (GHPoint ghPoint : ghPoints) {
             result.add(index.findClosest(ghPoint.getLat(), ghPoint.getLon(), DefaultEdgeFilter.ALL_EDGES));