RE: [xsl] Counting nodes processed

["Michael Kay" <michael.h.kay@xxxxxxxxxxxx>]

If there are 1000 topics then looking at each of them to see if it has less
than 5 preceding nodes might mean 500,000 node accesses. A 5-deep recursion
would be far better.

Michael Kay
Software AG
home: Michael.H.Kay@xxxxxxxxxxxx
work: Michael.Kay@xxxxxxxxxxxxxx

> -----Original Message-----
> From: owner-xsl-list@xxxxxxxxxxxxxxxxxxxxxx
> [mailto:owner-xsl-list@xxxxxxxxxxxxxxxxxxxxxx]On Behalf Of Thomas B.
> Passin
> Sent: 04 March 2002 18:24
> To: xsl-list@xxxxxxxxxxxxxxxxxxxxxx
> Subject: Re: [xsl] Counting nodes processed
>
>
> [Michael Kay]
>
> > Use <xsl:if test="count(preceding::topic) &lt; 5">.
> >
> > That will work, but probably not very efficiently. A more
> sophisticated
> > approach would be to use a recursive named template to
> process the first
> > four topics and then stop.
>
> It may be inefficient but it's only done once.  If the number
> is small, it
> won't matter anyway.  If the bound is large, wouldn't it
> still be quicker
> than calling the template recursively and checking the bound
> each at each
> invocation?  That was my assumption, at any rate, but you're the
> implementer.
>
> Cheers,
>
> Tom P
>
>
>  XSL-List info and archive:  http://www.mulberrytech.com/xsl/xsl-list
>


 XSL-List info and archive:  http://www.mulberrytech.com/xsl/xsl-list