Hint for lookup table set bit count algorithm
问题 I am looking at solution for the set bit count problem (given a binary number, how to efficiently count how many bits are set). Here, http://graphics.stanford.edu/~seander/bithacks.html#CountBitsSetNaive, I have found some methods. What about the lookup table method? I dont understand what properties of binary representation / number make it work. static const unsigned char BitsSetTable256[256] = { # define B2(n) n, n+1, n+1, n+2 # define B4(n) B2(n), B2(n+1), B2(n+1), B2(n+2) # define B6(n)