Re: C := A +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-B;

STRANGELY ENOUGH DELPHI COMPILER DOES NOT OPTIMIZE THIS SITUATION, IT JUST
PRODUCES A BUNCH OF NEGATES.

WEIRD OR WHAT... MAYBE IT'S THE LLVM COMPILER...

IS THERE A REASON FOR THIS ? MAYBE TO ALLOW RACE CONDITIONS OR TIMING CODE
TO BE WRITTEN LIKE THIS ?

IS REDUCING IT TO A SINGLE NEGATE NOT "LOGICALLY EQUIVALENT"

MAYBE PHYLOSOPHICAL ISSUE... OF "EQUIVALENCY"... TIME WISE HEHE.

MAYBE IT IS JUST AN OVER SIGHT, OR A MISSED OPPERTUNITY TO OPTIMIZE.


OR MOST LIKELY... THIS KIND OF CODE IS SIMPLY VERY RARE... MOSTLY CONSIDERED

A PROGRAMMING MISTAKE... AND THEREFORE THERE IS NO OPTIMIZATION FOR THIS...

SO THIS KINDA HINTS AT, THAT WHO-EVER WROTE THE COMPILER CONSIDERS THIS
EXOTIC/STRANGE/RARE/STRANGE CODE AND THAT KINDA WARRENTS A HINT OR EVEN WARNING MESSAGES
THAT THE COMPILER DETECTED SOMETHING STRANGE !

Bye,
  Skybuck.