[REBOL] Re: How to use Hash index
From: greggirwin:mindspring at: 23-Aug-2003 8:46
TM> This rises up another question. Are the any known performance issues
TM> concerning filesize or numbers of blocks or depth of nesting?
Different block types are better at different things. list! values are
faster at inserting and removing items, and hash! values are faster at
looking items up. I think both have a case or two--with certain
iteration functions for example--where they behave differently than a
I don't know of any limits. The trick is to use natives whenever you
can to do the work as they can be much faster.
If you know how much data you want to handle, just generate some
random data and do some tests against it. REBOL makes it easy to do