This is the mail archive of the
xsl-list@mulberrytech.com
mailing list .
Re: Finding the maximun number of nodes
- To: Jeni Tennison <mail at jenitennison dot com>
- Subject: Re: [xsl] Finding the maximun number of nodes
- From: Dimitre Novatchev <dnovatchev at yahoo dot com>
- Date: Mon, 8 Jan 2001 22:59:27 -0800 (PST)
- Cc: xsl-list at lists dot mulberrytech dot com
- Reply-To: xsl-list at lists dot mulberrytech dot com
Jeni,
To be able to minimise the depth of recursion is something ***very
important*** when confronted with the reality of some wellknown
vendours' XSLT processors crashing during deep recursive processing.
In fact SAXON's been the only XSLT processor that has been confirmed by
its author to implement tail recursion via iteration.
Cheers,
Dimitre.
--- Jeni Tennison <mail@jenitennison.com> wrote:
> The recursive depth of this will always be N, but on the other hand
> you only work out the number of child nodes for each node once.
__________________________________________________
Do You Yahoo!?
Yahoo! Photos - Share your holiday photos online!
http://photos.yahoo.com/
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list