public class ScoreCachingWrappingScorer extends Scorer
Scorer
which wraps another scorer and caches the score of the
current document. Successive calls to score()
will return the same
result and will not invoke the wrapped Scorer's score() method, unless the
current document has changed.Collector
interface, in which the score is not computed for a document by default, only
if the collector requests it. Some collectors may need to use the score in
several places, however all they have in hand is a Scorer
object, and
might end up computing the score of a document more than once.Scorer.ChildScorer
NO_MORE_DOCS
Constructor and Description |
---|
ScoreCachingWrappingScorer(Scorer scorer)
Creates a new instance by wrapping the given scorer.
|
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 |
docID()
Returns the following:
-1 or
DocIdSetIterator.NO_MORE_DOCS if DocIdSetIterator.nextDoc() or
DocIdSetIterator.advance(int) were not called yet. |
float |
freq()
Returns number of matches for the current document.
|
Collection<Scorer.ChildScorer> |
getChildren()
Returns child sub-scorers
|
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.
|
void |
score(Collector collector)
Scores and collects all matching documents.
|
boolean |
score(Collector collector,
int max,
int firstDocID)
Expert: Collects matching documents in a range.
|
public ScoreCachingWrappingScorer(Scorer scorer)
public boolean score(Collector collector, int max, int firstDocID) throws IOException
Scorer
firstDocID
is added to ensure that DocIdSetIterator.nextDoc()
was called before this method.score
in class Scorer
collector
- The collector to which all matching documents are passed.max
- Do not score documents past this.firstDocID
- The first document ID (ensures DocIdSetIterator.nextDoc()
is called before
this method.IOException
public float score() throws IOException
Scorer
DocIdSetIterator.nextDoc()
or DocIdSetIterator.advance(int)
is called the first time, or when called from within
Collector.collect(int)
.score
in class Scorer
IOException
public float freq() throws IOException
Scorer
freq
in class Scorer
IOException
public int docID()
DocIdSetIterator
DocIdSetIterator.NO_MORE_DOCS
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 int nextDoc() throws IOException
DocIdSetIterator
DocIdSetIterator.NO_MORE_DOCS
if there are no more docs in the
set.nextDoc
in class DocIdSetIterator
IOException
public void score(Collector collector) throws IOException
Scorer
score
in class Scorer
collector
- The collector to which all matching documents are passed.IOException
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 Collection<Scorer.ChildScorer> getChildren()
Scorer
getChildren
in class Scorer
Copyright © 2000-2012 Apache Software Foundation. All Rights Reserved.