Detailed introduction to bitwise operators and shift operations in Java
1. Bit operations
There are 4 bit operations in Java. Their operation rules are as follows:
(1) Bitwise AND (&): both two bits are 1, the result is 1, otherwise it is 0;
( 2) Bitwise OR (|): If one of the two bits is 1, the result is 1, otherwise it is 0;
(3) Bitwise negation (~): 0 becomes 1, 1 becomes 0;
(4 ) bitwise XOR (^): two bits, if they are the same, the result is 0; if they are different, the result is 1;
Note:
(1) The sign bit (highest bit) in the bit operation also changes;
(2) Bitwise operators are somewhat similar to logical operators (logical AND &&, logical OR ||, logical NOT!). However, logical operators can only operate on boolean variables
(that is, the values on the left and right sides are boolean values);
2. Bit operation application
(1) ~5 = ?
a) 5’s complement The code is:
00000000 00000000 00000000 00000101
b) The bitwise negation (~) of 5 is:
11111111 11111111 11111111 11111010
Note: Because the high digit is 1 (negative number), the complement must be Convert to the original code; if the high digit is 0 (positive number), there is no need to convert the complement to the original code, because the original code, complement and complement of the positive number are the same.
c) Convert the complement of the negative number to the complement:
11111111 11111111 11111111 11111001
d) Convert the complement of the negative number to the original code:
10000000 00000000 00000 000 00000110
e) will binary The original code is converted to decimal:
10000000 00000000 00000000 00000110 = 0 * 2^0 + 1 * 2^1 + 1 * 2^2 = 0+2+4 = -6 (the highest bit is 1, so it is a negative number)
3. Shift operation:
There are 3 shift operators in Java.
(1) Arithmetic right shift (>>): The low bit overflows, the sign bit remains unchanged, and the overflowed high bit is filled with the sign bit;
For example: a >> b: a is the number to be moved, b is the number of digits to be moved, the same applies to the following;
(2) Arithmetic left shift (<< ): The sign bit remains unchanged, and the low bit is filled with 0;
(3) Logical right shift (>> ;>): The low bit overflows, and the high bit is filled with 0; Note: The sign bit (highest bit) in the logical right shift (>>>) also changes;
IV. Note:
bit operations and shifts Bit operations all use binary complement to perform operations, so avoid!
For more detailed introduction to bitwise operators and shift operations in Java, please pay attention to the PHP Chinese website!

Hot AI Tools

Undresser.AI Undress
AI-powered app for creating realistic nude photos

AI Clothes Remover
Online AI tool for removing clothes from photos.

Undress AI Tool
Undress images for free

Clothoff.io
AI clothes remover

Video Face Swap
Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Article

Hot Tools

Notepad++7.3.1
Easy-to-use and free code editor

SublimeText3 Chinese version
Chinese version, very easy to use

Zend Studio 13.0.1
Powerful PHP integrated development environment

Dreamweaver CS6
Visual web development tools

SublimeText3 Mac version
God-level code editing software (SublimeText3)

Hot Topics



Discussing the hierarchical architecture problem in back-end development. In back-end development, common hierarchical architectures include controller, service and dao...

Discussing the hierarchical architecture in back-end development. In back-end development, hierarchical architecture is a common design pattern, usually including controller, service and dao three layers...

Questions and Answers about constant acquisition in Java Remote Debugging When using Java for remote debugging, many developers may encounter some difficult phenomena. It...

How to convert names to numbers to implement sorting within groups? When sorting users in groups, it is often necessary to convert the user's name into numbers so that it can be different...

How to use OAuth2.0's access_token to achieve control of interface access permissions? In the application of OAuth2.0, how to ensure that the...

Confused with choosing Java project management tools for beginners. For those who are just beginning to learn backend development, choosing the right project management tools is crucial...

Exploring the application of ultimate consistency in distributed systems Distributed transaction processing has always been a problem in distributed system architecture. To solve the problem...

Regarding the analysis method of IntelliJIDEA cracking in the programming world, IntelliJ...
