Geek asks and answers

How can I claim that the elements of the two collections are identical?

How should I say that two collections contain the same elements, the order of identifiers does NOT matter?

This means that the number of each item in the two collections is the same. Here are some examples:

Equal:
1,2,3,4 1,2,3,4 ==
1,2,3,4 == 4,2,3,1
2,1,2 2,2,1 ==
1.2, 2 == 2,2,1

Not equal:
1! = 1,1
1,1,2! = 1,2,2

Is there some canned function that will do what I want? I assume it will be in Microsoft.VisualStudio.QualityTools.UnitTestFramework.Assert or in LINQ. A statement would be preferable, as this is likely to give more information on how they differ.

+5
2

:

public static bool AreEqual<T>(this IEnumerable<T> first, IEnumerable<T> second)
{
    var dictionary = first.GroupBy(x => x)
        .ToDictionary(group => group.Key,
        group => group.Count());

    foreach (var item in second)
    {
        int count = dictionary[item];
        if (count <= 0)
            return false;
        else dictionary[item] = count - 1;
    }

    return dictionary.Values.All(count => count > 0);
}
0

More articles:


All Articles