XOR Array Elements

[crossrulz]

We currently have an AND Array Elements and OR Array Elements.  It would be helpful to also have an XOR Array Elements.  I most often run into needing this when trying to calculate parity.

[AristosQueue (NI)]

XOR says "For two boolean values A and B, if A and B are different, return TRUE, otherwise, return FALSE." Applying that to an array, you're asking for a primitive that returns TRUE if and only if all the elements are true or all the elements are false?

[RavensFan]

I think what he wants is a serial XOR of each element, just like doing an XOR with the compound arithmetic function.  An Odd number of Trues returns a True, an Even number returns a False.

[AristosQueue (NI)]

Ah. Something like this then:

Having a picture helps clarify the idea. 

[altenbach]

Just to clarify the typical use, operating on boolean arrays is relatively boring. A much more useful application is to use it on integer arrays for bitwise XOR. This is often needed for e.g. checksum calculations. Look at this simple example (posted here) where it would replace the while loop.

Of course it should accept arrays of any dimension.

[elset191]

---

@altenbach wrote:

A much more useful application is to use it on integer arrays for bitwise XOR.

---

(Or and And Array Elements should also work on integer arrays.)

[crazywalt77]

Using increment of an integer to measure an XOR for an Array.

[wiebe@CARYA]

>Using increment of an integer to measure an XOR for an Array.

That doesn't XOR the array, it checks if there's exactly one true value. 

The XOR is true if there's an odd number of true's. So in your example, you'd have to use Quotient & Remainder the result with 2, and then do the checks...

This would work though: