// toUTF8 - UTF-8 translation function Copyright 2009 David J. O'Farrell
// Released under GPLv3 License.
$chr = function (v){return String.fromCharCode(v);}
$toUTF8 = function (s){
	var ns = '';
	for (i = 0; i < s.length; i++) {
		var o = s.charCodeAt(i);
		var os = (i < s.length) ? s.charCodeAt(i+1) : 0;
		if (o<128) {
			// Encode 1-byte UTF-8 (ASCII) //
			ns += $chr(o);					// Single byte //
		} else if (o<2048) {
			// Encode 2-byte UTF-8 //
			ns += $chr(((o>>6)&31)|192);	// 1st byte //
			ns += $chr((o&63)|128);			// 2nd byte //
		} else if ((o&55296)==55296&&(os&56320)==56320) {
			// Decode 2-byte UTF-16 Surrogate Pair to unicode ordinal //
			o = ((o&10239)<<10|os&9215)+65536;
			// Encode 4-byte UTF-8 //
			ns += $chr(((o>>24)&63)|240);	// 1st byte //
			ns += $chr(((o>>12)&63)|128);	// 2nd byte //
			ns += $chr(((o>>6)&63)|128);	// 3rd byte //
			ns += $chr((o&63)|128);			// 4th byte //
			i++;
		} else {
			// Encode 3-byte UTF-8 //
			ns += $chr(((o>>12)&63)|224);	// 1st byte //
			ns += $chr(((o>>6)&63)|128);	// 2nd byte //
			ns += $chr((o&63)|128);			// 3rd byte //
		}
	}
	return ns;
}

$md5 = function(str){return md5_hex($toUTF8(str));}

// A JavaScript implementation of the RSA Data Security, Inc. MD5 Message Digest Algorithm, as defined in RFC 1321.
// Version 0.5 for Little Island client.
// Copyright (c) 2008 David O'Farrell
// http://littleisland.ruinsofmorning.net/
// Using original source Version 1.1 Copyright (C) Paul Johnston 1999 - 2002.
// http://littleisland.ruinsofmorning.net/source/
// Code also contributed by Greg Holt
// See http://pajhome.org.uk/site/legal.html for details.
// This section only: released under an MIT license.

md5_hex = function(str) {
	// Convert an 8-bit character string to a sequence of 16-word blocks, stored
	// as an array, and append appropriate padding for MD4/5 calculation.
	// If any of the characters are >255, the high byte is silently ignored //
	var nblk = ((str.length + 8) >> 6) + 1; // number of 16-word blocks
	var bin = new Array(nblk * 16);
	for(var i = 0; i < nblk * 16; i++) {bin[i] = 0;}
	for(var i = 0; i < str.length; i++) {bin[i>>2] |= (str.charCodeAt(i) & 0xFF) << ((i%4) * 8);}
	bin[i>>2] |= 0x80 << ((i%4) * 8);
	bin[nblk*16-2] = str.length * 8;
	
	// Calculate the MD5 of an array of little-endian words, producing an array of little-endian words//
	var a =  1732584193; var b = -271733879;
	var c = -1732584194; var d =  271733878;

	for(i = 0; i < bin.length; i += 16) {
		var olda = a;
		var oldb = b;
		var oldc = c;
		var oldd = d;

		a = ff(a, b, c, d, bin[i+ 0], 7 , -680876936);
		d = ff(d, a, b, c, bin[i+ 1], 12, -389564586);
		c = ff(c, d, a, b, bin[i+ 2], 17,  606105819);
		b = ff(b, c, d, a, bin[i+ 3], 22, -1044525330);
		a = ff(a, b, c, d, bin[i+ 4], 7 , -176418897);
		d = ff(d, a, b, c, bin[i+ 5], 12,  1200080426);
		c = ff(c, d, a, b, bin[i+ 6], 17, -1473231341);
		b = ff(b, c, d, a, bin[i+ 7], 22, -45705983);
		a = ff(a, b, c, d, bin[i+ 8], 7 ,  1770035416);
		d = ff(d, a, b, c, bin[i+ 9], 12, -1958414417);
		c = ff(c, d, a, b, bin[i+10], 17, -42063);
		b = ff(b, c, d, a, bin[i+11], 22, -1990404162);
		a = ff(a, b, c, d, bin[i+12], 7 ,  1804603682);
		d = ff(d, a, b, c, bin[i+13], 12, -40341101);
		c = ff(c, d, a, b, bin[i+14], 17, -1502002290);
		b = ff(b, c, d, a, bin[i+15], 22,  1236535329);

		a = gg(a, b, c, d, bin[i+ 1], 5 , -165796510);
		d = gg(d, a, b, c, bin[i+ 6], 9 , -1069501632);
		c = gg(c, d, a, b, bin[i+11], 14,  643717713);
		b = gg(b, c, d, a, bin[i+ 0], 20, -373897302);
		a = gg(a, b, c, d, bin[i+ 5], 5 , -701558691);
		d = gg(d, a, b, c, bin[i+10], 9 ,  38016083);
		c = gg(c, d, a, b, bin[i+15], 14, -660478335);
		b = gg(b, c, d, a, bin[i+ 4], 20, -405537848);
		a = gg(a, b, c, d, bin[i+ 9], 5 ,  568446438);
		d = gg(d, a, b, c, bin[i+14], 9 , -1019803690);
		c = gg(c, d, a, b, bin[i+ 3], 14, -187363961);
		b = gg(b, c, d, a, bin[i+ 8], 20,  1163531501);
		a = gg(a, b, c, d, bin[i+13], 5 , -1444681467);
		d = gg(d, a, b, c, bin[i+ 2], 9 , -51403784);
		c = gg(c, d, a, b, bin[i+ 7], 14,  1735328473);
		b = gg(b, c, d, a, bin[i+12], 20, -1926607734);

		a = hh(a, b, c, d, bin[i+ 5], 4 , -378558);
		d = hh(d, a, b, c, bin[i+ 8], 11, -2022574463);
		c = hh(c, d, a, b, bin[i+11], 16,  1839030562);
		b = hh(b, c, d, a, bin[i+14], 23, -35309556);
		a = hh(a, b, c, d, bin[i+ 1], 4 , -1530992060);
		d = hh(d, a, b, c, bin[i+ 4], 11,  1272893353);
		c = hh(c, d, a, b, bin[i+ 7], 16, -155497632);
		b = hh(b, c, d, a, bin[i+10], 23, -1094730640);
		a = hh(a, b, c, d, bin[i+13], 4 ,  681279174);
		d = hh(d, a, b, c, bin[i+ 0], 11, -358537222);
		c = hh(c, d, a, b, bin[i+ 3], 16, -722521979);
		b = hh(b, c, d, a, bin[i+ 6], 23,  76029189);
		a = hh(a, b, c, d, bin[i+ 9], 4 , -640364487);
		d = hh(d, a, b, c, bin[i+12], 11, -421815835);
		c = hh(c, d, a, b, bin[i+15], 16,  530742520);
		b = hh(b, c, d, a, bin[i+ 2], 23, -995338651);

		a = ii(a, b, c, d, bin[i+ 0], 6 , -198630844);
		d = ii(d, a, b, c, bin[i+ 7], 10,  1126891415);
		c = ii(c, d, a, b, bin[i+14], 15, -1416354905);
		b = ii(b, c, d, a, bin[i+ 5], 21, -57434055);
		a = ii(a, b, c, d, bin[i+12], 6 ,  1700485571);
		d = ii(d, a, b, c, bin[i+ 3], 10, -1894986606);
		c = ii(c, d, a, b, bin[i+10], 15, -1051523);
		b = ii(b, c, d, a, bin[i+ 1], 21, -2054922799);
		a = ii(a, b, c, d, bin[i+ 8], 6 ,  1873313359);
		d = ii(d, a, b, c, bin[i+15], 10, -30611744);
		c = ii(c, d, a, b, bin[i+ 6], 15, -1560198380);
		b = ii(b, c, d, a, bin[i+13], 21,  1309151649);
		a = ii(a, b, c, d, bin[i+ 4], 6 , -145523070);
		d = ii(d, a, b, c, bin[i+11], 10, -1120210379);
		c = ii(c, d, a, b, bin[i+ 2], 15,  718787259);
		b = ii(b, c, d, a, bin[i+ 9], 21, -343485551);

		a = safe_add(a, olda);
		b = safe_add(b, oldb);
		c = safe_add(c, oldc);
		d = safe_add(d, oldd);
	}
	newbin = [a, b, c, d];
	
	// Convert an array of little-endian words to a hex string //
	var hex_tab = "0123456789abcdef";
	var hexstr = "";
	for(var i = 0; i < newbin.length * 4; i++) {
		hexstr += hex_tab.charAt((newbin[i>>2] >> ((i%4)*8+4)) & 0xF);
		hexstr += hex_tab.charAt((newbin[i>>2] >> ((i%4)*8)) & 0xF);
	}
	
	// Finish //
	return hexstr;
	
	// Functions //
	
	// 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 rol(num,cnt) {return (num << cnt) | (num >>> (32 - cnt))}
	// These functions implement the four basic operations the algorithm uses //
	function cmn(q, a, b, x, s, t) {return safe_add(rol(safe_add(safe_add(a, q), safe_add(x, t)), s), b)}
	function ff(a, b, c, d, x, s, t) {return cmn((b & c) | ((~b) & d), a, b, x, s, t)}
	function gg(a, b, c, d, x, s, t) {return cmn((b & d) | (c & (~d)), a, b, x, s, t)}
	function hh(a, b, c, d, x, s, t) {return cmn(b ^ c ^ d, a, b, x, s, t)}
	function ii(a, b, c, d, x, s, t) {return cmn(c ^ (b | (~d)), a, b, x, s, t)}
}