Hi, Ladislav,
Ladislav Mecir wrote:
>
> I would like to comment the speed of the INS1 algorithm:
>
> <<
> out: clear ""
> parse/all s [
> any [
> start: thru "..." end1: any "." (
> insert/part tail out start back end1
> )
> ]
> ]
> insert tail out start
> out
> >>
>
> The way the algorithm is designed gives it an unfair advantage
> when it is timed in a loop where it is executed more than once...
>
Good observation for follow-up; thanks!
I'll be glad to make a version that uses COPY "" and re-run the
benchmarks with both.
-jn-
--
"This sentence contradicts itself -- no actually it doesn't."
-- Doug Hofstadter
joel<dot>neely<at>fedex<dot>com
--
To unsubscribe from this list, please send an email to
[EMAIL PROTECTED] with "unsubscribe" in the
subject, without the quotes.
