org.apache.lucene.search.spans
public class SpanScorer extends Scorer
Scorer.ChildScorer| Modifier and Type | Field and Description |
|---|---|
protected int |
doc |
protected Similarity.SimScorer |
docScorer |
protected float |
freq |
protected boolean |
more |
protected int |
numMatches |
protected Spans |
spans |
FLAG_FREQS, FLAG_NONENO_MORE_DOCS| Modifier | Constructor and Description |
|---|---|
protected |
SpanScorer(Spans spans,
Weight weight,
Similarity.SimScorer docScorer) |
| 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.
|
long |
cost()
Returns the estimated cost of this
DocIdSetIterator. |
int |
docID()
Returns the following:
-1 or
DocIdSetIterator.NO_MORE_DOCS if DocIdSetIterator.nextDoc() or
DocIdSetIterator.advance(int) were not called yet. |
int |
freq()
Returns term frequency in the current document, or 1 if the field was
indexed with
FieldInfo.IndexOptions.DOCS_ONLY. |
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.
|
protected boolean |
setFreqCurrentDoc() |
float |
sloppyFreq()
Returns the intermediate "sloppy freq" adjusted for edit distance
|
getChildren, getWeight, score, scoreattributesempty, slowAdvanceprotected Spans spans
protected boolean more
protected int doc
protected float freq
protected int numMatches
protected final Similarity.SimScorer docScorer
protected SpanScorer(Spans spans, Weight weight, Similarity.SimScorer docScorer) throws IOException
IOExceptionpublic 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 DocIdSetIteratorIOExceptionprotected boolean setFreqCurrentDoc()
throws IOException
IOExceptionpublic int docID()
DocIdSetIteratorDocIdSetIterator.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 DocIdSetIteratorpublic float score()
throws IOException
ScorerDocIdSetIterator.nextDoc() or DocIdSetIterator.advance(int)
is called the first time, or when called from within
Collector.collect(int).score in class ScorerIOExceptionpublic int freq()
throws IOException
DocsEnumFieldInfo.IndexOptions.DOCS_ONLY. Do not call this before
DocIdSetIterator.nextDoc() is first called, nor after DocIdSetIterator.nextDoc() returns
DocIdSetIterator.NO_MORE_DOCS.
NOTE: if the DocsEnum was obtain with DocsEnum.FLAG_NONE,
the result of this method is undefined.
freq in class DocsEnumIOExceptionpublic float sloppyFreq()
throws IOException
IOExceptionpublic 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-2014 Apache Software Foundation. All Rights Reserved.