Subject: Re: [xsl] sort / unsort From: Mike Brown <mike@xxxxxxxx> Date: Thu, 8 Aug 2002 23:09:47 -0600 (MDT) |
Mike Berrow wrote: > Does anyone see a better way? I was going to try the Kay/Becker/Holman technique from the FAQ. http://www.dpawson.co.uk/xsl/sect2/muench.html#d197e74 That is, find the difference between all the nodes and the sorted nodes to get the remaining nodes. No need for generate-id(); count() and != ought to work nicely. - Mike ____________________________________________________________________________ mike j. brown | xml/xslt: http://skew.org/xml/ denver/boulder, colorado, usa | resume: http://skew.org/~mike/resume/ XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
Re: [xsl] sort / unsort, Mike Berrow | Thread | Re: [xsl] sort / unsort, Mike Berrow |
[no subject], Phillip Rhodes | Date | [xsl] Re:, Joerg Heinicke |
Month |