"McNally, David" <David.McNally@xxxxxxxxxx> writes:

> I think this'll do it.  Rather than walking down the tree, I'm
> starting at the bottom for each node, and walking back up, returning
> a TRUE value if I ever hit a node with the correct rootname.  Then,
> if I get any TRUE values, output the node - so each node only gets
> output once, no matter how many true paths there are up to the
> rootname node.  There may be a way to handle the test as a boolean -
> I'm just returning the string "TRUE" and then testing for it.

(Banging head against wall...)

Sure, this will do it! Thanks a million.

-- 
Regards, kga


 XSL-List info and archive:  http://www.mulberrytech.com/xsl/xsl-list