[XSL-LIST Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message]

Re: XPATH question

Subject: Re: XPATH question
From: "Mukul Gandhi" <gandhi.mukul@xxxxxxxxx>
Date: Wed, 6 Dec 2006 20:36:41 +0100
Re:  XPATH question
Please try the technique illustrated in the following stylesheet:

<?xml version="1.0" encoding="UTF-8" ?>
<xsl:stylesheet version="1.0" xmlns:xsl="http://www.w3.org/1999/XSL/Transform">

<xsl:output method="text" />

 <xsl:template match="/test">
   <xsl:value-of select="count(B[generate-id() =
generate-id(following-sibling::C[1]/preceding-sibling::B[1])])" />
 </xsl:template>

</xsl:stylesheet>

The above stylesheet prints 2, when applied to the given XML.


On 12/6/06, Ken Tam <kentam@xxxxxxxxxxxxxxx> wrote:
Hi all,

I would like to count the number of occurence from B -> C but not the
overlaps. For example,

<test>
       <A></A>
       <B></B>
       <F></F>
       <C></C>
       <D></D>
       <B></B>
       <C></C>
       <E></E>
       <C></C>
       <C></C>
</test>

Only,

B->F->C
B->C

should be counted. I tried /test/B/following-sibling::*[contains(name(),
'C')] but this doesn't work as the other "C" siblings are counted as well.
This is the expected behavior of following-sibling. How can I filter out the
unwanted siblings?

Thanks,
kkt


--
Regards,
Mukul Gandhi

Current Thread

PURCHASE STYLUS STUDIO ONLINE TODAY!

Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced!

Buy Stylus Studio Now

Download The World's Best XML IDE!

Accelerate XML development with our award-winning XML IDE - Download a free trial today!

Don't miss another message! Subscribe to this list today.
Email
First Name
Last Name
Company
Subscribe in XML format
RSS 2.0
Atom 0.3
Site Map | Privacy Policy | Terms of Use | Trademarks
Free Stylus Studio XML Training:
W3C Member
Stylus Studio® and DataDirect XQuery™are products from DataDirect Technologies, is a registered trademark of Progress Software Corporation, in the U.S. and other countries. © 2004-2007 All Rights Reserved.