zoukankan      html  css  js  c++  java
  • C# XML文件创建保存、子节点及属性操作

    C# XML文件创建保存、子节点及属性操作

            /// <summary>
            /// 创建添加并保存XML文件
            /// </summary>
            private void CreatAndSaveXML()
            {
                XmlDocument xmlDoc = new XmlDocument();
                XmlDeclaration xmlDec = xmlDoc.CreateXmlDeclaration("1.0", "utf-8",null);
    
                xmlDoc.AppendChild(xmlDec);
                //添加根节点
                XmlElement nodeRoot = xmlDoc.CreateElement("Templete");
                xmlDoc.AppendChild(nodeRoot);
                //添加新节点
                XmlElement nodeTemp1 = xmlDoc.CreateElement("nodeTemp");
                //添加节点数据
                nodeTemp1.InnerText = "测试节点1";
                //添加节点属性
                nodeTemp1.SetAttribute("Attribute1", "123");
                nodeTemp1.SetAttribute("Attribute2", "456");
                nodeTemp1.SetAttribute("Attribute3", "789");
                nodeRoot.AppendChild(nodeTemp1);
                //添加新节点
                XmlElement nodeTemp2 = nodeTemp1.Clone() as XmlElement;
                nodeTemp1.InnerText = "测试节点2";
                nodeTemp2.SetAttribute("Attribute1", "123");
                nodeTemp2.SetAttribute("Attribute2", "456");
                nodeTemp2.SetAttribute("Attribute3", "789");
                nodeRoot.AppendChild(nodeTemp2);
    
                xmlDoc.Save(Application.StartupPath + "\xmlTemp.xml");
            }

    /// <summary> /// 加载遍历XML文件 /// </summary> private void LoadAndTraversal() { XmlDocument xmlDoc = new XmlDocument(); xmlDoc.Load(Application .StartupPath+ "\xmlTemp.xml"); //读取根节点 XmlElement nodeElement = xmlDoc.SelectSingleNode("Templete") as XmlElement; if (nodeElement != null) { XmlNodeList nodeList = nodeElement.ChildNodes; //子节点遍历 if (nodeList != null && nodeList.Count > 0) { foreach (XmlNode nodeItem in nodeList) { //获取子节点属性 string att1 = (nodeItem as XmlElement).GetAttribute("Attribute1"); Console.WriteLine(att1); } } } }
  • 相关阅读:
    『空』
    退役前的做题记录 Ⅰ
    BZOJ3600 没有人的算术(替罪羊树,线段树)
    洛谷P5324 [BJOI2019]删数(线段树)
    洛谷P4696 [CEOI2011]Matching(KMP)
    Leetcode 638 大礼包 DP
    Leetcode 86 分割链表
    Leetcode 71 简化路径
    Leetcode 17.15 最长单词 剪枝与记忆化
    Leetcode 17.22单词转换 dfs+回溯+剪枝
  • 原文地址:https://www.cnblogs.com/jiayan1578/p/12060624.html
Copyright © 2011-2022 走看看