Binary input

I just stumbled across this post which I think answers your question.

Thank you, that confirms my thoughts.

Just for case, that anybody will need this feature in future:
The flag bit can be easily set by:
where i is status word and a is bit, which has to be set
Note that 0 is first bit, 1 is second bit etc.

Bit can be cleared by:
for b bit long status word.
Note that b can be higher than length of word, but if it is lower, then all higher bits will be cleared.

Bit can be read by:
This will return 2^a if bit is set. If this is not acceptable add following if
so the code will look

It is a bit more elegant to use:

Thank you for your input Erel.
I have another question. I know that power takes a lot of CPU cycles to calculate. As I want to use this set/clear instructions in cycle that repeats more than 100.000x I am looking for something really fast. What do you think, what is faster? Bit.ShiftLeft or once create an array of integers (element(a)=Power(2, a)) and then instead of Power(2, a) use element(a) in cycles?

Bit.ShiftLeft is extremely fast. You will not need to further optimize it.