/*--------------------------------------------------| | 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 | |--------------------------------------------------*/ function getSizes() { var len = 0; for (var n=0; n (1024 * 1024 * 1024)) { rsize = Math.round((sel / (1024 * 1024 * 1024))*100)/100 + " GB"; } else if (sel < 1024 * 1024) { rsize = Math.round((sel / 1024)*10)/10 + " KB"; } else { rsize = Math.round((sel / (1024 * 1024))*10)/10 + " MB"; } document.getElementById("sel").innerHTML = String(sel) + " (" + rsize +")"; } function chg(node,status,recursion) { var n=0; if (typeof status == 'undefined') { while(d.aNodes[n].id != node && n'; } // dirty hack by alatar :) str += ''; // alatar end if (node.url) { str += ''; str += node.name; if (node.url || ((!this.config.folderLinks || !node.url) && node._hc)) str += ''; str += ''; if (node._hc) { str += '
'; str += this.addNode(node); str += '
'; } 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'; (node._ls) ? this.aIndent.push(0) : this.aIndent.push(1); if (node._hc) { str += ''; } else str += ''; } 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