Was (wer) ist bit map - definition
ARRAY DATA STRUCTURE THAT COMPACTLY STORES BITS
Bit vector; Bitvector; Boolean array; Boolean vector; Bitstring; Bitset; Bit vectors; Bit string
Bit array
A bit array (also known as bit map, bit set, bit string, or bit vector) is an array data structure that compactly stores bits. It can be used to implement a simple set data structure.
bit string
<programming, data> An ordered sequence of bits. This is
very similar to a bit pattern except that the term "string"
suggests an arbitrary length sequence as opposed to a
pre-determined length "pattern".
Bit (horse)
TYPE OF HORSE TACK
Horse bit; Horse bits; Champing at the bit; Chomping at the bit; Horse's bit; Horsebit
The bit is an item of a horse's tack. It usually refers to the assembly of components that contacts and controls the horse's mouth, and includes the shanks, rings, cheekpads and mullen, all described here below, but it also sometimes simply refers to the mullen, the piece that fits inside the horse's mouth.
Wikipedia
Bit array
A bit array (also known as bitmask, bit map, bit set, bit string, 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 array 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 nonnegative integer. If w does not divide the number of bits to be stored, some space is wasted due to internal fragmentation.
Aussprachebeispiele für bit map
1. which is the bit map.
ted-talks_32_VikMuniz_2003-320k
