[This topic is pre-release documentation and is subject to change in future releases. Blank topics are included as placeholders.]
Overload List
| Name | Description | |
|---|---|---|
  | SetIntersection<(Of <T>)>(IEnumerable<(Of <T>)>, IEnumerable<(Of <T>)>) |
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.
|
| SetIntersection<(Of <T>)>(IEnumerable<(Of <T>)>, IEnumerable<(Of <T>)>, IEqualityComparer<(Of <T>)>) |
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.
|
See Also
Send comments about this topic to Microsoft.