我建议使用LambdaComparer,它可以作为平等比较器传递给Intersect()方法,它允许通过提供布尔条件而不是每次引入一个新的比较器类来指定比较逻辑,所以你的代码将是够清楚:
firstCollection.Intersect(
secondCollection,
new LambdaComparer<YourClass>(
(item1, item2) => item1.PropertyName == item2.PropertyName));
// Below are lists and User class which demonstrates LambdaComparer and Intersect()
public class User
{
public string Name { get; set; }
}
IList<User> list1 = new List<User>
{
new User {Name = "A"},
new User { Name = "B"}
};
List<User> list2 = new List<User>
{
new User {Name = "C"},
new User { Name = "B"}
};
var resultSet = list1.Intersect<User>(
list2,
new LambdaComparer<User>((item1, item2) => item1.Name == item2.Name));
基本上如果你需要比较cusotm属性,你仍然可以把这个逻辑封装到
Func<User, User, bool> userNameComparer = (user1, user2) =>
{
// check attributes using user1.GetType().GetCustomAttributes()
};
然后将此比较器功能用作:
var resultSet = list1.Intersect<User>(
list2,
new LambdaComparer<User>((item1, item2) => userNameComparer));
编辑:请注意此答案中引用的特定 impelemntaion
可能存在一个问题,默认情况下哈希函数是硬编码的0
6 public LambdaComparer(Func<T, T, bool> lambdaComparer) :
7 this(lambdaComparer, o => 0)
8 {
9 }
这在某些情况下可能会导致性能问题,因此我建议将其重构为:
public LambdaComparer(Func<T, T, bool> lambdaComparer) :
this(lambdaComparer,
EqualityComparer<T>.Default.GetHashCode(o))
{
}
所以它将使用内置的GetHashCode() 实现