For loop arrays

[b_lee]

Is there any way to get rid of the first value that the for loop puts into the auto indexed array? I am taking the average of the array elements but the first element is always invalid. Can I get rid of the first element before or after the array is created?

[daijoubu]

You could use the array subset vi.

[altenbach]

You could also built your array in a shift register and have the built array node in a case structure that is only ON when desired.

[pacific]

I was just wondering..By invalid do you mean the first element is not a number or you just want to ignore the first element while calculating the average..in any case you can still use the Array subset vi.

-Prashant.

[b_lee]

I mean that the first number for some reason is an off reading...and I dont have time to find out why so I would much rather ignore it. Thanks for the help Fellas.

[altenbach]

Here's an example showing three possibilities to skip element # zero (LabVIEW 7.0):

[daijoubu]

For bonus points (and to help me learn)...
What are the advantages of each method Altenbach?

[jasonhill]

"Trimmed" is the easiest.  Easiest to wire.  Easiest to read.  A little wasteful, because you created one more value than you actually needed.  However, you do not need to know a piori how many instances you need.

"Built" is the least efficient in memory and speed.  You will not notice much of a difference in such a small array, but you will get killed in larger ones.  It does have a small advantage in not using the invalid first datum.  Similar to "trimmed", you do not need to know ahead of time how many data values are involved.

"Replaced" is the most memory and speed effienct.  You do have to know exactly how big an array to build beforehand.

[altenbach]

Well, the top method would get complicated very quickly once you want to drop random element positions. 😉

The other two methods depend a bit on the circumstances:

The middle method is simple and "good enough" for small arrays. It is preferred if the output array is only very small (i.e. only a small percentage of elements are kept)

The bottom method is probably most efficient for very large arrays. It would need to be modified a bit for random element skips. Easiest would be to allocate the same size as N of the loop, then trim the output to the size of the lower (blue) shift register after the loop.

If this is critical code, you should test various version and see which one is best for your particular scenario.