RE: [xsl] topological sort

Subject: RE: [xsl] topological sort
From: "Michael Kay" <mhk@xxxxxxxxx>
Date: Thu, 9 Oct 2003 08:41:04 +0100
> The algorithm is O(n^2) for a simple XSLT processor, but it would be 
> O(n) if the XSLT processor was smart enough to cache the 
> values returned 
> from the computeWeight(node) function.  Does saxon do this?  Maybe it 
> would if I used keys.

You can set saxon:memo-function="yes" on xsl:function to cause this

Michael Kay

 XSL-List info and archive:

Current Thread