One point of speculation which would make a huge difference is how Rev
is actually implementing the arrays. If it is truly a hash table,
providing any sort of in-order traversal of the array elements won't
be happening any time soon. A hash table is an unordered piece of
data, and so to provide any sort of built-in sorting, RunRev would
have to implement workarounds under the hood similar to what people
are already scripting. On the other hand, if they are using something
more like red-black trees, it is trivial to walk the tree in order and
return the elements. Or backwards. Or "next" and "prev" functionality.
But... I have no idea what data structure they are using.
-- Ok, this an important clue why I see and sense some missing aspects/
functionality etc in the new arrays.
And I fear it may mean a much longer time before really, really true
Arrays are fully in Rev.
I don't want or need clever hacks to do simple things that the
language should be doing for me.
Yes, its good mental exercise figuring what's it all about, but why
waste that time.
I rather work smart than hard, for what's an x-talk for?
Besides, why is there not a full tutorial explaining you can or cant
do with the new arrays???
Shalom, Andrew
{Choose Life, Create Hope, Nurture Love, Wrestle Faith...}
_______________________________________________
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
