BreakPoint
Rube Goldberg Code
And Jack wins a prize for code obfuscation
Maybe I'll wait for official support after all.... !
I am going to link to an interesting VI here.
It isn't so much a Rube Goldberg, though there are a few Rube constructions like building an array of string constants rather than just creating a constant that is already a string array. The code is actually neatly laid out, but really just has a lot of wrong things going on it. It could also be a good nomination for the Local Variable thread. It uses stacked sequences. It uses a weird intermingling of single sequence frames, single iteration while loops, multiple iteration while loops, bits of data like a boolean whose only purpose is to link stuff together to have it operate in sequence, even if the two things that it is linking could be a single 2-frame flat sequence (or going the bad route of a stacked sequence which has been done numerous times.)
But just to give a taste, here is the beginning of the very linear program, and the comment that I thought was funny and fitting about the "penalty box". (Actually, the whole program looks like a linear sequence of penalty boxes.)
/Y
Broken Arrow wrote:
![example[1]_BD.png 13 KB](/ni/attachments/ni/BreakPoint/11897/1/example%5B1%5D_BD.png){kind=link}
altenbach wrote:I was just going to post that. A WEQ!You did not show the entire WEQ code. See what the output of the case structure is!
Yeah 
but I've seen that before. The ol' True if True and False it False statement.
Sometimes it is difficult to understand why certain code is the way it is.
In this example, arrays are built for a lifetime of a few clock cycles, just to break them down again in the next primitive.
Look at the first row of the built 2D array, it is never even used! Why???
