Empty tree getStats()

tzaeschke · Jun 22, 2024 · 1d0631f · 1d0631f
1 parent fafc04b
commit 1d0631f
Showing 1 changed file with 4 additions and 4 deletions.
diff --git a/src/test/java/ch/ethz/globis/phtree/test/TestMultiMapF2.java b/src/test/java/ch/ethz/globis/phtree/test/TestMultiMapF2.java
@@ -227,15 +227,15 @@ public void testKNN() {
         assertTrue(3 <= result.size());
 
         result = toList(idx.nearestNeighbour(1, 1, 1));
-        assertTrue(!result.isEmpty());
+        assertFalse(result.isEmpty());
         check(result.get(0).getKey(), 1, 1);
 
         result = toList(idx.nearestNeighbour(1, 1, 3));
-        assertTrue(!result.isEmpty());
+        assertFalse(result.isEmpty());
         check(result.get(0).getKey(), 1, 3);
 
         result = toList(idx.nearestNeighbour(1, 3, 1));
-        assertTrue(!result.isEmpty());
+        assertFalse(result.isEmpty());
         check(result.get(0).getKey(), 3, 1);
     }
 
@@ -274,7 +274,7 @@ public void testKnnLarge() {
                     v[j] = R.nextDouble() * MAXV;
                 }
                 list.forEach(xx -> xx.dist = dist(v, xx.key));
-                list.sort((o1, o2) -> Double.compare(o1.dist, o2.dist));
+                list.sort(Comparator.comparingDouble(o -> o.dist));
                 List<PhEntryDistF<Integer>> nnList = toList(q.reset(MIN_RESULT, PhDistanceF.THIS, v));
                 assertFalse("i=" + i + " d=" + d, nnList.isEmpty());
                 for (int x = 0; x < MIN_RESULT; ++x) {