// JavaScript Document

function AjaxClass(clsid)
{
    var objXMLHTTP,objRESULT,objMSXML;
    this.PostData = function(way,url,dat,boo,fun)
    {
        objRESULT = '';
        if(window.XMLHttpRequest){
            objXMLHTTP = new XMLHttpRequest();
        }else{
            var MSXML = ['MSXML2.XMLHTTP.5.0', 'MSXML2.XMLHTTP.4.0', 'MSXML2.XMLHTTP.3.0', 'MSXML2.XMLHTTP', 'Microsoft.XMLHTTP'];
            for(var n=0; n<MSXML.length; n++){
                try{
                    objXMLHTTP = new ActiveXObject(MSXML[n]);
                    break;
                }catch(e){}
            }
        }
        objXMLHTTP.open(way, url, boo); 
        objXMLHTTP.setRequestHeader("Content-Type", "application/x-www-form-urlencoded");
        objXMLHTTP.setRequestHeader("Accept-Language","zh-cn");
        //objXMLHTTP.setRequestHeader("Content-Type","text/xml;charset=gb2312");
        objXMLHTTP.setRequestHeader("Content-Length",dat.length);
        //objXMLHTTP.readystatechange = GetResult;
        objXMLHTTP.send(dat);
        this.ChkResult(fun);
    }

    this.ChkResult = function(fun)
    {
        if(objXMLHTTP.readyState==4){
	      objRESULT = objXMLHTTP.responseText;
	      objXMLHTTP = null;
	      eval(fun + ';');
        }else{
          setTimeout(clsid+'.ChkResult("'+ fun +'")',300);
        }
    }
    this.GetResult = function()
    {
        return objRESULT;
    }
}

function CookieClass()
{

this.GetCookie = function(sName)
{
    // cookies are separated by semicolons
    var aCookie = document.cookie.split("; ");
    for (var i=0; i < aCookie.length; i++)
    {
        // a name alue pair (a crumb) is separated by an equal sign
        var aCrumb = aCookie[i].split("=");
        if (sName == aCrumb[0])
        {
            return unescape(aCrumb[1]);
        }
    }
    // a cookie with the requested name does not exist
    return null;
}

this.SetCookie = function(sName,sValue,sDate)
{
	var expires = new Date();
	expires.setTime(expires.getTime()+sDate*24*60*60*1000);
	document.cookie = sName + "=" + escape(sValue) + "; expires=" + expires.toGMTString;
}

this.decode64 = function(input)
{
    var keyStr = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
    var output = "";
    var chr1, chr2, chr3;
    var enc1, enc2, enc3, enc4;
    var i = 0;
    // remove all characters that are not A-Z, a-z, 0-9, +, /, or =
    input = input.replace(/[^A-Za-z0-9\+\/\=]/g, "");
    flag = 0; // flag of Bytes follows.
    ucs2_code = 0;
    do {
        enc1 = keyStr.indexOf(input.charAt(i++));
        enc2 = keyStr.indexOf(input.charAt(i++));
        enc3 = keyStr.indexOf(input.charAt(i++));
        enc4 = keyStr.indexOf(input.charAt(i++));
        chr1 = (enc1 << 2) | (enc2 >> 4);
        chr2 = ((enc2 & 15) << 4) | (enc3 >> 2);
        chr3 = ((enc3 & 3) << 6) | enc4;
        if ( chr1 <= 0x80) {
            // 单字节ASCII，直接输出
        ucs2_code = chr1;
        } else if (chr1 <= 0xC0) {
            // 非独立字节 --flag;
                if (flag ==1)
                {
                    ucs2_code += ( chr1-0x80 ) << 6;
                }else {
                    ucs2_code += chr1-0x80;
                }
        } else if (chr1 <= 0xE0)
         {
                 // 双字节utf-8编码
        flag = 1;
                ucs2_code = ( chr1-0xC0 ) << 6;
        } else if (chr1 <=0xF0)
        {
             // 三字节utf-8编码
        flag = 2;
                ucs2_code = ( chr1-0xE0 ) << 12;
        }
        if (flag == 0)
        {
            output = output + String.fromCharCode(ucs2_code);
        }
      if (enc3 != 64) {
        if ( chr2 <= 0x80) {
            ucs2_code = chr2;
        } else if (chr2 <= 0xC0)
        {
            --flag;
             if (flag == 1)
            {
                ucs2_code += ( chr2-0x80 ) << 6;
            }else {
                ucs2_code += chr2-0x80;
            }
        } else if (chr2 <= 0xE0)
         {
            flag = 1;
            ucs2_code = ( chr2-0xC0 ) << 6;
        } else if (chr2 <=0xF0)
         {
            flag = 2;
            ucs2_code = ( chr2-0xE0 ) << 12;
        }
        if (flag == 0)
         {
            output = output + String.fromCharCode(ucs2_code);
        }
    }
    if (enc4 != 64) {
        if ( chr3 <= 0x80) {
            ucs2_code = chr3;
        } else if (chr3 <= 0xC0)
        {
            --flag;
            if (flag==1)
            {
                ucs2_code += ( chr3-0x80 ) << 6;
            }else {
            ucs2_code += chr3-0x80;
             }
        } else if (chr3 <= 0xE0)
        {
            flag = 1;
            ucs2_code = ( chr3-0xC0 ) << 6;
        } else if (chr3 <=0xF0)
        {
            flag = 2;
            ucs2_code = ( chr3-0xE0 ) << 12;
        }
        if (flag == 0)
        {
            output = output + String.fromCharCode(ucs2_code);
        }
    }
} while (i < input.length);
    return output;
}

}
//*/



/**********************************************************
* md5.js MD5算法在JS中的实现 
*
* A JavaScript implementation of the RSA Data Security, Inc. MD5
* Message-Digest Algorithm.
*
* Copyright (C) Paul Johnston 1999. Distributed under the LGPL.
***********************************************************/
function MD5Class()
{
//--MD5Class Top -------------------------------------------------------------------\\
//--常量定义---------------------------------------------------------------//
	/* to convert strings to a list of ascii values */
	var sAscii = " !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ"
	var sAscii = sAscii + "[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~";
	var sHex = "0123456789ABCDEF";
	
//--子程hex---------------------------------------------------------------//
	this.Utf8ToGb2312 = function(str) 
	{ 
		var r= "";   
		for(var i=0;i<str.length;i++)   
		{   
			var n = str.charAt(i,1);
			if(n.charCodeAt(0)>255){
				window.execScript("n = n & hex(asc('"+n+"')+1)","VBScript");
			}
			r += n;
		}
		return r; 
	} 
//--子程hex---------------------------------------------------------------//
	/* convert integer to hex string */
	this.hex = function(i)
	{
		h = "";
		for(j = 0; j <= 3; j++)
		{
			h += sHex.charAt((i >> (j * 8 + 4)) & 0x0F) +
			sHex.charAt((i >> (j * 8)) & 0x0F);
		}
		return h;
	}
//--子程add---------------------------------------------------------------//
	/* add, handling overflows correctly */
	this.add = function(x, y)
	{
		return ((x&0x7FFFFFFF) + (y&0x7FFFFFFF)) ^ (x&0x80000000) ^ (y&0x80000000);
	}
//--子程R1 ---------------------------------------------------------------//
	/* MD5 rounds functions */
	this.R1 = function(A, B, C, D, X, S, T)
	{
		q = this.add(this.add(A, (B & C) | (~B & D)), this.add(X, T));
		return this.add((q << S) | ((q >> (32 - S)) & (Math.pow(2, S) - 1)), B);
	}
//--子程R2 ---------------------------------------------------------------//
	this.R2 = function(A, B, C, D, X, S, T)
	{
		q = this.add(this.add(A, (B & D) | (C & ~D)), this.add(X, T));
		return this.add((q << S) | ((q >> (32 - S)) & (Math.pow(2, S) - 1)), B);
	}
//--子程R3 ---------------------------------------------------------------//
	this.R3 = function(A, B, C, D, X, S, T)
	{
		q = this.add(this.add(A, B ^ C ^ D), this.add(X, T));
		return this.add((q << S) | ((q >> (32 - S)) & (Math.pow(2, S) - 1)), B);
	}
//--子程R4 ---------------------------------------------------------------//
	this.R4 = function(A, B, C, D, X, S, T)
	{
		q = this.add(this.add(A, C ^ (B | ~D)), this.add(X, T));
		return this.add((q << S) | ((q >> (32 - S)) & (Math.pow(2, S) - 1)), B);
	}
//--子程calcMD5-----------------------------------------------------------//
	/* main entry point */
	this.getStr = function(sInp)
	{
		/* Calculate length in machine words, including padding */
		//sInp = this.Utf8ToGb2312(sInp);
		wLen = (((sInp.length + 8) >> 6) + 1) << 4;
		var X = new Array(wLen);
		
		/* Convert string to array of words */
		j = 4;
		for (i = 0; (i * 4) < sInp.length; i++)
		{
			X[i] = 0;
			for (j = 0; (j < 4) && ((j + i * 4) < sInp.length); j++)
			{
				X[i] += (sAscii.indexOf(sInp.charAt((i * 4) + j)) + 32) << (j * 8);
			}
		}

		/* Append padding bits and length */
		if (j == 4)
		{
			X[i++] = 0x80;
		}
		else
		{
			X[i - 1] += 0x80 << (j * 8);
		}
		for(; i < wLen; i++) { X[i] = 0; }
		X[wLen - 2] = sInp.length * 8;
		
		/* hard-coded initial values */
		a = 0x67452301;
		b = 0xefcdab89;
		c = 0x98badcfe;
		d = 0x10325476;
		
		/* Process each 16-word block in turn */
		for (i = 0; i < wLen; i += 16) {
			aO = a;
			bO = b;
			cO = c;
			dO = d;
			
			a = this.R1(a, b, c, d, X[i+ 0], 7 , 0xd76aa478);
			d = this.R1(d, a, b, c, X[i+ 1], 12, 0xe8c7b756);
			c = this.R1(c, d, a, b, X[i+ 2], 17, 0x242070db);
			b = this.R1(b, c, d, a, X[i+ 3], 22, 0xc1bdceee);
			a = this.R1(a, b, c, d, X[i+ 4], 7 , 0xf57c0faf);
			d = this.R1(d, a, b, c, X[i+ 5], 12, 0x4787c62a);
			c = this.R1(c, d, a, b, X[i+ 6], 17, 0xa8304613);
			b = this.R1(b, c, d, a, X[i+ 7], 22, 0xfd469501);
			a = this.R1(a, b, c, d, X[i+ 8], 7 , 0x698098d8);
			d = this.R1(d, a, b, c, X[i+ 9], 12, 0x8b44f7af);
			c = this.R1(c, d, a, b, X[i+10], 17, 0xffff5bb1);
			b = this.R1(b, c, d, a, X[i+11], 22, 0x895cd7be);
			a = this.R1(a, b, c, d, X[i+12], 7 , 0x6b901122);
			d = this.R1(d, a, b, c, X[i+13], 12, 0xfd987193);
			c = this.R1(c, d, a, b, X[i+14], 17, 0xa679438e);
			b = this.R1(b, c, d, a, X[i+15], 22, 0x49b40821);
			
			a = this.R2(a, b, c, d, X[i+ 1], 5 , 0xf61e2562);
			d = this.R2(d, a, b, c, X[i+ 6], 9 , 0xc040b340);
			c = this.R2(c, d, a, b, X[i+11], 14, 0x265e5a51);
			b = this.R2(b, c, d, a, X[i+ 0], 20, 0xe9b6c7aa);
			a = this.R2(a, b, c, d, X[i+ 5], 5 , 0xd62f105d);
			d = this.R2(d, a, b, c, X[i+10], 9 , 0x2441453);
			c = this.R2(c, d, a, b, X[i+15], 14, 0xd8a1e681);
			b = this.R2(b, c, d, a, X[i+ 4], 20, 0xe7d3fbc8);
			a = this.R2(a, b, c, d, X[i+ 9], 5 , 0x21e1cde6);
			d = this.R2(d, a, b, c, X[i+14], 9 , 0xc33707d6);
			c = this.R2(c, d, a, b, X[i+ 3], 14, 0xf4d50d87);
			b = this.R2(b, c, d, a, X[i+ 8], 20, 0x455a14ed);
			a = this.R2(a, b, c, d, X[i+13], 5 , 0xa9e3e905);
			d = this.R2(d, a, b, c, X[i+ 2], 9 , 0xfcefa3f8);
			c = this.R2(c, d, a, b, X[i+ 7], 14, 0x676f02d9);
			b = this.R2(b, c, d, a, X[i+12], 20, 0x8d2a4c8a);
			
			a = this.R3(a, b, c, d, X[i+ 5], 4 , 0xfffa3942);
			d = this.R3(d, a, b, c, X[i+ 8], 11, 0x8771f681);
			c = this.R3(c, d, a, b, X[i+11], 16, 0x6d9d6122);
			b = this.R3(b, c, d, a, X[i+14], 23, 0xfde5380c);
			a = this.R3(a, b, c, d, X[i+ 1], 4 , 0xa4beea44);
			d = this.R3(d, a, b, c, X[i+ 4], 11, 0x4bdecfa9);
			c = this.R3(c, d, a, b, X[i+ 7], 16, 0xf6bb4b60);
			b = this.R3(b, c, d, a, X[i+10], 23, 0xbebfbc70);
			a = this.R3(a, b, c, d, X[i+13], 4 , 0x289b7ec6);
			d = this.R3(d, a, b, c, X[i+ 0], 11, 0xeaa127fa);
			c = this.R3(c, d, a, b, X[i+ 3], 16, 0xd4ef3085);
			b = this.R3(b, c, d, a, X[i+ 6], 23, 0x4881d05);
			a = this.R3(a, b, c, d, X[i+ 9], 4 , 0xd9d4d039);
			d = this.R3(d, a, b, c, X[i+12], 11, 0xe6db99e5);
			c = this.R3(c, d, a, b, X[i+15], 16, 0x1fa27cf8);
			b = this.R3(b, c, d, a, X[i+ 2], 23, 0xc4ac5665);
			
			a = this.R4(a, b, c, d, X[i+ 0], 6 , 0xf4292244);
			d = this.R4(d, a, b, c, X[i+ 7], 10, 0x432aff97);
			c = this.R4(c, d, a, b, X[i+14], 15, 0xab9423a7);
			b = this.R4(b, c, d, a, X[i+ 5], 21, 0xfc93a039);
			a = this.R4(a, b, c, d, X[i+12], 6 , 0x655b59c3);
			d = this.R4(d, a, b, c, X[i+ 3], 10, 0x8f0ccc92);
			c = this.R4(c, d, a, b, X[i+10], 15, 0xffeff47d);
			b = this.R4(b, c, d, a, X[i+ 1], 21, 0x85845dd1);
			a = this.R4(a, b, c, d, X[i+ 8], 6 , 0x6fa87e4f);
			d = this.R4(d, a, b, c, X[i+15], 10, 0xfe2ce6e0);
			c = this.R4(c, d, a, b, X[i+ 6], 15, 0xa3014314);
			b = this.R4(b, c, d, a, X[i+13], 21, 0x4e0811a1);
			a = this.R4(a, b, c, d, X[i+ 4], 6 , 0xf7537e82);
			d = this.R4(d, a, b, c, X[i+11], 10, 0xbd3af235);
			c = this.R4(c, d, a, b, X[i+ 2], 15, 0x2ad7d2bb);
			b = this.R4(b, c, d, a, X[i+ 9], 21, 0xeb86d391);
			
			a = this.add(a, aO);
			b = this.add(b, bO);
			c = this.add(c, cO);
			d = this.add(d, dO);
		}
		return this.hex(a) + this.hex(b) + this.hex(c) + this.hex(d);
	}
//--MD5Class End -------------------------------------------------------------------\\
}