Enhancement to "Array Max and Min PtByPt" function

[sbus]

The current behavior of the ""Array Max and Min PtByPt" library VI is to return only  the FIRST occurrence of an element in the input array that is the minimum or maximum value. If the array contains data for which each element is unique, that's fine. But if the data is NOT unique, and more than one element can contain the same value, this routine could provide considerably more functionality by returning ALL min/max element indices.This is in fact the current behavior of the "Array Max and Min" library VI.

I'd like to see the "Array Max and Min PtByPt" library VI updated to match the behavior of the "Array Max and Min" fucntion, namely that instead of returning only the index of the first min/max element found, it would return arrays of indices for ALL max/min elements found.

The implementation of the functions that process arrays intact (like "Array Max and Min") and the functions that process 'arrays' point-by-point (like "Array Max and Min PtByPt") should be both consistent and factorially implemented. The decreased functionality of "Array Max and Min PtByPt" is inconsistent and unnecessary. The full implementation would make that routine much more useful.

All of the PtByPt routines should be evaluated to see if they are consistent with their array-processing counterparts.

[Ironman99]

Sorry, but there is no inconsistency in the behaviour of the Array Max and Min and the Array Max and Min PtByPt primitives.

In fact both VIs only return the first Max (or min) index found.

You can find an array of indexes at the output of the Array Max and Min vi, when you put a multi dimensional array on its input,

only because you need more than one index value in order to individuate the (single) cell in wich the Max (or min) has been found.

Unfortunately this means that, in both libraries, the Max and min functions do not work as you wish.

Cheers.

[Darren]

Any idea that has not received any kudos within a year after posting will be automatically declined.