Increase cluster per neighbour in KMeansLocalTests#testComputeNeighbours (elastic#138562)

iverase · web-flow · commit 96ea61b7d01f · 2025-11-25T15:05:27.000+01:00
diff --git a/server/src/test/java/org/elasticsearch/index/codec/vectors/cluster/KMeansLocalTests.java b/server/src/test/java/org/elasticsearch/index/codec/vectors/cluster/KMeansLocalTests.java
@@ -154,7 +154,7 @@ public void testComputeNeighbours() throws IOException {
                 vectors[i][j] = randomFloat();
             }
         }
-        int clustersPerNeighbour = randomIntBetween(32, 128);
+        int clustersPerNeighbour = randomIntBetween(64, 128);
         NeighborHood[] neighborHoodsGraph = NeighborHood.computeNeighborhoodsGraph(vectors, clustersPerNeighbour);
         NeighborHood[] neighborHoodsBruteForce = NeighborHood.computeNeighborhoodsBruteForce(vectors, clustersPerNeighbour);
         assertEquals(neighborHoodsGraph.length, neighborHoodsBruteForce.length);

Original file line number	Diff line number	Diff line change
`@@ -154,7 +154,7 @@ public void testComputeNeighbours() throws IOException {`
`154`	`154`	`vectors[i][j] = randomFloat();`
`155`	`155`	`}`
`156`	`156`	`}`
`157`		`- int clustersPerNeighbour = randomIntBetween(32, 128);`
	`157`	`+ int clustersPerNeighbour = randomIntBetween(64, 128);`
`158`	`158`	`NeighborHood[] neighborHoodsGraph = NeighborHood.computeNeighborhoodsGraph(vectors, clustersPerNeighbour);`
`159`	`159`	`NeighborHood[] neighborHoodsBruteForce = NeighborHood.computeNeighborhoodsBruteForce(vectors, clustersPerNeighbour);`
`160`	`160`	`assertEquals(neighborHoodsGraph.length, neighborHoodsBruteForce.length);`