[fpc-pascal] about dynamic array

[spir ☣]

On Thu, 6 May 2010 16:20:58 +0200
José Mejuto <joshyfun at gmail.com> wrote:

> Hello FPC-Pascal,
> 
> 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).
> 

Thank you very much, José & Henry, have the information I needed. I'll use TList for all kinds of flexible & ordered sequences.

Denis
________________________________

vit esse estrany ☣

spir.wikidot.com