BitSet
- class java.util..BitSet public class BitSet extends Object implements Cloneable , Serializable Tree:java.lang.Object - java.util.BitSet This class implements a vector of bits that grows as needed. Each component of the bit set has a boolean value. The bits of a BitSet are indexed by nonnegative integers. Individual indexed bits can be examined, set, or cleared. One BitSet may be used to modify the contents of another BitSet through logical AND, logical inclusive OR, and logical exclusive OR operations. BitSet() - Constructor for class java.util.BitSet public BitSet () Creates a new bit set. All bits are initially false. BitSet(int) - Constructor for class java.util.BitSet public BitSet (int nbits) Creates a bit set whose initial size is large enough to explicitly represent bits with indices in the range 0 through nbits-1. All bits are initially false.Parameters: nbits - the initial size of the bit set.Throws: NegativeArraySizeException - if the specified initial size is negative. | ||||
Search Dictionary:
BitSet definition was found in categories: Encyclopedia(1)
BitSet Definition from Encyclopedia Dictionaries & Glossaries
| Wikipedia English - The Free Encyclopedia |
Bit array
A bit array (or bitmap, in some cases) is an array data structure which compactly stores individual bits (boolean values). It implements a simple set data structure storing a subset of {1,2,...,n} and is effective at exploiting bit-level parallelism in hardware to perform operations quickly. A typical bit array stores kw bits, where w is the number of bits in the unit of storage, such as a byte or word, and k is some integer. If the number of bits to be stored does not divide w, some space is wasted due to internal fragmentation.
| See more at Wikipedia.org... |