var xmlhttp = false ;


if (!xmlhttp && typeof XMLHttpRequest != 'undefined')
{
  try {
	xmlhttp = new XMLHttpRequest ();
  }
  catch (e) {
  xmlhttp = false}
}


function myXMLHttpRequest ()
{
  var xmlhttplocal;
  try {
  	xmlhttplocal = new ActiveXObject ("Msxml2.XMLHTTP")}
  catch (e) {
	try {
	xmlhttplocal = new ActiveXObject ("Microsoft.XMLHTTP")}
	catch (E) {
	  xmlhttplocal = false;
	}
  }

  if (!xmlhttplocal && typeof XMLHttpRequest != 'undefined') {
	try {
	  var xmlhttplocal = new XMLHttpRequest ();
	}
	catch (e) {
	  var xmlhttplocal = false;
	}
  }
  return (xmlhttplocal);
}


var mnmxmlhttp = Array ();
var mnmString = Array ();
var mnmPrevColor = Array ();
var responsestring = Array ();
var myxmlhttp = Array ();
var responseString = new String;




var i=0;
var ii = 0;

function ajax_update(url2)
{

	//var url = "monitor_ajax2.php";
	var url = url2;
	target2 = document.getElementById ('resultado');
	ii = i++;
	var content = "i=" + ii ;

	mnmxmlhttp = new myXMLHttpRequest ();
	if (mnmxmlhttp) {
			mnmxmlhttp.open ("GET", url, true);
			mnmxmlhttp.setRequestHeader ('Content-Type',
					   'application/x-www-form-urlencoded');

			mnmxmlhttp.send (content);
			errormatch = new RegExp ("^ERROR:");

			target2 = document.getElementById ('resultado');

			mnmxmlhttp.onreadystatechange = function () {
				if (mnmxmlhttp.readyState == 1) {
					  target = document.getElementById ('resultado');
					  target2.innerHTML = "<img src='img/carregando.gif' alt='Carregando' border='0' />";
				}
                if (mnmxmlhttp.readyState == 4) {
					mnmString = mnmxmlhttp.responseText;
        
					if (mnmString.match (errormatch)) {
						mnmString = mnmString.substring (6, mnmString.length);

						target = document.getElementById ('resultado');
						target2.innerHTML = mnmString;

					} else {
						target = document.getElementById ('resultado');
						target2.innerHTML = mnmString;

					}
				}
			}
		}


	setTimeout('ajax_update(\'' + url + '\')', 4000);

}

// Função para iniciarmos o Ajax no browser do cliente.
function openAjax() {

var ajax;

try{
    ajax = new XMLHttpRequest(); // XMLHttpRequest para browsers decentes, como: Firefox, Safari, dentre outros.
}catch(ee){
    try{
        ajax = new ActiveXObject("Msxml2.XMLHTTP"); // Para o IE da MS
    }catch(e){
        try{
            ajax = new ActiveXObject("Microsoft.XMLHTTP"); // Para o IE da MS
        }catch(E){
            ajax = false;
        }
    }
}
return ajax;
}

// Função que realiza a busca instantânea
function buscaInstantanea(url,campo,exibe,qtd) {
	if(document.getElementById) { // Para os browsers complacentes com o DOM W3C.
		var termo = document.getElementById(campo).value; // Pega o termo digitado no campo de texto.
		var exibeResultado = document.getElementById(exibe); // div que exibirá o resultado da busca.
		if(termo !== "" && termo !== null && termo.length >= qtd) { // Verifica se o campo não está vazio, ou se foi digitado no mínimo três caracteres.
			var ajax = openAjax(); // Inicia o Ajax.
			ajax.open("GET", url + "?q=" + termo, true); // Envia o termo da busca como uma querystring, nos possibilitando o filtro na busca.
			ajax.onreadystatechange = function() {
				if(ajax.readyState == 1) { // Quando estiver carregando, exibe: carregando...
					//exibeResultado.innerHTML = "<h2>carregando...</h2>";
					  exibeResultado.innerHTML = "<img src='img/carregando.gif' alt='Carregando' border='0' />";
				}
				if(ajax.readyState == 4) { // Quando estiver tudo pronto.
					if(ajax.status == 200) {
						var resultado = ajax.responseText; // Coloca o resultado (da busca) retornado pelo Ajax nessa variável (var resultado).
						 resultado = resultado.replace(/\+/g," "); // Resolve o problema dos acentos (saiba mais aqui: http://www.plugsites.net/leandro/?p=4)
						 resultado = unescape(resultado); // Resolve o problema dos acentos
						exibeResultado.innerHTML = resultado;
					} else {
						exibeResultado.innerHTML = "Erro: ";
					}
				}
			}
			ajax.send(null); // submete
		} 
	}
}

// Função para navegar com ajax
function navega_ajax(url,parametro,exibe) {
        if(document.getElementById) { // Para os browsers complacentes com o DOM W3C.
                var termo = parametro; // Pega o parametro para o link
                var exibeResultado = document.getElementById(exibe); // div que exibirá o resultado da busca.
                if(termo !== "" && termo !== null) { // Verifica se o campo não está vazio, ou se foi digitado no mínimo três caracteres.
                        var ajax = openAjax(); // Inicia o Ajax.
                        ajax.open("GET", url + "?parametro=" + termo, true); // Envia
                        ajax.setRequestHeader('Content-Type', 'text/html');
                        ajax.setRequestHeader('Content-Type', 'charset=ISO-8859-1');
                       
                       ajax.setRequestHeader("Cache-Control", "no-store, no-cache, must-revalidate");
                       ajax.setRequestHeader("Cache-Control", "post-check=0, pre-check=0");
                       ajax.setRequestHeader("Pragma", "no-cache");
                        ajax.onreadystatechange = function() {
                                if(ajax.readyState == 1) { // Quando estiver carregando, exibe: carregando...
                                        exibeResultado.innerHTML = "<img src='img/carregando.gif' alt='Carregando' border='0' />";
                                }
                                if(ajax.readyState == 4) { // Quando estiver tudo pronto.
                                        if(ajax.status == 200) {
                                                var resultado = ajax.responseText; // Coloca o resultado (da busca)
                                                 //resultado = resultado.replace(/\+/g," "); // Resolve o problema dos acentos
                                                 //resultado = unescape(resultado); // Resolve o problema dos acentos
                                                exibeResultado.innerHTML = resultado;
                                        } else {
                                                exibeResultado.innerHTML = "Erro: ";
                                        }
                                }
                        }
                        ajax.send(null); // submete
                }
        }
}

//PopUP para PDF
// * url 		- Arquivo(script) que processa as informacoes no servidor
// * campos_vetor  	- Vetor com o nome(id) dos campos(textfild por exemplo) separados por | (pipe) que cujos valores digitados seram passados para a url como "par" separados por "," (use na url $par = explode(",", $_GET['par']);)

function pop_pdf(url,campos_vetor,parametro){
	var temp = campos_vetor.split("|");
	var par = new Array();
                for(var i = 0; i < temp.length; i++){
                        par[i] = document.getElementById(temp[i]).value;
        }

	window.open(url+"?par="+par+"&parametro="+ parametro,'page','toolbar=no,location=no,status=no,menubar=no,scrollbars=no,resizable=yes,width=700px,height=500px');

}

function pop_pdf_cript(url,campos_vetor,parametro){
	setMaxDigits(19);
	key = new RSAKeyPair("6aa86c39bbe678f7f7967a587a1149","","8b46ab8a951615d07b66bdd2420f8b1");
        var temp = campos_vetor.split("|");
        var par = new Array();
                for(var i = 0; i < temp.length; i++){
                        par[i] = encryptedString(key,document.getElementById(temp[i]).value + "\x01");
        }

        window.open(url+"?par="+par+"&parametro="+ parametro,'page','toolbar=no,location=no,status=no,menubar=no,scrollbars=no,resizable=yes,width=700px,height=500px');

}

function cria_cript(valor){
	setMaxDigits(19);
	key = new RSAKeyPair("6aa86c39bbe678f7f7967a587a1149","","8b46ab8a951615d07b66bdd2420f8b1");
	alert(encryptedString(key,valor + "\x01"));
}


//########### busca_ajax - Função para Buscar com ajax #######################################
//--------------------------------------------------------------------------------------------
// * url 		- Arquivo(script) que processa as informacoes no servidor
// * campos_vetor	- Vetor com o nome(id) dos campos(textfild por exemplo) separados por | (pipe) que cujos valores digitados seram passados para a url como "par" separados por "," (use na url $par = explode(",", $_GET['par']);)
// * parametro 		- Parametro adcional, vai ser passado para a url como "parametro" (use na url $_GET['parametro'])
// * exibe		- DIV onde o resultado vai ser apresentado
// -------------------------------------------------------------------------------------------

function busca_ajax(url,campos_vetor,parametro,exibe) {
         if(document.getElementById) { // Para os browsers complacentes com o DOM W3C.
                var temp = campos_vetor.split("|");
                var par = new Array();
                for(var i = 0; i < temp.length; i++){
                        par[i] = document.getElementById(temp[i]).value;
                }
                var exibeResultado = document.getElementById(exibe); // div que exibirá o resultado da busca.

                if(temp !== "" && temp !== null) { // Verifica se o campo não está vazio
                        var ajax = openAjax(); // Inicia o Ajax.
                        ajax.open("GET", url + "?1="+ parametro +"&par=" + par, true); // Envia
                        ajax.setRequestHeader("Content-Type", "application/x-www-form-urlencoded");
                        ajax.setRequestHeader('Content-Type', 'text/html');
                        ajax.setRequestHeader('Content-Type', 'charset=ISO-8859-1');
                       
                       ajax.setRequestHeader("Cache-Control", "no-store, no-cache, must-revalidate");
                       ajax.setRequestHeader("Cache-Control", "post-check=0, pre-check=0");
                       ajax.setRequestHeader("Pragma", "no-cache");
                        ajax.onreadystatechange = function() {
                                if(ajax.readyState == 1) { // Quando estiver carregando, exibe: carregando...
                                        exibeResultado.innerHTML = "<img src='img/carregando.gif' alt='Carregando' border='0' />";
                                }
                                if(ajax.readyState == 4) { // Quando estiver tudo pronto.
                                        if(ajax.status == 200) {
                                                var resultado = ajax.responseText; // Coloca o resultado (da busca) retornado pelo ajax
                                                 //resultado = resultado.replace(/\+/g," "); // Resolve o problema dos acentos
                                                 //resultado = unescape(resultado); // Resolve o problema dos acentos
                                                exibeResultado.innerHTML = resultado;
                                        } else {
                                                exibeResultado.innerHTML = "Erro: ";
                                        }
                                }
                        }
                        ajax.send(null); // submete
                }
	}
}

//Função que envia o formulário
function enviarForm(url, campos, destino) {
    var elemento = document.getElementById(destino);
    var ajax = openAjax(); // Inicia o Ajax.
    if (!ajax) {
        elemento.innerHTML = 'Impossível iniciar o objeto XMLHttpRequest.';
        return;
    } else {
        elemento.innerHTML = 'Carregando...';
    }
    ajax.onreadystatechange = function () {
        //Se a requisição estiver completada
        if (ajax.readyState == 4 || ajax.readyState == 0) {
            //Se o status da requisição estiver OK
            if (ajax.status == 200) {
                //Insere no 'elemento' a página postada
                elemento.innerHTML = ajax.responseText;

        } else {
            //Insere no 'elemento' o texto atribuído
            elemento.innerHMTL = 'Página não encontrada!';
            }
        }
    }

//Abre a página que receberá os campos do formulário
alax.open('POST', url+'?'+campos, true);
//Envia o formulário com dados da variável 'campos' (passado por parâmetro)
ajax.send(campos);

}

/** Funcao para pegar valor de um campo
*   Recebe o campo devolve valor
*
**/

function get_ValorCampo(campo) {
    ret = document.getElementById(campo).value;
    return ret;
}

/** Funcao para comcatenar parametros
 **/
function get_ConcatParametros(campo1,campo2) {
    ret = campo1 + "" + campo2;
    return ret;
}

// Funcao para marcar/desmarcar todos checkebox de um formulario
// Recebe: nome do form,checkbox que chama essa funcao, tag que recebe o texto e Chekboxes para marcar

function checkAll(FormName,Marcador,Label,Campo) {
        var boxes = document.forms[FormName].getElementsByTagName("input");
	var mestre = document.forms[FormName].elements[Marcador];
	var elem = document.getElementById(Label);

	for (var i=0;i < document.forms[FormName].elements.length;i++) {
    		var e = document.forms[FormName].elements[i];
    		if ( (e.name != Marcador) && (e.type=='checkbox') && (!e.disabled) && (e.name == Campo)) {
      			e.checked = mestre.checked? true:false
    		}
  	}
		
	if(mestre.checked)
		elem.innerHTML = "Desmarcar todos";
	else elem.innerHTML = "Marcar todos";
}

// Converte um float para moeda.
function float2moeda(num) {
	x = 0;
	if(num<0) {
		num = Math.abs(num);
		x = 1;
	} 
	if(isNaN(num)) num = "0";
	
	cents = Math.floor((num*100+0.5)%100);
	num = Math.floor((num*100+0.5)/100).toString();

	if(cents < 10) cents = "0" + cents;
	
	for (var i = 0; i < Math.floor((num.length-(1+i))/3); i++)
	
	num = num.substring(0,num.length-(4*i+3))+'.'+num.substring(num.length-(4*i+3)); 
	ret = num + ',' + cents; 
	if (x == 1) ret = ' - ' + ret;

	return ret;

}

// Utilizada pela valida_form para buscar os objetos.



function acha_ob(n, d) {
  var p,i,x;  if(!d) d=document; if((p=n.indexOf("?"))>0&&parent.frames.length) {
    d=parent.frames[n.substring(p+1)].document; n=n.substring(0,p);}
  if(!(x=d[n])&&d.all) x=d.all[n]; for (i=0;!x&&i<d.forms.length;i++) x=d.forms[i][n];
  for(i=0;!x&&d.layers&&i<d.layers.length;i++) x=acha_ob(n,d.layers[i].document);
  if(!x && d.getElementById) x=d.getElementById(n); return x;
}



// Valida Fomulario
// Recebe N argumentos dividos em blocos de 3, sendo o 1º: nome do campo, o 2º Nome que vai aparecer na
// Mensagen e 3º tipo de validação('isEmail' - e-mail, 'inRange' - Range min:maximo, 
// 'NisNum' - Numeros negativos e positivos, 'positivo' - numeros positivos, 'R' - Obrigatório, 'real' - numeros reais)
// O 3º parametro normalmente vai ser passado contendo varios tipos: 
// EX: valida_Form('valor','Valor','RinRange1:999999999999'); -- onde: 'RinRange1:999999999999'
// Desmenbrando temos: R inRange 1:9999999999 -- R - Obrigatório, inRange - Range, 1 - min, 99999999999 - max
// @Autor: Fernando Rossato
// @Date: 2006/10/17

function valida_Form() { 
  var nome,i,p,q,nm,test,num,min,max,errors='',args=valida_Form.arguments;
  for (i=0; i<(args.length-2); i+=3) { 
   test=args[i+2]; 
   nome=args[i+1];
   val=acha_ob(args[i]);
   if (val) { 
	nm=val.name; 
	if ((val=val.value)!="") {
      if (test.indexOf('isEmail')!=-1) { 
	    p=val.indexOf('@');
        if (p<1 || p==(val.length-1)) errors+='- '+nome+': Deve ser um e-mail Valido.\n';

      } 
	  else if (test!='R') { 
	    val = val.toString().replace(',','.');
	    num = parseFloat(val);
        if (isNaN(val)) errors+='- '+nome+': Deve ser um numero.\n';
		if (test.indexOf('positivo') != -1 && num<=0) {
			errors+='- '+nome+': Deve ser um numero Real Positivo.\n';
		}
		if (test.indexOf('real') != -1 && num<0) {
			errors+='- '+nome+': Deve ser um numero Real.\n';
		}
        if (test.indexOf('inRange') != -1) { 
		  p=test.indexOf(':');
          min=test.substring(8,p); max=test.substring(p+1);
          if (num<min || max<num) errors+='- '+nome+': O numero deve estar entre '+min+' e '+max+'.\n';
        } 
	  } 
	} 
   else if (test.charAt(0) == 'R') errors += '- '+nome+': Eh obrigatorio.\n'; 
  }
  } if (errors) {
  	alert('Os seguintes erros foram encontrados:\n'+errors);
	return false;
  } else return true;
  //document.valor_retornado = (errors == '');
}

// Captura o numero dados da tecla precionada
// Ex: onkeyup(event)
function tecla(pEvent)
{
	var evt = new CrossEvent(pEvent);
		//alert(evt.type);
		//alert(evt.target.type + " " + evt.target.name);
		//alert(evt.charCode);
		alert(evt.target.name);
		alert(evt.keyCode);
		//alert(evt.button);
		//alert(evt.altKey);
		//alert(evt.ctrlKey);
		//alert(evt.shiftKey);
		//alert(evt.metaKey);

} // doEvent

function CrossEvent(evt)
{
	evt = evt? evt: (window.event? window.event: null);
	if (evt)
	{
		this.originalEvent = evt;
		this.type = evt.type;
		this.screenX = evt.screenX;
		this.screenY = evt.screenY;

		// IE: srcElement
		this.target = evt.target? evt.target: evt.srcElement;

		// N4: modifiers
		if (evt.modifiers)
		{
			this.altKey   = evt.modifiers & Event.ALT_MASK;
			this.ctrlKey  = evt.modifiers & Event.CONTROL_MASK;
			this.shiftKey = evt.modifiers & Event.SHIFT_MASK;
			this.metaKey  = evt.modifiers & Event.META_MASK;
		}
		else
		{
			this.altKey   = evt.altKey;
			this.ctrlKey  = evt.ctrlKey;
			this.shiftKey = evt.shiftKey;
			this.metaKey  = evt.metaKey;
		}

		// N4: which // N6+: charCode
		this.charCode = !isNaN(evt.charCode)? evt.charCode: !isNaN(evt.keyCode)? evt.keyCode: evt.which;
		this.keyCode = !isNaN(evt.keyCode)? evt.keyCode: evt.which;
		this.button = !isNaN(evt.button)? evt.button: !isNaN(evt.which)? evt.which-1: null;
		this.debug = "c:" + evt.charCode + " k:" + evt.keyCode
			+ " b:" + evt.button + " w:" + evt.which;
	}
} // CrossEvent


function inspectObject(obj) {
	var result = "";
	var objName = obj.name? obj.name: "object";
	for (var i in obj) {
		result += objName + "." + i + " = " + obj[i] + "\n";
	}
	return result;
} // inspectObject




//####################### CRIPT ############################
// RSA, a suite of routines for performing RSA public-key computations in

// JavaScript.

//

// Requires BigInt.js and Barrett.js.

//

// Copyright 1998-2005 David Shapiro.

//

// You may use, re-use, abuse, copy, and modify this code to your liking, but

// please keep this header.

//

// Thanks!

// 

// Dave Shapiro

// dave@ohdave.com 



function RSAKeyPair(encryptionExponent, decryptionExponent, modulus)

{

	this.e = biFromHex(encryptionExponent);

	this.d = biFromHex(decryptionExponent);

	this.m = biFromHex(modulus);

	// We can do two bytes per digit, so

	// chunkSize = 2 * (number of digits in modulus - 1).

	// Since biHighIndex returns the high index, not the number of digits, 1 has

	// already been subtracted.

	this.chunkSize = 2 * biHighIndex(this.m);

	this.radix = 16;

	this.barrett = new BarrettMu(this.m);

}



function twoDigit(n)

{

	return (n < 10 ? "0" : "") + String(n);

}



function encryptedString(key, s)

	// Altered by Rob Saunders (rob@robsaunders.net). New routine pads the

	// string after it has been converted to an array. This fixes an

	// incompatibility with Flash MX's ActionScript.

{

	var a = new Array();

	var sl = s.length;

	var i = 0;

	while (i < sl) {

		a[i] = s.charCodeAt(i);

		i++;

	}



	while (a.length % key.chunkSize != 0) {

		a[i++] = 0;

	}

	var al = a.length;

	var result = "";

	var j, k, block;

	for (i = 0; i < al; i += key.chunkSize) {

		block = new BigInt();

		j = 0;

		for (k = i; k < i + key.chunkSize; ++j) {

			block.digits[j] = a[k++];

			block.digits[j] += a[k++] << 8;

		}

		var crypt = key.barrett.powMod(block, key.e);

		var text = key.radix == 16 ? biToDecimal(crypt)/*biToHex(crypt)*/ : biToString(crypt, key.radix);

		result += text + " ";

	}

	return result.substring(0, result.length - 1); // Remove last space.

}



function decryptedString(key, s)

{

	var blocks = s.split(" ");

	var result = "";

	var i, j, block;

	for (i = 0; i < blocks.length; ++i) {

		var bi;

		if (key.radix == 16) {

			bi = biFromHex(blocks[i]);

		}

		else {

			bi = biFromString(blocks[i], key.radix);

		}

		block = key.barrett.powMod(bi, key.d);

		for (j = 0; j <= biHighIndex(block); ++j) {

			result += String.fromCharCode(block.digits[j] & 255,

			                              block.digits[j] >> 8);

		}

	}

	// Remove trailing null, if any.

	if (result.charCodeAt(result.length - 1) == 0) {

		result = result.substring(0, result.length - 1);

	}

	return result;

}

// BarrettMu, a class for performing Barrett modular reduction computations in

// JavaScript.

//

// Requires BigInt.js.

//

// Copyright 2004-2005 David Shapiro.

//

// You may use, re-use, abuse, copy, and modify this code to your liking, but

// please keep this header.

//

// Thanks!

// 

// Dave Shapiro

// dave@ohdave.com 



function BarrettMu(m)

{

	this.modulus = biCopy(m);

	this.k = biHighIndex(this.modulus) + 1;

	var b2k = new BigInt();

	b2k.digits[2 * this.k] = 1; // b2k = b^(2k)

	this.mu = biDivide(b2k, this.modulus);

	this.bkplus1 = new BigInt();

	this.bkplus1.digits[this.k + 1] = 1; // bkplus1 = b^(k+1)

	this.modulo = BarrettMu_modulo;

	this.multiplyMod = BarrettMu_multiplyMod;

	this.powMod = BarrettMu_powMod;

}



function BarrettMu_modulo(x)

{

	var q1 = biDivideByRadixPower(x, this.k - 1);

	var q2 = biMultiply(q1, this.mu);

	var q3 = biDivideByRadixPower(q2, this.k + 1);

	var r1 = biModuloByRadixPower(x, this.k + 1);

	var r2term = biMultiply(q3, this.modulus);

	var r2 = biModuloByRadixPower(r2term, this.k + 1);

	var r = biSubtract(r1, r2);

	if (r.isNeg) {

		r = biAdd(r, this.bkplus1);

	}

	var rgtem = biCompare(r, this.modulus) >= 0;

	while (rgtem) {

		r = biSubtract(r, this.modulus);

		rgtem = biCompare(r, this.modulus) >= 0;

	}

	return r;

}



function BarrettMu_multiplyMod(x, y)

{

	/*

	x = this.modulo(x);

	y = this.modulo(y);

	*/

	var xy = biMultiply(x, y);

	return this.modulo(xy);

}



function BarrettMu_powMod(x, y)

{

	var result = new BigInt();

	result.digits[0] = 1;

	var a = x;

	var k = y;

	while (true) {

		if ((k.digits[0] & 1) != 0) result = this.multiplyMod(result, a);

		k = biShiftRight(k, 1);

		if (k.digits[0] == 0 && biHighIndex(k) == 0) break;

		a = this.multiplyMod(a, a);

	}

	return result;

}

// BigInt, a suite of routines for performing multiple-precision arithmetic in

// JavaScript.

//

// Copyright 1998-2005 David Shapiro.

//

// You may use, re-use, abuse,

// copy, and modify this code to your liking, but please keep this header.

// Thanks!

//

// Dave Shapiro

// dave@ohdave.com



// IMPORTANT THING: Be sure to set maxDigits according to your precision

// needs. Use the setMaxDigits() function to do this. See comments below.

//

// Tweaked by Ian Bunning

// Alterations:

// Fix bug in function biFromHex(s) to allow

// parsing of strings of length != 0 (mod 4)



// Changes made by Dave Shapiro as of 12/30/2004:

//

// The BigInt() constructor doesn't take a string anymore. If you want to

// create a BigInt from a string, use biFromDecimal() for base-10

// representations, biFromHex() for base-16 representations, or

// biFromString() for base-2-to-36 representations.

//

// biFromArray() has been removed. Use biCopy() instead, passing a BigInt

// instead of an array.

//

// The BigInt() constructor now only constructs a zeroed-out array.

// Alternatively, if you pass <true>, it won't construct any array. See the

// biCopy() method for an example of this.

//

// Be sure to set maxDigits depending on your precision needs. The default

// zeroed-out array ZERO_ARRAY is constructed inside the setMaxDigits()

// function. So use this function to set the variable. DON'T JUST SET THE

// VALUE. USE THE FUNCTION.

//

// ZERO_ARRAY exists to hopefully speed up construction of BigInts(). By

// precalculating the zero array, we can just use slice(0) to make copies of

// it. Presumably this calls faster native code, as opposed to setting the

// elements one at a time. I have not done any timing tests to verify this

// claim.



// Max number = 10^16 - 2 = 9999999999999998;

//               2^53     = 9007199254740992;



var biRadixBase = 2;

var biRadixBits = 16;

var bitsPerDigit = biRadixBits;

var biRadix = 1 << 16; // = 2^16 = 65536

var biHalfRadix = biRadix >>> 1;

var biRadixSquared = biRadix * biRadix;

var maxDigitVal = biRadix - 1;

var maxInteger = 9999999999999998; 



// maxDigits:

// Change this to accommodate your largest number size. Use setMaxDigits()

// to change it!

//

// In general, if you're working with numbers of size N bits, you'll need 2*N

// bits of storage. Each digit holds 16 bits. So, a 1024-bit key will need

//

// 1024 * 2 / 16 = 128 digits of storage.

//



var maxDigits;

var ZERO_ARRAY;

var bigZero, bigOne;



function setMaxDigits(value)

{

	maxDigits = value;

	ZERO_ARRAY = new Array(maxDigits);

	for (var iza = 0; iza < ZERO_ARRAY.length; iza++) ZERO_ARRAY[iza] = 0;

	bigZero = new BigInt();

	bigOne = new BigInt();

	bigOne.digits[0] = 1;

}



setMaxDigits(20);



// The maximum number of digits in base 10 you can convert to an

// integer without JavaScript throwing up on you.

var dpl10 = 15;

// lr10 = 10 ^ dpl10

var lr10 = biFromNumber(1000000000000000);



function BigInt(flag)

{

	if (typeof flag == "boolean" && flag == true) {

		this.digits = null;

	}

	else {

		this.digits = ZERO_ARRAY.slice(0);

	}

	this.isNeg = false;

}



function biFromDecimal(s)

{

	var isNeg = s.charAt(0) == '-';

	var i = isNeg ? 1 : 0;

	var result;

	// Skip leading zeros.

	while (i < s.length && s.charAt(i) == '0') ++i;

	if (i == s.length) {

		result = new BigInt();

	}

	else {

		var digitCount = s.length - i;

		var fgl = digitCount % dpl10;

		if (fgl == 0) fgl = dpl10;

		result = biFromNumber(Number(s.substr(i, fgl)));

		i += fgl;

		while (i < s.length) {

			result = biAdd(biMultiply(result, lr10),

			               biFromNumber(Number(s.substr(i, dpl10))));

			i += dpl10;

		}

		result.isNeg = isNeg;

	}

	return result;

}



function biCopy(bi)

{

	var result = new BigInt(true);

	result.digits = bi.digits.slice(0);

	result.isNeg = bi.isNeg;

	return result;

}



function biFromNumber(i)

{

	var result = new BigInt();

	result.isNeg = i < 0;

	i = Math.abs(i);

	var j = 0;

	while (i > 0) {

		result.digits[j++] = i & maxDigitVal;

		i = Math.floor(i / biRadix);

	}

	return result;

}



function reverseStr(s)

{

	var result = "";

	for (var i = s.length - 1; i > -1; --i) {

		result += s.charAt(i);

	}

	return result;

}



var hexatrigesimalToChar = new Array(

 '0', '1', '2', '3', '4', '5', '6', '7', '8', '9',

 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j',

 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't',

 'u', 'v', 'w', 'x', 'y', 'z'

);



function biToString(x, radix)

	// 2 <= radix <= 36

{

	var b = new BigInt();

	b.digits[0] = radix;

	var qr = biDivideModulo(x, b);

	var result = hexatrigesimalToChar[qr[1].digits[0]];

	while (biCompare(qr[0], bigZero) == 1) {

		qr = biDivideModulo(qr[0], b);

		digit = qr[1].digits[0];

		result += hexatrigesimalToChar[qr[1].digits[0]];

	}

	return (x.isNeg ? "-" : "") + reverseStr(result);

}



function biToDecimal(x)

{

	var b = new BigInt();

	b.digits[0] = 10;

	var qr = biDivideModulo(x, b);

	var result = String(qr[1].digits[0]);

	while (biCompare(qr[0], bigZero) == 1) {

		qr = biDivideModulo(qr[0], b);

		result += String(qr[1].digits[0]);

	}

	return (x.isNeg ? "-" : "") + reverseStr(result);

}



var hexToChar = new Array('0', '1', '2', '3', '4', '5', '6', '7', '8', '9',

                          'a', 'b', 'c', 'd', 'e', 'f');



function digitToHex(n)

{

	var mask = 0xf;

	var result = "";

	for (i = 0; i < 4; ++i) {

		result += hexToChar[n & mask];

		n >>>= 4;

	}

	return reverseStr(result);

}



function biToHex(x)

{

	var result = "";

	var n = biHighIndex(x);

	for (var i = biHighIndex(x); i > -1; --i) {

		result += digitToHex(x.digits[i]);

	}

	return result;

}



function charToHex(c)

{

	var ZERO = 48;

	var NINE = ZERO + 9;

	var littleA = 97;

	var littleZ = littleA + 25;

	var bigA = 65;

	var bigZ = 65 + 25;

	var result;



	if (c >= ZERO && c <= NINE) {

		result = c - ZERO;

	} else if (c >= bigA && c <= bigZ) {

		result = 10 + c - bigA;

	} else if (c >= littleA && c <= littleZ) {

		result = 10 + c - littleA;

	} else {

		result = 0;

	}

	return result;

}



function hexToDigit(s)

{

	var result = 0;

	var sl = Math.min(s.length, 4);

	for (var i = 0; i < sl; ++i) {

		result <<= 4;

		result |= charToHex(s.charCodeAt(i))

	}

	return result;

}



function biFromHex(s)

{

	var result = new BigInt();

	var sl = s.length;

	for (var i = sl, j = 0; i > 0; i -= 4, ++j) {

		result.digits[j] = hexToDigit(s.substr(Math.max(i - 4, 0), Math.min(i, 4)));

	}

	return result;

}



function biFromString(s, radix)

{

	var isNeg = s.charAt(0) == '-';

	var istop = isNeg ? 1 : 0;

	var result = new BigInt();

	var place = new BigInt();

	place.digits[0] = 1; // radix^0

	for (var i = s.length - 1; i >= istop; i--) {

		var c = s.charCodeAt(i);

		var digit = charToHex(c);

		var biDigit = biMultiplyDigit(place, digit);

		result = biAdd(result, biDigit);

		place = biMultiplyDigit(place, radix);

	}

	result.isNeg = isNeg;

	return result;

}



function biDump(b)

{

	return (b.isNeg ? "-" : "") + b.digits.join(" ");

}



function biAdd(x, y)

{

	var result;



	if (x.isNeg != y.isNeg) {

		y.isNeg = !y.isNeg;

		result = biSubtract(x, y);

		y.isNeg = !y.isNeg;

	}

	else {

		result = new BigInt();

		var c = 0;

		var n;

		for (var i = 0; i < x.digits.length; ++i) {

			n = x.digits[i] + y.digits[i] + c;

			result.digits[i] = n % biRadix;

			c = Number(n >= biRadix);

		}

		result.isNeg = x.isNeg;

	}

	return result;

}



function biSubtract(x, y)

{

	var result;

	if (x.isNeg != y.isNeg) {

		y.isNeg = !y.isNeg;

		result = biAdd(x, y);

		y.isNeg = !y.isNeg;

	} else {

		result = new BigInt();

		var n, c;

		c = 0;

		for (var i = 0; i < x.digits.length; ++i) {

			n = x.digits[i] - y.digits[i] + c;

			result.digits[i] = n % biRadix;

			// Stupid non-conforming modulus operation.

			if (result.digits[i] < 0) result.digits[i] += biRadix;

			c = 0 - Number(n < 0);

		}

		// Fix up the negative sign, if any.

		if (c == -1) {

			c = 0;

			for (var i = 0; i < x.digits.length; ++i) {

				n = 0 - result.digits[i] + c;

				result.digits[i] = n % biRadix;

				// Stupid non-conforming modulus operation.

				if (result.digits[i] < 0) result.digits[i] += biRadix;

				c = 0 - Number(n < 0);

			}

			// Result is opposite sign of arguments.

			result.isNeg = !x.isNeg;

		} else {

			// Result is same sign.

			result.isNeg = x.isNeg;

		}

	}

	return result;

}



function biHighIndex(x)

{

	var result = x.digits.length - 1;

	while (result > 0 && x.digits[result] == 0) --result;

	return result;

}



function biNumBits(x)

{

	var n = biHighIndex(x);

	var d = x.digits[n];

	var m = (n + 1) * bitsPerDigit;

	var result;

	for (result = m; result > m - bitsPerDigit; --result) {

		if ((d & 0x8000) != 0) break;

		d <<= 1;

	}

	return result;

}



function biMultiply(x, y)

{

	var result = new BigInt();

	var c;

	var n = biHighIndex(x);

	var t = biHighIndex(y);

	var u, uv, k;



	for (var i = 0; i <= t; ++i) {

		c = 0;

		k = i;

		for (j = 0; j <= n; ++j, ++k) {

			uv = result.digits[k] + x.digits[j] * y.digits[i] + c;

			result.digits[k] = uv & maxDigitVal;

			c = uv >>> biRadixBits;

			//c = Math.floor(uv / biRadix);

		}

		result.digits[i + n + 1] = c;

	}

	// Someone give me a logical xor, please.

	result.isNeg = x.isNeg != y.isNeg;

	return result;

}



function biMultiplyDigit(x, y)

{

	var n, c, uv;



	result = new BigInt();

	n = biHighIndex(x);

	c = 0;

	for (var j = 0; j <= n; ++j) {

		uv = result.digits[j] + x.digits[j] * y + c;

		result.digits[j] = uv & maxDigitVal;

		c = uv >>> biRadixBits;

		//c = Math.floor(uv / biRadix);

	}

	result.digits[1 + n] = c;

	return result;

}



function arrayCopy(src, srcStart, dest, destStart, n)

{

	var m = Math.min(srcStart + n, src.length);

	for (var i = srcStart, j = destStart; i < m; ++i, ++j) {

		dest[j] = src[i];

	}

}



var highBitMasks = new Array(0x0000, 0x8000, 0xC000, 0xE000, 0xF000, 0xF800,

                             0xFC00, 0xFE00, 0xFF00, 0xFF80, 0xFFC0, 0xFFE0,

                             0xFFF0, 0xFFF8, 0xFFFC, 0xFFFE, 0xFFFF);



function biShiftLeft(x, n)

{

	var digitCount = Math.floor(n / bitsPerDigit);

	var result = new BigInt();

	arrayCopy(x.digits, 0, result.digits, digitCount,

	          result.digits.length - digitCount);

	var bits = n % bitsPerDigit;

	var rightBits = bitsPerDigit - bits;

	for (var i = result.digits.length - 1, i1 = i - 1; i > 0; --i, --i1) {

		result.digits[i] = ((result.digits[i] << bits) & maxDigitVal) |

		                   ((result.digits[i1] & highBitMasks[bits]) >>>

		                    (rightBits));

	}

	result.digits[0] = ((result.digits[i] << bits) & maxDigitVal);

	result.isNeg = x.isNeg;

	return result;

}



var lowBitMasks = new Array(0x0000, 0x0001, 0x0003, 0x0007, 0x000F, 0x001F,

                            0x003F, 0x007F, 0x00FF, 0x01FF, 0x03FF, 0x07FF,

                            0x0FFF, 0x1FFF, 0x3FFF, 0x7FFF, 0xFFFF);



function biShiftRight(x, n)

{

	var digitCount = Math.floor(n / bitsPerDigit);

	var result = new BigInt();

	arrayCopy(x.digits, digitCount, result.digits, 0,

	          x.digits.length - digitCount);

	var bits = n % bitsPerDigit;

	var leftBits = bitsPerDigit - bits;

	for (var i = 0, i1 = i + 1; i < result.digits.length - 1; ++i, ++i1) {

		result.digits[i] = (result.digits[i] >>> bits) |

		                   ((result.digits[i1] & lowBitMasks[bits]) << leftBits);

	}

	result.digits[result.digits.length - 1] >>>= bits;

	result.isNeg = x.isNeg;

	return result;

}



function biMultiplyByRadixPower(x, n)

{

	var result = new BigInt();

	arrayCopy(x.digits, 0, result.digits, n, result.digits.length - n);

	return result;

}



function biDivideByRadixPower(x, n)

{

	var result = new BigInt();

	arrayCopy(x.digits, n, result.digits, 0, result.digits.length - n);

	return result;

}



function biModuloByRadixPower(x, n)

{

	var result = new BigInt();

	arrayCopy(x.digits, 0, result.digits, 0, n);

	return result;

}



function biCompare(x, y)

{

	if (x.isNeg != y.isNeg) {

		return 1 - 2 * Number(x.isNeg);

	}

	for (var i = x.digits.length - 1; i >= 0; --i) {

		if (x.digits[i] != y.digits[i]) {

			if (x.isNeg) {

				return 1 - 2 * Number(x.digits[i] > y.digits[i]);

			} else {

				return 1 - 2 * Number(x.digits[i] < y.digits[i]);

			}

		}

	}

	return 0;

}



function biDivideModulo(x, y)

{

	var nb = biNumBits(x);

	var tb = biNumBits(y);

	var origYIsNeg = y.isNeg;

	var q, r;

	if (nb < tb) {

		// |x| < |y|

		if (x.isNeg) {

			q = biCopy(bigOne);

			q.isNeg = !y.isNeg;

			x.isNeg = false;

			y.isNeg = false;

			r = biSubtract(y, x);

			// Restore signs, 'cause they're references.

			x.isNeg = true;

			y.isNeg = origYIsNeg;

		} else {

			q = new BigInt();

			r = biCopy(x);

		}

		return new Array(q, r);

	}



	q = new BigInt();

	r = x;



	// Normalize Y.

	var t = Math.ceil(tb / bitsPerDigit) - 1;

	var lambda = 0;

	while (y.digits[t] < biHalfRadix) {

		y = biShiftLeft(y, 1);

		++lambda;

		++tb;

		t = Math.ceil(tb / bitsPerDigit) - 1;

	}

	// Shift r over to keep the quotient constant. We'll shift the

	// remainder back at the end.

	r = biShiftLeft(r, lambda);

	nb += lambda; // Update the bit count for x.

	var n = Math.ceil(nb / bitsPerDigit) - 1;



	var b = biMultiplyByRadixPower(y, n - t);

	while (biCompare(r, b) != -1) {

		++q.digits[n - t];

		r = biSubtract(r, b);

	}

	for (var i = n; i > t; --i) {

    var ri = (i >= r.digits.length) ? 0 : r.digits[i];

    var ri1 = (i - 1 >= r.digits.length) ? 0 : r.digits[i - 1];

    var ri2 = (i - 2 >= r.digits.length) ? 0 : r.digits[i - 2];

    var yt = (t >= y.digits.length) ? 0 : y.digits[t];

    var yt1 = (t - 1 >= y.digits.length) ? 0 : y.digits[t - 1];

		if (ri == yt) {

			q.digits[i - t - 1] = maxDigitVal;

		} else {

			q.digits[i - t - 1] = Math.floor((ri * biRadix + ri1) / yt);

		}



		var c1 = q.digits[i - t - 1] * ((yt * biRadix) + yt1);

		var c2 = (ri * biRadixSquared) + ((ri1 * biRadix) + ri2);

		while (c1 > c2) {

			--q.digits[i - t - 1];

			c1 = q.digits[i - t - 1] * ((yt * biRadix) | yt1);

			c2 = (ri * biRadix * biRadix) + ((ri1 * biRadix) + ri2);

		}



		b = biMultiplyByRadixPower(y, i - t - 1);

		r = biSubtract(r, biMultiplyDigit(b, q.digits[i - t - 1]));

		if (r.isNeg) {

			r = biAdd(r, b);

			--q.digits[i - t - 1];

		}

	}

	r = biShiftRight(r, lambda);

	// Fiddle with the signs and stuff to make sure that 0 <= r < y.

	q.isNeg = x.isNeg != origYIsNeg;

	if (x.isNeg) {

		if (origYIsNeg) {

			q = biAdd(q, bigOne);

		} else {

			q = biSubtract(q, bigOne);

		}

		y = biShiftRight(y, lambda);

		r = biSubtract(y, r);

	}

	// Check for the unbelievably stupid degenerate case of r == -0.

	if (r.digits[0] == 0 && biHighIndex(r) == 0) r.isNeg = false;



	return new Array(q, r);

}



function biDivide(x, y)

{

	return biDivideModulo(x, y)[0];

}



function biModulo(x, y)

{

	return biDivideModulo(x, y)[1];

}



function biMultiplyMod(x, y, m)

{

	return biModulo(biMultiply(x, y), m);

}



function biPow(x, y)

{

	var result = bigOne;

	var a = x;

	while (true) {

		if ((y & 1) != 0) result = biMultiply(result, a);

		y >>= 1;

		if (y == 0) break;

		a = biMultiply(a, a);

	}

	return result;

}



function biPowMod(x, y, m)

{

	var result = bigOne;

	var a = x;

	var k = y;

	while (true) {

		if ((k.digits[0] & 1) != 0) result = biMultiplyMod(result, a, m);

		k = biShiftRight(k, 1);

		if (k.digits[0] == 0 && biHighIndex(k) == 0) break;

		a = biMultiplyMod(a, a, m);

	}

	return result;

}

function vericpf (cpf) { x = 0;
	/*if(cpf == 0) {
		return true;
	} else {*/
		if ((cpf == '') || (document.contato.cpf.lenght < 11)) { 
		  /*alert('CPF inválido!');
		  document.contato.cpf.value = "";
		  document.contato.cpf.focus();
		  return false; */
                        x = 1;
                } else {
		        if (cpf == "11111111111" ||
			        cpf == "22222222222" ||	cpf == "33333333333" || cpf == "44444444444" ||
			        cpf == "55555555555" || cpf == "66666666666" || cpf == "77777777777" ||
			        cpf == "88888888888" || cpf == "99999999999" || cpf == "00000000000") {
			/*alert('CPF inválido!');
			document.contato.cpf.value = "";
			document.contato.cpf.focus();
			return false; */ x = 1;
                        }
		        soma = 0;
		        for (i=0; i < 9; i ++)
			        soma += parseInt(cpf.charAt(i)) * (10 - i);
		        resto = 11 - (soma % 11);
		        if (resto == 10 || resto == 11)
			        resto = 0;
		        if (resto != parseInt(cpf.charAt(9))) {
			/*alert('CPF inválido!');
			document.contato.cpf.value = "";
			document.contato.cpf.focus();
			return false;*/ x = 1;
			}
		        soma = 0;
		        for (i = 0; i < 10; i ++)
			        soma += parseInt(cpf.charAt(i)) * (11 - i);
		        resto = 11 - (soma % 11);
		        if (resto == 10 || resto == 11)
			        resto = 0;
		        if (resto != parseInt(cpf.charAt(10))) {
			/*alert('CPF inválido!');
			document.contato.cpf.value = "";
			document.contato.cpf.focus();
			return false;*/ x = 1;
	                }
		        //return true;
		}
                if (x == 1) {
                        alert('CPF inválido!');
			document.contato.cpf.value = "";
			document.contato.cpf.focus();
			//return false;
                } else  return true;                
	//}
}

/*function vericpf (cpf) {
	/*if(cpf == 0) {
		return true;
	} else {*/ /*
		if ((cpf == '') || (document.contato.cpf.lenght < 11)) { 
		  alert('CPF inválido!');
		  document.contato.cpf.value = "";
		  document.contato.cpf.focus();
		  return false; 
                }
		else {
		if (cpf == "11111111111" ||
			cpf == "22222222222" ||	cpf == "33333333333" || cpf == "44444444444" ||
			cpf == "55555555555" || cpf == "66666666666" || cpf == "77777777777" ||
			cpf == "88888888888" || cpf == "99999999999" || cpf == "00000000000") {
			alert('CPF inválido!');
			document.contato.cpf.value = "";
			document.contato.cpf.focus();
			return false; 
                }
		soma = 0;
		for (i=0; i < 9; i ++)
			soma += parseInt(cpf.charAt(i)) * (10 - i);
		resto = 11 - (soma % 11);
		if (resto == 10 || resto == 11)
			resto = 0;
		if (resto != parseInt(cpf.charAt(9))) {
			alert('CPF inválido!');
			document.contato.cpf.value = "";
			document.contato.cpf.focus();
			return false;
			}
		soma = 0;
		for (i = 0; i < 10; i ++)
			soma += parseInt(cpf.charAt(i)) * (11 - i);
		resto = 11 - (soma % 11);
		if (resto == 10 || resto == 11)
			resto = 0;
		if (resto != parseInt(cpf.charAt(10))) {
			alert('CPF inválido!');
			document.contato.cpf.value = "";
			document.contato.cpf.focus();
			return false;
			}
		return true;
		}
	//}
}*/