A bit array (also known as a bitmap, a bitset, or a bitstring) is an array data structure that compactly stores individual bits. 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 nonnegative integer.

PropertyValue
dbpedia-owl:abstract
  • A bit array (also known as a bitmap, a bitset, or a bitstring) is an array data structure that compactly stores individual bits. 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 nonnegative integer. If w does not divide the number of bits to be stored, some space is wasted due to internal fragmentation.
  • Б́итовая ка́рта (англ. bitmap, bitset, bit array) — набор последовательно записанных двоичных разрядов, то есть последовательность битов.
dbpedia-owl:wikiPageExternalLink
dcterms:subject
rdf:type
rdfs:comment
  • Б́итовая ка́рта (англ. bitmap, bitset, bit array) — набор последовательно записанных двоичных разрядов, то есть последовательность битов.
  • A bit array (also known as a bitmap, a bitset, or a bitstring) is an array data structure that compactly stores individual bits. 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 nonnegative integer.
rdfs:label
  • Bit array
  • Битовая карта
owl:sameAs
foaf:page
is dbpedia-owl:wikiPageRedirects of
is dbpprop:fileStruct of
is owl:sameAs of
is foaf:primaryTopic of