Package org.apache.lucene.search
Class TimeLimitingBulkScorer
- java.lang.Object
-
- org.apache.lucene.search.BulkScorer
-
- org.apache.lucene.search.TimeLimitingBulkScorer
-
public class TimeLimitingBulkScorer extends BulkScorer
TheTimeLimitingBulkScorer
is used to timeout search requests that take longer than the maximum allowed search time limit. After this time is exceeded, the search thread is stopped by throwing aTimeLimitingBulkScorer.TimeExceededException
.- See Also:
ExitableDirectoryReader
-
-
Constructor Summary
Constructors Constructor Description TimeLimitingBulkScorer(BulkScorer bulkScorer, QueryTimeout queryTimeout)
Create a TimeLimitingBulkScorer wrapper over anotherBulkScorer
with a specified timeout.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description long
cost()
Same asDocIdSetIterator.cost()
for bulk scorers.int
score(LeafCollector collector, Bits acceptDocs, int min, int max)
Collects matching documents in a range and return an estimation of the next matching document which is on or aftermax
.-
Methods inherited from class org.apache.lucene.search.BulkScorer
score
-
-
-
-
Constructor Detail
-
TimeLimitingBulkScorer
public TimeLimitingBulkScorer(BulkScorer bulkScorer, QueryTimeout queryTimeout)
Create a TimeLimitingBulkScorer wrapper over anotherBulkScorer
with a specified timeout.- Parameters:
bulkScorer
- the wrappedBulkScorer
queryTimeout
- max time allowed for collecting hits after whichTimeLimitingBulkScorer.TimeExceededException
is thrown
-
-
Method Detail
-
score
public int score(LeafCollector collector, Bits acceptDocs, int min, int max) throws IOException
Description copied from class:BulkScorer
Collects matching documents in a range and return an estimation of the next matching document which is on or aftermax
.The return value must be:
- >=
max
, DocIdSetIterator.NO_MORE_DOCS
if there are no more matches,- <= the first matching document that is >=
max
otherwise.
min
is the minimum document to be considered for matching. All documents strictly before this value must be ignored.Although
max
would be a legal return value for this method, higher values might help callers skip more efficiently over non-matching portions of the docID space.For instance, a
Scorer
-based implementation could look like below:private final Scorer scorer; // set via constructor public int score(LeafCollector collector, Bits acceptDocs, int min, int max) throws IOException { collector.setScorer(scorer); int doc = scorer.docID(); if (doc < min) { doc = scorer.advance(min); } while (doc < max) { if (acceptDocs == null || acceptDocs.get(doc)) { collector.collect(doc); } doc = scorer.nextDoc(); } return doc; }
- Specified by:
score
in classBulkScorer
- Parameters:
collector
- The collector to which all matching documents are passed.acceptDocs
-Bits
that represents the allowed documents to match, ornull
if they are all allowed to match.min
- Score starting at, including, this documentmax
- Score up to, but not including, this doc- Returns:
- an under-estimation of the next matching doc after max
- Throws:
IOException
- >=
-
cost
public long cost()
Description copied from class:BulkScorer
Same asDocIdSetIterator.cost()
for bulk scorers.- Specified by:
cost
in classBulkScorer
-
-