2016-05-29 23:13:34 +00:00
|
|
|
/*# consult README.md for the magic number */
|
|
|
|
/*# charCodeAt is the best approach for binary strings */
|
2016-10-13 01:23:45 +00:00
|
|
|
function adler32_bstr(bstr/*:string*/, seed/*:?ADLER32Type*/)/*:ADLER32Type*/ {
|
2016-05-29 23:13:34 +00:00
|
|
|
var a = 1, b = 0, L = bstr.length, M = 0;
|
2016-10-13 01:23:45 +00:00
|
|
|
if(typeof seed === 'number') { a = seed & 0xFFFF; b = seed >>> 16; }
|
2014-06-18 17:58:20 +00:00
|
|
|
for(var i = 0; i < L;) {
|
2014-06-20 03:53:37 +00:00
|
|
|
M = Math.min(L-i, 3850)+i;
|
|
|
|
for(;i<M;i++) {
|
2016-10-13 01:23:45 +00:00
|
|
|
a += bstr.charCodeAt(i)&0xFF;
|
2014-06-18 17:58:20 +00:00
|
|
|
b += a;
|
|
|
|
}
|
2016-01-16 05:36:58 +00:00
|
|
|
a = (15*(a>>>16)+(a&65535));
|
|
|
|
b = (15*(b>>>16)+(b&65535));
|
2014-06-18 17:58:20 +00:00
|
|
|
}
|
2014-06-20 03:53:37 +00:00
|
|
|
return ((b%65521) << 16) | (a%65521);
|
2014-06-18 17:58:20 +00:00
|
|
|
}
|
|
|
|
|
2016-10-13 01:23:45 +00:00
|
|
|
function adler32_buf(buf/*:ABuf*/, seed/*:?ADLER32Type*/)/*:ADLER32Type*/ {
|
2016-05-29 23:13:34 +00:00
|
|
|
var a = 1, b = 0, L = buf.length, M = 0;
|
2016-10-13 01:23:45 +00:00
|
|
|
if(typeof seed === 'number') { a = seed & 0xFFFF; b = (seed >>> 16) & 0xFFFF; }
|
2014-06-18 17:58:20 +00:00
|
|
|
for(var i = 0; i < L;) {
|
2014-06-20 03:53:37 +00:00
|
|
|
M = Math.min(L-i, 3850)+i;
|
|
|
|
for(;i<M;i++) {
|
2016-10-13 01:23:45 +00:00
|
|
|
a += buf[i]&0xFF;
|
2014-06-18 17:58:20 +00:00
|
|
|
b += a;
|
|
|
|
}
|
2016-01-16 05:36:58 +00:00
|
|
|
a = (15*(a>>>16)+(a&65535));
|
|
|
|
b = (15*(b>>>16)+(b&65535));
|
2014-06-18 17:58:20 +00:00
|
|
|
}
|
2014-06-20 03:53:37 +00:00
|
|
|
return ((b%65521) << 16) | (a%65521);
|
2014-06-18 17:58:20 +00:00
|
|
|
}
|
|
|
|
|
2016-05-29 23:13:34 +00:00
|
|
|
/*# much much faster to intertwine utf8 and adler */
|
2016-10-13 01:23:45 +00:00
|
|
|
function adler32_str(str/*:string*/, seed/*:?ADLER32Type*/)/*:ADLER32Type*/ {
|
2016-05-29 23:13:34 +00:00
|
|
|
var a = 1, b = 0, L = str.length, M = 0, c = 0, d = 0;
|
2016-10-13 01:23:45 +00:00
|
|
|
if(typeof seed === 'number') { a = seed & 0xFFFF; b = seed >>> 16; }
|
2014-06-18 17:58:20 +00:00
|
|
|
for(var i = 0; i < L;) {
|
|
|
|
M = Math.min(L-i, 3850);
|
|
|
|
while(M>0) {
|
|
|
|
c = str.charCodeAt(i++);
|
2016-05-29 23:13:34 +00:00
|
|
|
if(c < 0x80) { a += c; }
|
2014-06-18 17:58:20 +00:00
|
|
|
else if(c < 0x800) {
|
2016-01-16 05:36:58 +00:00
|
|
|
a += 192|((c>>6)&31); b += a; --M;
|
2016-05-29 23:13:34 +00:00
|
|
|
a += 128|(c&63);
|
2014-06-18 17:58:20 +00:00
|
|
|
} else if(c >= 0xD800 && c < 0xE000) {
|
|
|
|
c = (c&1023)+64; d = str.charCodeAt(i++) & 1023;
|
2016-01-16 05:36:58 +00:00
|
|
|
a += 240|((c>>8)&7); b += a; --M;
|
|
|
|
a += 128|((c>>2)&63); b += a; --M;
|
|
|
|
a += 128|((d>>6)&15)|((c&3)<<4); b += a; --M;
|
2016-05-29 23:13:34 +00:00
|
|
|
a += 128|(d&63);
|
2014-06-18 17:58:20 +00:00
|
|
|
} else {
|
2016-01-16 05:36:58 +00:00
|
|
|
a += 224|((c>>12)&15); b += a; --M;
|
|
|
|
a += 128|((c>>6)&63); b += a; --M;
|
2016-05-29 23:13:34 +00:00
|
|
|
a += 128|(c&63);
|
2014-06-18 17:58:20 +00:00
|
|
|
}
|
2016-05-29 23:13:34 +00:00
|
|
|
b += a; --M;
|
2014-06-18 17:58:20 +00:00
|
|
|
}
|
2016-05-29 23:13:34 +00:00
|
|
|
a = (15*(a>>>16)+(a&65535));
|
|
|
|
b = (15*(b>>>16)+(b&65535));
|
2014-06-18 17:58:20 +00:00
|
|
|
}
|
2016-10-13 01:23:45 +00:00
|
|
|
return ((b%65521) << 16) | (a%65521);
|
2014-06-18 17:58:20 +00:00
|
|
|
}
|