Could anyone elaborate on the "optimization" around Field-marks. A while
back, I started avoiding traditional references to dynamic arrays
(array<counter>) within loops because of the inefficiencies of having to
traverse the array from the first character to the desired attribute
during each iteration of the loop. I traditionally use a LOOP + REMOVE
construct which seems to be much faster.
Is there some sort of Unidata optimization related to Field
marks/Attribute marks that I am not aware of as referenced by Rex in the
comment below or is this just a Universe thing?
Dan Eichholz
Internet Production, Inc.
651-717-4323
[EMAIL PROTECTED]
David,
In terms of "which is better" for sorting inside a program, working with
in-memory strings should be faster than writing to disk. And with less
than a thousand names, it probably won't be noticeably faster whether
you UPCASE() each time you insert, or maintain a separate UPCASE'd variable.
I'm guessing that you'll also have an ID value associated with the name;
that means LOCATE'ing on values. Field-marks in Universe (and I'm
guessing in Unidata too) are optimized for traversing back and forth.
Value-marks aren't, so when you INSERT a value after a LOCATE, the
run-machine has to start at character one and find each value until it
hits the specific value mark count. Ideally, you should be using
field-mark delimited lists, but practically I don't think it would be
noticeable.
rex
-------
-------
u2-users mailing list
u2-users@listserver.u2ug.org
To unsubscribe please visit http://listserver.u2ug.org/
