No you don’t need to if you do the math, thats the whole point of bit masks, you dont even need to use enums for this since this is simple bit math technique commonly used in programing. Each bit alone creates power of 2 number so for example in case of 8 bit:
Bin Hex Dec
0b00000001 = 0x01 = 1
0b00000010 = 0x02 = 2
0b00000100 = 0x04 = 4
0b00001000 = 0x08 = 8
0b00010000 = 0x10 = 16
0b00100000 = 0x20 = 32
0b01000000 = 0x40 = 64
0b10000000 = 0x80 = 128
Knowing that you know that if you gonna add those power of 2 number you gonna activate specific bits:
so for example 1+2+16+64 = 83 = 0b01010011
and you can disable bits by subtracting power of 2 numbers, so for example to disable 2nd bit we substract 2:
83 - 2 = 81 = 0b01010001
and with that you can set those bits with just single integer set, and manipulate massive maps of boolean bits with few math nodes.
To read bit you use AND gate (&) bit operator, you can put it against more then one bit and if value is higher then 0 then that means one of those bits you put against the bit mask number is set so for example we want to check if 1st or 4th is set:
0b00001001 & 0b01010011 = 9 & 83 = 0b00000001 = 1 // more then 0 that means either bit 4 and 1 is on
Other then that you might consider using structures, it will let you set multiple bools by breaking the structure pin (right click and there option for that) in set node