Created a page for the Shift Left node. |
Updated descriptions. |
||
| Line 13: | Line 13: | ||
|}} | |}} | ||
The '''Shift Left''' node takes in a value we want to shift (using a bitwise operation) and the amount we want to shift by, and returns the new shifted value. Shifting is the act of moving the bits in a byte in a direction, and when shifting, the bits that fall outside the bounds will be lost. | The '''Shift Left''' node takes in a value we want to shift (using a bitwise operation) and the amount we want to shift by to the left, and returns the new shifted value. Shifting is the act of moving the bits in a byte in a direction, and when shifting, the bits that fall outside the bounds will be lost. | ||
== Inputs == | == Inputs == | ||
| Line 23: | Line 23: | ||
=== Shift ([[Type:int|int]]) === | === Shift ([[Type:int|int]]) === | ||
The amount to shift this value by. | The amount to shift this value by to the left. | ||
== Outputs == | == Outputs == | ||
Revision as of 17:40, 29 June 2024
< <
Boolean
The Shift Left node takes in a value we want to shift (using a bitwise operation) and the amount we want to shift by to the left, and returns the new shifted value. Shifting is the act of moving the bits in a byte in a direction, and when shifting, the bits that fall outside the bounds will be lost.
Inputs
A (Pseudo-Generic)
The value we want to shift.
Shift (int)
The amount to shift this value by to the left.
Outputs
* (Pseudo-Generic)
The new shifted value.
Further Reading
Videos
See Also
- Wikipedia's definition of bitwise operation & logical shift.
- Microsoft's documentation on the shifting operators.