Module org.apache.lucene.core
Class TermOrdValComparator.CompetitiveIterator
java.lang.Object
org.apache.lucene.search.DocIdSetIterator
org.apache.lucene.search.comparators.TermOrdValComparator.CompetitiveIterator
- Enclosing class:
TermOrdValComparator
-
Field Summary
FieldsModifier and TypeFieldDescriptionprivate final LeafReaderContextprivate final booleanprivate intprivate DocIdSetIteratorprivate final TermsEnumprivate final Stringprivate static final intprivate final intFields inherited from class org.apache.lucene.search.DocIdSetIterator
NO_MORE_DOCS -
Constructor Summary
ConstructorsConstructorDescriptionCompetitiveIterator(LeafReaderContext context, String field, boolean dense, TermsEnum docValuesTerms) -
Method Summary
Modifier and TypeMethodDescriptionintadvance(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.longcost()Returns the estimated cost of thisDocIdSetIterator.intdocID()Returns the following:-1ifDocIdSetIterator.nextDoc()orDocIdSetIterator.advance(int)were not called yet.private voidinit(int minOrd, int maxOrd) For the first time, this iterator is allowed to skip documents.intnextDoc()Advances to the next document in the set and returns the doc it is currently on, orDocIdSetIterator.NO_MORE_DOCSif 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.private voidupdate(int minOrd, int maxOrd) Update this iterator to only match postings whose term has an ordinal betweenminOrdincluded andmaxOrdincluded.Methods inherited from class org.apache.lucene.search.DocIdSetIterator
all, empty, range, slowAdvance
-
Field Details
-
MAX_TERMS
private static final int MAX_TERMS- See Also:
-
context
-
maxDoc
private final int maxDoc -
field
-
dense
private final boolean dense -
docValuesTerms
-
doc
private int doc -
postings
-
docsWithField
-
disjunction
-
-
Constructor Details
-
CompetitiveIterator
CompetitiveIterator(LeafReaderContext context, String field, boolean dense, TermsEnum docValuesTerms)
-
-
Method Details
-
docID
public int docID()Description copied from class:DocIdSetIteratorReturns the following:-1ifDocIdSetIterator.nextDoc()orDocIdSetIterator.advance(int)were not called yet.DocIdSetIterator.NO_MORE_DOCSif the iterator has exhausted.- Otherwise it should return the doc ID it is currently on.
- Specified by:
docIDin classDocIdSetIterator
-
nextDoc
Description copied from class:DocIdSetIteratorAdvances to the next document in the set and returns the doc it is currently on, orDocIdSetIterator.NO_MORE_DOCSif 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.- Specified by:
nextDocin classDocIdSetIterator- Throws:
IOException
-
advance
Description copied from class:DocIdSetIteratorAdvances to the first beyond the current whose document number is greater than or equal to target, and returns the document number itself. Exhausts the iterator and returnsDocIdSetIterator.NO_MORE_DOCSif 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 > currentit 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_DOCSfor 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.- Specified by:
advancein classDocIdSetIterator- Throws:
IOException
-
cost
public long cost()Description copied from class:DocIdSetIteratorReturns the estimated cost of thisDocIdSetIterator.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.
- Specified by:
costin classDocIdSetIterator
-
update
Update this iterator to only match postings whose term has an ordinal betweenminOrdincluded andmaxOrdincluded.- Throws:
IOException
-
init
For the first time, this iterator is allowed to skip documents. It needs to pullPostingsEnums from the terms dictionary of the inverted index and create a priority queue out of them.- Throws:
IOException
-