I believe that it's in the nature of hash tables (which is what Rev's
arrays are, I think) that they do not preserve the order of keys.
If so, then the engine would have to maintain an ordered index
separately. This would likely affect performance, so perhaps we
wouldn't always want it...
Best,
Mark
On 14 Sep 2008, at 06:25, Ken Ray wrote:
That would do me - except the most useful would be the ability to
get the
full ordered index.
put the ordered keys of theDataA
Because you want to things like:
repeat for each key sortedKey in theDataA
I've been watching this thread and I have to ask:
"What benefit is it to the Rev developer (not the engine) to have
the keys
NOT sorted?"
I mean, I understand why the *engine* may want to keep the keys in
a special
order, but every time I work with the keys of an array, either (a)
I don't
care what order they're in, or (b) I really want them sorted.
Personally,
I've never WANTED to have the keys in an unsorted order...
Ken Ray
Sons of Thunder Software, Inc.
Email: [EMAIL PROTECTED]
Web Site: http://www.sonsothunder.com/
_______________________________________________
use-revolution mailing list
[email protected]
Please visit this url to subscribe, unsubscribe and manage your
subscription preferences:
http://lists.runrev.com/mailman/listinfo/use-revolution
_______________________________________________
use-revolution mailing list
[email protected]
Please visit this url to subscribe, unsubscribe and manage your subscription
preferences:
http://lists.runrev.com/mailman/listinfo/use-revolution
