I propose to replace Max & Min for two elements, which we could resize like some array functions for 3, 4, 5,... elements when you know how many you have to compare.
I actually have 5 elements coming from a bundle, I have to do this
Jeff, I'm pretty sure you mean "Cluster to Array". But even that only solves the exact example given. If you just have a bunch of independent values to compare, you would just use the Build Array. I'm not seeing much use in the proposed construct.
There are only two ways to tell somebody thanks: Kudos and Marked Solutions Unofficial Forum Rules and Guidelines "Not that we are sufficient in ourselves to claim anything as coming from us, but our sufficiency is from God" - 2 Corinthians 3:5
There would be a performance benefit to not actually constructing the array. But the use case is pretty rare. I've done it a couple times in my carreer for three values -- and in LV that's easy enough to code up with a Select node (use some form of the trinary operator in most other languages). Never had reason to do it for more than that except when the data came in as an array in the first place.
Now that's a nice idea enhancement, just wire the cluster to min max. I'm not sure how usefull this would be for a cluster of booleans or clusters of arrays (Ragged 2D arrays) . Yeah, I think that one is a problem....but some means of sorting (1,1) and (1,1,0) is definable.
Ok guys, here's my best paintbrush skills to show my point. It's not only about clusters, just multiple values you want to compare without the harsh of creating an array of 3 values.
