RE: [DUG]: Dynamic Arrays V Strings Lists

[Myles Penlington]

Dynamic array will always be faster.

The under lying implementation of TList is really a dynamic array also, so the only overhead is the accessor method and range check performed.

Myles.

 

-----Original Message-----
From: David Smith [mailto:[EMAIL PROTECTED]]
Sent: Thursday, 1 November 2001 5:01 p.m.
To: Multiple recipients of list delphi
Subject: [DUG]: Dynamic Arrays V Strings Lists

Hi,

 

Any one have ideas or experience if Dynamic arrays or string\object lists is faster for accessing an element.

 

Am developing an application where microns (maybe microseconds) for accessing an item in a list over 500 000 items (about 1500 bytes each) based on an index is very important. 

 

Thanks,

David.