Left shift

Classification	Images
Name: Left shift Symbol: <<	Appearance:
*Group: Bitwise operators CannyLab version: from 0.6b	Icon:

General description

Logical shift to the left. Set the output result as the logical left shift in binary representation of the input “Value”, the number of bits to shift specified by the input “Shift, bit”.

In other words, the result is equivalent to the result of copying each bit in binary representation of input “value” to its left position, to the number of times specified by the value of the input “Shift, bit”. Thus, least significant (right-most) bit in the binary representation of the results each time gets a “0”.

For example:

Value   =   22  =   0x0016  =   0b0000000000010110
Shift, bits =   2   
Result  =   88  =   0x0058  =   0b0000000001011000

Features

The result of logical left shift:

• for one bit — equivalent to the results of its arithmetic multiplication by 2;

• for two bits — equivalent to the results of its arithmetic multiplication by 4;

• for three bits — equivalent to the results of its arithmetic multiplication by 8;

etc.

Examples

Decimal representation:

Binary representation: