zoukankan      html  css  js  c++  java
  • c# 生成、读取xml

    生成:

    <?xml version="1.0" encoding="utf-8"?>
    <CategoryList>
    <Category ID="01">
    <MainCategory>XML</MainCategory>
    <Description>This is a list my XML articles.</Description>
    <Active>true</Active>
    </Category>
    </CategoryList>

    XmlDocument xmlDoc = new XmlDocument();
    XmlDeclaration xmlDeclaration = xmlDoc.CreateXmlDeclaration("1.0","utf-8",null);
    XmlElement rootNode  = xmlDoc.CreateElement("CategoryList");
    xmlDoc.InsertBefore(xmlDeclaration, xmlDoc.DocumentElement);
    xmlDoc.AppendChild(rootNode);
    XmlElement parentNode  = xmlDoc.CreateElement("Category");
    parentNode.SetAttribute("ID", "01");
    xmlDoc.DocumentElement.PrependChild(parentNode);
    XmlElement mainNode  = xmlDoc.CreateElement("MainCategory");
    XmlElement descNode  = xmlDoc.CreateElement("Description");
    XmlElement activeNode  = xmlDoc.CreateElement("Active");
    XmlText categoryText= xmlDoc.CreateTextNode("XML");
    XmlText descText  = xmlDoc.CreateTextNode("This is a list my XML articles.");
    XmlText activeText  = xmlDoc.CreateTextNode("true");
    parentNode.AppendChild(mainNode);
    parentNode.AppendChild(descNode);
    parentNode.AppendChild(activeNode);
    mainNode.AppendChild(categoryText);
    descNode.AppendChild(descText);
    activeNode.AppendChild(activeText);
    xmlDoc.Save(Server.MapPath("categories.xml"));

    读取:

    try
                {
                    if (File.Exists(versionPath))
                    {
                        XmlDocument doc = new XmlDocument();
                        doc.Load(versionPath);
                        foreach (XmlNode node in doc.SelectSingleNode("citylist").ChildNodes)
                        {
                            versionDic.Add(node.Attributes["code"].Value, Convert.ToInt64(node.Attributes["version"].Value));
                        }
                    }
                }
                catch
                { }

  • 相关阅读:
    p2394 精度题
    线性筛素数
    poj3468 线段树的懒惰标记
    逆元
    2018 Multi-University Training Contest 2
    2018 Multi-University Training Contest 1
    判断素数遇到的问题
    Mergeable Stack(链表实现栈)
    组合数
    poj2594 机器人寻找宝藏(最小路径覆盖)
  • 原文地址:https://www.cnblogs.com/94cool/p/2151557.html
Copyright © 2011-2022 走看看