比较XML节点的高效算法

我建议不要滚动自己的哈希创建函数，而要依赖内置

XNodeEqualityComparer

GetHashCode

您的代码如下所示：

XNodeEqualityComparer comparer = new XNodeEqualityComparer();Xdocument doc = Xdocument.Load("XmlFile1.xml");Dictionary<int, XNode> nodeDictionary = new Dictionary<int, XNode>();foreach (XNode node in doc.Elements("doc").Elements("node")){    int hash = comparer.GetHashCode(node);    if (nodeDictionary.ContainsKey(hash))    {        // A duplicate has been found. Execute your logic here        // ...    }    else    {        nodeDictionary.Add(hash, node);    }}

我的XmlFile1.xml是：

<?xml version="1.0" encoding="utf-8" ?><doc>  <node att="A">Blah</node>  <node att="A">Blah</node>  <node att="B">    <inner>Innertext</inner>  </node>  <node>Blah</node>  <node att="B">    <inner>Different</inner>  </node></doc>

nodeDictionary

Dictionary

ContainsKey

XNodeEqualityComparer

GetHashCode

我认为这应该足够快以满足您的需求。