Mic*_*cah 7 c# xml recursion linq-to-xml
这个有点棘手.说我有这个XmlDocument
<Object>
<Property1>1</Property1>
<Property2>2</Property2>
<SubObject>
<DeeplyNestedObject />
</SubObject>
</Object>
Run Code Online (Sandbox Code Playgroud)
我想要回来
<Object>
<Property1>1</Property1>
<Property2>2</Property2>
</Object>
Run Code Online (Sandbox Code Playgroud)
由于每个孩子<SubObject>都是空元素,我想摆脱它.使它具有挑战性的是,当你迭代它们时你不能删除它们.任何帮助将非常感激.
更新这是我最后的结果.
public XDocument Process()
{
//Load my XDocument
var xmlDoc = GetObjectXml(_source);
//Keep track of empty elements
var childrenToDelete = new List<XElement>();
//Recursively iterate through each child node
foreach (var node in xmlDoc.Root.Elements())
Process(node, childrenToDelete);
//An items marked for deletion can safely be removed here
//Since we're not iterating over the source elements collection
foreach (var deletion in childrenToDelete)
deletion.Remove();
return xmlDoc;
}
private void Process(XElement node, List<XElement> elementsToDelete)
{
//Walk the child elements
if (node.HasElements)
{
//This is the collection of child elements to be deleted
//for this particular node
var childrenToDelete = new List<XElement>();
//Recursively iterate each child
foreach (var child in node.Elements())
Process(child, childrenToDelete);
//Delete all children that were marked as empty
foreach (var deletion in childrenToDelete)
deletion.Remove();
//Since we just removed all this nodes empty children
//delete it if there's nothing left
if (node.IsEmpty)
elementsToDelete.Add(node);
}
//The current leaf node is empty so mark it for deletion
else if (node.IsEmpty)
elementsToDelete.Add(node);
}
Run Code Online (Sandbox Code Playgroud)
如果有人对此用例感兴趣,那就是我放在一起的ObjectFilter项目.
它会很慢,但你可以这样做:
XElement xml;
while (true) {
var empties = xml.Descendants().Where(x => x.IsEmpty && !x.HasAttributes).ToList();
if (empties.Count == 0)
break;
empties.ForEach(e => e.Remove());
}
Run Code Online (Sandbox Code Playgroud)
为了使它更快,你可以在第一次迭代后走上父节点并查看它们是否为空.
XElement xml;
var empties = xml.Descendants().Where(x => x.IsEmpty && !x.HasAttributes).ToList();
while (empties.Count > 0) {
var parents = empties.Select(e => e.Parent)
.Where(e => e != null)
.Distinct() //In case we have two empty siblings, don't try to remove the parent twice
.ToList();
empties.ForEach(e => e.Remove());
//Filter the parent nodes to the ones that just became empty.
parents.RemoveAll(e => e.IsEmpty && !e.HasAttributes);
empties = parents;
}
Run Code Online (Sandbox Code Playgroud)