Subject: Re: [xsl] sort | uniq via keys From: Saverio Perugini <sperugin@xxxxxxxxxxxxxxxx> Date: Fri, 15 Feb 2002 17:18:54 -0500 (EST) |
On Thu, 14 Feb 2002, Wendell Piez wrote: > Another way is by ordering the way you traverse the tree, and using keys as > you are now doing only to control the uniqueness. > > (Of course, it's still going to test uniqueness relative to the entire > document, not just to the level you're on; if you want the latter, you have > to use different keys as above.) > > The much maligned and abused <xsl:for-each> can be applied to this. From > the root, for-each select="*" will get you only one level deep, > select="*/*" will get you only two levels deep, and so on. (In these > XPaths, the child:: axis is implicit, so e.g. */* is short for > child::*/child::*, that is grandchildren.) I prefer this approach because I do want uniqueness relative to the entire document. Does this approach however require me to know a-priori how deep the tree is so I know how many */*/.../* to include? Thank You and Best Regards, Saverio Perugini XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
Re: [xsl] sort | uniq via keys, Wendell Piez | Thread | Re: [xsl] sort | uniq via keys, Joerg Pietschmann |
Re: [xsl] xsl:include with plain te, Peter Davis | Date | Re: [xsl] Apache FOP Console Messag, Mulberry Technologie |
Month |