随着收藏的Rules我试图创建的另一个集合Rules忽略了Site财产,创造一个独特的名单.
public class Rule
{
public int TestId { get; set; }
public string File { get; set; }
public string Site { get; set; }
public string[] Columns { get; set; }
}
Run Code Online (Sandbox Code Playgroud)
因此,如果我的收藏品具有如下值:
var rules = new List<Rule>
{
new Rule { TestId = 1, File = "Foo", Site = "SiteA", Columns = new string[] { "ColA", "ColB" }},
new Rule { TestId = 1, File = "Foo", Site = "SiteB", Columns = new string[] { "ColA", "ColB" }}
};
Run Code Online (Sandbox Code Playgroud)
我想要最终的结果
var uniqueRules = new List<Rule>
{
new Rule { TestId = 1, File = "Foo", Site = null, Columns = new string[] { "ColA", "ColB" }}
};
Run Code Online (Sandbox Code Playgroud)
尝试了下面的各种组合,我仍然得到2个结果,我如何达到预期的结果?
var uniqueRules = rules
.GroupBy(r => new { r.TestId, r.File, r.Columns })
.Select(g => g.Key)
.Distinct()
.ToList();
Run Code Online (Sandbox Code Playgroud)
问题是,string[]还没有覆盖Equals和GetHashCode,这就是为什么只是引用在比较r.Columns.您需要提供自定义IEqualityComparer<T>:
public class RuleComparer : IEqualityComparer<Rule>
{
public bool Equals(Rule x, Rule y)
{
if (object.ReferenceEquals(x, y)) return true;
if (x == null || y == null) return false;
if(!(x.TestId == y.TestId && x.File == y.File)) return false;
return x.Columns.SequenceEqual(y.Columns);
}
// from: https://stackoverflow.com/questions/263400/what-is-the-best-algorithm-for-an-overridden-system-object-gethashcode
public int GetHashCode(Rule obj)
{
unchecked
{
int hash = 17;
hash = hash * 23 + obj.TestId.GetHashCode();
hash = hash * 23 + (obj.File?.GetHashCode() ?? 0);
foreach(string s in obj.Columns)
hash = hash * 23 + (s?.GetHashCode() ?? 0);
return hash;
}
}
}
Run Code Online (Sandbox Code Playgroud)
现在LINQ查询变得微不足道了:
List<Rule> uniqueRules = rules.Distinct(new RuleComparer()).ToList();
Run Code Online (Sandbox Code Playgroud)