var imgNode = "'../image/node.gif'"; var imgLastNode = "'../image/lastnode.gif'"; var imgVertLine = "'../image/vertline.gif'"; var imgEmpty = "'../image/empty.gif'"; var gTree; var gCurrNode; var undefined; // compatible with IE5(Javascript1.1?) //----------------------------------------------------------------------------------------------- // tree //----------------------------------------------------------------------------------------------- function tree(root, treeFrame,targetFrame) { this.root = root; this.currentNode = root; this.treeFrame = treeFrame; this.targetFrame = targetFrame; this.addNode = tree_addNote; this.redraw = tree_redraw; this.removeEmptyFolders = tree_removeEmptyFolders; this.getNodePath = tree_getNodePath; this.open = tree_open; gTree = this; gCurrNode = this.root; } function tree_addNote(parentID,node) { if(gCurrNode == undefined) gCurrNode = this.root.findNode(parentID); else if(gCurrNode.id != parentID) gCurrNode = this.root.findNode(parentID); if(gCurrNode != undefined) { gCurrNode.appendNode(node); } } function tree_redraw() { var doc = this.treeFrame.window.document; doc.clear(); doc.write(""); doc.write(""); doc.write(''); doc.write(""); doc.write(""); doc.write(""); this.root.redraw(doc, 0, 1, ""); doc.linkColor = 'black'; doc.alinkColor = 'black'; doc.vlinkColor = 'black'; doc.write(""); doc.write(""); doc.close(); } function tree_removeEmptyFolders() { this.root.removeEmptyFolders(); } function tree_getNodePath(id) { return this.root.getNodePath(id); } function tree_open(id) { return this.root.open(id); } //----------------------------------------------------------------------------------------------- // node //----------------------------------------------------------------------------------------------- var conTPFolder = 0; var conTPLeaf = 1; var conSTClose = 0; var conSTOpen = 1; function node(id, // unique id for every node name, // disp name for every node type, // node type : 0:folder,1:leaf, -1:empty node openICON, // image url for node open display closeICON, // image url for node close display linkUrl ) // a link url to pass to the targetFrame when is clicked { this.id = id; this.name = name; this.type = type; this.openICON = openICON; this.closeICON = closeICON; this.linkUrl = linkUrl; this.status = conSTClose; this.children = new Array(); this.appendNode = node_append; this.findNode = node_find; this.removeEmptyFolders = node_removeEmptyFolders; this.redraw = node_redraw; this.displayIconAndLabel = node_displayIconAndLabel; this.getNodePath = node_getNodePath; this.open = node_open; } function node_append(node) { this.children[this.children.length] = node; } function node_find(id) { var found; if(this.id == id) found = this; else { for(var i=0; i=0;i--) { var child = this.children[i]; child.removeEmptyFolders(); if(child.type!=conTPLeaf && child.children.length == 0) // this.children.splice(i,1); removeArray(this.children, i, 1); } } function node_redraw(doc, level, lastNode, leftSide) { doc.write(''); doc.write('

'); doc.write(leftSide); if (level>0) if (lastNode) //the last 'brother' in the children array { doc.write('

'); leftSide = leftSide + '

' ; } else { doc.write('

'); leftSide = leftSide + '

'; } this.displayIconAndLabel(doc); doc.write('

'); if (this.status==conSTOpen) // the folder is open, draw the children { for (var i=0; i'); doc.write(""); doc.write("

"); } else { doc.write("onMouseOver='window.status=\"Open folder\"; return true'>"); doc.write("

"); } doc.write(""); doc.write(""); doc.write("" +this.name+ ""); } function node_getNodePath(id) { var nodepath = ""; if (this.id == id) nodepath = this.name; else { for(var i=0; i0) { nodepath = this.name + "/" + nodepath; break; } } } return nodepath; } function node_open(id) { var opened; if (this.id == id) { this.status = conSTOpen; opened = this; } else { for(var i=0; i0) { if(linkUrl.search('%%NODEPATH%%')>0) { linkUrl = linkUrl.replace('%%NODEPATH%%',escape(gTree.getNodePath(id))); } gTree.targetFrame.location = linkUrl; } } return currNode; } function removeArray(arr, start, count) { if(start>=0 && count>0) { var cnt, len = arr.length; if(start>len) start = len; if(start+count>len) count=len-start; for(cnt=start;cnt