Subject: RE: A theory problem From: DPawson@xxxxxxxxxxx Date: Fri, 29 Oct 1999 16:46:34 +0100 |
James wrote: > More precisely, define the level of >a node to be the number of ancestors it has, and then define an >expression to be single-level if and only if there exists an integer n >such that for any node x, for any node y in the result of >evaluating the >expression with respect to x, the difference between the level of x and >the level of y is equal to n. What about two elements on different 'sub-trees' a b c d e f g h satisfy your criteria for c and g , yet they are not siblings (again my 'loose' terminology) Is it necessary to state the path distance between the two? [Or am I in the wrong ball park again ] DaveP XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
Re: A theory problem, James Clark | Thread | Need an advice about XSLT, Olivier Martineau |
Re: simple web forms, Duane Nickull | Date | Q: Inline HTML markup of nested XML, Glenn Cruickshank |
Month |