What are your favorite bit hacks?

Besides the obvious set/get/clear bit mask (e.g. byte |= (1 << bit_we_want_to_set)).

Mine would be determining if an integer is a power of 2. Instead of using some
unnecessary complex loop, we simply do:
x && ((x & (x - 1)) == 0);

Simple, but clever. If you are nub (most likely are), read up more on bit manipulation/twiddling/hack, etc.

Who you calling a nub?

>>2
You. Nub.

>>3
I'll have you know I graduated top of my class in the bit twiddlers and I have performed over one hundred bit twiddles, and that is just with my pen and paper.

>>4
How do you do that with pen and paper? I have to use gamma particles.

>>4
Only one hundred? Lol.

log_2(x)%1==0

I only use those for bitfields

I like to use
(a ^ b ^ a) << (c^c)
if I need the identity operation in a quick and dirty way. Sure, there might be better ways to implement identity, but this works for me.