Subject: Re: [xsl] General algorithm for finding nodes between PIs From: "Martin Honnen martin.honnen@xxxxxx" <xsl-list-service@xxxxxxxxxxxxxxxxxxxxxx> Date: Thu, 26 Jan 2017 20:31:11 -0000 |
On 26.01.2017 20:45, Rick Quatro rick@xxxxxxxxxxxxxx wrote:
I have XML with a bunch of different processing instructions in them; here is a sample:
<?xml version="1.0" encoding="UTF-8"?> <info> <?Fm Condstart VbV-VCO?> <p>For this, use <b>that </b>to do that.</p> <?Fm Condend VbV-VCO?> <p><?Fm Condstart USB?>If you need this, do that.<?Fm Condend USB?></p> </info>
For each "pair" of processing instructions (Condstart and Condend with the same string), I want to find all of the nodes between them.
Are the matching pairs always sibling nodes? Or can they be at different nesting levels?
In case of siblings it sounds like an easy job for for-each-group group-starting-with="processing-instruction('Fm')"/for-each-group group-ending-with.
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
Re: [xsl] General algorithm for fin, Martin Honnen martin | Thread | Re: [xsl] General algorithm for fin, Michael Kay mike@xxx |
Re: [xsl] General algorithm for fin, Martin Honnen martin | Date | Re: [xsl] General algorithm for fin, Michael Kay mike@xxx |
Month |