/***************************/
/*  NessCis Control Panel  */
/***************************/
/* Copyright 2010 NessCis  */
/***************************/

function selectall(status) {
	for (var i = 0; i < document.domainlist.elements.length; i++) {
		if(document.domainlist.elements[i].type == 'checkbox'){
			document.domainlist.elements[i].checked = status;
		}
	}
}

function selectdropdown(varname, value) {
	varname.value=value;
}

function selectradio(varname, value) {
	for (var i=0;i<varname.length;i++) {
		if (varname[i].value == value) {
			varname[i].checked = true;
		}
	}
}

function button_preload(id) {
	x = new Image();
	x.src='/img/formbuttons/'+id+'_x.gif';
	x.src='/img/formbuttons/'+id+'_i.gif';
}

function button_select(e) { //v3.0
	var id=this.id,j=0,x;

	if (!e) {
		e = window.event;
	}
	switch(e.type){
	case "mouseover":
		id=id+'_x';
		break;
	case "mousedown":
		id=id+'_i';
		break;
	default:
		id=id+'_n';
	}
	this.src='/img/formbuttons/'+id+'.gif';
	return true;
}

function button2_select(e) {
	if (!e) {
		e = window.event;
	}
	switch(e.type){
	case "mouseover":
		this.style.backgroundPosition='0% 50%';
		break;
	case "mousedown":
		this.style.backgroundPosition='0% 100%';
		break;
	default:
		this.style.backgroundPosition='0% 0%';
	}
	return true;
}

function datepicker_event(e) {
	if (!e) {
		e = window.event;
	}
	var pickerDiv = document.getElementById(datePickerDivID);
	switch(e.type){
	case "mousedown":
		if ((e.which || e.button) == 1) {
			displayDatePicker(this.name);
		}
		break;
	case "focus":
		if (!pickerDiv || (pickerDiv.style.visibility == 'hidden')) {
			displayDatePicker(this.name);
		}
		break;
	case "keydown":
		if (((e.which || e.keyCode) == 9) && pickerDiv && (pickerDiv.style.visibility == 'visible')) {
			displayDatePicker(this.name);
		}
		break;
	}
	return true;
}

// Fire the element's onchange event upon closing the DatePicker
function datePickerClosed(target)
{
	if (target.dispatchEvent) {
		e = document.createEvent('HTMLEvents');
		e.initEvent('change', true, false);
		target.dispatchEvent(e);
	} else if (target.onchange) {
		target.onchange();
	}
}

function update_clock(target)
{
	if (target.clear) {
		date = new Date();
		timestamp = String().concat(90000 + (date.getHours() % 12 || 12) * 100 + date.getMinutes()).substring(1);
	} else {
		timestamp = String().concat(9, target.value.match(/^\d\d/) % 12 || 12, target.value.match(/\d\d$/)).substring(1);
	}
	target.preload.src = '/clock/index.php?time=' + timestamp;
}

function update_timer(target)
{
	if (target.clear && !target.timer) {
		target.timer = window.setInterval(function() { update_clock(target) }, (60 - new Date().getSeconds()) * 1000);
	} else {
		window.clearInterval(target.timer);
		target.timer = 0;
	}
}

function timefield_event(e) {
	if (!e) {
		e = window.event;
	}

	switch(e.type){
	case 'focus':
		if (this.clear) {
			document.selection && document.selection.clear();
			this.value = '';
			this.style.color = '';
		}
		break;
	case 'blur':
		if (this.clear) {
			this.style.color = 'silver';
			this.value = 'HH:MM';
		}
		break;
	case 'change':
		this.value = this.value.replace(/^\D+|\D+$/g, '');
		this.clear = (this.value == '');
		update_timer(this);
		if (!this.clear) {
			matches = this.value.match(/(\d\d|\d)\D*(?:(\d\d)|\D|$)/);
			this.value = String(parseInt(matches[1], 10) % 24 + 900).substr(1) + ':' + String(parseInt('0' + matches[2], 10) % 60 + 900).substr(1);
			update_clock(this);
		}
		break;
	}
}

function preload_event(e) {
	this.owner.style.backgroundImage = 'url(' + this.src + ')';
};

function reset_field(target) {
	if (target.clear) {
		target.value = '';
	}
}

function setalpha(opacity,t) {
	var target=document.getElementById(t);

	if (target) {
		// If the element is completely transparent, hide it so events are not fired.
		if (opacity <= 0) {
			if (target.style.visibility != 'hidden') {
				target.style.visibility = 'hidden';
			}
		} else if (target.style.visibility != 'visible') {
			// Otherwise, ensure it's visible (needed for fading in).
			target.style.visibility = 'visible';
		}
		if (target.style.MozOpacity!==null) {
			target.style.MozOpacity = (opacity/100) - 0.001; //patrick h. lauke (http://www.splintered.co.uk/) workaround for Mozilla 'flash' bug - I _never_ would have caught that
		} else if (target.style.opacity!==null) {
			target.style.opacity = opacity/100;
		} else if (target.style.filter!==null) {
			target.style.filter = "alpha(opacity=" + opacity + ")";
		} else if (target.style.KhtmlOpacity!==null) {
			target.style.KhtmlOpacity = opacity/100;
		}
	}
}

var fadeOpa = 0;

function fadeElements(name) {
	var i;

	var elements = document.getElementsByName(name);
	// First, check if the input element is already visible.
	if (fadeOpa === 0) {
		for (i = 0; i < elements.length; i++) {
			if (elements[i].checked) {
				if (document.getElementById('input_'+elements[i].value).style.visibility != 'hidden') {
					// Nothing to do; bail out.
					return;
				} else {
					break;
				}
			}
		}
	}
	fadeOpa += 10;
	for (i = 0; i < elements.length; i++) {
		if (elements[i].checked) {
			setalpha(fadeOpa,'input_'+elements[i].value);
		} else if (document.getElementById('input_'+elements[i].value).style.visibility != 'hidden') {
			setalpha(100-fadeOpa,'input_'+elements[i].value);
		}
	}
	if (fadeOpa < 100) {
		window.setTimeout("fadeElements('"+name+"');", 0);
	} else {
		fadeOpa = 0;
	}
}

/* Starts at ref and for each given argument, searches forward in the document
 * structure for a node by that name, and continues from there. Returns the
 * last element so found or the undefined value if the end of the document was
 * reached without a match.  NOTE: Matching is done case insensitive to
 * eliminate differences between XML and SGML based documents. */

function findNode(ref) {
	for (var i = 1; i < arguments.length; i++) {
		name = arguments[i].toUpperCase();
		/* Search for the next node by the given name */
		do {
			if (ref.firstChild) {
				/* Search the child nodes */
				ref = ref.firstChild;
			} else if (ref.nextSibling) {
				/* Search the sibling nodes */
				ref = ref.nextSibling;
			} else {
				/* Track back to the first parent that has a sibling node */
				for (;;) {
					ref = ref.parentNode;
					if (ref) {
						if (ref.nextSibling) {
							/* Continue from the sibling node */
							ref = ref.nextSibling;
							break;
						}
					} else {
						/* Reached the end of the document without a match */
						return;
					}
				}
			}
		} while (ref.nodeName.toUpperCase() != name);
	}
	return ref;
}

/* Starts at ref and for each given argument, searches backward in the document
 * structure for a node by that name, and continues from there. Returns the
 * last element so found or the undefined value if the start of the document
 * was reached without a match.  NOTE: Matching is done case insensitive to
 * eliminate differences between XML and SGML based documents. */
function trackNode(ref) {
	for (var i = 1; i < arguments.length; i++) {
		name = arguments[i].toUpperCase();
		/* Search for the next node by the given name */
		do {
			if (ref.previousSibling) {
				/* Track back to the previous sibling */
				ref = ref.previousSibling;
				/* Descend as deep as possible into the structure */
				while (ref.lastChild) {
					ref = ref.lastChild;
				}
			} else if (ref.parentNode) {
				ref = ref.parentNode;
			} else {
				/* Reached the start of the document without a match */
				return;
			}
		} while (ref.nodeName.toUpperCase() != name);
	}
	return ref;
}

/* Swaps the positions of the given nodes in the DOM tree. */
function swapNodes(first, second) {
	if (second == first.nextSibling) {
		/* Second node comes directly after first, simply insert it before */
		first.parentNode.insertBefore(second,first);
	} else {
		/* Remember the original position of the first node */
		firstParent = first.parentNode;
		firstNext = first.nextSibling;
		/* Move the first node */
		second.parentNode.insertBefore(first, second);
		/* Move the second node */
		firstParent.insertBefore(second, firstNext);
	}
}

/* Follow a link, respecting the target and passing the referer in the URL. */
function go(a) {
	href = a.href + ((a.href.indexOf('?') != -1) ? '&' : '?') + 'referer=' + escape(window.location).replace(/\+/g, '%2b');
	if (a.target) {
		window.open(href, a.target);
	} else {
		window.location = href;
	}
	return false;
}

/*---------------------------------------------------------------------------------------------------------------------*/
var stIsIE = /*@cc_on!@*/false;
var sorted = 0;

var iconbutton = {
	init: function() {
		// quit if this function has already been called
		if (arguments.callee.done) {
			return;
		}
		// flag this function so we don't do the same thing twice
		arguments.callee.done = true;
		// kill the timer
		if (_timer) {
			clearInterval(_timer);
		}

		if (!document.createElement || !document.getElementsByTagName) {
			return;
		}

		forEach (document.getElementsByTagName('input'), function(icon) {
			if (icon.className.search(/\binput_button\b/) != -1) {
				iconbutton.makeIconButton(icon);
			}
		});

		// New style buttons
		forEach (document.getElementsByTagName('input'), function(button) {
			if (button.className.search(/\binput_button2\b/) != -1) {
				iconbutton.makeNewButton(button);
			}
		});
	},
  
	makeIconButton: function(icon) {
		button_preload(icon.id);
		dean_addEvent(icon,"mouseover", button_select);
		dean_addEvent(icon,"mouseout", button_select);
		dean_addEvent(icon,"mousedown", button_select);
	},

	// New style buttons
	makeNewButton: function(button) {
		dean_addEvent(button,"mouseover", button2_select);
		dean_addEvent(button,"mouseout", button2_select);
		dean_addEvent(button,"mousedown", button2_select);
		dean_addEvent(button,"mouseup", button2_select);
	}
};

var sorttable = {
	init: function() {
		// quit if this function has already been called
		if (arguments.callee.done) {
			return;
		}
		// flag this function so we don't do the same thing twice
		arguments.callee.done = true;
		// kill the timer
		if (_timer) {
			clearInterval(_timer);
		}
		
		if (!document.createElement || !document.getElementsByTagName) {
			return;
		}
		
		sorttable.DATE_RE = /^(\d\d?)[\/\.-](\d\d?)[\/\.-]((\d\d)?\d\d)$/;
		
		forEach (document.getElementsByTagName('table'), function(table) {
			if (table.className.search(/\bsortable\b/) != -1) {
				sorttable.makeSortable(table);
			}
			if (table.className.search(/\bresulttable\b/) != -1) {
				sorttable.makeResultTable(table);
			}
		});
		
	},
  
	makeResultTable: function(table) {
		if (table.getElementsByTagName('thead').length == 0) {
			// table doesn't have a tHead. Since it should have, create one and
			// put the first table row in it.
			the = document.createElement('thead');
			the.appendChild(table.rows[0]);
			table.insertBefore(the,table.firstChild);
		}
		// Safari doesn't support table.tHead, sigh
		if (table.tHead === null) {
			table.tHead = table.getElementsByTagName('thead')[0];
		}

		if (table.tHead.rows.length != 1) {
			return; // can't cope with two header rows
		}

		for (var i=table.tHead.rows.length; i<table.rows.length; i++) {
	  		if (i & 1) {
				table.rows[i].className += " odd";
	  		} else {
				table.rows[i].className += " even";
	  		}
		}
	},

	makeSortable: function(table) {
		if (table.getElementsByTagName('thead').length == 0) {
	  		// table doesn't have a tHead. Since it should have, create one and
	  		// put the first table row in it.
	  		the = document.createElement('thead');
	  		the.appendChild(table.rows[0]);
	  		table.insertBefore(the,table.firstChild);
		}
		// Safari doesn't support table.tHead, sigh
		if (table.tHead === null) {
			table.tHead = table.getElementsByTagName('thead')[0];
		}

		if (table.tHead.rows.length != 1) {
			return; // can't cope with two header rows
		}

		// Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
		// "total" rows, for example). This is B&R, since what you're supposed
		// to do is put them in a tfoot. So, if there are sortbottom rows,
		// for backwards compatibility, move them to tfoot (creating it if needed).
		sortbottomrows = [];
		for (var i=0; i<table.rows.length; i++) {
	  		if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
				sortbottomrows[sortbottomrows.length] = table.rows[i];
	  		}
		}
		if (sortbottomrows) {
	  		if (table.tFoot === null) {
				// table doesn't have a tfoot. Create one.
				tfo = document.createElement('tfoot');
				table.insertBefore(tfo, table.firstChild.nextSibling);
				tfo.style.display = 'none';
	  		}
	  		for (var i=0; i<sortbottomrows.length; i++) {
				tfo.appendChild(sortbottomrows[i]);
	  		}
	  		delete sortbottomrows;
		}
		
		// work through each column and calculate its type
		headrow = table.tHead.rows[0].sorttable_sorted = 0;
		headrow = table.tHead.rows[0].cells;
		for (var i=0; i<headrow.length; i++) {
	  		// manually override the type with a sorttable_type attribute
	  		if (!headrow[i].className.match(/\bnosort\b/)) { // skip this col
				mtch = headrow[i].className.match(/\bsorttable_([a-z0-9]+)\b/);
				if (mtch) {
					override = mtch[1];
				}
		  		if (mtch && typeof sorttable["sort_"+override] == 'function') {
					headrow[i].sorttable_sortfunction = sorttable["sort_"+override];
		  		} else {
					headrow[i].sorttable_sortfunction = sorttable.guessType(table,i);
		  		}
		  		// make it clickable to sort
		  		headrow[i].sorttable_columnindex = i;
		  		headrow[i].sorttable_tbody = table.tBodies[0];
//				this.removeChild(document.getElementById('sorttable_sortrevind'));
				sortbuttons = document.createElement('img');
				sortbuttons.id = "sort_a"+i;
				sortbuttons.src = '/img/sort_a.gif';
				sortbuttons.sorttable_direction = 0;
				sortbuttons.className += "sortcell";
				if (headrow[i].className.match(/\bsort_a\b/)) { // skip this col
					sortbuttons.src = '/img/sort_ao.gif';
					table.tHead.rows[0].sorttable_sorted = sortbuttons;
				}
				headrow[i].appendChild(sortbuttons);
				dean_addEvent(sortbuttons,"click", sortHandler);

				sortbuttons = document.createElement('img');
				sortbuttons.id = "sort_d"+i;
				sortbuttons.src = '/img/sort_d.gif';
				sortbuttons.sorttable_direction = 1;

				sortbuttons.className += "sortcell";
				if (headrow[i].className.match(/\bsort_d\b/)) { // skip this col
					sortbuttons.src = '/img/sort_do.gif';
					table.tHead.rows[0].sorttable_sorted = sortbuttons;
				}
				headrow[i].appendChild(sortbuttons);
				dean_addEvent(sortbuttons,"click", sortHandler);
			}
		}
		x = new Image();
		if (!table.tHead.rows[0].sorttable_sorted) {
			x.src='/img/sort_ao.gif';
			x.src='/img/sort_do.gif';
		} else {
			if (table.tHead.rows[0].sorttable_sorted.sorttable_direction) {
		  		x.src='/img/sort_ao.gif';
			} else {
		  		x.src='/img/sort_do.gif';
			}
		}
	},
  
	guessType: function(table, column) {
		// guess the type of a column based on its first non-blank row
		sortfn = sorttable.sort_alpha;
		for (var i=0; i<table.tBodies[0].rows.length; i++) {
			text = sorttable.getInnerText(table.tBodies[0].rows[i].cells[column]);
			if (text != '') {
				if (text.match(/^-?[£$€]?[\d,.]+%?$/)) {
					return sorttable.sort_numeric;
				}
				// check for a date: dd/mm/yyyy or dd/mm/yy 
				// can have / or . or - as separator
				// can be mm/dd as well
				possdate = text.match(sorttable.DATE_RE)
				if (possdate) {
					// looks like a date
					first = parseInt(possdate[1]);
					second = parseInt(possdate[2]);
					if (first > 12) {
						// definitely dd/mm
						return sorttable.sort_ddmm;
					} else if (second > 12) {
						return sorttable.sort_mmdd;
					} else {
						// looks like a date, but we can't tell which, so assume
						// that it's dd/mm (English imperialism!) and keep looking
						sortfn = sorttable.sort_ddmm;
					}
				}
			}
		}
		return sortfn;
	},
  
	getInnerText: function(node) {
		// gets the text we want to use for sorting for a cell.
		// strips leading and trailing whitespace.
		// this is *not* a generic getInnerText function; it's special to sorttable.
		// for example, you can override the cell text with a customkey attribute.
		// it also gets .value for <input> fields.

		if (typeof(node) == 'undefined') {
			return '';
		}
		
		hasInputs = (typeof node.getElementsByTagName == 'function') &&
		node.getElementsByTagName('input').length;
		
		if (node.getAttribute("sorttable_customkey") != null) {
	  		return node.getAttribute("sorttable_customkey");
		} else if (typeof node.textContent != 'undefined' && !hasInputs) {
	  		return node.textContent.replace(/^\s+|\s+$/g, '');
		} else if (typeof node.innerText != 'undefined' && !hasInputs) {
	  		return node.innerText.replace(/^\s+|\s+$/g, '');
		} else if (typeof node.text != 'undefined' && !hasInputs) {
	  		return node.text.replace(/^\s+|\s+$/g, '');
		} else {
	  		switch (node.nodeType) {
			case 3:
		  		if (node.nodeName.toLowerCase() == 'input') {
					return node.value.replace(/^\s+|\s+$/g, '');
		  		}
		  		/* Fall thru */
			case 4:
		  		return node.nodeValue.replace(/^\s+|\s+$/g, '');
		  		break;
			case 1:
			case 11:
		  		var innerText = '';
		  		for (var i = 0; i < node.childNodes.length; i++) {
					innerText += sorttable.getInnerText(node.childNodes[i]);
		  		}
		  		return innerText.replace(/^\s+|\s+$/g, '');
		  	break;
			default:
		  		return '';
	  		}
		}
	},
  
	reverse: function(tbody) {
		// reverse the rows in a tbody
		newrows = [];
		for (var i=0; i<tbody.rows.length; i++) {
			newrows[newrows.length] = tbody.rows[i];
		}
		for (var i=newrows.length-1; i>=0; i--) {
			tbody.appendChild(newrows[i]);
		}
		delete newrows;
	},
  
	// sort functions each sort function takes two parameters, a and b you are comparing a[0] and b[0] 
	sort_numeric: function(a,b) {
		aa = parseFloat(a[0].replace(/[^0-9.-]/g,''));
		if (isNaN(aa)) {
			aa = 0;
		}
		bb = parseFloat(b[0].replace(/[^0-9.-]/g,'')); 
		if (isNaN(bb)) {
			bb = 0;
		}
		return aa-bb;
  	},
	sort_alpha: function(a,b) {
		if (a[0]==b[0]) {
			return 0;
		}
		if (a[0]<b[0]) {
			return -1;
		}
		return 1;
	},
	sort_ddmm: function(a,b) {
		mtch = a[0].match(sorttable.DATE_RE);
		y = mtch[3]; m = mtch[2]; d = mtch[1];
		if (m.length == 1) {
			m = '0'+m;
		}
		if (d.length == 1) {
			d = '0'+d;
		}
		dt1 = y+m+d;
		mtch = b[0].match(sorttable.DATE_RE);
		y = mtch[3]; m = mtch[2]; d = mtch[1];
		if (m.length == 1) {
			m = '0'+m;
		}
		if (d.length == 1) {
			d = '0'+d;
		}
		dt2 = y+m+d;
		if (dt1==dt2) {
			return 0;
		}
		if (dt1<dt2) {
			return -1;
		}
		return 1;
	},
	sort_mmdd: function(a,b) {
		mtch = a[0].match(sorttable.DATE_RE);
		y = mtch[3]; d = mtch[2]; m = mtch[1];
		if (m.length == 1) {
			m = '0'+m;
		}
		if (d.length == 1) {
			d = '0'+d;
		}
		dt1 = y+m+d;
		mtch = b[0].match(sorttable.DATE_RE);
		y = mtch[3]; d = mtch[2]; m = mtch[1];
		if (m.length == 1) {
			m = '0'+m;
		}
		if (d.length == 1) {
			d = '0'+d;
		}
		dt2 = y+m+d;
		if (dt1==dt2) {
			return 0;
		}
		if (dt1<dt2) {
			return -1;
		}
		return 1;
	},

	shaker_sort: function(list, comp_func) {
	  // A stable sort function to allow multi-level sorting of data
	  // see: http://en.wikipedia.org/wiki/Cocktail_sort
	  // thanks to Joseph Nahmias
	  var b = 0;
	  var t = list.length - 1;
	  var swap = true;

	  while(swap) {
	  	swap = false;
	  	for(var i = b; i < t; ++i) {
	  		if ( comp_func(list[i], list[i+1]) > 0 ) {
	  			var q = list[i]; list[i] = list[i+1]; list[i+1] = q;
	  			swap = true;
	  		}
	  	} // for
	  	t--;

	  	if (!swap) {
	  		break;
	  	}

	  	for(var i = t; i > b; --i) {
	  		if ( comp_func(list[i], list[i-1]) < 0 ) {
	  			var q = list[i]; list[i] = list[i-1]; list[i-1] = q;
	  			swap = true;
	  		}
	  	} // for
	  	b++;

	  } // while(swap)
	}
};

var datepicker = {
  	init: function() {
		// quit if this function has already been called
		if (arguments.callee.done) {
			return;
		}
		// flag this function so we don't do the same thing twice
		arguments.callee.done = true;
		// kill the timer
		if (_timer) {
			clearInterval(_timer);
		}

		if (!document.createElement || !document.getElementsByTagName) {
			return;
		}

		forEach(document.getElementsByTagName('input'), function(field) {
	  		if (field.className.search(/\binput_date\b/) != -1) {
				datepicker.makeDatePicker(field);
	  		}
		});
	},
 
  	makeDatePicker: function(field) {
		dean_addEvent(field,"mousedown", datepicker_event);
		dean_addEvent(field,"focus", datepicker_event);
		dean_addEvent(field,"keydown", datepicker_event);
		field.readOnly = true;
  	}
};

var timefield = {
  	init: function() {
		// quit if this function has already been called
		if (arguments.callee.done) {
			return;
		}
		// flag this function so we don't do the same thing twice
		arguments.callee.done = true;
		// kill the timer
		if (_timer) {
			clearInterval(_timer);
		}

		if (!document.createElement || !document.getElementsByTagName) {
			return;
		}

		forEach(document.getElementsByTagName('input'), function(field) {
	  		if (field.className.search(/\binput_time\b/) != -1) {
				timefield.makeTimeField(field);
	  		}
		});
	},
 
  	makeTimeField: function(field) {
  		field.preload = new Image();
  		field.preload.owner = field;
  		field.preload.timer = 0;
		dean_addEvent(field, 'focus', timefield_event);
		dean_addEvent(field, 'blur', timefield_event);
		dean_addEvent(field, 'change', timefield_event);
		dean_addEvent(field.preload, 'load', preload_event);
		if (field.dispatchEvent) {
			e = document.createEvent('HTMLEvents');
			e.initEvent('change', true, false);
			field.dispatchEvent(e);
			e = document.createEvent('HTMLEvents');
			e.initEvent('blur', false, false);
			field.dispatchEvent(e);
		} else {
			field.onchange({ type : 'change' });
			field.onblur({ type : 'blur' });
		}
		update_clock(field);
		dean_addEvent(field.form, 'submit', function() { reset_field(field) });
  	}
};

/* ******************************************************************
   Supporting functions: bundled here to avoid depending on a library
   ****************************************************************** */

function NessCisInit() {
	sorttable.init(); // call the onload handler
	iconbutton.init(); // call the onload handler
	datepicker.init();
	timefield.init();
}


// Dean Edwards/Matthias Miller/John Resig

/* for Mozilla/Opera9 */
if (document.addEventListener) {
	document.addEventListener("DOMContentLoaded", NessCisInit, false);
}

/* for Internet Explorer */
/*@cc_on @*/
/*@if (@_win32)
	document.write("<script id='__ie_onload' defer src='javascript:void(0)'><\/script>");
	var script = document.getElementById("__ie_onload");
	script.onreadystatechange = function() {
		if (this.readyState == "complete") {
			NessCisInit(); // call the onload handler
		}
	};
/*@end @*/

/* for Safari */
if (/WebKit/i.test(navigator.userAgent)) { // sniff
	var _timer = setInterval(function() {
		if (/loaded|complete/.test(document.readyState)) {
			NessCisInit(); // call the onload handler
		}
	}, 10);
}

/* for other browsers */
window.onload = NessCisInit;

// written by Dean Edwards, 2005
// with input from Tino Zijdel, Matthias Miller, Diego Perini

function classReplace(e, param1, param2) {
	e.className = e.className.replace(param1, param2)
	return true;
}

function sortHandler(e) {
	sortptr = this.parentNode.parentNode.sorttable_sorted;
	if (sortptr) {
		if (sortptr.sorttable_direction == 0) {
			sortptr.src = "/img/sort_a.gif";
		} else {
			sortptr.src = "/img/sort_d.gif";
		}
	}
	if (this.sorttable_direction == 0) {
		this.src = "/img/sort_ao.gif";
	} else {
		this.src = "/img/sort_do.gif";
	}
	this.parentNode.parentNode.sorttable_sorted = this;
	// sorttable.reverse(this.parentNode.sorttable_tbody);
	// build an array to sort. This is a Schwartzian transform thing,
	// i.e., we "decorate" each row with the actual sort key,
	// sort based on the sort keys, and then put the rows back in order
	// which is a lot faster because you only do getInnerText once per row
	row_array = [];
	col = this.parentNode.sorttable_columnindex;
	rows = this.parentNode.sorttable_tbody.rows;
	for (var j=0; j<rows.length; j++) {
		row_array[row_array.length] = [sorttable.getInnerText(rows[j].cells[col]), rows[j]];
	}
	// If you want a stable sort, uncomment the following line 
	sorttable.shaker_sort(row_array, this.parentNode.sorttable_sortfunction);
	// and comment out this one 
	//row_array.sort(this.parentNode.sorttable_sortfunction);

	tb = this.parentNode.sorttable_tbody;

	//for (var j=0; j<row_array.length; j++) {
	if (this.sorttable_direction == 0) {
		for (var j=0; j<row_array.length; j++) {
			tb.appendChild(row_array[j][1]);
			if (j & 1) {
				row_array[j][1].className = row_array[j][1].className.replace('odd', 'even');
			} else {
				row_array[j][1].className = row_array[j][1].className.replace('even', 'odd');
			}
		}
	} else {
		var k=0;
		for (var j=row_array.length; j>0; j--) {
			tb.appendChild(row_array[j-1][1]);
			if (k & 1) {
				row_array[j-1][1].className = row_array[j-1][1].className.replace('odd', 'even');
			} else {
				row_array[j-1][1].className = row_array[j-1][1].className.replace('even', 'odd');
			}
			k++;
		}
	}

	delete row_array;
	return true;
};

function dean_addEvent(element, type, handler) {
	if (element.addEventListener) {
		element.addEventListener(type, handler, false);
	} else {
		// assign each event handler a unique ID
		if (!handler.$$guid) {
			handler.$$guid = dean_addEvent.guid++;
		}
		// create a hash table of event types for the element
		if (!element.events) {
			element.events = {};
		}
		// create a hash table of event handlers for each element/event pair
		var handlers = element.events[type];
		if (!handlers) {
			handlers = element.events[type] = {};
			// store the existing event handler (if there is one)
			if (element["on" + type]) {
				handlers[0] = element["on" + type];
			}
		}
		// store the event handler in the hash table
		handlers[handler.$$guid] = handler;
		// assign a global event handler to do all the work
		element["on" + type] = handleEvent;
	}
};
// a counter used to create unique IDs
dean_addEvent.guid = 1;

function removeEvent(element, type, handler) {
	if (element.removeEventListener) {
		element.removeEventListener(type, handler, false);
	} else {
		// delete the event handler from the hash table
		if (element.events && element.events[type]) {
			delete element.events[type][handler.$$guid];
		}
	}
};

function handleEvent(event) {
	var returnValue = true;
	// grab the event object (IE uses a global event object)
	event = event || fixEvent(((this.ownerDocument || this.document || this).parentWindow || window).event);
	// get a reference to the hash table of event handlers
	var handlers = this.events[event.type];
	// execute each event handler
	for (var i in handlers) {
		this.$$handleEvent = handlers[i];
		if (this.$$handleEvent(event) === false) {
			returnValue = false;
		}
	}
	return returnValue;
};

function fixEvent(event) {
	// add W3C standard event methods
	event.preventDefault = fixEvent.preventDefault;
	event.stopPropagation = fixEvent.stopPropagation;
	return event;
};
fixEvent.preventDefault = function() {
	this.returnValue = false;
};
fixEvent.stopPropagation = function() {
  	this.cancelBubble = true;
}

/*
	forEach, version 1.0
	Copyright 2006, Dean Edwards
	License: http://www.opensource.org/licenses/mit-license.php
*/

// array-like enumeration
if (!Array.forEach) { // mozilla already supports this
	Array.forEach = function(array, block, context) {
		for (var i = 0; i < array.length; i++) {
			block.call(context, array[i], i, array);
		}
	};
}

// generic enumeration
Function.prototype.forEach = function(object, block, context) {
	for (var key in object) {
		if (typeof this.prototype[key] == "undefined") {
			block.call(context, object[key], key, object);
		}
	}
};

// character enumeration
String.forEach = function(string, block, context) {
	Array.forEach(string.split(""), function(chr, index) {
		block.call(context, chr, index, string);
	});
};

// globally resolve forEach enumeration
var forEach = function(object, block, context) {
	if (object) {
		var resolve = Object; // default
		if (object instanceof Function) {
			// functions have a "length" property
			resolve = Function;
		} else if (object.forEach instanceof Function) {
			// the object implements a custom forEach method so use that
			object.forEach(block, context);
			return;
		} else if (typeof object == "string") {
			// the object is a string
			resolve = String;
		} else if (typeof object.length == "number") {
			// the object is array-like
			resolve = Array;
		}
		resolve.forEach(object, block, context);
	}
};