Bit array (original) (raw)
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.
| Property | Value |
|---|---|
| dbo:abstract | In der Informatik ist eine Bitkette (auch Bitstring oder je nach Dimension Bitvektor bzw. Bitarray) eine (endliche) Folge von Zeichen aus dem kleinsten interessanten Alphabet Σ; dieses besteht aus zwei Zeichen, den Bits: Σ := {0,1}. Während das Bitfeld vollständig in den Datentyp einer Binärzahl eingebettet ist und das einzelne Bit nur über sein programmiersprachliches Symbol anzusprechen ist, kommt beim Bitarray ein ganzzahliger Bit-Index (oder auch mehrere) hinzu. Bitkette und (1-dimensionaler) Bitvektor sind beim Zugriff auf ein einzelnes Bit konzeptionell ähnlich. Obwohl die Sequenz von Binärziffern eines Bitvektors zur Bildung einer Binärzahl (beliebiger Größe) verwendet werden kann, hat ein Bitvektor zunächst nicht unmittelbar etwas mit einer Binärzahl zu tun – diese muss durch eine extra dafür vorgesehene Funktion gebildet werden. Eine klassische Anwendung eines Bitvektors ist das Sieb des Eratosthenes zur Bestimmung von Primzahlen. (de) 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. (en) Bitĉeno estas kompakte pakita vico da bitoj. La laŭbitaj operacioj de C traktas entjerojn kiel bitĉenojn. En Paskalo la bitĉenoj estas uzataj kiel maniero prezenti arojn kaj la samajn laŭbitajn buleajn operaciojn (kunaĵo, komunaĵo, simetria diferenco). (eo) Un tableau de bits (en anglais bitmap) est une structure de données, en particulier un tableau de données binaires. Il s'agit d'une collection ordonnée de bits assimilables à des booléens. (fr) Um bit array, ou arranjo de bit (também conhecido como bitmap, bitset, bit string ou bit vector) é um arranjo que armazena bits compactadamente, podendo ser usado para implementar um simples conjunto. O bit array é efetivo ao explorar paralelismo à "nível bit" em um hardware para executar operações rapidamente. Um típico arranjo armazena kw bits, onde w é o número de bits n unidade de armazenamento, como um byte ou palavra e k é algum inteiro não negativo. Se w não divide o número de bits a ser armazenados algum espaço é desperdiçado devido a fragmentação. (pt) Би́товая ка́рта (англ. bitmap, bitset, bit array) — набор последовательно записанных двоичных разрядов, то есть последовательность (массив) битов. (ru) 位数组（英語：bit array），是一种能够紧凑地存储位的数组。位数组可以被用来实现简单的集合。它能够通过硬件中位级别的并行运算快速操作。通常情况下，一个位数组可以存储位信息（w是硬件中单个存储单元的位数，如字节或字，而k是一非负整数），如果w不能被计算机中存储单位的字节数整除，就会由于浪费一些内存空间。 (zh) Бітова карта (англ. bitmap, bitset, bit array) — набір послідовно записаних двійкових розрядів, тобто послідовність (масив) бітів. (uk) |
| dbo:wikiPageExternalLink | http://c-faq.com/misc/bitsets.html https://developer.apple.com/library/mac/%23documentation/CoreFoundation/Reference/CFBitVectorRef/Reference/reference.html https://developer.apple.com/library/mac/%23documentation/CoreFoundation/Reference/CFMutableBitVectorRef/Reference/reference.html%23/apple_ref/doc/uid/20001500 http://www-cs-faculty.stanford.edu/~knuth/fasc1a.ps.gz http://www.gotw.ca/publications/N1185.pdf http://www.gotw.ca/publications/N1211.pdf |
| dbo:wikiPageID | 1189937 (xsd:integer) |
| dbo:wikiPageLength | 20820 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1122710440 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Ruby_(programming_language) dbr:Enumerated_type dbr:Binary_code dbr:Binary_numeral_system dbr:Bitwise_negation dbr:Bitwise_operation dbr:Bloom_filter dbr:Perl dbr:VHDL dbr:Verilog dbr:Information_retrieval dbr:Inode dbr:.NET_Framework dbr:Common_Lisp dbr:Complement_(set_theory) dbr:Endianness dbr:GF(2) dbr:Golomb_coding dbr:Core_Foundation dbr:Arithmetic_logic_unit dbc:Arrays dbr:Linux_kernel dbr:Standard_ML dbr:Standard_Template_Library dbr:Color_depth dbr:Hamming_weight dbr:Priority_queue dbr:Partial_template_specialization dbr:String_(computer_science) dbr:Succinct_data_structure dbr:Byte dbr:C++ dbr:C_(programming_language) dbr:Trie dbr:Data_compression dbr:D_programming_language dbr:Locality_of_reference dbr:APL_(programming_language) dbr:E_(verification_language) dbr:Find_first_set dbr:Finite_field dbr:Flip-flop_(electronics) dbr:Fragmentation_(computing) dbr:PL/I dbr:PL/pgSQL dbr:Judy_array dbr:Proxy_pattern dbr:Raster_graphics dbr:Run-length_encoding dbr:Hash_table dbr:Haskell_(programming_language) dbr:Intersection_(set_theory) dbr:Java_(programming_language) dbr:Array_data_structure dbr:Bit dbr:Bit-level_parallelism dbr:Bit_field dbr:Bitboard dbr:Bitmap_index dbr:Bitstream dbc:Bit_data_structures dbr:SystemVerilog dbr:Array_programming dbr:Huffman_coding dbr:Data_cache dbr:Word_(computer_architecture) dbr:X11 dbr:Mask_(computing) dbr:OpenVera dbr:Unary_coding dbr:Union_(set_theory) dbr:Lexicographical_order dbr:Signed_number_representations dbr:Boost_C++_Libraries dbr:Page_(computing) dbr:Set_data_structure dbr:Posting_list |
| dbp:wikiPageUsesTemplate | dbt:Math dbt:More_citations_needed dbt:Reflist dbt:Short_description dbt:Data_structures |
| dcterms:subject | dbc:Arrays dbc:Bit_data_structures |
| gold:hypernym | dbr:Structure |
| rdf:type | yago:WikicatArrays yago:WikicatBitDataStructures yago:Abstraction100002137 yago:Arrangement105726596 yago:Arrangement107938773 yago:Array107939382 yago:Cognition100023271 yago:DataStructure105728493 yago:Group100031264 yago:PsychologicalFeature100023100 dbo:Building yago:Structure105726345 yago:WikicatDataStructures |
| rdfs:comment | 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. (en) Bitĉeno estas kompakte pakita vico da bitoj. La laŭbitaj operacioj de C traktas entjerojn kiel bitĉenojn. En Paskalo la bitĉenoj estas uzataj kiel maniero prezenti arojn kaj la samajn laŭbitajn buleajn operaciojn (kunaĵo, komunaĵo, simetria diferenco). (eo) Un tableau de bits (en anglais bitmap) est une structure de données, en particulier un tableau de données binaires. Il s'agit d'une collection ordonnée de bits assimilables à des booléens. (fr) Um bit array, ou arranjo de bit (também conhecido como bitmap, bitset, bit string ou bit vector) é um arranjo que armazena bits compactadamente, podendo ser usado para implementar um simples conjunto. O bit array é efetivo ao explorar paralelismo à "nível bit" em um hardware para executar operações rapidamente. Um típico arranjo armazena kw bits, onde w é o número de bits n unidade de armazenamento, como um byte ou palavra e k é algum inteiro não negativo. Se w não divide o número de bits a ser armazenados algum espaço é desperdiçado devido a fragmentação. (pt) Би́товая ка́рта (англ. bitmap, bitset, bit array) — набор последовательно записанных двоичных разрядов, то есть последовательность (массив) битов. (ru) 位数组（英語：bit array），是一种能够紧凑地存储位的数组。位数组可以被用来实现简单的集合。它能够通过硬件中位级别的并行运算快速操作。通常情况下，一个位数组可以存储位信息（w是硬件中单个存储单元的位数，如字节或字，而k是一非负整数），如果w不能被计算机中存储单位的字节数整除，就会由于浪费一些内存空间。 (zh) Бітова карта (англ. bitmap, bitset, bit array) — набір послідовно записаних двійкових розрядів, тобто послідовність (масив) бітів. (uk) In der Informatik ist eine Bitkette (auch Bitstring oder je nach Dimension Bitvektor bzw. Bitarray) eine (endliche) Folge von Zeichen aus dem kleinsten interessanten Alphabet Σ; dieses besteht aus zwei Zeichen, den Bits: Σ := {0,1}. Während das Bitfeld vollständig in den Datentyp einer Binärzahl eingebettet ist und das einzelne Bit nur über sein programmiersprachliches Symbol anzusprechen ist, kommt beim Bitarray ein ganzzahliger Bit-Index (oder auch mehrere) hinzu. Bitkette und (1-dimensionaler) Bitvektor sind beim Zugriff auf ein einzelnes Bit konzeptionell ähnlich. (de) |
| rdfs:label | Bitkette (de) Bitĉeno (eo) Bit array (en) Tableau de bits (fr) Bit array (pt) Битовая карта (ru) Бітова мапа (uk) 位数组 (zh) |
| owl:sameAs | freebase:Bit array wikidata:Bit array dbpedia-de:Bit array dbpedia-eo:Bit array dbpedia-fa:Bit array dbpedia-fr:Bit array dbpedia-pt:Bit array dbpedia-ru:Bit array dbpedia-sh:Bit array dbpedia-sr:Bit array http://tl.dbpedia.org/resource/Bit_array dbpedia-uk:Bit array dbpedia-zh:Bit array https://global.dbpedia.org/id/uc1Z yago-res:Bit array |
| prov:wasDerivedFrom | wikipedia-en:Bit_array?oldid=1122710440&ns=0 |
| foaf:isPrimaryTopicOf | wikipedia-en:Bit_array |
| is dbo:wikiPageRedirects of | dbr:Bitstring dbr:Boolean_array dbr:Boolean_vector dbr:Bitset dbr:Bitvector dbr:Bit_string dbr:Bit_vector dbr:Bit_vectors |
| is dbo:wikiPageWikiLink of | dbr:Processor_register dbr:Enumerated_type dbr:List_of_data_structures dbr:Binary_search_algorithm dbr:Bit_manipulation dbr:Bitwise_operation dbr:Bloom_filter dbr:ReiserFS dbr:Van_Emde_Boas_tree dbr:Indian_buffet_process dbr:Cryptographic_hash_function dbr:Shift_register dbr:Genetic_algorithm dbr:Bitmap_(disambiguation) dbr:Bitstring dbr:Crossover_(genetic_algorithm) dbr:Array dbr:Array_(data_structure) dbr:Hamming_weight dbr:String_(computer_science) dbr:Bzip2 dbr:Data-flow_analysis dbr:Database_index dbr:Logical_matrix dbr:3SUM dbr:ExFAT dbr:Find_first_set dbr:Binary_vector dbr:Directory-based_coherence dbr:Logical_connective dbr:Proteus_(programming_language) dbr:HFS_Plus dbr:Hash_table dbr:TI-68 dbr:Binary_Independence_Model dbr:Binary_data dbr:Bit dbr:Bit_field dbr:Bitboard dbr:Bitmap dbr:Bitmap_index dbr:Bitwise_trie_with_bitmap dbr:Black_box_group dbr:Hidden_linear_function_problem dbr:Jaccard_index dbr:Java_virtual_machine dbr:C-- dbr:Polyhedral_combinatorics dbr:Solomonoff's_theory_of_inductive_inference dbr:Free-space_bitmap dbr:IBM_SAN_Volume_Controller dbr:Klein_four-group dbr:Set_(abstract_data_type) dbr:Shuffle-exchange_network dbr:Ugly_duckling_theorem dbr:Text_mode dbr:Task_state_segment dbr:Semantic_folding dbr:Parallel_breadth-first_search dbr:Boolean_array dbr:Boolean_vector dbr:Bitset dbr:Bitvector dbr:Bit_string dbr:Bit_vector dbr:Bit_vectors |
| is dbp:fileStruct of | dbr:ReiserFS dbr:ExFAT dbr:HFS_Plus |
| is foaf:primaryTopic of | wikipedia-en:Bit_array |