批量取回分片文档后恢复全局命中顺序

140        final ScoreDoc[] lastEmittedDocPerShard = context.getRequest().scroll() != null141            ? SearchPhaseController.getLastEmittedDocPerShard(reducedQueryPhase, numShards)142            : null;143        final List<Integer>[] docIdsToLoad = SearchPhaseController.fillDocIdsToLoad(numShards, scoreDocs);144        context.addReleasable(fetchResults);145        final CountedCollector<FetchSearchResult> counter = new CountedCollector<>(146            fetchResults,147            docIdsToLoad.length, // we count down every shard in the result no matter if we got any results or not148            () -> moveToNextPhase(fetchResults.getAtomicArray(), fetchResults::transferCharge, reducedQueryPhase, phaseStartTimeInNanos),149            context150        );

204    public static List<Integer>[] fillDocIdsToLoad(int numShards, ScoreDoc[] shardDocs) {205        @SuppressWarnings("unchecked")206        List<Integer>[] docIdsToLoad = (List<Integer>[]) new ArrayList<?>[numShards];207        for (ScoreDoc shardDoc : shardDocs) {208            List<Integer> shardDocIdsToLoad = docIdsToLoad[shardDoc.shardIndex];209            if (shardDocIdsToLoad == null) {210                shardDocIdsToLoad = docIdsToLoad[shardDoc.shardIndex] = new ArrayList<>();211            }212            shardDocIdsToLoad.add(shardDoc.doc);213        }214        return docIdsToLoad;215    }

129        SearchHit[] searchHits = new SearchHit[docIds.length];130        DocIdToIndex[] docs = new DocIdToIndex[docIds.length];131        for (int index = 0; index < docIds.length; index++) {132            docs[index] = new DocIdToIndex(docIds[index], index);133        }134        // make sure that we iterate in doc id order135        Arrays.sort(docs);136        int currentDoc = docs.length > 0 ? docs[0].docId : -1;137138        try {139            if (docs.length == 0) {140                return new IterateResult(searchHits);141            }142143            int leafOrd = ReaderUtil.subIndex(docs[0].docId, indexReader.leaves());144            LeafReaderContext ctx = indexReader.leaves().get(leafOrd);145            int endReaderIdx = endReaderIdx(ctx, 0, docs);

156            for (int i = 0; i < docs.length; i++) {157                try {158                    if (i >= endReaderIdx) {159                        leafOrd = ReaderUtil.subIndex(docs[i].docId, indexReader.leaves());160                        ctx = indexReader.leaves().get(leafOrd);161                        endReaderIdx = endReaderIdx(ctx, i, docs);162                        docsInLeaf = docIdsInLeaf(i, endReaderIdx, docs, ctx.docBase);163                        setNextReader(ctx, docsInLeaf);164                    }165                    currentDoc = docs[i].docId;166                    assert searchHits[docs[i].index] == null;167                    searchHits[docs[i].index] = nextDoc(docs[i].docId);168                } catch (ContextIndexSearcher.TimeExceededException e) {169                    if (allowPartialResults == false) {170                        purgeSearchHits(searchHits);171                    }172                    SearchTimeoutException.handleTimeout(allowPartialResults, shardTarget, querySearchResult);173                    assert allowPartialResults;174                    onAllHitsIterated();175                    return new IterateResult(stripNulls(searchHits));

313        var fetchResults = fetchResultsArray.asList();314        // clean the fetch counter315        for (SearchPhaseResult entry : fetchResults) {316            entry.fetchResult().initCounter();317        }318        int from = ignoreFrom ? 0 : reducedQueryPhase.from;319        int numSearchHits = (int) Math.min(reducedQueryPhase.fetchHits - from, reducedQueryPhase.size);320        // with collapsing we can have more fetch hits than sorted docs321        // also we need to take into account that we potentially have completion suggestions stored in the scoreDocs array322        numSearchHits = Math.min(sortedTopDocs.scoreDocs.length - sortedTopDocs.numberOfCompletionsSuggestions, numSearchHits);323        // merge hits324        List<SearchHit> hits = new ArrayList<>();325        if (fetchResults.isEmpty() == false) {326            for (int i = 0; i < numSearchHits; i++) {327                ScoreDoc shardDoc = sortedTopDocs.scoreDocs[i];328                SearchPhaseResult fetchResultProvider = fetchResultsArray.get(shardDoc.shardIndex);329                if (fetchResultProvider == null) {330                    // this can happen if we are hitting a shard failure during the fetch phase331                    // in this case we referenced the shard result via the ScoreDoc but never got a332                    // result from fetch.333                    // TODO it would be nice to assert this in the future334                    continue;

336                FetchSearchResult fetchResult = fetchResultProvider.fetchResult();337                final int index = fetchResult.counterGetAndIncrement();338                if (index >= fetchResult.hits().getHits().length) {339                    // the fetch phase on this shard timed out and returned partial results340                    continue;341                }342                SearchHit searchHit = fetchResult.hits().getHits()[index];343                searchHit.shard(fetchResult.getSearchShardTarget());