zoukankan      html  css  js  c++  java
  • 绑定树tree 的后台方法

    #region 获取部门列表树集合
            /// <summary>
            /// 获取部门列表树集合
            /// </summary>
            /// <returns></returns>
            public string GetOrganizationList()
            {
                System.Collections.IList orgainList = organizationibll.GetList();//获取部门方法
                IsoDateTimeConverter timeConverter = new IsoDateTimeConverter();
                timeConverter.DateTimeFormat = "yyyy'-'MM'-'dd' 'HH':'mm':'ss";
                List<SYS_Organization> listtree = SysManager.Common.Utilities.IListHelper.IListToList<SYS_Organization>(orgainList);//将IList 转化成List
                SYS_Organization orgobj = listtree.Find(org => org.ParentId == "0");//构造顶级节点//(数据库中用的是O)
                LEFTTREE lefttree = new LEFTTREE();
                lefttree.ID = orgobj.OrganizationId;
                lefttree.TEXT = orgobj.FullName;
                lefttree.CHILDREN = new List<LEFTTREE>();
                TreeDiGui(lefttree.ID, lefttree, listtree);
                return "["+JsonConvert.SerializeObject(lefttree).Replace("TEXT", "text").Replace("ID", "id").Replace("CHILDREN", "children")+"]";
            }
            #endregion
            #region 查找树的子节点
            /// <summary>
            /// 查找树的子节点
            /// </summary>
            /// <param name="sb"></param>
            /// <param name="ParentId"></param>
            /// <returns></returns>
            public LEFTTREE TreeDiGui(string ParentId, LEFTTREE LEFTTREE, IEnumerable<SYS_Organization> ALLTREE)
            {
                //
                IEnumerable<SYS_Organization> FindTree = ALLTREE.Where(new Func<SYS_Organization, bool>(d => d.ParentId == ParentId));
                foreach (SYS_Organization item in FindTree)
                {
                    LEFTTREE ChildTree = new LEFTTREE();
                    ChildTree.ID = item.OrganizationId;
                    ChildTree.TEXT = item.FullName;
                    ChildTree.CHILDREN = new List<LEFTTREE>();
                    // ChildTree.CHILDREN.Add(ChildTree);
                    LEFTTREE.CHILDREN.Add(ChildTree);
                    TreeDiGui(ChildTree.ID, ChildTree, ALLTREE);
                }
                return LEFTTREE;
            }
            #endregion
  • 相关阅读:
    ZZNU 正约数之和 2094
    ZZNUOJ 2022 摩斯密码
    POJ
    NYOJ 1277Decimal integer conversion (第九届河南省省赛)
    hrbust 2080链表 【贪心】
    hdu-5707-Combine String
    POJ 2442-Sequence(优先队列)
    Reversion Count
    python 07篇 内置函数和匿名函数
    python 06篇 常用模块
  • 原文地址:https://www.cnblogs.com/dullbaby/p/3557504.html
Copyright © 2011-2022 走看看