|
[XSL-LIST Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message] Re: Re: RE: Re: RE: Re: XPath riddle
At 01:28 PM 7/5/01, Dimitre wrote:
Now, if I understand you well, you want every D/C, for which the first ancestor from Or //D/C[(ancestor::A|ancestor::F)[last()][self::A]] Grouping the two location paths ancestor::A and ancestor::F creates a node set to be evaluated in document order; the last() predicate selects the latest (deepest) of these ancestors; the self::A makes sure it's an A element (by throwing it out if it's not). You can add other ancestors to the mix by adding to the (ancestor::A|ancestor::F) group, or alter the condition in other ways (for example, just leaving out any C with an F grandparent (not just an F ancestor at any level), by grouping (ancestor::A|../parent::F). Also, remember if this expression is going in a match you don't need the initial "//" (a detail that not everyone seems to have assimilated). Cheers, Wendell
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
|
PURCHASE STYLUS STUDIO ONLINE TODAY!Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced! Download The World's Best XML IDE!Accelerate XML development with our award-winning XML IDE - Download a free trial today! Subscribe in XML format
|

Cart








