naive-upload
Version:
<p align="left"> <a href="https://www.npmjs.org/package/naive-upload"> <img src="https://img.shields.io/npm/v/naive-upload.svg"> </a> <a href="https://bundlephobia.com/package/naive-upload@latest"> <img src="https://img.shields.io/bundl
171 lines (170 loc) • 12.2 kB
JavaScript
const C = () => {
let c = ["0", "1", "2", "3", "4", "5", "6", "7", "8", "9", "a", "b", "c", "d", "e", "f"];
function s(i, f) {
let e = i[0], t = i[1], n = i[2], r = i[3];
e += (t & n | ~t & r) + f[0] - 680876936 | 0, e = (e << 7 | e >>> 25) + t | 0, r += (e & t | ~e & n) + f[1] - 389564586 | 0, r = (r << 12 | r >>> 20) + e | 0, n += (r & e | ~r & t) + f[2] + 606105819 | 0, n = (n << 17 | n >>> 15) + r | 0, t += (n & r | ~n & e) + f[3] - 1044525330 | 0, t = (t << 22 | t >>> 10) + n | 0, e += (t & n | ~t & r) + f[4] - 176418897 | 0, e = (e << 7 | e >>> 25) + t | 0, r += (e & t | ~e & n) + f[5] + 1200080426 | 0, r = (r << 12 | r >>> 20) + e | 0, n += (r & e | ~r & t) + f[6] - 1473231341 | 0, n = (n << 17 | n >>> 15) + r | 0, t += (n & r | ~n & e) + f[7] - 45705983 | 0, t = (t << 22 | t >>> 10) + n | 0, e += (t & n | ~t & r) + f[8] + 1770035416 | 0, e = (e << 7 | e >>> 25) + t | 0, r += (e & t | ~e & n) + f[9] - 1958414417 | 0, r = (r << 12 | r >>> 20) + e | 0, n += (r & e | ~r & t) + f[10] - 42063 | 0, n = (n << 17 | n >>> 15) + r | 0, t += (n & r | ~n & e) + f[11] - 1990404162 | 0, t = (t << 22 | t >>> 10) + n | 0, e += (t & n | ~t & r) + f[12] + 1804603682 | 0, e = (e << 7 | e >>> 25) + t | 0, r += (e & t | ~e & n) + f[13] - 40341101 | 0, r = (r << 12 | r >>> 20) + e | 0, n += (r & e | ~r & t) + f[14] - 1502002290 | 0, n = (n << 17 | n >>> 15) + r | 0, t += (n & r | ~n & e) + f[15] + 1236535329 | 0, t = (t << 22 | t >>> 10) + n | 0, e += (t & r | n & ~r) + f[1] - 165796510 | 0, e = (e << 5 | e >>> 27) + t | 0, r += (e & n | t & ~n) + f[6] - 1069501632 | 0, r = (r << 9 | r >>> 23) + e | 0, n += (r & t | e & ~t) + f[11] + 643717713 | 0, n = (n << 14 | n >>> 18) + r | 0, t += (n & e | r & ~e) + f[0] - 373897302 | 0, t = (t << 20 | t >>> 12) + n | 0, e += (t & r | n & ~r) + f[5] - 701558691 | 0, e = (e << 5 | e >>> 27) + t | 0, r += (e & n | t & ~n) + f[10] + 38016083 | 0, r = (r << 9 | r >>> 23) + e | 0, n += (r & t | e & ~t) + f[15] - 660478335 | 0, n = (n << 14 | n >>> 18) + r | 0, t += (n & e | r & ~e) + f[4] - 405537848 | 0, t = (t << 20 | t >>> 12) + n | 0, e += (t & r | n & ~r) + f[9] + 568446438 | 0, e = (e << 5 | e >>> 27) + t | 0, r += (e & n | t & ~n) + f[14] - 1019803690 | 0, r = (r << 9 | r >>> 23) + e | 0, n += (r & t | e & ~t) + f[3] - 187363961 | 0, n = (n << 14 | n >>> 18) + r | 0, t += (n & e | r & ~e) + f[8] + 1163531501 | 0, t = (t << 20 | t >>> 12) + n | 0, e += (t & r | n & ~r) + f[13] - 1444681467 | 0, e = (e << 5 | e >>> 27) + t | 0, r += (e & n | t & ~n) + f[2] - 51403784 | 0, r = (r << 9 | r >>> 23) + e | 0, n += (r & t | e & ~t) + f[7] + 1735328473 | 0, n = (n << 14 | n >>> 18) + r | 0, t += (n & e | r & ~e) + f[12] - 1926607734 | 0, t = (t << 20 | t >>> 12) + n | 0, e += (t ^ n ^ r) + f[5] - 378558 | 0, e = (e << 4 | e >>> 28) + t | 0, r += (e ^ t ^ n) + f[8] - 2022574463 | 0, r = (r << 11 | r >>> 21) + e | 0, n += (r ^ e ^ t) + f[11] + 1839030562 | 0, n = (n << 16 | n >>> 16) + r | 0, t += (n ^ r ^ e) + f[14] - 35309556 | 0, t = (t << 23 | t >>> 9) + n | 0, e += (t ^ n ^ r) + f[1] - 1530992060 | 0, e = (e << 4 | e >>> 28) + t | 0, r += (e ^ t ^ n) + f[4] + 1272893353 | 0, r = (r << 11 | r >>> 21) + e | 0, n += (r ^ e ^ t) + f[7] - 155497632 | 0, n = (n << 16 | n >>> 16) + r | 0, t += (n ^ r ^ e) + f[10] - 1094730640 | 0, t = (t << 23 | t >>> 9) + n | 0, e += (t ^ n ^ r) + f[13] + 681279174 | 0, e = (e << 4 | e >>> 28) + t | 0, r += (e ^ t ^ n) + f[0] - 358537222 | 0, r = (r << 11 | r >>> 21) + e | 0, n += (r ^ e ^ t) + f[3] - 722521979 | 0, n = (n << 16 | n >>> 16) + r | 0, t += (n ^ r ^ e) + f[6] + 76029189 | 0, t = (t << 23 | t >>> 9) + n | 0, e += (t ^ n ^ r) + f[9] - 640364487 | 0, e = (e << 4 | e >>> 28) + t | 0, r += (e ^ t ^ n) + f[12] - 421815835 | 0, r = (r << 11 | r >>> 21) + e | 0, n += (r ^ e ^ t) + f[15] + 530742520 | 0, n = (n << 16 | n >>> 16) + r | 0, t += (n ^ r ^ e) + f[2] - 995338651 | 0, t = (t << 23 | t >>> 9) + n | 0, e += (n ^ (t | ~r)) + f[0] - 198630844 | 0, e = (e << 6 | e >>> 26) + t | 0, r += (t ^ (e | ~n)) + f[7] + 1126891415 | 0, r = (r << 10 | r >>> 22) + e | 0, n += (e ^ (r | ~t)) + f[14] - 1416354905 | 0, n = (n << 15 | n >>> 17) + r | 0, t += (r ^ (n | ~e)) + f[5] - 57434055 | 0, t = (t << 21 | t >>> 11) + n | 0, e += (n ^ (t | ~r)) + f[12] + 1700485571 | 0, e = (e << 6 | e >>> 26) + t | 0, r += (t ^ (e | ~n)) + f[3] - 1894986606 | 0, r = (r << 10 | r >>> 22) + e | 0, n += (e ^ (r | ~t)) + f[10] - 1051523 | 0, n = (n << 15 | n >>> 17) + r | 0, t += (r ^ (n | ~e)) + f[1] - 2054922799 | 0, t = (t << 21 | t >>> 11) + n | 0, e += (n ^ (t | ~r)) + f[8] + 1873313359 | 0, e = (e << 6 | e >>> 26) + t | 0, r += (t ^ (e | ~n)) + f[15] - 30611744 | 0, r = (r << 10 | r >>> 22) + e | 0, n += (e ^ (r | ~t)) + f[6] - 1560198380 | 0, n = (n << 15 | n >>> 17) + r | 0, t += (r ^ (n | ~e)) + f[13] + 1309151649 | 0, t = (t << 21 | t >>> 11) + n | 0, e += (n ^ (t | ~r)) + f[4] - 145523070 | 0, e = (e << 6 | e >>> 26) + t | 0, r += (t ^ (e | ~n)) + f[11] - 1120210379 | 0, r = (r << 10 | r >>> 22) + e | 0, n += (e ^ (r | ~t)) + f[2] + 718787259 | 0, n = (n << 15 | n >>> 17) + r | 0, t += (r ^ (n | ~e)) + f[9] - 343485551 | 0, t = (t << 21 | t >>> 11) + n | 0, i[0] = e + i[0] | 0, i[1] = t + i[1] | 0, i[2] = n + i[2] | 0, i[3] = r + i[3] | 0;
}
function g(i) {
let f = [], e;
for (e = 0; e < 64; e += 4)
f[e >> 2] = i.charCodeAt(e) + (i.charCodeAt(e + 1) << 8) + (i.charCodeAt(e + 2) << 16) + (i.charCodeAt(e + 3) << 24);
return f;
}
function b(i) {
let f = [], e;
for (e = 0; e < 64; e += 4)
f[e >> 2] = i[e] + (i[e + 1] << 8) + (i[e + 2] << 16) + (i[e + 3] << 24);
return f;
}
function _(i) {
let f = i.length, e = [1732584193, -271733879, -1732584194, 271733878], t, n, r, o, u, a;
for (t = 64; t <= f; t += 64)
s(e, g(i.substring(t - 64, t)));
for (i = i.substring(t - 64), n = i.length, r = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], t = 0; t < n; t += 1)
r[t >> 2] |= i.charCodeAt(t) << (t % 4 << 3);
if (r[t >> 2] |= 128 << (t % 4 << 3), t > 55)
for (s(e, r), t = 0; t < 16; t += 1)
r[t] = 0;
return o = f * 8, o = o.toString(16).match(/(.*?)(.{0,8})$/), u = parseInt(o[2], 16), a = parseInt(o[1], 16) || 0, r[14] = u, r[15] = a, s(e, r), e;
}
function S(i) {
let f = i.length, e = [1732584193, -271733879, -1732584194, 271733878], t, n, r, o, u, a;
for (t = 64; t <= f; t += 64)
s(e, b(i.subarray(t - 64, t)));
for (i = t - 64 < f ? i.subarray(t - 64) : new Uint8Array(0), n = i.length, r = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], t = 0; t < n; t += 1)
r[t >> 2] |= i[t] << (t % 4 << 3);
if (r[t >> 2] |= 128 << (t % 4 << 3), t > 55)
for (s(e, r), t = 0; t < 16; t += 1)
r[t] = 0;
return o = f * 8, o = o.toString(16).match(/(.*?)(.{0,8})$/), u = parseInt(o[2], 16), a = parseInt(o[1], 16) || 0, r[14] = u, r[15] = a, s(e, r), e;
}
function B(i) {
let f = "", e;
for (e = 0; e < 4; e += 1)
f += c[i >> e * 8 + 4 & 15] + c[i >> e * 8 & 15];
return f;
}
function p(i) {
let f;
for (f = 0; f < i.length; f += 1)
i[f] = B(i[f]);
return i.join("");
}
p(_("hello")), typeof ArrayBuffer < "u" && !ArrayBuffer.prototype.slice && function() {
function i(f, e) {
return f = f | 0 || 0, f < 0 ? Math.max(f + e, 0) : Math.min(f, e);
}
ArrayBuffer.prototype.slice = function(f, e) {
let t = this.byteLength, n = i(f, t), r = t, o, u, a, A;
return e !== void 0 && (r = i(e, t)), n > r ? new ArrayBuffer(0) : (o = r - n, u = new ArrayBuffer(o), a = new Uint8Array(u), A = new Uint8Array(this, n, o), a.set(A), u);
};
}();
function d(i) {
return /[\u0080-\uFFFF]/.test(i) && (i = unescape(encodeURIComponent(i))), i;
}
function m(i, f) {
let e = i.length, t = new ArrayBuffer(e), n = new Uint8Array(t), r;
for (r = 0; r < e; r += 1)
n[r] = i.charCodeAt(r);
return f ? n : t;
}
function w(i) {
return String.fromCharCode.apply(null, new Uint8Array(i));
}
function U(i, f, e) {
let t = new Uint8Array(i.byteLength + f.byteLength);
return t.set(new Uint8Array(i)), t.set(new Uint8Array(f), i.byteLength), e ? t : t.buffer;
}
function y(i) {
let f = [], e = i.length, t;
for (t = 0; t < e - 1; t += 2)
f.push(parseInt(i.substr(t, 2), 16));
return String.fromCharCode.apply(String, f);
}
function h() {
this.reset();
}
h.prototype.append = function(i) {
return this.appendBinary(d(i)), this;
}, h.prototype.appendBinary = function(i) {
this._buff += i, this._length += i.length;
let f = this._buff.length, e;
for (e = 64; e <= f; e += 64)
s(this._hash, g(this._buff.substring(e - 64, e)));
return this._buff = this._buff.substring(e - 64), this;
}, h.prototype.end = function(i) {
let f = this._buff, e = f.length, t, n = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], r;
for (t = 0; t < e; t += 1)
n[t >> 2] |= f.charCodeAt(t) << (t % 4 << 3);
return this._finish(n, e), r = p(this._hash), i && (r = y(r)), this.reset(), r;
}, h.prototype.reset = function() {
return this._buff = "", this._length = 0, this._hash = [1732584193, -271733879, -1732584194, 271733878], this;
}, h.prototype.getState = function() {
return { buff: this._buff, length: this._length, hash: this._hash.slice() };
}, h.prototype.setState = function(i) {
return this._buff = i.buff, this._length = i.length, this._hash = i.hash, this;
}, h.prototype.destroy = function() {
delete this._hash, delete this._buff, delete this._length;
}, h.prototype._finish = function(i, f) {
let e = f, t, n, r;
if (i[e >> 2] |= 128 << (e % 4 << 3), e > 55)
for (s(this._hash, i), e = 0; e < 16; e += 1)
i[e] = 0;
t = this._length * 8, t = t.toString(16).match(/(.*?)(.{0,8})$/), n = parseInt(t[2], 16), r = parseInt(t[1], 16) || 0, i[14] = n, i[15] = r, s(this._hash, i);
}, h.hash = function(i, f) {
return h.hashBinary(d(i), f);
}, h.hashBinary = function(i, f) {
let e = _(i), t = p(e);
return f ? y(t) : t;
}, h.ArrayBuffer = function() {
this.reset();
}, h.ArrayBuffer.prototype.append = function(i) {
let f = U(this._buff.buffer, i, !0), e = f.length, t;
for (this._length += i.byteLength, t = 64; t <= e; t += 64)
s(this._hash, b(f.subarray(t - 64, t)));
return this._buff = t - 64 < e ? new Uint8Array(f.buffer.slice(t - 64)) : new Uint8Array(0), this;
}, h.ArrayBuffer.prototype.end = function(i) {
let f = this._buff, e = f.length, t = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], n, r;
for (n = 0; n < e; n += 1)
t[n >> 2] |= f[n] << (n % 4 << 3);
return this._finish(t, e), r = p(this._hash), i && (r = y(r)), this.reset(), r;
}, h.ArrayBuffer.prototype.reset = function() {
return this._buff = new Uint8Array(0), this._length = 0, this._hash = [1732584193, -271733879, -1732584194, 271733878], this;
}, h.ArrayBuffer.prototype.getState = function() {
let i = h.prototype.getState.call(this);
return i.buff = w(i.buff), i;
}, h.ArrayBuffer.prototype.setState = function(i) {
return i.buff = m(i.buff, !0), h.prototype.setState.call(this, i);
}, h.ArrayBuffer.prototype.destroy = h.prototype.destroy, h.ArrayBuffer.prototype._finish = h.prototype._finish, h.ArrayBuffer.hash = function(i, f) {
let e = S(new Uint8Array(i)), t = p(e);
return f ? y(t) : t;
};
const l = new h.ArrayBuffer();
onmessage = (i) => {
switch (i.data.type) {
case "DOWN_APPEND_DATA":
const f = i.data.data;
l.append(f);
break;
case "DOWN_GET_RESULT":
postMessage(JSON.parse(JSON.stringify({
type: "UP_RESULT",
data: l.end(!1)
})));
return;
case "DOWN_RESET":
l.reset();
break;
case "DOWN_CLOSE":
close();
break;
}
postMessage(JSON.parse(JSON.stringify({
type: "UP_ACK"
})));
};
}, N = new Blob([`(${C.toString()})()`]);
export {
N as HashWorkerScript
};
//# sourceMappingURL=HashWorkerScript.js.map