[fpc-pascal] about dynamic array

["Vinzent Höfler"]

> 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).

Implementing a dynamic array via a list implementation which is based on a dynamic array. Sure, that's faster.
-- 
GRATIS für alle GMX-Mitglieder: Die maxdome Movie-FLAT!
Jetzt freischalten unter http://portal.gmx.net/de/go/maxdome01