Hi,
Tempore 10:20:15, die 09/22/2005 AD, hinc in
xsl-list(_at_)lists(_dot_)mulberrytech(_dot_)com scripsit geoff hopkins
<geoffhopkins123(_at_)yahoo(_dot_)com>:
when it finds A (start point) it moves onto the node
and starts reading until it finds the next occurence
of B (stop point). When it finds the next occurance
of A it then follows the same rule stated above.
And so on...there could be one occurance of START/STOP
points or multiple.
There are numerous ways to reach the goal you state, but one that seems to
follow your pseudo-algorithm rather closely is this one:
<xsl:stylesheet version="1.0"
xmlns:xsl="http://www.w3.org/1999/XSL/Transform";>
<xsl:output method="xml" indent="yes"/>
<xsl:template match="root">
<xsl:copy>
<xsl:apply-templates select="item[1]"/>
</xsl:copy>
</xsl:template>
<xsl:template match="item">
<xsl:if test=".!='A'">
<xsl:copy-of select="."/>
</xsl:if>
<xsl:apply-templates select="following-sibling::item[1]"/>
</xsl:template>
<xsl:template match="item[.='B']">
<xsl:apply-templates select="following-sibling::item[.='A'][1]"/>
</xsl:template>
</xsl:stylesheet>
regards,
--
Joris Gillis (http://users.telenet.be/root-jg/me.html)
«Error, keyboard not found— press F1 to continue» , BIOS
--~------------------------------------------------------------------
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>
--~--