List of usage examples for org.apache.lucene.util BitSet subclass-usage
From source file de.unihildesheim.iw.lucene.EmptyBitSet.java
/** * Simple {@link BitSet} implementation that is empty and does nothing. * * @author Jens Bertram (code@jens-bertram.net) */ public class EmptyBitSet extends BitSet {
From source file monad.face.internal.MonadSparseFixedBitSet.java
/**
* A bit set that only stores longs that have at least one bit which is set.
* The way it works is that the space of bits is divided into blocks of
* 4096 bits, which is 64 longs. Then for each block, we have:<ul>
* <li>a long[] which stores the non-zero longs for that block</li>
* <li>a long so that bit <tt>i</tt> being set means that the <code>i-th</code>
From source file org.elasticsearch.index.translog.CountedBitSet.java
/** * A {@link CountedBitSet} wraps a {@link FixedBitSet} but automatically releases the internal bitset * when all bits are set to reduce memory usage. This structure can work well for sequence numbers * from translog as these numbers are likely to form contiguous ranges (eg. filling all bits). */ final class CountedBitSet extends BitSet {
From source file roar.api.services.RoarSparseFixedBitSet.java
/**
* A bit set that only stores longs that have at least one bit which is set.
* The way it works is that the space of bits is divided into blocks of
* 4096 bits, which is 64 longs. Then for each block, we have:<ul>
* <li>a long[] which stores the non-zero longs for that block</li>
* <li>a long so that bit <tt>i</tt> being set means that the <code>i-th</code>