This is the mail archive of the
xsl-list@mulberrytech.com
mailing list .
RE: xpath // query
- From: "Aleksander Dye" <aleksander at nettskolen dot com>
- To: <xsl-list at lists dot mulberrytech dot com>
- Date: Wed, 24 Apr 2002 14:26:50 +0200
- Subject: RE: [xsl] xpath // query
- Reply-to: xsl-list at lists dot mulberrytech dot com
select="A//C"
Gets every C under the path of an A, this is the slowest and will get every
C
any different to:
select="A//B//C"
Gets every C under the path of any B that is under the path of an A, this is
the fastest and will get every C under any B that is under an A
-Aleksander
-----------
Hi list,
If I know that the element I am looking for will have a two certain
ancestors, but an unknown number of elements in between, can I improve the
xpath to reach the element by including the middle element?
For example, is:
select="A//C"
any different to:
select="A//B//C"
when I know that <B> is *guranteed* to be there (both select the same
nodes). By adding the test for <B>, will it make the selection any faster?
After thinking for a while, Im guessing it makes no difference to the
selection time as the same number of nodes still need to be traversed.
Theoretically, it may be slower as it involves an extra test. Is this
correct? (or too insignificant to worry about)...
cheers
andrew
---
Outgoing mail is certified Virus Free.
Checked by AVG anti-virus system (http://www.grisoft.com).
Version: 6.0.350 / Virus Database: 196 - Release Date: 17/04/2002
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list