Hi, Volker and Ladislav,
Volker Nitsch wrote:
>
> aha! hmm2: all this inserting at front, and recursion? (coding)
>
...
>
> obviously you coded for example, not performance ;)
>
Absolutely! I'm under no illusion that the sample code offered
was the best algorithm/approach for the problem. That the first
version was just leftovers from some benchmarking I had done a
while back -- it was just the first fragment of code that came
to hand that had some deeply-nested expressions.
I assure one and all that I do NOT recommend constructing
blocks from right to left!
Of course, that sentence betrays that my native/habitual language
is Indo-European-based (reading left-to-right) rather than Hebrew
or Arabic (reading right-to-left) or ancient Greek (when written
in boustrophedon).
-jn-
--
; Joel Neely joeldotneelyatfedexdotcom
REBOL [] do [ do func [s] [ foreach [a b] s [prin b] ] sort/skip
do function [s] [t] [ t: "" foreach [a b] s [repend t [b a]] t ] {
| e s m!zauafBpcvekexEohthjJakwLrngohOqrlryRnsctdtiub} 2 ]
--
To unsubscribe from this list, please send an email to
[EMAIL PROTECTED] with "unsubscribe" in the
subject, without the quotes.
