zoukankan      html  css  js  c++  java
  • easyui tree带checkbox实现单选

    <ul id="regionTree"></ul>
    $('#regionTree').tree({
                cascadeCheck: false,
                //onlyLeafCheck: true,
                checkbox: true,
                data: [{
                    "id": 1,
                    "text": "My Documents",
                    "children": [{
                        "id": 11,
                        "text": "Photos",
                        "state": "closed",
                        "children": [{
                            "id": 111,
                            "text": "Friend"
                        }, {
                            "id": 112,
                            "text": "Wife"
                        }, {
                            "id": 113,
                            "text": "Company"
                        }]
                    }, {
                        "id": 12,
                        "text": "Program Files",
                        "children": [{
                            "id": 121,
                            "text": "Intel"
                        }, {
                            "id": 122,
                            "text": "Java",
                            "attributes": {
                                "p1": "Custom Attribute1",
                                "p2": "Custom Attribute2"
                            }
                        }, {
                            "id": 123,
                            "text": "Microsoft Office"
                        }, {
                            "id": 124,
                            "text": "Games",
                            "checked": true
                        }]
                    }, {
                        "id": 13,
                        "text": "index.html"
                    }, {
                        "id": 14,
                        "text": "about.html"
                    }, {
                        "id": 15,
                        "text": "welcome.html"
                    }]
                }]
                ,
                 160,
                height: 32,
                panelHeight: 400,
                onSelect: function (node) {
                    var cknodes = $('#regionTree').tree("getChecked");
                    for (var i = 0; i < cknodes.length; i++) {
                        if (cknodes[i].id != node.id) {
                            $('#regionTree').tree("uncheck", cknodes[i].target);
                        }
                    }
                    if (node.checked) {
                        $('#regionTree').tree('uncheck', node.target);
    
                    } else {
                        $('#regionTree').tree('check', node.target);
    
                    }
    
                },
                onLoadSuccess: function (node, data) {
                    $(this).find('span.tree-checkbox').unbind().click(function () {
                        $('#regionTree').tree('select', $(this).parent());
                        return false;
                    });
                }
            })

    关键代码:

    onSelect: function (node) {
                    var cknodes = $('#regionTree').tree("getChecked");
                    for (var i = 0; i < cknodes.length; i++) {
                        if (cknodes[i].id != node.id) {
                            $('#regionTree').tree("uncheck", cknodes[i].target);
                        }
                    }
                    if (node.checked) {
                        $('#regionTree').tree('uncheck', node.target);
    
                    } else {
                        $('#regionTree').tree('check', node.target);
    
                    }
    
                },
                onLoadSuccess: function (node, data) {
                    $(this).find('span.tree-checkbox').unbind().click(function () {
                        $('#regionTree').tree('select', $(this).parent());
                        return false;
                    });
                }

    技术交流QQ群:15129679

  • 相关阅读:
    CART算法(转)
    分类算法:决策树(C4.5)(转)
    决策树与迭代决策树(转)
    随机森林(Random Forest)详解(转)
    Bagging和Boosting 概念及区别(转)
    迭代器与生成器
    Python代码这样写更优雅(转)
    python进行EDA探索性数据分析
    标准化与归一化(转)
    最小树形图(poj3164)
  • 原文地址:https://www.cnblogs.com/yeminglong/p/5896770.html
Copyright © 2011-2022 走看看