09-13-2005 04:34 PM
09-13-2005 05:36 PM
09-13-2005 06:22 PM
09-13-2005 06:24 PM
You might be able to see a speed up by using 9 1d arrays of strings. The indexing will be simpler. Since you also have fixed array sizes, you can use byte arrays instead of strings but this can complicate the code. I would suggest posting your code if possible, it is easiest for someone to fine if you are overlooking something.
09-13-2005 06:57 PM
09-13-2005 07:30 PM
09-13-2005 11:00 PM
OK, I made a few wild guesses about the data file and coded an alternative version (LabVIEW 7.1). It generates the same resuts as your code but seems simpler. Assumptions:
I don't understand the purpose of the "Group Selection Array, Lowest to highest". Is this something the user is supposed to be able to modify at runtime? You only take 8 elements, skipping element 0 and indexing nonexisting element 9. Remember that LabVIEW indices start with zero, thus I added a "-1". Once this is done, the convoluted FOR loop code simply acts as a "transpose" function. Maybe that's all you need.
Do you really need to transpose?
See if it is any faster with your real data. There are probably a few improvements possible. 🙂
09-14-2005 06:32 AM
That would work if your array elements were fixed-size (i.e. I32). But strings are variable sized. Each string has to be allocated. When you initialize each element to a large string, you create more work because you alocate all those empty strings, and then de-allocate them and replace them with another allocated string.
Blog for (mostly LabVIEW) programmers: Tips And Tricks
09-14-2005 06:38 AM
If you want to delete the top row of an array, then delete the top row in the array, don't delete the elements one by one. Remember that DELETE FROM ARRAY will have to re-arrange memory to accomodate the shrinking array EVERY TIME.
Better yet, just extract rows 1-9999 - don't try to delete row 0.
Blog for (mostly LabVIEW) programmers: Tips And Tricks