不用迭代算法而快速实现的jsp树结构

var tree = new WebFXTree("单位人员基本情况","R0");
var child;
var nodeToAddPerson;

function addDeptTreeNode(preNodeLevel,curNodeLevel,dispLabel,sKey,sTag) {
  if(curNodeLevel==1) {
     child = tree.add(new WebFXTreeItem(dispLabel,sKey,sTag));
  }
  else {
    if(curNodeLevel==preNodeLevel) {
       if(child.parentNode)
        child = child.parentNode.add(new WebFXTreeItem(dispLabel,sKey,sTag));
    }
    if(curNodeLevel>preNodeLevel) {
       child = child.add(new WebFXTreeItem(dispLabel,sKey,sTag));
    }
    if(curNodeLevel<preNodeLevel) {
        for(i=0;i<preNodeLevel-curNodeLevel+1;i++)
           child = child.parentNode;
        child = child.add(new WebFXTreeItem(dispLabel,sKey,sTag));
    }
  }
  return child;
}

function treeClick() {
 if(tree.getSelected()) {
     if(tree.getSelected().childNodes.length==0&&tree.getSelected().key!="R0")
       cmdDelete.disabled = false;
     else
       cmdDelete.disabled = true;
     if(tree.getSelected().key.substr(0,2)=="RZ") {

上一页 [1] [2] [3] [4] [5] [6] [7] [8] 下一页

复制本页网址和标题，发送给你QQ/Msn的好友一起分享

上一篇:缓冲技术提高JSP程序性能和稳定性

下一篇:JSP显示图片问题的解决