Subject: Re: how to optimize recursive algorithm?
From: "FC" <flavio@xxxxxx>
Date: Thu, 27 Nov 2003 22:01:26 +0100
|
This is a feature of Saxon 7.x, isn't it?
I am using 6.5.3, sigh!
Thanks,
Flavio
----- Original Message -----
From: "Michael Kay" <mhk@xxxxxxxxx>
To: <xsl-list@xxxxxxxxxxxxxxxxxxxxxx>
Sent: Thursday, November 27, 2003 19:06
Subject: RE: how to optimize recursive algorithm?
> If you work forwards through the list, you can pass the computed values
> onwards as parameters rather than recomputing them each time, which
> should make the algorithm O(n) rather than O(n^2).
>
> If you prefer, you can get the caching effect by using memoized
> functions in Saxon (saxon:memo-function="yes"), but you have to ask for
> this explicitly.
>
> Michael Kay
>
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
|
Cart
