BreakPoint
Rube Goldberg Code
@James.M wrote:I'm still not sure why this solved his problem because he didn't share the code itself... but this is an interesting way for the code to wait a few iterations before accepting a True boolean. My guess is there's something else in the code that needs a few iterations to fully initialize.
Since it's essentially summing the integers it could also be replaced by (i*(i+1))/2 in what ever way hey wanted to do that, which would remove the dependency on the feedback node.
Going even further, he could just work out that on iteration 15 (i=14) the comparison would go true (output of additon being 105), and wire the iteration counter straight into the comparison and change it to 14.
edit: Ahhh. Having actually read the thread now, I see it's actually been mentioned. Oopsie.
@Hornless.Rhino wrote:
@James.M wrote:I'm still not sure why this solved his problem because he didn't share the code itself... but this is an interesting way for the code to wait a few iterations before accepting a True boolean. My guess is there's something else in the code that needs a few iterations to fully initialize.
Since it's essentially summing the integers it could also be replaced by (i*(i+1))/2 in what ever way hey wanted to do that, which would remove the dependency on the feedback node.
Going even further, he could just work out that on iteration 15 (i=14) the comparison would go true (output of additon being 105), and wire the iteration counter straight into the comparison and change it to 14.
edit: Ahhh. Having actually read the thread now, I see it's actually been mentioned. Oopsie.
Yea, the FBN and Pt-by-Pt function (along with all the convoluted logic) have a simpler implementation with Min/ Max and a SR that is properly initialized. ON THE PLUS SIDE! Pavel seems to be working hard and learning!- Jump on in.
Operating a simple 2 state (T/F) LED the hard way as seen here.
So we have four simple LEDs on the front panel that shold be red or green based on a boolean scalar.
The natural and easy way (right):
For each of the LEDs, make one state (T) green and the other (F) red and wire the booleans to the indicator terrminals.
The Rube Goldberg way (left):
- Leave the LED terminals disconnected
- Add four case structures and wire the four booleans to the selector.
- Place red or green colorbox diagram constants (a total of 8!) in the respective cases.
- bundle the colors into a cluster of two elements in four different places.
- convert it into an cluster array with one element using built array in four different places
- Create four "Colors[4]" property nodes, one for each boolean
- Wire the color cluster array to the property node.
I guess you have to see it to believe it, so here's a picture (I have moved the terminals slightly to keep the image smaller)..
(And yes, even the calling VI has two LEDs that are "operated" in exactly the same fashion. That's like operating a traffic light by sending a painter up the pole every 30 seconds to change the colors. :D)
This is a little complex way to create an array results.
Hi Bsvare! Thanks for the correction! Sometimes when I stare at LabVIEW code all day I get a little woozy and the simple solutions slip under my nose. Brilliant solution.
Is it a Rube Goldberg when you spell a word with all the wrong letters?
"Collum" ? I guess that actually means "column". 
@RavensFan wrote:Is it a Rube Goldberg when you spell a word with all the wrong letters?
"Collum" ? I guess that actually means "column".
Depends on if you have a sudden urge to touch your code and mutter "My precious", or "Filthy local variables"
You want to get the last value out of the loop? Enqueue it to a queue just waiting for the single element.
Checking to see if the first two elements of an array are what you want? Search the array for the two elements and make sure they are at indices 0 and 1.
Original code:
Simplified Code:
I just ran in to this gem while going through someone else's source code... I actually had to drop probes before I realized what he was doing with all of the multiplication.
