Hi,
I do have the following Problem. I need to find all nodes in a subtree
/AAA/BBB that don't have the same name as any name in the current context
/AAA/DDD. In the following example this would result to /AAA/BBB/KKK, because
it's the only node under /AAA/BBB that does not exist under /AAA/DDD. The
problem for me is, that not the nodes or the values of the nodes have to be
compared but the names. Does someone out there know how to do this?
Thanks in advance.
<AAA>
<BBB>
<CCC>1</CCC>
<KKK>2</KKK>
</BBB>
<DDD>
<CCC>2</CCC>
<EEE>3</EEE>
</DDD>
</AAA>
Best regards
Stephan Kahnt
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list