Language:
Page Info
Tags:
Engine Version:

# 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"}``````

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

 Set A Set B Resultant Set (A ∩ B) `Item 1` `Item 4` `Item 4` `Item 2` `Item 5` `Item 5` `Item 3` `Item 6` `Item 4` `Item 7` `Item 5` `Item 8`

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

## Inputs

Pin Location

Name

Description

(In) Exec

Input execution pin.

A

One Set to intersect.

B

The other Set to intersect.

## Outputs

Pin Location

Name

Description

(Out) Exec

Output execution pin.

Result

The Set containing the resultant intersection.

## 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.

Tags