[CI] Auto commit changes from spotless

Author: elasticsearchmachine

server/src/main/java/org/elasticsearch/index/codec/vectors/DefaultIVFVectorsWriter.java

@@ -264,17 +264,17 @@ CentroidAssignments calculateAndWriteCentroids(
         float[][] parentCentroids = result.centroids();
         int[] parentChildAssignments = result.assignments();
         // TODO: explore using soar assignments here as well
-        //int[] parentChildSoarAssignments = result.soarAssignments();
+        // int[] parentChildSoarAssignments = result.soarAssignments();
 
         AssignmentArraySorter sorter = new AssignmentArraySorter(centroids, centroidOrds, parentChildAssignments);
         sorter.sort(0, centroids.length);
 
-        for(int i = 0; i < parentChildAssignments.length; i++) {
+        for (int i = 0; i < parentChildAssignments.length; i++) {
             int label = parentChildAssignments[i];
             int centroidCount = 0;
             int j = i;
-            for(; j < parentChildAssignments.length; j++) {
-                if(parentChildAssignments[j] != label) {
+            for (; j < parentChildAssignments.length; j++) {
+                if (parentChildAssignments[j] != label) {
                     break;
                 }
                 centroidCount++;
@@ -295,7 +295,7 @@ CentroidAssignments calculateAndWriteCentroids(
         }
 
         IntIntMap centroidOrdsToIdx = new IntIntHashMap(centroidOrds.length);
-        for(int i = 0; i < centroidOrds.length; i++) {
+        for (int i = 0; i < centroidOrds.length; i++) {
             centroidOrdsToIdx.put(centroidOrds[i], i);
         }
         int[][] assignmentsByCluster = mapAssignmentsByCluster(centroids.length, assignments, soarAssignments, centroidOrdsToIdx);

server/src/main/java/org/elasticsearch/index/codec/vectors/IVFVectorsReader.java

@@ -292,12 +292,7 @@ public final void search(String field, float[] target, KnnCollector knnCollector
 
         while (parentCentroidQueue.size() > 0 && (centroidsVisited < nProbe || knnCollectorImpl.numCollected() < knnCollector.k())) {
             NeighborQueue centroidQueue = new NeighborQueue(centroidQueryScorer.size(), true);
-            updateCentroidQueueWNextParent(
-                parentCentroidQueryScorer,
-                parentCentroidQueue,
-                centroidQueryScorer,
-                centroidQueue
-            );
+            updateCentroidQueueWNextParent(parentCentroidQueryScorer, parentCentroidQueue, centroidQueryScorer, centroidQueue);
 
             PostingVisitor scorer = getPostingVisitor(fieldInfo, ivfClusters, target, needsScoring);
             // initially we visit only the "centroids to search"
@@ -316,13 +311,8 @@ public final void search(String field, float[] target, KnnCollector knnCollector
                 // ... would be centroidScore < (nextParentScore + furthestCentroidScore) which is better than just a buffer
                 // TODO: try a ParentNProbe here that's for instance the sqrt(nProbe) that forces a fixed
                 // ... number of parents to be explored at each step
-                while (parentCentroidQueue.size() > 0 && centroidScore < (nextParentScore + nextParentScore * 0.05) ) {
-                    updateCentroidQueueWNextParent(
-                        parentCentroidQueryScorer,
-                        parentCentroidQueue,
-                        centroidQueryScorer,
-                        centroidQueue
-                    );
+                while (parentCentroidQueue.size() > 0 && centroidScore < (nextParentScore + nextParentScore * 0.05)) {
+                    updateCentroidQueueWNextParent(parentCentroidQueryScorer, parentCentroidQueue, centroidQueryScorer, centroidQueue);
                     if (parentCentroidQueue.size() > 0) {
                         nextParentScore = parentCentroidQueue.topScore();
                     } else {

server/src/test/java/org/elasticsearch/index/codec/vectors/DefaultIVFVectorsWriterTests.java

@@ -11,6 +11,7 @@
 
 import com.carrotsearch.hppc.IntIntHashMap;
 import com.carrotsearch.hppc.IntIntMap;
+
 import org.elasticsearch.test.ESTestCase;
 
 import static org.elasticsearch.index.codec.vectors.DefaultIVFVectorsWriter.mapAssignmentsByCluster;
@@ -30,18 +31,18 @@ public void testAssignmentsByCluster() {
         int[] centroidOrds = new int[] { 3, 2, 4, 0, 1 };
 
         IntIntMap centroidOrdsToIdx = new IntIntHashMap(centroidOrds.length);
-        for(int i = 0; i < centroidOrds.length; i++) {
+        for (int i = 0; i < centroidOrds.length; i++) {
             // idx 0 1 2 3 4 5
             // ord 3 2 0 4 1 5
             centroidOrdsToIdx.put(centroidOrds[i], i);
         }
 
         int[][] assignmentsByCluster = mapAssignmentsByCluster(centroidOrds.length, assignments, soarAssignments, centroidOrdsToIdx);
 
-        assertArrayEquals(assignmentsByCluster[0], new int[] {0, 1, 5, 9, 14});
-        assertArrayEquals(assignmentsByCluster[1], new int[] {2, 4, 6, 8, 12, 13, 13, 14});
-        assertArrayEquals(assignmentsByCluster[2], new int[] {10, 10, 11, 11});
-        assertArrayEquals(assignmentsByCluster[3], new int[] {0, 1, 2, 7});
-        assertArrayEquals(assignmentsByCluster[4], new int[] {3, 3, 4, 5, 6, 7, 8, 9, 12});
+        assertArrayEquals(assignmentsByCluster[0], new int[] { 0, 1, 5, 9, 14 });
+        assertArrayEquals(assignmentsByCluster[1], new int[] { 2, 4, 6, 8, 12, 13, 13, 14 });
+        assertArrayEquals(assignmentsByCluster[2], new int[] { 10, 10, 11, 11 });
+        assertArrayEquals(assignmentsByCluster[3], new int[] { 0, 1, 2, 7 });
+        assertArrayEquals(assignmentsByCluster[4], new int[] { 3, 3, 4, 5, 6, 7, 8, 9, 12 });
     }
 }