3 ms·
And 3 == 2^(log_2(3)). Clearly we want to know if x is an integer power of 2.
by Jabbles 15y ago
And 3 == 2^(log_2(3)).
Clearly we want to know if x is an integer power of 2.
- wnoise 15y ago2^(bitsize) == 0. Edit: Yes, 1 << bitsize is undefined. But unsigned integers actually do have well-defined semantics on overflow, and multiplying by 2 enough times really does produce zero.