can-can-word-bug
Version:
can-can-word-bug 是一个 TS 编写的工具库
2,974 lines • 256 kB
JavaScript
import { g as Es } from "../_commonjsHelpers-BkfeUUK-.js";
const Rt = 15, Sn = 30, An = 19, Ss = 29, Xt = 256, Mn = Xt + 1 + Ss, ti = 2 * Mn + 1, bt = 256, As = 7, ni = 16, ii = 17, ai = 18, ln = 8 * 2, $t = -1, Ts = 1, Lt = 2, Rs = 0, ut = 0, si = 1, Ds = 3, Se = 4, Ue = 0, na = 1, jt = 2, Pe = -2, Cs = -3, ft = -5;
function nn(t) {
return an(t.map(([n, e]) => new Array(n).fill(e, 0, n)));
}
function an(t) {
return t.reduce((n, e) => n.concat(Array.isArray(e) ? an(e) : e), []);
}
const ri = [0, 1, 2, 3].concat(...nn([
[2, 4],
[2, 5],
[4, 6],
[4, 7],
[8, 8],
[8, 9],
[16, 10],
[16, 11],
[32, 12],
[32, 13],
[64, 14],
[64, 15],
[2, 0],
[1, 16],
[1, 17],
[2, 18],
[2, 19],
[4, 20],
[4, 21],
[8, 22],
[8, 23],
[16, 24],
[16, 25],
[32, 26],
[32, 27],
[64, 28],
[64, 29]
]));
function ie() {
const t = this;
function n(a) {
const s = t.dyn_tree, r = t.stat_desc.static_tree, l = t.stat_desc.extra_bits, o = t.stat_desc.extra_base, x = t.stat_desc.max_length;
let f, u, m, g, R, p, c = 0;
for (g = 0; g <= Rt; g++)
a.bl_count[g] = 0;
for (s[a.heap[a.heap_max] * 2 + 1] = 0, f = a.heap_max + 1; f < ti; f++)
u = a.heap[f], g = s[s[u * 2 + 1] * 2 + 1] + 1, g > x && (g = x, c++), s[u * 2 + 1] = g, !(u > t.max_code) && (a.bl_count[g]++, R = 0, u >= o && (R = l[u - o]), p = s[u * 2], a.opt_len += p * (g + R), r && (a.static_len += p * (r[u * 2 + 1] + R)));
if (c !== 0) {
do {
for (g = x - 1; a.bl_count[g] === 0; )
g--;
a.bl_count[g]--, a.bl_count[g + 1] += 2, a.bl_count[x]--, c -= 2;
} while (c > 0);
for (g = x; g !== 0; g--)
for (u = a.bl_count[g]; u !== 0; )
m = a.heap[--f], !(m > t.max_code) && (s[m * 2 + 1] != g && (a.opt_len += (g - s[m * 2 + 1]) * s[m * 2], s[m * 2 + 1] = g), u--);
}
}
function e(a, s) {
let r = 0;
do
r |= a & 1, a >>>= 1, r <<= 1;
while (--s > 0);
return r >>> 1;
}
function i(a, s, r) {
const l = [];
let o = 0, x, f, u;
for (x = 1; x <= Rt; x++)
l[x] = o = o + r[x - 1] << 1;
for (f = 0; f <= s; f++)
u = a[f * 2 + 1], u !== 0 && (a[f * 2] = e(l[u]++, u));
}
t.build_tree = function(a) {
const s = t.dyn_tree, r = t.stat_desc.static_tree, l = t.stat_desc.elems;
let o, x, f = -1, u;
for (a.heap_len = 0, a.heap_max = ti, o = 0; o < l; o++)
s[o * 2] !== 0 ? (a.heap[++a.heap_len] = f = o, a.depth[o] = 0) : s[o * 2 + 1] = 0;
for (; a.heap_len < 2; )
u = a.heap[++a.heap_len] = f < 2 ? ++f : 0, s[u * 2] = 1, a.depth[u] = 0, a.opt_len--, r && (a.static_len -= r[u * 2 + 1]);
for (t.max_code = f, o = Math.floor(a.heap_len / 2); o >= 1; o--)
a.pqdownheap(s, o);
u = l;
do
o = a.heap[1], a.heap[1] = a.heap[a.heap_len--], a.pqdownheap(s, 1), x = a.heap[1], a.heap[--a.heap_max] = o, a.heap[--a.heap_max] = x, s[u * 2] = s[o * 2] + s[x * 2], a.depth[u] = Math.max(a.depth[o], a.depth[x]) + 1, s[o * 2 + 1] = s[x * 2 + 1] = u, a.heap[1] = u++, a.pqdownheap(s, 1);
while (a.heap_len >= 2);
a.heap[--a.heap_max] = a.heap[1], n(a), i(s, t.max_code, a.bl_count);
};
}
ie._length_code = [0, 1, 2, 3, 4, 5, 6, 7].concat(...nn([
[2, 8],
[2, 9],
[2, 10],
[2, 11],
[4, 12],
[4, 13],
[4, 14],
[4, 15],
[8, 16],
[8, 17],
[8, 18],
[8, 19],
[16, 20],
[16, 21],
[16, 22],
[16, 23],
[32, 24],
[32, 25],
[32, 26],
[31, 27],
[1, 28]
]));
ie.base_length = [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 20, 24, 28, 32, 40, 48, 56, 64, 80, 96, 112, 128, 160, 192, 224, 0];
ie.base_dist = [
0,
1,
2,
3,
4,
6,
8,
12,
16,
24,
32,
48,
64,
96,
128,
192,
256,
384,
512,
768,
1024,
1536,
2048,
3072,
4096,
6144,
8192,
12288,
16384,
24576
];
ie.d_code = function(t) {
return t < 256 ? ri[t] : ri[256 + (t >>> 7)];
};
ie.extra_lbits = [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];
ie.extra_dbits = [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];
ie.extra_blbits = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7];
ie.bl_order = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
function he(t, n, e, i, a) {
const s = this;
s.static_tree = t, s.extra_bits = n, s.extra_base = e, s.elems = i, s.max_length = a;
}
const Fs = [
12,
140,
76,
204,
44,
172,
108,
236,
28,
156,
92,
220,
60,
188,
124,
252,
2,
130,
66,
194,
34,
162,
98,
226,
18,
146,
82,
210,
50,
178,
114,
242,
10,
138,
74,
202,
42,
170,
106,
234,
26,
154,
90,
218,
58,
186,
122,
250,
6,
134,
70,
198,
38,
166,
102,
230,
22,
150,
86,
214,
54,
182,
118,
246,
14,
142,
78,
206,
46,
174,
110,
238,
30,
158,
94,
222,
62,
190,
126,
254,
1,
129,
65,
193,
33,
161,
97,
225,
17,
145,
81,
209,
49,
177,
113,
241,
9,
137,
73,
201,
41,
169,
105,
233,
25,
153,
89,
217,
57,
185,
121,
249,
5,
133,
69,
197,
37,
165,
101,
229,
21,
149,
85,
213,
53,
181,
117,
245,
13,
141,
77,
205,
45,
173,
109,
237,
29,
157,
93,
221,
61,
189,
125,
253,
19,
275,
147,
403,
83,
339,
211,
467,
51,
307,
179,
435,
115,
371,
243,
499,
11,
267,
139,
395,
75,
331,
203,
459,
43,
299,
171,
427,
107,
363,
235,
491,
27,
283,
155,
411,
91,
347,
219,
475,
59,
315,
187,
443,
123,
379,
251,
507,
7,
263,
135,
391,
71,
327,
199,
455,
39,
295,
167,
423,
103,
359,
231,
487,
23,
279,
151,
407,
87,
343,
215,
471,
55,
311,
183,
439,
119,
375,
247,
503,
15,
271,
143,
399,
79,
335,
207,
463,
47,
303,
175,
431,
111,
367,
239,
495,
31,
287,
159,
415,
95,
351,
223,
479,
63,
319,
191,
447,
127,
383,
255,
511,
0,
64,
32,
96,
16,
80,
48,
112,
8,
72,
40,
104,
24,
88,
56,
120,
4,
68,
36,
100,
20,
84,
52,
116,
3,
131,
67,
195,
35,
163,
99,
227
], Is = nn([[144, 8], [112, 9], [24, 7], [8, 8]]);
he.static_ltree = an(Fs.map((t, n) => [t, Is[n]]));
const Os = [0, 16, 8, 24, 4, 20, 12, 28, 2, 18, 10, 26, 6, 22, 14, 30, 1, 17, 9, 25, 5, 21, 13, 29, 3, 19, 11, 27, 7, 23], Ls = nn([[30, 5]]);
he.static_dtree = an(Os.map((t, n) => [t, Ls[n]]));
he.static_l_desc = new he(he.static_ltree, ie.extra_lbits, Xt + 1, Mn, Rt);
he.static_d_desc = new he(he.static_dtree, ie.extra_dbits, 0, Sn, Rt);
he.static_bl_desc = new he(null, ie.extra_blbits, 0, An, As);
const js = 9, Ns = 8;
function qe(t, n, e, i, a) {
const s = this;
s.good_length = t, s.max_lazy = n, s.nice_length = e, s.max_chain = i, s.func = a;
}
const ia = 0, Ht = 1, lt = 2, Ne = [
new qe(0, 0, 0, 0, ia),
new qe(4, 4, 8, 4, Ht),
new qe(4, 5, 16, 8, Ht),
new qe(4, 6, 32, 32, Ht),
new qe(4, 4, 16, 16, lt),
new qe(8, 16, 32, 32, lt),
new qe(8, 16, 128, 128, lt),
new qe(8, 32, 128, 256, lt),
new qe(32, 128, 258, 1024, lt),
new qe(32, 258, 258, 4096, lt)
], Nt = [
"need dictionary",
// Z_NEED_DICT
// 2
"stream end",
// Z_STREAM_END 1
"",
// Z_OK 0
"",
// Z_ERRNO (-1)
"stream error",
// Z_STREAM_ERROR (-2)
"data error",
// Z_DATA_ERROR (-3)
"",
// Z_MEM_ERROR (-4)
"buffer error",
// Z_BUF_ERROR (-5)
"",
// Z_VERSION_ERROR (-6)
""
], Ce = 0, Ut = 1, _t = 2, Pt = 3, Us = 32, dn = 42, Mt = 113, yt = 666, pn = 8, Ps = 0, fn = 1, Ms = 2, se = 3, Zt = 258, Re = Zt + se + 1;
function oi(t, n, e, i) {
const a = t[n * 2], s = t[e * 2];
return a < s || a == s && i[n] <= i[e];
}
function qs() {
const t = this;
let n, e, i, a, s, r, l, o, x, f, u, m, g, R, p, c, d, v, h, E, w, b, _, y, T, S, k, L, C, U, O, j, z;
const q = new ie(), ee = new ie(), P = new ie();
t.depth = [];
let te, M, B, fe, H, X;
t.bl_count = [], t.heap = [], O = [], j = [], z = [];
function oe() {
x = 2 * s, u[g - 1] = 0;
for (let A = 0; A < g - 1; A++)
u[A] = 0;
S = Ne[k].max_lazy, C = Ne[k].good_length, U = Ne[k].nice_length, T = Ne[k].max_chain, w = 0, d = 0, _ = 0, v = y = se - 1, E = 0, m = 0;
}
function ne() {
let A;
for (A = 0; A < Mn; A++)
O[A * 2] = 0;
for (A = 0; A < Sn; A++)
j[A * 2] = 0;
for (A = 0; A < An; A++)
z[A * 2] = 0;
O[bt * 2] = 1, t.opt_len = t.static_len = 0, M = B = 0;
}
function G() {
q.dyn_tree = O, q.stat_desc = he.static_l_desc, ee.dyn_tree = j, ee.stat_desc = he.static_d_desc, P.dyn_tree = z, P.stat_desc = he.static_bl_desc, H = 0, X = 0, fe = 8, ne();
}
t.pqdownheap = function(A, F) {
const D = t.heap, I = D[F];
let N = F << 1;
for (; N <= t.heap_len && (N < t.heap_len && oi(A, D[N + 1], D[N], t.depth) && N++, !oi(A, I, D[N], t.depth)); )
D[F] = D[N], F = N, N <<= 1;
D[F] = I;
};
function Ie(A, F) {
let D = -1, I, N = A[0 * 2 + 1], W = 0, $ = 7, ye = 4;
N === 0 && ($ = 138, ye = 3), A[(F + 1) * 2 + 1] = 65535;
for (let je = 0; je <= F; je++)
I = N, N = A[(je + 1) * 2 + 1], !(++W < $ && I == N) && (W < ye ? z[I * 2] += W : I !== 0 ? (I != D && z[I * 2]++, z[ni * 2]++) : W <= 10 ? z[ii * 2]++ : z[ai * 2]++, W = 0, D = I, N === 0 ? ($ = 138, ye = 3) : I == N ? ($ = 6, ye = 3) : ($ = 7, ye = 4));
}
function it() {
let A;
for (Ie(O, q.max_code), Ie(j, ee.max_code), P.build_tree(t), A = An - 1; A >= 3 && z[ie.bl_order[A] * 2 + 1] === 0; A--)
;
return t.opt_len += 3 * (A + 1) + 5 + 5 + 4, A;
}
function we(A) {
t.pending_buf[t.pending++] = A;
}
function Te(A) {
we(A & 255), we(A >>> 8 & 255);
}
function He(A) {
we(A >> 8 & 255), we(A & 255 & 255);
}
function ce(A, F) {
let D;
const I = F;
X > ln - I ? (D = A, H |= D << X & 65535, Te(H), H = D >>> ln - X, X += I - ln) : (H |= A << X & 65535, X += I);
}
function ue(A, F) {
const D = A * 2;
ce(F[D] & 65535, F[D + 1] & 65535);
}
function Ze(A, F) {
let D, I = -1, N, W = A[0 * 2 + 1], $ = 0, ye = 7, je = 4;
for (W === 0 && (ye = 138, je = 3), D = 0; D <= F; D++)
if (N = W, W = A[(D + 1) * 2 + 1], !(++$ < ye && N == W)) {
if ($ < je)
do
ue(N, z);
while (--$ !== 0);
else N !== 0 ? (N != I && (ue(N, z), $--), ue(ni, z), ce($ - 3, 2)) : $ <= 10 ? (ue(ii, z), ce($ - 3, 3)) : (ue(ai, z), ce($ - 11, 7));
$ = 0, I = N, W === 0 ? (ye = 138, je = 3) : N == W ? (ye = 6, je = 3) : (ye = 7, je = 4);
}
}
function at(A, F, D) {
let I;
for (ce(A - 257, 5), ce(F - 1, 5), ce(D - 4, 4), I = 0; I < D; I++)
ce(z[ie.bl_order[I] * 2 + 1], 3);
Ze(O, A - 1), Ze(j, F - 1);
}
function Oe() {
X == 16 ? (Te(H), H = 0, X = 0) : X >= 8 && (we(H & 255), H >>>= 8, X -= 8);
}
function Ve() {
ce(fn << 1, 3), ue(bt, he.static_ltree), Oe(), 1 + fe + 10 - X < 9 && (ce(fn << 1, 3), ue(bt, he.static_ltree), Oe()), fe = 7;
}
function be(A, F) {
let D, I, N;
if (t.dist_buf[M] = A, t.lc_buf[M] = F & 255, M++, A === 0 ? O[F * 2]++ : (B++, A--, O[(ie._length_code[F] + Xt + 1) * 2]++, j[ie.d_code(A) * 2]++), !(M & 8191) && k > 2) {
for (D = M * 8, I = w - d, N = 0; N < Sn; N++)
D += j[N * 2] * (5 + ie.extra_dbits[N]);
if (D >>>= 3, B < Math.floor(M / 2) && D < Math.floor(I / 2))
return !0;
}
return M == te - 1;
}
function Le(A, F) {
let D, I, N = 0, W, $;
if (M !== 0)
do
D = t.dist_buf[N], I = t.lc_buf[N], N++, D === 0 ? ue(I, A) : (W = ie._length_code[I], ue(W + Xt + 1, A), $ = ie.extra_lbits[W], $ !== 0 && (I -= ie.base_length[W], ce(I, $)), D--, W = ie.d_code(D), ue(W, F), $ = ie.extra_dbits[W], $ !== 0 && (D -= ie.base_dist[W], ce(D, $)));
while (N < M);
ue(bt, A), fe = A[bt * 2 + 1];
}
function st() {
X > 8 ? Te(H) : X > 0 && we(H & 255), H = 0, X = 0;
}
function rt(A, F, D) {
st(), fe = 8, Te(F), Te(~F), t.pending_buf.set(o.subarray(A, A + F), t.pending), t.pending += F;
}
function wt(A, F, D) {
ce((Ps << 1) + (D ? 1 : 0), 3), rt(A, F);
}
function on(A, F, D) {
let I, N, W = 0;
k > 0 ? (q.build_tree(t), ee.build_tree(t), W = it(), I = t.opt_len + 3 + 7 >>> 3, N = t.static_len + 3 + 7 >>> 3, N <= I && (I = N)) : I = N = F + 5, F + 4 <= I && A != -1 ? wt(A, F, D) : N == I ? (ce((fn << 1) + (D ? 1 : 0), 3), Le(he.static_ltree, he.static_dtree)) : (ce((Ms << 1) + (D ? 1 : 0), 3), at(q.max_code + 1, ee.max_code + 1, W + 1), Le(O, j)), ne(), D && st();
}
function Me(A) {
on(d >= 0 ? d : -1, w - d, A), d = w, n.flush_pending();
}
function ot() {
let A, F, D, I;
do {
if (I = x - _ - w, I === 0 && w === 0 && _ === 0)
I = s;
else if (I == -1)
I--;
else if (w >= s + s - Re) {
o.set(o.subarray(s, s + s), 0), b -= s, w -= s, d -= s, A = g, D = A;
do
F = u[--D] & 65535, u[D] = F >= s ? F - s : 0;
while (--A !== 0);
A = s, D = A;
do
F = f[--D] & 65535, f[D] = F >= s ? F - s : 0;
while (--A !== 0);
I += s;
}
if (n.avail_in === 0)
return;
A = n.read_buf(o, w + _, I), _ += A, _ >= se && (m = o[w] & 255, m = (m << c ^ o[w + 1] & 255) & p);
} while (_ < Re && n.avail_in !== 0);
}
function bs(A) {
let F = 65535, D;
for (F > i - 5 && (F = i - 5); ; ) {
if (_ <= 1) {
if (ot(), _ === 0 && A == ut)
return Ce;
if (_ === 0)
break;
}
if (w += _, _ = 0, D = d + F, (w === 0 || w >= D) && (_ = w - D, w = D, Me(!1), n.avail_out === 0) || w - d >= s - Re && (Me(!1), n.avail_out === 0))
return Ce;
}
return Me(A == Se), n.avail_out === 0 ? A == Se ? _t : Ce : A == Se ? Pt : Ut;
}
function Jn(A) {
let F = T, D = w, I, N, W = y;
const $ = w > s - Re ? w - (s - Re) : 0;
let ye = U;
const je = l, cn = w + Zt;
let Qn = o[D + W - 1], ei = o[D + W];
y >= C && (F >>= 2), ye > _ && (ye = _);
do
if (I = A, !(o[I + W] != ei || o[I + W - 1] != Qn || o[I] != o[D] || o[++I] != o[D + 1])) {
D += 2, I++;
do
;
while (o[++D] == o[++I] && o[++D] == o[++I] && o[++D] == o[++I] && o[++D] == o[++I] && o[++D] == o[++I] && o[++D] == o[++I] && o[++D] == o[++I] && o[++D] == o[++I] && D < cn);
if (N = Zt - (cn - D), D = cn - Zt, N > W) {
if (b = A, W = N, N >= ye)
break;
Qn = o[D + W - 1], ei = o[D + W];
}
}
while ((A = f[A & je] & 65535) > $ && --F !== 0);
return W <= _ ? W : _;
}
function _s(A) {
let F = 0, D;
for (; ; ) {
if (_ < Re) {
if (ot(), _ < Re && A == ut)
return Ce;
if (_ === 0)
break;
}
if (_ >= se && (m = (m << c ^ o[w + (se - 1)] & 255) & p, F = u[m] & 65535, f[w & l] = u[m], u[m] = w), F !== 0 && (w - F & 65535) <= s - Re && L != Lt && (v = Jn(F)), v >= se)
if (D = be(w - b, v - se), _ -= v, v <= S && _ >= se) {
v--;
do
w++, m = (m << c ^ o[w + (se - 1)] & 255) & p, F = u[m] & 65535, f[w & l] = u[m], u[m] = w;
while (--v !== 0);
w++;
} else
w += v, v = 0, m = o[w] & 255, m = (m << c ^ o[w + 1] & 255) & p;
else
D = be(0, o[w] & 255), _--, w++;
if (D && (Me(!1), n.avail_out === 0))
return Ce;
}
return Me(A == Se), n.avail_out === 0 ? A == Se ? _t : Ce : A == Se ? Pt : Ut;
}
function ys(A) {
let F = 0, D, I;
for (; ; ) {
if (_ < Re) {
if (ot(), _ < Re && A == ut)
return Ce;
if (_ === 0)
break;
}
if (_ >= se && (m = (m << c ^ o[w + (se - 1)] & 255) & p, F = u[m] & 65535, f[w & l] = u[m], u[m] = w), y = v, h = b, v = se - 1, F !== 0 && y < S && (w - F & 65535) <= s - Re && (L != Lt && (v = Jn(F)), v <= 5 && (L == Ts || v == se && w - b > 4096) && (v = se - 1)), y >= se && v <= y) {
I = w + _ - se, D = be(w - 1 - h, y - se), _ -= y - 1, y -= 2;
do
++w <= I && (m = (m << c ^ o[w + (se - 1)] & 255) & p, F = u[m] & 65535, f[w & l] = u[m], u[m] = w);
while (--y !== 0);
if (E = 0, v = se - 1, w++, D && (Me(!1), n.avail_out === 0))
return Ce;
} else if (E !== 0) {
if (D = be(0, o[w - 1] & 255), D && Me(!1), w++, _--, n.avail_out === 0)
return Ce;
} else
E = 1, w++, _--;
}
return E !== 0 && (D = be(0, o[w - 1] & 255), E = 0), Me(A == Se), n.avail_out === 0 ? A == Se ? _t : Ce : A == Se ? Pt : Ut;
}
function ks(A) {
return A.total_in = A.total_out = 0, A.msg = null, t.pending = 0, t.pending_out = 0, e = Mt, a = ut, G(), oe(), Ue;
}
t.deflateInit = function(A, F, D, I, N, W) {
return I || (I = pn), N || (N = Ns), W || (W = Rs), A.msg = null, F == $t && (F = 6), N < 1 || N > js || I != pn || D < 9 || D > 15 || F < 0 || F > 9 || W < 0 || W > Lt ? Pe : (A.dstate = t, r = D, s = 1 << r, l = s - 1, R = N + 7, g = 1 << R, p = g - 1, c = Math.floor((R + se - 1) / se), o = new Uint8Array(s * 2), f = [], u = [], te = 1 << N + 6, t.pending_buf = new Uint8Array(te * 4), i = te * 4, t.dist_buf = new Uint16Array(te), t.lc_buf = new Uint8Array(te), k = F, L = W, ks(A));
}, t.deflateEnd = function() {
return e != dn && e != Mt && e != yt ? Pe : (t.lc_buf = null, t.dist_buf = null, t.pending_buf = null, u = null, f = null, o = null, t.dstate = null, e == Mt ? Cs : Ue);
}, t.deflateParams = function(A, F, D) {
let I = Ue;
return F == $t && (F = 6), F < 0 || F > 9 || D < 0 || D > Lt ? Pe : (Ne[k].func != Ne[F].func && A.total_in !== 0 && (I = A.deflate(si)), k != F && (k = F, S = Ne[k].max_lazy, C = Ne[k].good_length, U = Ne[k].nice_length, T = Ne[k].max_chain), L = D, I);
}, t.deflateSetDictionary = function(A, F, D) {
let I = D, N, W = 0;
if (!F || e != dn)
return Pe;
if (I < se)
return Ue;
for (I > s - Re && (I = s - Re, W = D - I), o.set(F.subarray(W, W + I), 0), w = I, d = I, m = o[0] & 255, m = (m << c ^ o[1] & 255) & p, N = 0; N <= I - se; N++)
m = (m << c ^ o[N + (se - 1)] & 255) & p, f[N & l] = u[m], u[m] = N;
return Ue;
}, t.deflate = function(A, F) {
let D, I, N, W, $;
if (F > Se || F < 0)
return Pe;
if (!A.next_out || !A.next_in && A.avail_in !== 0 || e == yt && F != Se)
return A.msg = Nt[jt - Pe], Pe;
if (A.avail_out === 0)
return A.msg = Nt[jt - ft], ft;
if (n = A, W = a, a = F, e == dn && (I = pn + (r - 8 << 4) << 8, N = (k - 1 & 255) >> 1, N > 3 && (N = 3), I |= N << 6, w !== 0 && (I |= Us), I += 31 - I % 31, e = Mt, He(I)), t.pending !== 0) {
if (n.flush_pending(), n.avail_out === 0)
return a = -1, Ue;
} else if (n.avail_in === 0 && F <= W && F != Se)
return n.msg = Nt[jt - ft], ft;
if (e == yt && n.avail_in !== 0)
return A.msg = Nt[jt - ft], ft;
if (n.avail_in !== 0 || _ !== 0 || F != ut && e != yt) {
switch ($ = -1, Ne[k].func) {
case ia:
$ = bs(F);
break;
case Ht:
$ = _s(F);
break;
case lt:
$ = ys(F);
break;
}
if (($ == _t || $ == Pt) && (e = yt), $ == Ce || $ == _t)
return n.avail_out === 0 && (a = -1), Ue;
if ($ == Ut) {
if (F == si)
Ve();
else if (wt(0, 0, !1), F == Ds)
for (D = 0; D < g; D++)
u[D] = 0;
if (n.flush_pending(), n.avail_out === 0)
return a = -1, Ue;
}
}
return F != Se ? Ue : na;
};
}
function aa() {
const t = this;
t.next_in_index = 0, t.next_out_index = 0, t.avail_in = 0, t.total_in = 0, t.avail_out = 0, t.total_out = 0;
}
aa.prototype = {
deflateInit(t, n) {
const e = this;
return e.dstate = new qs(), n || (n = Rt), e.dstate.deflateInit(e, t, n);
},
deflate(t) {
const n = this;
return n.dstate ? n.dstate.deflate(n, t) : Pe;
},
deflateEnd() {
const t = this;
if (!t.dstate)
return Pe;
const n = t.dstate.deflateEnd();
return t.dstate = null, n;
},
deflateParams(t, n) {
const e = this;
return e.dstate ? e.dstate.deflateParams(e, t, n) : Pe;
},
deflateSetDictionary(t, n) {
const e = this;
return e.dstate ? e.dstate.deflateSetDictionary(e, t, n) : Pe;
},
// Read a new buffer from the current input stream, update the
// total number of bytes read. All deflate() input goes through
// this function so some applications may wish to modify it to avoid
// allocating a large strm->next_in buffer and copying from it.
// (See also flush_pending()).
read_buf(t, n, e) {
const i = this;
let a = i.avail_in;
return a > e && (a = e), a === 0 ? 0 : (i.avail_in -= a, t.set(i.next_in.subarray(i.next_in_index, i.next_in_index + a), n), i.next_in_index += a, i.total_in += a, a);
},
// Flush as much pending output as possible. All deflate() output goes
// through this function so some applications may wish to modify it
// to avoid allocating a large strm->next_out buffer and copying into it.
// (See also read_buf()).
flush_pending() {
const t = this;
let n = t.dstate.pending;
n > t.avail_out && (n = t.avail_out), n !== 0 && (t.next_out.set(t.dstate.pending_buf.subarray(t.dstate.pending_out, t.dstate.pending_out + n), t.next_out_index), t.next_out_index += n, t.dstate.pending_out += n, t.total_out += n, t.avail_out -= n, t.dstate.pending -= n, t.dstate.pending === 0 && (t.dstate.pending_out = 0));
}
};
function zs(t) {
const n = this, e = new aa(), i = Bs(t && t.chunkSize ? t.chunkSize : 64 * 1024), a = ut, s = new Uint8Array(i);
let r = t ? t.level : $t;
typeof r > "u" && (r = $t), e.deflateInit(r), e.next_out = s, n.append = function(l, o) {
let x, f, u = 0, m = 0, g = 0;
const R = [];
if (l.length) {
e.next_in_index = 0, e.next_in = l, e.avail_in = l.length;
do {
if (e.next_out_index = 0, e.avail_out = i, x = e.deflate(a), x != Ue)
throw new Error("deflating: " + e.msg);
e.next_out_index && (e.next_out_index == i ? R.push(new Uint8Array(s)) : R.push(s.subarray(0, e.next_out_index))), g += e.next_out_index, o && e.next_in_index > 0 && e.next_in_index != u && (o(e.next_in_index), u = e.next_in_index);
} while (e.avail_in > 0 || e.avail_out === 0);
return R.length > 1 ? (f = new Uint8Array(g), R.forEach(function(p) {
f.set(p, m), m += p.length;
})) : f = R[0] ? new Uint8Array(R[0]) : new Uint8Array(), f;
}
}, n.flush = function() {
let l, o, x = 0, f = 0;
const u = [];
do {
if (e.next_out_index = 0, e.avail_out = i, l = e.deflate(Se), l != na && l != Ue)
throw new Error("deflating: " + e.msg);
i - e.avail_out > 0 && u.push(s.slice(0, e.next_out_index)), f += e.next_out_index;
} while (e.avail_in > 0 || e.avail_out === 0);
return e.deflateEnd(), o = new Uint8Array(f), u.forEach(function(m) {
o.set(m, x), x += m.length;
}), o;
};
}
function Bs(t) {
return t + 5 * (Math.floor(t / 16383) + 1);
}
const Ws = 15, Q = 0, Ge = 1, Hs = 2, Ae = -2, ae = -3, ci = -4, Ke = -5, De = [
0,
1,
3,
7,
15,
31,
63,
127,
255,
511,
1023,
2047,
4095,
8191,
16383,
32767,
65535
], sa = 1440, Zs = 0, Vs = 4, Ys = 9, Gs = 5, Ks = [
96,
7,
256,
0,
8,
80,
0,
8,
16,
84,
8,
115,
82,
7,
31,
0,
8,
112,
0,
8,
48,
0,
9,
192,
80,
7,
10,
0,
8,
96,
0,
8,
32,
0,
9,
160,
0,
8,
0,
0,
8,
128,
0,
8,
64,
0,
9,
224,
80,
7,
6,
0,
8,
88,
0,
8,
24,
0,
9,
144,
83,
7,
59,
0,
8,
120,
0,
8,
56,
0,
9,
208,
81,
7,
17,
0,
8,
104,
0,
8,
40,
0,
9,
176,
0,
8,
8,
0,
8,
136,
0,
8,
72,
0,
9,
240,
80,
7,
4,
0,
8,
84,
0,
8,
20,
85,
8,
227,
83,
7,
43,
0,
8,
116,
0,
8,
52,
0,
9,
200,
81,
7,
13,
0,
8,
100,
0,
8,
36,
0,
9,
168,
0,
8,
4,
0,
8,
132,
0,
8,
68,
0,
9,
232,
80,
7,
8,
0,
8,
92,
0,
8,
28,
0,
9,
152,
84,
7,
83,
0,
8,
124,
0,
8,
60,
0,
9,
216,
82,
7,
23,
0,
8,
108,
0,
8,
44,
0,
9,
184,
0,
8,
12,
0,
8,
140,
0,
8,
76,
0,
9,
248,
80,
7,
3,
0,
8,
82,
0,
8,
18,
85,
8,
163,
83,
7,
35,
0,
8,
114,
0,
8,
50,
0,
9,
196,
81,
7,
11,
0,
8,
98,
0,
8,
34,
0,
9,
164,
0,
8,
2,
0,
8,
130,
0,
8,
66,
0,
9,
228,
80,
7,
7,
0,
8,
90,
0,
8,
26,
0,
9,
148,
84,
7,
67,
0,
8,
122,
0,
8,
58,
0,
9,
212,
82,
7,
19,
0,
8,
106,
0,
8,
42,
0,
9,
180,
0,
8,
10,
0,
8,
138,
0,
8,
74,
0,
9,
244,
80,
7,
5,
0,
8,
86,
0,
8,
22,
192,
8,
0,
83,
7,
51,
0,
8,
118,
0,
8,
54,
0,
9,
204,
81,
7,
15,
0,
8,
102,
0,
8,
38,
0,
9,
172,
0,
8,
6,
0,
8,
134,
0,
8,
70,
0,
9,
236,
80,
7,
9,
0,
8,
94,
0,
8,
30,
0,
9,
156,
84,
7,
99,
0,
8,
126,
0,
8,
62,
0,
9,
220,
82,
7,
27,
0,
8,
110,
0,
8,
46,
0,
9,
188,
0,
8,
14,
0,
8,
142,
0,
8,
78,
0,
9,
252,
96,
7,
256,
0,
8,
81,
0,
8,
17,
85,
8,
131,
82,
7,
31,
0,
8,
113,
0,
8,
49,
0,
9,
194,
80,
7,
10,
0,
8,
97,
0,
8,
33,
0,
9,
162,
0,
8,
1,
0,
8,
129,
0,
8,
65,
0,
9,
226,
80,
7,
6,
0,
8,
89,
0,
8,
25,
0,
9,
146,
83,
7,
59,
0,
8,
121,
0,
8,
57,
0,
9,
210,
81,
7,
17,
0,
8,
105,
0,
8,
41,
0,
9,
178,
0,
8,
9,
0,
8,
137,
0,
8,
73,
0,
9,
242,
80,
7,
4,
0,
8,
85,
0,
8,
21,
80,
8,
258,
83,
7,
43,
0,
8,
117,
0,
8,
53,
0,
9,
202,
81,
7,
13,
0,
8,
101,
0,
8,
37,
0,
9,
170,
0,
8,
5,
0,
8,
133,
0,
8,
69,
0,
9,
234,
80,
7,
8,
0,
8,
93,
0,
8,
29,
0,
9,
154,
84,
7,
83,
0,
8,
125,
0,
8,
61,
0,
9,
218,
82,
7,
23,
0,
8,
109,
0,
8,
45,
0,
9,
186,
0,
8,
13,
0,
8,
141,
0,
8,
77,
0,
9,
250,
80,
7,
3,
0,
8,
83,
0,
8,
19,
85,
8,
195,
83,
7,
35,
0,
8,
115,
0,
8,
51,
0,
9,
198,
81,
7,
11,
0,
8,
99,
0,
8,
35,
0,
9,
166,
0,
8,
3,
0,
8,
131,
0,
8,
67,
0,
9,
230,
80,
7,
7,
0,
8,
91,
0,
8,
27,
0,
9,
150,
84,
7,
67,
0,
8,
123,
0,
8,
59,
0,
9,
214,
82,
7,
19,
0,
8,
107,
0,
8,
43,
0,
9,
182,
0,
8,
11,
0,
8,
139,
0,
8,
75,
0,
9,
246,
80,
7,
5,
0,
8,
87,
0,
8,
23,
192,
8,
0,
83,
7,
51,
0,
8,
119,
0,
8,
55,
0,
9,
206,
81,
7,
15,
0,
8,
103,
0,
8,
39,
0,
9,
174,
0,
8,
7,
0,
8,
135,
0,
8,
71,
0,
9,
238,
80,
7,
9,
0,
8,
95,
0,
8,
31,
0,
9,
158,
84,
7,
99,
0,
8,
127,
0,
8,
63,
0,
9,
222,
82,
7,
27,
0,
8,
111,
0,
8,
47,
0,
9,
190,
0,
8,
15,
0,
8,
143,
0,
8,
79,
0,
9,
254,
96,
7,
256,
0,
8,
80,
0,
8,
16,
84,
8,
115,
82,
7,
31,
0,
8,
112,
0,
8,
48,
0,
9,
193,
80,
7,
10,
0,
8,
96,
0,
8,
32,
0,
9,
161,
0,
8,
0,
0,
8,
128,
0,
8,
64,
0,
9,
225,
80,
7,
6,
0,
8,
88,
0,
8,
24,
0,
9,
145,
83,
7,
59,
0,
8,
120,
0,
8,
56,
0,
9,
209,
81,
7,
17,
0,
8,
104,
0,
8,
40,
0,
9,
177,
0,
8,
8,
0,
8,
136,
0,
8,
72,
0,
9,
241,
80,
7,
4,
0,
8,
84,
0,
8,
20,
85,
8,
227,
83,
7,
43,
0,
8,
116,
0,
8,
52,
0,
9,
201,
81,
7,
13,
0,
8,
100,
0,
8,
36,
0,
9,
169,
0,
8,
4,
0,
8,
132,
0,
8,
68,
0,
9,
233,
80,
7,
8,
0,
8,
92,
0,
8,
28,
0,
9,
153,
84,
7,
83,
0,
8,
124,
0,
8,
60,
0,
9,
217,
82,
7,
23,
0,
8,
108,
0,
8,
44,
0,
9,
185,
0,
8,
12,
0,
8,
140,
0,
8,
76,
0,
9,
249,
80,
7,
3,
0,
8,
82,
0,
8,
18,
85,
8,
163,
83,
7,
35,
0,
8,
114,
0,
8,
50,
0,
9,
197,
81,
7,
11,
0,
8,
98,
0,
8,
34,
0,
9,
165,
0,
8,
2,
0,
8,
130,
0,
8,
66,
0,
9,
229,
80,
7,
7,
0,
8,
90,
0,
8,
26,
0,
9,
149,
84,
7,
67,
0,
8,
122,
0,
8,
58,
0,
9,
213,
82,
7,
19,
0,
8,
106,
0,
8,
42,
0,
9,
181,
0,
8,
10,
0,
8,
138,
0,
8,
74,
0,
9,
245,
80,
7,
5,
0,
8,
86,
0,
8,
22,
192,
8,
0,
83,
7,
51,
0,
8,
118,
0,
8,
54,
0,
9,
205,
81,
7,
15,
0,
8,
102,
0,
8,
38,
0,
9,
173,
0,
8,
6,
0,
8,
134,
0,
8,
70,
0,
9,
237,
80,
7,
9,
0,
8,
94,
0,
8,
30,
0,
9,
157,
84,
7,
99,
0,
8,
126,
0,
8,
62,
0,
9,
221,
82,
7,
27,
0,
8,
110,
0,
8,
46,
0,
9,
189,
0,
8,
14,
0,
8,
142,
0,
8,
78,
0,
9,
253,
96,
7,
256,
0,
8,
81,
0,
8,
17,
85,
8,
131,
82,
7,
31,
0,
8,
113,
0,
8,
49,
0,
9,
195,
80,
7,
10,
0,
8,
97,
0,
8,
33,
0,
9,
163,
0,
8,
1,
0,
8,
129,
0,
8,
65,
0,
9,
227,
80,
7,
6,
0,
8,
89,
0,
8,
25,
0,
9,
147,
83,
7,
59,
0,
8,
121,
0,
8,
57,
0,
9,
211,
81,
7,
17,
0,
8,
105,
0,
8,
41,
0,
9,
179,
0,
8,
9,
0,
8,
137,
0,
8,
73,
0,
9,
243,
80,
7,
4,
0,
8,
85,
0,
8,
21,
80,
8,
258,
83,
7,
43,
0,
8,
117,
0,
8,
53,
0,
9,
203,
81,
7,
13,
0,
8,
101,
0,
8,
37,
0,
9,
171,
0,
8,
5,
0,
8,
133,
0,
8,
69,
0,
9,
235,
80,
7,
8,
0,
8,
93,
0,
8,
29,
0,
9,
155,
84,
7,
83,
0,
8,
125,
0,
8,
61,
0,
9,
219,
82,
7,
23,
0,
8,
109,
0,
8,
45,
0,
9,
187,
0,
8,
13,
0,
8,
141,
0,
8,
77,
0,
9,
251,
80,
7,
3,
0,
8,
83,
0,
8,
19,
85,
8,
195,
83,
7,
35,
0,
8,
115,
0,
8,
51,
0,
9,
199,
81,
7,
11,
0,
8,
99,
0,
8,
35,
0,
9,
167,
0,
8,
3,
0,
8,
131,
0,
8,
67,
0,
9,
231,
80,
7,
7,
0,
8,
91,
0,
8,
27,
0,
9,
151,
84,
7,
67,
0,
8,
123,
0,
8,
59,
0,
9,
215,
82,
7,
19,
0,
8,
107,
0,
8,
43,
0,
9,
183,
0,
8,
11,
0,
8,
139,
0,
8,
75,
0,
9,
247,
80,
7,
5,
0,
8,
87,
0,
8,
23,
192,
8,
0,
83,
7,
51,
0,
8,
119,
0,
8,
55,
0,
9,
207,
81,
7,
15,
0,
8,
103,
0,
8,
39,
0,
9,
175,
0,
8,
7,
0,
8,
135,
0,
8,
71,
0,
9,
239,
80,
7,
9,
0,
8,
95,
0,
8,
31,
0,
9,
159,
84,
7,
99,
0,
8,
127,
0,
8,
63,
0,
9,
223,
82,
7,
27,
0,
8,
111,
0,
8,
47,
0,
9,
191,
0,
8,
15,
0,
8,
143,
0,
8,
79,
0,
9,
255
], Xs = [
80,
5,
1,
87,
5,
257,
83,
5,
17,
91,
5,
4097,
81,
5,
5,
89,
5,
1025,
85,
5,
65,
93,
5,
16385,
80,
5,
3,
88,
5,
513,
84,
5,
33,
92,
5,
8193,
82,
5,
9,
90,
5,
2049,
86,
5,
129,
192,
5,
24577,
80,
5,
2,
87,
5,
385,
83,
5,
25,
91,
5,
6145,
81,
5,
7,
89,
5,
1537,
85,
5,
97,
93,
5,
24577,
80,
5,
4,
88,
5,
769,
84,
5,
49,
92,
5,
12289,
82,
5,
13,
90,
5,
3073,
86,
5,
193,
192,
5,
24577
], $s = [
// Copy lengths for literal codes 257..285
3,
4,
5,
6,
7,
8,
9,
10,
11,
13,
15,
17,
19,
23,
27,
31,
35,
43,
51,
59,
67,
83,
99,
115,
131,
163,
195,
227,
258,
0,
0
], Js = [
// Extra bits for literal codes 257..285
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,
112,
112
// 112==invalid
], Qs = [
// Copy offsets for distance codes 0..29
1,
2,
3,
4,
5,
7,
9,
13,
17,
25,
33,
49,
65,
97,
129,
193,
257,
385,
513,
769,
1025,
1537,
2049,
3073,
4097,
6145,
8193,
12289,
16385,
24577
], er = [
// Extra bits for distance codes
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
], Xe = 15;
function Tn() {
const t = this;
let n, e, i, a, s, r;
function l(x, f, u, m, g, R, p, c, d, v, h) {
let E, w, b, _, y, T, S, k, L, C, U, O, j, z, q;
C = 0, y = u;
do
i[x[f + C]]++, C++, y--;
while (y !== 0);
if (i[0] == u)
return p[0] = -1, c[0] = 0, Q;
for (k = c[0], T = 1; T <= Xe && i[T] === 0; T++)
;
for (S = T, k < T && (k = T), y = Xe; y !== 0 && i[y] === 0; y--)
;
for (b = y, k > y && (k = y), c[0] = k, z = 1 << T; T < y; T++, z <<= 1)
if ((z -= i[T]) < 0)
return ae;
if ((z -= i[y]) < 0)
return ae;
for (i[y] += z, r[1] = T = 0, C = 1, j = 2; --y !== 0; )
r[j] = T += i[C], j++, C++;
y = 0, C = 0;
do
(T = x[f + C]) !== 0 && (h[r[T]++] = y), C++;
while (++y < u);
for (u = r[b], r[0] = y = 0, C = 0, _ = -1, O = -k, s[0] = 0, U = 0, q = 0; S <= b; S++)
for (E = i[S]; E-- !== 0; ) {
for (; S > O + k; ) {
if (_++, O += k, q = b - O, q = q > k ? k : q, (w = 1 << (T = S - O)) > E + 1 && (w -= E + 1, j = S, T < q))
for (; ++T < q && !((w <<= 1) <= i[++j]); )
w -= i[j];
if (q = 1 << T, v[0] + q > sa)
return ae;
s[_] = U = /* hp+ */
v[0], v[0] += q, _ !== 0 ? (r[_] = y, a[0] = /* (byte) */
T, a[1] = /* (byte) */
k, T = y >>> O - k, a[2] = /* (int) */
U - s[_ - 1] - T, d.set(a, (s[_ - 1] + T) * 3)) : p[0] = U;
}
for (a[1] = /* (byte) */
S - O, C >= u ? a[0] = 192 : h[C] < m ? (a[0] = /* (byte) */
h[C] < 256 ? 0 : 96, a[2] = h[C++]) : (a[0] = /* (byte) */
R[h[C] - m] + 16 + 64, a[2] = g[h[C++] - m]), w = 1 << S - O, T = y >>> O; T < q; T += w)
d.set(a, (U + T) * 3);
for (T = 1 << S - 1; y & T; T >>>= 1)
y ^= T;
for (y ^= T, L = (1 << O) - 1; (y & L) != r[_]; )
_--, O -= k, L = (1 << O) - 1;
}
return z !== 0 && b != 1 ? Ke : Q;
}
function o(x) {
let f;
for (n || (n = [], e = [], i = new Int32Array(Xe + 1), a = [], s = new Int32Array(Xe), r = new Int32Array(Xe + 1)), e.length < x && (e = []), f = 0; f < x; f++)
e[f] = 0;
for (f = 0; f < Xe + 1; f++)
i[f] = 0;
for (f = 0; f < 3; f++)
a[f] = 0;
s.set(i.subarray(0, Xe), 0), r.set(i.subarray(0, Xe + 1), 0);
}
t.inflate_trees_bits = function(x, f, u, m, g) {
let R;
return o(19), n[0] = 0, R = l(x, 0, 19, 19, null, null, u, f, m, n, e), R == ae ? g.msg = "oversubscribed dynamic bit lengths tree" : (R == Ke || f[0] === 0) && (g.msg = "incomplete dynamic bit lengths tree", R = ae), R;
}, t.inflate_trees_dynamic = function(x, f, u, m, g, R, p, c, d) {
let v;
return o(288), n[0] = 0, v = l(u, 0, x, 257, $s, Js, R, m, c, n, e), v != Q || m[0] === 0 ? (v == ae ? d.msg = "oversubscribed literal/length tree" : v != ci && (d.msg = "incomplete literal/length tree", v = ae), v) : (o(288), v = l(u, x, f, 0, Qs, er, p, g, c, n, e), v != Q || g[0] === 0 && x > 257 ? (v == ae ? d.msg = "oversubscribed distance tree" : v == Ke ? (d.msg = "incomplete distance tree", v = ae) : v != ci && (d.msg = "empty distance tree with lengths", v = ae), v) : Q);
};
}
Tn.inflate_trees_fixed = function(t, n, e, i) {
return t[0] = Ys, n[0] = Gs, e[0] = Ks, i[0] = Xs, Q;
};
const qt = 0, li = 1, di = 2, pi = 3, fi = 4, mi = 5, ui = 6, mn = 7, xi = 8, zt = 9;
function tr() {
const t = this;
let n, e = 0, i, a = 0, s = 0, r = 0, l = 0, o = 0, x = 0, f = 0, u, m = 0, g, R = 0;
function p(c, d, v, h, E, w, b, _) {
let y, T, S, k, L, C, U, O, j, z, q, ee, P, te, M, B;
U = _.next_in_index, O = _.avail_in, L = b.bitb, C = b.bitk, j = b.write, z = j < b.read ? b.read - j - 1 : b.end - j, q = De[c], ee = De[d];
do {
for (; C < 20; )
O--, L |= (_.read_byte(U++) & 255) << C, C += 8;
if (y = L & q, T = v, S = h, B = (S + y) * 3, (k = T[B]) === 0) {
L >>= T[B + 1], C -= T[B + 1], b.win[j++] = /* (byte) */
T[B + 2], z--;
continue;
}
do {
if (L >>= T[B + 1], C -= T[B + 1], k & 16) {
for (k &= 15, P = T[B + 2] + /* (int) */
(L & De[k]), L >>= k, C -= k; C < 15; )
O--, L |= (_.read_byte(U++) & 255) << C, C += 8;
y = L & ee, T = E, S = w, B = (S + y) * 3, k = T[B];
do
if (L >>= T[B + 1], C -= T[B + 1], k & 16) {
for (k &= 15; C < k; )
O--, L |= (_.read_byte(U++) & 255) << C, C += 8;
if (te = T[B + 2] + (L & De[k]), L >>= k, C -= k, z -= P, j >= te)
M = j - te, j - M > 0 && 2 > j - M ? (b.win[j++] = b.win[M++], b.win[j++] = b.win[M++], P -= 2) : (b.win.set(b.win.subarray(M, M + 2), j), j += 2, M += 2, P -= 2);
else {
M = j - te;
do
M += b.end;
while (M < 0);
if (k = b.end - M, P > k) {
if (P -= k, j - M > 0 && k > j - M)
do
b.win[j++] = b.win[M++];
while (--k !== 0);
else
b.win.set(b.win.subarray(M, M + k), j), j += k, M += k, k = 0;
M = 0;
}
}
if (j - M > 0 && P > j - M)
do
b.win[j++] = b.win[M++];
while (--P !== 0);
else
b.win.set(b.win.subarray(M, M + P), j), j += P, M += P, P = 0;
break;
} else if (!(k & 64))
y += T[B + 2], y += L & De[k], B = (S + y) * 3, k = T[B];
else
return _.msg = "invalid distance code", P = _.avail_in - O, P = C >> 3 < P ? C >> 3 : P, O += P, U -= P, C -= P << 3, b.bitb = L, b.bitk = C, _.avail_in = O, _.total_in += U - _.next_in_index, _.next_in_index = U, b.write = j, ae;
while (!0);
break;
}
if (k & 64)
return k & 32 ? (P = _.avail_in - O, P = C >> 3 < P ? C >> 3 : P, O += P, U -= P, C -= P << 3, b.bitb = L, b.bitk = C, _.avail_in = O, _.total_in += U - _.next_in_index, _.next_in_index = U, b.write = j, Ge) : (_.msg = "invalid literal/length code", P = _.avail_in - O, P = C >> 3 < P ? C >> 3 : P, O += P, U -= P, C -= P << 3, b.bitb = L, b.bitk = C, _.avail_in = O, _.total_in += U - _.next_in_index, _.next_in_index = U, b.write = j, ae);
if (y += T[B + 2], y += L & De[k], B = (S + y) * 3, (k = T[B]) === 0) {
L >>= T[B + 1], C -= T[B + 1], b.win[j++] = /* (byte) */
T[B + 2], z--;
break;
}
} while (!0);
} while (z >= 258 && O >= 10);
return P = _.avail_in - O, P = C >> 3 < P ? C >> 3 : P, O += P, U -= P, C -= P << 3, b.bitb = L, b.bitk = C, _.avail_in = O, _.total_in += U - _.next_in_index, _.next_in_index = U, b.write = j, Q;
}
t.init = function(c, d, v, h, E, w) {
n = qt, x = /* (byte) */
c, f = /* (byte) */
d, u = v, m = h, g = E, R = w, i = null;
}, t.proc = function(c, d, v) {
let h, E, w, b = 0, _ = 0, y = 0, T, S, k, L;
for (y = d.next_in_index, T = d.avail_in, b = c.bitb, _ = c.bitk, S = c.write, k = S < c.read ? c.read - S - 1 : c.end - S; ; )
switch (n) {
case qt:
if (k >= 258 && T >= 10 && (c.bitb = b, c.bitk = _, d.avail_in = T, d.total_in += y - d.next_in_index, d.next_in_index = y, c.write = S, v = p(x, f, u, m, g, R, c, d), y = d.next_in_index, T = d.avail_in, b = c.bitb, _ = c.bitk, S = c.write, k = S < c.read ? c.read - S - 1 : c.end - S, v != Q)) {
n = v == Ge ? mn : zt;
break;
}
s = x, i = u, a = m, n = li;
case li:
for (h = s; _ < h; ) {
if (T !== 0)
v = Q;
else
return c.bitb = b, c.bitk = _, d.avail_in = T, d.total_in += y - d.next_in_index, d.next_in_index = y, c.write = S, c.inflate_flush(d, v);
T--, b |= (d.read_byte(y++) & 255) << _, _ += 8;
}
if (E = (a + (b & De[h])) * 3, b >>>= i[E + 1], _ -= i[E + 1], w = i[E], w === 0) {
r = i[E + 2], n = ui;
break;
}
if (w & 16) {
l = w & 15, e = i[E + 2], n = di;
break;
}
if (!(w & 64)) {
s = w, a = E / 3 + i[E + 2];
break;
}
if (w & 32) {
n = mn;
break;
}
return n = zt, d.msg = "invalid literal/length code", v = ae, c.bitb = b, c.bitk = _, d.avail_in = T, d.total_in += y - d.next_in_index, d.next_in_index = y, c.write = S, c.inflate_flush(d, v);
case di:
for (h = l; _ < h; ) {
if (T !== 0)
v = Q;
else
return c.bitb = b, c.bitk = _, d.avail_in = T, d.total_in += y - d.next_in_index, d.next_in_index = y, c.write = S, c.inflate_flush(d, v);
T--, b |= (d.read_byte(y++) & 255) << _, _ += 8;
}
e += b & De[h], b >>= h, _ -= h, s = f, i = g, a = R, n = pi;
case pi:
for (h = s; _ < h; ) {
if (T !== 0)
v = Q;
else
return c.bitb = b, c.bitk = _, d.avail_in = T, d.total_in += y - d.next_in_index, d.next_in_index = y, c.write = S, c.inflate_flush(d, v);
T--, b |= (d.read_byte(y++) & 255) << _, _ += 8;
}
if (E = (a + (b & De[h])) * 3, b >>= i[E + 1], _ -= i[E + 1], w = i[E], w & 16) {
l = w & 15, o = i[E + 2], n = fi;
break;
}
if (!(w & 64)) {
s = w, a = E / 3 + i[E + 2];
break;
}
return n = zt, d.msg = "invalid distance code", v = ae, c.bitb = b, c.bitk = _, d.avail_in = T, d.total_in += y - d.next_in_index, d.next_in_index = y, c.write = S, c.inflate_flush(d, v);
case fi:
for (h = l; _ < h; ) {
if (T !== 0)
v = Q;
else
return c.bitb = b, c.bitk = _, d.avail_in = T, d.total_in += y - d.next_in_index, d.next_in_index = y, c.write = S, c.inflate_flush(d, v);
T--, b |= (d.read_byte(y++) & 255) << _, _ += 8;
}
o += b & De[h], b >>= h, _ -= h, n = mi;
case mi:
for (L = S - o; L < 0; )
L += c.end;
for (; e !== 0; ) {
if (k === 0 && (S == c.end && c.read !== 0 && (S = 0, k = S < c.read ? c.read - S - 1 : c.end - S), k === 0 && (c.write = S, v = c.inflate_flush(d, v), S = c.write, k = S < c.read ? c.read - S - 1 : c.end - S, S == c.end && c.read !== 0 && (S = 0, k = S < c.read ? c.read - S - 1 : c.end - S), k === 0)))
return c.bitb = b, c.bitk = _, d.avail_in = T, d.total_in += y - d.next_in_index, d.next_in_index = y, c.write = S, c.inflate_flush(d, v);
c.win[S++] = c.win[L++], k--, L == c.end && (L = 0), e--;
}
n = qt;
break;
case ui:
if (k === 0 && (S == c.end && c.read !== 0 && (S = 0, k = S < c.read ? c.read - S - 1 : c.end - S), k === 0 && (c.write = S, v = c.inflate_flush(d, v), S = c.write, k = S < c.read ? c.read - S - 1 : c.end - S, S == c.end && c.read !== 0 && (S = 0, k = S < c.read ? c.read - S - 1 : c.end - S), k === 0)))
return c.bitb = b, c.bitk = _, d.avail_in = T, d.total_in += y - d.next_in_index, d.next_in_index = y, c.write = S, c.inflate_flush(d, v);
v = Q, c.win[S++] = /* (byte) */
r, k--, n = qt;
break;
case mn:
if (_ > 7 && (_ -= 8, T++, y--), c.write = S, v = c.inflate_flush(d, v), S = c.write, k = S < c.read ? c.read - S - 1 : c.end - S, c.read != c.write)
return c.bitb = b, c.bitk = _, d.avail_in = T, d.total_in += y - d.next_in_index, d.next_in_index = y, c.write = S, c.inflate_flush(d, v);
n = xi;
case xi:
return v = Ge, c.bitb = b, c.bitk = _, d.avail_in = T, d.total_in += y - d.next_in_index, d.next_in_index = y, c.write = S, c.inflate_flush(d, v);
case zt:
return v = ae, c.bitb = b, c.bitk = _, d.avail_in = T, d.total_in += y - d.next_in_index, d.next_in_index = y, c.write = S, c.inflate_flush(d, v);
default:
return v = Ae, c.bitb = b, c.bitk = _, d.avail_in = T, d.total_in += y - d.next_in_index, d.next_in_index = y, c.write = S, c.inflate_flush(d, v);
}
}, t.free = function() {
};
}
const vi = [
// Order of the bit length code lengths
16,
17,
18,
0,
8,
7,
9,
6,
10,
5,
11,
4,
12,
3,
13,
2,
14,
1,
15
], mt = 0, un = 1, hi = 2, gi = 3, wi = 4, bi = 5, Bt = 6, Wt = 7, _i = 8, ct = 9;
function nr(t, n) {
const e = this;
let i = mt, a = 0, s = 0, r = 0, l;
const o = [0], x = [0], f = new tr();
let u = 0, m = new Int32Array(sa * 3);
const g = 0, R = new Tn();
e.bitk = 0, e.bitb = 0, e.win = new Uint8Array(n), e.end = n, e.read = 0, e.write = 0, e.reset = function(p, c) {
c && (c[0] = g), i == Bt && f.free(p), i = mt, e.bitk = 0, e.bitb = 0, e.read = e.write = 0;
}, e.reset(t, null), e.inflate_flush = function(p, c) {
let d, v, h;
return v = p.next_out_index, h = e.read, d = /* (int) */
(h <= e.write ? e.write : e.end) - h, d > p.avail_out && (d = p.avail_out), d !== 0 && c == Ke && (c = Q), p.avail_out -= d, p.total_out += d, p.next_out.set(e.win.subarray(h, h + d), v), v += d, h += d, h == e.end && (h = 0, e.write == e.end && (e.write = 0), d = e.write - h, d > p.avail_out && (d = p.avail_out), d !== 0 && c == Ke && (c = Q), p.avail_out -= d, p.total_out += d, p.next_out.set(e.win.subarray(h, h + d), v), v += d, h += d), p.next_out_index = v, e.read = h, c;
}, e.proc = function(p, c) {
let d, v, h, E, w, b, _, y;
for (E = p.next_in_index, w = p.avail_in, v = e.bitb, h = e.bitk, b = e.write, _ = /* (int) */
b < e.read ? e.read - b - 1 : e.end - b; ; ) {
let T, S, k, L, C, U, O, j;
switch (i) {
case mt:
for (; h < 3; ) {
if (w !== 0)
c = Q;
else
return e.bitb = v, e.bitk = h, p.avail_in = w, p.total_in += E - p.next_in_index, p.next_in_index = E, e.write = b, e.inflate_flush(p, c);
w--, v |= (p.read_byte(E++) & 255) << h, h += 8;
}
switch (d = /* (int) */
v & 7, u = d & 1, d >>> 1) {
case 0:
v >>>= 3, h -= 3, d = h & 7, v >>>= d, h -= d, i = un;
break;
case 1:
T = [], S = [], k = [[]], L = [[]], Tn.inflate_trees_fixed(T, S, k, L), f.init(T[0], S[0], k[0], 0, L[0], 0), v >>>= 3, h -= 3, i = Bt;
break;
case 2:
v >>>= 3, h -= 3, i = gi;
break;
case 3:
return v >>>= 3, h -= 3, i = ct, p.msg = "invalid block type", c = ae, e.bitb = v, e.bitk = h, p.avail_in = w, p.total_in += E - p.next_in_index, p.next_in_index = E, e.write = b, e.inflate_flush(p, c);
}
break;
case un:
for (; h < 32; ) {
if (w !== 0)
c = Q;
else
return e.bitb = v, e.bitk = h, p.avail_in = w, p.total_in += E - p.next_in_index, p.next_in_index = E, e.write = b, e.inflate_flush(p, c);
w--, v |= (p.read_byte(E++) & 255) << h, h += 8;
}
if ((~v >>> 16 & 65535) != (v & 65535))
return i = ct, p.msg = "invalid stored block lengths", c = ae, e.bitb = v, e.bitk = h, p.avail_in = w, p.total_in += E - p.next_in_index, p.next_in_index = E, e.write = b, e.inflate_flush(p, c);
a = v & 65535, v = h = 0, i = a !== 0 ? hi : u !== 0 ? Wt : mt;
break;
case hi:
if (w === 0 || _ === 0 && (b == e.end && e.read !== 0 && (b = 0, _ = /* (int) */
b < e.read ? e.read - b - 1 : e.end - b), _ === 0 && (e.write = b, c = e.inflate_flush(p, c), b = e.write, _ = /* (int) */
b < e.read ? e.read - b - 1 : e.end - b, b == e.end && e.read !== 0 && (b = 0, _ = /* (int) */
b < e.read ? e.read - b - 1 : e.end - b), _ === 0)))
return e.bitb = v, e.bitk = h, p.avail_in = w, p.total_in += E - p.next_in_index, p.next_in_index = E, e.write = b, e.inflate_flush(p, c);
if (c = Q, d = a, d > w && (d = w), d > _ && (d = _), e.win.set(p.read_buf(E, d), b), E += d