MoraleC2
Member
I have a task that could easily be solved using a 2-dimensional array using a ControlLogix processor, V32+. Basically it will loop through two different arrays and build a list of indices associated with another list of indices. So it's a simple matter of:
I know 2-dimensional arrays take a toll on performance, but I don't know how they would compare to, say, an array of UDT instances that have an array in each. My question is: which would be more efficient from an execution time perspective: processing a 2-dimensional array - e.g., indices[x,y] - or an array of UDT instances that are arrays - e.g., incides1[x].indices2[y]?
Thank you for your time.
for x:=0 To MaxX Do
for y:=0 To MaxY Do
<code>;
End_For;
End_For;
I know 2-dimensional arrays take a toll on performance, but I don't know how they would compare to, say, an array of UDT instances that have an array in each. My question is: which would be more efficient from an execution time perspective: processing a 2-dimensional array - e.g., indices[x,y] - or an array of UDT instances that are arrays - e.g., incides1[x].indices2[y]?
Thank you for your time.
Last edited: