Imagine a tree which contains somewhere an element whose name is X. Let's call
that x1. A descendant of x1 is another element with name X. Let's call that x2.
Invoking //X of course discovers both x1 and x2. Each has its own tree - it's
node and it's subtrees. But the tree of x1 overlaps that of x2 - some members
of the tree of x1 are in the tree of x2 (In this case it is a total overlap,
for other expressions it could be partial.)
John
On 14 Jan 2014, at 10:11, "Costello, Roger L."
<costello(_at_)mitre(_dot_)org> wrote:
Yesterday Michael Kay wrote:
//x is a "crawling" expression - one that selects
nodes which may overlap each other.
Michael, I do not understand what you mean by "overlap". It seems like an
important concept, since you have used that word repeatedly.
Would you give an example of overlapping nodes please?
/Roger
--~------------------------------------------------------------------
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
To unsubscribe, go to: http://lists.mulberrytech.com/xsl-list/
or e-mail:
<mailto:xsl-list-unsubscribe(_at_)lists(_dot_)mulberrytech(_dot_)com>
--~--
--~------------------------------------------------------------------
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
To unsubscribe, go to: http://lists.mulberrytech.com/xsl-list/
or e-mail: <mailto:xsl-list-unsubscribe(_at_)lists(_dot_)mulberrytech(_dot_)com>
--~--