public class RoaringDocIdSet extends DocIdSet
DocIdSet implementation inspired from http://roaringbitmap.org/
The space is divided into blocks of 2^16 bits and each block is encoded
independently. In each block, if less than 2^12 bits are set, then
documents are simply stored in a short[]. If more than 2^16-2^12 bits are
set, then the inverse of the set is encoded in a simple short[]. Otherwise
a FixedBitSet is used.| Modifier and Type | Class and Description |
|---|---|
static class |
RoaringDocIdSet.Builder
A builder of
RoaringDocIdSets. |
| Modifier and Type | Method and Description |
|---|---|
int |
cardinality()
Return the exact number of documents that are contained in this set.
|
DocIdSetIterator |
iterator()
Provides a
DocIdSetIterator to access the set. |
long |
ramBytesUsed()
Return the memory usage of this object in bytes.
|
String |
toString() |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitgetChildResourcespublic 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 DocIdSetIOExceptionpublic int cardinality()
Copyright © 2000-2016 Apache Software Foundation. All Rights Reserved.