Bitweise Operatoren

Every integer is really a row of bits. Bitwise operators let you work on those individual ones and zeros directly, with no rounding or math in between.

The & operator keeps a bit only where both inputs have a 1. It is the classic tool for masking off the bits you do not want.

The | operator sets a bit where either input has a 1. Use it to turn specific flags on without disturbing the rest.

The ^ operator sets a bit only where the inputs differ. XOR is handy for toggling a flag or comparing two patterns.

The unary ~ operator flips every bit at once: each 1 becomes 0 and each 0 becomes 1. It builds the complement of a value.

The << operator slides bits toward the high end, filling in zeros. Each shift left by one doubles an unsigned value.

The >> operator moves bits toward the low end. For an unsigned integer, each right shift by one halves the value.

Combine AND with a mask to test whether a bit is set. If value & mask is nonzero, that flag is on; if zero, it is off.

OR a mask to set bits, and AND with an inverted mask to clear them. Together they give you precise control over each flag.

Zig will not let you shift by more than the type holds. A shift amount out of range is a defined error, not silent garbage.

Bit operations power flags, permissions, hardware registers, and compact data. They let you store many true-or-false answers in a single number.

You want a bit set only when the two inputs differ. Which operator?

You now use &, |, ^, ~, plus the shifts << and >>, to read, set, clear, and move bits with full precision. ⚙️