>Hi all,
>
>Problem is I need to do do something as a multipple of the bits set on an integer, the integer is a bit array to store statii.
>
>I need to figure out how many bits are set on an integer.
>
>I know I can loop / iterate through the number and bittest / divide by 2 etc.
>
>for now there are not to much so I can do with an ICASE, but I like it generic :)
>
>Any ideas for a fast solution? Something mathematical?
>
>Lutz
http://stackoverflow.com/questions/109023/how-to-count-the-number-of-set-bits-in-a-32-bit-integer
http://en.wikipedia.org/wiki/Hamming_weight
http://gurmeet.net/puzzles/fast-bit-counting-routines/

- you may have to bitor(intermediateResults, 0) to force them back into a 32 bit integer
- Test also negative numbers.