BitLShift
Jump to navigation
Jump to search
This functions performs a logical left shift on the integer value by integer n positions. In a logical shift, zeros are shifted in to replace the discarded bits. See Bitwise operation for more details.
Syntax
int bitLShift ( int value, int n )
Required arguments
- value: The value you want to perform the rotation on.
- n: The amount of positions to rotate the value by.
Returns
Returns the logical left shifted value as integer.
Example
This example shows the usage of the function bitLShift.
local value = 0xFFFFFFFF -- binary: 1111 1111 1111 1111 1111 1111 1111 1111, decimal: 4.294.967.295 local positions = 0x4 -- binary: 0100, decimal: 4 local shifted = bitLShift( value, positions ) -- binary: 1111 1111 1111 1111 1111 1111 1111 0000, decimal: 4294967280