Re: Finding deepest node

Play the video

Subject: Re: Finding deepest node
From: marcus <m-lists@xxxxxxxxxx>
Date: Fri, 02 Dec 2005 21:37:21 +0100

Jon Gorman wrote: > Well......what do you mean by farthest away? I'm sure it's probably possible.

When I say farthest away I mean the node that has the most nodes between itself and the context node in a straight line (not counting siblings).

.//node[@a = 'avalue' and max(count(ancestor::*))]/@id

I know that isn't a valid expression but I hope you know what I mean

Example:

<nodes>
 <node a="1" id="1"/>
 <node a="2" id="2">
  <node a="1" id="3">
   <node a="1" id="3.1"/>
  </node>
  <node a="1" id="4"/>
 </node>
 <node a="2" id="5">
  <node a="1" id="6">
   <node a="1" id="7"/>
  </node>
 </node>
</nodes>

Say that a node must have @a=1 to be selectable.

In this example the nodes with @id=3.1 and @id=7 are furthest away from <nodes> and have a distance of 3. @id=3, @id=4, @id=6 have a distance of 2 and so on.

/Marcus

Current Thread
Finding deepest node marcus - 2 Dec 2005 19:57:33 -0000 Jon Gorman - 2 Dec 2005 20:08:05 -0000 Michael Kay - 2 Dec 2005 20:42:17 -0000 marcus - 2 Dec 2005 21:00:20 -0000 <= Message not available Jon Gorman - 3 Dec 2005 00:22:29 -0000 <Possible follow-ups> marcus - 3 Dec 2005 00:09:11 -0000

<- Previous	Index	Next ->
RE: Finding deepest node, Michael Kay	Thread	Re: Finding deepest node, Jon Gorman
How to find out if the preced, Nadia . Swaby	Date	RE: How to find out if the pr, Michael Kay
	Month

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

RSS 2.0
Atom 0.3

XML Editor - Download a 15 Day Free Trial Now >

See What's New in Stylus Studio >

Buy Stylus Studio - XML Editor - Now >