public final class ImpactsDISI extends DocIdSetIterator
DocIdSetIterator
that skips non-competitive docs thanks to the
indexed impacts. Call setMinCompetitiveScore(float)
in order to
give this iterator the ability to skip low-scoring documents.NO_MORE_DOCS
Constructor and Description |
---|
ImpactsDISI(DocIdSetIterator in,
ImpactsSource impactsSource,
Similarity.SimScorer scorer)
Sole constructor.
|
Modifier and Type | Method and Description |
---|---|
int |
advance(int target)
Advances to the first beyond the current whose document number is greater
than or equal to target, and returns the document number itself.
|
int |
advanceShallow(int target)
Implement the contract of
Scorer.advanceShallow(int) based on the
wrapped ImpactsEnum . |
long |
cost()
Returns the estimated cost of this
DocIdSetIterator . |
int |
docID()
Returns the following:
-1 if DocIdSetIterator.nextDoc() or
DocIdSetIterator.advance(int) were not called yet. |
float |
getMaxScore(int upTo)
|
int |
nextDoc()
Advances to the next document in the set and returns the doc it is
currently on, or
DocIdSetIterator.NO_MORE_DOCS if there are no more docs in the
set.NOTE: after the iterator has exhausted you should not call this method, as it may result in unpredicted behavior. |
void |
setMinCompetitiveScore(float minCompetitiveScore)
Set the minimum competitive score.
|
all, empty, range, slowAdvance
public ImpactsDISI(DocIdSetIterator in, ImpactsSource impactsSource, Similarity.SimScorer scorer)
in
- wrapped iteratorimpactsSource
- source of impactsscorer
- scorerpublic void setMinCompetitiveScore(float minCompetitiveScore)
Scorable.setMinCompetitiveScore(float)
public int advanceShallow(int target) throws IOException
Scorer.advanceShallow(int)
based on the
wrapped ImpactsEnum
.IOException
Scorer.advanceShallow(int)
public float getMaxScore(int upTo) throws IOException
IOException
Scorer.getMaxScore(int)
public int advance(int target) throws IOException
DocIdSetIterator
DocIdSetIterator.NO_MORE_DOCS
if target
is greater than the highest document number in the set.
The behavior of this method is undefined when called with
target ≤ current
, or after the iterator has exhausted.
Both cases may result in unpredicted behavior.
When target > current
it behaves as if written:
int advance(int target) { int doc; while ((doc = nextDoc()) < target) { } return doc; }Some implementations are considerably more efficient than that.
NOTE: this method may be called with DocIdSetIterator.NO_MORE_DOCS
for
efficiency by some Scorers. If your implementation cannot efficiently
determine that it should exhaust, it is recommended that you check for that
value in each call to this method.
advance
in class DocIdSetIterator
IOException
public int nextDoc() throws IOException
DocIdSetIterator
DocIdSetIterator.NO_MORE_DOCS
if there are no more docs in the
set.nextDoc
in class DocIdSetIterator
IOException
public int docID()
DocIdSetIterator
-1
if DocIdSetIterator.nextDoc()
or
DocIdSetIterator.advance(int)
were not called yet.
DocIdSetIterator.NO_MORE_DOCS
if the iterator has exhausted.
docID
in class DocIdSetIterator
public long cost()
DocIdSetIterator
DocIdSetIterator
.
This is generally an upper bound of the number of documents this iterator might match, but may be a rough heuristic, hardcoded value, or otherwise completely inaccurate.
cost
in class DocIdSetIterator
Copyright © 2000-2021 Apache Software Foundation. All Rights Reserved.