BitSet
Base implementation for a bit set.
Inheritors
Properties
Functions
Apply this Bits instance to the given FixedBitSet, which starts at the given offset.
Return an approximation of the cardinality of this set. Some implementations may trade accuracy for speed if they have the ability to estimate the cardinality of the set without iterating over all the data. The default implementation returns .cardinality.
Return the number of bits that are set. NOTE: this method is likely to run in linear time
Does in-place OR of the bits provided by the iterator. The state of the iterator after this operation terminates is undefined.
Returns the index of the last set bit before or on the index specified. -1 is returned if there are no more set bits.
Return the memory usage of this object in bytes. Negative values are illegal.