计算  2Λ(n-1) < v <2Λ(n-1)
uint32_t RoundUpPow2(uint32_t v)
 {
    v--;
    v |= v >> 1;    v |= v >> 2;
    v |= v >> 4;    v |= v >> 8;
    v |= v >> 16;
    return v+1;
}

判断是否是2的n次幂

bool IsPowerOf2(int v)
 {
    return (v & (v - 1)) == 0;
}
posted on 2012-04-17 10:27  littlepearl  阅读(159)  评论(0编辑  收藏  举报