// JavaScript Document

//###################### FUNZIONI DI CONVERSIONE HEX
//###################### USATE NELLA TREEVIEWAJAX

var hD="0123456789ABCDEF";

function lTrim(string)
{
	var i = 0;
	var j = string.length - 1;

	if (string == null)
		return (false);

	for (i = 0; i < string.length; i++)
	{
		if (string.substr(i, 1) != ' ' &&
		    string.substr(i, 1) != '\t')
			break;
	}

	if (i <= j)
		return (string.substr(i, (j+1)-i));
	else
		return ('');
}

function rTrim(string)
{
	var i = 0;
	var j = string.length - 1;

	if (string == null)
		return (false);

	for(j = string.length - 1; j >= 0; j--)
	{
		if (string.substr(j, 1) != ' ' &&
			string.substr(j, 1) != '\t')
		break;
	}

	if (i <= j)
		return (string.substr(i, (j+1)-i));
	else
		return ('');
}

function trim(string)
{
	if (string == null)
		return (false);

	return rTrim(lTrim(string));
}

function str_replace(expression, find, replace)
{
	var temp = expression;
	var a = 0;

	for (var i = 0; i < expression.length; i++) 
	{
		a = temp.indexOf(find);
		if (a == -1)
			break
		else
			temp = temp.substring(0, a) + replace + temp.substring((a + find.length));
	}

	return temp;
}

function string2hex(str) {
  var hex = "";
  for (var i = 0; i<str.length; i++) {
    hex = hex + dec2hex(str.charAt(i).charCodeAt(0));
  }
  return hex;
}

function hex2string(hexstr) {
// POI LA COMPLETEREMO QUANDI SAREMO PIU' BRAVI (DI PARECCHIO)
/*  var str = "";
  for (var i = 0; i < hexstr.length-1; i+=2) {
    str = str + chr(hex2dec(hexstr.charAt(i) + hexstr.charAt(i+1)));
  }
  return str;
*/
}

function dec2hex(d) {
  var h = hD.substr(d&15,1);
  while(d>15) {
    d >>= 4;
    h = hD.substr(d&15,1)+h;
  }
  return h;
}
function hex2dec(h) {
  return parseInt(h,16);
}

//###################### FINE FUNZIONI DI CONVERSIONE HEX