Class DisjunctionDISIApproximation
DocIdSetIterator
which is a disjunction of the approximations of the provided
iterators.- NOTE: This API is for internal purposes only and might change in incompatible ways in the next release.
-
Field Summary
Fields inherited from class org.apache.lucene.search.DocIdSetIterator
NO_MORE_DOCS
-
Constructor Summary
ConstructorsConstructorDescriptionDisjunctionDISIApproximation
(Collection<? extends DisiWrapper> subIterators, long leadCost) -
Method Summary
Modifier and TypeMethodDescriptionint
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 thisDocIdSetIterator
.int
docID()
Returns the following:-1
ifDocIdSetIterator.nextDoc()
orDocIdSetIterator.advance(int)
were not called yet.int
Returns the end of the run of consecutive doc IDs that match thisDocIdSetIterator
and that contains the currentDocIdSetIterator.docID()
, that is: one plus the last doc ID of the run.void
intoBitSet
(int upTo, FixedBitSet bitSet, int offset) Load doc IDs into aFixedBitSet
.int
nextDoc()
Advances to the next document in the set and returns the doc it is currently on, orDocIdSetIterator.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.static DisjunctionDISIApproximation
of
(Collection<? extends DisiWrapper> subIterators, long leadCost) topList()
Return the linked list of iterators positioned on the current doc.Methods inherited from class org.apache.lucene.search.DocIdSetIterator
all, empty, range, slowAdvance
-
Constructor Details
-
DisjunctionDISIApproximation
-
-
Method Details
-
of
public static DisjunctionDISIApproximation of(Collection<? extends DisiWrapper> subIterators, long leadCost) -
cost
public long cost()Description copied from class:DocIdSetIterator
Returns 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:
cost
in classDocIdSetIterator
-
docID
public int docID()Description copied from class:DocIdSetIterator
Returns the following:-1
ifDocIdSetIterator.nextDoc()
orDocIdSetIterator.advance(int)
were not called yet.DocIdSetIterator.NO_MORE_DOCS
if the iterator has exhausted.- Otherwise it should return the doc ID it is currently on.
- Specified by:
docID
in classDocIdSetIterator
-
nextDoc
Description copied from class:DocIdSetIterator
Advances to the next document in the set and returns the doc it is currently on, orDocIdSetIterator.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.- Specified by:
nextDoc
in classDocIdSetIterator
- Throws:
IOException
-
advance
Description copied from class:DocIdSetIterator
Advances 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_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.- Specified by:
advance
in classDocIdSetIterator
- Throws:
IOException
-
intoBitSet
Description copied from class:DocIdSetIterator
Load doc IDs into aFixedBitSet
. This should behave exactly as if implemented as below, which is the default implementation:for (int doc = docID(); doc < upTo; doc = nextDoc()) { bitSet.set(doc - offset); }
Note:
offset
must be less than or equal to thecurrent doc ID
. Behaviour is undefined if this iterator is unpositioned.Note: It is important not to clear bits from
bitSet
that may be already set.Note:
offset
may be negative.- Overrides:
intoBitSet
in classDocIdSetIterator
- Throws:
IOException
-
topList
Return the linked list of iterators positioned on the current doc. -
docIDRunEnd
Description copied from class:DocIdSetIterator
Returns the end of the run of consecutive doc IDs that match thisDocIdSetIterator
and that contains the currentDocIdSetIterator.docID()
, that is: one plus the last doc ID of the run.- The returned doc is greater than
DocIdSetIterator.docID()
. - All docs in range
[docID(), docIDRunEnd())
match this iterator. - The current position of this iterator is not affected by calling
DocIdSetIterator.docIDRunEnd()
.
Note: It is illegal to call this method when the iterator is exhausted or not positioned.
The default implementation assumes runs of a single doc ID and returns
DocIdSetIterator.docID()
) + 1.- Overrides:
docIDRunEnd
in classDocIdSetIterator
- Throws:
IOException
- The returned doc is greater than
-