moving back to 2 for loop impl for common nodes

apache · Nov 16, 2023 · 60d7bb9 · 60d7bb9
1 parent d9211dd
commit 60d7bb9
Showing 1 changed file with 1 addition and 1 deletion.
diff --git a/lucene/core/src/java/org/apache/lucene/util/hnsw/HnswGraphBuilder.java b/lucene/core/src/java/org/apache/lucene/util/hnsw/HnswGraphBuilder.java
@@ -346,7 +346,7 @@ private int findWorstNonDiverse(NeighborArray neighbors, int nodeOrd, int level)
     for (int i = neighbors.size() - 1; i >= 0 ; i--) {
       int currNode = neighbors.node[i];
       NeighborArray currNodeNeighbours = hnsw.getNeighbors(level, currNode);
-      NeighborArray commonNeighbours = findCommonIntMap(neighbors, currNodeNeighbours);
+      NeighborArray commonNeighbours = findCommonBruteforce(neighbors, currNodeNeighbours);
 
       if (commonNeighbours.size() > maxCommonConnectionCount) {
         maxCommonConnectionCount = commonNeighbours.size();