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
Jump to: navigation, search
[unchecked revision][unchecked revision]
(Created page with " <div style="float:right;margin:5px;"> {|class="cannytable" width="350px" |- !colspan="2" style="background-color:#AFEEEE;"|Внешний вид |- |colspan="2" align="cent...")
 
 
(6 intermediate revisions by 3 users not shown)
Line 4: Line 4:
 
{|class="cannytable" width="350px"
 
{|class="cannytable" width="350px"
 
|-  
 
|-  
!colspan="2" style="background-color:#AFEEEE;"|Внешний вид
+
!colspan="2" style="background-color:#AFEEEE;"|Appearance
 
|-
 
|-
|colspan="2" align="center" style="padding:10px;"|[[Изображение:5_4_7_2.png]]
+
|colspan="2" align="center" style="padding:10px;"|[[File:5_4_8_2.png]]
 
|-
 
|-
!colspan="2" style="background-color:#AFEEEE;"|Символьное обозначение
+
!colspan="2" style="background-color:#AFEEEE;"|Symbol
 
|-
 
|-
 
|colspan="2" align="center"|RSR
 
|colspan="2" align="center"|RSR
 
|-
 
|-
!colspan="2" style="background-color:#AFEEEE;"|Группа
+
!colspan="2" style="background-color:#AFEEEE;"|Group
 
|-
 
|-
|colspan="2" align="center"|[[Built-in Function Blocks | Bitwise operator]]
+
|colspan="2" align="center"|[[Built-in Function Blocks#Bitwise operators | Bitwise operators]]
 
|-
 
|-
!colspan="2" style="background-color:#AFEEEE;"|Входы
+
!colspan="2" style="background-color:#AFEEEE;"|Inputs
 
|-
 
|-
|style="padding-left:1em;"|Значение:
+
|style="padding-left:1em;"|Value:
|style="padding-left:1em;"|[[Язык CFD#Данные|числовой]]
+
|style="padding-left:1em;"|[[CFD Language#Data|Integer]]
 
|-
 
|-
|style="padding-left:1em;"|Сдвиг, бит:
+
|style="padding-left:1em;"|Shift, bits:
|style="padding-left:1em;"|[[Язык CFD#Данные|числовой]]
+
|style="padding-left:1em;"|[[CFD Language#Data|Integer]]
 
|-
 
|-
!colspan="2" style="background-color:#AFEEEE;"|Выходы
+
!colspan="2" style="background-color:#AFEEEE;"|outputs
 
|-
 
|-
|style="padding-left:1em;"|Результат:
+
|style="padding-left:1em;"|Result:
|style="padding-left:1em;"|[[Язык CFD#Данные|числовой]]
+
|style="padding-left:1em;"|[[CFD Language#Data|Integer]]
 
|-
 
|-
!colspan="2" style="background-color:#AFEEEE;"|Версия [[CANNY Lab]]
+
!colspan="2" style="background-color:#AFEEEE;"|Version [[CANNY Lab]]
 
|-
 
|-
|colspan="2" align="center"|с 1.8
+
|colspan="2" align="center"|from 1.8b
 
|}
 
|}
 
</div>
 
</div>
Line 37: Line 37:
 
<div style="min-height:100%;display:block;">
 
<div style="min-height:100%;display:block;">
 
<div style="float:left;width:70px;">
 
<div style="float:left;width:70px;">
[[Изображение:5_4_8_1.png|left|Иконка]]
+
[[File:5_4_8_1.png|left|Icon]]
 
</div>
 
</div>
  
 
<div>
 
<div>
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..
+
Circular 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, bits", while leaving bit appears in place of free pop spot on the other end of the number.
 
</div>
 
</div>
 
</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 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 each time will have a value equal to the outgoing (most significant, extending to the left) bit of input value.
+
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, bits". 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, bits
 
|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 ==
  
Операция циклического сдвига 16-и битного значения в любую сторону на 8 бит меняет местами его старший и младший байты.
+
Circular 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|Десятичное представление]]
+
|[[File:5_4_8_3.png|thumb|400px|As decimal]]
|[[Изображение:5_4_8_4.png|thumb|500px|Двоичное представление]]
+
|[[File:5_4_8_4.png|thumb|500px|As binary]]
 
|}
 
|}
  
== Смотри также ==
+
== See also ==
[[Побитовое И]]
+
[[Bitwise AND]]
  
[[Побитовое ИЛИ]]
+
[[Bitwise OR]]
  
[[Побитовое исключающее ИЛИ]]
+
[[Bitwise exclusive OR]]
  
[[Побитовое НЕ]]
+
[[Bitwise Inversion]]
  
[[Сдвиг влево]]
+
[[Right shift]]
  
[[Сдвиг вправо]]
+
[[Left shift]]
  
[[Циклический сдвиг влево]]
+
[[Left rotation]]
  
[[Справочник по встроенным функциональным блокам | Встроенные функциональные блоки]]
+
[[Built-in_Function_Blocks | Built-in Function Blocks]]

Latest revision as of 18:31, 23 November 2015

Appearance
5 4 8 2.png
Symbol
RSR
Group
Bitwise operators
Inputs
Value: Integer
Shift, bits: Integer
outputs
Result: Integer
Version CANNY Lab
from 1.8b
Icon

Circular 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, bits", 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, bits". 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, bits = 2
Result = 12750 = 0x31CE = 0b0011000111001110

Features

Circular shift of 16-bit value in either direction for 8-bit, reverses its upper and lower bytes.

Examples

As decimal
As binary

See also

Bitwise AND

Bitwise OR

Bitwise exclusive OR

Bitwise Inversion

Right shift

Left shift

Left rotation

Built-in Function Blocks