public final class NotDocIdSet extends DocIdSet
DocIdSet encodes the negation of another DocIdSet.
It is cacheable and supports random-access if the underlying set is
cacheable and supports random-access.NULL_ACCOUNTABLE| Constructor and Description |
|---|
NotDocIdSet(int maxDoc,
DocIdSet in)
Sole constructor.
|
| Modifier and Type | Method and Description |
|---|---|
Bits |
bits()
Optionally provides a
Bits interface for random access
to matching documents. |
DocIdSetIterator |
iterator()
Provides a
DocIdSetIterator to access the set. |
long |
ramBytesUsed()
Return the memory usage of this object in bytes.
|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitgetChildResourcespublic NotDocIdSet(int maxDoc,
DocIdSet in)
public Bits bits() throws IOException
DocIdSetBits interface for random access
to matching documents.bits in class DocIdSetnull, if this DocIdSet does not support random access.
In contrast to DocIdSet.iterator(), a return value of null
does not imply that no documents match the filter!
The default implementation does not provide random access, so you
only need to implement this method if your DocIdSet can
guarantee random access to every docid in O(1) time without
external disk access (as Bits interface cannot throw
IOException). This is generally true for bit sets
like FixedBitSet, which return
itself if they are used as DocIdSet.IOExceptionpublic long ramBytesUsed()
Accountablepublic DocIdSetIterator iterator() throws IOException
DocIdSetDocIdSetIterator to access the set.
This implementation can return null if there
are no docs that match.iterator in class DocIdSetIOExceptionCopyright © 2000-2021 Apache Software Foundation. All Rights Reserved.