/*
	* Autor: Ivan Jorge do Rosário Mota
	* Criado em: 2007-04-14 13:53
	* Modificado em: 2007-04-14 13:53
	* É expressamente proíbido alterar este ficheiro sem consentimento do autor
*/
function validateSimbol(standart, text)
{
	accept_characters = "";
	switch (standart)
	{
		case "MAIL":
			accept_characters = ".0123456789_@-ABCDEFGHIJKLMNOPQRSTUVWYXZ";
			break;
		case "ADDRESS":
			accept_characters = ".ªº,ABCDEFGHIJKLMNOPQRSTUVWYXZ_-0123456789 ÇçÀàÁáÃãÂâÈèÉéÊêÌìÍíÎîÒòÓóÕõÔôÙùÚúÛûÜüÑñ()/";
			break;
		case "PHONE":
			accept_characters = "+(-) 0123456789";
			break;
		case "ZIPCODE":
			accept_characters = "-0123456789 ABCDEFGHIJKLMNOPQRSTUVWYXZ";
			break;
		case "NUMBER":
			accept_characters = "0123456789";
			break;
		case "USER_PASS":
			accept_characters = "0123456789ABCDEFGHIJKLMNOPQRSTUVWYXZ";
			break;
		case "PRODUCT_NAME":
			accept_characters = ".ªº,ABCDEFGHIJKLMNOPQRSTUVWYXZ_-0123456789 ÇçÀàÁáÃãÂâÈèÉéÊêÌìÍíÎîÒòÓóÕõÔôÙùÚúÛûÜüÑñ?!() +&";
			break;
		case "ALPHANUMERIC":
			accept_characters = "0123456789_ABCDEFGHIJKLMNOPQRSTUVWYXZ";
			break;
		case "PRODUCT_ID":
			accept_characters = "0123456789_ABCDEFGHIJKLMNOPQRSTUVWYXZ";
			break;
		case "PRICE":
			accept_characters = "0123456789.,";
			break;
		case "DATE":
			accept_characters = "0123456789-";
			break;
		case "DATETIME":
			accept_characters = "0123456789 :-";
			break;
		case "NAME":
			accept_characters = "ABCDEFGHIJKLMNOPQRSTUVWYXZ_-0123456789 ÇçÀàÁáÃãÂâÈèÉéÊêÌìÍíÎîÒòÓóÕõÔôÙùÚúÛûÜüÑñ";
			break;
		case "YES_NO_UNDEFINED":
			accept_characters = "YNU";
			break;
		case "STATUS":
			accept_characters = "ACDSUN";
			break;
	}
	text=text.toUpperCase();
	for (var i = 0; i < text.length; ++i)
	{
		if (accept_characters.indexOf(text.charAt(i)) < 0)
		{
			return false;
		}
	}
	return true;
}

function validateMail(text)
{
	if (!validateSimbol("MAIL", text))
	{
		return false;	
	}
	if (text.length < 6)
	{
		return false;
	}
	if ((text.indexOf('@') < 1) || (text.indexOf('.') < 1))
	{
		return false;
	}
	if (text.indexOf('@') > (text.length - 4))
	{
		return false;
	}
	if (text.indexOf('.') > (text.length - 3))
	{
		return false;
	}
	if ((text.indexOf('.@') >= 0) || (text.indexOf('@.') >= 0))
	{
		return false;
	}
	return true;
}

function existSapce(text)
{
	if ((text.length > 0) && (text.indexOf(' ') > 0))
		return true;
	return false;
}

function imTrim(text)
{
	chrSpace=String.fromCharCode(32);
	while (text.length > 1)
	{
		if (text.charAt(0) == chrSpace)
			text=text.substring(1);
		else
			break;
	}
	
	while (text.length > 1)
	{
		if (text.charAt(text.length - 1) == chrSpace)
			text=text.substring(0, text.lastIndexOf(chrSpace));
		else
			break;
	}

	if (text==" ")
		return "";
	return text;
}
function sha1Hash(msg)
{
    // constants [4.2.1]
    var K = [0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xca62c1d6];

    // PREPROCESSING 
 
    msg += String.fromCharCode(0x80); // add trailing '1' bit to string [5.1.1]

    // convert string msg into 512-bit/16-integer blocks arrays of ints [5.2.1]
    var l = Math.ceil(msg.length/4) + 2;  // long enough to contain msg plus 2-word length
    var N = Math.ceil(l/16);              // in N 16-int blocks
    var M = new Array(N);
    for (var i=0; i<N; i++) {
        M[i] = new Array(16);
        for (var j=0; j<16; j++) {  // encode 4 chars per integer, big-endian encoding
            M[i][j] = (msg.charCodeAt(i*64+j*4)<<24) | (msg.charCodeAt(i*64+j*4+1)<<16) | 
                      (msg.charCodeAt(i*64+j*4+2)<<8) | (msg.charCodeAt(i*64+j*4+3));
        }
    }
    // add length (in bits) into final pair of 32-bit integers (big-endian) [5.1.1]
    M[N-1][14] = ((msg.length-1) >>> 30) * 8;
    M[N-1][15] = ((msg.length-1)*8) & 0xffffffff;

    // set initial hash value [5.3.1]
    var H0 = 0x67452301;
    var H1 = 0xefcdab89;
    var H2 = 0x98badcfe;
    var H3 = 0x10325476;
    var H4 = 0xc3d2e1f0;

    // HASH COMPUTATION [6.1.2]

    var W = new Array(80); var a, b, c, d, e;
    for (var i=0; i<N; i++) {

        // 1 - prepare message schedule 'W'
        for (var t=0;  t<16; t++) W[t] = M[i][t];
        for (var t=16; t<80; t++) W[t] = ROTL(W[t-3] ^ W[t-8] ^ W[t-14] ^ W[t-16], 1);

        // 2 - initialise five working variables a, b, c, d, e with previous hash value
        a = H0; b = H1; c = H2; d = H3; e = H4;

        // 3 - main loop
        for (var t=0; t<80; t++) {
            var s = Math.floor(t/20); // seq for blocks of 'f' functions and 'K' constants
            var T = (ROTL(a,5) + f(s,b,c,d) + e + K[s] + W[t]) & 0xffffffff;
            e = d;
            d = c;
            c = ROTL(b, 30);
            b = a;
            a = T;
        }

        // 4 - compute the new intermediate hash value
        H0 = (H0+a) & 0xffffffff;  // note 'addition modulo 2^32'
        H1 = (H1+b) & 0xffffffff; 
        H2 = (H2+c) & 0xffffffff; 
        H3 = (H3+d) & 0xffffffff; 
        H4 = (H4+e) & 0xffffffff;
    }

    return H0.toHexStr() + H1.toHexStr() + H2.toHexStr() + H3.toHexStr() + H4.toHexStr();
}

//
// function 'f' [4.1.1]
//
function f(s, x, y, z) 
{
    switch (s) {
    case 0: return (x & y) ^ (~x & z);
    case 1: return x ^ y ^ z;
    case 2: return (x & y) ^ (x & z) ^ (y & z);
    case 3: return x ^ y ^ z;
    }
}

//
// rotate left (circular left shift) value x by n positions [3.2.5]
//
function ROTL(x, n)
{
    return (x<<n) | (x>>>(32-n));
}

//
// extend Number class with a tailored hex-string method 
//   (note toString(16) is implementation-dependant, and 
//   in IE returns signed numbers when used on full words)
//
Number.prototype.toHexStr = function()
{
    var s="", v;
    for (var i=7; i>=0; i--) { v = (this>>>(i*4)) & 0xf; s += v.toString(16); }
    return s;
}