11-17-2024, 11:20 PM
Hi Yumda,
Thanks for your question.
We know that SB arrays can be slow or even very slow for large, espacially multi-dimensional arrays.
For 1D arrays I recomment using LDList - this is fast, effiecient, easy to add, remove, sort etc and you don't have to set the max dimension size to start with (its a dynamic sizing list).
LDFastArray is designed for multi-dimansional arrays.
So, back to LDArray, which is the fastest 1D array (in C# anyway), I still probably recommend LDList since it is more flexible and probably similar performance in SB.
If you want a specific example and one of the methods, then ask, but here is a simple example of its use.
So, depending on your use, I recommend LDList for 1D, LDFastArray for multi-dimensional lists, and if you want to use LDArray and have specific questions on it, then please ask.
Thanks for your question.
We know that SB arrays can be slow or even very slow for large, espacially multi-dimensional arrays.
For 1D arrays I recomment using LDList - this is fast, effiecient, easy to add, remove, sort etc and you don't have to set the max dimension size to start with (its a dynamic sizing list).
LDFastArray is designed for multi-dimansional arrays.
So, back to LDArray, which is the fastest 1D array (in C# anyway), I still probably recommend LDList since it is more flexible and probably similar performance in SB.
If you want a specific example and one of the methods, then ask, but here is a simple example of its use.
Code:
dim = 10000
array = LDArray.Create(dim)
For i = 1 To dim
LDArray.SetValue(array,i,Math.GetRandomNumber(dim))
EndFor
TextWindow.WriteLine("Array created")
LDArray.Sort(array)
TextWindow.WriteLine("Array sorted")
For i = 1 to 10
TextWindow.WriteLine(LDArray.GetValue(array,i))
EndFor
So, depending on your use, I recommend LDList for 1D, LDFastArray for multi-dimensional lists, and if you want to use LDArray and have specific questions on it, then please ask.