Joel Neely wrote: > > > Again we get five references to the same word! > > > > Five different words, but bound to the same context and thus > > referring to the same value. (Well, maybe this makes them "the > > same" to you... I don't want to start a new thread on mutability > > and sameness... ;-) > > > > (Nor do I, but if "same" means indistintuishable... ;-) [...] > which makes me think that words with identically-spelled names bound > to one context are (or become, or whatever...) the "same" word.
But I think there's difference between "five references to the same word" and "five words wich are the same". Anyway, probably we should not worry about these implementation details... > I was setting up to make the point that taking out the overhead for > non-recursive cases simply means that there's an overhead delta for > using recursion. For instance ... Indeed, but recursion is implemented without rebinding too, so it is quite fast. > shows that the recursive version takes about 20% more time than > the iterative version. Your benchmarks are always very valuable! Thanks! Regards, Gabriele. -- Gabriele Santilli <[EMAIL PROTECTED]> - Amigan - REBOL programmer Amiga Group Italia sez. L'Aquila -- http://www.amyresource.it/AGI/ -- To unsubscribe from this list, please send an email to [EMAIL PROTECTED] with "unsubscribe" in the subject, without the quotes.
