|
[XSL-LIST Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message] Re: General algorithm for finding nodes between PIs
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: 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.
|
PURCHASE STYLUS STUDIO ONLINE TODAY!Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced! Download The World's Best XML IDE!Accelerate XML development with our award-winning XML IDE - Download a free trial today! Subscribe in XML format
|

Cart








