 Bitwise OR

Bitwise OR combines binary representations position by position: an output bit is one exactly when at least one input bit is one. On bit masks representing sets, it computes their union.