Let say I have,
class A
{
string[] values;
}
class B
{
string[] values;
}
and I have 2 object,
var a= new A{ values ={"a","b","c"}}
var b= new A{ values ={"b","c"}}
How do I make sure that all values of B should exist in A.values in efficient way?
Use Enumerable.Except to get unique items from b which don't exist in a (this is a set operation, so its pretty efficient). Then use Enumerable.Any to check if there is no such items. If there is no unique items from b which don't exist in a, then all items in b exist in a:
bool allExist = !b.values.Except(a.values).Any();
You want to check whether set A contains set B. To do this, you produce the set difference between the two sets using Except, and check whether the difference contains any elements.
var contains = ! b.values.Except(a.values).Any();
These things are easier if you imagine a Venn diagram.
EDITED :
List<string> listA = new List<string>(a);
List<string> listB = new List<string>(b);
var listCommon = listA.Where(listB.Contains);
