Hi, Arnaud. You are right. Have spent quite some time thinking about it, but your idea sounds reasonable and not too heavy weight. I will eventually add this code to my solution.
Anyone interested in the new code then? Hiran > -----Urspr�ngliche Nachricht----- > Von: Arnaud Le Hors [mailto:[EMAIL PROTECTED]] > Gesendet: Dienstag, 27. November 2001 16:10 > An: [EMAIL PROTECTED] > Betreff: Re: AW: XPath for a node > > > > It would be easy to handle PIs and comments, but it is very > difficult to handle random context nodes. > > Is it really? It seems to me that all you would need to do is > walk up the > list of ancestors of the context node up to the point where > you encounter > one of the ancestors of the node you're looking at. Then it's > just a matter > of putting the two paths together. > I admit I may very well be missing something here, this is > coming right off > the top of my head without having given this any serious thoughts... > -- > Arnaud Le Hors - IBM, XML Standards Strategy Group / W3C AC Rep. > > --------------------------------------------------------------------- > To unsubscribe, e-mail: [EMAIL PROTECTED] > For additional commands, e-mail: [EMAIL PROTECTED] > > --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
