[XSL-LIST Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message] RE: sorting using a precalculated value
k, I was ready to build a temporary tree but was wondering if I there was a cleaner solution. Thanks for the info. -- Stéphane Bailliez Software Engineer, Paris - France iMediation - http://www.imediation.com Disclaimer: All the opinions expressed above are mine and not those from my company. > -----Original Message----- > From: Michael Kay [mailto:mhkay@xxxxxxxxxxxx] > Sent: Wednesday, March 28, 2001 5:05 PM > To: xsl-list@xxxxxxxxxxxxxxxxxxxxxx > Subject: RE: sorting using a precalculated value > > > You can only sort on a value that you can express using an > XPath expression. > There's no scope for using XSLT in the calculation unless you > either (a) use > something like saxon:function, or (b) build a temporary tree > containing the > calculated sort keys, and then sort that (using the > node-set() extension). > > Mike Kay > > > I want to have the following output (ie, class name must be > > built and the > > whole stuff sorted) > > > > AOuterClass > > OuterClass1 > > OuterClass1.InnerClass > > > > > > > XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list > XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
|
PURCHASE STYLUS STUDIO ONLINE TODAY!Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced! Download The World's Best XML IDE!Accelerate XML development with our award-winning XML IDE - Download a free trial today! Subscribe in XML format
|