This result (named the Kayessian method of node-set intersection after
Dr. Kay, who first pointed out to it) is at least 7 years old:
$ns1[count(. | $ns2) = count($ns2)]
is the nodeset containing all nodes that are both in the node-set $ns1
and in the node-set $ns2.
--
Cheers,
Dimitre Novatchev
---------------------------------------
Truly great madness cannot be achieved without significant intelligence.
---------------------------------------
To invent, you need a good imagination and a pile of junk
-------------------------------------
Never fight an inanimate object
-------------------------------------
You've achieved success in your field when you don't know whether what
you're doing is work or play
On Mon, Nov 3, 2008 at 5:38 AM, Maria Jonas <makt(_at_)rocketmail(_dot_)com>
wrote:
I wonder if you have references to practical examples of making an intersect
set operation with xpath ver 1.0
I read theory about this but I have problems in practice.
All the best
--~------------------------------------------------------------------
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
To unsubscribe, go to: http://lists.mulberrytech.com/xsl-list/
or e-mail:
<mailto:xsl-list-unsubscribe(_at_)lists(_dot_)mulberrytech(_dot_)com>
--~--
--~------------------------------------------------------------------
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
To unsubscribe, go to: http://lists.mulberrytech.com/xsl-list/
or e-mail: <mailto:xsl-list-unsubscribe(_at_)lists(_dot_)mulberrytech(_dot_)com>
--~--