[XSL-LIST Mailing List Archive Home] [By Thread] [By Date]

Re: [xsl] Finding deepest node

Subject: Re: [xsl] 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
[xsl] 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: [xsl] Finding deepest node, Michael Kay	Thread	Re: [xsl] Finding deepest node, Jon Gorman
[xsl] How to find out if the preced, Nadia . Swaby	Date	RE: [xsl] How to find out if the pr, Michael Kay
	Month

© 2002-2008 SyncRO Soft Ltd. All rights reserved.
                                             | Sitemap | Privacy Policy 
 This website was created & generated with
                                             <oXygen/> XML Editor