Re: Possible new key() function (Was: Re: [xsl] Finding the maximun number of nodes)

[Jeni Tennison <mail@xxxxxxxxxxxxxxxx>]

Hi Dimitre,

> In this case xsl:key will know in advance about all possible
> operators and could build the indexes in an optimal way in order to
> guarantee most efficient key() performance.
>
> Allowing the value of the third argument to be any (user-supplied)
> function seems elegant, but this is nothing more (in terms of
> execution speed) than a convenient shorthand.

Yes, you're absolutely right; it would also be difficult to gain much
efficiency-wise from allowing things like contains() to be used as a
third argument.  On the other hand, convenient shorthands are...
convenient :)

Cheers,

Jeni

---
Jeni Tennison
http://www.jenitennison.com/



 XSL-List info and archive:  http://www.mulberrytech.com/xsl/xsl-list