inspecting a bitmask

Question

User379720387 posted

bitmask: 0000011000010111

I need to loop through a dataset where each member has a bit location value (say for this example I need to inspect locations 2, 7, 9).

If that bit location is set (in the bitmask) I need to do something.

Is there a spiffy way to do this, without converting the bitmask to a string? 

Answer 1

User475983607 posted
Logical AND the two numbers. Use the shift command to find the high bits.

Answer 2

User379720387 posted

Yes, bitwise AND i.e. "&".

Ended up using enums set at the values of the positions I was interested in:

enum3 = 4

enum7 = 128

enum9 = 512

if ((bitmask & (int)SupplyMask.enum7) == (int)SupplyMask.enum7)
{
   do stuff
}

Spiffy and readable.