These functions use the two's-complement representation for integers.
There is no limit to the number of bits in an integer.
They are in the structures bitwise and big-scheme.
(bitwise-and integer integer) -> integer
(bitwise-ior integer integer) -> integer
(bitwise-xor integer integer) -> integer
(bitwise-not integer) -> integer
ior' is inclusive OR and `xor' is exclusive OR.
Shifts the integer by the given bit count, which must be an integer,
shifting left for positive counts and right for negative ones.
Shifting preserves the integer's sign.
Counts the number of bits set in the integer.
If the argument is negative a bitwise NOT operation is performed
before counting.
Previous: ASCII character encoding | Next: Byte vectors