Jump to content

Talk:Bit array

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Krauss (talk | contribs) at 11:38, 23 March 2019 (Merge with Binary code?: new section). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconSoftware: Computing C‑class Mid‑importance
WikiProject iconThis 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.
CThis article has been rated as C-class on Wikipedia's content assessment scale.
MidThis article has been rated as Mid-importance on the project's importance scale.
Taskforce icon
This article is supported by WikiProject Computing (assessed as Low-importance).
WikiProject iconComputing: Software C‑class Low‑importance
WikiProject iconThis article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology 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.
CThis article has been rated as C-class on Wikipedia's content assessment scale.
LowThis article has been rated as Low-importance on the project's importance scale.
Taskforce icon
This article is supported by WikiProject Software (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]

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

Merge with Binary code?

See Binary code.