Hi all,
I would like to know distance between two sibling nodes.
One solution maybe is to count siblings between the two nodes.
So, I have a sequence of sibling node, for example:

<a>
<b>
<c>
<a>
<b>
<c>
<c>

and when I match element <c> I need to know the number of
preceding-sibling only until the first previous element <a>,
also it is:

<a>
<b>
<c> = 2
<a>
<c> = 1
<c> = 2

I think that count(preceding-sibling::a[1]) is the solution, but it
seems don't work for me. Why this?