RoaringDocIdSet
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.
Types
Properties
Functions
Link copied to clipboard
Return the exact number of documents that are contained in this set.
Link copied to clipboard
Provides a DocIdSetIterator to access the set. This implementation can return null if there are no docs that match.
Link copied to clipboard
Return the memory usage of this object in bytes. Negative values are illegal.