Skip to main content

12 docs tagged with "Bitwise"

View All Tags

Bit And

Computes a bitwise AND. The result has a bit set for every bit that is set in both of the inputs.

Bit Leading Zeros

Counts the number of zeros at the beginning (most significant side) of the binary representation of an integer.

Bit Nand

Computes a bitwise NAND. (NOT AND) The result has a bit set for every bit that is not set in either of the inputs.

Bit Not

Computes a bitwise NOT. The result has a bit set for every bit that is not set in the input.

Bit Or

Computes a bitwise OR. The result has a bit set for every bit that is set in either of the inputs.

Bit Pop Count

Counts the number of set bits in the binary representation of an integer.

Bit Rotate Left

Rotates digits in the binary representation of an integer to the left. As the leftmost bits fall off, they are used to fill the rightmost bits.

Bit Rotate Right

Rotates digits in the binary representation of an integer to the right. As the rightmost bits fall off, they are used to fill the leftmost bits.

Bit Shift Left

Shifts a value left by a number of bits. Leftmost bits are discarded, and rightmost bits are filled with zeros.

Bit Shift Right

Shifts a value right by a number of bits. Rightmost bits are discarded, and leftmost bits are filled with zeros. (Logical shift)

Bit Trailing Zeros

Counts the number of zeros at the end (least significant side) of the binary representation of an integer.

Bit Xor

Computes a bitwise XOR. The result has a bit set for every bit that is set in exactly one of the inputs.