A bitwise XOR is a binary operation that takes two bit patterns of equal length and performs the logical exclusive OR operation on each pair of corresponding bits. The result in each position is 1 if only one of the bits is 1, but will be 0 if both are 0 or both are 1.

How does Bitwise XOR work?

The Bitwise Xor operation treats the sign bit as it would any other bit. If one or both inputs for a pixel location are negative, the output is negative; if both inputs are positive, the output is positive.

What is a Bitwise XOR assignment?

The bitwise XOR assignment operator ( ^= ) uses the binary representation of both operands, does a bitwise XOR operation on them and assigns the result to the variable.