/**************************************************************************
	Copyright (c) 2001-2003 Geir Landro (drop@destroydrop.com)
	JavaScript Tree - www.destroydrop.com/hjavascripts/tree/
	Version 0.96	

	This script can be used freely as long as all copyright messages are
	intact.
**************************************************************************/

// Arrays for nodes and icons
var nodes			= new Array();
var openNodes	= new Array();
var icons			= new Array(6);
var node_s = new Array();
var node_0 = new Array();
var node_1 = new Array();
var node_2 = new Array();
var node_3 = new Array();
var node_len = 0;
// Loads all icons that are used in the tree
function preloadIcons() {
	icons[0] = new Image();
	icons[0].src = "/images/tree/plus.gif";
	icons[1] = new Image();
	icons[1].src = "/images/tree/plusbottom.gif";
	icons[2] = new Image();
	icons[2].src = "/images/tree/minus.gif";
	icons[3] = new Image();
	icons[3].src = "/images/tree/minusbottom.gif";
	icons[4] = new Image();
	icons[4].src = "/images/tree/item.gif";
}
// Create the tree
function createTree(arrName, startNode, openNode) {
	nodes = arrName;
	if (nodes.length > 0) {
		preloadIcons();
    node_len = nodes.length;
		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=\"/images/tree/blank.gif\" align=\"absbottom\" alt=\"\" />" + nodeValues[2] + "</a>");
		} else document.write("");
	
		var recursedNodes = new Array();



        for (var i = 0; i < node_len; i++) {
            var node_s = nodes[i].split("|");
            node_0[i] = node_s[0];
            node_1[i] = node_s[1];
            node_2[i] = node_s[2];
            node_3[i] = node_s[3];
        }
        addNode(startNode, recursedNodes);
        
       // setTimeout(addNode(startNode, recursedNodes), 10000);
	}
}
// Returns the position of a node in the array
function getArrayId(node) {
	for (i=0; i<node_len; 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<node_len; 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) {
	for (i=0; i<openNodes.length; i++)
		if (openNodes[i]==node) return true;
	return false;
}
// Checks if a node has any children
function hasChildNode(parentNode) {
	for (i=0; i< node_len; i++) {
        if (node_1[i] == parentNode) return true;
	}
	return false;
}
// Checks if a node is the last sibling
function lastSibling (node, parentNode) { 
    for (i=node_len;i!=-1;i--){
		if (node_1[i] == parentNode){
            if (node_0[i]==node) {
                return true;
            } else {
                return false;
            }
        }
	}
	return false;
}
// Adds a new node to the tree
function addNode(parentNode, recursedNodes) {
   

	for (var i = 0; i < node_len; i++) {
		
		var nodeNameForA = node_0[i];
		if (node_1[i] == parentNode) {
			
			var ls	= lastSibling(node_0[i], node_1[i]);
			var hcn	= hasChildNode(node_0[i]);
			var ino = isNodeOpen(node_0[i]);

			// put in array line & empty icons
			if (ls) recursedNodes.push(0);
			else recursedNodes.push(1);

			// Write out join icons
			if (hcn) {
				if (ls) {
					document.write("<a class=\"tree-img\" href=\"javascript: oc(" + node_0[i] + ", 1);\"><img id=\"join" + node_0[i] + "\" src=\"/images/tree/");
					 	if (ino) document.write("minus");
						else document.write("plus");
					document.write("bottom.gif\" align=\"absbottom\" alt=\"Открыть/Закрыть пункт\" /></a>");
				} else {
					document.write("<a class=\"tree-img\" href=\"javascript: oc(" + node_0[i] + ", 0);\"><img id=\"join" + node_0[i] + "\" src=\"/images/tree/");
						if (ino) document.write("minus");
						else document.write("plus");
					document.write(".gif\" align=\"absbottom\" alt=\"Открыть/Закрыть пункт\" /></a>");
				}
                document.write("<a id='tree-" + nodeNameForA + "'");
									if (ino) document.write(" class=\"tree-act\" ");
								document.write("href='javascript: oc(" + node_0[i] + ", 1);' onmouseover=\"window.status='" + node_2[i] + "';return true;\" onmouseout=\"window.status=' ';return true;\">"+node_2[i]+"</a><div id=\"div" + node_0[i] + "\"");
                    if (!ino) document.write(" style=\"display: none;\"");
									document.write(">");
			} else {
                document.write("<a class=\"tree-item-link\" id=\"tree-" + nodeNameForA + "\" href=\"" + node_3[i] + "\" onmouseover=\"window.status='" + node_2[i] + "';return true;\" onmouseout=\"window.status=' ';return true;\"><img id=\"icon" + node_0[i] + "\" src=\"/images/tree/item.gif\" align=\"absbottom\" alt=\"Деталь\" />"+node_2[i]+"</a>");
			}			
			// If node has children write out divs and go deeper
			if (hcn) {
				addNode(node_0[i], recursedNodes);
				document.write("</div>");
			}			
			// remove last line or empty icon 
			recursedNodes.pop();
		}
	}
}
// Opens or closes a node
function oc(node, bottom) {
	if(typeof document.getElementById('footer') != 'undefined'){
		document.getElementById('footer').style.display = 'none';
		document.getElementById('footer').style.display = 'block';
	}
	var theDiv = document.getElementById("div" + node);
	var theJoin	= document.getElementById("join" + node);
	var theTree = document.getElementById("tree-" + node);
	
	if (theDiv.style.display == 'none') {
		if (bottom==1) theJoin.src = icons[3].src;
		else theJoin.src = icons[2].src;
		theDiv.style.display = '';
		theTree.className += ' tree-act';
	} else {
		if (bottom==1) theJoin.src = icons[1].src;
		else theJoin.src = icons[0].src;
		theDiv.style.display = 'none';
		theTree.className = theTree.className.replace(/\s?(tree\-act)/g,'');
	}
}
// 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;
}


function hnode (id,node,node2){
	var detail = document.getElementById('tree-' + id);
	if (!detail){      
		alert("Нет такой детали для данной модели");
    return;
  }

	detail.className += " tree-act";
	if (node){
		var theDiv = document.getElementById("div" + node);
		if (theDiv.style.display == 'none') {
			oc(node,0);
		}
	}

	if (node2){
		var theDiv = document.getElementById("div" + node2);
		if (theDiv.style.display == 'none') {
			oc(node2,0);
		}
	}	
};

function load_detail(id,placement){

    placement = placement || '';
    //document.getElementById('lastusedid').value = id;
    //document.getElementById('lastusedplacement').value = placement;
    //var withpricesonly =  document.getElementById('withpricesonly').checked;
    
    //if (withpricesonly) withpricesonly = 1 ; else
        withpricesonly = 0;
	document.getElementById('goodspanel').innerHTML = document.getElementById('loading_image').innerHTML;
        $.post("/app/treeajax.php", { br: id, m: document.getElementById('modification').value, placement: placement },
            function(data){
               // alert("Data Loaded: " + data);
               $('#goodspanel').html(data);
        });
        

}