位移运算符（Shift Bitwise Operators）.docVIP

位移运算符（Shift Bitwise Operators） Shift Bitwise Operators bit operator Bitwise operators are used to compare binary numbers such as 0101, and Boolean values can also be compared; And: logical operator can only compare the value of Boolean, is a short circuit operator, and. Such as: Int i = 2 3; Boolean L = false true; //: bitwise operator System.out.println (I); System.out.println (L); Boolean J = false false; //: logical operator, short circuiting operator, System.out.println (J); Output: Two False False Visible, will be calculated on both sides of the value, and when the first is false, is no longer behind the calculation value, that is because the false is to find all the conditions and the conditions for the true, so long as there is a false for false. First, the bit operations in Java are specified, including: ~ bitwise non (NOT) Bitwise and (AND) | bitwise OR (OR) Bit by bit (XOR) Right shift The unsigned right shift Left shift The first few are very simple, mainly shift operations are more prone to errors First, figure out the number of bits involved in the operation, such as ints 32 bit. Longs 64. Such as int i = 1; I said as binary code: 00000000000000000000000000000001 Long l = 1; L said as binary code: 0000000000000000000000000000000000000000000000000000000000000001 Two, No positive complement, complement, also can say positive, with the original code as complement complement. A bitwise complement of the original code counter, Such as int, I = -1; 10000000000000000000000000000001, the MSB is the symbol bit. The positive number is 0, and the negative number is 1. Bit by bit reverse: 01111111111111111111111111111110 complement. One plus 1: 01111111111111111111111111111111 is the complement. Negative numbers are used with complement. The complement is minus 1, need to take anti access code. Three, commonly used bit operator --0, in the operation is relatively special. with. All 1 is 1, 0 is 0; any number is equal to 0, or 0 is equal to two. Example: 1