bit
Integer, Bit Operations, provided by http://bitop.luajit.org/
- Functions
- tobit(x :
integer) - tohex(x :
integer, n :integer``?) - bnot(x :
integer) - band(x1 :
integer, ...integer) - bor(x1 :
integer, ...integer) - xor(x1 :
integer, ...integer) - lshift(x :
integer, n :integer) - rshift(x :
integer, n :integer) - arshift(x :
integer, n :integer) - rol(x :
integer, n :integer) - ror(x :
integer, n :integer) - bswap(x :
integer)
- tobit(x :
Functions
tobit(x : integer)
->integer
Normalizes a number to the numeric range for bit operations and returns it. This function is usually not needed since all bit operations already normalize all of their input arguments. Check the operational semantics for details.
tohex(x : integer, n : integer?)
Converts its first argument to a hex string. The number of hex digits is given by the absolute value of the optional second argument. Positive numbers between 1 and 8 generate lowercase hex digits. Negative numbers generate uppercase hex digits. Only the least-significant 4*|n| bits are used. The default is to generate 8 lowercase hex digits.
bnot(x : integer)
->integer
Returns the bitwise not of its argument.
band(x1 : integer, ...integer)
->integer
Returns the bitwise and of all of its arguments. Note that more than two arguments are allowed.
bor(x1 : integer, ...integer)
->integer
Returns the bitwise or of all of its arguments. Note that more than two arguments are allowed.
xor(x1 : integer, ...integer)
->integer
Returns the bitwise xor of all of its arguments. Note that more than two arguments are allowed.
lshift(x : integer, n : integer)
->integer
Returns the bitwise logical left-shift of its first argument by the number of bits given by the second argument.
Logical shifts treat the first argument as an unsigned number and shift in 0-bits. Arithmetic right-shift treats the most-significant bit as a sign bit and replicates it. Only the lower 5 bits of the shift count are used (reduces to the range [0..31]).
rshift(x : integer, n : integer)
->integer
Returns the bitwise logical right-shift of its first argument by the number of bits given by the second argument.
Logical shifts treat the first argument as an unsigned number and shift in 0-bits. Arithmetic right-shift treats the most-significant bit as a sign bit and replicates it. Only the lower 5 bits of the shift count are used (reduces to the range [0..31]).
arshift(x : integer, n : integer)
->integer
Returns the bitwise arithmetic right-shift of its first argument by the number of bits given by the second argument.
Logical shifts treat the first argument as an unsigned number and shift in 0-bits. Arithmetic right-shift treats the most-significant bit as a sign bit and replicates it. Only the lower 5 bits of the shift count are used (reduces to the range [0..31]).
rol(x : integer, n : integer)
->integer
Returns bitwise left rotation of its first argument by the number of bits given by the second argument. Bits shifted out on one side are shifted back in on the other side.
Only the lower 5 bits of the rotate count are used (reduces to the range [0..31]).
ror(x : integer, n : integer)
->integer
Returns bitwise right rotation of its first argument by the number of bits given by the second argument. Bits shifted out on one side are shifted back in on the other side.
Only the lower 5 bits of the rotate count are used (reduces to the range [0..31]).
bswap(x : integer)
->integer
Swaps the bytes of its argument and returns it. This can be used to convert little-endian 32 bit numbers to big-endian 32 bit numbers or vice versa.