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

Re: parsing a complex xml tree into simple trees (a c

Subject: Re: parsing a complex xml tree into simple trees (a challenging problem at least for me :)
From: drkm <darkman_spam@xxxxxxxx>
Date: Wed, 9 Nov 2005 22:21:00 +0100 (CET)
Re:  parsing a complex xml tree into simple trees (a  c
David Carlisle wrote:

>  <xsl:param name="a" select=".//text()[contains(.,',')][1]"/>
> would be better as
>                              descendant::text()[contains(.,',')][1]

> which does what I intended (select the first node with a comma)
> although actually i think it doesn't make any difference here
> as $a is always used where XSLT1's implied first-node semantics
> will mean that the extra nodes that are selected when // is used
> don't do any harm.

  Mmh.  I don't understand what's the difference between the two
expressions.  You say that in the first one, the result is a node-set
which count() may be greater than 1, with the test "[1]".  Could you
please explain a bit further?

  Thanks,

--drkm



















	

	
		
___________________________________________________________________________ 
Appel audio GRATUIT partout dans le monde avec le nouveau Yahoo! Messenger 
Tilichargez cette version sur http://fr.messenger.yahoo.com

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-2013 All Rights Reserved.