| 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 6: | Line 6: | ||
!colspan="2" style="background-color:#AFEEEE;"|Appearance | !colspan="2" style="background-color:#AFEEEE;"|Appearance | ||
|- | |- | ||
| − | |colspan="2" align="center" style="padding:10px;"|[[ | + | |colspan="2" align="center" style="padding:10px;"|[[File:5_4_2_2.png]] |
|- | |- | ||
!colspan="2" style="background-color:#AFEEEE;"|Symbol | !colspan="2" style="background-color:#AFEEEE;"|Symbol | ||
| 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;"> | ||
| − | [[ | + | [[File:5_4_3_1.png|left|Icon]] |
</div> | </div> | ||
| Line 87: | Line 87: | ||
== Examples == | == Examples == | ||
{| | {| | ||
| − | |[[ | + | |[[File:5_4_3_3.png|thumb|400px|As decimal]] |
| − | |[[ | + | |[[File:5_4_3_4.png|thumb|550px|As binary]] |
|} | |} | ||
Revision as of 17:54, 23 November 2015
| Appearance | |
|---|---|
| |
| Symbol | |
| X ^ Y | |
| Group | |
| Bitwise operators | |
| Inputs | |
| Value X: | Integer |
| Value Y: | Integer |
| Outputs | |
| Result: | Integer |
| 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 .
