| This documentation is out of date.
The new version of the documentation is here: https://cannylogic.com/docs |
Difference between revisions of "Right shift"
| [unchecked revision] | [unchecked revision] |
| Line 19: | Line 19: | ||
|- | |- | ||
|style="padding-left:1em;"|Value: | |style="padding-left:1em;"|Value: | ||
| − | |style="padding-left:1em;"|[[ | + | |style="padding-left:1em;"|[[CFD Language#Data|Integer]] |
|- | |- | ||
| − | |style="padding-left:1em;"|Shift, | + | |style="padding-left:1em;"|Shift, bits: |
| − | |style="padding-left:1em;"|[[ | + | |style="padding-left:1em;"|[[CFD Language#Data|Integer]] |
|- | |- | ||
!colspan="2" style="background-color:#AFEEEE;"|outputs | !colspan="2" style="background-color:#AFEEEE;"|outputs | ||
|- | |- | ||
|style="padding-left:1em;"|Result: | |style="padding-left:1em;"|Result: | ||
| − | |style="padding-left:1em;"|[[ | + | |style="padding-left:1em;"|[[CFD Language#Data|Integer]] |
|- | |- | ||
!colspan="2" style="background-color:#AFEEEE;"|Version [[CANNY Lab]] | !colspan="2" style="background-color:#AFEEEE;"|Version [[CANNY Lab]] | ||
| Line 59: | Line 59: | ||
|style="padding:5px;"|0b0000000000010110 | |style="padding:5px;"|0b0000000000010110 | ||
|- | |- | ||
| − | |style="padding:5px;"|Shift, | + | |style="padding:5px;"|Shift, bits |
|style="padding:5px;"|= | |style="padding:5px;"|= | ||
|align="center"|2 | |align="center"|2 | ||
| Line 105: | Line 105: | ||
[[Right rotation]] | [[Right rotation]] | ||
| − | [[ | + | [[Built-in_Function_Blocks | Built-in Function Blocks]] |
Revision as of 21:24, 19 November 2015
| Appearance | |
|---|---|
| Изображение:5_4_5_2.png | |
| Symbol | |
| >> | |
| Group | |
| Bitwise operators | |
| Inputs | |
| Value: | Integer |
| Shift, bits: | Integer |
| outputs | |
| Result: | Integer |
| Version CANNY Lab | |
| from 0.6b | |
Logical shift to the Right. Set the output result as the logical right 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 right position, to the number of times specified by the value of the input "Shift, bit". Thus, the most significant (left-most) bit in the binary representation of the results each time gets a "0".
For example:
| Value | = | 22 | = | 0x0016 | = | 0b0000000000010110 |
| Shift, bits | = | 2 | ||||
| Result | = | 5 | = | 0x0005 | = | 0b0000000000000101 |
Особенности
The result of logical right shift::
for one bit — equivalent to the results of its integer division by 2
for two bits — equivalent to the results of its integer division by 4
for three bits — equivalent to the results of its integer division by 8
etc.
Examples
| thumb|400px|Десятичное представление | thumb|500px|Двоичное представление |
