dtree.js改写，实现树状节点动态添加(解析树状htmll生成xml字符串)
1.先来介绍一下. dtree 的用法.(我引用了以前我收集的一篇文章.还比较详细,出处不记得啦).文章下面会附带dtree用法的例子.
???????? Dtree目录树的总结
????????????????? 一：函数
?????????????????????????? 1：页面中
????????????????????????????? tree.add(id,pid,name,url,title,target,icon,iconOpen,open);
????????????????????????????????? 参数说明：
????????????????????????????????????????????? id???????? ：节点自身的id
????????????????????????????????????????????? pid?????? ：节点的父节点的id
????????????????????????????????????????????? name??? ：节点显示在页面上的名称
????????????????????????????????????????????? url??????? ：节点的链接地址
????????????????????????????????????????????? title????? ：鼠标放在节点上所出现的提示信息
????????????????????????????????????????????? target?? ：节点链接所打开的目标frame(如框架目标mainFrame,_blank,_self 类)
????????????????????????????????????????????? icon????? ：节点关闭时的显示图片的路径
????????????????????????????????????????????? iconOpen：节点打开时的显示图片的路径
????????????????????????????????????????????? open??? ：布尔型，节点是否打开（默认为false）
???????????????????????????????????????????? 注：open项：顶级节点一般采用true，即pid是－1的节点
??????????????????????????? 2：dtree.js文件中
???????????????????????????????????????????? 约87－113行是一些默认图片的路径，注意要指对。
二：页面中的书写
????????? 1：默认值的书写规则（从左至右，依次省略）
????????????????????????? 即 tree.add(id,pid,name,url);后面5个参数可以省略
????????? 2：有间隔时的默认值（如存在第6个参数，但第5个参数想用默认值）
???????????????????????? 即 tree.add(id,pid,name,url,"",target);必须这样写
???????? 3：样式表
?????????? （1）：可以将dtree.css中的样式附加到你的应用中的主css中，如a.css
?????????? （2）：也可以同时引用dtree.css与a.css两个文件，但前提条件是两个css文件中不能有重复的样式
?2、下面是我对源码的改造，主要是添加了一个双击事件，并且添加了一些动态添加节点的功能。
首相附上源码的修改：
/*--------------------------------------------------|
?
| dTree 2.05 | www.destroydrop.com/javascript/tree/ |
?
|---------------------------------------------------|
?
| Copyright (c) 2002-2003 Geir Landr? ? ? ? ? ? ? ? |
?
| ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? |
?
| This script can be used freely as long as all ? ? |
?
| copyright messages are intact. ? ? ? ? ? ? ? ? ? ?|
?
| ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? |
?
| Updated: 17.04.2003 ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? |
?
|--------------------------------------------------*/
?
// Node object
function Node(id, pid, name, url, dcfun, title, target, icon, iconOpen, open)
{
?
this.id = id;
?
this.pid = pid;
?
this.name = name;
?
this.url = url;
// lin 增加双击事件定义
this.dcfun = dcfun;
?
this.title = title;
?
this.target = target;
?
this.icon = icon;
?
this.iconOpen = iconOpen;
?
this._io = open || false;
?
this._is = false;
?
this._ls = false;
?
this._hc = false;
?
this._ai = 0;
?
this._p;
?
};
?
// Tree object
?
function dTree(objName, htmlContainer)
{
?
this.config = {
?
target : null,
?
folderLinks : true,
?
useSelection : true,
?
useCookies : true,
?
useLines : true,
?
useIcons : true,
?
useStatusText : false,
?
closeSameLevel : false,
?
inOrder : false
?
}
?
this.icon = {
?
root : 'img/base.gif',
?
folder : 'img/folder.gif',
?
folderOpen : 'img/folderopen.gif',
?
node : 'img/page.gif',
?
empty : 'img/empty.gif',
?
line : 'img/line.gif',
?
join : 'img/join.gif',
?
joinBottom : 'img/joinbottom.gif',
?
plus : 'img/plus.gif',
?
plusBottom : 'img/plusbottom.gif',
?
minus : 'img/minus.gif',
?
minusBottom : 'img/minusbottom.gif',
?
nlPlus : 'img/nolines_plus.gif',
?
nlMinus : 'img/nolines_minus.gif'
?
};
?
this.obj = objName;
?
this.aNodes = [];
?
this.aIndent = [];
?
this.root = new Node(-1);
?
this.selectedNode = null;
?
this.selectedFound = false;
?
this.completed = false;
?
this.aNodesData = [];
this.container = htmlContainer || 'dtree'; // 上层容器
?
};
?
// Adds a new node to the node array
?
dTree.prototype.add = function(id, pid, name, url, dcfun, title, target, icon,
iconOpen, open)
{
//alert("open"+open);
this.aNodesData[this.aNodesData.length] = new Node(id, pid, name, url,
dcfun, title, target, icon, iconOpen, open);
};
// lin
dTree.prototype.add11 = function(id, pid, name, url, dcfun, title, target,
icon, iconOpen, open)
{
var idsID = this.queryID(id);
if (idsID > 0)
{
this.remove(id, idsID);
}
this.aNodesData[this.aNodesData.length] = new Node(id, pid, name, url,
dcfun, title, target, icon, iconOpen, open);
?
};
?
// Open/close all nodes
?
dTree.prototype.openAll = function()
{
?
this.oAll(true);
?
};
?
dTree.prototype.closeAll = function()
{
?
this.oAll(false);
?
};
?
// Outputs the tree to the page
?
dTree.prototype.toString = function()
{
?
var str = '<div src="'
+ ((node._io) ? node.iconOpen : node.icon)
+ '" alt="dtree.js改写，兑现树状节点动态添加(解析树状htmll生成xml字符串)" style="display:none;" />';
}
else
{
str += '<img id="i' + this.obj + nodeId + '" src="'
+ ((node._io) ? node.iconOpen : node.icon) + '" alt="dtree.js改写，兑现树状节点动态添加(解析树状htmll生成xml字符串)" />';
}
}
?
if (node.url)
{
?
str += '<a id="s'
+ this.obj
+ nodeId
+ '" href="' + node.url + '"';
?
if (node.title)
str += ' title="' + node.title + '"';
?
if (node.target)
str += ' target="' + node.target + '"';
?
if (this.config.useStatusText)
str += ' onmouseover="window.status=\'' + node.name + '\';return true;" onmouseout="window.status=\'\';return true;" ';
?
if (this.config.useSelection
&& ((node._hc && this.config.folderLinks) || !node._hc))
?
str += ' onclick="javascript: ' + this.obj + '.s(' + nodeId + ');"';
// alert("node.dcfun="+node.dcfun+"---"+node.name+"---"+node.url);
if (node.dcfun)
{
// alert("dcfun="+node.dcfun);
str += ' ondblclick="' + node.dcfun + '" ';
}
str += '>';
?
}
?
else if ((!this.config.folderLinks || !node.url) && node._hc
&& node.pid != this.root.id)
?
str += '<a href="javascript: ' + this.obj + '.o(' + nodeId
+ ');" style="display:'
+ ((this.root.id == node.pid || node._io) ? 'block' : 'none')
+ ';">';
?
str += this.addNode(node);
?
str += '</div>';
?
}
?
this.aIndent.pop();
return str;
?
};
?
// Adds the empty and line icons
?
dTree.prototype.indent = function(node, nodeId)
{
?
var str = '';
?
if (this.root.id != node.pid)
{
?
for ( var n = 0; n < this.aIndent.length; n++)
?
str += '<img src="' + ((this.aIndent[n] == 1 && this.config.useLines) ? this.icon.line
: this.icon.empty) + '" alt="dtree.js改写，兑现树状节点动态添加(解析树状htmll生成xml字符串)" />';
?
(node._ls) ? this.aIndent.push(0) : this.aIndent.push(1);
?
if (node._hc)
{
?
str += '<a href="javascript: ' + this.obj + '.o(' + nodeId
+ ');"><img id="j' + this.obj + nodeId + '" src="';
?
if (!this.config.useLines)
str += (node._io) ? this.icon.nlMinus : this.icon.nlPlus;
?
else
str += ((node._io) ? ((node._ls && this.config.useLines) ? this.icon.minusBottom
: this.icon.minus)
: ((node._ls && this.config.useLines) ? this.icon.plusBottom
: this.icon.plus));
?
str += '" alt="dtree.js改写，兑现树状节点动态添加(解析树状htmll生成xml字符串)" /></a>';
?
}
else
str += '<img src="' + ((this.config.useLines) ? ((node._ls) ? this.icon.joinBottom
: this.icon.join)
: this.icon.empty) + '" alt="dtree.js改写，兑现树状节点动态添加(解析树状htmll生成xml字符串)" />';
?
}
?
return str;
?
};
?
// Checks if a node has any children and if it is the last sibling
?
dTree.prototype.setCS = function(node)
{
?
var lastId;
?
for ( var n = 0; n < this.aNodes.length; n++)
{
?
if (this.aNodes[n].pid == node.id)
node._hc = true;
?
if (this.aNodes[n].pid == node.pid)
lastId = this.aNodes[n].id;
?
}
?
if (lastId == node.id)
node._ls = true;
?
};
?
// Returns the selected node
?
dTree.prototype.getSelected = function()
{
?
var sn = this.getCookie('cs' + this.obj);
?
return (sn) ? sn : null;
?
};
?
// Highlights the selected node
?
dTree.prototype.s = function(id)
{
// lin 增加选中事件
if (this.aNodes[id] == null)
return;
this.nodeSelected(this.aNodes[id].id);
if (!this.config.useSelection)
return;
var cn = this.aNodes[id];
// alert(document.getElementById("s" + this.obj + id).className);
if (cn._hc && !this.config.folderLinks)
return;
if (this.selectedNode != id)
{
?
if (this.selectedNode || this.selectedNode == 0)
{
?
eOld = document.getElementById("s" + this.obj + this.selectedNode);
if (eOld != null)
eOld.className = "node";
?
}
?
eNew = document.getElementById("s" + this.obj + id);
if (eNew != null)
eNew.className = "nodeSel";
?
this.selectedNode = id;
?
if (this.config.useCookies)
this.setCookie('cs' + this.obj, cn.id);
?
}
?
};
dTree.prototype.h = function(id)
{
var index = this.queryID(id);
document.getElementById("s" + this.obj + index).className = "nodeSel";
};
// Toggle Open or close
?
dTree.prototype.o = function(id)
{
?
var cn = this.aNodes[id];
this.nodeStatus(!cn._io, id, cn._ls);
?
cn._io = !cn._io;
?
if (this.config.closeSameLevel)
this.closeLevel(cn);
?
if (this.config.useCookies)
this.updateCookie();
?
};
?
// Open or close all nodes
?
dTree.prototype.oAll = function(status)
{
?
for ( var n = 0; n < this.aNodes.length; n++)
{
?
if (this.aNodes[n]._hc && this.aNodes[n].pid != this.root.id)
{
?
this.nodeStatus(status, n, this.aNodes[n]._ls)
?
this.aNodes[n]._io = status;
?
}
?
}
?
if (this.config.useCookies)
this.updateCookie();
?
};
?
// Opens the tree to a specific node
?
dTree.prototype.openTo = function(nId, bSelect, bFirst)
{
?
if (!bFirst)
{
?
for ( var n = 0; n < this.aNodes.length; n++)
{
?
if (this.aNodes[n].id == nId)
{
?
nId = n;
?
break;
?
}
?
}
?
}
?
var cn = this.aNodes[nId];
?
if (cn.pid == this.root.id || !cn._p)
return;
?
cn._io = true;
?
cn._is = bSelect;
?
if (this.completed && cn._hc)
this.nodeStatus(true, cn._ai, cn._ls);
?
if (this.completed && bSelect)
this.s(cn._ai);
?
else if (bSelect)
this._sn = cn._ai;
?
this.openTo(cn._p._ai, false, true);
?
};
?
// Closes all nodes on the same level as certain node
?
dTree.prototype.closeLevel = function(node)
{
?
for ( var n = 0; n < this.aNodes.length; n++)
{
?
if (this.aNodes[n].pid == node.pid && this.aNodes[n].id != node.id
&& this.aNodes[n]._hc)
{
?
this.nodeStatus(false, n, this.aNodes[n]._ls);
?
this.aNodes[n]._io = false;
?
this.closeAllChildren(this.aNodes[n]);
?
}
?
}
?
}
?
// Closes all children of a node
?
dTree.prototype.closeAllChildren = function(node)
{
?
for ( var n = 0; n < this.aNodes.length; n++)
{
?
if (this.aNodes[n].pid == node.id && this.aNodes[n]._hc)
{
?
if (this.aNodes[n]._io)
this.nodeStatus(false, n, this.aNodes[n]._ls);
?
this.aNodes[n]._io = false;
?
this.closeAllChildren(this.aNodes[n]);
?
}
?
}
?
}
?
// Change the status of a node(open or closed)
?
dTree.prototype.nodeStatus = function(status, id, bottom)
{
?
eDiv = document.getElementById('d' + this.obj + id);
?
eJoin = document.getElementById('j' + this.obj + id);
?
if (this.config.useIcons)
{
?
eIcon = document.getElementById('i' + this.obj + id);
?
eIcon.src = (status) ? this.aNodes[id].iconOpen : this.aNodes[id].icon;
?
}
?
eJoin.src = (this.config.useLines) ?
?
((status) ? ((bottom) ? this.icon.minusBottom : this.icon.minus)
: ((bottom) ? this.icon.plusBottom : this.icon.plus)) :
?
((status) ? this.icon.nlMinus : this.icon.nlPlus);
?
eDiv.style.display = (status) ? 'block' : 'none';
?
};
?
// [Cookie] Clears a cookie
?
dTree.prototype.clearCookie = function()
{
?
var now = new Date();
?
var yesterday = new Date(now.getTime() - 1000 * 60 * 60 * 24);
?
this.setCookie('co' + this.obj, 'cookieValue', yesterday);
?
this.setCookie('cs' + this.obj, 'cookieValue', yesterday);
?
};
?
// [Cookie] Sets value in a cookie
?
dTree.prototype.setCookie = function(cookieName, cookieValue, expires, path,
domain, secure)
{
?
document.cookie =
?
escape(cookieName) + '=' + escape(cookieValue)
?
+ (expires ? '; expires=' + expires.toGMTString() : '')
?
+ (path ? '; path=' + path : '')
?
+ (domain ? '; domain=' + domain : '')
?
+ (secure ? '; secure' : '');
?
};
?
// [Cookie] Gets a value from a cookie
?
dTree.prototype.getCookie = function(cookieName)
{
?
var cookieValue = '';
?
var posName = document.cookie.indexOf(escape(cookieName) + '=');
?
if (posName != -1)
{
?
var posValue = posName + (escape(cookieName) + '=').length;
?
var endPos = document.cookie.indexOf(';', posValue);
?
if (endPos != -1)
cookieValue = unescape(document.cookie.substring(posValue, endPos));
?
else
cookieValue = unescape(document.cookie.substring(posValue));
?
}
?
return (cookieValue);
?
};
?
// [Cookie] Returns ids of open nodes as a string
?
dTree.prototype.updateCookie = function()
{
?
var str = '';
?
for ( var n = 0; n < this.aNodes.length; n++)
{
?
if (this.aNodes[n]._io && this.aNodes[n].pid != this.root.id)
{
?
if (str)
str += '.';
?
str += this.aNodes[n].id;
?
}
?
}
?
this.setCookie('co' + this.obj, str);
?
};
?
// [Cookie] Checks if a node id is in a cookie
?
dTree.prototype.isOpen = function(id)
{
?
var aOpen = this.getCookie('co' + this.obj).split('.');
?
for ( var n = 0; n < aOpen.length; n++)
?
if (aOpen[n] == id)
return true;
?
return false;
?
};
?
// If Push and pop is not implemented by the browser
?
if (!Array.prototype.push)
{
?
Array.prototype.push = function array_push()
{
?
for ( var i = 0; i < arguments.length; i++)
?
this[this.length] = arguments[i];
?
return this.length;
?
}
?
};
?
if (!Array.prototype.pop)
{
?
Array.prototype.pop = function array_pop()
{
?
lastElement = this[this.length - 1];
?
this.length = Math.max(this.length - 1, 0);
?
return lastElement;
?
}
?
};
// show the tree
dTree.prototype.draw = function()
{
// renew the two array to save original data.
this.aNodes = new Array();
this.aIndent = new Array();
for ( var i = 0; i < this.aNodesData.length; i++)
{
?
var oneNode = this.aNodesData[i];
this.aNodes[i] = new Node(oneNode.id, oneNode.pid, oneNode.name,
oneNode.url, oneNode.dcfun, oneNode.title, oneNode.target,
oneNode.icon, oneNode.iconOpen, oneNode._io);
}
this.rewriteHTML();
}
?
// outputs the tree to the page , callled by show()
dTree.prototype.rewriteHTML = function()
{
var str = '';
var container;
// alert("container=" + this.container);
container = document.getElementById(this.container);
if (!container)
{
alert('dTree can\'t find your specified container to show your tree.\n\n Please check your code!');
return;
}
if (this.config.useCookies)
this.selectedNode = this.getSelected();
str += this.addNode(this.root);
if (!this.selectedFound)
this.selectedNode = null;
this.completed = true;
//alert(str);
container.innerHTML = str;
};
?
// Checks if a node has children
dTree.prototype.hasChildren = function(id)
{
// alert(this.aNodesData.length);
for ( var i = 0; i < this.aNodesData.length; i++)
{
var oneNode = this.aNodesData[i];
if (oneNode.pid == id)
return true;
}
return false;
};
// 递归获取节点下所有字节点的数组，不包含当前节点
dTree.prototype.getChildNodeIdArray = function(id)
{
var array = new Array();
this.getChildArray(array, id);
return array;
};
// 递归获取方法内容
dTree.prototype.getChildArray = function(array, id)
{
for ( var i = 0; i < this.aNodesData.length; i++)
{
var oneNode = this.aNodesData[i];
if (oneNode.pid == id)
{
array.push(oneNode.id);
this.getChildArray(array, oneNode.id);
}
}
};
// remove a node 删除当前节点，以及所有子节点，可递归
dTree.prototype.remove = function(id)
{
for ( var i = 0; i < this.aNodesData.length; i++)
{
var oneNode = this.aNodesData[i];
if (oneNode.pid == id)
{
// 递归删除子节点
this.remove(oneNode.id);
i--;
}
}
?
for ( var i = 0; i < this.aNodesData.length; i++)
{
if (this.aNodesData[i].id == id)
{
this.aNodesData.remove(i);
}
}
};
?
dTree.prototype.removeChild = function(id)
{
for ( var i = 0; i < this.aNodesData.length; i++)
{
var oneNode = this.aNodesData[i];
if (oneNode.pid == id)
this.aNodesData.remove(i);
;
}
};
// define a remove method for Array
Array.prototype.remove = function(dx)
{
if (isNaN(dx) || dx > this.length)
{
return false;
}
for ( var i = 0, n = 0; i < this.length; i++)
{
if (this[i] != this[dx])
{
this[n++] = this[i];
}
}
this.length -= 1;
};
dTree.prototype.queryID = function(id)
{
// alert("query");
for ( var i = 0; i < this.aNodesData.length; i++)
{
var oneNode = this.aNodesData[i];
if (oneNode.id == id)
return i;
}
return -1;
};
dTree.prototype.updateNodeTitle = function(id, title)
{
for ( var i = 0; i < this.aNodesData.length; i++)
{
var oneNode = this.aNodesData[i];
if (oneNode.id == id)
{
oneNode.name = title;
this.draw();
}
}
};
dTree.prototype.selectNode = function(id)
{
var index = this.queryID(id);
this.s(index);
};
dTree.prototype.getNodeSelected = function()
{
var s = "";
if (this.selectedNode != "" && this.selectedNode != null)
s = this.aNodesData[this.selectedNode];
return s;
};
dTree.prototype.getNodeById = function(id)
{
var s = "";
for ( var i = 0; i < this.aNodesData.length; i++)
{
var oneNode = this.aNodesData[i];
if (oneNode.id == id)
s = oneNode;
}
return s;
};
dTree.prototype.nodeSelected = function(id)
{
};
dTree.prototype.nodeOpened = function(id)
{
var idx = this.queryID(id);
// alert("id="+id+",idx="+idx);
this.nodeStatus(true, idx, this.aNodes[idx]._ls);
this.s(idx);
};
dTree.prototype.openNode = function(id)
{
var idx = this.queryID(id);
this.o(idx);
};