/* 
	the format of the tree definition file is simple,
	you can find specification in the product documentation at:
	
	http://www.softcomplex.com/products/tigra_tree_menu_pro/docs/#hierarchy
*/

var TREE_ITEMS = [

['IMAT', 0, {'tt' : 'IMAT', 'sb':'IMAT'},
	['IMAT Home', '/software/imat/index.html'],
	['News', , ,
		['Press Release', '/news/IMAT25_press_release_Oct_08.html'], ],
	['Installation/Trial', , ,
		['Free Trial', 'index.html#GetIMAT'], ],
	['Product Info/Support', , ,
		['IMAT User Guide', 'http://www.ata-e.com/software/imat/all_doc/doc/index.html'],
		['Brochure', '/brochures/software/IMAT+_and_+Testkit_and_+RTK.pdf'],
],
],

['.'],

['ALL SOFTWARE', 0, {'tt' : 'All ATA Software', 'sb':'All ATA Software'}, 
	['Software Home', '/software'],
	['Commercial Software', '/software/index.htm'],
	['VAR Products', '/software/ata-var.htm'],
	['Contact ATA', '/info/contact.htm'],
	['TIER Support Forum','https://tier.ata-e.com', {'tw' : '_blank'},],
	['Purchase Products', '../rmsserver/index.html', {'tw' : '_blank'},],
],
]


//prepare icon-set for HDD item
var tree_iconset_hdd = {
	'i0' : 'icons2/drive.gif',	//Icon for item
	'i4' : 'icons2/drive.gif',	//Icon for selected item
	'i8' : 'icons2/drive.gif',	//Icon for opened item
	'i12' : 'icons2/drive.gif',	//Icon for selected opened item
	'i64' : 'icons2/drive.gif',	//Icon for item when mouse is over it
	'i68' : 'icons2/drive.gif', //Icon for selected item when mouse is over it
	'i72' : 'icons2/drive.gif', //Icon for opened item when mouse is over it
	'i76' : 'icons2/drive.gif'	//Icon for selected opened item when mouse is over it
};
//prepare icon-set for cd-rom item
var tree_iconset_cd = {
	'i0' : 'icons2/cddrive.gif',//Icon for item
	'i4' : 'icons2/cddrive.gif',//Icon for selected item
	'i64' : 'icons2/cddrive.gif',//Icon for item when mouse is over it
	'i68' : 'icons2/cddrive.gif'//Icon for selected item when mouse is over it
};

function join_objects(){
	var x = [];
	for(var i=0; arguments && i < arguments.length; i++)
		for(var k in arguments[i]) x[k] = arguments[i][k];
	return x;
}