comment fixes

Author: mccullocht

lucene/core/src/java/org/apache/lucene/codecs/lucene99/Lucene99HnswVectorsReader.java

@@ -73,8 +73,7 @@ public final class Lucene99HnswVectorsReader extends KnnVectorsReader
 
   private static final long SHALLOW_SIZE =
       RamUsageEstimator.shallowSizeOfInstance(Lucene99HnswVectorsFormat.class);
-  // Number of ordinals to score at a time when scoring exhaustively rather than
-  // using HNSW.
+  // Number of ordinals to score at a time when scoring exhaustively rather than using HNSW.
   private static final int EXHAUSTIVE_BULK_SCORE_ORDS = 64;
 
   private final FlatVectorsReader flatVectorsReader;
@@ -341,8 +340,8 @@ private void search(
     // The approximate number of vectors that would be visited if we did not filter
     int unfilteredVisit = HnswGraphSearcher.expectedVisitedNodes(knnCollector.k(), graph.size());
     if (acceptDocs instanceof BitSet bitSet) {
-      // Use approximate cardinality as this is good enough, but ensure we don't
-      // exceed the graph size as that is illogical
+      // Use approximate cardinality as this is good enough, but ensure we don't exceed the graph
+      // size as that is illogical
       filteredDocCount = Math.min(bitSet.approximateCardinality(), graph.size());
       if (unfilteredVisit >= filteredDocCount) {
         doHnsw = false;
@@ -352,8 +351,8 @@ private void search(
       HnswGraphSearcher.search(
           scorer, collector, getGraph(fieldEntry), acceptedOrds, filteredDocCount);
     } else {
-      // if k is larger than the number of vectors we expect to visit in an HNSW
-      // search, we can just iterate over all vectors and collect them.
+      // if k is larger than the number of vectors we expect to visit in an HNSW search,
+      // we can just iterate over all vectors and collect them.
       int[] ords = new int[EXHAUSTIVE_BULK_SCORE_ORDS];
       float[] scores = new float[EXHAUSTIVE_BULK_SCORE_ORDS];
       int numOrds = 0;
@@ -443,8 +442,7 @@ private record FieldEntry(
       int dimension,
       int size,
       int[][] nodesByLevel,
-      // for each level the start offsets in vectorIndex file from where to read
-      // neighbours
+      // for each level the start offsets in vectorIndex file from where to read neighbours
       DirectMonotonicReader.Meta offsetsMeta,
       long offsetsOffset,
       int offsetsBlockShift,

lucene/core/src/java/org/apache/lucene/util/hnsw/HnswGraphSearcher.java

@@ -300,12 +300,10 @@ void searchLevel(
       }
     }
 
-    // A bound that holds the minimum similarity to the query vector that a
-    // candidate vector must
+    // A bound that holds the minimum similarity to the query vector that a candidate vector must
     // have to be considered.
     float minAcceptedSimilarity = Math.nextUp(results.minCompetitiveSimilarity());
-    // We should allow exploring equivalent minAcceptedSimilarity values at least
-    // once
+    // We should allow exploring equivalent minAcceptedSimilarity values at least once
     boolean shouldExploreMinSim = true;
     while (candidates.size() > 0 && results.earlyTerminated() == false) {
       // get the best candidate (closest or best scoring)
@@ -354,8 +352,7 @@ void searchLevel(
                 float oldMinAcceptedSimilarity = minAcceptedSimilarity;
                 minAcceptedSimilarity = Math.nextUp(results.minCompetitiveSimilarity());
                 if (minAcceptedSimilarity > oldMinAcceptedSimilarity) {
-                  // we adjusted our minAcceptedSimilarity, so we should explore the next
-                  // equivalent
+                  // we adjusted our minAcceptedSimilarity, so we should explore the next equivalent
                   // if necessary
                   shouldExploreMinSim = true;
                 }