This is the mail archive of the
xsl-list@mulberrytech.com
mailing list .
Re: Re: lookup-table thoughts (was Re: matching multiple times, outputting once?
- To: xsl-list at lists dot mulberrytech dot com
- Subject: Re: [xsl] Re: lookup-table thoughts (was Re: matching multiple times, outputting once?
- From: Jeni Tennison <jeni at jenitennison dot com>
- Date: Thu, 8 Nov 2001 15:18:34 +0000
- CC: Dimitre Novatchev <dnovatchev at yahoo dot com>
- Organization: Jeni Tennison Consulting Ltd
- References: <000101c16861$73fcfa80$26816bd5@pcukmka>
- Reply-To: xsl-list at lists dot mulberrytech dot com
Mike Kay wrote:
> As for the divide-and-conquer algorithm, it looks interesting and
> performs well, but as it produces completely different output from
> the other two, I can't quite see the relevance.
Gah, yes, my idiocy. Dimitre, can you see a way of using a divide
and conquer algorithm to produce a multiply-nested tree?
<xsl:call-template name="accumDivAndConquer">
<xsl:with-param name="count" select="3" />
<xsl:with-param name="base" select="'foo'" />
</xsl:call-template>
producing:
<foo>
<foo>
<foo>foo</foo>
</foo>
</foo>
Jeni
---
Jeni Tennison
http://www.jenitennison.com/
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list