> > Access to items in property lists is typically faster than linear lists.
>
>I don't think so. All tests are fallible, but try this - it seems that
>linear lists have a very slight edge over accessing a prop list by position,
>and a much better edge over accessing a prop list through a property.
No arguments, Kurt. There are indeed cases where linear lists are faster,
like when you know the position of the item you are retrieving.
Again, I am guilty of over-simplification, but at least this time I said
"generally" :-)
Let me put it another way--access to items in property lists is faster when
you're matching a value.
A fair test would be to compare getOne() with getProp(). You will find the
property list much faster. A sorted linear list will be faster than
unsorted, of course, but still not as fast as a property list.
Cordially,
Kerry Thompson
Learning Network
[To remove yourself from this list, or to change to digest mode, go to
http://www.penworks.com/LUJ/lingo-l.cgi To post messages to the list,
email [EMAIL PROTECTED] (Problems, email [EMAIL PROTECTED])
Lingo-L is for learning and helping with programming Lingo. Thanks!]
