- 拆分:tools/split.js 重切新版(1347 模块 / 126 代码模块),主文件 main.7cfa4058.js,语法验证通过 - 修复 split.js 内自动刷新拦截的 \\n 转义:它在模板字符串里,必须写 \\\\n,否则生成的主文件字符串断行、语法报错 - 符号映射:map_symbols.js 对齐旧→新(qyr→ryz、w187→c18o、z4t→jtn、vgt→rkt、Bmt→Ezt、Qjt→Fjt、txt→Gjt、k15b→s15n、azi_1→vzr_1…) - 移植 7 处针对性修改:炮塔摆头不回弹(vSt.ryz)、摆头不过冲(case 0)、精准跟手(case 1/2)、悬浮底盘 raw 两级(Ezt.n36 + Zmt 实际速度)、电磁炮蓄力时长(jtn.c18o) - 重新打包 unpacked.pack.json(127 文件 / 版本 96833eb2b0cf8909)
1986 lines
57 KiB
JavaScript
1986 lines
57 KiB
JavaScript
// ============================================================
|
|
// Module ID: 29518
|
|
// ============================================================
|
|
;(window.__modules__ = window.__modules__ || {})[29518] = (t, n, i) => {
|
|
"use strict";
|
|
var r = i(57328),
|
|
e = Uint8Array,
|
|
u = Uint16Array,
|
|
s = Int32Array,
|
|
o = new e([
|
|
0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, 0, 0, 0,
|
|
]),
|
|
_ = new e([
|
|
0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 0, 0,
|
|
]),
|
|
a = new e([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]),
|
|
h = function (t, n) {
|
|
for (var i = new u(31), r = 0; r < 31; ++r) i[r] = n += 1 << t[r - 1];
|
|
var e = new s(i[30]);
|
|
for (r = 1; r < 30; ++r) for (var o = i[r]; o < i[r + 1]; ++o) e[o] = ((o - i[r]) << 5) | r;
|
|
return { b: i, r: e };
|
|
},
|
|
c = h(o, 2),
|
|
l = c.b,
|
|
f = c.r;
|
|
((l[28] = 258), (f[258] = 28));
|
|
for (var v = h(_, 0), w = v.b, p = v.r, d = new u(32768), g = 0; g < 32768; ++g) {
|
|
var m = ((43690 & g) >> 1) | ((21845 & g) << 1);
|
|
((m = ((61680 & (m = ((52428 & m) >> 2) | ((13107 & m) << 2))) >> 4) | ((3855 & m) << 4)),
|
|
(d[g] = (((65280 & m) >> 8) | ((255 & m) << 8)) >> 1));
|
|
}
|
|
var y = function (t, n, i) {
|
|
for (var r = t.length, e = 0, s = new u(n); e < r; ++e) t[e] && ++s[t[e] - 1];
|
|
var o,
|
|
_ = new u(n);
|
|
for (e = 1; e < n; ++e) _[e] = (_[e - 1] + s[e - 1]) << 1;
|
|
if (i) {
|
|
o = new u(1 << n);
|
|
var a = 15 - n;
|
|
for (e = 0; e < r; ++e)
|
|
if (t[e])
|
|
for (
|
|
var h = (e << 4) | t[e], c = n - t[e], l = _[t[e] - 1]++ << c, f = l | ((1 << c) - 1);
|
|
l <= f;
|
|
++l
|
|
)
|
|
o[d[l] >> a] = h;
|
|
} else for (o = new u(r), e = 0; e < r; ++e) t[e] && (o[e] = d[_[t[e] - 1]++] >> (15 - t[e]));
|
|
return o;
|
|
},
|
|
k = new e(288);
|
|
for (g = 0; g < 144; ++g) k[g] = 8;
|
|
for (g = 144; g < 256; ++g) k[g] = 9;
|
|
for (g = 256; g < 280; ++g) k[g] = 7;
|
|
for (g = 280; g < 288; ++g) k[g] = 8;
|
|
var b = new e(32);
|
|
for (g = 0; g < 32; ++g) b[g] = 5;
|
|
var q = y(k, 9, 0),
|
|
$ = y(k, 9, 1),
|
|
j = y(b, 5, 0),
|
|
x = y(b, 5, 1),
|
|
z = function (t) {
|
|
for (var n = t[0], i = 1; i < t.length; ++i) t[i] > n && (n = t[i]);
|
|
return n;
|
|
},
|
|
S = function (t, n, i) {
|
|
var r = (n / 8) | 0;
|
|
return ((t[r] | (t[r + 1] << 8)) >> (7 & n)) & i;
|
|
},
|
|
C = function (t, n) {
|
|
var i = (n / 8) | 0;
|
|
return (t[i] | (t[i + 1] << 8) | (t[i + 2] << 16)) >> (7 & n);
|
|
},
|
|
E = function (t) {
|
|
return ((t + 7) / 8) | 0;
|
|
},
|
|
T = function (t, n, i) {
|
|
((null == n || n < 0) && (n = 0), (null == i || i > t.length) && (i = t.length));
|
|
var r = new e(i - n);
|
|
return (r.set(t.subarray(n, i)), r);
|
|
};
|
|
n.FlateErrorCode = {
|
|
UnexpectedEOF: 0,
|
|
InvalidBlockType: 1,
|
|
InvalidLengthLiteral: 2,
|
|
InvalidDistance: 3,
|
|
StreamFinished: 4,
|
|
NoStreamHandler: 5,
|
|
InvalidHeader: 6,
|
|
NoCallback: 7,
|
|
InvalidUTF8: 8,
|
|
ExtraFieldTooLong: 9,
|
|
InvalidDate: 10,
|
|
FilenameTooLong: 11,
|
|
StreamFinishing: 12,
|
|
InvalidZipData: 13,
|
|
UnknownCompressionMethod: 14,
|
|
};
|
|
var I = [
|
|
"unexpected EOF",
|
|
"invalid block type",
|
|
"invalid length/literal",
|
|
"invalid distance",
|
|
"stream finished",
|
|
"no stream handler",
|
|
,
|
|
"no callback",
|
|
"invalid UTF-8 data",
|
|
"extra field too long",
|
|
"date not in range 1980-2099",
|
|
"filename too long",
|
|
"stream finishing",
|
|
"invalid zip data",
|
|
],
|
|
A = function (t, n, i) {
|
|
var r = new Error(n || I[t]);
|
|
if (((r.code = t), Error.captureStackTrace && Error.captureStackTrace(r, A), !i)) throw r;
|
|
return r;
|
|
},
|
|
R = function (t, n, i, r) {
|
|
var u = t.length,
|
|
s = r ? r.length : 0;
|
|
if (!u || (n.f && !n.l)) return i || new e(0);
|
|
var h = !i || 2 != n.i,
|
|
c = n.i;
|
|
i || (i = new e(3 * u));
|
|
var f = function (t) {
|
|
var n = i.length;
|
|
if (t > n) {
|
|
var r = new e(Math.max(2 * n, t));
|
|
(r.set(i), (i = r));
|
|
}
|
|
},
|
|
v = n.f || 0,
|
|
p = n.p || 0,
|
|
d = n.b || 0,
|
|
g = n.l,
|
|
m = n.d,
|
|
k = n.m,
|
|
b = n.n,
|
|
q = 8 * u;
|
|
do {
|
|
if (!g) {
|
|
v = S(t, p, 1);
|
|
var j = S(t, p + 1, 3);
|
|
if (((p += 3), !j)) {
|
|
var I = t[(G = E(p) + 4) - 4] | (t[G - 3] << 8),
|
|
R = G + I;
|
|
if (R > u) {
|
|
c && A(0);
|
|
break;
|
|
}
|
|
(h && f(d + I), i.set(t.subarray(G, R), d), (n.b = d += I), (n.p = p = 8 * R), (n.f = v));
|
|
continue;
|
|
}
|
|
if (1 == j) ((g = $), (m = x), (k = 9), (b = 5));
|
|
else if (2 == j) {
|
|
var P = S(t, p, 31) + 257,
|
|
N = S(t, p + 10, 15) + 4,
|
|
O = P + S(t, p + 5, 31) + 1;
|
|
p += 14;
|
|
for (var M = new e(O), D = new e(19), L = 0; L < N; ++L) D[a[L]] = S(t, p + 3 * L, 7);
|
|
p += 3 * N;
|
|
var B = z(D),
|
|
U = (1 << B) - 1,
|
|
F = y(D, B, 1);
|
|
for (L = 0; L < O;) {
|
|
var G,
|
|
H = F[S(t, p, U)];
|
|
if (((p += 15 & H), (G = H >> 4) < 16)) M[L++] = G;
|
|
else {
|
|
var W = 0,
|
|
V = 0;
|
|
for (
|
|
16 == G
|
|
? ((V = 3 + S(t, p, 3)), (p += 2), (W = M[L - 1]))
|
|
: 17 == G
|
|
? ((V = 3 + S(t, p, 7)), (p += 3))
|
|
: 18 == G && ((V = 11 + S(t, p, 127)), (p += 7));
|
|
V--;
|
|
)
|
|
M[L++] = W;
|
|
}
|
|
}
|
|
var K = M.subarray(0, P),
|
|
Y = M.subarray(P);
|
|
((k = z(K)), (b = z(Y)), (g = y(K, k, 1)), (m = y(Y, b, 1)));
|
|
} else A(1);
|
|
if (p > q) {
|
|
c && A(0);
|
|
break;
|
|
}
|
|
}
|
|
h && f(d + 131072);
|
|
for (var X = (1 << k) - 1, J = (1 << b) - 1, Z = p; ; Z = p) {
|
|
var Q = (W = g[C(t, p) & X]) >> 4;
|
|
if ((p += 15 & W) > q) {
|
|
c && A(0);
|
|
break;
|
|
}
|
|
if ((W || A(2), Q < 256)) i[d++] = Q;
|
|
else {
|
|
if (256 == Q) {
|
|
((Z = p), (g = null));
|
|
break;
|
|
}
|
|
var tt = Q - 254;
|
|
if (Q > 264) {
|
|
var nt = o[(L = Q - 257)];
|
|
((tt = S(t, p, (1 << nt) - 1) + l[L]), (p += nt));
|
|
}
|
|
var it = m[C(t, p) & J],
|
|
rt = it >> 4;
|
|
if (
|
|
(it || A(3),
|
|
(p += 15 & it),
|
|
(Y = w[rt]),
|
|
rt > 3 && ((nt = _[rt]), (Y += C(t, p) & ((1 << nt) - 1)), (p += nt)),
|
|
p > q)
|
|
) {
|
|
c && A(0);
|
|
break;
|
|
}
|
|
h && f(d + 131072);
|
|
var et = d + tt;
|
|
if (d < Y) {
|
|
var ut = s - Y,
|
|
st = Math.min(Y, et);
|
|
for (ut + d < 0 && A(3); d < st; ++d) i[d] = r[ut + d];
|
|
}
|
|
for (; d < et; d += 4)
|
|
((i[d] = i[d - Y]),
|
|
(i[d + 1] = i[d + 1 - Y]),
|
|
(i[d + 2] = i[d + 2 - Y]),
|
|
(i[d + 3] = i[d + 3 - Y]));
|
|
d = et;
|
|
}
|
|
}
|
|
((n.l = g), (n.p = Z), (n.b = d), (n.f = v), g && ((v = 1), (n.m = k), (n.d = m), (n.n = b)));
|
|
} while (!v);
|
|
return d == i.length ? i : T(i, 0, d);
|
|
},
|
|
P = function (t, n, i) {
|
|
i <<= 7 & n;
|
|
var r = (n / 8) | 0;
|
|
((t[r] |= i), (t[r + 1] |= i >> 8));
|
|
},
|
|
N = function (t, n, i) {
|
|
i <<= 7 & n;
|
|
var r = (n / 8) | 0;
|
|
((t[r] |= i), (t[r + 1] |= i >> 8), (t[r + 2] |= i >> 16));
|
|
},
|
|
O = function (t, n) {
|
|
for (var i = [], r = 0; r < t.length; ++r) t[r] && i.push({ s: r, f: t[r] });
|
|
var s = i.length,
|
|
o = i.slice();
|
|
if (!s) return { t: G, l: 0 };
|
|
if (1 == s) {
|
|
var _ = new e(i[0].s + 1);
|
|
return ((_[i[0].s] = 1), { t: _, l: 1 });
|
|
}
|
|
(i.sort(function (t, n) {
|
|
return t.f - n.f;
|
|
}),
|
|
i.push({ s: -1, f: 25001 }));
|
|
var a = i[0],
|
|
h = i[1],
|
|
c = 0,
|
|
l = 1,
|
|
f = 2;
|
|
for (i[0] = { s: -1, f: a.f + h.f, l: a, r: h }; l != s - 1;)
|
|
((a = i[i[c].f < i[f].f ? c++ : f++]),
|
|
(h = i[c != l && i[c].f < i[f].f ? c++ : f++]),
|
|
(i[l++] = { s: -1, f: a.f + h.f, l: a, r: h }));
|
|
var v = o[0].s;
|
|
for (r = 1; r < s; ++r) o[r].s > v && (v = o[r].s);
|
|
var w = new u(v + 1),
|
|
p = M(i[l - 1], w, 0);
|
|
if (p > n) {
|
|
r = 0;
|
|
var d = 0,
|
|
g = p - n,
|
|
m = 1 << g;
|
|
for (
|
|
o.sort(function (t, n) {
|
|
return w[n.s] - w[t.s] || t.f - n.f;
|
|
});
|
|
r < s;
|
|
++r
|
|
) {
|
|
var y = o[r].s;
|
|
if (!(w[y] > n)) break;
|
|
((d += m - (1 << (p - w[y]))), (w[y] = n));
|
|
}
|
|
for (d >>= g; d > 0;) {
|
|
var k = o[r].s;
|
|
w[k] < n ? (d -= 1 << (n - w[k]++ - 1)) : ++r;
|
|
}
|
|
for (; r >= 0 && d; --r) {
|
|
var b = o[r].s;
|
|
w[b] == n && (--w[b], ++d);
|
|
}
|
|
p = n;
|
|
}
|
|
return { t: new e(w), l: p };
|
|
},
|
|
M = function (t, n, i) {
|
|
return -1 == t.s ? Math.max(M(t.l, n, i + 1), M(t.r, n, i + 1)) : (n[t.s] = i);
|
|
},
|
|
D = function (t) {
|
|
for (var n = t.length; n && !t[--n];);
|
|
for (
|
|
var i = new u(++n),
|
|
r = 0,
|
|
e = t[0],
|
|
s = 1,
|
|
o = function (t) {
|
|
i[r++] = t;
|
|
},
|
|
_ = 1;
|
|
_ <= n;
|
|
++_
|
|
)
|
|
if (t[_] == e && _ != n) ++s;
|
|
else {
|
|
if (!e && s > 2) {
|
|
for (; s > 138; s -= 138) o(32754);
|
|
s > 2 && (o(s > 10 ? ((s - 11) << 5) | 28690 : ((s - 3) << 5) | 12305), (s = 0));
|
|
} else if (s > 3) {
|
|
for (o(e), --s; s > 6; s -= 6) o(8304);
|
|
s > 2 && (o(((s - 3) << 5) | 8208), (s = 0));
|
|
}
|
|
for (; s--;) o(e);
|
|
((s = 1), (e = t[_]));
|
|
}
|
|
return { c: i.subarray(0, r), n };
|
|
},
|
|
L = function (t, n) {
|
|
for (var i = 0, r = 0; r < n.length; ++r) i += t[r] * n[r];
|
|
return i;
|
|
},
|
|
B = function (t, n, i) {
|
|
var r = i.length,
|
|
e = E(n + 2);
|
|
((t[e] = 255 & r), (t[e + 1] = r >> 8), (t[e + 2] = 255 ^ t[e]), (t[e + 3] = 255 ^ t[e + 1]));
|
|
for (var u = 0; u < r; ++u) t[e + u + 4] = i[u];
|
|
return 8 * (e + 4 + r);
|
|
},
|
|
U = function (t, n, i, r, e, s, h, c, l, f, v) {
|
|
(P(n, v++, i), ++e[256]);
|
|
for (
|
|
var w = O(e, 15),
|
|
p = w.t,
|
|
d = w.l,
|
|
g = O(s, 15),
|
|
m = g.t,
|
|
$ = g.l,
|
|
x = D(p),
|
|
z = x.c,
|
|
S = x.n,
|
|
C = D(m),
|
|
E = C.c,
|
|
T = C.n,
|
|
I = new u(19),
|
|
A = 0;
|
|
A < z.length;
|
|
++A
|
|
)
|
|
++I[31 & z[A]];
|
|
for (A = 0; A < E.length; ++A) ++I[31 & E[A]];
|
|
for (var R = O(I, 7), M = R.t, U = R.l, F = 19; F > 4 && !M[a[F - 1]]; --F);
|
|
var G,
|
|
H,
|
|
W,
|
|
V,
|
|
K = (f + 5) << 3,
|
|
Y = L(e, k) + L(s, b) + h,
|
|
X = L(e, p) + L(s, m) + h + 14 + 3 * F + L(I, M) + 2 * I[16] + 3 * I[17] + 7 * I[18];
|
|
if (l >= 0 && K <= Y && K <= X) return B(n, v, t.subarray(l, l + f));
|
|
if ((P(n, v, 1 + (X < Y)), (v += 2), X < Y)) {
|
|
((G = y(p, d, 0)), (H = p), (W = y(m, $, 0)), (V = m));
|
|
var J = y(M, U, 0);
|
|
for (P(n, v, S - 257), P(n, v + 5, T - 1), P(n, v + 10, F - 4), v += 14, A = 0; A < F; ++A)
|
|
P(n, v + 3 * A, M[a[A]]);
|
|
v += 3 * F;
|
|
for (var Z = [z, E], Q = 0; Q < 2; ++Q) {
|
|
var tt = Z[Q];
|
|
for (A = 0; A < tt.length; ++A) {
|
|
var nt = 31 & tt[A];
|
|
(P(n, v, J[nt]), (v += M[nt]), nt > 15 && (P(n, v, (tt[A] >> 5) & 127), (v += tt[A] >> 12)));
|
|
}
|
|
}
|
|
} else ((G = q), (H = k), (W = j), (V = b));
|
|
for (A = 0; A < c; ++A) {
|
|
var it = r[A];
|
|
if (it > 255) {
|
|
(N(n, v, G[257 + (nt = (it >> 18) & 31)]),
|
|
(v += H[nt + 257]),
|
|
nt > 7 && (P(n, v, (it >> 23) & 31), (v += o[nt])));
|
|
var rt = 31 & it;
|
|
(N(n, v, W[rt]), (v += V[rt]), rt > 3 && (N(n, v, (it >> 5) & 8191), (v += _[rt])));
|
|
} else (N(n, v, G[it]), (v += H[it]));
|
|
}
|
|
return (N(n, v, G[256]), v + H[256]);
|
|
},
|
|
F = new s([65540, 131080, 131088, 131104, 262176, 1048704, 1048832, 2114560, 2117632]),
|
|
G = new e(0),
|
|
H = function (t, n, i, r, a, h) {
|
|
var c = h.z || t.length,
|
|
l = new e(r + c + 5 * (1 + Math.ceil(c / 7e3)) + a),
|
|
v = l.subarray(r, l.length - a),
|
|
w = h.l,
|
|
d = 7 & (h.r || 0);
|
|
if (n) {
|
|
d && (v[0] = h.r >> 3);
|
|
for (
|
|
var g = F[n - 1],
|
|
m = g >> 13,
|
|
y = 8191 & g,
|
|
k = (1 << i) - 1,
|
|
b = h.p || new u(32768),
|
|
q = h.h || new u(k + 1),
|
|
$ = Math.ceil(i / 3),
|
|
j = 2 * $,
|
|
x = function (n) {
|
|
return (t[n] ^ (t[n + 1] << $) ^ (t[n + 2] << j)) & k;
|
|
},
|
|
z = new s(25e3),
|
|
S = new u(288),
|
|
C = new u(32),
|
|
I = 0,
|
|
A = 0,
|
|
R = h.i || 0,
|
|
P = 0,
|
|
N = h.w || 0,
|
|
O = 0;
|
|
R + 2 < c;
|
|
++R
|
|
) {
|
|
var M = x(R),
|
|
D = 32767 & R,
|
|
L = q[M];
|
|
if (((b[D] = L), (q[M] = D), N <= R)) {
|
|
var G = c - R;
|
|
if ((I > 7e3 || P > 24576) && (G > 423 || !w)) {
|
|
((d = U(t, v, 0, z, S, C, A, P, O, R - O, d)), (P = I = A = 0), (O = R));
|
|
for (var H = 0; H < 286; ++H) S[H] = 0;
|
|
for (H = 0; H < 30; ++H) C[H] = 0;
|
|
}
|
|
var W = 2,
|
|
V = 0,
|
|
K = y,
|
|
Y = (D - L) & 32767;
|
|
if (G > 2 && M == x(R - Y))
|
|
for (
|
|
var X = Math.min(m, G) - 1, J = Math.min(32767, R), Z = Math.min(258, G);
|
|
Y <= J && --K && D != L;
|
|
) {
|
|
if (t[R + W] == t[R + W - Y]) {
|
|
for (var Q = 0; Q < Z && t[R + Q] == t[R + Q - Y]; ++Q);
|
|
if (Q > W) {
|
|
if (((W = Q), (V = Y), Q > X)) break;
|
|
var tt = Math.min(Y, Q - 2),
|
|
nt = 0;
|
|
for (H = 0; H < tt; ++H) {
|
|
var it = (R - Y + H) & 32767,
|
|
rt = (it - b[it]) & 32767;
|
|
rt > nt && ((nt = rt), (L = it));
|
|
}
|
|
}
|
|
}
|
|
Y += ((D = L) - (L = b[D])) & 32767;
|
|
}
|
|
if (V) {
|
|
z[P++] = 268435456 | (f[W] << 18) | p[V];
|
|
var et = 31 & f[W],
|
|
ut = 31 & p[V];
|
|
((A += o[et] + _[ut]), ++S[257 + et], ++C[ut], (N = R + W), ++I);
|
|
} else ((z[P++] = t[R]), ++S[t[R]]);
|
|
}
|
|
}
|
|
for (R = Math.max(R, N); R < c; ++R) ((z[P++] = t[R]), ++S[t[R]]);
|
|
((d = U(t, v, w, z, S, C, A, P, O, R - O, d)),
|
|
w ||
|
|
((h.r = (7 & d) | (v[(d / 8) | 0] << 3)), (d -= 7), (h.h = q), (h.p = b), (h.i = R), (h.w = N)));
|
|
} else {
|
|
for (R = h.w || 0; R < c + w; R += 65535) {
|
|
var st = R + 65535;
|
|
(st >= c && ((v[(d / 8) | 0] = w), (st = c)), (d = B(v, d + 1, t.subarray(R, st))));
|
|
}
|
|
h.i = c;
|
|
}
|
|
return T(l, 0, r + E(d) + a);
|
|
},
|
|
W = (function () {
|
|
for (var t = new Int32Array(256), n = 0; n < 256; ++n) {
|
|
for (var i = n, r = 9; --r;) i = (1 & i && -306674912) ^ (i >>> 1);
|
|
t[n] = i;
|
|
}
|
|
return t;
|
|
})(),
|
|
V = function () {
|
|
var t = -1;
|
|
return {
|
|
p: function (n) {
|
|
for (var i = t, r = 0; r < n.length; ++r) i = W[(255 & i) ^ n[r]] ^ (i >>> 8);
|
|
t = i;
|
|
},
|
|
d: function () {
|
|
return ~t;
|
|
},
|
|
};
|
|
},
|
|
K = function () {
|
|
var t = 1,
|
|
n = 0;
|
|
return {
|
|
p: function (i) {
|
|
for (var r = t, e = n, u = 0 | i.length, s = 0; s != u;) {
|
|
for (var o = Math.min(s + 2655, u); s < o; ++s) e += r += i[s];
|
|
((r = (65535 & r) + 15 * (r >> 16)), (e = (65535 & e) + 15 * (e >> 16)));
|
|
}
|
|
((t = r), (n = e));
|
|
},
|
|
d: function () {
|
|
return ((255 & (t %= 65521)) << 24) | ((65280 & t) << 8) | ((255 & (n %= 65521)) << 8) | (n >> 8);
|
|
},
|
|
};
|
|
},
|
|
Y = function (t, n, i, r, u) {
|
|
if (!u && ((u = { l: 1 }), n.dictionary)) {
|
|
var s = n.dictionary.subarray(-32768),
|
|
o = new e(s.length + t.length);
|
|
(o.set(s), o.set(t, s.length), (t = o), (u.w = s.length));
|
|
}
|
|
return H(
|
|
t,
|
|
null == n.level ? 6 : n.level,
|
|
null == n.mem ? Math.ceil(1.5 * Math.max(8, Math.min(13, Math.log(t.length)))) : 12 + n.mem,
|
|
i,
|
|
r,
|
|
u,
|
|
);
|
|
},
|
|
X = function (t, n) {
|
|
var i = {};
|
|
for (var r in t) i[r] = t[r];
|
|
for (var r in n) i[r] = n[r];
|
|
return i;
|
|
},
|
|
J = function (t, n, i) {
|
|
for (
|
|
var r = t(),
|
|
e = t.toString(),
|
|
u = e
|
|
.slice(e.indexOf("[") + 1, e.lastIndexOf("]"))
|
|
.replace(/\s+/g, "")
|
|
.split(","),
|
|
s = 0;
|
|
s < r.length;
|
|
++s
|
|
) {
|
|
var o = r[s],
|
|
_ = u[s];
|
|
if ("function" == typeof o) {
|
|
n += ";" + _ + "=";
|
|
var a = o.toString();
|
|
if (o.prototype)
|
|
if (-1 != a.indexOf("[native code]")) {
|
|
var h = a.indexOf(" ", 8) + 1;
|
|
n += a.slice(h, a.indexOf("(", h));
|
|
} else
|
|
for (var c in ((n += a), o.prototype))
|
|
n += ";" + _ + ".prototype." + c + "=" + o.prototype[c].toString();
|
|
else n += a;
|
|
} else i[_] = o;
|
|
}
|
|
return n;
|
|
},
|
|
Z = [],
|
|
Q = function (t, n, i, e) {
|
|
if (!Z[i]) {
|
|
for (var u = "", s = {}, o = t.length - 1, _ = 0; _ < o; ++_) u = J(t[_], u, s);
|
|
Z[i] = { c: J(t[o], u, s), e: s };
|
|
}
|
|
var a = X({}, Z[i].e);
|
|
return r.default(
|
|
Z[i].c +
|
|
";onmessage=function(e){for(var k in e.data)self[k]=e.data[k];onmessage=" +
|
|
n.toString() +
|
|
"}",
|
|
i,
|
|
a,
|
|
(function (t) {
|
|
var n = [];
|
|
for (var i in t) t[i].buffer && n.push((t[i] = new t[i].constructor(t[i])).buffer);
|
|
return n;
|
|
})(a),
|
|
e,
|
|
);
|
|
},
|
|
tt = function () {
|
|
return [e, u, s, o, _, a, l, w, $, x, d, I, y, z, S, C, E, T, A, R, Ct, st, ot];
|
|
},
|
|
nt = function () {
|
|
return [e, u, s, o, _, a, f, p, q, k, j, b, d, F, G, y, P, N, O, M, D, L, B, U, E, T, H, Y, jt, st];
|
|
},
|
|
it = function () {
|
|
return [wt, gt, vt, V, W];
|
|
},
|
|
rt = function () {
|
|
return [pt, dt];
|
|
},
|
|
et = function () {
|
|
return [mt, vt, K];
|
|
},
|
|
ut = function () {
|
|
return [yt];
|
|
},
|
|
st = function (t) {
|
|
return postMessage(t, [t.buffer]);
|
|
},
|
|
ot = function (t) {
|
|
return t && { out: t.size && new e(t.size), dictionary: t.dictionary };
|
|
},
|
|
_t = function (t, n, i, r, e, u) {
|
|
var s = Q(i, r, e, function (t, n) {
|
|
(s.terminate(), u(t, n));
|
|
});
|
|
return (
|
|
s.postMessage([t, n], n.consume ? [t.buffer] : []),
|
|
function () {
|
|
s.terminate();
|
|
}
|
|
);
|
|
},
|
|
at = function (t) {
|
|
return (
|
|
(t.ondata = function (t, n) {
|
|
return postMessage([t, n], [t.buffer]);
|
|
}),
|
|
function (n) {
|
|
return t.push(n.data[0], n.data[1]);
|
|
}
|
|
);
|
|
},
|
|
ht = function (t, n, i, r, e, u) {
|
|
var s,
|
|
o = Q(t, r, e, function (t, i) {
|
|
t
|
|
? (o.terminate(), n.ondata.call(n, t))
|
|
: Array.isArray(i)
|
|
? (i[1] && o.terminate(), n.ondata.call(n, t, i[0], i[1]))
|
|
: u(i);
|
|
});
|
|
(o.postMessage(i),
|
|
(n.push = function (t, i) {
|
|
(n.ondata || A(5), s && n.ondata(A(4, 0, 1), null, !!i), o.postMessage([t, (s = i)], [t.buffer]));
|
|
}),
|
|
(n.terminate = function () {
|
|
o.terminate();
|
|
}));
|
|
},
|
|
ct = function (t, n) {
|
|
return t[n] | (t[n + 1] << 8);
|
|
},
|
|
lt = function (t, n) {
|
|
return (t[n] | (t[n + 1] << 8) | (t[n + 2] << 16) | (t[n + 3] << 24)) >>> 0;
|
|
},
|
|
ft = function (t, n) {
|
|
return lt(t, n) + 4294967296 * lt(t, n + 4);
|
|
},
|
|
vt = function (t, n, i) {
|
|
for (; i; ++n) ((t[n] = i), (i >>>= 8));
|
|
},
|
|
wt = function (t, n) {
|
|
var i = n.filename;
|
|
if (
|
|
((t[0] = 31),
|
|
(t[1] = 139),
|
|
(t[2] = 8),
|
|
(t[8] = n.level < 2 ? 4 : 9 == n.level ? 2 : 0),
|
|
(t[9] = 3),
|
|
0 != n.mtime && vt(t, 4, Math.floor(new Date(n.mtime || Date.now()) / 1e3)),
|
|
i)
|
|
) {
|
|
t[3] = 8;
|
|
for (var r = 0; r <= i.length; ++r) t[r + 10] = i.charCodeAt(r);
|
|
}
|
|
},
|
|
pt = function (t) {
|
|
(31 == t[0] && 139 == t[1] && 8 == t[2]) || A(6, "invalid gzip data");
|
|
var n = t[3],
|
|
i = 10;
|
|
4 & n && (i += 2 + (t[10] | (t[11] << 8)));
|
|
for (var r = ((n >> 3) & 1) + ((n >> 4) & 1); r > 0; r -= !t[i++]);
|
|
return i + (2 & n);
|
|
},
|
|
dt = function (t) {
|
|
var n = t.length;
|
|
return (t[n - 4] | (t[n - 3] << 8) | (t[n - 2] << 16) | (t[n - 1] << 24)) >>> 0;
|
|
},
|
|
gt = function (t) {
|
|
return 10 + (t.filename ? t.filename.length + 1 : 0);
|
|
},
|
|
mt = function (t, n) {
|
|
var i = n.level,
|
|
r = 0 == i ? 0 : i < 6 ? 1 : 9 == i ? 3 : 2;
|
|
if (
|
|
((t[0] = 120),
|
|
(t[1] = (r << 6) | (n.dictionary && 32)),
|
|
(t[1] |= 31 - (((t[0] << 8) | t[1]) % 31)),
|
|
n.dictionary)
|
|
) {
|
|
var e = K();
|
|
(e.p(n.dictionary), vt(t, 2, e.d()));
|
|
}
|
|
},
|
|
yt = function (t, n) {
|
|
return (
|
|
(8 != (15 & t[0]) || t[0] >> 4 > 7 || ((t[0] << 8) | t[1]) % 31) && A(6, "invalid zlib data"),
|
|
((t[1] >> 5) & 1) == +!n &&
|
|
A(6, "invalid zlib data: " + (32 & t[1] ? "need" : "unexpected") + " dictionary"),
|
|
2 + ((t[1] >> 3) & 4)
|
|
);
|
|
};
|
|
function kt(t, n) {
|
|
return ("function" == typeof t && ((n = t), (t = {})), (this.ondata = n), t);
|
|
}
|
|
var bt = (function () {
|
|
function t(t, n) {
|
|
if (
|
|
("function" == typeof t && ((n = t), (t = {})),
|
|
(this.ondata = n),
|
|
(this.o = t || {}),
|
|
(this.s = { l: 0, i: 32768, w: 32768, z: 32768 }),
|
|
(this.b = new e(98304)),
|
|
this.o.dictionary)
|
|
) {
|
|
var i = this.o.dictionary.subarray(-32768);
|
|
(this.b.set(i, 32768 - i.length), (this.s.i = 32768 - i.length));
|
|
}
|
|
}
|
|
return (
|
|
(t.prototype.p = function (t, n) {
|
|
this.ondata(Y(t, this.o, 0, 0, this.s), n);
|
|
}),
|
|
(t.prototype.push = function (t, n) {
|
|
(this.ondata || A(5), this.s.l && A(4));
|
|
var i = t.length + this.s.z;
|
|
if (i > this.b.length) {
|
|
if (i > 2 * this.b.length - 32768) {
|
|
var r = new e(-32768 & i);
|
|
(r.set(this.b.subarray(0, this.s.z)), (this.b = r));
|
|
}
|
|
var u = this.b.length - this.s.z;
|
|
(u && (this.b.set(t.subarray(0, u), this.s.z), (this.s.z = this.b.length), this.p(this.b, !1)),
|
|
this.b.set(this.b.subarray(-32768)),
|
|
this.b.set(t.subarray(u), 32768),
|
|
(this.s.z = t.length - u + 32768),
|
|
(this.s.i = 32766),
|
|
(this.s.w = 32768));
|
|
} else (this.b.set(t, this.s.z), (this.s.z += t.length));
|
|
((this.s.l = 1 & n),
|
|
(this.s.z > this.s.w + 8191 || n) &&
|
|
(this.p(this.b, n || !1), (this.s.w = this.s.i), (this.s.i -= 2)));
|
|
}),
|
|
t
|
|
);
|
|
})();
|
|
n.Deflate = bt;
|
|
var qt = (function () {
|
|
return function (t, n) {
|
|
ht(
|
|
[
|
|
nt,
|
|
function () {
|
|
return [at, bt];
|
|
},
|
|
],
|
|
this,
|
|
kt.call(this, t, n),
|
|
function (t) {
|
|
var n = new bt(t.data);
|
|
onmessage = at(n);
|
|
},
|
|
6,
|
|
);
|
|
};
|
|
})();
|
|
function $t(t, n, i) {
|
|
return (
|
|
i || ((i = n), (n = {})),
|
|
"function" != typeof i && A(7),
|
|
_t(
|
|
t,
|
|
n,
|
|
[nt],
|
|
function (t) {
|
|
return st(jt(t.data[0], t.data[1]));
|
|
},
|
|
0,
|
|
i,
|
|
)
|
|
);
|
|
}
|
|
function jt(t, n) {
|
|
return Y(t, n || {}, 0, 0);
|
|
}
|
|
((n.AsyncDeflate = qt), (n.deflate = $t), (n.deflateSync = jt));
|
|
var xt = (function () {
|
|
function t(t, n) {
|
|
("function" == typeof t && ((n = t), (t = {})), (this.ondata = n));
|
|
var i = t && t.dictionary && t.dictionary.subarray(-32768);
|
|
((this.s = { i: 0, b: i ? i.length : 0 }),
|
|
(this.o = new e(32768)),
|
|
(this.p = new e(0)),
|
|
i && this.o.set(i));
|
|
}
|
|
return (
|
|
(t.prototype.e = function (t) {
|
|
if ((this.ondata || A(5), this.d && A(4), this.p.length)) {
|
|
if (t.length) {
|
|
var n = new e(this.p.length + t.length);
|
|
(n.set(this.p), n.set(t, this.p.length), (this.p = n));
|
|
}
|
|
} else this.p = t;
|
|
}),
|
|
(t.prototype.c = function (t) {
|
|
this.s.i = +(this.d = t || !1);
|
|
var n = this.s.b,
|
|
i = R(this.p, this.s, this.o);
|
|
(this.ondata(T(i, n, this.s.b), this.d),
|
|
(this.o = T(i, this.s.b - 32768)),
|
|
(this.s.b = this.o.length),
|
|
(this.p = T(this.p, (this.s.p / 8) | 0)),
|
|
(this.s.p &= 7));
|
|
}),
|
|
(t.prototype.push = function (t, n) {
|
|
(this.e(t), this.c(n));
|
|
}),
|
|
t
|
|
);
|
|
})();
|
|
n.Inflate = xt;
|
|
var zt = (function () {
|
|
return function (t, n) {
|
|
ht(
|
|
[
|
|
tt,
|
|
function () {
|
|
return [at, xt];
|
|
},
|
|
],
|
|
this,
|
|
kt.call(this, t, n),
|
|
function (t) {
|
|
var n = new xt(t.data);
|
|
onmessage = at(n);
|
|
},
|
|
7,
|
|
);
|
|
};
|
|
})();
|
|
function St(t, n, i) {
|
|
return (
|
|
i || ((i = n), (n = {})),
|
|
"function" != typeof i && A(7),
|
|
_t(
|
|
t,
|
|
n,
|
|
[tt],
|
|
function (t) {
|
|
return st(Ct(t.data[0], ot(t.data[1])));
|
|
},
|
|
1,
|
|
i,
|
|
)
|
|
);
|
|
}
|
|
function Ct(t, n) {
|
|
return R(t, { i: 2 }, n && n.out, n && n.dictionary);
|
|
}
|
|
((n.AsyncInflate = zt), (n.inflate = St), (n.inflateSync = Ct));
|
|
var Et = (function () {
|
|
function t(t, n) {
|
|
((this.c = V()), (this.l = 0), (this.v = 1), bt.call(this, t, n));
|
|
}
|
|
return (
|
|
(t.prototype.push = function (t, n) {
|
|
(this.c.p(t), (this.l += t.length), bt.prototype.push.call(this, t, n));
|
|
}),
|
|
(t.prototype.p = function (t, n) {
|
|
var i = Y(t, this.o, this.v && gt(this.o), n && 8, this.s);
|
|
(this.v && (wt(i, this.o), (this.v = 0)),
|
|
n && (vt(i, i.length - 8, this.c.d()), vt(i, i.length - 4, this.l)),
|
|
this.ondata(i, n));
|
|
}),
|
|
t
|
|
);
|
|
})();
|
|
((n.Gzip = Et), (n.Compress = Et));
|
|
var Tt = (function () {
|
|
return function (t, n) {
|
|
ht(
|
|
[
|
|
nt,
|
|
it,
|
|
function () {
|
|
return [at, bt, Et];
|
|
},
|
|
],
|
|
this,
|
|
kt.call(this, t, n),
|
|
function (t) {
|
|
var n = new Et(t.data);
|
|
onmessage = at(n);
|
|
},
|
|
8,
|
|
);
|
|
};
|
|
})();
|
|
function It(t, n, i) {
|
|
return (
|
|
i || ((i = n), (n = {})),
|
|
"function" != typeof i && A(7),
|
|
_t(
|
|
t,
|
|
n,
|
|
[
|
|
nt,
|
|
it,
|
|
function () {
|
|
return [At];
|
|
},
|
|
],
|
|
function (t) {
|
|
return st(At(t.data[0], t.data[1]));
|
|
},
|
|
2,
|
|
i,
|
|
)
|
|
);
|
|
}
|
|
function At(t, n) {
|
|
n || (n = {});
|
|
var i = V(),
|
|
r = t.length;
|
|
i.p(t);
|
|
var e = Y(t, n, gt(n), 8),
|
|
u = e.length;
|
|
return (wt(e, n), vt(e, u - 8, i.d()), vt(e, u - 4, r), e);
|
|
}
|
|
((n.AsyncGzip = Tt),
|
|
(n.AsyncCompress = Tt),
|
|
(n.gzip = It),
|
|
(n.compress = It),
|
|
(n.gzipSync = At),
|
|
(n.compressSync = At));
|
|
var Rt = (function () {
|
|
function t(t, n) {
|
|
((this.v = 1), (this.r = 0), xt.call(this, t, n));
|
|
}
|
|
return (
|
|
(t.prototype.push = function (t, n) {
|
|
if ((xt.prototype.e.call(this, t), (this.r += t.length), this.v)) {
|
|
var i = this.p.subarray(this.v - 1),
|
|
r = i.length > 3 ? pt(i) : 4;
|
|
if (r > i.length) {
|
|
if (!n) return;
|
|
} else this.v > 1 && this.onmember && this.onmember(this.r - i.length);
|
|
((this.p = i.subarray(r)), (this.v = 0));
|
|
}
|
|
(xt.prototype.c.call(this, n),
|
|
this.s.f &&
|
|
!this.s.l &&
|
|
((this.v = E(this.s.p) + 9),
|
|
(this.s = { i: 0 }),
|
|
(this.o = new e(0)),
|
|
this.p.length && this.push(new e(0), n)));
|
|
}),
|
|
t
|
|
);
|
|
})();
|
|
n.Gunzip = Rt;
|
|
var Pt = (function () {
|
|
return function (t, n) {
|
|
var i = this;
|
|
ht(
|
|
[
|
|
tt,
|
|
rt,
|
|
function () {
|
|
return [at, xt, Rt];
|
|
},
|
|
],
|
|
this,
|
|
kt.call(this, t, n),
|
|
function (t) {
|
|
var n = new Rt(t.data);
|
|
((n.onmember = function (t) {
|
|
return postMessage(t);
|
|
}),
|
|
(onmessage = at(n)));
|
|
},
|
|
9,
|
|
function (t) {
|
|
return i.onmember && i.onmember(t);
|
|
},
|
|
);
|
|
};
|
|
})();
|
|
function Nt(t, n, i) {
|
|
return (
|
|
i || ((i = n), (n = {})),
|
|
"function" != typeof i && A(7),
|
|
_t(
|
|
t,
|
|
n,
|
|
[
|
|
tt,
|
|
rt,
|
|
function () {
|
|
return [Ot];
|
|
},
|
|
],
|
|
function (t) {
|
|
return st(Ot(t.data[0], t.data[1]));
|
|
},
|
|
3,
|
|
i,
|
|
)
|
|
);
|
|
}
|
|
function Ot(t, n) {
|
|
var i = pt(t);
|
|
return (
|
|
i + 8 > t.length && A(6, "invalid gzip data"),
|
|
R(t.subarray(i, -8), { i: 2 }, (n && n.out) || new e(dt(t)), n && n.dictionary)
|
|
);
|
|
}
|
|
((n.AsyncGunzip = Pt), (n.gunzip = Nt), (n.gunzipSync = Ot));
|
|
var Mt = (function () {
|
|
function t(t, n) {
|
|
((this.c = K()), (this.v = 1), bt.call(this, t, n));
|
|
}
|
|
return (
|
|
(t.prototype.push = function (t, n) {
|
|
(this.c.p(t), bt.prototype.push.call(this, t, n));
|
|
}),
|
|
(t.prototype.p = function (t, n) {
|
|
var i = Y(t, this.o, this.v && (this.o.dictionary ? 6 : 2), n && 4, this.s);
|
|
(this.v && (mt(i, this.o), (this.v = 0)), n && vt(i, i.length - 4, this.c.d()), this.ondata(i, n));
|
|
}),
|
|
t
|
|
);
|
|
})();
|
|
n.Zlib = Mt;
|
|
var Dt = (function () {
|
|
return function (t, n) {
|
|
ht(
|
|
[
|
|
nt,
|
|
et,
|
|
function () {
|
|
return [at, bt, Mt];
|
|
},
|
|
],
|
|
this,
|
|
kt.call(this, t, n),
|
|
function (t) {
|
|
var n = new Mt(t.data);
|
|
onmessage = at(n);
|
|
},
|
|
10,
|
|
);
|
|
};
|
|
})();
|
|
function Lt(t, n) {
|
|
n || (n = {});
|
|
var i = K();
|
|
i.p(t);
|
|
var r = Y(t, n, n.dictionary ? 6 : 2, 4);
|
|
return (mt(r, n), vt(r, r.length - 4, i.d()), r);
|
|
}
|
|
((n.AsyncZlib = Dt),
|
|
(n.zlib = function (t, n, i) {
|
|
return (
|
|
i || ((i = n), (n = {})),
|
|
"function" != typeof i && A(7),
|
|
_t(
|
|
t,
|
|
n,
|
|
[
|
|
nt,
|
|
et,
|
|
function () {
|
|
return [Lt];
|
|
},
|
|
],
|
|
function (t) {
|
|
return st(Lt(t.data[0], t.data[1]));
|
|
},
|
|
4,
|
|
i,
|
|
)
|
|
);
|
|
}),
|
|
(n.zlibSync = Lt));
|
|
var Bt = (function () {
|
|
function t(t, n) {
|
|
(xt.call(this, t, n), (this.v = t && t.dictionary ? 2 : 1));
|
|
}
|
|
return (
|
|
(t.prototype.push = function (t, n) {
|
|
if ((xt.prototype.e.call(this, t), this.v)) {
|
|
if (this.p.length < 6 && !n) return;
|
|
((this.p = this.p.subarray(yt(this.p, this.v - 1))), (this.v = 0));
|
|
}
|
|
(n && (this.p.length < 4 && A(6, "invalid zlib data"), (this.p = this.p.subarray(0, -4))),
|
|
xt.prototype.c.call(this, n));
|
|
}),
|
|
t
|
|
);
|
|
})();
|
|
n.Unzlib = Bt;
|
|
var Ut = (function () {
|
|
return function (t, n) {
|
|
ht(
|
|
[
|
|
tt,
|
|
ut,
|
|
function () {
|
|
return [at, xt, Bt];
|
|
},
|
|
],
|
|
this,
|
|
kt.call(this, t, n),
|
|
function (t) {
|
|
var n = new Bt(t.data);
|
|
onmessage = at(n);
|
|
},
|
|
11,
|
|
);
|
|
};
|
|
})();
|
|
function Ft(t, n, i) {
|
|
return (
|
|
i || ((i = n), (n = {})),
|
|
"function" != typeof i && A(7),
|
|
_t(
|
|
t,
|
|
n,
|
|
[
|
|
tt,
|
|
ut,
|
|
function () {
|
|
return [Gt];
|
|
},
|
|
],
|
|
function (t) {
|
|
return st(Gt(t.data[0], ot(t.data[1])));
|
|
},
|
|
5,
|
|
i,
|
|
)
|
|
);
|
|
}
|
|
function Gt(t, n) {
|
|
return R(t.subarray(yt(t, n && n.dictionary), -4), { i: 2 }, n && n.out, n && n.dictionary);
|
|
}
|
|
((n.AsyncUnzlib = Ut), (n.unzlib = Ft), (n.unzlibSync = Gt));
|
|
var Ht = (function () {
|
|
function t(t, n) {
|
|
((this.G = Rt), (this.I = xt), (this.Z = Bt), (this.o = kt.call(this, t, n) || {}));
|
|
}
|
|
return (
|
|
(t.prototype.push = function (t, n) {
|
|
if ((this.ondata || A(5), this.s)) this.s.push(t, n);
|
|
else {
|
|
if (this.p && this.p.length) {
|
|
var i = new e(this.p.length + t.length);
|
|
(i.set(this.p), i.set(t, this.p.length));
|
|
} else this.p = t;
|
|
if (this.p.length > 2) {
|
|
var r = this,
|
|
u = function () {
|
|
r.ondata.apply(r, arguments);
|
|
};
|
|
((this.s =
|
|
31 == this.p[0] && 139 == this.p[1] && 8 == this.p[2]
|
|
? new this.G(this.o, u)
|
|
: 8 != (15 & this.p[0]) || this.p[0] >> 4 > 7 || ((this.p[0] << 8) | this.p[1]) % 31
|
|
? new this.I(this.o, u)
|
|
: new this.Z(this.o, u)),
|
|
this.s.push(this.p, n),
|
|
(this.p = null));
|
|
}
|
|
}
|
|
}),
|
|
t
|
|
);
|
|
})();
|
|
n.Decompress = Ht;
|
|
var Wt = (function () {
|
|
function t(t, n) {
|
|
((this.G = Pt), (this.I = zt), (this.Z = Ut), Ht.call(this, t, n));
|
|
}
|
|
return (
|
|
(t.prototype.push = function (t, n) {
|
|
Ht.prototype.push.call(this, t, n);
|
|
}),
|
|
t
|
|
);
|
|
})();
|
|
((n.AsyncDecompress = Wt),
|
|
(n.decompress = function (t, n, i) {
|
|
return (
|
|
i || ((i = n), (n = {})),
|
|
"function" != typeof i && A(7),
|
|
31 == t[0] && 139 == t[1] && 8 == t[2]
|
|
? Nt(t, n, i)
|
|
: 8 != (15 & t[0]) || t[0] >> 4 > 7 || ((t[0] << 8) | t[1]) % 31
|
|
? St(t, n, i)
|
|
: Ft(t, n, i)
|
|
);
|
|
}),
|
|
(n.decompressSync = function (t, n) {
|
|
return 31 == t[0] && 139 == t[1] && 8 == t[2]
|
|
? Ot(t, n)
|
|
: 8 != (15 & t[0]) || t[0] >> 4 > 7 || ((t[0] << 8) | t[1]) % 31
|
|
? Ct(t, n)
|
|
: Gt(t, n);
|
|
}));
|
|
var Vt = function (t, n, i, r) {
|
|
for (var u in t) {
|
|
var s = t[u],
|
|
o = n + u,
|
|
_ = r;
|
|
(Array.isArray(s) && ((_ = X(r, s[1])), (s = s[0])),
|
|
s instanceof e ? (i[o] = [s, _]) : ((i[(o += "/")] = [new e(0), _]), Vt(s, o, i, r)));
|
|
}
|
|
},
|
|
Kt = "undefined" != typeof TextEncoder && new TextEncoder(),
|
|
Yt = "undefined" != typeof TextDecoder && new TextDecoder(),
|
|
Xt = 0;
|
|
try {
|
|
(Yt.decode(G, { stream: !0 }), (Xt = 1));
|
|
} catch (t) {}
|
|
var Jt = function (t) {
|
|
for (var n = "", i = 0; ;) {
|
|
var r = t[i++],
|
|
e = (r > 127) + (r > 223) + (r > 239);
|
|
if (i + e > t.length) return { s: n, r: T(t, i - 1) };
|
|
e
|
|
? 3 == e
|
|
? ((r =
|
|
(((15 & r) << 18) | ((63 & t[i++]) << 12) | ((63 & t[i++]) << 6) | (63 & t[i++])) - 65536),
|
|
(n += String.fromCharCode(55296 | (r >> 10), 56320 | (1023 & r))))
|
|
: (n +=
|
|
1 & e
|
|
? String.fromCharCode(((31 & r) << 6) | (63 & t[i++]))
|
|
: String.fromCharCode(((15 & r) << 12) | ((63 & t[i++]) << 6) | (63 & t[i++])))
|
|
: (n += String.fromCharCode(r));
|
|
}
|
|
},
|
|
Zt = (function () {
|
|
function t(t) {
|
|
((this.ondata = t), Xt ? (this.t = new TextDecoder()) : (this.p = G));
|
|
}
|
|
return (
|
|
(t.prototype.push = function (t, n) {
|
|
if ((this.ondata || A(5), (n = !!n), this.t))
|
|
return (
|
|
this.ondata(this.t.decode(t, { stream: !0 }), n),
|
|
void (n && (this.t.decode().length && A(8), (this.t = null)))
|
|
);
|
|
this.p || A(4);
|
|
var i = new e(this.p.length + t.length);
|
|
(i.set(this.p), i.set(t, this.p.length));
|
|
var r = Jt(i),
|
|
u = r.s,
|
|
s = r.r;
|
|
(n ? (s.length && A(8), (this.p = null)) : (this.p = s), this.ondata(u, n));
|
|
}),
|
|
t
|
|
);
|
|
})();
|
|
n.DecodeUTF8 = Zt;
|
|
var Qt = (function () {
|
|
function t(t) {
|
|
this.ondata = t;
|
|
}
|
|
return (
|
|
(t.prototype.push = function (t, n) {
|
|
(this.ondata || A(5), this.d && A(4), this.ondata(tn(t), (this.d = n || !1)));
|
|
}),
|
|
t
|
|
);
|
|
})();
|
|
function tn(t, n) {
|
|
if (n) {
|
|
for (var i = new e(t.length), r = 0; r < t.length; ++r) i[r] = t.charCodeAt(r);
|
|
return i;
|
|
}
|
|
if (Kt) return Kt.encode(t);
|
|
var u = t.length,
|
|
s = new e(t.length + (t.length >> 1)),
|
|
o = 0,
|
|
_ = function (t) {
|
|
s[o++] = t;
|
|
};
|
|
for (r = 0; r < u; ++r) {
|
|
if (o + 5 > s.length) {
|
|
var a = new e(o + 8 + ((u - r) << 1));
|
|
(a.set(s), (s = a));
|
|
}
|
|
var h = t.charCodeAt(r);
|
|
h < 128 || n
|
|
? _(h)
|
|
: h < 2048
|
|
? (_(192 | (h >> 6)), _(128 | (63 & h)))
|
|
: h > 55295 && h < 57344
|
|
? (_(240 | ((h = (65536 + (1047552 & h)) | (1023 & t.charCodeAt(++r))) >> 18)),
|
|
_(128 | ((h >> 12) & 63)),
|
|
_(128 | ((h >> 6) & 63)),
|
|
_(128 | (63 & h)))
|
|
: (_(224 | (h >> 12)), _(128 | ((h >> 6) & 63)), _(128 | (63 & h)));
|
|
}
|
|
return T(s, 0, o);
|
|
}
|
|
function nn(t, n) {
|
|
if (n) {
|
|
for (var i = "", r = 0; r < t.length; r += 16384)
|
|
i += String.fromCharCode.apply(null, t.subarray(r, r + 16384));
|
|
return i;
|
|
}
|
|
if (Yt) return Yt.decode(t);
|
|
var e = Jt(t),
|
|
u = e.s;
|
|
return ((i = e.r).length && A(8), u);
|
|
}
|
|
((n.EncodeUTF8 = Qt), (n.strToU8 = tn), (n.strFromU8 = nn));
|
|
var rn = function (t) {
|
|
return 1 == t ? 3 : t < 6 ? 2 : 9 == t ? 1 : 0;
|
|
},
|
|
en = function (t, n) {
|
|
return n + 30 + ct(t, n + 26) + ct(t, n + 28);
|
|
},
|
|
un = function (t, n, i) {
|
|
var r = ct(t, n + 28),
|
|
e = nn(t.subarray(n + 46, n + 46 + r), !(2048 & ct(t, n + 8))),
|
|
u = n + 46 + r,
|
|
s = lt(t, n + 20),
|
|
o = i && 4294967295 == s ? sn(t, u) : [s, lt(t, n + 24), lt(t, n + 42)],
|
|
_ = o[0],
|
|
a = o[1],
|
|
h = o[2];
|
|
return [ct(t, n + 10), _, a, e, u + ct(t, n + 30) + ct(t, n + 32), h];
|
|
},
|
|
sn = function (t, n) {
|
|
for (; 1 != ct(t, n); n += 4 + ct(t, n + 2));
|
|
return [ft(t, n + 12), ft(t, n + 4), ft(t, n + 20)];
|
|
},
|
|
on = function (t) {
|
|
var n = 0;
|
|
if (t)
|
|
for (var i in t) {
|
|
var r = t[i].length;
|
|
(r > 65535 && A(9), (n += r + 4));
|
|
}
|
|
return n;
|
|
},
|
|
_n = function (t, n, i, r, e, u, s, o) {
|
|
var _ = r.length,
|
|
a = i.extra,
|
|
h = o && o.length,
|
|
c = on(a);
|
|
(vt(t, n, null != s ? 33639248 : 67324752),
|
|
(n += 4),
|
|
null != s && ((t[n++] = 20), (t[n++] = i.os)),
|
|
(t[n] = 20),
|
|
(n += 2),
|
|
(t[n++] = (i.flag << 1) | (u < 0 && 8)),
|
|
(t[n++] = e && 8),
|
|
(t[n++] = 255 & i.compression),
|
|
(t[n++] = i.compression >> 8));
|
|
var l = new Date(null == i.mtime ? Date.now() : i.mtime),
|
|
f = l.getFullYear() - 1980;
|
|
if (
|
|
((f < 0 || f > 119) && A(10),
|
|
vt(
|
|
t,
|
|
n,
|
|
(f << 25) |
|
|
((l.getMonth() + 1) << 21) |
|
|
(l.getDate() << 16) |
|
|
(l.getHours() << 11) |
|
|
(l.getMinutes() << 5) |
|
|
(l.getSeconds() >> 1),
|
|
),
|
|
(n += 4),
|
|
-1 != u && (vt(t, n, i.crc), vt(t, n + 4, u < 0 ? -u - 2 : u), vt(t, n + 8, i.size)),
|
|
vt(t, n + 12, _),
|
|
vt(t, n + 14, c),
|
|
(n += 16),
|
|
null != s && (vt(t, n, h), vt(t, n + 6, i.attrs), vt(t, n + 10, s), (n += 14)),
|
|
t.set(r, n),
|
|
(n += _),
|
|
c)
|
|
)
|
|
for (var v in a) {
|
|
var w = a[v],
|
|
p = w.length;
|
|
(vt(t, n, +v), vt(t, n + 2, p), t.set(w, n + 4), (n += 4 + p));
|
|
}
|
|
return (h && (t.set(o, n), (n += h)), n);
|
|
},
|
|
an = function (t, n, i, r, e) {
|
|
(vt(t, n, 101010256), vt(t, n + 8, i), vt(t, n + 10, i), vt(t, n + 12, r), vt(t, n + 16, e));
|
|
},
|
|
hn = (function () {
|
|
function t(t) {
|
|
((this.filename = t), (this.c = V()), (this.size = 0), (this.compression = 0));
|
|
}
|
|
return (
|
|
(t.prototype.process = function (t, n) {
|
|
this.ondata(null, t, n);
|
|
}),
|
|
(t.prototype.push = function (t, n) {
|
|
(this.ondata || A(5),
|
|
this.c.p(t),
|
|
(this.size += t.length),
|
|
n && (this.crc = this.c.d()),
|
|
this.process(t, n || !1));
|
|
}),
|
|
t
|
|
);
|
|
})();
|
|
n.ZipPassThrough = hn;
|
|
var cn = (function () {
|
|
function t(t, n) {
|
|
var i = this;
|
|
(n || (n = {}),
|
|
hn.call(this, t),
|
|
(this.d = new bt(n, function (t, n) {
|
|
i.ondata(null, t, n);
|
|
})),
|
|
(this.compression = 8),
|
|
(this.flag = rn(n.level)));
|
|
}
|
|
return (
|
|
(t.prototype.process = function (t, n) {
|
|
try {
|
|
this.d.push(t, n);
|
|
} catch (t) {
|
|
this.ondata(t, null, n);
|
|
}
|
|
}),
|
|
(t.prototype.push = function (t, n) {
|
|
hn.prototype.push.call(this, t, n);
|
|
}),
|
|
t
|
|
);
|
|
})();
|
|
n.ZipDeflate = cn;
|
|
var ln = (function () {
|
|
function t(t, n) {
|
|
var i = this;
|
|
(n || (n = {}),
|
|
hn.call(this, t),
|
|
(this.d = new qt(n, function (t, n, r) {
|
|
i.ondata(t, n, r);
|
|
})),
|
|
(this.compression = 8),
|
|
(this.flag = rn(n.level)),
|
|
(this.terminate = this.d.terminate));
|
|
}
|
|
return (
|
|
(t.prototype.process = function (t, n) {
|
|
this.d.push(t, n);
|
|
}),
|
|
(t.prototype.push = function (t, n) {
|
|
hn.prototype.push.call(this, t, n);
|
|
}),
|
|
t
|
|
);
|
|
})();
|
|
n.AsyncZipDeflate = ln;
|
|
var vn = (function () {
|
|
function t(t) {
|
|
((this.ondata = t), (this.u = []), (this.d = 1));
|
|
}
|
|
return (
|
|
(t.prototype.add = function (t) {
|
|
var n = this;
|
|
if ((this.ondata || A(5), 2 & this.d)) this.ondata(A(4 + 8 * (1 & this.d), 0, 1), null, !1);
|
|
else {
|
|
var i = tn(t.filename),
|
|
r = i.length,
|
|
u = t.comment,
|
|
s = u && tn(u),
|
|
o = r != t.filename.length || (s && u.length != s.length),
|
|
_ = r + on(t.extra) + 30;
|
|
r > 65535 && this.ondata(A(11, 0, 1), null, !1);
|
|
var a = new e(_);
|
|
_n(a, 0, t, i, o, -1);
|
|
var h = [a],
|
|
c = function () {
|
|
for (var t = 0, i = h; t < i.length; t++) {
|
|
var r = i[t];
|
|
n.ondata(null, r, !1);
|
|
}
|
|
h = [];
|
|
},
|
|
l = this.d;
|
|
this.d = 0;
|
|
var f = this.u.length,
|
|
v = X(t, {
|
|
f: i,
|
|
u: o,
|
|
o: s,
|
|
t: function () {
|
|
t.terminate && t.terminate();
|
|
},
|
|
r: function () {
|
|
if ((c(), l)) {
|
|
var t = n.u[f + 1];
|
|
t ? t.r() : (n.d = 1);
|
|
}
|
|
l = 1;
|
|
},
|
|
}),
|
|
w = 0;
|
|
((t.ondata = function (i, r, u) {
|
|
if (i) (n.ondata(i, r, u), n.terminate());
|
|
else if (((w += r.length), h.push(r), u)) {
|
|
var s = new e(16);
|
|
(vt(s, 0, 134695760),
|
|
vt(s, 4, t.crc),
|
|
vt(s, 8, w),
|
|
vt(s, 12, t.size),
|
|
h.push(s),
|
|
(v.c = w),
|
|
(v.b = _ + w + 16),
|
|
(v.crc = t.crc),
|
|
(v.size = t.size),
|
|
l && v.r(),
|
|
(l = 1));
|
|
} else l && c();
|
|
}),
|
|
this.u.push(v));
|
|
}
|
|
}),
|
|
(t.prototype.end = function () {
|
|
var t = this;
|
|
2 & this.d
|
|
? this.ondata(A(4 + 8 * (1 & this.d), 0, 1), null, !0)
|
|
: (this.d
|
|
? this.e()
|
|
: this.u.push({
|
|
r: function () {
|
|
1 & t.d && (t.u.splice(-1, 1), t.e());
|
|
},
|
|
t: function () {},
|
|
}),
|
|
(this.d = 3));
|
|
}),
|
|
(t.prototype.e = function () {
|
|
for (var t = 0, n = 0, i = 0, r = 0, u = this.u; r < u.length; r++)
|
|
i += 46 + (a = u[r]).f.length + on(a.extra) + (a.o ? a.o.length : 0);
|
|
for (var s = new e(i + 22), o = 0, _ = this.u; o < _.length; o++) {
|
|
var a = _[o];
|
|
(_n(s, t, a, a.f, a.u, -a.c - 2, n, a.o),
|
|
(t += 46 + a.f.length + on(a.extra) + (a.o ? a.o.length : 0)),
|
|
(n += a.b));
|
|
}
|
|
(an(s, t, this.u.length, i, n), this.ondata(null, s, !0), (this.d = 2));
|
|
}),
|
|
(t.prototype.terminate = function () {
|
|
for (var t = 0, n = this.u; t < n.length; t++) n[t].t();
|
|
this.d = 2;
|
|
}),
|
|
t
|
|
);
|
|
})();
|
|
((n.Zip = vn),
|
|
(n.zip = function (t, n, i) {
|
|
(i || ((i = n), (n = {})), "function" != typeof i && A(7));
|
|
var r = {};
|
|
Vt(t, "", r, n);
|
|
var u = Object.keys(r),
|
|
s = u.length,
|
|
o = 0,
|
|
_ = 0,
|
|
a = s,
|
|
h = new Array(s),
|
|
c = [],
|
|
l = function () {
|
|
for (var t = 0; t < c.length; ++t) c[t]();
|
|
},
|
|
f = function (t, n) {
|
|
mn(function () {
|
|
i(t, n);
|
|
});
|
|
};
|
|
mn(function () {
|
|
f = i;
|
|
});
|
|
var v = function () {
|
|
var t = new e(_ + 22),
|
|
n = o,
|
|
i = _ - o;
|
|
_ = 0;
|
|
for (var r = 0; r < a; ++r) {
|
|
var u = h[r];
|
|
try {
|
|
var s = u.c.length;
|
|
_n(t, _, u, u.f, u.u, s);
|
|
var c = 30 + u.f.length + on(u.extra),
|
|
l = _ + c;
|
|
(t.set(u.c, l),
|
|
_n(t, o, u, u.f, u.u, s, _, u.m),
|
|
(o += 16 + c + (u.m ? u.m.length : 0)),
|
|
(_ = l + s));
|
|
} catch (t) {
|
|
return f(t, null);
|
|
}
|
|
}
|
|
(an(t, o, h.length, i, n), f(null, t));
|
|
};
|
|
s || v();
|
|
for (
|
|
var w = function (t) {
|
|
var n = u[t],
|
|
i = r[n],
|
|
e = i[0],
|
|
a = i[1],
|
|
w = V(),
|
|
p = e.length;
|
|
w.p(e);
|
|
var d = tn(n),
|
|
g = d.length,
|
|
m = a.comment,
|
|
y = m && tn(m),
|
|
k = y && y.length,
|
|
b = on(a.extra),
|
|
q = 0 == a.level ? 0 : 8,
|
|
$ = function (i, r) {
|
|
if (i) (l(), f(i, null));
|
|
else {
|
|
var e = r.length;
|
|
((h[t] = X(a, {
|
|
size: p,
|
|
crc: w.d(),
|
|
c: r,
|
|
f: d,
|
|
m: y,
|
|
u: g != n.length || (y && m.length != k),
|
|
compression: q,
|
|
})),
|
|
(o += 30 + g + b + e),
|
|
(_ += 76 + 2 * (g + b) + (k || 0) + e),
|
|
--s || v());
|
|
}
|
|
};
|
|
if ((g > 65535 && $(A(11, 0, 1), null), q))
|
|
if (p < 16e4)
|
|
try {
|
|
$(null, jt(e, a));
|
|
} catch (t) {
|
|
$(t, null);
|
|
}
|
|
else c.push($t(e, a, $));
|
|
else $(null, e);
|
|
},
|
|
p = 0;
|
|
p < a;
|
|
++p
|
|
)
|
|
w(p);
|
|
return l;
|
|
}),
|
|
(n.zipSync = function (t, n) {
|
|
n || (n = {});
|
|
var i = {},
|
|
r = [];
|
|
Vt(t, "", i, n);
|
|
var u = 0,
|
|
s = 0;
|
|
for (var o in i) {
|
|
var _ = i[o],
|
|
a = _[0],
|
|
h = _[1],
|
|
c = 0 == h.level ? 0 : 8,
|
|
l = ($ = tn(o)).length,
|
|
f = h.comment,
|
|
v = f && tn(f),
|
|
w = v && v.length,
|
|
p = on(h.extra);
|
|
l > 65535 && A(11);
|
|
var d = c ? jt(a, h) : a,
|
|
g = d.length,
|
|
m = V();
|
|
(m.p(a),
|
|
r.push(
|
|
X(h, {
|
|
size: a.length,
|
|
crc: m.d(),
|
|
c: d,
|
|
f: $,
|
|
m: v,
|
|
u: l != o.length || (v && f.length != w),
|
|
o: u,
|
|
compression: c,
|
|
}),
|
|
),
|
|
(u += 30 + l + p + g),
|
|
(s += 76 + 2 * (l + p) + (w || 0) + g));
|
|
}
|
|
for (var y = new e(s + 22), k = u, b = s - u, q = 0; q < r.length; ++q) {
|
|
var $ = r[q];
|
|
_n(y, $.o, $, $.f, $.u, $.c.length);
|
|
var j = 30 + $.f.length + on($.extra);
|
|
(y.set($.c, $.o + j),
|
|
_n(y, u, $, $.f, $.u, $.c.length, $.o, $.m),
|
|
(u += 16 + j + ($.m ? $.m.length : 0)));
|
|
}
|
|
return (an(y, u, r.length, b, k), y);
|
|
}));
|
|
var wn = (function () {
|
|
function t() {}
|
|
return (
|
|
(t.prototype.push = function (t, n) {
|
|
this.ondata(null, t, n);
|
|
}),
|
|
(t.compression = 0),
|
|
t
|
|
);
|
|
})();
|
|
n.UnzipPassThrough = wn;
|
|
var pn = (function () {
|
|
function t() {
|
|
var t = this;
|
|
this.i = new xt(function (n, i) {
|
|
t.ondata(null, n, i);
|
|
});
|
|
}
|
|
return (
|
|
(t.prototype.push = function (t, n) {
|
|
try {
|
|
this.i.push(t, n);
|
|
} catch (t) {
|
|
this.ondata(t, null, n);
|
|
}
|
|
}),
|
|
(t.compression = 8),
|
|
t
|
|
);
|
|
})();
|
|
n.UnzipInflate = pn;
|
|
var dn = (function () {
|
|
function t(t, n) {
|
|
var i = this;
|
|
n < 32e4
|
|
? (this.i = new xt(function (t, n) {
|
|
i.ondata(null, t, n);
|
|
}))
|
|
: ((this.i = new zt(function (t, n, r) {
|
|
i.ondata(t, n, r);
|
|
})),
|
|
(this.terminate = this.i.terminate));
|
|
}
|
|
return (
|
|
(t.prototype.push = function (t, n) {
|
|
(this.i.terminate && (t = T(t, 0)), this.i.push(t, n));
|
|
}),
|
|
(t.compression = 8),
|
|
t
|
|
);
|
|
})();
|
|
n.AsyncUnzipInflate = dn;
|
|
var gn = (function () {
|
|
function t(t) {
|
|
((this.onfile = t), (this.k = []), (this.o = { 0: wn }), (this.p = G));
|
|
}
|
|
return (
|
|
(t.prototype.push = function (t, n) {
|
|
var i = this;
|
|
if ((this.onfile || A(5), this.p || A(4), this.c > 0)) {
|
|
var r = Math.min(this.c, t.length),
|
|
u = t.subarray(0, r);
|
|
if (
|
|
((this.c -= r), this.d ? this.d.push(u, !this.c) : this.k[0].push(u), (t = t.subarray(r)).length)
|
|
)
|
|
return this.push(t, n);
|
|
} else {
|
|
var s = 0,
|
|
o = 0,
|
|
_ = void 0,
|
|
a = void 0;
|
|
this.p.length
|
|
? t.length
|
|
? ((a = new e(this.p.length + t.length)).set(this.p), a.set(t, this.p.length))
|
|
: (a = this.p)
|
|
: (a = t);
|
|
for (
|
|
var h = a.length,
|
|
c = this.c,
|
|
l = c && this.d,
|
|
f = function () {
|
|
var t,
|
|
n = lt(a, o);
|
|
if (67324752 == n) {
|
|
((s = 1), (_ = o), (v.d = null), (v.c = 0));
|
|
var r = ct(a, o + 6),
|
|
e = ct(a, o + 8),
|
|
u = 2048 & r,
|
|
l = 8 & r,
|
|
f = ct(a, o + 26),
|
|
w = ct(a, o + 28);
|
|
if (h > o + 30 + f + w) {
|
|
var p = [];
|
|
(v.k.unshift(p), (s = 2));
|
|
var d,
|
|
g = lt(a, o + 18),
|
|
m = lt(a, o + 22),
|
|
y = nn(a.subarray(o + 30, (o += 30 + f)), !u);
|
|
(4294967295 == g ? ((t = l ? [-2] : sn(a, o)), (g = t[0]), (m = t[1])) : l && (g = -1),
|
|
(o += w),
|
|
(v.c = g));
|
|
var k = {
|
|
name: y,
|
|
compression: e,
|
|
start: function () {
|
|
if ((k.ondata || A(5), g)) {
|
|
var t = i.o[e];
|
|
(t || k.ondata(A(14, "unknown compression type " + e, 1), null, !1),
|
|
((d = g < 0 ? new t(y) : new t(y, g, m)).ondata = function (t, n, i) {
|
|
k.ondata(t, n, i);
|
|
}));
|
|
for (var n = 0, r = p; n < r.length; n++) {
|
|
var u = r[n];
|
|
d.push(u, !1);
|
|
}
|
|
i.k[0] == p && i.c ? (i.d = d) : d.push(G, !0);
|
|
} else k.ondata(null, G, !0);
|
|
},
|
|
terminate: function () {
|
|
d && d.terminate && d.terminate();
|
|
},
|
|
};
|
|
(g >= 0 && ((k.size = g), (k.originalSize = m)), v.onfile(k));
|
|
}
|
|
return "break";
|
|
}
|
|
if (c) {
|
|
if (134695760 == n) return ((_ = o += 12 + (-2 == c && 8)), (s = 3), (v.c = 0), "break");
|
|
if (33639248 == n) return ((_ = o -= 4), (s = 3), (v.c = 0), "break");
|
|
}
|
|
},
|
|
v = this;
|
|
o < h - 4 && "break" !== f();
|
|
++o
|
|
);
|
|
if (((this.p = G), c < 0)) {
|
|
var w = s
|
|
? a.subarray(0, _ - 12 - (-2 == c && 8) - (134695760 == lt(a, _ - 16) && 4))
|
|
: a.subarray(0, o);
|
|
l ? l.push(w, !!s) : this.k[+(2 == s)].push(w);
|
|
}
|
|
if (2 & s) return this.push(a.subarray(o), n);
|
|
this.p = a.subarray(o);
|
|
}
|
|
n && (this.c && A(13), (this.p = null));
|
|
}),
|
|
(t.prototype.register = function (t) {
|
|
this.o[t.compression] = t;
|
|
}),
|
|
t
|
|
);
|
|
})();
|
|
n.Unzip = gn;
|
|
var mn =
|
|
"function" == typeof queueMicrotask
|
|
? queueMicrotask
|
|
: "function" == typeof setTimeout
|
|
? setTimeout
|
|
: function (t) {
|
|
t();
|
|
};
|
|
((n.unzip = function (t, n, i) {
|
|
(i || ((i = n), (n = {})), "function" != typeof i && A(7));
|
|
var r = [],
|
|
u = function () {
|
|
for (var t = 0; t < r.length; ++t) r[t]();
|
|
},
|
|
s = {},
|
|
o = function (t, n) {
|
|
mn(function () {
|
|
i(t, n);
|
|
});
|
|
};
|
|
mn(function () {
|
|
o = i;
|
|
});
|
|
for (var _ = t.length - 22; 101010256 != lt(t, _); --_)
|
|
if (!_ || t.length - _ > 65558) return (o(A(13, 0, 1), null), u);
|
|
var a = ct(t, _ + 8);
|
|
if (a) {
|
|
var h = a,
|
|
c = lt(t, _ + 16),
|
|
l = 4294967295 == c || 65535 == h;
|
|
if (l) {
|
|
var f = lt(t, _ - 12);
|
|
(l = 101075792 == lt(t, f)) && ((h = a = lt(t, f + 32)), (c = lt(t, f + 48)));
|
|
}
|
|
for (
|
|
var v = n && n.filter,
|
|
w = function (n) {
|
|
var i = un(t, c, l),
|
|
_ = i[0],
|
|
h = i[1],
|
|
f = i[2],
|
|
w = i[3],
|
|
p = i[4],
|
|
d = i[5],
|
|
g = en(t, d);
|
|
c = p;
|
|
var m = function (t, n) {
|
|
t ? (u(), o(t, null)) : (n && (s[w] = n), --a || o(null, s));
|
|
};
|
|
if (!v || v({ name: w, size: h, originalSize: f, compression: _ }))
|
|
if (_)
|
|
if (8 == _) {
|
|
var y = t.subarray(g, g + h);
|
|
if (h < 32e4)
|
|
try {
|
|
m(null, Ct(y, { out: new e(f) }));
|
|
} catch (t) {
|
|
m(t, null);
|
|
}
|
|
else r.push(St(y, { size: f }, m));
|
|
} else m(A(14, "unknown compression type " + _, 1), null);
|
|
else m(null, T(t, g, g + h));
|
|
else m(null, null);
|
|
},
|
|
p = 0;
|
|
p < h;
|
|
++p
|
|
)
|
|
w();
|
|
} else o(null, {});
|
|
return u;
|
|
}),
|
|
(n.unzipSync = function (t, n) {
|
|
for (var i = {}, r = t.length - 22; 101010256 != lt(t, r); --r) (!r || t.length - r > 65558) && A(13);
|
|
var u = ct(t, r + 8);
|
|
if (!u) return {};
|
|
var s = lt(t, r + 16),
|
|
o = 4294967295 == s || 65535 == u;
|
|
if (o) {
|
|
var _ = lt(t, r - 12);
|
|
(o = 101075792 == lt(t, _)) && ((u = lt(t, _ + 32)), (s = lt(t, _ + 48)));
|
|
}
|
|
for (var a = n && n.filter, h = 0; h < u; ++h) {
|
|
var c = un(t, s, o),
|
|
l = c[0],
|
|
f = c[1],
|
|
v = c[2],
|
|
w = c[3],
|
|
p = c[4],
|
|
d = c[5],
|
|
g = en(t, d);
|
|
((s = p),
|
|
(a && !a({ name: w, size: f, originalSize: v, compression: l })) ||
|
|
(l
|
|
? 8 == l
|
|
? (i[w] = Ct(t.subarray(g, g + f), { out: new e(v) }))
|
|
: A(14, "unknown compression type " + l)
|
|
: (i[w] = T(t, g, g + f))));
|
|
}
|
|
return i;
|
|
}));
|
|
};
|