Use this tag for questions related to array data structures that compactly store bits.
A bit string (also known as a bit array, bit map, bit set, or bit vector) is an array data structure that compactly stores bits. It can be used to implement a simple set data structure. A bit string is effective at exploiting bit-level parallelism in hardware to perform operations quickly.
A typical bit string 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 nonnegative integer. If w does not divide the number of bits to be stored, some space is wasted due to internal fragmentation.