XOR of three values

by

For exactly three terms, you can use this expression:

(a ^ b ^ c) && !(a && b && c)

The first part is true iff one or three of the terms are true. The second part of the expression ensures that not all three are true.

Note that the above expression does NOT generalize to more terms. A more general solution is to actually count how many terms are true, so something like this:

int trueCount =
   (a ? 1 : 0) +
   (b ? 1 : 0) +
   (c ? 1 : 0) +
   ... // more terms as necessary 

return (trueCount == 1); // or some range check expression etc

More Related Contents:

  1. How does XOR variable swapping work?
  2. Solving “Who owns the Zebra” programmatically?
  3. Should I use `!IsGood` or `IsGood == false`?
  4. What is the difference between a deep copy and a shallow copy?
  5. Should a function have only one return statement?
  6. Can every recursion be converted into iteration?
  7. How Does Modulus Divison Work
  8. Are there any legitimate use-cases for “goto” in a language that supports loops and functions?
  9. Conventions for exceptions or error codes [closed]
  10. Which, and why, do you prefer Exceptions or Return codes?
  11. How do I display the binary representation of a float or double?
  12. Buffered vs unbuffered IO
  13. Difference between parameter and argument [duplicate]
  14. What is the difference between Type and Class?
  15. Allen Holub wrote “You should never use get/set functions”, is he correct? [duplicate]
  16. What are the lesser known but useful data structures?
  17. What is a Lambda?
  18. Semantic Diff Utilities [closed]
  19. Why is it recommended to have empty line in the end of a source file?
  20. Are exceptions really for exceptional errors? [closed]
  21. What is a stack overflow?
  22. Generate colors between red and green for a power meter?
  23. How are mutexes implemented?
  24. Calculating a 2D Vector’s Cross Product
  25. Hash Code and Checksum – what’s the difference?
  26. How to name variables
  27. In what situations is octal base used?
  28. When should a method be static?
  29. Why is the knapsack problem pseudo-polynomial?
  30. Code Golf: Conway’s Game of Life

Leave a Comment