Rube Goldberg Code

[Ray.R]

That's a Sin-full way to program..  😛

[Wayne.C]

Seems more like a  "Wing and a prayer.."

[Vsh]

---

altenbach wrote:

1. First we do a NOOP, writing a control to a local variable of itself! (where have we seen that before?)

---

Atleast It could easily be figured out that control was wired to a local variable of itself.

Imagine, I have come across situation where 2 control labels are being SAME. And the control was written to the other control's local variable. (Making an impression just as above,,, But actually not!!!)

And the other control was HIDDEN!!!! ...  That was ridiculous... I had nothing to do other than scratching my head to debug it!!

Message Edited by Vsh on 04-30-2008 11:43 PM

[Ray.R]

Vsh,

I actually had to debug code that resembled very much the one posted by Altenbach, and yes they hid the bloody controls.  They not only hid the bloody controls on the front panel of all sub-vi's, but also the terminals were hidden (placed under) by stacked sequence structures. Thus explaining the eye patch on my avatar.  😞

[TCPlomp]

There is an INI token for this:
structuresFadeToDiagramBeneath=TRUE

but be awere on big VIs this will slow down the speed dramatically (and unfortunatly their is a correlation between those two).
The code capture tool saves these changes to, so maybe you can get an image of the troublesome VI, reset the INI token and start editing fast.

Ton

[Ray.R]

Thanks Ton,

I'll have to investigate that.

[parthabe]

Here is Norbert's version of Rube Goldberg Code found by Mike!

[altenbach]

It is amazing how much code could be used to read data from a 2-column spreadsheet file.

(A) here's the actual code:

1. read it line by line in a while loop
2. with each iteration index the current line string and convert it to a 2D array containing two data points
3. set the file position for the next line
4. followed by indexing out the two values with two seperate index nodes
5. form an xy cluster
6. built a cluster array at the loop boundary
7. Check if the file position is at the end of the file 
8. bundle the array
9. make the cluster into an array with one huge element
10. feed it to a 2D graph.
11. Surround everything with a useless sequence frame!

(B) And here's a simple alternative that does exactly the same thing!

(from http://forums.ni.com/ni/board/message?board.id=170&view=by_date_ascending&message.id=321901#M321901)

Solution (A) is only approriate if you get paid by square footage of the diagram and performance is never an issue. 😄

Message Edited by altenbach on 05-07-2008 01:40 PM

[Norbert_B]

---

@parthabe wrote:
Here is Norbert's version of Rube Goldberg Code found by Mike!

---

That's not nice, Partha, posting that in here 😉

Well, just as stated in the thread, there is a reason for that WEQ (It's only not documented in this screenshot.....  )
And, on the other hand, everybody has the right to "Goldberg" from time to time 🙂

Norbert

[parthabe]

Sorry, Norbert.

BTW, what is meant by WEQ?