Wintellect.PowerCollections Namespace
Algorithms Class
GhostDoc Pro Sample Help File

Bag<(Of <(<'T>)>)>..::..Intersection 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 intersection 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:  Wintellect.PowerCollections
Assembly:  PowerCollections (in PowerCollections.dll)

Syntax


public Bag<T> Intersection(
	Bag<T> otherBag
)
Public Function Intersection ( _
	otherBag As Bag(Of T) _
) As Bag(Of T)
public:
Bag<T>^ Intersection(
	Bag<T>^ otherBag
)

Parameters

otherBag
Type: Wintellect.PowerCollections..::..Bag<(Of <(<'T>)>)>
Bag to intersection with.

Return Value

The intersection of the two bags.

Exceptions


ExceptionCondition
InvalidOperationExceptionThis bag and otherBag don't use the same method for comparing items.

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), where N is the size of the smaller bag.