mirror of
https://github.com/honeymoose/OpenSearch.git
synced 2025-02-18 19:05:06 +00:00
parent
c52c3cea68
commit
e7e5216382
@ -40,7 +40,7 @@ public final class CollapseTopFieldDocs extends TopFieldDocs {
|
|||||||
/** The collapse value for each top doc */
|
/** The collapse value for each top doc */
|
||||||
public final Object[] collapseValues;
|
public final Object[] collapseValues;
|
||||||
|
|
||||||
public CollapseTopFieldDocs(String field, int totalHits, ScoreDoc[] scoreDocs,
|
public CollapseTopFieldDocs(String field, long totalHits, ScoreDoc[] scoreDocs,
|
||||||
SortField[] sortFields, Object[] values, float maxScore) {
|
SortField[] sortFields, Object[] values, float maxScore) {
|
||||||
super(totalHits, scoreDocs, sortFields, maxScore);
|
super(totalHits, scoreDocs, sortFields, maxScore);
|
||||||
this.field = field;
|
this.field = field;
|
||||||
@ -170,7 +170,7 @@ public final class CollapseTopFieldDocs extends TopFieldDocs {
|
|||||||
}
|
}
|
||||||
final PriorityQueue<ShardRef> queue = new MergeSortQueue(sort, shardHits);
|
final PriorityQueue<ShardRef> queue = new MergeSortQueue(sort, shardHits);
|
||||||
|
|
||||||
int totalHitCount = 0;
|
long totalHitCount = 0;
|
||||||
int availHitCount = 0;
|
int availHitCount = 0;
|
||||||
float maxScore = Float.MIN_VALUE;
|
float maxScore = Float.MIN_VALUE;
|
||||||
for(int shardIDX=0;shardIDX<shardHits.length;shardIDX++) {
|
for(int shardIDX=0;shardIDX<shardHits.length;shardIDX++) {
|
||||||
|
@ -295,7 +295,7 @@ public class Lucene {
|
|||||||
}
|
}
|
||||||
return new TopFieldDocs(totalHits, fieldDocs, fields, maxScore);
|
return new TopFieldDocs(totalHits, fieldDocs, fields, maxScore);
|
||||||
} else if (type == 2) {
|
} else if (type == 2) {
|
||||||
int totalHits = in.readVInt();
|
long totalHits = in.readVLong();
|
||||||
float maxScore = in.readFloat();
|
float maxScore = in.readFloat();
|
||||||
|
|
||||||
String field = in.readString();
|
String field = in.readString();
|
||||||
|
Loading…
x
Reference in New Issue
Block a user