bitwise

Compute the bitwise AND of two hexadecimal values, digit by digit.

Compute the bitwise NAND of two hexadecimal values, digit by digit.

Compute the bitwise NOR of two hexadecimal values, digit by digit.

Apply the NOT logic gate to a hexadecimal value, flipping every bit within its own width.

Flip every bit of a hexadecimal number, a quick way to compute its bitwise complement.

Compute the bitwise OR of two hexadecimal values, digit by digit.

Compute the bitwise XNOR of two hexadecimal values, digit by digit.

Compute the bitwise XOR of two hexadecimal values, digit by digit.

Fold a list of non-negative integers with bitwise AND.

Fold a list of non-negative integers with AND, then take the NOT at a chosen bit width.

Fold a list of non-negative integers with OR, then take the NOT at a chosen bit width.

Compute the bitwise NOT of each integer independently at a chosen bit width.

Fold a list of non-negative integers with bitwise OR.

Fold a list of non-negative integers with XOR, then take the NOT at a chosen bit width.

Fold a list of non-negative integers with bitwise XOR.

Reinterpret signed integers as unsigned values at an 8, 16, or 32-bit width.

Reinterpret unsigned integers as two's-complement signed values at an 8, 16, or 32-bit width.