Talk:Bit array
Appearance
This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||||||||||||
|
Find first one
[edit]"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)
Excellent Page!
- Thanks a lot, on behalf of myself and the other contributors. Deco 03:55, 9 February 2006 (UTC)
Are FreePascal bitpacked arrays of booleans bit arrays? Hixie (talk) 06:30, 6 July 2011 (UTC)
Merge with bitfield?
[edit]Since bitfields are not indexable, but bit arrays are, I'd like to oppose the merge. --Nomen4Omen (talk) 18:30, 8 September 2016 (UTC)
- Closed, given no support. Klbrain (talk) 22:03, 5 February 2018 (UTC)
Merge with Binary code?
[edit]See Binary code.