inspecting a bitmask [Answered]RSS

• • Reply
  wavemaster

  Contributor

  2379 Points

  2366 Posts

  inspecting a bitmask

  May 08, 2019 09:25 PM|wavemaster|LINK

  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? 

  Will "mark as answered" if your answers help me. Will you do the same?
• • Reply
  mgebhard

  All-Star

  39421 Points

  16271 Posts

  Re: inspecting a bitmask

  May 08, 2019 10:15 PM|mgebhard|LINK

  Logical AND the two numbers. Use the shift command to find the high bits.
• • Reply
  wavemaster

  Contributor

  2379 Points

  2366 Posts

  Re: inspecting a bitmask

  May 09, 2019 03:37 PM|wavemaster|LINK

  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.

  Will "mark as answered" if your answers help me. Will you do the same?