BreakPoint
Rube Goldberg Code
To get the distance between two complex points, we can do it the hard way (image) or the easy way (insert).
In this thread, the poster uses split array to break a 1-D array into 2 parts at some index value, then puts it back together again. Then jams it all into a cluster with some odd numerics that is somehow supposed to connect with a waveform graph.
http://forums.ni.com/ni/board/message?board.id=170&view=by_date_ascending&message.id=395848#M395848
In this post we find that we have to use a great big 2D array to use a searching mechanism in order to convert an hour:minute string to a simple index.
The polynomial fit outputs an array of polynomial coefficients, that can be used to calculate the function for a random set of x values.
Uses stuck in ancient text based code mindsets would of course immediately gravitate to the formula node (with typos):
Prould dataflow pupils would of course translate it literally to wires and primitives.
The problem with both solutions is scaleability. Whenever the poly order changes, the code needs to be rewritten from scratch. It will also get a bit ugly for e.g. a 12th order polynomial. 😄
Of course one would think that the geniuses at NI would have come up with a tool that streamlines this often used task, and in fact there is the "polynomial evaluation" . Fully scalable. It automatically adapts to any polynomial order. Use it!
(spotted here)
altenbach wrote:The polynomial fit outputs an array of polynomial coefficients, that can be used to calculate the function for a random set of x values.
Uses stuck in ancient text based code mindsets would of course immediately gravitate to the formula node (with typos):
Prould dataflow pupils would of course translate it literally to wires and primitives.
The problem with both solutions is scaleability. Whenever the poly order changes, the code needs to be rewritten from scratch. It will also get a bit ugly for e.g. a 12th order polynomial. 😄
In my defense, I had a very good reason for actually implementing it this way. Obviously the Polynomial Evaluation VI is the ultimate solution, but that wasn't the point of the code. This "interim" implementation was for demonstration in explaining the polymorphic nature of the numeric functions. Scalability or use of a nice built-in function was not what I was trying to show. 
Gabi1 wrote:can i quote your post with the pictures?
(Sure, just transfer $1000 to my paypal account first....Just kidding!)
Of course, you are free to quote anything posted here, but please include a link to the original location for reference to keep the universe in balance. 🙂
![fyp%20v03[1]_BD.png 2 KB](/ni/attachments/ni/BreakPoint/7311/1/fyp%2520v03%5B1%5D_BD.png){kind=link}
I know we don't like sequences, but...
If you're going to use a sequence, then use a sequence.
I think this structure was used to reduce the amount of space used (it could have been done in one line).
Rob
