235 lines
6.2 KiB
JavaScript
235 lines
6.2 KiB
JavaScript
// pile of hash encode/decode stuff
|
|
var Hashr = (function() {
|
|
var LZW = {
|
|
encode: function(s) {
|
|
var dict = {};
|
|
var data = (s + "").split("");
|
|
var out = [];
|
|
var currChar;
|
|
var phrase = data[0];
|
|
var code = 256;
|
|
for (var i=1; i<data.length; i++) {
|
|
currChar=data[i];
|
|
if (dict[phrase + currChar] != null) {
|
|
phrase += currChar;
|
|
} else {
|
|
out.push(phrase.length > 1 ? dict[phrase] : phrase.charCodeAt(0));
|
|
dict[phrase + currChar] = code;
|
|
code++;
|
|
phrase=currChar;
|
|
}
|
|
}
|
|
out.push(phrase.length > 1 ? dict[phrase] : phrase.charCodeAt(0));
|
|
for (var i=0; i<out.length; i++) {
|
|
out[i] = String.fromCharCode(out[i]);
|
|
}
|
|
return out.join("");
|
|
},
|
|
decode: function(s) {
|
|
var dict = {};
|
|
var data = (s + "").split("");
|
|
var currChar = data[0];
|
|
var oldPhrase = currChar;
|
|
var out = [currChar];
|
|
var code = 256;
|
|
var phrase;
|
|
for (var i=1; i<data.length; i++) {
|
|
var currCode = data[i].charCodeAt(0);
|
|
if (currCode < 256) {
|
|
phrase = data[i];
|
|
} else {
|
|
phrase = dict[currCode] ? dict[currCode] : (oldPhrase + currChar);
|
|
}
|
|
out.push(phrase);
|
|
currChar = phrase.charAt(0);
|
|
dict[code] = oldPhrase + currChar;
|
|
code++;
|
|
oldPhrase = phrase;
|
|
}
|
|
return out.join("");
|
|
}
|
|
};
|
|
|
|
var RLE = {
|
|
charmap: {
|
|
'-8': 'H',
|
|
'-7': 'G',
|
|
'-6': 'F',
|
|
'-5': 'E',
|
|
'-4': 'D',
|
|
'-3': 'C',
|
|
'-2': 'B',
|
|
'-1': 'A',
|
|
'0': 'a',
|
|
'1': 'b',
|
|
'2': 'c',
|
|
'3': 'd',
|
|
'4': 'e',
|
|
'5': 'f',
|
|
'6': 'g',
|
|
'7': 'h',
|
|
'8': 'i'
|
|
},
|
|
nummap: {
|
|
'H': '-8',
|
|
'G': '-7',
|
|
'F': '-6',
|
|
'E': '-5',
|
|
'D': '-4',
|
|
'C': '-3',
|
|
'B': '-2',
|
|
'A': '-1',
|
|
'a': '0',
|
|
'b': '1',
|
|
'c': '2',
|
|
'd': '3',
|
|
'e': '4',
|
|
'f': '5',
|
|
'g': '6',
|
|
'h': '7',
|
|
'i': '8'
|
|
},
|
|
encode: function(data) {
|
|
// 1. collect repeating numbers
|
|
var comp = '';
|
|
var i = 0;
|
|
var cur = data[i++];
|
|
var count = 1;
|
|
do {
|
|
if (data[i] == cur) {
|
|
count++;
|
|
} else {
|
|
comp += count.toString();
|
|
comp += RLE.charmap[cur];
|
|
if (data[i] == '-') {
|
|
cur = -data[++i];
|
|
} else {
|
|
cur = data[i];
|
|
}
|
|
count = 1;
|
|
}
|
|
} while (i++ < data.length);
|
|
return comp;
|
|
},
|
|
decode: function(data) {
|
|
var decomp = '';
|
|
var i = 0;
|
|
var numstr = data[i++];
|
|
do {
|
|
if (typeof RLE.nummap[data[i]] === 'undefined') {
|
|
numstr += data[i];
|
|
} else {
|
|
decomp += RLE.nummap[data[i]].repeat(parseInt(numstr));
|
|
numstr = '';
|
|
}
|
|
} while (i++ < data.length);
|
|
return decomp;
|
|
}
|
|
};
|
|
|
|
var Base64 = {
|
|
_keyStr: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=",
|
|
encode: function(input) {
|
|
var output = "";
|
|
var chr1, chr2, chr3, enc1, enc2, enc3, enc4;
|
|
var i = 0;
|
|
input = Base64._utf8_encode(input);
|
|
while (i < input.length) {
|
|
chr1 = input.charCodeAt(i++);
|
|
chr2 = input.charCodeAt(i++);
|
|
chr3 = input.charCodeAt(i++);
|
|
enc1 = chr1 >> 2;
|
|
enc2 = ((chr1 & 3) << 4) | (chr2 >> 4);
|
|
enc3 = ((chr2 & 15) << 2) | (chr3 >> 6);
|
|
enc4 = chr3 & 63;
|
|
if (isNaN(chr2)) {
|
|
enc3 = enc4 = 64;
|
|
} else if (isNaN(chr3)) {
|
|
enc4 = 64;
|
|
}
|
|
output = output + Base64._keyStr.charAt(enc1) + Base64._keyStr.charAt(enc2) + Base64._keyStr.charAt(enc3) + Base64._keyStr.charAt(enc4);
|
|
}
|
|
return output;
|
|
},
|
|
decode: function(input) {
|
|
var output = "";
|
|
var chr1, chr2, chr3;
|
|
var enc1, enc2, enc3, enc4;
|
|
var i = 0;
|
|
input = input.replace(/[^A-Za-z0-9\+\/\=]/g, "");
|
|
while (i < input.length) {
|
|
enc1 = Base64._keyStr.indexOf(input.charAt(i++));
|
|
enc2 = Base64._keyStr.indexOf(input.charAt(i++));
|
|
enc3 = Base64._keyStr.indexOf(input.charAt(i++));
|
|
enc4 = Base64._keyStr.indexOf(input.charAt(i++));
|
|
chr1 = (enc1 << 2) | (enc2 >> 4);
|
|
chr2 = ((enc2 & 15) << 4) | (enc3 >> 2);
|
|
chr3 = ((enc3 & 3) << 6) | enc4;
|
|
output = output + String.fromCharCode(chr1);
|
|
if (enc3 != 64) {
|
|
output = output + String.fromCharCode(chr2);
|
|
}
|
|
if (enc4 != 64) {
|
|
output = output + String.fromCharCode(chr3);
|
|
}
|
|
}
|
|
output = Base64._utf8_decode(output);
|
|
return output;
|
|
},
|
|
_utf8_encode: function(string) {
|
|
string = string.replace(/\r\n/g, "\n");
|
|
var utftext = "";
|
|
for (var n = 0; n < string.length; n++) {
|
|
var c = string.charCodeAt(n);
|
|
if (c < 128) {
|
|
utftext += String.fromCharCode(c);
|
|
} else if ((c > 127) && (c < 2048)) {
|
|
utftext += String.fromCharCode((c >> 6) | 192);
|
|
utftext += String.fromCharCode((c & 63) | 128);
|
|
} else {
|
|
utftext += String.fromCharCode((c >> 12) | 224);
|
|
utftext += String.fromCharCode(((c >> 6) & 63) | 128);
|
|
utftext += String.fromCharCode((c & 63) | 128);
|
|
}
|
|
}
|
|
return utftext;
|
|
},
|
|
|
|
_utf8_decode: function(utftext) {
|
|
var string = "";
|
|
var i = 0;
|
|
var c = c1 = c2 = 0;
|
|
|
|
while (i < utftext.length) {
|
|
c = utftext.charCodeAt(i);
|
|
if (c < 128) {
|
|
string += String.fromCharCode(c);
|
|
i++;
|
|
} else if ((c > 191) && (c < 224)) {
|
|
c2 = utftext.charCodeAt(i + 1);
|
|
string += String.fromCharCode(((c & 31) << 6) | (c2 & 63));
|
|
i += 2;
|
|
} else {
|
|
c2 = utftext.charCodeAt(i + 1);
|
|
c3 = utftext.charCodeAt(i + 2);
|
|
string += String.fromCharCode(((c & 15) << 12) | ((c2 & 63) << 6) | (c3 & 63));
|
|
i += 3;
|
|
}
|
|
}
|
|
return string;
|
|
}
|
|
};
|
|
return {
|
|
LZW: LZW,
|
|
RLE: RLE,
|
|
B64: Base64,
|
|
save: function(str) {
|
|
window.location.hash = Base64.encode(LZW.encode(str));
|
|
},
|
|
load: function(str) {
|
|
if (!str) str = window.location.hash.substring(1);
|
|
return LZW.decode(Base64.decode(str));
|
|
}
|
|
}
|
|
})();
|