Integer#popcount (Fixnum#popcount and Bignum#popcount)
How about adding Integer#popcount method?
(actually Fixnum#popcount and Bignum#popcount)
0.popcount #=> 0
1.popcount #=> 1
255.popcount #=> 8
256.popcount #=> 1
(10*100).popcount #=> 105
(257*257).popcount #=> 999
It counts the number of one bits in the integer.
If the integer is negative, the one bits in the absolute number is counted.
popcount has various applications.
Hamming distance, rank/select for succinct data structure,
brightness of monochrome image, etc.
In general, popcount is useful when an array is encoded as an integer.
Several lower layers provides this feature.
gcc and clang has __builtin_popcount.
Intel and AMD provides popcnt instruction.
Several languages and libraries provides this feature:
absolute number: Mathmatica(DigitCount)
two's complement: Java(java.math.BigInteger#bitCount), Scala(bitCount), CommonLisp(logcount), CLN(logcount)
other behavior: GMP(mpz_popcount), Haskell(popCount), Scheme(bitwise-bit-count)
fixed size: gcc (__builtin_popcount), Intel/AMD(popcnt), Java(java.lang.Integer.bitCount)
For negative numbers, my implementation counts bits in abs(n).
I think this is easy to understand, at least.
However many software counts bits in two's complement representation.
There are several names.
I think popcount is popular but bitcount is also a possible name.
I don't like logcount.
Details of the other software:
Mathmatica has DigitCount which can be used as popcount.
n.popcount can be implemented as DigitCount[n, 2, 1].
It seems work for abs(n). (I tested with Wolfram Alpha.)
Java has bitCount method in java.lang.Integer and java.math.BigInteger.
java.lang.Integer counts one-bits in two's complement representation
(so it is not applicable for infinite precision integer).
java.math.BigInteger counts bits which is different to sign bit in
two's complement representation.
Scala has bitCount method too.
It works as Java.
CommonLisp has logcount function.
CLN has logcount function.
GMP has mpz_popcount.
It returns a some constant for negative values.
Haskell has popCount.
It seems hang for negative values.
Scheme has bitwise-bit-count.
It returns negative result for negative values.
#3 Updated by Alexey Muranov over 1 year ago
boris_stitnicky (Boris Stitnicky) wrote:
The issue here seems to be, whether BitArray (like https://github.com/peterc/bitarray ) is desirable in stdlib or core.
+1 for something like BitArray in core (edit: or in stdlib).
-1 for using integers as bit arrays. (IMHO)