Instead of looking back, why not look forward? (XSLT gurus: from what I
understand, the following-sibling axis is much faster than the
preceding-sibling axis, right?)
not necessarily, but on the face of it the problem sounds ripe for
for-each-group rather than using keys and generate-id which is the
xslt 1 muenchian grouping idiom.
David
________________________________________________________________________
The Numerical Algorithms Group Ltd is a company registered in England
and Wales with company number 1249803. The registered office is:
Wilkinson House, Jordan Hill Road, Oxford OX2 8DR, United Kingdom.
This e-mail has been scanned for all viruses by Star. The service is
powered by MessageLabs.
________________________________________________________________________
--~------------------------------------------------------------------
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
To unsubscribe, go to: http://lists.mulberrytech.com/xsl-list/
or e-mail: <mailto:xsl-list-unsubscribe(_at_)lists(_dot_)mulberrytech(_dot_)com>
--~--