How do bitwise operators work in Java?

Can you explain how bitwise operators work in Java?

Sure! Bitwise operators in Java perform operations on bits of integer types. They include AND, OR, XOR, NOT, and bit shifts.

What are the main bitwise operators and their functions?

The main bitwise operators are:

1. AND (&) - sets each bit to 1 if both bits are 1.
2. OR (|) - sets each bit to 1 if at least one of the bits is 1.
3. XOR (^) - sets each bit to 1 if only one of the bits is 1.
4. NOT (~) - inverts all the bits.
5. Left Shift (<<) - shifts bits to the left, filling with 0s.
6. Right Shift (>>) - shifts bits to the right.

Can you give me an example of using the AND operator?

Certainly! For example, if you have two integers, a = 12 (binary 1100) and b = 5 (binary 0101), then a & b results in 4 (binary 0100).

What about the left shift operator?

The left shift operator (<<) shifts all bits to the left by a specified number of positions. For instance, 3 << 2 shifts the bits of 3 (binary 0011) two places to the left, resulting in 12 (binary 1100).