set:intersection() returns the intersection of two node-sets. In other words, it returns a node-set containing all the nodes that exist in both nodeSet1 and nodeSet2.
set:intersection(nodeSet1, nodeSet2)
nodeSet1The first node-set.
nodeSet2The second node-set.
A node-set containing the nodes that existed in both nodeSet1 and in nodeSet2.