Click or drag to resize
OrderedBagTIntersection Method
Computes the intersection of this bag with another bag. The intersection of two bags is all items that appear in both of the bags. If an item appears X times in one bag, and Y times in the other bag, the sum contains the item Minimum(X,Y) times. A new bag is created with the intersection of the bags and is returned. This bag and the other bag are unchanged.

Namespace: X3Platform.Collections
Assembly: X3Platform.Support (in X3Platform.Support.dll) Version: 1.0.0.0 (2.0.0.0)
Syntax
Copy
public OrderedBag<T> Intersection(
	OrderedBag<T> otherBag
)

Parameters

otherBag
Type: X3Platform.CollectionsOrderedBagT
Bag to intersection with.

Return Value

Type: OrderedBagT
The intersection of the two bags.
Exceptions
ExceptionCondition
InvalidOperationExceptionThis bag and otherBag don't use the same method for comparing items.
ArgumentNullExceptionotherBag is null.
Remarks

When equal items appear in both bags, the intersection will include an arbitrary choice of one of the two equal items.

The intersection of two bags is computed in time O(N log M), where M is the size of the larger bag, and N is the size of the smaller bag.

See Also