I am interested, which is the optimal way of calculating the number of bits set in byte by this way
template< unsigned char byte > class BITS_SET { pub
int count(int a){ return a == 0 ? 0 : 1 + count(a&(a-1)); }