public class DocIdBitSet extends DocIdSet implements Bits
Bits.MatchAllBits, Bits.MatchNoBitsEMPTY_ARRAY| Constructor and Description |
|---|
DocIdBitSet(BitSet bitSet) |
| Modifier and Type | Method and Description |
|---|---|
Bits |
bits()
Optionally provides a
Bits interface for random access
to matching documents. |
boolean |
get(int index)
Returns the value of the bit with the specified
index. |
BitSet |
getBitSet()
Returns the underlying BitSet.
|
boolean |
isCacheable()
This DocIdSet implementation is cacheable.
|
DocIdSetIterator |
iterator()
Provides a
DocIdSetIterator to access the set. |
int |
length()
Returns the number of bits in this set
|
long |
ramBytesUsed()
Return the memory usage of this object in bytes.
|
public DocIdBitSet(BitSet bitSet)
public DocIdSetIterator iterator()
DocIdSetDocIdSetIterator to access the set.
This implementation can return null if there
are no docs that match.public Bits bits()
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.public boolean isCacheable()
isCacheable in class DocIdSetpublic BitSet getBitSet()
public boolean get(int index)
Bitsindex.get in interface Bitsindex - index, should be non-negative and < Bits.length().
The result of passing negative or out of bounds values is undefined
by this interface, just don't do it!true if the bit is set, false otherwise.public int length()
Bitspublic long ramBytesUsed()
AccountableramBytesUsed in interface AccountableramBytesUsed in class DocIdSetCopyright © 2000-2015 Apache Software Foundation. All Rights Reserved.