快速log2整数计算

// log2的快速整数算法
// 通过掩码计算出powerOfTwo的最高位数，
// 即log2(powerOfTwo)的值。
template <typename T>
T Mathematics::BitHacks
   ::Log2OfPowerOfTwo( T powerOfTwo )
{
     BOOST_STATIC_ASSERT((boost::is_integral<T>::value));
     ASSERTION(0 < powerOfTwo,"powerOfTwo必须大于0");


     const int maskSize = 5;    
     // 1111 1111 1111 1111 1111 1111 1111 1111 
     // 1111 1111 0000 0000 1111 1111 0000 0000 
     // 1111 0000 1111 0000 1111 0000 1111 0000
     // 1100 1100 1100 1100 1100 1100 1100 1100 
     // 1010 1010 1010 1010 1010 1010 1010 1010
     unsigned mask[maskSize] = { 0xFFFF0000,0xFF00FF00,0xF0F0F0F0, 0xCCCCCCCC,0xAAAAAAAA}; 
     unsigned int log2 = 0; 
     T powerOfTwoCopy = powerOfTwo; 
     for(int i = 0;i < maskSize;++i)
     {
            bool bitExist = (powerOfTwoCopy & mask[i]) != 0;
           if(bitExist) 
          {
              log2 |= (1 << (maskSize - i - 1)); 
              powerOfTwoCopy &= mask[i];
          }
      } 
      return static_cast<T>(log2);
}