Hi Olivier, << is it possible to get complexity, memory structure, and performances, of rebol's elements, and more particularly rebol's list and blocks data types and algorithms ? >>
I don't think they publish that information, as it could change in the future. The few notes they do give are that you should use a HASH when you plan to do a lot of lookups and a LIST if you will be doing lots of additions and deletions. Assuming they are appropriately named, I would guess they use a hash table and a linked-list respectively. Was there something specific you wanted to know. Sometimes a member of the RT team will chime in with great technical details you have a specific question. --Gregg -- To unsubscribe from this list, please send an email to [EMAIL PROTECTED] with "unsubscribe" in the subject, without the quotes.
