// JavaScript Document
/**
* @author Márcio d'Ávila
* @version 1.03, 2004-2008
* http://www.mhavila.com.br/topicos/web/cpf_cnpj.html
*
* Licenciado sob os termos da licença Creative Commons,
* Atribuição - Compartilhamento pela mesma licença 2.5:
* http://creativecommons.org/licenses/by-sa/2.5/br/
*
* PROTÓTIPOS:
* método String.lpad(int pSize, char pCharPad)
* método String.trim()
*
* String unformatNumber(String pNum)
* String formatCpfCnpj(String pCpfCnpj, boolean pUseSepar, boolean pIsCnpj)
* String dvCpfCnpj(String pEfetivo, boolean pIsCnpj)
* boolean isCpf(String pCpf)
* boolean isCnpj(String pCnpj)
* boolean isCpfCnpj(String pCpfCnpj)
*/
var NUM_DIGITOS_CPF = 11;
var NUM_DIGITOS_CNPJ = 14;
var NUM_DGT_CNPJ_BASE = 8;
/**
* Adiciona método lpad() à classe String.
* Preenche a String à esquerda com o caractere fornecido,
* até que ela atinja o tamanho especificado.
*/
String.prototype.lpad = function(pSize, pCharPad)
{
var str = this;
var dif = pSize - str.length;
var ch = String(pCharPad).charAt(0);
for (; dif>0; dif--) str = ch + str;
return (str);
} //String.lpad
/**
* Adiciona método trim() à classe String.
* Elimina brancos no início e fim da String.
*/
String.prototype.trim = function()
{
return this.replace(/^\s*/, "").replace(/\s*$/, "");
} //String.trim
/**
* Elimina caracteres de formatação e zeros à esquerda da string
* de número fornecida.
* @param String pNum
* String de número fornecida para ser desformatada.
* @return String de número desformatada.
*/
function unformatNumber(pNum)
{
return String(pNum).replace(/\D/g, "").replace(/^0+/, "");
} //unformatNumber
/**
* Formata a string fornecida como CNPJ ou CPF, adicionando zeros
* à esquerda se necessário e caracteres separadores, conforme solicitado.
* @param String pCpfCnpj
* String fornecida para ser formatada.
* @param boolean pUseSepar
* Indica se devem ser usados caracteres separadores (. - /).
* @param boolean pIsCnpj
* Indica se a string fornecida é um CNPJ.
* Caso contrário, é CPF. Default = false (CPF).
* @return String de CPF ou CNPJ devidamente formatada.
*/
function formatCpfCnpj(pCpfCnpj, pUseSepar, pIsCnpj)
{
if (pIsCnpj==null) pIsCnpj = false;
if (pUseSepar==null) pUseSepar = true;
var maxDigitos = pIsCnpj? NUM_DIGITOS_CNPJ: NUM_DIGITOS_CPF;
var numero = unformatNumber(pCpfCnpj);
numero = numero.lpad(maxDigitos, '0');
if (!pUseSepar) return numero;
if (pIsCnpj)
{
reCnpj = /(\d{2})(\d{3})(\d{3})(\d{4})(\d{2})$/;
numero = numero.replace(reCnpj, "$1.$2.$3/$4-$5");
}
else
{
reCpf = /(\d{3})(\d{3})(\d{3})(\d{2})$/;
numero = numero.replace(reCpf, "$1.$2.$3-$4");
}
return numero;
} //formatCpfCnpj
/**
* Calcula os 2 dígitos verificadores para o número-efetivo pEfetivo de
* CNPJ (12 dígitos) ou CPF (9 dígitos) fornecido. pIsCnpj é booleano e
* informa se o número-efetivo fornecido é CNPJ (default = false).
* @param String pEfetivo
* String do número-efetivo (SEM dígitos verificadores) de CNPJ ou CPF.
* @param boolean pIsCnpj
* Indica se a string fornecida é de um CNPJ.
* Caso contrário, é CPF. Default = false (CPF).
* @return String com os dois dígitos verificadores.
*/
function dvCpfCnpj(pEfetivo, pIsCnpj)
{
if (pIsCnpj==null) pIsCnpj = false;
var i, j, k, soma, dv;
var cicloPeso = pIsCnpj? NUM_DGT_CNPJ_BASE: NUM_DIGITOS_CPF;
var maxDigitos = pIsCnpj? NUM_DIGITOS_CNPJ: NUM_DIGITOS_CPF;
var calculado = formatCpfCnpj(pEfetivo + "00", false, pIsCnpj);
calculado = calculado.substring(0, maxDigitos - 2);
var result = "";
for (j = 1; j <= 2; j++)
{
k = 2;
soma = 0;
for (i = calculado.length-1; i >= 0; i--)
{
soma += (calculado.charAt(i) - '0') * k;
k = (k-1) % cicloPeso + 2;
}
dv = 11 - soma % 11;
if (dv > 9) dv = 0;
calculado += dv;
result += dv
}
return result;
} //dvCpfCnpj
/**
* Testa se a String pCpf fornecida é um CPF válido.
* Qualquer formatação que não seja algarismos é desconsiderada.
* @param String pCpf
* String fornecida para ser testada.
* @return true se a String fornecida for um CPF válido.
*/
function isCpf(pCpf)
{
var numero = formatCpfCnpj(pCpf, false, false);
if (numero.length > NUM_DIGITOS_CPF) return false;
var base = numero.substring(0, numero.length - 2);
var digitos = dvCpfCnpj(base, false);
var algUnico, i;
// Valida dígitos verificadores
if (numero != "" + base + digitos) return false;
/* Não serão considerados válidos os seguintes CPF:
* 000.000.000-00, 111.111.111-11, 222.222.222-22, 333.333.333-33, 444.444.444-44,
* 555.555.555-55, 666.666.666-66, 777.777.777-77, 888.888.888-88, 999.999.999-99.
*/
algUnico = true;
for (i=1; algUnico && itrue se a String fornecida for um CNPJ válido.
*/
function isCnpj(pCnpj)
{
var numero = formatCpfCnpj(pCnpj, false, true);
if (numero.length > NUM_DIGITOS_CNPJ) return false;
var base = numero.substring(0, NUM_DGT_CNPJ_BASE);
var ordem = numero.substring(NUM_DGT_CNPJ_BASE, 12);
var digitos = dvCpfCnpj(base + ordem, true);
var algUnico;
// Valida dígitos verificadores
if (numero != "" + base + ordem + digitos) return false;
/* Não serão considerados válidos os CNPJ com os seguintes números BÁSICOS:
* 11.111.111, 22.222.222, 33.333.333, 44.444.444, 55.555.555,
* 66.666.666, 77.777.777, 88.888.888, 99.999.999.
*/
algUnico = numero.charAt(0) != '0';
for (i=1; algUnico && itrue se a String fornecida for um CPF ou CNPJ válido.
*/
function isCpfCnpj(pCpfCnpj)
{
var numero = pCpfCnpj.replace(/\D/g, "");
if (numero.length > NUM_DIGITOS_CPF)
{
return isCnpj(pCpfCnpj)
}
else
return isCpf(pCpfCnpj);
} //isCpfCnpj
// MINHAS FUNÇÕES - Gabriel Castellani
//****************************************************************************************************
//****************************************************************************************************
//****************************************************************************************************
function SomenteNumeros(Texto)
{
var Result='';
var Numeros='0123456789';
var Letras='ABCDEFGHIJKLMNOPQRSTUVWXYZ';
TemLetra=false;
Texto=Texto.toUpperCase();
for(i=0; i-1) { Result += Texto.substr(i,1); }
if(Letras.indexOf(Texto.substr(i,1))>-1) { TemLetra=true; }
}
if(TemLetra) { return 'ERRO'; } else { return Result; }
}
//****************************************************************************************************
//****************************************************************************************************
//****************************************************************************************************
function check_email(e)
{
ok = "1234567890qwertyuiop[]asdfghjklzxcvbnm.@-_QWERTYUIOPASDFGHJKLZXCVBNM";
for(i=0; i < e.length ;i++)
{
if(ok.indexOf(e.charAt(i))<0){ return (false); }
}
if (document.images)
{
re = /(@.*@)|(\.\.)|(^\.)|(^@)|(@$)|(\.$)|(@\.)/;
re_two = /^.+\@(\[?)[a-zA-Z0-9\-\.]+\.([a-zA-Z]{2,4}|[0-9]{1,3})(\]?)$/;
if (!e.match(re) && e.match(re_two)) { return (-1); }
}
}
//****************************************************************************************************
//****************************************************************************************************
//****************************************************************************************************
function Exibe(Quem,Pai)
{
if(Pai==undefined)
{
document.getElementById(Quem).style.visibility="visible";
document.getElementById(Quem).style.height='auto';
}
else
{
window.parent.document.getElementById(Quem).style.visibility="visible";
window.parent.document.getElementById(Quem).style.height='auto';
}
return true;
}
//****************************************************************************************************
//****************************************************************************************************
//****************************************************************************************************
function Esconde(Quem,Pai)
{
if(Pai==undefined)
{
document.getElementById(Quem).style.visibility="hidden";
document.getElementById(Quem).style.height='0px';
}
else
{
window.parent.document.getElementById(Quem).style.visibility="hidden";
window.parent.document.getElementById(Quem).style.height='0px';
}
return true;
}
//****************************************************************************************************
//****************************************************************************************************
//****************************************************************************************************
function Valor(Quem,Valor)
{
if ( typeof Valor == "undefined" )
{
return document.getElementById(Quem).value;
}
else
{
document.getElementById(Quem).value=Valor;
return true;
}
}
//****************************************************************************************************
//****************************************************************************************************
//****************************************************************************************************
function Cor(Quem,Valor)
{
if ( typeof Valor == "undefined" )
{
return document.getElementById(Quem).style.color;
}
else
{
document.getElementById(Quem).style.color=Valor;
return true;
}
}
//****************************************************************************************************
//****************************************************************************************************
//****************************************************************************************************
function CorFundo(Quem,Valor)
{
if ( typeof Valor == "undefined" )
{
return document.getElementById(Quem).style.backgroundColor;
}
else
{
document.getElementById(Quem).style.backgroundColor=Valor;
return true;
}
}
//****************************************************************************************************
//****************************************************************************************************
//****************************************************************************************************
function Check(Quem)
{
document.getElementById(Quem).checked='checked';
return true;
}
//****************************************************************************************************
//****************************************************************************************************
//****************************************************************************************************
function Uncheck(Quem)
{
document.getElementById(Quem).checked=false;
return true;
}
//****************************************************************************************************
//****************************************************************************************************
//****************************************************************************************************
function iHTML(Quem,Valor)
{
document.getElementById(Quem).innerHTML=Valor;
return true;
}
//****************************************************************************************************
//****************************************************************************************************
//****************************************************************************************************
function Checked(Quem) {
return document.getElementById(Quem).checked;
}
//****************************************************************************************************
//****************************************************************************************************
//****************************************************************************************************
function DivVisivel(Quem) {
return (document.getElementById(Quem).style.visibility=='visible');
}
//****************************************************************************************************
//****************************************************************************************************
//****************************************************************************************************
function iif(Comp,R1,R2)
{
if(Comp)
{ return R1; }
else
{ return R2; }
}
//****************************************************************************************************
//****************************************************************************************************
//****************************************************************************************************
function ImprimeMenus(LK)
{
document.write(' ');
return true;
}
//****************************************************************************************************
//****************************************************************************************************
//****************************************************************************************************
function Zeros(Campo,NumZeros)
{
estrValor=Campo.toString();
if(estrValor.length>=NumZeros)
{ return estrValor; }
else
{
estrZeros="";
for(i=1; i<=NumZeros-estrValor.length; i++)
{
estrZeros=estrZeros+"0";
}
return estrZeros+estrValor;
}
}
//****************************************************************************************************
//****************************************************************************************************
//****************************************************************************************************
function FormataNome(Nome)
{
var UNome=Nome.toUpperCase();
var Conexoes=",e,de,da,do,das,dos,a,as,o,os,por,para,";
if (Nome==UNome)
{ return Nome; }
else
{
var Palavras=Nome.split(" ");
Nome="";
for(i=0;i-1)
{ Nome=Nome+Palavras[i]+" "; }
else
{
Letra=Palavras[i].toUpperCase();
Letra=Letra.substr(0,1);
Fim=Palavras[i].substr(1);
Nome=Nome+Letra+Fim+" ";
}
}
return Nome;
}
}
//****************************************************************************************************
//****************************************************************************************************
//****************************************************************************************************
function FormataCEP(Campo)
{
Campo=SomenteNumeros(Campo);
var Zeros="";
if(Campo.length<5)
{
for (i=1;i<=5-Campo.length;i++)
{ Zeros+="0"; }
Campo=Zeros+Campo+"000";
}
else if(Campo.length==5)
{
for (i=1;i<=8-Campo.length;i++)
{ Zeros+="0"; }
Campo=Campo+Zeros;
}
else if(Campo.length<8)
{
for (i=1;i<=8-Campo.length;i++)
{ Zeros+="0"; }
Campo=Zeros+Campo;
}
return Campo.substr(0,5)+"-"+Campo.substr(5,3);
}
//****************************************************************************************************
//****************************************************************************************************
//****************************************************************************************************
function FormataTelefone(Campo)
{
Campo=SomenteNumeros(Campo);
if(Campo.length==8)
{ return "(47) "+Campo.substr(0,4)+"-"+Campo.substr(4,4); }
else if(Campo.substr(0,4)=="0800")
{
switch(Campo.length)
{
case 11: return Campo.substr(0,4)+" "+Campo.substr(4,3)+" "+Campo.substr(7,4);
case 10: return Campo.substr(0,4)+" "+Campo.substr(4,2)+" "+Campo.substr(6,4);
default: return Campo.substr(0,4)+" "+Campo.substr(4);
}
}
else
{
switch(Campo.length)
{
case 10: return "("+Campo.substr(0,2)+") "+Campo.substr(2,4)+"-"+Campo.substr(6,4);
case 11: return "("+Campo.substr(0,3)+") "+Campo.substr(3,4)+"-"+Campo.substr(7,4);
case 12: return "(0"+Campo.substr(0,4)+") "+Campo.substr(4,4)+"-"+Campo.substr(8,4);
case 13: return "("+Campo.substr(0,5)+") "+Campo.substr(5,4)+"-"+Campo.substr(9,4);
default: return Campo;
}
}
}
//****************************************************************************************************
//****************************************************************************************************
//****************************************************************************************************
function Milhares(Campo)
{
var j=0;
if(Campo.length>3)
{
//Formata um número inteiro dividindo em milhares
Temp=SomenteNumeros(Campo);
Campo='';
for(i=Temp.length-3;i>=0; i-=3)
{
Campo=Temp.substr(i,3)+iif(Campo!='','.','')+Campo;
j+=3;
}
if(jVirgula) { Virgula=Ponto; Ponto=-1;}
if(Virgula==Ponto)
{ Campo=Milhares(Campo)+","+Zeros("0",Decimais); }
else
{
//Virgula decimal
Inteiro=Milhares(Campo.substr(0,Virgula));
Centavos=Campo.substr(Virgula-Tamanho+1);
Centavos=Centavos+Zeros("0",Decimais);
Centavos=Centavos.substr(0,Decimais);
Campo=Inteiro+","+Centavos;
}
return Campo;
}
//****************************************************************************************************
//****************************************************************************************************
//****************************************************************************************************
function FormataData(Campo)
{
var Data="";
Campo=SomenteNumeros(Campo);
Tamanho=Campo.length;
Hoje=new Date();
switch(Tamanho)
{
case 0:
Data=Zeros(Hoje.getDate(),2)+"/"+Zeros((Hoje.getMonth()+1),2)+"/"+Hoje.getFullYear();
break;
case 1:
Data=Zeros(Campo,2)+"/"+Zeros((Hoje.getMonth()+1),2)+"/"+Hoje.getFullYear();
break;
case 2:
Data=Zeros(Campo.substr(0,1),2)+"/"+Zeros(Campo.substr(1,1),2)+"/"+Hoje.getFullYear();
break;
case 3:
Data=Zeros(Campo.substr(0,1),2)+"/"+Zeros(Campo.substr(1,1),2)+"/200"+Campo.substr(2,1);
break;
case 4:
Data=Zeros(Campo.substr(0,1),2)+"/"+Zeros(Campo.substr(1,1),2);
Ano=Campo.substr(-2,2);
if(Ano >= 29)
{ Data=Data+"/19"+Campo.substr(-2,2); }
else
{ Data=Data+"/20"+Campo.substr(-2,2); }
break;
default:
Data = Campo.substr(-2,2);
Ano=Campo.substr(-4,2);
if(Ano==19 || Ano==20 || Tamanho >= 6)
{
Data="/"+Ano+Data;
Campo=Campo.substr(0,Campo.length - 4);
}
else
{
if(Ano>= 29) { Data = "/19"+Data; }
else { Data = "/20"+Data; }
Campo=Campo.substr(0,Campo.length - 2);
}
Tamanho=Campo.length;
if(Tamanho == 2)
{ Data = "0" + Campo.substr(0,1) + "/0" + Campo.substr(1,1) + Data; }
else
{
Mes=Campo.substr(-2,2);
if(Mes> 12)
{ Data = Campo.substr(-3,2) + "/0" + Campo.substr(-1,1) + Data; }
else
{
if(Tamanho==3)
{ Data = "0" + Campo.substr(-3,1) + "/" +Campo.substr(-2,2) + Data; }
else
{ Data = Campo.substr(-4,2) + "/" +Campo.substr(-2,2) + Data; }
}
}
}
//Validando a data
Ano=eval(Data.substr(-4,4));
Mes=eval(Data.substr(3,2));
Dia=eval(Data.substr(0,2));
Err=false;
Err=(Ano<1900);
Err=Err || !(Mes>=1 && Mes<=12);
Err=Err || (Dia==0);
switch(Mes)
{
case 2:
if((Ano%4) == 0)
{ Err=Err || (Dia>29); break; }
else
{ Err=Err || (Dia>28); break; }
break;
case 4:
case 6:
case 9:
case 11: Err=Err || (Dia>30); break;
default: Err=Err || (Dia>31); break;
}
if(Err)
{
alert("A data é inválida!");
Data=Zeros(Hoje.getDate(),2)+"/"+Zeros((Hoje.getMonth()+1),2)+"/"+Hoje.getFullYear();
}
return Data;
}
//****************************************************************************************************
//****************************************************************************************************
//****************************************************************************************************
function FormataCampo(Quem,Tipo)
{
var estrValor=document.getElementById(Quem).value;
switch(Tipo)
{
case 0: Valor(Quem,FormataNome(estrValor)); break; //Qualquer nome
case 1: if(isCpfCnpj(estrValor)){document.getElementById(Quem).value=formatCpfCnpj(estrValor,true,(estrValor.length>11));}else{Valor(Quem,"ERRO");} break; //CNPJ
case 2: Valor(Quem,Number(estrValor)); break //Números
case 3: Valor(Quem,FormataCEP(estrValor)); break //CEP
case 4: Valor(Quem,estrValor.toUpperCase()); break //Maiúsculas
case 5: Valor(Quem,FormataTelefone(estrValor)); break; //Telefone
case 6: Valor(Quem,FormataMoeda(estrValor)); break; //Moeda
case 7: Valor(Quem,FormataMoeda(estrValor,3)); break; //Moeda com 3 decimais
case 8: Valor(Quem,FormataData(estrValor)); break;
}
}
//****************************************************************************************************
//****************************************************************************************************
//****************************************************************************************************
// CONTEÚDO PARA GERAR MD5
//****************************************************************************************************
//****************************************************************************************************
//****************************************************************************************************
/*
* A JavaScript implementation of the RSA Data Security, Inc. MD5 Message
* Digest Algorithm, as defined in RFC 1321.
* Version 2.2 Copyright (C) Paul Johnston 1999 - 2009
* Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
* Distributed under the BSD License
* See http://pajhome.org.uk/crypt/md5 for more info.
*/
/*
* Configurable variables. You may need to tweak these to be compatible with
* the server-side, but the defaults work in most cases.
*/
var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */
var b64pad = ""; /* base-64 pad character. "=" for strict RFC compliance */
/*
* These are the functions you'll usually want to call
* They take string arguments and return either hex or base-64 encoded strings
*/
function hex_md5(s) { return rstr2hex(rstr_md5(str2rstr_utf8(s))); }
function b64_md5(s) { return rstr2b64(rstr_md5(str2rstr_utf8(s))); }
function any_md5(s, e) { return rstr2any(rstr_md5(str2rstr_utf8(s)), e); }
function hex_hmac_md5(k, d)
{ return rstr2hex(rstr_hmac_md5(str2rstr_utf8(k), str2rstr_utf8(d))); }
function b64_hmac_md5(k, d)
{ return rstr2b64(rstr_hmac_md5(str2rstr_utf8(k), str2rstr_utf8(d))); }
function any_hmac_md5(k, d, e)
{ return rstr2any(rstr_hmac_md5(str2rstr_utf8(k), str2rstr_utf8(d)), e); }
/*
* Calculate the MD5 of a raw string
*/
function rstr_md5(s)
{
return binl2rstr(binl_md5(rstr2binl(s), s.length * 8));
}
/*
* Calculate the HMAC-MD5, of a key and some data (raw strings)
*/
function rstr_hmac_md5(key, data)
{
var bkey = rstr2binl(key);
if(bkey.length > 16) bkey = binl_md5(bkey, key.length * 8);
var ipad = Array(16), opad = Array(16);
for(var i = 0; i < 16; i++)
{
ipad[i] = bkey[i] ^ 0x36363636;
opad[i] = bkey[i] ^ 0x5C5C5C5C;
}
var hash = binl_md5(ipad.concat(rstr2binl(data)), 512 + data.length * 8);
return binl2rstr(binl_md5(opad.concat(hash), 512 + 128));
}
/*
* Convert a raw string to a hex string
*/
function rstr2hex(input)
{
try { hexcase } catch(e) { hexcase=0; }
var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
var output = "";
var x;
for(var i = 0; i < input.length; i++)
{
x = input.charCodeAt(i);
output += hex_tab.charAt((x >>> 4) & 0x0F)
+ hex_tab.charAt( x & 0x0F);
}
return output;
}
/*
* Convert a raw string to a base-64 string
*/
function rstr2b64(input)
{
try { b64pad } catch(e) { b64pad=''; }
var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
var output = "";
var len = input.length;
for(var i = 0; i < len; i += 3)
{
var triplet = (input.charCodeAt(i) << 16)
| (i + 1 < len ? input.charCodeAt(i+1) << 8 : 0)
| (i + 2 < len ? input.charCodeAt(i+2) : 0);
for(var j = 0; j < 4; j++)
{
if(i * 8 + j * 6 > input.length * 8) output += b64pad;
else output += tab.charAt((triplet >>> 6*(3-j)) & 0x3F);
}
}
return output;
}
/*
* Convert a raw string to an arbitrary string encoding
*/
function rstr2any(input, encoding)
{
var divisor = encoding.length;
var i, j, q, x, quotient;
/* Convert to an array of 16-bit big-endian values, forming the dividend */
var dividend = Array(Math.ceil(input.length / 2));
for(i = 0; i < dividend.length; i++)
{
dividend[i] = (input.charCodeAt(i * 2) << 8) | input.charCodeAt(i * 2 + 1);
}
/*
* Repeatedly perform a long division. The binary array forms the dividend,
* the length of the encoding is the divisor. Once computed, the quotient
* forms the dividend for the next step. All remainders are stored for later
* use.
*/
var full_length = Math.ceil(input.length * 8 /
(Math.log(encoding.length) / Math.log(2)));
var remainders = Array(full_length);
for(j = 0; j < full_length; j++)
{
quotient = Array();
x = 0;
for(i = 0; i < dividend.length; i++)
{
x = (x << 16) + dividend[i];
q = Math.floor(x / divisor);
x -= q * divisor;
if(quotient.length > 0 || q > 0)
quotient[quotient.length] = q;
}
remainders[j] = x;
dividend = quotient;
}
/* Convert the remainders to the output string */
var output = "";
for(i = remainders.length - 1; i >= 0; i--)
output += encoding.charAt(remainders[i]);
return output;
}
/*
* Encode a string as utf-8.
* For efficiency, this assumes the input is valid utf-16.
*/
function str2rstr_utf8(input)
{
var output = "";
var i = -1;
var x, y;
while(++i < input.length)
{
/* Decode utf-16 surrogate pairs */
x = input.charCodeAt(i);
y = i + 1 < input.length ? input.charCodeAt(i + 1) : 0;
if(0xD800 <= x && x <= 0xDBFF && 0xDC00 <= y && y <= 0xDFFF)
{
x = 0x10000 + ((x & 0x03FF) << 10) + (y & 0x03FF);
i++;
}
/* Encode output as utf-8 */
if(x <= 0x7F)
output += String.fromCharCode(x);
else if(x <= 0x7FF)
output += String.fromCharCode(0xC0 | ((x >>> 6 ) & 0x1F),
0x80 | ( x & 0x3F));
else if(x <= 0xFFFF)
output += String.fromCharCode(0xE0 | ((x >>> 12) & 0x0F),
0x80 | ((x >>> 6 ) & 0x3F),
0x80 | ( x & 0x3F));
else if(x <= 0x1FFFFF)
output += String.fromCharCode(0xF0 | ((x >>> 18) & 0x07),
0x80 | ((x >>> 12) & 0x3F),
0x80 | ((x >>> 6 ) & 0x3F),
0x80 | ( x & 0x3F));
}
return output;
}
/*
* Encode a string as utf-16
*/
function str2rstr_utf16le(input)
{
var output = "";
for(var i = 0; i < input.length; i++)
output += String.fromCharCode( input.charCodeAt(i) & 0xFF,
(input.charCodeAt(i) >>> 8) & 0xFF);
return output;
}
function str2rstr_utf16be(input)
{
var output = "";
for(var i = 0; i < input.length; i++)
output += String.fromCharCode((input.charCodeAt(i) >>> 8) & 0xFF,
input.charCodeAt(i) & 0xFF);
return output;
}
/*
* Convert a raw string to an array of little-endian words
* Characters >255 have their high-byte silently ignored.
*/
function rstr2binl(input)
{
var output = Array(input.length >> 2);
for(var i = 0; i < output.length; i++)
output[i] = 0;
for(var i = 0; i < input.length * 8; i += 8)
output[i>>5] |= (input.charCodeAt(i / 8) & 0xFF) << (i%32);
return output;
}
/*
* Convert an array of little-endian words to a string
*/
function binl2rstr(input)
{
var output = "";
for(var i = 0; i < input.length * 32; i += 8)
output += String.fromCharCode((input[i>>5] >>> (i % 32)) & 0xFF);
return output;
}
/*
* Calculate the MD5 of an array of little-endian words, and a bit length.
*/
function binl_md5(x, len)
{
/* append padding */
x[len >> 5] |= 0x80 << ((len) % 32);
x[(((len + 64) >>> 9) << 4) + 14] = len;
var a = 1732584193;
var b = -271733879;
var c = -1732584194;
var d = 271733878;
for(var i = 0; i < x.length; i += 16)
{
var olda = a;
var oldb = b;
var oldc = c;
var oldd = d;
a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);
d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);
c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);
b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);
a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);
d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);
c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);
b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);
a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);
d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);
c = md5_ff(c, d, a, b, x[i+10], 17, -42063);
b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);
a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);
d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);
c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);
b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);
a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);
d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);
c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);
b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);
a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);
d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);
c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);
b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);
a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);
d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);
c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);
b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);
a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);
d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);
c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);
b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);
a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);
d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);
c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);
b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);
a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);
d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);
c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);
b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);
a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);
d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);
c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);
b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);
a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);
d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);
c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);
b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);
a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);
d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);
c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);
b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);
a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);
d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);
c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);
b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);
a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);
d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);
c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);
b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);
a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);
d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);
c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);
b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);
a = safe_add(a, olda);
b = safe_add(b, oldb);
c = safe_add(c, oldc);
d = safe_add(d, oldd);
}
return Array(a, b, c, d);
}
/*
* These functions implement the four basic operations the algorithm uses.
*/
function md5_cmn(q, a, b, x, s, t)
{
return safe_add(bit_rol(safe_add(safe_add(a, q), safe_add(x, t)), s),b);
}
function md5_ff(a, b, c, d, x, s, t)
{
return md5_cmn((b & c) | ((~b) & d), a, b, x, s, t);
}
function md5_gg(a, b, c, d, x, s, t)
{
return md5_cmn((b & d) | (c & (~d)), a, b, x, s, t);
}
function md5_hh(a, b, c, d, x, s, t)
{
return md5_cmn(b ^ c ^ d, a, b, x, s, t);
}
function md5_ii(a, b, c, d, x, s, t)
{
return md5_cmn(c ^ (b | (~d)), a, b, x, s, t);
}
/*
* Add integers, wrapping at 2^32. This uses 16-bit operations internally
* to work around bugs in some JS interpreters.
*/
function safe_add(x, y)
{
var lsw = (x & 0xFFFF) + (y & 0xFFFF);
var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
return (msw << 16) | (lsw & 0xFFFF);
}
/*
* Bitwise rotate a 32-bit number to the left.
*/
function bit_rol(num, cnt)
{
return (num << cnt) | (num >>> (32 - cnt));
}