Detailed introduction to java bit shift operator
Oct 12, 2023 am 11:19 AMJava bit shift operators are operators that operate on binary numbers. They move the bits of the binary number to the left or right by a specified number of bits, and then fill in the zero bit or sign bit. There are three bit shift operators: left shift operator (<<), right shift operator (>>), and unsigned right shift operator (>>>).
The bitwise shift operator in Java is an operator that operates on binary numbers. They move the bits of a binary number to the left or right by a specified amount. number of bits, and then pad the zero or sign bits. There are three bit shift operators in Java: left shift operator (<<), right shift operator (>>) and unsigned right shift operator (>>>). The following describes the usage and characteristics of these three operators in detail.
1. Left shift operator (<<)
The left shift operator moves a binary number to the left by the specified number of digits, and then fills the zero bits on the right. For example, shifting the binary number 1010 to the left by 2 bits yields 00101000 (40 in decimal). The syntax of the left shift operator is as follows:
int result = value << num;
Among them, value is the binary number to be moved, num is the number of digits to be moved, and result is the result of the operation.
2. Right shift operator (>>)
The right shift operator moves a binary number to the right by the specified number of digits, and then fills the sign bit on the left. If the original number is positive, it is padded with zero bits on the left; if the original number is negative, it is padded with one bit on the left. For example, shifting the binary number 1010 to the right by 2 bits yields 00001010 (decimal number 2). The syntax of the right shift operator is as follows:
int result = value >> num;
Among them, value is the binary number to be moved, num is the number of digits to be moved, and result is the operation result.
3. Unsigned right shift operator (>>>)
The unsigned right shift operator moves a binary number to the right by the specified number of digits, then on the left Fill zero bits. The unsigned right shift operator does not consider the sign bit and pads zero bits on the left regardless of whether the original number is positive or negative. For example, unsigned right shift of the binary number 1010 by 2 bits yields 00001010 (decimal number 2). The syntax of the unsigned right shift operator is as follows:
int result = value >>> num;
Among them, value is the binary number to be moved, num is the number of digits to be moved, and result is the result of the operation.
It should be noted that the displacement operator can only be used for integer types, not floating point types. In addition, the number of bits to be moved must be a non-negative integer, otherwise an exception will be thrown. When using bitwise operators, special attention should be paid to how the sign bit and zero bit are filled to avoid unexpected operation results.
The above is the detailed content of Detailed introduction to java bit shift operator. For more information, please follow other related articles on the PHP Chinese website!

Hot AI Tools

Undress AI Tool
Undress images for free

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

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

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

There are three common methods to traverse Map in Java: 1. Use entrySet to obtain keys and values at the same time, which is suitable for most scenarios; 2. Use keySet or values to traverse keys or values respectively; 3. Use Java8's forEach to simplify the code structure. entrySet returns a Set set containing all key-value pairs, and each loop gets the Map.Entry object, suitable for frequent access to keys and values; if only keys or values are required, you can call keySet() or values() respectively, or you can get the value through map.get(key) when traversing the keys; Java 8 can use forEach((key,value)->

In Java, Comparable is used to define default sorting rules internally, and Comparator is used to define multiple sorting logic externally. 1.Comparable is an interface implemented by the class itself. It defines the natural order by rewriting the compareTo() method. It is suitable for classes with fixed and most commonly used sorting methods, such as String or Integer. 2. Comparator is an externally defined functional interface, implemented through the compare() method, suitable for situations where multiple sorting methods are required for the same class, the class source code cannot be modified, or the sorting logic is often changed. The difference between the two is that Comparable can only define a sorting logic and needs to modify the class itself, while Compar

To deal with character encoding problems in Java, the key is to clearly specify the encoding used at each step. 1. Always specify encoding when reading and writing text, use InputStreamReader and OutputStreamWriter and pass in an explicit character set to avoid relying on system default encoding. 2. Make sure both ends are consistent when processing strings on the network boundary, set the correct Content-Type header and explicitly specify the encoding with the library. 3. Use String.getBytes() and newString(byte[]) with caution, and always manually specify StandardCharsets.UTF_8 to avoid data corruption caused by platform differences. In short, by

std::chrono is used in C to process time, including obtaining the current time, measuring execution time, operation time point and duration, and formatting analysis time. 1. Use std::chrono::system_clock::now() to obtain the current time, which can be converted into a readable string, but the system clock may not be monotonous; 2. Use std::chrono::steady_clock to measure the execution time to ensure monotony, and convert it into milliseconds, seconds and other units through duration_cast; 3. Time point (time_point) and duration (duration) can be interoperable, but attention should be paid to unit compatibility and clock epoch (epoch)

HashMap implements key-value pair storage through hash tables in Java, and its core lies in quickly positioning data locations. 1. First use the hashCode() method of the key to generate a hash value and convert it into an array index through bit operations; 2. Different objects may generate the same hash value, resulting in conflicts. At this time, the node is mounted in the form of a linked list. After JDK8, the linked list is too long (default length 8) and it will be converted to a red and black tree to improve efficiency; 3. When using a custom class as a key, the equals() and hashCode() methods must be rewritten; 4. HashMap dynamically expands capacity. When the number of elements exceeds the capacity and multiplies by the load factor (default 0.75), expand and rehash; 5. HashMap is not thread-safe, and Concu should be used in multithreaded

JavaScript data types are divided into primitive types and reference types. Primitive types include string, number, boolean, null, undefined, and symbol. The values are immutable and copies are copied when assigning values, so they do not affect each other; reference types such as objects, arrays and functions store memory addresses, and variables pointing to the same object will affect each other. Typeof and instanceof can be used to determine types, but pay attention to the historical issues of typeofnull. Understanding these two types of differences can help write more stable and reliable code.

InJava,thestatickeywordmeansamemberbelongstotheclassitself,nottoinstances.Staticvariablesaresharedacrossallinstancesandaccessedwithoutobjectcreation,usefulforglobaltrackingorconstants.Staticmethodsoperateattheclasslevel,cannotaccessnon-staticmembers,

ReentrantLock provides more flexible thread control in Java than synchronized. 1. It supports non-blocking acquisition locks (tryLock()), lock acquisition with timeout (tryLock(longtimeout, TimeUnitunit)) and interruptible wait locks; 2. Allows fair locks to avoid thread hunger; 3. Supports multiple condition variables to achieve a more refined wait/notification mechanism; 4. Need to manually release the lock, unlock() must be called in finally blocks to avoid resource leakage; 5. It is suitable for scenarios that require advanced synchronization control, such as custom synchronization tools or complex concurrent structures, but synchro is still recommended for simple mutual exclusion requirements.
