Scorer.ChildScorerNO_MORE_DOCS| Constructor and Description |
|---|
ConstantScoreScorer(Weight weight,
float score,
DocIdSetIterator disi)
Constructor based on a
DocIdSetIterator which will be used to
drive iteration. |
ConstantScoreScorer(Weight weight,
float score,
TwoPhaseIterator twoPhaseIterator)
Constructor based on a
TwoPhaseIterator. |
| 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.
|
TwoPhaseIterator |
asTwoPhaseIterator()
Optional method: Return a
TwoPhaseIterator view of this
Scorer. |
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. |
int |
freq()
Returns the freq of this Scorer on the current document
|
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. |
float |
score()
Returns the score of the current document matching the query.
|
getChildren, getWeightall, empty, slowAdvancepublic ConstantScoreScorer(Weight weight, float score, DocIdSetIterator disi)
DocIdSetIterator which will be used to
drive iteration. Two phase iteration will not be supported.weight - the parent weightscore - the score to return on each documentdisi - the iterator that defines matching documentspublic ConstantScoreScorer(Weight weight, float score, TwoPhaseIterator twoPhaseIterator)
TwoPhaseIterator. In that case the
Scorer will support two-phase iteration.weight - the parent weightscore - the score to return on each documenttwoPhaseIterator - the iterator that defines matching documentspublic TwoPhaseIterator asTwoPhaseIterator()
ScorerTwoPhaseIterator view of this
Scorer. A return value of null indicates that
two-phase iteration is not supported.
Note that the returned TwoPhaseIterator's
approximation must
advance synchronously with this iterator: advancing the approximation must
advance this iterator and vice-versa.
Implementing this method is typically useful on Scorers
that have a high per-document overhead in order to confirm matches.
The default implementation returns null.asTwoPhaseIterator in class Scorerpublic float score()
throws IOException
ScorerDocIdSetIterator.nextDoc() or DocIdSetIterator.advance(int)
is called the first time, or when called from within
LeafCollector.collect(int).score in class ScorerIOExceptionpublic int freq()
throws IOException
Scorerfreq in class ScorerIOExceptionpublic 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 DocIdSetIteratorpublic int nextDoc()
throws IOException
DocIdSetIteratorDocIdSetIterator.NO_MORE_DOCS if there are no more docs in the
set.nextDoc in class DocIdSetIteratorIOExceptionpublic int advance(int target)
throws IOException
DocIdSetIteratorDocIdSetIterator.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 DocIdSetIteratorIOExceptionpublic long cost()
DocIdSetIteratorDocIdSetIterator.
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 DocIdSetIteratorCopyright © 2000-2015 Apache Software Foundation. All Rights Reserved.