Select the intersection of the following two node-sets:
- All nodes after the first
z
- All nodes before the second
z
The intersection of these two sets will be the entire node between the first and second elements of z
. Use the following expression:
/*/z/following-sibling::*[ count(.|/*/z[2]/preceding-sibling::*) = count(/*/z[2]/preceding-sibling::*)]
Note The Kayessian node -set intersection formula is used here. In general, use the following to find the intersection of $set1
and $set2
:
$set1[count(.|$set2)=count($set2)]
source share