function getById(id){return document.getElementById?document.getElementById(id):(document.all?document.all(id):null);}
function getByName(name){return document.getElementsByName(name);}
function getByTag(tag){	return document.getElementsByTagName(tag);}
function hideDiv(id) {getById(id).style.visibility = "hidden";getById(id).style.display = "none";}
function showDiv(id) {getById(id).style.visibility = "visible";getById(id).style.display = "inline";}
function NavTo(action){document.getElementById("action").value = action;document.forms[0].submit();}
function doNothing() {}
function getCheckedValue(radioObj) {if(!radioObj){return "";}var radioLength = radioObj.length;	if(radioLength == undefined){	if(radioObj.checked){		return radioObj.value;	}else{		return "";	}	}	for(var i = 0; i < radioLength; i++) {		if(radioObj[i].checked) {			return radioObj[i].value;		}	}	return "";}
function getSelectedValue(id){return getById(id).options[getById(id).selectedIndex].value;}
function explode(symb,string,size){if(symb == ''){return false;}var texte = string;var tru = true;var flag = false;var plast = 0;var num = 0;var last;var llast = texte.lastIndexOf(symb);var ordr = new Array();var len = texte.length;while(tru == true){last = texte.indexOf(":",plast);if(flag == true){tru = false;last = len;}ordr[num] = texte.substring( plast , last );if(size){if(ordr.length == size){ordr[num] += texte.substring( last , len );tru = false;}}num++;plast = last+1;if(last == llast){flag = true;}}	return ordr;}
function implode(symb,array){var len = array.length;var fin = '';for(i = 0; i < len;i++){if(i){fin += symb;}fin +=array[i];}return fin;}


function in_array(needle, haystack, argStrict) {
    // Checks if the given value exists in the array  
    // 
    // version: 903.1614
    // discuss at: http://phpjs.org/functions/in_array
    // +   original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)
    // *     example 1: in_array('van', ['Kevin', 'van', 'Zonneveld']);
    // *     returns 1: true
    var found = false, key, strict = !!argStrict;

    for (key in haystack) {
        if ((strict && haystack[key] === needle) || (!strict && haystack[key] == needle)) {
            found = true;
            break;
        }
    }

    return found;
}