Subject: Re: [xsl] Applying xsl to a resulttree. From: jborella@xxxxxxx Date: Fri, 13 Dec 2002 12:13:08 +0100 (CET) |
> jborella@xxxxxxx wrote: > You should use a recursive, functional approach. Thank you for the answer, but I am more focused on the dynamic programming aspect of the recursion. In my example calc1 would be calculated twice, while one time should do it. To rephrase my question I would like being able to use dynamic programming in xsl (a simpler example than mine would be fibonacci numbers in linear time, although it could be solved without dynamic programming as well). XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
Re: [xsl] Applying xsl to a resultt, Mike Brown | Thread | AW: [xsl] Problem on: Cascading xsl, "Braumüller, Hans" |
Re: AW: [xsl] Problem on: Cascading, "Braumüller, Hans" | Date | [xsl] dinamic sorting question, Aniceto Lopez |
Month |