Talk:Bit array

Software: Computing Start‑class Mid‑importance

	This article is within the scope of WikiProject Software, a collaborative effort to improve the coverage of software on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.SoftwareWikipedia:WikiProject SoftwareTemplate:WikiProject Softwaresoftware
Start	This article has been rated as Start-class on Wikipedia's content assessment scale.
Mid	This article has been rated as Mid-importance on the project's importance scale.
	This article is supported by WikiProject Computing (assessed as Mid-importance).

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]