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 |
- 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
- <Possible follow-ups>
- marcus - 3 Dec 2005 00:09:11 -0000
|
|