easyui树动态加载参考

这篇文章是拷贝的,多谢原作者

  友情连接:http://www.jb51.net/article/28771.htm

var treeTitle = '选择列表';
var treeUrl = '../DataAshx/getTreeNode.ashx?pid=-1';
var nodeExp = false;
var nodekeep = "";
var rows;
var noinf = 0;
$(function () {
    $('#treewindow').window({
        title: treeTitle,
        width: 400,
        height: 400,
        modal: true,
        shadow: false,
        closed: true,
        resizable: false,
        maximizable: false,
        minimizable: false,
        collapsible: false
    });
});

function treeWindowOpen(name, rowIndx) {
    $('#treewindow').window('open');
    nodekeep = "";
    nodeExp = false;
    rows = rowIndx.toString();
    $('#basetree').tree({
        checkbox: true,
        animate: true,
        url: treeUrl + "&coln=" + escape(name.toString()),
        cascadeCheck: true,
        onlyLeafCheck: false,
        onBeforeExpand: function (node, param) {
            //------------第一种方法:异步加载子节点值-------------
            // $('#basetree').tree('options').url = "../DataAshx/getTreeNode.ashx?pid=" + node.id+"&coln="+escape(name.toString());

            //------------第二种方法:Ajax方法返回子节点Json值,使用append方法加载子节点
            $.ajax({
                type: "POST",
                url: "../DataAshx/getTreeNode.ashx?pid=" + node.id + "&coln=" + escape(name.toString()) + "&casn=" + escape(node.attributes.cas.toString()),
                cache: false,
                async: false,
                dataType: "json",
                success: function (data) {
                    if (nodekeep.indexOf(node.id) == -1) {
                        append(data, node);
                        nodeExp = true;
                    }
                }
            });
            $("#radCollapse").removeAttr("checked");
        },
        onLoadError: function (Error) {
            $.messager.alert('提示', '查询语句出错', 'error');
            if (nodeExp == false) {
                $("#basetree").children().remove();
            }
        },
        onLoadSuccess: function (success) {
            var child = $("#basetree").children().length;
            noinf++;
            if (child == 0 && noinf > 1) {
                $.messager.alert('提示', '数据不存在', 'Info');
            }
        }
    });

}

function treeWindowClose() {
    $('#treewindow').window('close');
    nodekeep = "";
    nodekeep = false;
}

function treeWindowSubmit() {
    var nodes = $('#basetree').tree('getChecked');
    var info = '';
    if (nodes.length > 0) {
        for (var i = 0; i < nodes.length; i++) {
            if (info != '') {
                info += ',';
            }
            info += nodes[i].text;
        }
//alert(JSON.stringify(nodes));
    }
    else {
        var node = $('#basetree').tree('getSelected');
        if (node != null) {
            info = node.text;
        }
    }
    $("#" + rows).val(info);
    $('#treewindow').window('close');
    nodekeep = "";
    nodeExp = false;
}

//全部展开
function collapseAll() {
    $("#radCollapse").attr("checked", "checked");
    var node = $('#basetree').tree('getSelected');
    if (node) {
        $('#basetree').tree('collapseAll', node.target);
    } else {
        $('#basetree').tree('collapseAll');
    }
}

//全部收缩
function expandAll() {
    var node = $('#basetree').tree('getSelected');
    if (node) {
        $('#basetree').tree('expandAll', node.target);
    } else {
        $('#basetree').tree('expandAll');
    }
}

//增加子节点
function append(datas, cnode) {
    var node = cnode;
    $('#basetree').tree('append', {
        parent: node.target,
        data: datas
    });
    nodekeep += "," + node.id;
}

//重新加载
function reload() {
    var node = $('#basetree').tree('getSelected');
    if (node) {
        $('#basetree').tree('reload', node.target);
    } else {
        $('#basetree').tree('reload');
    }
}

//删除子节点
function remove() {
    var node = $('#basetree').tree('getSelected');
    $('#basetree').tree('remove', node.target);
}

 

转载于:https://www.cnblogs.com/hackxiyu/p/8031286.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值