🚀 go-pugleaf

The "find first set bit" operation was recently discussed at length in
comp.arch, and could be relevant, especially if the one bits are sparse.  If
finding the one bits in a set is done frequently enough, and the ones are not
necessarily all that sparse, then you might want to do something like picking
up a byte and doing a 256 way switch statement (or indexing a pre-calculated
array, etc.) to avoid the bit by bit testing and looping. If you can tell
folks more about that your friend is trying to accomplish you get might get
higher quality suggestions :-). You should consider if comp.compress.research
is the right place for the discussion, too ....
--

		J. Eliot B. Moss, Associate Professor
		Department of Computer Science
		Lederle Graduate Research Center
		University of Massachusetts
		Amherst, MA  01003
		(413) 545-4206, 545-1249 (fax); Moss@cs.umass.edu