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

Re: Finding deepest node

Subject: Re: Finding deepest node
From: Jon Gorman <jonathan.gorman@xxxxxxxxx>
Date: Fri, 2 Dec 2005 14:07:26 -0600
Re:  Finding deepest node
On 12/2/05, marcus <m-lists@xxxxxxxxxx> wrote:
> I have a structure where I for example need to do the following:
>
> .//node[@a = 'avalue']/@id
>
> If I get multiple hits I only want to select the node that is farthest
> away from the context node. How would I do this with a single xpath? Is
> it possible at all?
>

Well......what do you mean by farthest away?  I'm sure it's probably
possible.

say we had a tree like so

1
1.1
1.2
1.2..3
2
2.1
2.1.2
3
3.1
4
5
5.1

(Where 1.1 indicates there is a node one level below the first node of
the top level)

If the context node is at 1, would the "farthest away" be 1.2.3, 5, 5.1?

Ie is it depth or breadth or any?

There's a couple of techniques, but if it's just linear, ie furthest
sibling away, if there are more preceeding siblings, take first() of
the set of all siblings or if there are more following siblings take
last() of the set of all siblings

Jon

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.