RE: [xsl] sorting using a precalculated value

[Stephane Bailliez <sbailliez at imediation dot com>]

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@iclway.co.uk]
> Sent: Wednesday, March 28, 2001 5:05 PM
> To: xsl-list@lists.mulberrytech.com
> Subject: RE: [xsl] 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