源地址:http://graphics.stanford.edu/~seander/bithacks.html#IntegerLogDeBruijn
java 里就是用的这种方法。
#include <iostream>
using namespace std;
typedef unsigned int uint32_t;
uint32_t highestOneBit(uint32_t v){
static const int MultiplyDeBruijnBitPosition[32] =
{
0, 9, 1, 10, 13, 21, 2, 29, 11, 14, 16, 18, 22, 25, 3, 30,
8, 12, 20, 28, 15, 17, 24, 7, 19, 27, 23, 6, 26, 5, 4, 31
};
v |= v >> 1; // first round down to one less than a power of 2
v |= v >> 2;
v |= v >> 4;
v |= v >> 8;
v |= v >> 16;
return MultiplyDeBruijnBitPosition[(uint32_t)(v * 0x07C4ACDDU) >> 27];
}
int main()
{
cout <<"1 :" <<highestOneBit(1) << endl;
cout << "4 :" << h