zoukankan      html  css  js  c++  java
  • tree的使用

    //html
    <ul id="tree"></ul>

     js

     function initTree() {
            $('#tree').tree({
                url: '/OnlineMonitoring/ashx/departMgr.ashx?type=tree'
                     
            });
    
        }
    

     后台

      根据父id返回当前子节点就好了。(父id为0时返回根节点)

    json示例

         [
        {
            "id": "2",
            "text": "监事会",
            "state": "closed"
        },
        {
            "id": "4259045978553",
            "text": "2",
            "state": "open"
        },
        {
            "id": "4259055249969",
            "text": "a",
            "state": "open"
        }
    ]

    id:node的id

    text:节点名称

    state:closed或open(closed说明有子项)

    贴上一个sqlserver procedure:

      

     create procedure [dbo].[Tree]
        @pid varchar(30)
     as
     begin
        select 
         a.department_id as [id],
         a.department_name as [text],
         case
         when
         (select COUNT(department_id) from dbo.department_info as b where b.department_parent_id=a.department_id)>0
         then 'closed' else 'open'
         end as [state]
         from dbo.department_info as a where a.department_parent_id=@pid;
     end

    根据pid返回树(pid为0时返回根节点)

      依赖:

             <link href="../Scripts/easyui/themes/default/easyui.css" rel="stylesheet" />
              <link href="../Scripts/easyui/themes/icon.css" rel="stylesheet" />
              <link href="../Scripts/easyui/demo/demo.css" rel="stylesheet" />
              <script type="text/javascript" src="../Scripts/easyui/jquery.min.js"></script>
                       <script type="text/javascript" src="../Scripts/easyui/jquery.easyui.min.js"></script>
                <script type="text/javascript" src="../Scripts/easyui/locale/easyui-lang-zh_CN.js"></script>

  • 相关阅读:
    使用序列化实现对象的拷贝
    理解 Java 的三大特性之多态
    LeetCode OJ:Add and Search Word
    关于Qt的事件循环以及QEventLoop的简单使用
    LeetCode OJ:Generate Parentheses(括号生成)
    LeetCode OJ:Maximal Square(最大矩形)
    LeetCode OJ:Range Sum Query 2D
    LeetCode OJ:Power of Two(2的幂)
    LeetCode OJ:Longest Increasing Subsequence(最长递增序列)
    LeetCode OJ:Ugly Number II(丑数II)
  • 原文地址:https://www.cnblogs.com/gaocong/p/5832766.html
Copyright © 2011-2022 走看看