[XSL-LIST Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message]

Re: (simple?) xpath question

Subject: Re: (simple?) xpath question
From: mark bordelon <markcbordelon@xxxxxxxxx>
Date: Fri, 29 Aug 2008 12:57:11 -0700 (PDT)
Re:  (simple?) xpath question
Thanks, Colin,


Although the requirements cannot assume how many levels there are between the
root node and the desired node, your solution points me to something like
this. Does this work?


//[name() == "a" and name() == "c"]




--- On Fri, 8/29/08, Colin Paul Adams <colin@xxxxxxxxxxxxxxxxxx> wrote:

> From: Colin Paul Adams <colin@xxxxxxxxxxxxxxxxxx>
> Subject: Re:  (simple?) xpath question
> To: xsl-list@xxxxxxxxxxxxxxxxxxxxxx
> Date: Friday, August 29, 2008, 12:22 PM
> >>>>> "Mark" == mark bordelon
> <markcbordelon@xxxxxxxxx> writes:
>
>     Mark> All *help*!    What is the best way to query
> xml with xpath
>     Mark> to get a disjoint nodelist? Specifically i
> want to include
>     Mark> just the root node alongwith a descendent
> node.    XML:  
>     Mark> <a>   <b>     <c>    
> </c>  </b> </a>   XPATH:   //c  
>     Mark> DESIRED RESULT NODELIST: i.e. not this:
> <c> </c>   but
>     Mark> rather this: <a>   <c>  
> </c> </a>
>
> One possibility is:
>
> //*[name() != "b"]
>
> It depends on your exact requirements.
> --
> Colin Adams
> Preston Lancashire

Current Thread

PURCHASE STYLUS STUDIO ONLINE TODAY!

Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced!

Buy Stylus Studio Now

Download The World's Best XML IDE!

Accelerate XML development with our award-winning XML IDE - Download a free trial today!

Don't miss another message! Subscribe to this list today.
Email
First Name
Last Name
Company
Subscribe in XML format
RSS 2.0
Atom 0.3
Site Map | Privacy Policy | Terms of Use | Trademarks
Free Stylus Studio XML Training:
W3C Member
Stylus Studio® and DataDirect XQuery ™are products from DataDirect Technologies, is a registered trademark of Progress Software Corporation, in the U.S. and other countries. © 2004-2013 All Rights Reserved.