only for studying the basic-to-the-roots programming for those who can think binary and comparatively:
1_LO-CALC_LET()-iFS()-comparators_study-v000_021316.ods (51.8 KB)
In conclusion: It’s shameful that it took me so long to get back to basics programmatically, because every computer language is astonishingly stupid and will remain so! Thus, only bit values are compared with each other in AND, OR, and NOT gates. The “new” LET() function is nothing more than an ancient PLC block in which subfunctions can be elegantly integrated hierarchically – in my study and this one, using binary elements and without any calculations having to be duplicated.
Logic thought differently: In contrast to hardware electronics with semiconductor gates (ICs), software only allows for a relatively slow, line-by-line processing of instructions like human reading any book, which only creates problems or can be elegantly exploited, as used here, by checking successively whether an expression/comparison is valid and then aborting this procedure until an expression is valid.
This morning, I recognized the genius of the LET() function and studied it in detail to avoid complex functions like LOCKUP() with its dubious OUTPUT in the future, as well as the difficult-to-modify matrix{} arrays that I had spent hours agonizing over. Even if I archive this file solely for my own study, I hope at least one reader will learn something from it. In any case, not everyone is taught digital logic.
PS in DEU: Mit den komplexen undurchschaubaren Matrix{}-Funktionen stehe ich weiterhin auf „Kriegs-Fuß", wegen deren nicht vorhersehbaren und nicht erwünschten Ergebnisse! Obwohl ich sie mag, eben wegen ihrer Komplexitäten, speziell SVERWEiS/WVERWEiS/VERWEiS (LOCKUP).
Warum einfach, wenn es auch irgendwie kompliziert geht? 
