How to evaluate a bitwise operation on two integers

1. Enter A and B

   "Integer A" and "Integer B" are the two operands. The tool truncates each to an integer with `Math.trunc` before operating — fractional inputs lose their decimals.

2. Pick the operation

   "Operation" selects from `and` (`A & B`), `or` (`A | B`), `xor` (`A ^ B`), `shl` (`A << B`, left shift), `shr` (`A >> B`, right shift).

3. Press Run

   Result returns a single `result` field — a signed 32-bit integer. JavaScript bitwise ops coerce both sides to 32-bit twos-complement, so anything outside [-2^31, 2^31 − 1] wraps around.

4. Shifts on B as a count

   For `shl`/`shr`, only the low 5 bits of B are used as the shift count — so a shift of 32 is the same as a shift of 0. This is JavaScript's behavior, not a bug.