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

RE: : Finding the deepest node(s)

Subject: RE: : Finding the deepest node(s)
From: "Michael Kay" <michael.h.kay@xxxxxxxxxxxx>
Date: Tue, 18 Jun 2002 14:11:00 +0100
finding the deepest node c
> -----Original Message-----
> From: owner-xsl-list@xxxxxxxxxxxxxxxxxxxxxx 
> [mailto:owner-xsl-list@xxxxxxxxxxxxxxxxxxxxxx] On Behalf Of 
> TSchutzerWeissmann@xxxxxxxxxxxxxxxx
> Sent: 18 June 2002 11:56
> To: xsl-list@xxxxxxxxxxxxxxxxxxxxxx
> Subject: : Finding the deepest node(s)
> 
> 
> Is there an XPath to find the deepest node(s) in some xml, ie 
> the node(s) with more parents than any others?

Not in a single XPath expression, because existential quantification is
only available when comparing nodes according to their string-value.

Try the higher-order Saxon extension functions:

saxon:highest(//node(), saxon:expr('count(ancestor::*)')

or check Dimitre's dynamic templates.

Michael Kay
Software AG
home: Michael.H.Kay@xxxxxxxxxxxx
work: Michael.Kay@xxxxxxxxxxxxxx 


 XSL-List info and archive:  http://www.mulberrytech.com/xsl/xsl-list


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.