This documentation is out of date.
The new version of the documentation is here: https://cannylogic.com/docs |
Difference between revisions of "Bitwise exclusive OR"
From CANNY Wiki
[unchecked revision] | [unchecked revision] |
Line 45: | Line 45: | ||
</div> | </div> | ||
<br clear="left"> | <br clear="left"> | ||
− | In other words, the | + | In other words, the resulting bit is equal to: |
*"1" if only one bit of a pair of input value respective bits are equal to "1"; | *"1" if only one bit of a pair of input value respective bits are equal to "1"; |
Revision as of 02:26, 19 November 2015
Appearance | |
---|---|
Изображение:5_4_2_2.png | |
Symbol | |
X ^ Y | |
Group | |
Bitwise operators | |
Inputs | |
value X: | числовой |
value Y: | числовой |
Outputs | |
Result: | числовой |
Version CANNY Lab | |
from 0.6b |
Bitwise modulo 2. Set the output result of XOR operation , applied to each pair of bits that are in the same positions in the binary representation of the input values.
In other words, the resulting bit is equal to:
- "1" if only one bit of a pair of input value respective bits are equal to "1";
- "0" if both bits of a pair are equal to "0", or both bits of a pair are equal to "1"
For example:
value X | = | 27 | = | 0x001B | = | 0b0000000000011011 |
value Y | = | 58 | = | 0x003A | = | 0b0000000000111010 |
Result | = | 33 | = | 0x0021 | = | 0b0000000000100001 |
Features
THe result of 'Bitwise XOR' number with itself is always zero.
The result of 'Bitwise XOR' on any X with the same Y value twice is always equal to initial X value .
Examples
thumb|400px|Десятичное представление | thumb|550px|Двоичное представление |