need "find first one" algorithm recently discussed here

Article View: comp.arch

Article #11437

#11437

From: William C. Anderson
Date: Tue, 24 Nov 1992 05:29

16 lines
855 bytes

comp.arch mavens:

I have unfortunately misplaced the most recent discussion regarding the
fast log(N) algorithm for finding the first bit set in a word from a given
end.

I would most appreciate it if some kind soul could send me email with a
summary of that discussion, including an outline of algorithm.  A pointer
to an ftp site would suffice.

Thanks,

Willie Anderson

wca@emx.utexas.edu
wca%m.ibmoto.com@oakhill.sps.mot.com

Technical Details

Message-ID: <84253@ut-emx.uucp>

Path: arc1-ca.pugleaf.net!sparky!uunet!spool.mu.edu!sdd.hp.com!usc!cs.utexas.edu!ut-emx!wca

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!sparky!uunet!spool.mu.edu!sdd.hp.com!usc!cs.utexas.edu!ut-emx!wca
From: wca@ut-emx.uucp (William C. Anderson)
Newsgroups: comp.arch
Subject: need "find first one" algorithm recently discussed here
Keywords: "find first one" / "find first set bit" algorithm
Message-ID: <84253@ut-emx.uucp>
Date: 24 Nov 92 05:29:54 GMT
Organization: The University of Texas at Austin, Austin, Texas
Lines: 16