zoukankan      html  css  js  c++  java
  • C#解析XML

    <checkResult>
    <item>
    <fmId>XX0001</fmId>
    <fmItemId>20000RT</fmItemId>
    <checkRuleId>4C6A0458-29B4-4CE6-B38C-38CDEE3CD3C2</checkRuleId>
    <isAcct>不影响</isAcct>
    <soluation>不需要方案,因为不涉及</soluation>
    <evaluate>注意,这是一条评论</evaluate>
    </item>
    <item>
    <fmId>XX0002</fmId>
    <fmItemId>20000RT</fmItemId>
    <checkRuleId>A4C12D83-DC18-427D-839F-7DB68EF730BF</checkRuleId>
    <isAcct>影响</isAcct>
    <soluation>方案还在拟定当中,请注意节奏</soluation>
    <evaluate>It is a evaluate</evaluate>
    </item>
    </checkResult>

    public class DizCheckResult
    {
    public string fmId { get; set; }
    public string fmItemId { get; set; }
    public string checkRuleId { get; set; }
    public string isAcct { get; set; }
    public string soluation { get; set; }
    public string evaluate { get; set; }
    }

    public static List<DizCheckResult> GetCheckResultList()
            {
                List<DizCheckResult> tmpList = new List<DizCheckResult>();
                XmlDocument xmlDoc = new XmlDocument();
                xmlDoc.Load(@"f:myprojectx.xml");
                //XmlNodeList nodelist = xmlDoc.GetElementsByTagName("checkResult/item");
                XmlNodeList nodelist = xmlDoc.SelectNodes("checkResult/item");
                foreach(XmlNode node in nodelist)
                {
                    DizCheckResult entity = new DizCheckResult();
                    entity.fmId = HttpUtility.HtmlEncode(node["fmId"].InnerText);
                    entity.fmItemId = HttpUtility.HtmlEncode(node["fmItemId"].InnerText);
                    entity.checkRuleId = node["checkRuleId"].InnerText;
                    entity.isAcct = node["isAcct"].InnerText;
                    entity.soluation = node["soluation"].InnerText;
                    entity.evaluate = node["evaluate"].InnerText;
                    tmpList.Add(entity);
                }
                return tmpList;
            }
  • 相关阅读:
    安亦行
    [SCOI2010]连续攻击游戏 二分图匹配
    [USACO11JAN]Roads and Planes G
    CF796C Bank Hacking
    括号类问题总结 持续更新
    CF1216E Numerical Sequence Hard Version 数学
    POJ3613 Cow Relays 矩阵快速幂
    倍增法求lca(最近公共祖先)
    Codeforces C. Jzzhu and Cities(dijkstra最短路)
    Codeforces B. Mouse Hunt(强连通分解缩点)
  • 原文地址:https://www.cnblogs.com/zoujinhua/p/15098009.html
Copyright © 2011-2022 走看看