AlgorithmsSetIntersection Method |
Name | Description | |
---|---|---|
![]() ![]() | SetIntersectionT(IEnumerableT, IEnumerableT) |
Computes the set-theoretic intersection of two collections. The intersection of two sets
is all items that appear in both of the sets. If an item appears X times in one set,
and Y times in the other set, the intersection contains the item Minimum(X,Y) times.
The source collections are not changed.
A new collection is created with the intersection of the collections; the order of the
items in this collection is undefined.
|
![]() ![]() | SetIntersectionT(IEnumerableT, IEnumerableT, IEqualityComparerT) |
Computes the set-theoretic intersection of two collections. The intersection of two sets
is all items that appear in both of the sets. If an item appears X times in one set,
and Y times in the other set, the intersection contains the item Minimum(X,Y) times.
The source collections are not changed.
A new collection is created with the intersection of the collections; the order of the
items in this collection is undefined.
|