HSEARCH-3661 Do not collect counts in Lucene's range collectors

if needed that would get collected by the collectors/managers etc

Author: marko-bekhta

backend/lucene/src/main/java/org/hibernate/search/backend/lucene/lowlevel/collector/impl/RangeCollector.java

@@ -33,7 +33,6 @@ public class RangeCollector extends SimpleCollector {
 	private final long[] boundaries;
 	private final IntArrayList[] countsPerBoundaries;
 
-	private final long[] counts;
 	private final Collector[][] collectors;
 	private final CollectorKey<?, ?>[] keys;
 	private final LeafCollector[][] leafCollectors;
@@ -138,7 +137,6 @@ else if ( flags == 1 ) {
 			}
 		}
 
-		counts = new long[ranges.length];
 		leafCollectors = new LeafCollector[keys.length][];
 		for ( int i = 0; i < leafCollectors.length; i++ ) {
 			leafCollectors[i] = new LeafCollector[ranges.length];
@@ -147,7 +145,6 @@ else if ( flags == 1 ) {
 
 	private void processLeafWithIndex(int index, int doc) throws IOException {
 		for ( IntCursor cursor : countsPerBoundaries[index] ) {
-			counts[cursor.value]++;
 			for ( int i = 0; i < keys.length; i++ ) {
 				leafCollectors[i][cursor.value].collect( doc );
 			}
@@ -193,10 +190,6 @@ public void collect(int doc) throws IOException {
 		}
 	}
 
-	public long[] counts() {
-		return counts;
-	}
-
 	public Collector[][] collectors() {
 		return collectors;
 	}

lucene-next/backend/lucene/src/main/java/org/hibernate/search/backend/lucene/lowlevel/collector/impl/RangeCollector.java

@@ -33,7 +33,6 @@ public class RangeCollector extends SimpleCollector {
 	private final long[] boundaries;
 	private final IntArrayList[] countsPerBoundaries;
 
-	private final long[] counts;
 	private final Collector[][] collectors;
 	private final CollectorKey<?, ?>[] keys;
 	private final LeafCollector[][] leafCollectors;
@@ -138,7 +137,6 @@ else if ( flags == 1 ) {
 			}
 		}
 
-		counts = new long[ranges.length];
 		leafCollectors = new LeafCollector[keys.length][];
 		for ( int i = 0; i < leafCollectors.length; i++ ) {
 			leafCollectors[i] = new LeafCollector[ranges.length];
@@ -147,7 +145,6 @@ else if ( flags == 1 ) {
 
 	private void processLeafWithIndex(int index, int doc) throws IOException {
 		for ( IntCursor cursor : countsPerBoundaries[index] ) {
-			counts[cursor.value]++;
 			for ( int i = 0; i < keys.length; i++ ) {
 				leafCollectors[i][cursor.value].collect( doc );
 			}
@@ -193,10 +190,6 @@ public void collect(int doc) throws IOException {
 		}
 	}
 
-	public long[] counts() {
-		return counts;
-	}
-
 	public Collector[][] collectors() {
 		return collectors;
 	}