| This documentation is out of date.
The new version of the documentation is here: https://cannylogic.com/docs |
Difference between revisions of "Right rotation"
From CANNY Wiki
(Created page with " <div style="float:right;margin:5px;"> {|class="cannytable" width="350px" |- !colspan="2" style="background-color:#AFEEEE;"|Внешний вид |- |colspan="2" align="cent...") |
|||
| Line 45: | Line 45: | ||
</div> | </div> | ||
<br clear="left"> | <br clear="left"> | ||
| − | In other words, the result is equivalent to the result of copying each bit in binary representation of input "value" to its | + | 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 each time will have a value equal to the outgoing (least significant, extending to the right) bit of input value. |
| − | + | ||
| − | + | For example: | |
{|border="0" style="border-collapse:collapse;" | {|border="0" style="border-collapse:collapse;" | ||
|- | |- | ||
| − | |style="padding:5px;"| | + | |style="padding:5px;"|Value |
|style="padding:5px;"|= | |style="padding:5px;"|= | ||
|style="padding:5px;"|51000 | |style="padding:5px;"|51000 | ||
| Line 60: | Line 59: | ||
|style="padding:5px;"|0b1100011100111000 | |style="padding:5px;"|0b1100011100111000 | ||
|- | |- | ||
| − | |style="padding:5px;"| | + | |style="padding:5px;"|Shift, bit |
|style="padding:5px;"|= | |style="padding:5px;"|= | ||
|align="center"|2 | |align="center"|2 | ||
|align="center"| | |align="center"| | ||
|- | |- | ||
| − | |style="padding:5px;"| | + | |style="padding:5px;"|Result |
|style="padding:5px;"|= | |style="padding:5px;"|= | ||
|style="padding:5px;"|12750 | |style="padding:5px;"|12750 | ||
| Line 74: | Line 73: | ||
|} | |} | ||
| − | == | + | == Features == |
| − | + | Cyclic shift of 16-bit value in either direction for 8-bit, reverses its upper and lower bytes. | |
| − | == | + | == Examples == |
{| | {| | ||
|[[Изображение:5_4_8_3.png|thumb|400px|Десятичное представление]] | |[[Изображение:5_4_8_3.png|thumb|400px|Десятичное представление]] | ||
| Line 84: | Line 83: | ||
|} | |} | ||
| − | == | + | == See also == |
| − | [[ | + | [[Bitwise AND]] |
| − | [[ | + | [[Bitwise OR]] |
| − | [[ | + | [[Bitwise exclusive OR]] |
| − | [[ | + | [[Bitwise Inversion]] |
| − | [[ | + | [[Right shift]] |
| − | [[ | + | [[Left shift]] |
| − | [[ | + | [[Left rotation]] |
[[Справочник по встроенным функциональным блокам | Встроенные функциональные блоки]] | [[Справочник по встроенным функциональным блокам | Встроенные функциональные блоки]] | ||
Revision as of 07:15, 19 November 2015
| Внешний вид | |
|---|---|
| Изображение:5_4_7_2.png | |
| Символьное обозначение | |
| RSR | |
| Группа | |
| Bitwise operator | |
| Входы | |
| Значение: | числовой |
| Сдвиг, бит: | числовой |
| Выходы | |
| Результат: | числовой |
| Версия CANNY Lab | |
| с 1.8 | |
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", while leaving bit appears in place of free pop spot on the other end of the number..
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 each time will have a value equal to the outgoing (least significant, extending to the right) bit of input value.
For example:
| Value | = | 51000 | = | 0xC738 | = | 0b1100011100111000 |
| Shift, bit | = | 2 | ||||
| Result | = | 12750 | = | 0x31CE | = | 0b0011000111001110 |
Features
Cyclic shift of 16-bit value in either direction for 8-bit, reverses its upper and lower bytes.
Examples
| thumb|400px|Десятичное представление | thumb|500px|Двоичное представление |
