xor bitwise operation

Basic knowledge: 1. And (&) Operations (bitwise AND)The and operation is usually used for bitwise operations. For example, the result of a number and 1 is the last bit of the binary. This can be used to judge the parity of an integer. the last bit

Bitwise -AND Operator (&) Participate in the operation of the two data, press bits for "and" operation. Arithmetic Rules:0&0=0;   0&1=0;    1&0=0; 1&1=1; That is, the two-bit is "1" at the same time, the result is "1", otherwise 0 For example: 3&5

The two values that participate in the operation, if the two corresponding bit bits are the same, the result is 0, otherwise 1.That0^0 = 0,1^0 = 1,0^1 = 1,1^1 = 03 Features of bitwise XOR:(1) 0^0=0,0^1=1 0 xor or any number = any number(2) 1^0=1,1^1=

Http://www.cnblogs.com/this-543273659/archive/2011/08/30/2159819.htmlThe two values that participate in the operation, if the two corresponding bit bits are the same, the result is 0, otherwise 1.That0^0 = 0,1^0 = 1,0^1 = 1,1^1 = 03 Features of

Bitwise AND Operator (&) To participate in the operation of the two data, press bits for the "and" operation. Operation Rules:0&0=0;   0&1=0;    1&0=0; 1&1=1; That is: two digits at the same time "1", the result is "1", otherwise 0 For example: 3&5

and Operation:&Both are 1 to 1, otherwise 0 1&1=1, 1&0=0, 0&1=0, 0&0=0 Or operation: |Both are 0 to 0, otherwise 11|1 = 1, 1|0 = 1, 0|1 = 1, 0|0 = 0 Non-operation: ~1 Take 0, 0 take 1~ = 0, ~0 = 1~ (10001) = 01110 XOR or operationEqual to 0,

Front. Bitwise operators are very low-level operations and are not commonly used because they are not intuitive. However, its speed is very fast, and reasonable use can achieve very good results. This article will introduce the operator-bitwise

Language bitwise operators: With, OR, XOR, reverse, move left, and rightA bitwise operation is a binary-based operation. In system software, it is often necessary to deal with bits problems. The C language provides 6 bit manipulation operators.

first know the characteristics of these two binary data: 1=0000 0000 0000 0000 0000 0000 0000 0001-1=1000 0000 0000 0000 0000 0000 0000 00011. The highest position (first) is positive or negative (0 is positive, 1 is negative)2. Lowest bit (bottom)

in C #, you can perform a bitwise logical operation on an integer operand. The meaning of the bitwise logical operation is that each bit of the operand is taken sequentially, and the logical operation of each bit is the result of each bit of the