Examples of bitwise operators in java

Java Notes: Bitwise Operators

Java's bitwise operators operate on individual bits of integer int and long values. If an operand is shorter than an int, it is promoted to int before doing the operations.

It helps to know how integers are represented in binary. For example the decimal number 3 is represented as 11 in binary and the decimal number 5 is represented as in binary. Negative integers are store in two's complement form.

For example, -4 is A common use of the bitwise operators shifts with ands to extract values and ors to add values is to work with multiple values that have been encoded in one int. Bit-fields are another way to do this. For example, let's say you have the following integer variables: This saves a lot of space and can be fast to process.

Here's some weird code. It uses xor to exchange two values x and y. This is translated to Java from an assembly code program, where there was no available storage for a temporary. Never use it; this is just a curiosity from the museum of bizarre code.

Altho the bitwise and can also be used with boolean operands, this is extremely rare and is almost always a programming error.

Bitwise Operators Java's bitwise operators operate on individual bits of integer int and long values.

Zero bits are shifted into the low-order positions. If n is a 2's complement signed number, the sign bit is shifted into the high-order positions.

Zeros are shifted into the high-order positions. Packing and Unpacking A common use of the bitwise operators shifts with ands to extract values and ors to add values is to work with multiple values that have been encoded in one int. Shift left multiplies by 2; shift right divides by 2 On some older computers it was faster to use shift instead of multiply or divide.

bit manipulation - How Does The Bitwise & (AND) Work In Java? - Stack Overflow

Flipping between on and off with xor Sometimes xor is used to flip between 1 and 0. Exchanging values with xor Here's some weird code.

Copyleft Fred Swartz MIT License. Shifts the bits of n left p positions. Shifts the bits of n right p positions.