New Array Collector Primitive

[smmarlow]

Getting the best performance while accumulating array values for display can take up a bit of space.  I propose a new primitive, either an array primitive or a node structure (like the feedback node) that accumulates an array of a specific size.  It should be smart and size itself automatically if dropped into a loop, the way indexing output tunnels do.  It should also keep track of how many times it has been called and return only the points collected, or the last N points if the size input is wired.  It is functionally equivalent to the "Collector" express VI, but has the ability to automatically size itself, accept a wired size input, and is truly polymorphic.  It would also put the best of memory management to work by NI's clever engineers to maximize performance. Here is my best shot at its implementation as an array primitive:

[Darren]

Any idea that has received less than 6 kudos within 6 years after posting will be automatically declined.

[Manzolli]

The core idea, in some way, looks like the Waveform Chart without the FP element, which the buffer's size (Chart History Length) allocation cannot be changed once the program has begun execution, due to performance issues.

How about start from a Waveform Chart (obviously without the FP) that has additionally a Boolean reset and accepts many types of data? Even though it has some limitations, I think this it would be easier to be implement.