65 lines
2.2 KiB
JavaScript
65 lines
2.2 KiB
JavaScript
/*# charCodeAt is the best approach for binary strings */
|
|
function crc32_bstr(bstr/*:string*/, seed/*:?CRC32Type*/)/*:CRC32Type*/ {
|
|
var C = seed/*:: ? 0 : 0 */ ^ -1, L = bstr.length - 1;
|
|
for(var i = 0; i < L;) {
|
|
C = (C>>>8) ^ T[(C^bstr.charCodeAt(i++))&0xFF];
|
|
C = (C>>>8) ^ T[(C^bstr.charCodeAt(i++))&0xFF];
|
|
}
|
|
if(i === L) C = (C>>>8) ^ T[(C ^ bstr.charCodeAt(i))&0xFF];
|
|
return C ^ -1;
|
|
}
|
|
|
|
function crc32_buf(buf/*:ABuf*/, seed/*:?CRC32Type*/)/*:CRC32Type*/ {
|
|
if(buf.length > 10000) return crc32_buf_8(buf, seed);
|
|
var C = seed/*:: ? 0 : 0 */ ^ -1, L = buf.length - 3;
|
|
for(var i = 0; i < L;) {
|
|
C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
|
|
C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
|
|
C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
|
|
C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
|
|
}
|
|
while(i < L+3) C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
|
|
return C ^ -1;
|
|
}
|
|
|
|
function crc32_buf_8(buf/*:ABuf*/, seed/*:?CRC32Type*/)/*:CRC32Type*/ {
|
|
var C = seed/*:: ? 0 : 0 */ ^ -1, L = buf.length - 7;
|
|
for(var i = 0; i < L;) {
|
|
C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
|
|
C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
|
|
C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
|
|
C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
|
|
C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
|
|
C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
|
|
C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
|
|
C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
|
|
}
|
|
while(i < L+7) C = (C>>>8) ^ T[(C^buf[i++])&0xFF];
|
|
return C ^ -1;
|
|
}
|
|
|
|
/*# much much faster to intertwine utf8 and crc */
|
|
function crc32_str(str/*:string*/, seed/*:?CRC32Type*/)/*:CRC32Type*/ {
|
|
var C = seed/*:: ? 0 : 0 */ ^ -1;
|
|
for(var i = 0, L=str.length, c, d; i < L;) {
|
|
c = str.charCodeAt(i++);
|
|
if(c < 0x80) {
|
|
C = (C>>>8) ^ T[(C ^ c)&0xFF];
|
|
} else if(c < 0x800) {
|
|
C = (C>>>8) ^ T[(C ^ (192|((c>>6)&31)))&0xFF];
|
|
C = (C>>>8) ^ T[(C ^ (128|(c&63)))&0xFF];
|
|
} else if(c >= 0xD800 && c < 0xE000) {
|
|
c = (c&1023)+64; d = str.charCodeAt(i++)&1023;
|
|
C = (C>>>8) ^ T[(C ^ (240|((c>>8)&7)))&0xFF];
|
|
C = (C>>>8) ^ T[(C ^ (128|((c>>2)&63)))&0xFF];
|
|
C = (C>>>8) ^ T[(C ^ (128|((d>>6)&15)|((c&3)<<4)))&0xFF];
|
|
C = (C>>>8) ^ T[(C ^ (128|(d&63)))&0xFF];
|
|
} else {
|
|
C = (C>>>8) ^ T[(C ^ (224|((c>>12)&15)))&0xFF];
|
|
C = (C>>>8) ^ T[(C ^ (128|((c>>6)&63)))&0xFF];
|
|
C = (C>>>8) ^ T[(C ^ (128|(c&63)))&0xFF];
|
|
}
|
|
}
|
|
return C ^ -1;
|
|
}
|