Intersection

The Intersection node takes the intersection of items found in two Sets, assigning the intersection to a Resultant Set, with the result containing items in Set A that also belong to Set B. Visually, the intersection of Set A and Set B looks like the following diagram, where the intersection of Set A and Set B contains only those items that are common to both Sets.

For illustrative purposes, let's say that you have two string type Sets, Set A and Set B, both of which are defined below.

	Set A = {"Item 1", "Item 2", "Item 3", "Item 4", "Item 5"}
	Set B = {"Item 4", "Item 5", "Item 6", "Item 7", "Item 8"}
Copy full snippet

Set A = {"Item 1", "Item 2", "Item 3", "Item 4", "Item 5"} Set B = {"Item 4", "Item 5", "Item 6", "Item 7", "Item 8"}

The following table shows you the result, which contains the intersection of Set A and Set B (symbolically represented as A ∩ B).

When intersecting a Set with an Empty Set, use the Clear (Set Nodes) node.

Inputs

Outputs

Example Usage

Footnote

Symbolically, this operation is represented as A ∩ B = { x | x ∈ A ∧ x ∈ B }, wherein this node is performing a logical AND operation between elements in Set A and elements in Set B.