[fpc-pascal] about dynamic array
joshyfun at gmail.com
Thu May 6 16:20:58 CEST 2010
Thursday, May 6, 2010, 3:53:59 PM, you wrote:
c> TList wraps TFPList, which is based internally on an array. So access
c> is fast; insertion, deletion not.
But it is faster than inserting elements in a dynamic array (unless
reference counted ones) because it usually moves less amount of data
(4/8 bytes per element).
More information about the fpc-pascal