I have two collections of objects of different type. Lets call them type ALPHA and type BRAVO. Each of these types has a property that is the “ID” for the object. No ID is duplicated within the class, so for any given ID, there is at most one ALPHA and one BRAVO instance. What I need to do is divide them into 3 categories:
- Instances of the ID in ALPHA which do not appear in the BRAVO collection;
- Instances of the ID in BRAVO which do not appear in the ALPHA collection;
- Instances of the ID which appear in both collections.
In all 3 cases, I need to have the actual objects from the collections at hand for subsequent manipulation.
I know for the #3 case, I can do something like:
var myCorrelatedItems = myAlphaItems.Join(myBravoItems, alpha => alpha.Id, beta => beta.Id, (inner, outer) => new
{
alpha = inner,
beta = outer
});
I can also write code for the #1 and #2 cases which look something like
var myUnmatchedAlphas = myAlphaItems.Where(alpha=>!myBravoItems.Any(bravo=>alpha.Id==bravo.Id));
And similarly for unMatchedBravos. Unfortunately, this would result in iterating the collection of alphas (which may be very large!) many times, and the collection of bravos (which may also be very large!) many times as well.
Is there any way to unify these query concepts so as to minimize iteration over the lists? These collections can have thousands of items.
If you are only interested in the IDs,
If you want the alphas and bravos themselves,
EDIT:
A few other options:
ExceptBymethod from MoreLinq.Enumerable.ToDictionarymethod.IHasIdinterface), you could write your ownIEqualityComparer<T>implementation;Enumerable.Excepthas an overload that accepts an equality-comparer as a parameter.