substitute of build array function

[ZentronLV]

Can you suggest any function which works as afunction of  Build Array instead of using diectly Build Array Function.

[GerdW]

Use autoindexing…

What's the purpose of replacing such a basic function?

[ZentronLV]

Usually by using Build Array Function,it takes much time for executing when element are more than 100,since it allocates memory dyanamically(i.e one by onebehind each other).SO,We have to avoid using Build Array when we are handling more elements in a Array.

[Sam_Sharp]

If you know the expected (or maximum) size of the array then you can use the initialise array function to allocate the memory for the array in advance and then use the replace array subset function to fill the array. You will need to keep track of the index (so you know the size of the array) and the array in a shift register. 

[Eric.M]

Good : Build Array, Insert into Array

Better : Auto-index

Best : Initialize Array + N x Replace Array Subset. (+ Resize Array, if needed)

Hope this helps 🙂

[crossrulz]

---

@ZentronLV wrote:

Usually by using Build Array Function,it takes much time for executing when element are more than 100,since it allocates memory dyanamically(i.e one by onebehind each other).SO,We have to avoid using Build Array when we are handling more elements in a Array.

---

If you are dynamically building your array, it doesn't really matter what you use.  You will have the same problem.

But if you know the max size, initialize array and use Replace Array Subset is definately the way to go.

[Hooovahh]

Yup as others have said.  Preallocate, then use replace.  I believe the conditional concatenating terminal out of a for and while loop, first had a normal build array being used behind the scene.  Users in 2012 noticed this performance wasn't that great, and could code better conditional indexing functions, by pre-allocating.  Since then NI has improved the performance and I suspect it uses the pre-allocate method.

[altenbach]

---

@ZentronLV wrote:

Usually by using Build Array Function,it takes much time for executing when element are more than 100,since it allocates memory dyanamically(i.e one by onebehind each other).SO,We have to avoid using Build Array when we are handling more elements in a Array.

---

You need to be much more specific what you are trying to do. Maybe show us some code.

• Is the building a one-time thing or over and over inside a loop?
• Do you know the final array size?
• How do you measure the execution time?
• The definition of dynamic allocation is not "onebehind each other". Arrays are contiguous in memory, so if space runs out, the entire array needs to be moved to a sufficiently large stretch of memory elsewhere.
• You don't have to avoid "build array", you have to avoid constant resizing of your arrays, no matter what tools you use. This means you potentially need to rewrite certain code sections.