This documentation is out of date.
The new version of the documentation is here: https://cannylogic.com/docs |
Difference between revisions of "Bitwise AND"
From CANNY Wiki
[unchecked revision] | [unchecked revision] |
(Created page with " <div style="float:right;margin:5px;"> {|class="cannytable" width="350px" |- !colspan="2" style="background-color:#AFEEEE;"|Appearance |- |colspan="2" align="center" style="...") |
|||
Line 18: | Line 18: | ||
!colspan="2" style="background-color:#AFEEEE;"|Inputs | !colspan="2" style="background-color:#AFEEEE;"|Inputs | ||
|- | |- | ||
− | + | |style="padding-left:1em;"|value X: | |
− | + | ||
− | |style="padding-left:1em;"|X | + | |
|style="padding-left:1em;"|[[CFD Language#Data|logical]] | |style="padding-left:1em;"|[[CFD Language#Data|logical]] | ||
|- | |- | ||
− | |style="padding-left:1em;"|Y | + | |style="padding-left:1em;"|value Y: |
|style="padding-left:1em;"|[[CFD Language#Data|logical]] | |style="padding-left:1em;"|[[CFD Language#Data|logical]] | ||
|- | |- | ||
Line 47: | Line 45: | ||
</div> | </div> | ||
<br clear="left"> | <br clear="left"> | ||
− | + | In other words, the output is: | |
− | * | + | * "1" if both respective bit values of input are equal to "1"; |
− | * | + | * "0" if at least one bit of the pair is "0". |
− | + | For example: | |
{|border="0" style="border-collapse:collapse;" | {|border="0" style="border-collapse:collapse;" | ||
|- | |- | ||
− | |style="padding:5px;"| | + | |style="padding:5px;"|value X |
|style="padding:5px;"|= | |style="padding:5px;"|= | ||
|style="padding:5px;"|27 | |style="padding:5px;"|27 | ||
Line 63: | Line 61: | ||
|style="padding:5px;"|0b0000000000011011 | |style="padding:5px;"|0b0000000000011011 | ||
|- | |- | ||
− | |style="padding:5px;"| | + | |style="padding:5px;"|value Y |
|style="padding:5px;"|= | |style="padding:5px;"|= | ||
|style="padding:5px;"|58 | |style="padding:5px;"|58 | ||
Line 71: | Line 69: | ||
|align="center"|0b0000000000111010 | |align="center"|0b0000000000111010 | ||
|- | |- | ||
− | |style="padding:5px;"| | + | |style="padding:5px;"|Result |
|style="padding:5px;"|= | |style="padding:5px;"|= | ||
|style="padding:5px;"|26 | |style="padding:5px;"|26 | ||
Line 80: | Line 78: | ||
|} | |} | ||
− | == | + | == Features == |
− | + | Operation 'Bitwise AND' is used to [//en.wikipedia.org/wiki/Mask_(computing) mask] — selecting specific bits or fields of several bits of binary number. | |
== Примеры == | == Примеры == |
Revision as of 08:56, 18 November 2015
Appearance | |
---|---|
Изображение:5_4_1_2.png | |
Symbol | |
X & Y | |
Group | |
Bitwise operators | |
Inputs | |
value X: | logical |
value Y: | logical |
Outputs | |
Result: | logical |
Version CANNY Lab | |
from 0.6b |
Bitwise logical multiplication (conjunction). Set the output value as a result of logical multiplying, applied to each pair of bits, which are at the same positions in the binary representation of the input values.
In other words, the output is:
- "1" if both respective bit values of input are equal to "1";
- "0" if at least one bit of the pair is "0".
For example:
value X | = | 27 | = | 0x001B | = | 0b0000000000011011 |
value Y | = | 58 | = | 0x003A | = | 0b0000000000111010 |
Result | = | 26 | = | 0x001A | = | 0b0000000000011010 |
Features
Operation 'Bitwise AND' is used to mask — selecting specific bits or fields of several bits of binary number.
Примеры
thumb|400px|Десятичное представление | thumb|500px|Двоичное представление |