// Arrays for nodes and icons
var nodes			= new Array();;
var openNodes	= new Array();
var icons			= new Array(6);

// Loads all icons that are used in the tree
function preloadIcons() {
	icons[0] = new Image();
	icons[0].src = "/corp/images/plus.gif";
	icons[1] = new Image();
	icons[1].src = "/corp/images/plusbottom.gif";
	icons[2] = new Image();
	icons[2].src = "/corp/images/minus.gif";
	icons[3] = new Image();
	icons[3].src = "/corp/images/minusbottom.gif";
	icons[4] = new Image();
	icons[4].src = "/corp/images/s.gif";
	icons[5] = new Image();
	icons[5].src = "/corp/images/s.gif";
}
// Create the tree
function createTree(arrName, startNode, openNode) {
	nodes = arrName;
	if (nodes.length > 0) {
		preloadIcons();
		if (startNode == null) startNode = 0;
		if (openNode != 0 || openNode != null) setOpenNodes(openNode);
	
		if (startNode !=0) {
			var nodeValues = nodes[getArrayId(startNode)].split("|");
			//document.write("<a href=\"" + nodeValues[3] + "\" onmouseover=\"window.status='" + nodeValues[2] + "';return true;\" onmouseout=\"window.status=' ';return true;\"><img src=\"/corp/images/s.gif\" border=\"0\" align=\"absmiddle\" alt=\"\" />" + nodeValues[2] + "</a><br />");
		} //else document.write("<img src=\"/corp/images/base.gif\" align=\"absmiddle\" alt=\"\" />Website<br />");
	
		var recursedNodes = new Array();
		addNode(startNode, recursedNodes);
	}
}
// Returns the position of a node in the array
function getArrayId(node) {
	for (i=0; i<nodes.length; i++) {
		var nodeValues = nodes[i].split("|");
		if (nodeValues[0]==node) return i;
	}
}
// Puts in array nodes that will be open
function setOpenNodes(openNode) {
	for (i=0; i<nodes.length; i++) {
		var nodeValues = nodes[i].split("|");
		if (nodeValues[0]==openNode) {
			openNodes.push(nodeValues[0]);
			setOpenNodes(nodeValues[1]);
		}
	} 
}
// Checks if a node is open
function isNodeOpen(node) {
	if(getCookie("theDiv.style.display")=="open"){
	return true;
	}else{
	for (i=0; i<openNodes.length; i++)
	if (openNodes[i]==node) return true;
	//alert(getCookie("theDiv.style.display"));
	return false;
	}
}
// Checks if a node has any children
function hasChildNode(parentNode) {
	for (i=0; i< nodes.length; i++) {
		var nodeValues = nodes[i].split("|");
		if (nodeValues[1] == parentNode) return true;
	}
	return false;
}
// Checks if a node is the last sibling
function lastSibling (node, parentNode) {
	var lastChild = 0;
	for (i=0; i< nodes.length; i++) {
		var nodeValues = nodes[i].split("|");
		if (nodeValues[1] == parentNode)
			lastChild = nodeValues[0];
	}
	if (lastChild==node) return true;
	return false;
}

function fixDate(date) {

  var base = new Date(0);

  var skew = base.getTime();

  if (skew > 0)

    date.setTime(date.getTime() - skew);
}

//set cookie
function setCookie(name, value, expires, path, domain, secure) {

  var curCookie = name + "=" + escape(value) +

      ((expires) ? "; expires=" + expires.toGMTString() : "") +

      ((path) ? "; path=" + path : "") +

      ((domain) ? "; domain=" + domain : "") +

      ((secure) ? "; secure" : "");

  document.cookie = curCookie;

}
//get cookie
function getCookie(name) {

  var dc = document.cookie;
  //alert(dc);
  var prefix = name + "=";

  var begin = dc.lastIndexOf("; " + prefix);

  if (begin == -1) {

    begin = dc.indexOf(prefix);

    if (begin != 0) return null;

  } else

    begin += 2;

  var end = document.cookie.indexOf(";", begin);

  if (end == -1)

    end = dc.length;

  return unescape(dc.substring(begin + prefix.length, end));

}


// Adds a new node to the tree
function addNode(parentNode, recursedNodes) {
	for (var i = 0; i < nodes.length; i++) {

		var nodeValues = nodes[i].split("|");
		if (nodeValues[1] == parentNode) {
			
			var ls	= lastSibling(nodeValues[0], nodeValues[1]);
			var hcn	= hasChildNode(nodeValues[0]);
			var ino = isNodeOpen(nodeValues[0]);
			document.write("<table width=\"100%\" height=\"20\"  border=\"0\" cellspacing=\"0\" cellpadding=\"0\"><tr><td class=\"leftmenu\"> ");
			
			// Write out line & empty icons
			for (g=0; g<recursedNodes.length; g++) {
				//if (recursedNodes[g] == 1) document.write("<img src=\"/corp/images/line.gif\" align=\"absmiddle\" alt=\"\" />");
				//else  document.write("<img src=\"/corp/images/empty.gif\" align=\"absmiddle\" alt=\"\" />");
			}

			// put in array line & empty icons
			if (ls) recursedNodes.push(0);
			else recursedNodes.push(1);
			
			// If node has children write out divs and go deeper
						if (hcn) {
							document.write("<div id=\"div" + nodeValues[0] + "\"");
								if (!ino) document.write(" style=\"display: none;\"");
							document.write(">");
							addNode(nodeValues[0], recursedNodes);
							document.write("</div>");
			}

			// Write out join icons
			if (hcn) {
				if (ls) {
					document.write("<a href=\"javascript: oc(" + nodeValues[0] + ", 1);\">");
					 	if (ino) document.write("<span id=\"join" + nodeValues[0] + "\" style=\"padding-top:3px; padding-left:2px; font-weight: bold; color: #5A5AFF;text-decoration: none;\">Less</span>");
						else document.write("<span id=\"join" + nodeValues[0] + "\" style=\"padding-top:3px; padding-left:2px; font-weight: bold; color: #5A5AFF;text-decoration: none;\">More</span>");
					document.write("</a>");
				} else {
					document.write("<a href=\"javascript: oc(" + nodeValues[0] + ", 0);\" >");
						if (ino) document.write("<span id=\"join" + nodeValues[0] + "\" style=\"padding-top:3px; padding-left:2px; font-weight: bold; color: #5A5AFF;text-decoration: none;\">Less</span>");
						else document.write("<span id=\"join" + nodeValues[0] + "\" style=\"padding-top:3px; padding-left:2px; font-weight: bold; color: #5A5AFF;text-decoration: none;\">More</span>");
					document.write("</a>");
				}
			} else {
				//if (ls) document.write("<img src=\"/corp/images/arr1.jpg\" align=\"absmiddle\" alt=\"\" />");
				//else document.write("<img src=\"/corp/images/arr1.jpg\" align=\"absmiddle\" alt=\"\" />");
			}

			// Start link
			if (hcn)
			document.write("<a href=\"" + nodeValues[3] + "\" onmouseover=\"window.status='" + nodeValues[2] + "';return true;\" onmouseout=\"window.status=' ';return true;\" class=\"leftmenu\" style=\"padding-top:3px; padding-left:15px; font-weight: bold; color: #5A5AFF;text-decoration: none;\">");
			else
			document.write("<a href=\"" + nodeValues[3] + "\" onmouseover=\"window.status='" + nodeValues[2] + "';return true;\" onmouseout=\"window.status=' ';return true;\" class=\"leftmenu\">");
			// Write out folder & page icons
			if (hcn) {				
				document.write("<img id=\"icon" + nodeValues[0] + "\" src=\"/corp/images/s")
					//if (ino) document.write("");
				document.write(".gif\" align=\"absmiddle\"  border=\"0\"/>");
			} //else document.write("<img id=\"icon" + nodeValues[0] + "\" src=\"/corp/images/page.gif\" align=\"absmiddle\" alt=\"Page\" />");
			
			// Write out node name
			//if (hcn) {document.write("<div style=\"padding-top:3px; padding-left:15px; font-weight: bold; color: #3688BA;text-decoration: none;\">");}
			document.write(" "+nodeValues[2]);
			//if (hcn) {document.write("</div>");}
			// End link
			document.write("</a>");
			
			document.write("</td></tr></table>");
			// remove last line or empty icon 
			recursedNodes.pop();
		}
	}
}


// Opens or closes a node
function oc(node, bottom) {
	var theDiv = document.getElementById("div" + node);
	var theJoin	= document.getElementById("join" + node);
	var theIcon = document.getElementById("icon" + node);
	
	var now = new Date();
	fixDate(now);
	now.setTime(now.getTime() + 365 * 24 * 60 * 60 * 1000);
	if (theDiv.style.display == 'none') {
		if (bottom==1) theJoin.src = icons[3].src;
		else theJoin.src = icons[2].src;
		theIcon.src = icons[5].src;
		theDiv.style.display = '';
		setCookie("theDiv.style.display","open",now,'/');
	} else {
		if (bottom==1) theJoin.src = icons[1].src;
		else theJoin.src = icons[0].src;
		theIcon.src = icons[4].src;
		theDiv.style.display = 'none';
		setCookie("theDiv.style.display","close",now,'/');
	}
		//alert(getCookie("theDiv.style.display"));
}
// Push and pop not implemented in IE
if(!Array.prototype.push) {
	function array_push() {
		for(var i=0;i<arguments.length;i++)
			this[this.length]=arguments[i];
		return this.length;
	}
	Array.prototype.push = array_push;
}
if(!Array.prototype.pop) {
	function array_pop(){
		lastElement = this[this.length-1];
		this.length = Math.max(this.length-1,0);
		return lastElement;
	}
	Array.prototype.pop = array_pop;
}