Finding out if a bit is set using logic operators...

[minime6696]

This might sound like a really newbie question, but truth is I havn't worked with this stuff in a longgg time. My question is how to find out if a bit is set in a word (16 bit or otherwise) using logic operators.

I remember a while back doing something like enumerating the bits by powers of two,

bit1 1
bit2 2
bit3 4
bit4 8

etc. and then using the NAND operator to extract it... I just don't remember how.

Thanks ~SPH

[C-learning]

number & (1UL<<n)

if you want to see if the 6:th bit is set in number ,then n = 6
The result of the operation is 1 if its set and 0 if its not.

[minime6696]

One problem, what is 1UL ?

Hex?

Thanks, ~SPH

[minime6696]

Nevermind I figured it out, 1UL is just 1 heh', thanks .

~SPH

[C-learning]

UL = unsigned long

i think :-)