Subject: [xsl] Re: Efficient Recursive Algorithms in XSLT (Was: Re: Constructing X number of elements) From: Dimitre Novatchev <dnovatchev@xxxxxxxxx> Date: Tue, 21 Aug 2001 11:07:38 -0700 (PDT) |
> With respect, > > We've given Ilkka the simple recursive solution. And Dimitre has reminded > us that in the general case, there are also better approaches. But Ilkka's > problem may not need to be solved in the general case. Completely agree! This is why I changed the subject. And the purpose is to show that while there are plenty of toy solutions for toy problems in the books and FAQ sites, I haven't seen a single mentioning of the heavy-duty, real champions. Also, that the parallelism that is inherent in these better algorithmic approaches could be achieved and exploited by adding support for it (e.g. a new element) in a future version of XSLT. It is up to ***us*** to correct this. In an answer, FAQ site, paper, book, ... etc., show the toy solution, but also describe the most efficient, most general and (not only because of these!) one of the most elegant solutions. Cheers, Dimitre Novatchev. __________________________________________________ Do You Yahoo!? Make international calls for as low as $.04/minute with Yahoo! Messenger http://phonecard.yahoo.com/ XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
Re: [xsl] conditional copying of no, Joerg Pietschmann | Thread | Re: [xsl] Re: Efficient Recursive A, Wendell Piez |
[xsl] conditional copying of nodes?, Hewko, Doug | Date | RE: [xsl] Weird XSL refresh problem, Hahn, Kimberly |
Month |