BitLShift: Difference between revisions
Jump to navigation
Jump to search
m (Minor fixes) |
m (Minor example extension) |
||
| Line 23: | Line 23: | ||
local positions = 0x4 -- binary: 0100, decimal: 4 | local positions = 0x4 -- binary: 0100, decimal: 4 | ||
local shifted = bitLShift( value, positions ) -- binary: 1111 1111 1111 1111 1111 1111 1111 0000, decimal: 4.294.967.280 | local shifted = bitLShift( value, positions ) -- binary: 1111 1111 1111 1111 1111 1111 1111 0000, decimal: 4.294.967.280 | ||
-- Comparsion: | |||
-- binary: 1111 1111 1111 1111 1111 1111 1111 1111, decimal: 4.294.967.295 | |||
-- binary: 1111 1111 1111 1111 1111 1111 1111 0000, decimal: 4.294.967.280 | |||
</syntaxhighlight> | </syntaxhighlight> | ||
==See Also== | ==See Also== | ||
{{Bit_functions}} | {{Bit_functions}} | ||
Revision as of 22:28, 21 February 2016
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 shift 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: 4.294.967.280 -- Comparsion: -- binary: 1111 1111 1111 1111 1111 1111 1111 1111, decimal: 4.294.967.295 -- binary: 1111 1111 1111 1111 1111 1111 1111 0000, decimal: 4.294.967.280