BallTree WIP

tzaeschke · Aug 11, 2024 · 4da0dff · 4da0dff
1 parent d6cf965
commit 4da0dff
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 2 deletions.
diff --git a/src/main/java/org/tinspin/index/balltree/BTIteratorKnn.java b/src/main/java/org/tinspin/index/balltree/BTIteratorKnn.java
@@ -129,7 +129,7 @@ private void findNextElement() {
                     if (distL <= maxNodeDist) {
                         queueN.push(new NodeDistT(distL, leftChild));
                     }
-                    BTNode rightChild = node.getLeftChild();
+                    BTNode rightChild = node.getRightChild();
                     double distR = distFn.dist(center, rightChild.getCenter()) - rightChild.getRadius();
                     if (distR <= maxNodeDist) {
                         queueN.push(new NodeDistT(distR, rightChild));

diff --git a/src/test/java/org/tinspin/index/test/PointMapTest.java b/src/test/java/org/tinspin/index/test/PointMapTest.java
@@ -145,7 +145,7 @@ private void smokeTest(List<Entry> data) {
         }
 
         if (candidate != IDX.COVER && candidate != IDX.KDTREE && candidate != IDX.QUAD_PLAIN
-                && candidate != IDX.QUAD_HC && candidate != IDX.QUAD_HC2) {
+                && candidate != IDX.QUAD_HC && candidate != IDX.QUAD_HC2 && candidate != IDX.BALL) {
             int nExtent = 0;
             PointIterator<Entry> extent = tree.iterator();
             while (extent.hasNext()) {