Re: Increasing sequence ?

> Hit the send button too early.
>
> With another sequence:
>
>   (1, 0, 2 to 100000)
>
> increasing2() takes 77ms, while the recursive increasing() takes only
> 4.45ms -- or that means the recursive function is about 17 times
> faster.
>
>
> Maybe the BaseX developers didn't implement proper short-cutting for
> the "every" expression.
>

Or maybe they expand 2 to 100000 into an actual list of 99999 numbers
prematurely.

Michael Kay
Saxonica