Showing results for 
Search instead for 
Did you mean: 

need to optimize memory management with array parsing

I have a huge array of clusters in my datasets.  I have to search the array for each element and perfrom a cased based calculation on the element depending what it is.  I want to do this without making multiple copies of the array or other bad techniques in labview.  What is the best way to do this in terms of optimizing both memory and speed?  Is there a way to parse without making a copy of the array by reference operations or something?

0 Kudos
Message 1 of 4

In general, if you don't overthink it and keep things simple, the compiler will do a good job of minimizing memory copies. There are also lots of tricks scattered around this forum that you should be able to find with some searching. Finally, if you post your code, forum members are happy to suggest improvements.

0 Kudos
Message 2 of 4

Post what you've got. As mentioned, the compiler is often very smart, and if you somehow make it hard on it, you can use DVRs to work in place.


G# - Award winning reference based OOP for LV, for free! ADDQ VIPM Now on GitHub
"Only dead fish swim downstream" - "My life for Kudos!" - "Dumb people repeat old mistakes - smart ones create new ones."
0 Kudos
Message 3 of 4

I have a huge array of clusters in my datasets.


And I'm going to ask WHY?



rethink that.......

"Should be" isn't "Is" -Jay
0 Kudos
Message 4 of 4