On 6/16/07, Ron Johnson <ron(dot)l(dot)johnson(at)cox(dot)net> wrote:
> > Hardware acceleration for quickly counting the number of
> > set/unset/matching bits?
>
> x86 doesn't already do that?
I don't think so. The fastest way, I believe, is to use precomputed
lookup tables. Same for finding the least/most significant set/unset
bit, and other operations useful for dealing with bit vectors.
Alexander.