Bitwise AND, bitwise OR, bitwise Inverse

& Bitwise AND
| By bit or
^ Bitwise OR
1. bitwise and operation bitwise AND operator "&" are binary operators. Its function is the binary phase corresponding to the two numbers involved in the operation. The result bit is 1 only when the two binary numbers are 1. Otherwise, the result bit is 0. The number of involved operations is supplemented.
For example, 9 & 5 can be written as follows: 00001001 (Binary complement of 9) & 00000101 (Binary complement of 5) 00000001 (Binary complement of 1) Visible 9 & 5 = 1.
Bitwise AND operations are usually used to clear some bits or retain some bits. For example, if a clears the high eight bits of 0 and retains the low eight bits, it can be used as a & 255 operation (255 of the binary number is 0000000011111111 ).
Main (){
Int A = 9, B = 5, C;
C = A & B;
Printf ("A = % d/Nb = % d/NC = % d/N", A, B, C );
}
2. bitwise OR operator "|" is a binary operator. Its function is the binary phase or corresponding to the two numbers involved in the operation. If one of the two binary numbers is 1, The result bit is 1. The two numbers involved in the operation appear as a complement.
Example: 9 | 5 writable formula: 00001001 | 00000101
00001101 (decimal 13) Visible 9 | 5 = 13
Main (){
Int A = 9, B = 5, C;
C = A | B;
Printf ("A = % d/Nb = % d/NC = % d/N", A, B, C );
}
3. bitwise exclusive or operation bitwise exclusive OR operator "^" is a binary operator. This function is used to calculate whether the binary numbers corresponding to the binary numbers are different or not. When the binary numbers of the two numbers are different, the result is 1. The number of involved operations still appears as a complement Code. For example, 9 ^ 5 can be written as follows: 00001001 ^ 00000101 00001100 (12 in decimal format)
Main (){
Int a = 9;
A = a ^ 15;
Printf ("a = % d/n", );
}

//////////////////////////////////////// //////////////////////////////////////// ////////////////////////////////////

4. bitwise XOR or operator ^
The two values involved in the calculation. If the two corresponding bits are the same, the result is 0. Otherwise, the result is 1. That is:
0 ^ 0 = 0, 1 ^ 0 = 1, 0 ^ 1 = 1, 1 ^ 1 = 0
Example: 10100001 ^ 00010001 = 10110000

0 ^ 0 = 0 0 ^ 1 = 1 0 variance or any number = any number

1 ^ 0 = ^ 1 = 0 1 variance or any number-returns the inverse of any number

Set yourself to 0 for any number difference or yourself =
(1) bitwise exclusive or can be used to flip certain specific bits. For example, if the number is 10100001 or 2nd bits, bitwise exclusive or operation can be performed on the number and 3rd bits.
10100001 ^ 00000110 = 10100111 // 1010 0001 ^ 0x06 = 1010 0001 ^ 6
(2) bitwise exclusive or operation can exchange two values without using temporary variables. For example, you can use the following statement to exchange the values of two integers, a and B:
A = 10100001, B = 00000110
A = a ^ B; // a = 10100111
B = B ^ a; // B = 10100001
A = a ^ B; // a = 00000110
(3) In assembly languages, variables are often set to zero:

Xor a,

 

This article from the CSDN blog, reproduced please indicate the source: http://blog.csdn.net/liquanhai/archive/2007/08/26/1759906.aspx