Bitmasking — பல bool ஒரு int-ல்

Integer — subset encode; bit i on — item i.

Try this in Python

def has(mask: int, i: int) -> bool:
    return (mask >> i) & 1 == 1


def set_bit(mask: int, i: int) -> int:
    return mask | (1 << i)


m = 0b101
print(has(m, 0), has(m, 1), bin(set_bit(m, 3)))

Key takeaways

• Test — shift & 1.
• Union — OR.
• Intersection — AND.