zoukankan      html  css  js  c++  java
  • Newtonsoft.Json.Linq对象读取DataSet数据

    Newtonsoft.Json.Linq对象读取DataSet数据:

    private void button4_Click(object sender, EventArgs e)
            {
                DataTable dt = new DataTable("t");
                dt.Columns.Add("a");
                dt.Columns.Add("b");
                dt.Rows.Add("1", "11");
                dt.Rows.Add("2", "22");

                DataSet ds = new DataSet();
                ds.Tables.Add(dt);

                dt = dt.Copy();
                dt.TableName = "t2";
                ds.Tables.Add(dt);
                string str = Newtonsoft.Json.JsonConvert.SerializeObject(ds);

                object obb = Newtonsoft.Json.JsonConvert.DeserializeObject(str);

                //string ss= obb["a"];
                JObject ob = (JObject)(obb);
                JArray ss = (JArray) ob["t"];
                JObject jo = (JObject)ss[0];
                string mm = jo["a"].ToString();
            }

            private void button5_Click(object sender, EventArgs e)
            {
                Dictionary<string, string> dict = new Dictionary<string, string>();
                dict["a"] = "111";
                dict["b"] = "dsf";
                dict["c"] = "dssssf";

                string str = Newtonsoft.Json.JsonConvert.SerializeObject(dict);

                object obb = Newtonsoft.Json.JsonConvert.DeserializeObject(str);
             
                //string ss= obb["a"];
                JObject ob =  ( JObject)(obb);
                string mm = ob["a"].ToString();
            }

  • 相关阅读:
    floyd的魔改应用——洛谷P2419 [USACO08JAN]牛大赛Cow Contest 题解
    洛谷P2142 高精度减法 题解
    浅谈SPFA——洛谷P1576 最小花费 题解
    洛谷P1301 魔鬼之城 题解
    洛谷P1009 阶乘之和 题解
    20200926模拟
    [NOIP 2013]货车运输
    带权并查集--P2024 [NOI2001]食物链
    归并排序/树状数组求逆序对-lgP1908 逆序对
    LCA模块+求树上两点距离最短
  • 原文地址:https://www.cnblogs.com/81/p/9906506.html
Copyright © 2011-2022 走看看