The closest I can think of is using binary, and having each one of those be bits of a binary number. So false, false, false would be 000 in binary, 0 in decimal. false, false, true would be 001, 1 in decimal. false, true, false would be 010, 2 in decimal. false, true, true would be 011, 3 in decimal. You can then mask each of those off. Even with this, you are going to still need some branching in order to determine which value it ends up being altogether, but if al lthe different combinations result in different actions, then it could make sense to do it this way instead of doing a bunch of AND stuff to check what the values are. In this manner, you would only have 8 different possible results with 3 values being bit-masked together.

Instead of doing real masking, you could do the same thing by simply adding the right amounts to a variable, where the first true adds 4, the second adds 2, and the third adds one, and then you still check the 8 possible values in a switch.