Subject: Possible new key() function (Was: Re: [xsl] Finding the maximun number of nodes) From: Dimitre Novatchev <dnovatchev@xxxxxxxxx> Date: Mon, 8 Jan 2001 04:15:04 -0800 (PST) |
> key('mykey', saxon:expression('. > $minValue')) Most convenient would be: key-greater(keyName, value) Whether the following will be useful: key-greater(keyName, nodeset-expression) doesn't seem immediately obvious. Cheers, Dimitre. --- Jeni Tennison <mail@xxxxxxxxxxxxxxxx> wrote: > > As for wishes for new features in the next versions of XSLT, it is > > obvious that the speed of many such algorithms will be considerably > > increased by using a modification of the key() function that > returns > > a nodeset of all nodes with value ***greater than given value*** > for > > a named key. > > If there was a variety of key() that allowed you to retrieve all > keyed > nodes (for example key() without the second argument), then you could > do things like: > > key('mykey')[. > $minValue] > > to the same effect, but yes it would probably be more efficient if > the > key value test could be done behind the scenes. Something like: > > key('mykey', saxon:expression('. > $minValue')) > > Adding this kind of functionality to key() would be useful for all > those people who want to retrieve nodes with key values that *start > with* something and so on, as well. __________________________________________________ Do You Yahoo!? Yahoo! Photos - Share your holiday photos online! http://photos.yahoo.com/ XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
Re: [xsl] DTD Problem, Richard Light | Thread | Re: Possible new key() function (Wa, Jeni Tennison |
Re: [xsl] Re: topological sort, Jeni Tennison | Date | [xsl] [ANN] RenderX: XEP 2.01 rele, Nikolai Grigoriev |
Month |