What are bitwise operations in Haskell?

What are bitwise operations in Haskell?

Bitwise operations in Haskell are operations that directly manipulate bits of binary numbers. They include AND, OR, NOT, XOR, and shifts.

Can you give me an example of a bitwise AND operation?

Sure! In Haskell, you can use the .&. operator for bitwise AND. For example: 5 .&. 3 results in 1 because in binary, 5 is 101 and 3 is 011, and their AND is 001.

How do I perform a bitwise NOT operation?

You can use the complement function in Haskell. For example, complement 5 will give you -6, as it flips all the bits.

What about bitwise shifts?

For bitwise shifts, you can use shiftL for left shift and shiftR for right shift. For example, shiftL 1 2 shifts the bits of 1 left by 2 positions, resulting in 4.