Talk:Bit array

Find first one

"Find first one" pseudocode... after extensive searching on the net, I cannot find any way to perform this efficiently on an x86 processor (assembler code, pseudocode or c/other code). =( Is the following pseudocode the best way to implement it? 

function findfirstone(number)
begin
 result = 0
 tmp = 1
 while tmp and number = 0 do
 begin
  result++
  tmp = tmp << 1
 end
end

Thanks in advance Themania 03:36, 12 February 2007 (UTC)[reply]

Excellent Page!

Thanks a lot, on behalf of myself and the other contributors. Deco 03:55, 9 February 2006 (UTC)[reply]

Are FreePascal bitpacked arrays of booleans bit arrays? Hixie (talk) 06:30, 6 July 2011 (UTC)[reply]

Merge with bitfield?

Since bitfields are not indexable, but bit arrays are, I'd like to oppose the merge. --Nomen4Omen (talk) 18:30, 8 September 2016 (UTC)[reply]

Closed, given no support. Klbrain (talk) 22:03, 5 February 2018 (UTC)[reply]

Merge with Binary code?

See Binary code.

Content Disclaimer

Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.

  1. The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
  2. There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
  3. It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
  4. Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
  5. Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.