ztree 一次性加载大数据量
2015-08-26 10:48
447 查看
ztree 一次性加载大数据量:
var setting = {
check: {
enable: true
},
data: {
simpleData: {
enable: true
}
},
callback: {
onNodeCreated: onNodeCreated //只有展开的节点才会触发
}
};
var dataMaker = function(count) {
var nodes = [], pId = -1,
min = 10, max = 90, level = 0, curLevel = [], prevLevel = [], levelCount,
i = 0,j,k,l,m;
while (i<count) {
//alert(level);
if (level == 0) {
pId = -1;
levelCount = Math.round(Math.random() * max) + min;//Math.round四舍五入取整Math.random():0~1 随机
// 10 < levelCount < 100 整数
//alert(levelCount);
for (j=0; j<2 && i<count; j++, i++) {
//alert(999);
var n = {id:i, pId:pId, name:"Big-" +i,open:true};
nodes.push(n);
curLevel.push(n);
}
} else {
//alert(888);
for (l=0, m=prevLevel.length; l<m && i<count; l++) {
pId = prevLevel[l].id;
levelCount = Math.round(Math.random() * max) + min;
for (j=0; j<2 && i<count; j++, i++) {
var n = {id:i, pId:pId, name:"Big-" +i};
nodes.push(n);
curLevel.push(n);
}
}
}
prevLevel = curLevel;
curLevel = [];
level++;
}
return nodes;
}
var showNodeCount = 0;
function onNodeCreated(event, treeId, treeNode) {
showNodeCount++;
}
function createTree () {
var zNodes = dataMaker(11);
showNodeCount = 0;
$("#treeDemo").empty();
setting.check.enable = $("#showChk").attr("checked");
var time1 = new Date();
$.fn.zTree.init($("#treeDemo"), setting, zNodes);
var time2 = new Date();
alert("节点共 " + zNodes.length + " 个, 初始化生成 DOM 的节点共 " + showNodeCount + " 个"
+ "\n\n 初始化 zTree 共耗时: " + (time2.getTime() - time1.getTime()) + " ms");
}
$(document).ready(function(){
$("#createTree").bind("click", createTree);
});
页面有 点击. 当点击 ID为createTree 时,调用.现象如下:
var setting = {
check: {
enable: true
},
data: {
simpleData: {
enable: true
}
},
callback: {
onNodeCreated: onNodeCreated //只有展开的节点才会触发
}
};
var dataMaker = function(count) {
var nodes = [], pId = -1,
min = 10, max = 90, level = 0, curLevel = [], prevLevel = [], levelCount,
i = 0,j,k,l,m;
while (i<count) {
//alert(level);
if (level == 0) {
pId = -1;
levelCount = Math.round(Math.random() * max) + min;//Math.round四舍五入取整Math.random():0~1 随机
// 10 < levelCount < 100 整数
//alert(levelCount);
for (j=0; j<2 && i<count; j++, i++) {
//alert(999);
var n = {id:i, pId:pId, name:"Big-" +i,open:true};
nodes.push(n);
curLevel.push(n);
}
} else {
//alert(888);
for (l=0, m=prevLevel.length; l<m && i<count; l++) {
pId = prevLevel[l].id;
levelCount = Math.round(Math.random() * max) + min;
for (j=0; j<2 && i<count; j++, i++) {
var n = {id:i, pId:pId, name:"Big-" +i};
nodes.push(n);
curLevel.push(n);
}
}
}
prevLevel = curLevel;
curLevel = [];
level++;
}
return nodes;
}
var showNodeCount = 0;
function onNodeCreated(event, treeId, treeNode) {
showNodeCount++;
}
function createTree () {
var zNodes = dataMaker(11);
showNodeCount = 0;
$("#treeDemo").empty();
setting.check.enable = $("#showChk").attr("checked");
var time1 = new Date();
$.fn.zTree.init($("#treeDemo"), setting, zNodes);
var time2 = new Date();
alert("节点共 " + zNodes.length + " 个, 初始化生成 DOM 的节点共 " + showNodeCount + " 个"
+ "\n\n 初始化 zTree 共耗时: " + (time2.getTime() - time1.getTime()) + " ms");
}
$(document).ready(function(){
$("#createTree").bind("click", createTree);
});
页面有 点击. 当点击 ID为createTree 时,调用.现象如下:
相关文章推荐
- JDBC、Hibernate、Mybaites处理数据的流程及对DAO的理解
- [UVA 11853]Paintball[DFS]
- Cocos2d-x3.3RC0 Cpp-test分析之NewAudioEngineDemo(转:http://blog.csdn.net/yuxikuo_1/article/details/41081453)
- htons,ntohs,htonl,ntohl(cp:http://blog.csdn.net/libuding/article/details/5860578)
- raid的几种区别
- 大小端(cp:http://blog.csdn.net/libuding/article/details/5860578)
- ERROR 1205 (HY000): Lock wait timeout exceeded; try restarting transaction
- 算法杂货铺——分类算法之朴素贝叶斯分类(Naive Bayesian classification)
- hdfs常用命令
- 保利威视后台设置播放域名黑白名单
- 解决系统存在大量TIME_WAIT状态的连接
- Container With Most Water
- Console显示:Conversion to Dalvik format failed with error 1 ;your project contains errors) please fix
- 游戏人工智能开发之人群的动态行为交互仿真
- 调试的时候 line not available!
- 游戏人工智能开发之人群的动态行为交互仿真
- Python源码分析3 – 词法分析器PyTokenizer http://blog.csdn.net/atfield/article/details/1439068
- [Python源码学习] 之 Python解释器 http://blog.csdn.net/dbzhang800/article/details/6683440
- 父进程waitpid子进程的一般实现
- hdoj 3376 Matrix Again and hdoj 2686 Matrix 【最大费用最大流】