jq无限极树结构

//群组树结构
$(function () {
var params= { "companyId":cmpId };
var loadUrl="/apiv2/classify/createBuildClassifyTree";
console.log(params);
$.ajaxSend(loadUrl,params,sessionId,cmpId).done(function(data){
console.log(JSON.stringify(data));
if (data.code=="00000000"){
$('.noData').hide();
var data1=data.payload.results.dataLists;
/*递归实现获取无级树数据并生成DOM结构*/
var str = "";
var forTree = function(o){
for(var i=0;i<o.length;i++){
var urlstr = "";
try{
if(typeof o[i]["subClassify"] == "undefined"){
urlstr = "<div><span>"+ o[i]["name"] +"</span><ul style='background: none'>";
}else{
urlstr = '<div><span><i class='+ o[i]["subClassify"] +'>'+ o[i]['name'] +'</i></span><ul style="background: none">';
}
str += urlstr;
if(o[i]["subClassify"] != null){
forTree(o[i]["subClassify"]);
}
str += "</ul></div>";
}catch(e){}
}
return str;
};
/*添加无级树*/
document.getElementById("menuTree").innerHTML = forTree(data1);
/*树形菜单*/
var menuTree = function(){
//给有子对象的元素加[+-]
$("#menuTree ul").each(function(index, element) {
var ulContent = $(element).html();
var spanContent = $(element).siblings("span").html();
if(ulContent){
$(element).siblings("span").html("<img src='../../../media/images/show_tree.png' style='vertical-align: middle'/> " + spanContent)
}
});
$("#menuTree").find("div span").click(function(){
var ul = $(this).siblings("ul");
var spanStr = $(this).html();
var spanContent = spanStr.substr(78,spanStr.length);
if(ul.find("div").html() != null){
if(ul.css("display") == "none"){
ul.show(300);
$(this).html("<img src='../../../media/images/show_tree.png' style='vertical-align: middle'/> " + spanContent);
}else{
ul.hide(300);
$(this).html("<img src='../../../media/images/hide_tree.png' style='vertical-align: middle'/> " + spanContent);
}
}
})
}()
}else {
// layer.msg("加载失败,请重试!",{
// time:2000
// });
//$('.noData').show();
}
});
});

posted on 2017-01-21 11:14  Mike17  阅读(249)  评论(0编辑  收藏  举报

导航

搜狗