| AlgorithmsSetIntersectionT Method (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.
Namespace: X3Platform.Collections
Assembly: X3Platform.Support (in X3Platform.Support.dll) Version: 1.0.0.0 (2.0.0.0)
Syntaxpublic static IEnumerable<T> SetIntersection<T>( IEnumerable<T> collection1, IEnumerable<T> collection2 )
Parameters
- collection1
- Type: System.Collections.GenericIEnumerableT
The first collection to intersect. - collection2
- Type: System.Collections.GenericIEnumerableT
The second collection to intersect.
Type Parameters
- T
[Missing <typeparam name="T"/> documentation for "M:X3Platform.Collections.Algorithms.SetIntersection``1(System.Collections.Generic.IEnumerable{``0},System.Collections.Generic.IEnumerable{``0})"]
Return Value
Type: IEnumerableTThe intersection of the two collections, considered as sets.
Exceptions| Exception | Condition |
|---|---|
| ArgumentNullException | collection1 or collection2 is null. |
RemarksWhen equal items appear in both collections, the returned collection will include an arbitrary choice of one of the two equal items.
The default sense of equality for T is used, as defined by T's implementation of IComparable<T>.Equals or object.Equals.
If both collections are Set, Bag, OrderedSet, or OrderedBag collections, it is more efficient to use the Intersection or IntersectionWith methods on that class.
See Also