Java: Checking if a bit is 0 or 1 in a long

bit-shift, java, long-integer

Solution

I'd use:

if ((value & (1L << x)) != 0)
{
   // The bit was set
}

(You may be able to get away with fewer brackets, but I never remember the precedence of bitwise operations.)

Problem

What method would you use to determine if the the bit that represents 2^x is a 1 or 0 ?

Original source