vitessce 3.5.12 → 3.6.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (33) hide show
  1. package/README.md +7 -1
  2. package/dist/blosc-DKW2fp0s.js +716 -0
  3. package/dist/browser-D0q2hNGi.js +524 -0
  4. package/dist/deflate-JIgkfrJp.js +10 -0
  5. package/dist/{gzip-61747bf5.js → gzip-Bo8P9Xuy.js} +2 -2
  6. package/dist/{higlass-e9622d39.js → higlass-DtQYm-cf.js} +22717 -22970
  7. package/dist/{index-0d803e7f.js → index-CGb9JHk9.js} +18924 -18896
  8. package/dist/{index-a280757a.js → index-NeyzZ285.js} +172194 -152097
  9. package/dist/{index-cbdc7956.js → index-axVzbAYY.js} +5538 -5935
  10. package/dist/index.min.js +26 -27
  11. package/dist/{jpeg-6c06bcde.js → jpeg-CpdHV9ON.js} +63 -47
  12. package/dist/lerc-CEsOhIb6.js +1032 -0
  13. package/dist/lz4-D5NbssRf.js +640 -0
  14. package/dist/lzw-CTsRA3aT.js +84 -0
  15. package/dist/packbits-BvYiWUAv.js +24 -0
  16. package/dist/pako.esm-D68R8YXe.js +1071 -0
  17. package/dist/raw-dTBk71WO.js +9 -0
  18. package/dist/{troika-three-text.esm-4798f478.js → troika-three-text.esm-C0dD1f80.js} +859 -1038
  19. package/dist/{webimage-5dc5b0d9.js → webimage-Djrqr9Ff.js} +4 -6
  20. package/dist/{zlib-99872a4e.js → zlib-cA2napA9.js} +2 -2
  21. package/dist/zstd-DoGJTjDa.js +603 -0
  22. package/package.json +10 -10
  23. package/dist/blosc-956db408.js +0 -716
  24. package/dist/browser-554eb095.js +0 -524
  25. package/dist/deflate-b472a529.js +0 -12
  26. package/dist/lerc-d288eed3.js +0 -1001
  27. package/dist/lz4-06c5cf38.js +0 -640
  28. package/dist/lzw-e58f776d.js +0 -86
  29. package/dist/packbits-980ba63d.js +0 -26
  30. package/dist/pako.esm-a0be47a3.js +0 -1692
  31. package/dist/raw-9c0043e8.js +0 -11
  32. package/dist/zstd-8d54964e.js +0 -603
  33. /package/dist/{chunk-INHXZS53-098e8433.js → chunk-INHXZS53-DiyuLb3Z.js} +0 -0
@@ -1,1692 +0,0 @@
1
- /*! pako 2.0.4 https://github.com/nodeca/pako @license (MIT AND Zlib) */
2
- function oe(e) {
3
- let i = e.length;
4
- for (; --i >= 0; )
5
- e[i] = 0;
6
- }
7
- const Ui = 0, ii = 1, Ci = 2, $i = 3, Fi = 258, ht = 29, Se = 256, we = Se + 1 + ht, re = 30, dt = 19, ni = 2 * we + 1, Q = 15, Ye = 16, Mi = 7, ct = 256, ai = 16, li = 17, ri = 18, rt = (
8
- /* extra bits for each length code */
9
- new Uint8Array([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])
10
- ), Ue = (
11
- /* extra bits for each distance code */
12
- new Uint8Array([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])
13
- ), Hi = (
14
- /* extra bits for each bit length code */
15
- new Uint8Array([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7])
16
- ), fi = new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]), Bi = 512, B = new Array((we + 2) * 2);
17
- oe(B);
18
- const se = new Array(re * 2);
19
- oe(se);
20
- const ge = new Array(Bi);
21
- oe(ge);
22
- const pe = new Array(Fi - $i + 1);
23
- oe(pe);
24
- const st = new Array(ht);
25
- oe(st);
26
- const Me = new Array(re);
27
- oe(Me);
28
- function Ge(e, i, t, a, n) {
29
- this.static_tree = e, this.extra_bits = i, this.extra_base = t, this.elems = a, this.max_length = n, this.has_stree = e && e.length;
30
- }
31
- let oi, _i, hi;
32
- function je(e, i) {
33
- this.dyn_tree = e, this.max_code = 0, this.stat_desc = i;
34
- }
35
- const di = (e) => e < 256 ? ge[e] : ge[256 + (e >>> 7)], xe = (e, i) => {
36
- e.pending_buf[e.pending++] = i & 255, e.pending_buf[e.pending++] = i >>> 8 & 255;
37
- }, N = (e, i, t) => {
38
- e.bi_valid > Ye - t ? (e.bi_buf |= i << e.bi_valid & 65535, xe(e, e.bi_buf), e.bi_buf = i >> Ye - e.bi_valid, e.bi_valid += t - Ye) : (e.bi_buf |= i << e.bi_valid & 65535, e.bi_valid += t);
39
- }, F = (e, i, t) => {
40
- N(
41
- e,
42
- t[i * 2],
43
- t[i * 2 + 1]
44
- /*.Len*/
45
- );
46
- }, ci = (e, i) => {
47
- let t = 0;
48
- do
49
- t |= e & 1, e >>>= 1, t <<= 1;
50
- while (--i > 0);
51
- return t >>> 1;
52
- }, Ki = (e) => {
53
- e.bi_valid === 16 ? (xe(e, e.bi_buf), e.bi_buf = 0, e.bi_valid = 0) : e.bi_valid >= 8 && (e.pending_buf[e.pending++] = e.bi_buf & 255, e.bi_buf >>= 8, e.bi_valid -= 8);
54
- }, Pi = (e, i) => {
55
- const t = i.dyn_tree, a = i.max_code, n = i.stat_desc.static_tree, l = i.stat_desc.has_stree, o = i.stat_desc.extra_bits, f = i.stat_desc.extra_base, s = i.stat_desc.max_length;
56
- let r, _, E, c, h, u, m = 0;
57
- for (c = 0; c <= Q; c++)
58
- e.bl_count[c] = 0;
59
- for (t[e.heap[e.heap_max] * 2 + 1] = 0, r = e.heap_max + 1; r < ni; r++)
60
- _ = e.heap[r], c = t[t[_ * 2 + 1] * 2 + 1] + 1, c > s && (c = s, m++), t[_ * 2 + 1] = c, !(_ > a) && (e.bl_count[c]++, h = 0, _ >= f && (h = o[_ - f]), u = t[_ * 2], e.opt_len += u * (c + h), l && (e.static_len += u * (n[_ * 2 + 1] + h)));
61
- if (m !== 0) {
62
- do {
63
- for (c = s - 1; e.bl_count[c] === 0; )
64
- c--;
65
- e.bl_count[c]--, e.bl_count[c + 1] += 2, e.bl_count[s]--, m -= 2;
66
- } while (m > 0);
67
- for (c = s; c !== 0; c--)
68
- for (_ = e.bl_count[c]; _ !== 0; )
69
- E = e.heap[--r], !(E > a) && (t[E * 2 + 1] !== c && (e.opt_len += (c - t[E * 2 + 1]) * t[E * 2], t[E * 2 + 1] = c), _--);
70
- }
71
- }, si = (e, i, t) => {
72
- const a = new Array(Q + 1);
73
- let n = 0, l, o;
74
- for (l = 1; l <= Q; l++)
75
- a[l] = n = n + t[l - 1] << 1;
76
- for (o = 0; o <= i; o++) {
77
- let f = e[o * 2 + 1];
78
- f !== 0 && (e[o * 2] = ci(a[f]++, f));
79
- }
80
- }, Xi = () => {
81
- let e, i, t, a, n;
82
- const l = new Array(Q + 1);
83
- for (t = 0, a = 0; a < ht - 1; a++)
84
- for (st[a] = t, e = 0; e < 1 << rt[a]; e++)
85
- pe[t++] = a;
86
- for (pe[t - 1] = a, n = 0, a = 0; a < 16; a++)
87
- for (Me[a] = n, e = 0; e < 1 << Ue[a]; e++)
88
- ge[n++] = a;
89
- for (n >>= 7; a < re; a++)
90
- for (Me[a] = n << 7, e = 0; e < 1 << Ue[a] - 7; e++)
91
- ge[256 + n++] = a;
92
- for (i = 0; i <= Q; i++)
93
- l[i] = 0;
94
- for (e = 0; e <= 143; )
95
- B[e * 2 + 1] = 8, e++, l[8]++;
96
- for (; e <= 255; )
97
- B[e * 2 + 1] = 9, e++, l[9]++;
98
- for (; e <= 279; )
99
- B[e * 2 + 1] = 7, e++, l[7]++;
100
- for (; e <= 287; )
101
- B[e * 2 + 1] = 8, e++, l[8]++;
102
- for (si(B, we + 1, l), e = 0; e < re; e++)
103
- se[e * 2 + 1] = 5, se[e * 2] = ci(e, 5);
104
- oi = new Ge(B, rt, Se + 1, we, Q), _i = new Ge(se, Ue, 0, re, Q), hi = new Ge(new Array(0), Hi, 0, dt, Mi);
105
- }, ui = (e) => {
106
- let i;
107
- for (i = 0; i < we; i++)
108
- e.dyn_ltree[i * 2] = 0;
109
- for (i = 0; i < re; i++)
110
- e.dyn_dtree[i * 2] = 0;
111
- for (i = 0; i < dt; i++)
112
- e.bl_tree[i * 2] = 0;
113
- e.dyn_ltree[ct * 2] = 1, e.opt_len = e.static_len = 0, e.last_lit = e.matches = 0;
114
- }, bi = (e) => {
115
- e.bi_valid > 8 ? xe(e, e.bi_buf) : e.bi_valid > 0 && (e.pending_buf[e.pending++] = e.bi_buf), e.bi_buf = 0, e.bi_valid = 0;
116
- }, Yi = (e, i, t, a) => {
117
- bi(e), a && (xe(e, t), xe(e, ~t)), e.pending_buf.set(e.window.subarray(i, i + t), e.pending), e.pending += t;
118
- }, pt = (e, i, t, a) => {
119
- const n = i * 2, l = t * 2;
120
- return e[n] < e[l] || e[n] === e[l] && a[i] <= a[t];
121
- }, We = (e, i, t) => {
122
- const a = e.heap[t];
123
- let n = t << 1;
124
- for (; n <= e.heap_len && (n < e.heap_len && pt(i, e.heap[n + 1], e.heap[n], e.depth) && n++, !pt(i, a, e.heap[n], e.depth)); )
125
- e.heap[t] = e.heap[n], t = n, n <<= 1;
126
- e.heap[t] = a;
127
- }, xt = (e, i, t) => {
128
- let a, n, l = 0, o, f;
129
- if (e.last_lit !== 0)
130
- do
131
- a = e.pending_buf[e.d_buf + l * 2] << 8 | e.pending_buf[e.d_buf + l * 2 + 1], n = e.pending_buf[e.l_buf + l], l++, a === 0 ? F(e, n, i) : (o = pe[n], F(e, o + Se + 1, i), f = rt[o], f !== 0 && (n -= st[o], N(e, n, f)), a--, o = di(a), F(e, o, t), f = Ue[o], f !== 0 && (a -= Me[o], N(e, a, f)));
132
- while (l < e.last_lit);
133
- F(e, ct, i);
134
- }, ft = (e, i) => {
135
- const t = i.dyn_tree, a = i.stat_desc.static_tree, n = i.stat_desc.has_stree, l = i.stat_desc.elems;
136
- let o, f, s = -1, r;
137
- for (e.heap_len = 0, e.heap_max = ni, o = 0; o < l; o++)
138
- t[o * 2] !== 0 ? (e.heap[++e.heap_len] = s = o, e.depth[o] = 0) : t[o * 2 + 1] = 0;
139
- for (; e.heap_len < 2; )
140
- r = e.heap[++e.heap_len] = s < 2 ? ++s : 0, t[r * 2] = 1, e.depth[r] = 0, e.opt_len--, n && (e.static_len -= a[r * 2 + 1]);
141
- for (i.max_code = s, o = e.heap_len >> 1; o >= 1; o--)
142
- We(e, t, o);
143
- r = l;
144
- do
145
- o = e.heap[
146
- 1
147
- /*SMALLEST*/
148
- ], e.heap[
149
- 1
150
- /*SMALLEST*/
151
- ] = e.heap[e.heap_len--], We(
152
- e,
153
- t,
154
- 1
155
- /*SMALLEST*/
156
- ), f = e.heap[
157
- 1
158
- /*SMALLEST*/
159
- ], e.heap[--e.heap_max] = o, e.heap[--e.heap_max] = f, t[r * 2] = t[o * 2] + t[f * 2], e.depth[r] = (e.depth[o] >= e.depth[f] ? e.depth[o] : e.depth[f]) + 1, t[o * 2 + 1] = t[f * 2 + 1] = r, e.heap[
160
- 1
161
- /*SMALLEST*/
162
- ] = r++, We(
163
- e,
164
- t,
165
- 1
166
- /*SMALLEST*/
167
- );
168
- while (e.heap_len >= 2);
169
- e.heap[--e.heap_max] = e.heap[
170
- 1
171
- /*SMALLEST*/
172
- ], Pi(e, i), si(t, s, e.bl_count);
173
- }, kt = (e, i, t) => {
174
- let a, n = -1, l, o = i[0 * 2 + 1], f = 0, s = 7, r = 4;
175
- for (o === 0 && (s = 138, r = 3), i[(t + 1) * 2 + 1] = 65535, a = 0; a <= t; a++)
176
- l = o, o = i[(a + 1) * 2 + 1], !(++f < s && l === o) && (f < r ? e.bl_tree[l * 2] += f : l !== 0 ? (l !== n && e.bl_tree[l * 2]++, e.bl_tree[ai * 2]++) : f <= 10 ? e.bl_tree[li * 2]++ : e.bl_tree[ri * 2]++, f = 0, n = l, o === 0 ? (s = 138, r = 3) : l === o ? (s = 6, r = 3) : (s = 7, r = 4));
177
- }, vt = (e, i, t) => {
178
- let a, n = -1, l, o = i[0 * 2 + 1], f = 0, s = 7, r = 4;
179
- for (o === 0 && (s = 138, r = 3), a = 0; a <= t; a++)
180
- if (l = o, o = i[(a + 1) * 2 + 1], !(++f < s && l === o)) {
181
- if (f < r)
182
- do
183
- F(e, l, e.bl_tree);
184
- while (--f !== 0);
185
- else
186
- l !== 0 ? (l !== n && (F(e, l, e.bl_tree), f--), F(e, ai, e.bl_tree), N(e, f - 3, 2)) : f <= 10 ? (F(e, li, e.bl_tree), N(e, f - 3, 3)) : (F(e, ri, e.bl_tree), N(e, f - 11, 7));
187
- f = 0, n = l, o === 0 ? (s = 138, r = 3) : l === o ? (s = 6, r = 3) : (s = 7, r = 4);
188
- }
189
- }, Gi = (e) => {
190
- let i;
191
- for (kt(e, e.dyn_ltree, e.l_desc.max_code), kt(e, e.dyn_dtree, e.d_desc.max_code), ft(e, e.bl_desc), i = dt - 1; i >= 3 && e.bl_tree[fi[i] * 2 + 1] === 0; i--)
192
- ;
193
- return e.opt_len += 3 * (i + 1) + 5 + 5 + 4, i;
194
- }, ji = (e, i, t, a) => {
195
- let n;
196
- for (N(e, i - 257, 5), N(e, t - 1, 5), N(e, a - 4, 4), n = 0; n < a; n++)
197
- N(e, e.bl_tree[fi[n] * 2 + 1], 3);
198
- vt(e, e.dyn_ltree, i - 1), vt(e, e.dyn_dtree, t - 1);
199
- }, Wi = (e) => {
200
- let i = 4093624447, t;
201
- for (t = 0; t <= 31; t++, i >>>= 1)
202
- if (i & 1 && e.dyn_ltree[t * 2] !== 0)
203
- return 0;
204
- if (e.dyn_ltree[9 * 2] !== 0 || e.dyn_ltree[10 * 2] !== 0 || e.dyn_ltree[13 * 2] !== 0)
205
- return 1;
206
- for (t = 32; t < Se; t++)
207
- if (e.dyn_ltree[t * 2] !== 0)
208
- return 1;
209
- return 0;
210
- };
211
- let Et = !1;
212
- const Vi = (e) => {
213
- Et || (Xi(), Et = !0), e.l_desc = new je(e.dyn_ltree, oi), e.d_desc = new je(e.dyn_dtree, _i), e.bl_desc = new je(e.bl_tree, hi), e.bi_buf = 0, e.bi_valid = 0, ui(e);
214
- }, wi = (e, i, t, a) => {
215
- N(e, (Ui << 1) + (a ? 1 : 0), 3), Yi(e, i, t, !0);
216
- }, Ji = (e) => {
217
- N(e, ii << 1, 3), F(e, ct, B), Ki(e);
218
- }, Qi = (e, i, t, a) => {
219
- let n, l, o = 0;
220
- e.level > 0 ? (e.strm.data_type === 2 && (e.strm.data_type = Wi(e)), ft(e, e.l_desc), ft(e, e.d_desc), o = Gi(e), n = e.opt_len + 3 + 7 >>> 3, l = e.static_len + 3 + 7 >>> 3, l <= n && (n = l)) : n = l = t + 5, t + 4 <= n && i !== -1 ? wi(e, i, t, a) : e.strategy === 4 || l === n ? (N(e, (ii << 1) + (a ? 1 : 0), 3), xt(e, B, se)) : (N(e, (Ci << 1) + (a ? 1 : 0), 3), ji(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, o + 1), xt(e, e.dyn_ltree, e.dyn_dtree)), ui(e), a && bi(e);
221
- }, qi = (e, i, t) => (e.pending_buf[e.d_buf + e.last_lit * 2] = i >>> 8 & 255, e.pending_buf[e.d_buf + e.last_lit * 2 + 1] = i & 255, e.pending_buf[e.l_buf + e.last_lit] = t & 255, e.last_lit++, i === 0 ? e.dyn_ltree[t * 2]++ : (e.matches++, i--, e.dyn_ltree[(pe[t] + Se + 1) * 2]++, e.dyn_dtree[di(i) * 2]++), e.last_lit === e.lit_bufsize - 1);
222
- var en = Vi, tn = wi, nn = Qi, an = qi, ln = Ji, rn = {
223
- _tr_init: en,
224
- _tr_stored_block: tn,
225
- _tr_flush_block: nn,
226
- _tr_tally: an,
227
- _tr_align: ln
228
- };
229
- const fn = (e, i, t, a) => {
230
- let n = e & 65535 | 0, l = e >>> 16 & 65535 | 0, o = 0;
231
- for (; t !== 0; ) {
232
- o = t > 2e3 ? 2e3 : t, t -= o;
233
- do
234
- n = n + i[a++] | 0, l = l + n | 0;
235
- while (--o);
236
- n %= 65521, l %= 65521;
237
- }
238
- return n | l << 16 | 0;
239
- };
240
- var ke = fn;
241
- const on = () => {
242
- let e, i = [];
243
- for (var t = 0; t < 256; t++) {
244
- e = t;
245
- for (var a = 0; a < 8; a++)
246
- e = e & 1 ? 3988292384 ^ e >>> 1 : e >>> 1;
247
- i[t] = e;
248
- }
249
- return i;
250
- }, _n = new Uint32Array(on()), hn = (e, i, t, a) => {
251
- const n = _n, l = a + t;
252
- e ^= -1;
253
- for (let o = a; o < l; o++)
254
- e = e >>> 8 ^ n[(e ^ i[o]) & 255];
255
- return e ^ -1;
256
- };
257
- var I = hn, fe = {
258
- 2: "need dictionary",
259
- /* Z_NEED_DICT 2 */
260
- 1: "stream end",
261
- /* Z_STREAM_END 1 */
262
- 0: "",
263
- /* Z_OK 0 */
264
- "-1": "file error",
265
- /* Z_ERRNO (-1) */
266
- "-2": "stream error",
267
- /* Z_STREAM_ERROR (-2) */
268
- "-3": "data error",
269
- /* Z_DATA_ERROR (-3) */
270
- "-4": "insufficient memory",
271
- /* Z_MEM_ERROR (-4) */
272
- "-5": "buffer error",
273
- /* Z_BUF_ERROR (-5) */
274
- "-6": "incompatible version"
275
- /* Z_VERSION_ERROR (-6) */
276
- }, Ae = {
277
- /* Allowed flush values; see deflate() and inflate() below for details */
278
- Z_NO_FLUSH: 0,
279
- Z_PARTIAL_FLUSH: 1,
280
- Z_SYNC_FLUSH: 2,
281
- Z_FULL_FLUSH: 3,
282
- Z_FINISH: 4,
283
- Z_BLOCK: 5,
284
- Z_TREES: 6,
285
- /* Return codes for the compression/decompression functions. Negative values
286
- * are errors, positive values are used for special but normal events.
287
- */
288
- Z_OK: 0,
289
- Z_STREAM_END: 1,
290
- Z_NEED_DICT: 2,
291
- Z_ERRNO: -1,
292
- Z_STREAM_ERROR: -2,
293
- Z_DATA_ERROR: -3,
294
- Z_MEM_ERROR: -4,
295
- Z_BUF_ERROR: -5,
296
- //Z_VERSION_ERROR: -6,
297
- /* compression levels */
298
- Z_NO_COMPRESSION: 0,
299
- Z_BEST_SPEED: 1,
300
- Z_BEST_COMPRESSION: 9,
301
- Z_DEFAULT_COMPRESSION: -1,
302
- Z_FILTERED: 1,
303
- Z_HUFFMAN_ONLY: 2,
304
- Z_RLE: 3,
305
- Z_FIXED: 4,
306
- Z_DEFAULT_STRATEGY: 0,
307
- /* Possible values of the data_type field (though see inflate()) */
308
- Z_BINARY: 0,
309
- Z_TEXT: 1,
310
- //Z_ASCII: 1, // = Z_TEXT (deprecated)
311
- Z_UNKNOWN: 2,
312
- /* The deflate compression method */
313
- Z_DEFLATED: 8
314
- //Z_NULL: null // Use -1 or null inline, depending on var type
315
- };
316
- const { _tr_init: dn, _tr_stored_block: cn, _tr_flush_block: sn, _tr_tally: j, _tr_align: un } = rn, {
317
- Z_NO_FLUSH: ne,
318
- Z_PARTIAL_FLUSH: bn,
319
- Z_FULL_FLUSH: wn,
320
- Z_FINISH: W,
321
- Z_BLOCK: yt,
322
- Z_OK: M,
323
- Z_STREAM_END: St,
324
- Z_STREAM_ERROR: L,
325
- Z_DATA_ERROR: gn,
326
- Z_BUF_ERROR: Ve,
327
- Z_DEFAULT_COMPRESSION: pn,
328
- Z_FILTERED: xn,
329
- Z_HUFFMAN_ONLY: Ze,
330
- Z_RLE: kn,
331
- Z_FIXED: vn,
332
- Z_DEFAULT_STRATEGY: En,
333
- Z_UNKNOWN: yn,
334
- Z_DEFLATED: Ke
335
- } = Ae, Sn = 9, An = 15, Tn = 8, Rn = 29, zn = 256, ot = zn + 1 + Rn, mn = 30, Dn = 19, Zn = 2 * ot + 1, In = 15, k = 3, Y = 258, C = Y + k + 1, On = 32, Pe = 42, _t = 69, Ce = 73, $e = 91, Fe = 103, q = 113, de = 666, D = 1, Te = 2, ee = 3, _e = 4, Nn = 3, G = (e, i) => (e.msg = fe[i], i), At = (e) => (e << 1) - (e > 4 ? 9 : 0), X = (e) => {
336
- let i = e.length;
337
- for (; --i >= 0; )
338
- e[i] = 0;
339
- };
340
- let Ln = (e, i, t) => (i << e.hash_shift ^ t) & e.hash_mask, V = Ln;
341
- const P = (e) => {
342
- const i = e.state;
343
- let t = i.pending;
344
- t > e.avail_out && (t = e.avail_out), t !== 0 && (e.output.set(i.pending_buf.subarray(i.pending_out, i.pending_out + t), e.next_out), e.next_out += t, i.pending_out += t, e.total_out += t, e.avail_out -= t, i.pending -= t, i.pending === 0 && (i.pending_out = 0));
345
- }, O = (e, i) => {
346
- sn(e, e.block_start >= 0 ? e.block_start : -1, e.strstart - e.block_start, i), e.block_start = e.strstart, P(e.strm);
347
- }, y = (e, i) => {
348
- e.pending_buf[e.pending++] = i;
349
- }, he = (e, i) => {
350
- e.pending_buf[e.pending++] = i >>> 8 & 255, e.pending_buf[e.pending++] = i & 255;
351
- }, Un = (e, i, t, a) => {
352
- let n = e.avail_in;
353
- return n > a && (n = a), n === 0 ? 0 : (e.avail_in -= n, i.set(e.input.subarray(e.next_in, e.next_in + n), t), e.state.wrap === 1 ? e.adler = ke(e.adler, i, n, t) : e.state.wrap === 2 && (e.adler = I(e.adler, i, n, t)), e.next_in += n, e.total_in += n, n);
354
- }, gi = (e, i) => {
355
- let t = e.max_chain_length, a = e.strstart, n, l, o = e.prev_length, f = e.nice_match;
356
- const s = e.strstart > e.w_size - C ? e.strstart - (e.w_size - C) : 0, r = e.window, _ = e.w_mask, E = e.prev, c = e.strstart + Y;
357
- let h = r[a + o - 1], u = r[a + o];
358
- e.prev_length >= e.good_match && (t >>= 2), f > e.lookahead && (f = e.lookahead);
359
- do
360
- if (n = i, !(r[n + o] !== u || r[n + o - 1] !== h || r[n] !== r[a] || r[++n] !== r[a + 1])) {
361
- a += 2, n++;
362
- do
363
- ;
364
- while (r[++a] === r[++n] && r[++a] === r[++n] && r[++a] === r[++n] && r[++a] === r[++n] && r[++a] === r[++n] && r[++a] === r[++n] && r[++a] === r[++n] && r[++a] === r[++n] && a < c);
365
- if (l = Y - (c - a), a = c - Y, l > o) {
366
- if (e.match_start = i, o = l, l >= f)
367
- break;
368
- h = r[a + o - 1], u = r[a + o];
369
- }
370
- }
371
- while ((i = E[i & _]) > s && --t !== 0);
372
- return o <= e.lookahead ? o : e.lookahead;
373
- }, te = (e) => {
374
- const i = e.w_size;
375
- let t, a, n, l, o;
376
- do {
377
- if (l = e.window_size - e.lookahead - e.strstart, e.strstart >= i + (i - C)) {
378
- e.window.set(e.window.subarray(i, i + i), 0), e.match_start -= i, e.strstart -= i, e.block_start -= i, a = e.hash_size, t = a;
379
- do
380
- n = e.head[--t], e.head[t] = n >= i ? n - i : 0;
381
- while (--a);
382
- a = i, t = a;
383
- do
384
- n = e.prev[--t], e.prev[t] = n >= i ? n - i : 0;
385
- while (--a);
386
- l += i;
387
- }
388
- if (e.strm.avail_in === 0)
389
- break;
390
- if (a = Un(e.strm, e.window, e.strstart + e.lookahead, l), e.lookahead += a, e.lookahead + e.insert >= k)
391
- for (o = e.strstart - e.insert, e.ins_h = e.window[o], e.ins_h = V(e, e.ins_h, e.window[o + 1]); e.insert && (e.ins_h = V(e, e.ins_h, e.window[o + k - 1]), e.prev[o & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = o, o++, e.insert--, !(e.lookahead + e.insert < k)); )
392
- ;
393
- } while (e.lookahead < C && e.strm.avail_in !== 0);
394
- }, Cn = (e, i) => {
395
- let t = 65535;
396
- for (t > e.pending_buf_size - 5 && (t = e.pending_buf_size - 5); ; ) {
397
- if (e.lookahead <= 1) {
398
- if (te(e), e.lookahead === 0 && i === ne)
399
- return D;
400
- if (e.lookahead === 0)
401
- break;
402
- }
403
- e.strstart += e.lookahead, e.lookahead = 0;
404
- const a = e.block_start + t;
405
- if ((e.strstart === 0 || e.strstart >= a) && (e.lookahead = e.strstart - a, e.strstart = a, O(e, !1), e.strm.avail_out === 0) || e.strstart - e.block_start >= e.w_size - C && (O(e, !1), e.strm.avail_out === 0))
406
- return D;
407
- }
408
- return e.insert = 0, i === W ? (O(e, !0), e.strm.avail_out === 0 ? ee : _e) : (e.strstart > e.block_start && (O(e, !1), e.strm.avail_out === 0), D);
409
- }, Je = (e, i) => {
410
- let t, a;
411
- for (; ; ) {
412
- if (e.lookahead < C) {
413
- if (te(e), e.lookahead < C && i === ne)
414
- return D;
415
- if (e.lookahead === 0)
416
- break;
417
- }
418
- if (t = 0, e.lookahead >= k && (e.ins_h = V(e, e.ins_h, e.window[e.strstart + k - 1]), t = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), t !== 0 && e.strstart - t <= e.w_size - C && (e.match_length = gi(e, t)), e.match_length >= k)
419
- if (a = j(e, e.strstart - e.match_start, e.match_length - k), e.lookahead -= e.match_length, e.match_length <= e.max_lazy_match && e.lookahead >= k) {
420
- e.match_length--;
421
- do
422
- e.strstart++, e.ins_h = V(e, e.ins_h, e.window[e.strstart + k - 1]), t = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart;
423
- while (--e.match_length !== 0);
424
- e.strstart++;
425
- } else
426
- e.strstart += e.match_length, e.match_length = 0, e.ins_h = e.window[e.strstart], e.ins_h = V(e, e.ins_h, e.window[e.strstart + 1]);
427
- else
428
- a = j(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++;
429
- if (a && (O(e, !1), e.strm.avail_out === 0))
430
- return D;
431
- }
432
- return e.insert = e.strstart < k - 1 ? e.strstart : k - 1, i === W ? (O(e, !0), e.strm.avail_out === 0 ? ee : _e) : e.last_lit && (O(e, !1), e.strm.avail_out === 0) ? D : Te;
433
- }, ae = (e, i) => {
434
- let t, a, n;
435
- for (; ; ) {
436
- if (e.lookahead < C) {
437
- if (te(e), e.lookahead < C && i === ne)
438
- return D;
439
- if (e.lookahead === 0)
440
- break;
441
- }
442
- if (t = 0, e.lookahead >= k && (e.ins_h = V(e, e.ins_h, e.window[e.strstart + k - 1]), t = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), e.prev_length = e.match_length, e.prev_match = e.match_start, e.match_length = k - 1, t !== 0 && e.prev_length < e.max_lazy_match && e.strstart - t <= e.w_size - C && (e.match_length = gi(e, t), e.match_length <= 5 && (e.strategy === xn || e.match_length === k && e.strstart - e.match_start > 4096) && (e.match_length = k - 1)), e.prev_length >= k && e.match_length <= e.prev_length) {
443
- n = e.strstart + e.lookahead - k, a = j(e, e.strstart - 1 - e.prev_match, e.prev_length - k), e.lookahead -= e.prev_length - 1, e.prev_length -= 2;
444
- do
445
- ++e.strstart <= n && (e.ins_h = V(e, e.ins_h, e.window[e.strstart + k - 1]), t = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart);
446
- while (--e.prev_length !== 0);
447
- if (e.match_available = 0, e.match_length = k - 1, e.strstart++, a && (O(e, !1), e.strm.avail_out === 0))
448
- return D;
449
- } else if (e.match_available) {
450
- if (a = j(e, 0, e.window[e.strstart - 1]), a && O(e, !1), e.strstart++, e.lookahead--, e.strm.avail_out === 0)
451
- return D;
452
- } else
453
- e.match_available = 1, e.strstart++, e.lookahead--;
454
- }
455
- return e.match_available && (a = j(e, 0, e.window[e.strstart - 1]), e.match_available = 0), e.insert = e.strstart < k - 1 ? e.strstart : k - 1, i === W ? (O(e, !0), e.strm.avail_out === 0 ? ee : _e) : e.last_lit && (O(e, !1), e.strm.avail_out === 0) ? D : Te;
456
- }, $n = (e, i) => {
457
- let t, a, n, l;
458
- const o = e.window;
459
- for (; ; ) {
460
- if (e.lookahead <= Y) {
461
- if (te(e), e.lookahead <= Y && i === ne)
462
- return D;
463
- if (e.lookahead === 0)
464
- break;
465
- }
466
- if (e.match_length = 0, e.lookahead >= k && e.strstart > 0 && (n = e.strstart - 1, a = o[n], a === o[++n] && a === o[++n] && a === o[++n])) {
467
- l = e.strstart + Y;
468
- do
469
- ;
470
- while (a === o[++n] && a === o[++n] && a === o[++n] && a === o[++n] && a === o[++n] && a === o[++n] && a === o[++n] && a === o[++n] && n < l);
471
- e.match_length = Y - (l - n), e.match_length > e.lookahead && (e.match_length = e.lookahead);
472
- }
473
- if (e.match_length >= k ? (t = j(e, 1, e.match_length - k), e.lookahead -= e.match_length, e.strstart += e.match_length, e.match_length = 0) : (t = j(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++), t && (O(e, !1), e.strm.avail_out === 0))
474
- return D;
475
- }
476
- return e.insert = 0, i === W ? (O(e, !0), e.strm.avail_out === 0 ? ee : _e) : e.last_lit && (O(e, !1), e.strm.avail_out === 0) ? D : Te;
477
- }, Fn = (e, i) => {
478
- let t;
479
- for (; ; ) {
480
- if (e.lookahead === 0 && (te(e), e.lookahead === 0)) {
481
- if (i === ne)
482
- return D;
483
- break;
484
- }
485
- if (e.match_length = 0, t = j(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++, t && (O(e, !1), e.strm.avail_out === 0))
486
- return D;
487
- }
488
- return e.insert = 0, i === W ? (O(e, !0), e.strm.avail_out === 0 ? ee : _e) : e.last_lit && (O(e, !1), e.strm.avail_out === 0) ? D : Te;
489
- };
490
- function $(e, i, t, a, n) {
491
- this.good_length = e, this.max_lazy = i, this.nice_length = t, this.max_chain = a, this.func = n;
492
- }
493
- const ce = [
494
- /* good lazy nice chain */
495
- new $(0, 0, 0, 0, Cn),
496
- /* 0 store only */
497
- new $(4, 4, 8, 4, Je),
498
- /* 1 max speed, no lazy matches */
499
- new $(4, 5, 16, 8, Je),
500
- /* 2 */
501
- new $(4, 6, 32, 32, Je),
502
- /* 3 */
503
- new $(4, 4, 16, 16, ae),
504
- /* 4 lazy matches */
505
- new $(8, 16, 32, 32, ae),
506
- /* 5 */
507
- new $(8, 16, 128, 128, ae),
508
- /* 6 */
509
- new $(8, 32, 128, 256, ae),
510
- /* 7 */
511
- new $(32, 128, 258, 1024, ae),
512
- /* 8 */
513
- new $(32, 258, 258, 4096, ae)
514
- /* 9 max compression */
515
- ], Mn = (e) => {
516
- e.window_size = 2 * e.w_size, X(e.head), e.max_lazy_match = ce[e.level].max_lazy, e.good_match = ce[e.level].good_length, e.nice_match = ce[e.level].nice_length, e.max_chain_length = ce[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = k - 1, e.match_available = 0, e.ins_h = 0;
517
- };
518
- function Hn() {
519
- this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = Ke, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new Uint16Array(Zn * 2), this.dyn_dtree = new Uint16Array((2 * mn + 1) * 2), this.bl_tree = new Uint16Array((2 * Dn + 1) * 2), X(this.dyn_ltree), X(this.dyn_dtree), X(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new Uint16Array(In + 1), this.heap = new Uint16Array(2 * ot + 1), X(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new Uint16Array(2 * ot + 1), X(this.depth), this.l_buf = 0, this.lit_bufsize = 0, this.last_lit = 0, this.d_buf = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
520
- }
521
- const pi = (e) => {
522
- if (!e || !e.state)
523
- return G(e, L);
524
- e.total_in = e.total_out = 0, e.data_type = yn;
525
- const i = e.state;
526
- return i.pending = 0, i.pending_out = 0, i.wrap < 0 && (i.wrap = -i.wrap), i.status = i.wrap ? Pe : q, e.adler = i.wrap === 2 ? 0 : 1, i.last_flush = ne, dn(i), M;
527
- }, xi = (e) => {
528
- const i = pi(e);
529
- return i === M && Mn(e.state), i;
530
- }, Bn = (e, i) => !e || !e.state || e.state.wrap !== 2 ? L : (e.state.gzhead = i, M), ki = (e, i, t, a, n, l) => {
531
- if (!e)
532
- return L;
533
- let o = 1;
534
- if (i === pn && (i = 6), a < 0 ? (o = 0, a = -a) : a > 15 && (o = 2, a -= 16), n < 1 || n > Sn || t !== Ke || a < 8 || a > 15 || i < 0 || i > 9 || l < 0 || l > vn)
535
- return G(e, L);
536
- a === 8 && (a = 9);
537
- const f = new Hn();
538
- return e.state = f, f.strm = e, f.wrap = o, f.gzhead = null, f.w_bits = a, f.w_size = 1 << f.w_bits, f.w_mask = f.w_size - 1, f.hash_bits = n + 7, f.hash_size = 1 << f.hash_bits, f.hash_mask = f.hash_size - 1, f.hash_shift = ~~((f.hash_bits + k - 1) / k), f.window = new Uint8Array(f.w_size * 2), f.head = new Uint16Array(f.hash_size), f.prev = new Uint16Array(f.w_size), f.lit_bufsize = 1 << n + 6, f.pending_buf_size = f.lit_bufsize * 4, f.pending_buf = new Uint8Array(f.pending_buf_size), f.d_buf = 1 * f.lit_bufsize, f.l_buf = (1 + 2) * f.lit_bufsize, f.level = i, f.strategy = l, f.method = t, xi(e);
539
- }, Kn = (e, i) => ki(e, i, Ke, An, Tn, En), Pn = (e, i) => {
540
- let t, a;
541
- if (!e || !e.state || i > yt || i < 0)
542
- return e ? G(e, L) : L;
543
- const n = e.state;
544
- if (!e.output || !e.input && e.avail_in !== 0 || n.status === de && i !== W)
545
- return G(e, e.avail_out === 0 ? Ve : L);
546
- n.strm = e;
547
- const l = n.last_flush;
548
- if (n.last_flush = i, n.status === Pe)
549
- if (n.wrap === 2)
550
- e.adler = 0, y(n, 31), y(n, 139), y(n, 8), n.gzhead ? (y(
551
- n,
552
- (n.gzhead.text ? 1 : 0) + (n.gzhead.hcrc ? 2 : 0) + (n.gzhead.extra ? 4 : 0) + (n.gzhead.name ? 8 : 0) + (n.gzhead.comment ? 16 : 0)
553
- ), y(n, n.gzhead.time & 255), y(n, n.gzhead.time >> 8 & 255), y(n, n.gzhead.time >> 16 & 255), y(n, n.gzhead.time >> 24 & 255), y(n, n.level === 9 ? 2 : n.strategy >= Ze || n.level < 2 ? 4 : 0), y(n, n.gzhead.os & 255), n.gzhead.extra && n.gzhead.extra.length && (y(n, n.gzhead.extra.length & 255), y(n, n.gzhead.extra.length >> 8 & 255)), n.gzhead.hcrc && (e.adler = I(e.adler, n.pending_buf, n.pending, 0)), n.gzindex = 0, n.status = _t) : (y(n, 0), y(n, 0), y(n, 0), y(n, 0), y(n, 0), y(n, n.level === 9 ? 2 : n.strategy >= Ze || n.level < 2 ? 4 : 0), y(n, Nn), n.status = q);
554
- else {
555
- let o = Ke + (n.w_bits - 8 << 4) << 8, f = -1;
556
- n.strategy >= Ze || n.level < 2 ? f = 0 : n.level < 6 ? f = 1 : n.level === 6 ? f = 2 : f = 3, o |= f << 6, n.strstart !== 0 && (o |= On), o += 31 - o % 31, n.status = q, he(n, o), n.strstart !== 0 && (he(n, e.adler >>> 16), he(n, e.adler & 65535)), e.adler = 1;
557
- }
558
- if (n.status === _t)
559
- if (n.gzhead.extra) {
560
- for (t = n.pending; n.gzindex < (n.gzhead.extra.length & 65535) && !(n.pending === n.pending_buf_size && (n.gzhead.hcrc && n.pending > t && (e.adler = I(e.adler, n.pending_buf, n.pending - t, t)), P(e), t = n.pending, n.pending === n.pending_buf_size)); )
561
- y(n, n.gzhead.extra[n.gzindex] & 255), n.gzindex++;
562
- n.gzhead.hcrc && n.pending > t && (e.adler = I(e.adler, n.pending_buf, n.pending - t, t)), n.gzindex === n.gzhead.extra.length && (n.gzindex = 0, n.status = Ce);
563
- } else
564
- n.status = Ce;
565
- if (n.status === Ce)
566
- if (n.gzhead.name) {
567
- t = n.pending;
568
- do {
569
- if (n.pending === n.pending_buf_size && (n.gzhead.hcrc && n.pending > t && (e.adler = I(e.adler, n.pending_buf, n.pending - t, t)), P(e), t = n.pending, n.pending === n.pending_buf_size)) {
570
- a = 1;
571
- break;
572
- }
573
- n.gzindex < n.gzhead.name.length ? a = n.gzhead.name.charCodeAt(n.gzindex++) & 255 : a = 0, y(n, a);
574
- } while (a !== 0);
575
- n.gzhead.hcrc && n.pending > t && (e.adler = I(e.adler, n.pending_buf, n.pending - t, t)), a === 0 && (n.gzindex = 0, n.status = $e);
576
- } else
577
- n.status = $e;
578
- if (n.status === $e)
579
- if (n.gzhead.comment) {
580
- t = n.pending;
581
- do {
582
- if (n.pending === n.pending_buf_size && (n.gzhead.hcrc && n.pending > t && (e.adler = I(e.adler, n.pending_buf, n.pending - t, t)), P(e), t = n.pending, n.pending === n.pending_buf_size)) {
583
- a = 1;
584
- break;
585
- }
586
- n.gzindex < n.gzhead.comment.length ? a = n.gzhead.comment.charCodeAt(n.gzindex++) & 255 : a = 0, y(n, a);
587
- } while (a !== 0);
588
- n.gzhead.hcrc && n.pending > t && (e.adler = I(e.adler, n.pending_buf, n.pending - t, t)), a === 0 && (n.status = Fe);
589
- } else
590
- n.status = Fe;
591
- if (n.status === Fe && (n.gzhead.hcrc ? (n.pending + 2 > n.pending_buf_size && P(e), n.pending + 2 <= n.pending_buf_size && (y(n, e.adler & 255), y(n, e.adler >> 8 & 255), e.adler = 0, n.status = q)) : n.status = q), n.pending !== 0) {
592
- if (P(e), e.avail_out === 0)
593
- return n.last_flush = -1, M;
594
- } else if (e.avail_in === 0 && At(i) <= At(l) && i !== W)
595
- return G(e, Ve);
596
- if (n.status === de && e.avail_in !== 0)
597
- return G(e, Ve);
598
- if (e.avail_in !== 0 || n.lookahead !== 0 || i !== ne && n.status !== de) {
599
- let o = n.strategy === Ze ? Fn(n, i) : n.strategy === kn ? $n(n, i) : ce[n.level].func(n, i);
600
- if ((o === ee || o === _e) && (n.status = de), o === D || o === ee)
601
- return e.avail_out === 0 && (n.last_flush = -1), M;
602
- if (o === Te && (i === bn ? un(n) : i !== yt && (cn(n, 0, 0, !1), i === wn && (X(n.head), n.lookahead === 0 && (n.strstart = 0, n.block_start = 0, n.insert = 0))), P(e), e.avail_out === 0))
603
- return n.last_flush = -1, M;
604
- }
605
- return i !== W ? M : n.wrap <= 0 ? St : (n.wrap === 2 ? (y(n, e.adler & 255), y(n, e.adler >> 8 & 255), y(n, e.adler >> 16 & 255), y(n, e.adler >> 24 & 255), y(n, e.total_in & 255), y(n, e.total_in >> 8 & 255), y(n, e.total_in >> 16 & 255), y(n, e.total_in >> 24 & 255)) : (he(n, e.adler >>> 16), he(n, e.adler & 65535)), P(e), n.wrap > 0 && (n.wrap = -n.wrap), n.pending !== 0 ? M : St);
606
- }, Xn = (e) => {
607
- if (!e || !e.state)
608
- return L;
609
- const i = e.state.status;
610
- return i !== Pe && i !== _t && i !== Ce && i !== $e && i !== Fe && i !== q && i !== de ? G(e, L) : (e.state = null, i === q ? G(e, gn) : M);
611
- }, Yn = (e, i) => {
612
- let t = i.length;
613
- if (!e || !e.state)
614
- return L;
615
- const a = e.state, n = a.wrap;
616
- if (n === 2 || n === 1 && a.status !== Pe || a.lookahead)
617
- return L;
618
- if (n === 1 && (e.adler = ke(e.adler, i, t, 0)), a.wrap = 0, t >= a.w_size) {
619
- n === 0 && (X(a.head), a.strstart = 0, a.block_start = 0, a.insert = 0);
620
- let s = new Uint8Array(a.w_size);
621
- s.set(i.subarray(t - a.w_size, t), 0), i = s, t = a.w_size;
622
- }
623
- const l = e.avail_in, o = e.next_in, f = e.input;
624
- for (e.avail_in = t, e.next_in = 0, e.input = i, te(a); a.lookahead >= k; ) {
625
- let s = a.strstart, r = a.lookahead - (k - 1);
626
- do
627
- a.ins_h = V(a, a.ins_h, a.window[s + k - 1]), a.prev[s & a.w_mask] = a.head[a.ins_h], a.head[a.ins_h] = s, s++;
628
- while (--r);
629
- a.strstart = s, a.lookahead = k - 1, te(a);
630
- }
631
- return a.strstart += a.lookahead, a.block_start = a.strstart, a.insert = a.lookahead, a.lookahead = 0, a.match_length = a.prev_length = k - 1, a.match_available = 0, e.next_in = o, e.input = f, e.avail_in = l, a.wrap = n, M;
632
- };
633
- var Gn = Kn, jn = ki, Wn = xi, Vn = pi, Jn = Bn, Qn = Pn, qn = Xn, ea = Yn, ta = "pako deflate (from Nodeca project)", ue = {
634
- deflateInit: Gn,
635
- deflateInit2: jn,
636
- deflateReset: Wn,
637
- deflateResetKeep: Vn,
638
- deflateSetHeader: Jn,
639
- deflate: Qn,
640
- deflateEnd: qn,
641
- deflateSetDictionary: ea,
642
- deflateInfo: ta
643
- };
644
- const ia = (e, i) => Object.prototype.hasOwnProperty.call(e, i);
645
- var na = function(e) {
646
- const i = Array.prototype.slice.call(arguments, 1);
647
- for (; i.length; ) {
648
- const t = i.shift();
649
- if (t) {
650
- if (typeof t != "object")
651
- throw new TypeError(t + "must be non-object");
652
- for (const a in t)
653
- ia(t, a) && (e[a] = t[a]);
654
- }
655
- }
656
- return e;
657
- }, aa = (e) => {
658
- let i = 0;
659
- for (let a = 0, n = e.length; a < n; a++)
660
- i += e[a].length;
661
- const t = new Uint8Array(i);
662
- for (let a = 0, n = 0, l = e.length; a < l; a++) {
663
- let o = e[a];
664
- t.set(o, n), n += o.length;
665
- }
666
- return t;
667
- }, Xe = {
668
- assign: na,
669
- flattenChunks: aa
670
- };
671
- let vi = !0;
672
- try {
673
- String.fromCharCode.apply(null, new Uint8Array(1));
674
- } catch {
675
- vi = !1;
676
- }
677
- const ve = new Uint8Array(256);
678
- for (let e = 0; e < 256; e++)
679
- ve[e] = e >= 252 ? 6 : e >= 248 ? 5 : e >= 240 ? 4 : e >= 224 ? 3 : e >= 192 ? 2 : 1;
680
- ve[254] = ve[254] = 1;
681
- var la = (e) => {
682
- if (typeof TextEncoder == "function" && TextEncoder.prototype.encode)
683
- return new TextEncoder().encode(e);
684
- let i, t, a, n, l, o = e.length, f = 0;
685
- for (n = 0; n < o; n++)
686
- t = e.charCodeAt(n), (t & 64512) === 55296 && n + 1 < o && (a = e.charCodeAt(n + 1), (a & 64512) === 56320 && (t = 65536 + (t - 55296 << 10) + (a - 56320), n++)), f += t < 128 ? 1 : t < 2048 ? 2 : t < 65536 ? 3 : 4;
687
- for (i = new Uint8Array(f), l = 0, n = 0; l < f; n++)
688
- t = e.charCodeAt(n), (t & 64512) === 55296 && n + 1 < o && (a = e.charCodeAt(n + 1), (a & 64512) === 56320 && (t = 65536 + (t - 55296 << 10) + (a - 56320), n++)), t < 128 ? i[l++] = t : t < 2048 ? (i[l++] = 192 | t >>> 6, i[l++] = 128 | t & 63) : t < 65536 ? (i[l++] = 224 | t >>> 12, i[l++] = 128 | t >>> 6 & 63, i[l++] = 128 | t & 63) : (i[l++] = 240 | t >>> 18, i[l++] = 128 | t >>> 12 & 63, i[l++] = 128 | t >>> 6 & 63, i[l++] = 128 | t & 63);
689
- return i;
690
- };
691
- const ra = (e, i) => {
692
- if (i < 65534 && e.subarray && vi)
693
- return String.fromCharCode.apply(null, e.length === i ? e : e.subarray(0, i));
694
- let t = "";
695
- for (let a = 0; a < i; a++)
696
- t += String.fromCharCode(e[a]);
697
- return t;
698
- };
699
- var fa = (e, i) => {
700
- const t = i || e.length;
701
- if (typeof TextDecoder == "function" && TextDecoder.prototype.decode)
702
- return new TextDecoder().decode(e.subarray(0, i));
703
- let a, n;
704
- const l = new Array(t * 2);
705
- for (n = 0, a = 0; a < t; ) {
706
- let o = e[a++];
707
- if (o < 128) {
708
- l[n++] = o;
709
- continue;
710
- }
711
- let f = ve[o];
712
- if (f > 4) {
713
- l[n++] = 65533, a += f - 1;
714
- continue;
715
- }
716
- for (o &= f === 2 ? 31 : f === 3 ? 15 : 7; f > 1 && a < t; )
717
- o = o << 6 | e[a++] & 63, f--;
718
- if (f > 1) {
719
- l[n++] = 65533;
720
- continue;
721
- }
722
- o < 65536 ? l[n++] = o : (o -= 65536, l[n++] = 55296 | o >> 10 & 1023, l[n++] = 56320 | o & 1023);
723
- }
724
- return ra(l, n);
725
- }, oa = (e, i) => {
726
- i = i || e.length, i > e.length && (i = e.length);
727
- let t = i - 1;
728
- for (; t >= 0 && (e[t] & 192) === 128; )
729
- t--;
730
- return t < 0 || t === 0 ? i : t + ve[e[t]] > i ? t : i;
731
- }, Ee = {
732
- string2buf: la,
733
- buf2string: fa,
734
- utf8border: oa
735
- };
736
- function _a() {
737
- this.input = null, this.next_in = 0, this.avail_in = 0, this.total_in = 0, this.output = null, this.next_out = 0, this.avail_out = 0, this.total_out = 0, this.msg = "", this.state = null, this.data_type = 2, this.adler = 0;
738
- }
739
- var Ei = _a;
740
- const yi = Object.prototype.toString, {
741
- Z_NO_FLUSH: ha,
742
- Z_SYNC_FLUSH: da,
743
- Z_FULL_FLUSH: ca,
744
- Z_FINISH: sa,
745
- Z_OK: He,
746
- Z_STREAM_END: ua,
747
- Z_DEFAULT_COMPRESSION: ba,
748
- Z_DEFAULT_STRATEGY: wa,
749
- Z_DEFLATED: ga
750
- } = Ae;
751
- function ut(e) {
752
- this.options = Xe.assign({
753
- level: ba,
754
- method: ga,
755
- chunkSize: 16384,
756
- windowBits: 15,
757
- memLevel: 8,
758
- strategy: wa
759
- }, e || {});
760
- let i = this.options;
761
- i.raw && i.windowBits > 0 ? i.windowBits = -i.windowBits : i.gzip && i.windowBits > 0 && i.windowBits < 16 && (i.windowBits += 16), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new Ei(), this.strm.avail_out = 0;
762
- let t = ue.deflateInit2(
763
- this.strm,
764
- i.level,
765
- i.method,
766
- i.windowBits,
767
- i.memLevel,
768
- i.strategy
769
- );
770
- if (t !== He)
771
- throw new Error(fe[t]);
772
- if (i.header && ue.deflateSetHeader(this.strm, i.header), i.dictionary) {
773
- let a;
774
- if (typeof i.dictionary == "string" ? a = Ee.string2buf(i.dictionary) : yi.call(i.dictionary) === "[object ArrayBuffer]" ? a = new Uint8Array(i.dictionary) : a = i.dictionary, t = ue.deflateSetDictionary(this.strm, a), t !== He)
775
- throw new Error(fe[t]);
776
- this._dict_set = !0;
777
- }
778
- }
779
- ut.prototype.push = function(e, i) {
780
- const t = this.strm, a = this.options.chunkSize;
781
- let n, l;
782
- if (this.ended)
783
- return !1;
784
- for (i === ~~i ? l = i : l = i === !0 ? sa : ha, typeof e == "string" ? t.input = Ee.string2buf(e) : yi.call(e) === "[object ArrayBuffer]" ? t.input = new Uint8Array(e) : t.input = e, t.next_in = 0, t.avail_in = t.input.length; ; ) {
785
- if (t.avail_out === 0 && (t.output = new Uint8Array(a), t.next_out = 0, t.avail_out = a), (l === da || l === ca) && t.avail_out <= 6) {
786
- this.onData(t.output.subarray(0, t.next_out)), t.avail_out = 0;
787
- continue;
788
- }
789
- if (n = ue.deflate(t, l), n === ua)
790
- return t.next_out > 0 && this.onData(t.output.subarray(0, t.next_out)), n = ue.deflateEnd(this.strm), this.onEnd(n), this.ended = !0, n === He;
791
- if (t.avail_out === 0) {
792
- this.onData(t.output);
793
- continue;
794
- }
795
- if (l > 0 && t.next_out > 0) {
796
- this.onData(t.output.subarray(0, t.next_out)), t.avail_out = 0;
797
- continue;
798
- }
799
- if (t.avail_in === 0)
800
- break;
801
- }
802
- return !0;
803
- };
804
- ut.prototype.onData = function(e) {
805
- this.chunks.push(e);
806
- };
807
- ut.prototype.onEnd = function(e) {
808
- e === He && (this.result = Xe.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
809
- };
810
- const Ie = 30, pa = 12;
811
- var xa = function(i, t) {
812
- let a, n, l, o, f, s, r, _, E, c, h, u, m, v, w, A, x, d, S, Z, b, R, T, g;
813
- const p = i.state;
814
- a = i.next_in, T = i.input, n = a + (i.avail_in - 5), l = i.next_out, g = i.output, o = l - (t - i.avail_out), f = l + (i.avail_out - 257), s = p.dmax, r = p.wsize, _ = p.whave, E = p.wnext, c = p.window, h = p.hold, u = p.bits, m = p.lencode, v = p.distcode, w = (1 << p.lenbits) - 1, A = (1 << p.distbits) - 1;
815
- e:
816
- do {
817
- u < 15 && (h += T[a++] << u, u += 8, h += T[a++] << u, u += 8), x = m[h & w];
818
- t:
819
- for (; ; ) {
820
- if (d = x >>> 24, h >>>= d, u -= d, d = x >>> 16 & 255, d === 0)
821
- g[l++] = x & 65535;
822
- else if (d & 16) {
823
- S = x & 65535, d &= 15, d && (u < d && (h += T[a++] << u, u += 8), S += h & (1 << d) - 1, h >>>= d, u -= d), u < 15 && (h += T[a++] << u, u += 8, h += T[a++] << u, u += 8), x = v[h & A];
824
- i:
825
- for (; ; ) {
826
- if (d = x >>> 24, h >>>= d, u -= d, d = x >>> 16 & 255, d & 16) {
827
- if (Z = x & 65535, d &= 15, u < d && (h += T[a++] << u, u += 8, u < d && (h += T[a++] << u, u += 8)), Z += h & (1 << d) - 1, Z > s) {
828
- i.msg = "invalid distance too far back", p.mode = Ie;
829
- break e;
830
- }
831
- if (h >>>= d, u -= d, d = l - o, Z > d) {
832
- if (d = Z - d, d > _ && p.sane) {
833
- i.msg = "invalid distance too far back", p.mode = Ie;
834
- break e;
835
- }
836
- if (b = 0, R = c, E === 0) {
837
- if (b += r - d, d < S) {
838
- S -= d;
839
- do
840
- g[l++] = c[b++];
841
- while (--d);
842
- b = l - Z, R = g;
843
- }
844
- } else if (E < d) {
845
- if (b += r + E - d, d -= E, d < S) {
846
- S -= d;
847
- do
848
- g[l++] = c[b++];
849
- while (--d);
850
- if (b = 0, E < S) {
851
- d = E, S -= d;
852
- do
853
- g[l++] = c[b++];
854
- while (--d);
855
- b = l - Z, R = g;
856
- }
857
- }
858
- } else if (b += E - d, d < S) {
859
- S -= d;
860
- do
861
- g[l++] = c[b++];
862
- while (--d);
863
- b = l - Z, R = g;
864
- }
865
- for (; S > 2; )
866
- g[l++] = R[b++], g[l++] = R[b++], g[l++] = R[b++], S -= 3;
867
- S && (g[l++] = R[b++], S > 1 && (g[l++] = R[b++]));
868
- } else {
869
- b = l - Z;
870
- do
871
- g[l++] = g[b++], g[l++] = g[b++], g[l++] = g[b++], S -= 3;
872
- while (S > 2);
873
- S && (g[l++] = g[b++], S > 1 && (g[l++] = g[b++]));
874
- }
875
- } else if (d & 64) {
876
- i.msg = "invalid distance code", p.mode = Ie;
877
- break e;
878
- } else {
879
- x = v[(x & 65535) + (h & (1 << d) - 1)];
880
- continue i;
881
- }
882
- break;
883
- }
884
- } else if (d & 64)
885
- if (d & 32) {
886
- p.mode = pa;
887
- break e;
888
- } else {
889
- i.msg = "invalid literal/length code", p.mode = Ie;
890
- break e;
891
- }
892
- else {
893
- x = m[(x & 65535) + (h & (1 << d) - 1)];
894
- continue t;
895
- }
896
- break;
897
- }
898
- } while (a < n && l < f);
899
- S = u >> 3, a -= S, u -= S << 3, h &= (1 << u) - 1, i.next_in = a, i.next_out = l, i.avail_in = a < n ? 5 + (n - a) : 5 - (a - n), i.avail_out = l < f ? 257 + (f - l) : 257 - (l - f), p.hold = h, p.bits = u;
900
- };
901
- const le = 15, Tt = 852, Rt = 592, zt = 0, Qe = 1, mt = 2, ka = new Uint16Array([
902
- /* Length codes 257..285 base */
903
- 3,
904
- 4,
905
- 5,
906
- 6,
907
- 7,
908
- 8,
909
- 9,
910
- 10,
911
- 11,
912
- 13,
913
- 15,
914
- 17,
915
- 19,
916
- 23,
917
- 27,
918
- 31,
919
- 35,
920
- 43,
921
- 51,
922
- 59,
923
- 67,
924
- 83,
925
- 99,
926
- 115,
927
- 131,
928
- 163,
929
- 195,
930
- 227,
931
- 258,
932
- 0,
933
- 0
934
- ]), va = new Uint8Array([
935
- /* Length codes 257..285 extra */
936
- 16,
937
- 16,
938
- 16,
939
- 16,
940
- 16,
941
- 16,
942
- 16,
943
- 16,
944
- 17,
945
- 17,
946
- 17,
947
- 17,
948
- 18,
949
- 18,
950
- 18,
951
- 18,
952
- 19,
953
- 19,
954
- 19,
955
- 19,
956
- 20,
957
- 20,
958
- 20,
959
- 20,
960
- 21,
961
- 21,
962
- 21,
963
- 21,
964
- 16,
965
- 72,
966
- 78
967
- ]), Ea = new Uint16Array([
968
- /* Distance codes 0..29 base */
969
- 1,
970
- 2,
971
- 3,
972
- 4,
973
- 5,
974
- 7,
975
- 9,
976
- 13,
977
- 17,
978
- 25,
979
- 33,
980
- 49,
981
- 65,
982
- 97,
983
- 129,
984
- 193,
985
- 257,
986
- 385,
987
- 513,
988
- 769,
989
- 1025,
990
- 1537,
991
- 2049,
992
- 3073,
993
- 4097,
994
- 6145,
995
- 8193,
996
- 12289,
997
- 16385,
998
- 24577,
999
- 0,
1000
- 0
1001
- ]), ya = new Uint8Array([
1002
- /* Distance codes 0..29 extra */
1003
- 16,
1004
- 16,
1005
- 16,
1006
- 16,
1007
- 17,
1008
- 17,
1009
- 18,
1010
- 18,
1011
- 19,
1012
- 19,
1013
- 20,
1014
- 20,
1015
- 21,
1016
- 21,
1017
- 22,
1018
- 22,
1019
- 23,
1020
- 23,
1021
- 24,
1022
- 24,
1023
- 25,
1024
- 25,
1025
- 26,
1026
- 26,
1027
- 27,
1028
- 27,
1029
- 28,
1030
- 28,
1031
- 29,
1032
- 29,
1033
- 64,
1034
- 64
1035
- ]), Sa = (e, i, t, a, n, l, o, f) => {
1036
- const s = f.bits;
1037
- let r = 0, _ = 0, E = 0, c = 0, h = 0, u = 0, m = 0, v = 0, w = 0, A = 0, x, d, S, Z, b, R = null, T = 0, g;
1038
- const p = new Uint16Array(le + 1), J = new Uint16Array(le + 1);
1039
- let ze = null, wt = 0, gt, me, De;
1040
- for (r = 0; r <= le; r++)
1041
- p[r] = 0;
1042
- for (_ = 0; _ < a; _++)
1043
- p[i[t + _]]++;
1044
- for (h = s, c = le; c >= 1 && p[c] === 0; c--)
1045
- ;
1046
- if (h > c && (h = c), c === 0)
1047
- return n[l++] = 1 << 24 | 64 << 16 | 0, n[l++] = 1 << 24 | 64 << 16 | 0, f.bits = 1, 0;
1048
- for (E = 1; E < c && p[E] === 0; E++)
1049
- ;
1050
- for (h < E && (h = E), v = 1, r = 1; r <= le; r++)
1051
- if (v <<= 1, v -= p[r], v < 0)
1052
- return -1;
1053
- if (v > 0 && (e === zt || c !== 1))
1054
- return -1;
1055
- for (J[1] = 0, r = 1; r < le; r++)
1056
- J[r + 1] = J[r] + p[r];
1057
- for (_ = 0; _ < a; _++)
1058
- i[t + _] !== 0 && (o[J[i[t + _]]++] = _);
1059
- if (e === zt ? (R = ze = o, g = 19) : e === Qe ? (R = ka, T -= 257, ze = va, wt -= 257, g = 256) : (R = Ea, ze = ya, g = -1), A = 0, _ = 0, r = E, b = l, u = h, m = 0, S = -1, w = 1 << h, Z = w - 1, e === Qe && w > Tt || e === mt && w > Rt)
1060
- return 1;
1061
- for (; ; ) {
1062
- gt = r - m, o[_] < g ? (me = 0, De = o[_]) : o[_] > g ? (me = ze[wt + o[_]], De = R[T + o[_]]) : (me = 32 + 64, De = 0), x = 1 << r - m, d = 1 << u, E = d;
1063
- do
1064
- d -= x, n[b + (A >> m) + d] = gt << 24 | me << 16 | De | 0;
1065
- while (d !== 0);
1066
- for (x = 1 << r - 1; A & x; )
1067
- x >>= 1;
1068
- if (x !== 0 ? (A &= x - 1, A += x) : A = 0, _++, --p[r] === 0) {
1069
- if (r === c)
1070
- break;
1071
- r = i[t + o[_]];
1072
- }
1073
- if (r > h && (A & Z) !== S) {
1074
- for (m === 0 && (m = h), b += E, u = r - m, v = 1 << u; u + m < c && (v -= p[u + m], !(v <= 0)); )
1075
- u++, v <<= 1;
1076
- if (w += 1 << u, e === Qe && w > Tt || e === mt && w > Rt)
1077
- return 1;
1078
- S = A & Z, n[S] = h << 24 | u << 16 | b - l | 0;
1079
- }
1080
- }
1081
- return A !== 0 && (n[b + A] = r - m << 24 | 64 << 16 | 0), f.bits = h, 0;
1082
- };
1083
- var be = Sa;
1084
- const Aa = 0, Si = 1, Ai = 2, {
1085
- Z_FINISH: Dt,
1086
- Z_BLOCK: Ta,
1087
- Z_TREES: Oe,
1088
- Z_OK: ie,
1089
- Z_STREAM_END: Ra,
1090
- Z_NEED_DICT: za,
1091
- Z_STREAM_ERROR: U,
1092
- Z_DATA_ERROR: Ti,
1093
- Z_MEM_ERROR: Ri,
1094
- Z_BUF_ERROR: ma,
1095
- Z_DEFLATED: Zt
1096
- } = Ae, zi = 1, It = 2, Ot = 3, Nt = 4, Lt = 5, Ut = 6, Ct = 7, $t = 8, Ft = 9, Mt = 10, Be = 11, H = 12, qe = 13, Ht = 14, et = 15, Bt = 16, Kt = 17, Pt = 18, Xt = 19, Ne = 20, Le = 21, Yt = 22, Gt = 23, jt = 24, Wt = 25, Vt = 26, tt = 27, Jt = 28, Qt = 29, z = 30, mi = 31, Da = 32, Za = 852, Ia = 592, Oa = 15, Na = Oa, qt = (e) => (e >>> 24 & 255) + (e >>> 8 & 65280) + ((e & 65280) << 8) + ((e & 255) << 24);
1097
- function La() {
1098
- this.mode = 0, this.last = !1, this.wrap = 0, this.havedict = !1, this.flags = 0, this.dmax = 0, this.check = 0, this.total = 0, this.head = null, this.wbits = 0, this.wsize = 0, this.whave = 0, this.wnext = 0, this.window = null, this.hold = 0, this.bits = 0, this.length = 0, this.offset = 0, this.extra = 0, this.lencode = null, this.distcode = null, this.lenbits = 0, this.distbits = 0, this.ncode = 0, this.nlen = 0, this.ndist = 0, this.have = 0, this.next = null, this.lens = new Uint16Array(320), this.work = new Uint16Array(288), this.lendyn = null, this.distdyn = null, this.sane = 0, this.back = 0, this.was = 0;
1099
- }
1100
- const Di = (e) => {
1101
- if (!e || !e.state)
1102
- return U;
1103
- const i = e.state;
1104
- return e.total_in = e.total_out = i.total = 0, e.msg = "", i.wrap && (e.adler = i.wrap & 1), i.mode = zi, i.last = 0, i.havedict = 0, i.dmax = 32768, i.head = null, i.hold = 0, i.bits = 0, i.lencode = i.lendyn = new Int32Array(Za), i.distcode = i.distdyn = new Int32Array(Ia), i.sane = 1, i.back = -1, ie;
1105
- }, Zi = (e) => {
1106
- if (!e || !e.state)
1107
- return U;
1108
- const i = e.state;
1109
- return i.wsize = 0, i.whave = 0, i.wnext = 0, Di(e);
1110
- }, Ii = (e, i) => {
1111
- let t;
1112
- if (!e || !e.state)
1113
- return U;
1114
- const a = e.state;
1115
- return i < 0 ? (t = 0, i = -i) : (t = (i >> 4) + 1, i < 48 && (i &= 15)), i && (i < 8 || i > 15) ? U : (a.window !== null && a.wbits !== i && (a.window = null), a.wrap = t, a.wbits = i, Zi(e));
1116
- }, Oi = (e, i) => {
1117
- if (!e)
1118
- return U;
1119
- const t = new La();
1120
- e.state = t, t.window = null;
1121
- const a = Ii(e, i);
1122
- return a !== ie && (e.state = null), a;
1123
- }, Ua = (e) => Oi(e, Na);
1124
- let ei = !0, it, nt;
1125
- const Ca = (e) => {
1126
- if (ei) {
1127
- it = new Int32Array(512), nt = new Int32Array(32);
1128
- let i = 0;
1129
- for (; i < 144; )
1130
- e.lens[i++] = 8;
1131
- for (; i < 256; )
1132
- e.lens[i++] = 9;
1133
- for (; i < 280; )
1134
- e.lens[i++] = 7;
1135
- for (; i < 288; )
1136
- e.lens[i++] = 8;
1137
- for (be(Si, e.lens, 0, 288, it, 0, e.work, { bits: 9 }), i = 0; i < 32; )
1138
- e.lens[i++] = 5;
1139
- be(Ai, e.lens, 0, 32, nt, 0, e.work, { bits: 5 }), ei = !1;
1140
- }
1141
- e.lencode = it, e.lenbits = 9, e.distcode = nt, e.distbits = 5;
1142
- }, Ni = (e, i, t, a) => {
1143
- let n;
1144
- const l = e.state;
1145
- return l.window === null && (l.wsize = 1 << l.wbits, l.wnext = 0, l.whave = 0, l.window = new Uint8Array(l.wsize)), a >= l.wsize ? (l.window.set(i.subarray(t - l.wsize, t), 0), l.wnext = 0, l.whave = l.wsize) : (n = l.wsize - l.wnext, n > a && (n = a), l.window.set(i.subarray(t - a, t - a + n), l.wnext), a -= n, a ? (l.window.set(i.subarray(t - a, t), 0), l.wnext = a, l.whave = l.wsize) : (l.wnext += n, l.wnext === l.wsize && (l.wnext = 0), l.whave < l.wsize && (l.whave += n))), 0;
1146
- }, $a = (e, i) => {
1147
- let t, a, n, l, o, f, s, r, _, E, c, h, u, m, v = 0, w, A, x, d, S, Z, b, R;
1148
- const T = new Uint8Array(4);
1149
- let g, p;
1150
- const J = (
1151
- /* permutation of code lengths */
1152
- new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15])
1153
- );
1154
- if (!e || !e.state || !e.output || !e.input && e.avail_in !== 0)
1155
- return U;
1156
- t = e.state, t.mode === H && (t.mode = qe), o = e.next_out, n = e.output, s = e.avail_out, l = e.next_in, a = e.input, f = e.avail_in, r = t.hold, _ = t.bits, E = f, c = s, R = ie;
1157
- e:
1158
- for (; ; )
1159
- switch (t.mode) {
1160
- case zi:
1161
- if (t.wrap === 0) {
1162
- t.mode = qe;
1163
- break;
1164
- }
1165
- for (; _ < 16; ) {
1166
- if (f === 0)
1167
- break e;
1168
- f--, r += a[l++] << _, _ += 8;
1169
- }
1170
- if (t.wrap & 2 && r === 35615) {
1171
- t.check = 0, T[0] = r & 255, T[1] = r >>> 8 & 255, t.check = I(t.check, T, 2, 0), r = 0, _ = 0, t.mode = It;
1172
- break;
1173
- }
1174
- if (t.flags = 0, t.head && (t.head.done = !1), !(t.wrap & 1) || /* check if zlib header allowed */
1175
- (((r & 255) << 8) + (r >> 8)) % 31) {
1176
- e.msg = "incorrect header check", t.mode = z;
1177
- break;
1178
- }
1179
- if ((r & 15) !== Zt) {
1180
- e.msg = "unknown compression method", t.mode = z;
1181
- break;
1182
- }
1183
- if (r >>>= 4, _ -= 4, b = (r & 15) + 8, t.wbits === 0)
1184
- t.wbits = b;
1185
- else if (b > t.wbits) {
1186
- e.msg = "invalid window size", t.mode = z;
1187
- break;
1188
- }
1189
- t.dmax = 1 << t.wbits, e.adler = t.check = 1, t.mode = r & 512 ? Mt : H, r = 0, _ = 0;
1190
- break;
1191
- case It:
1192
- for (; _ < 16; ) {
1193
- if (f === 0)
1194
- break e;
1195
- f--, r += a[l++] << _, _ += 8;
1196
- }
1197
- if (t.flags = r, (t.flags & 255) !== Zt) {
1198
- e.msg = "unknown compression method", t.mode = z;
1199
- break;
1200
- }
1201
- if (t.flags & 57344) {
1202
- e.msg = "unknown header flags set", t.mode = z;
1203
- break;
1204
- }
1205
- t.head && (t.head.text = r >> 8 & 1), t.flags & 512 && (T[0] = r & 255, T[1] = r >>> 8 & 255, t.check = I(t.check, T, 2, 0)), r = 0, _ = 0, t.mode = Ot;
1206
- case Ot:
1207
- for (; _ < 32; ) {
1208
- if (f === 0)
1209
- break e;
1210
- f--, r += a[l++] << _, _ += 8;
1211
- }
1212
- t.head && (t.head.time = r), t.flags & 512 && (T[0] = r & 255, T[1] = r >>> 8 & 255, T[2] = r >>> 16 & 255, T[3] = r >>> 24 & 255, t.check = I(t.check, T, 4, 0)), r = 0, _ = 0, t.mode = Nt;
1213
- case Nt:
1214
- for (; _ < 16; ) {
1215
- if (f === 0)
1216
- break e;
1217
- f--, r += a[l++] << _, _ += 8;
1218
- }
1219
- t.head && (t.head.xflags = r & 255, t.head.os = r >> 8), t.flags & 512 && (T[0] = r & 255, T[1] = r >>> 8 & 255, t.check = I(t.check, T, 2, 0)), r = 0, _ = 0, t.mode = Lt;
1220
- case Lt:
1221
- if (t.flags & 1024) {
1222
- for (; _ < 16; ) {
1223
- if (f === 0)
1224
- break e;
1225
- f--, r += a[l++] << _, _ += 8;
1226
- }
1227
- t.length = r, t.head && (t.head.extra_len = r), t.flags & 512 && (T[0] = r & 255, T[1] = r >>> 8 & 255, t.check = I(t.check, T, 2, 0)), r = 0, _ = 0;
1228
- } else
1229
- t.head && (t.head.extra = null);
1230
- t.mode = Ut;
1231
- case Ut:
1232
- if (t.flags & 1024 && (h = t.length, h > f && (h = f), h && (t.head && (b = t.head.extra_len - t.length, t.head.extra || (t.head.extra = new Uint8Array(t.head.extra_len)), t.head.extra.set(
1233
- a.subarray(
1234
- l,
1235
- // extra field is limited to 65536 bytes
1236
- // - no need for additional size check
1237
- l + h
1238
- ),
1239
- /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/
1240
- b
1241
- )), t.flags & 512 && (t.check = I(t.check, a, h, l)), f -= h, l += h, t.length -= h), t.length))
1242
- break e;
1243
- t.length = 0, t.mode = Ct;
1244
- case Ct:
1245
- if (t.flags & 2048) {
1246
- if (f === 0)
1247
- break e;
1248
- h = 0;
1249
- do
1250
- b = a[l + h++], t.head && b && t.length < 65536 && (t.head.name += String.fromCharCode(b));
1251
- while (b && h < f);
1252
- if (t.flags & 512 && (t.check = I(t.check, a, h, l)), f -= h, l += h, b)
1253
- break e;
1254
- } else
1255
- t.head && (t.head.name = null);
1256
- t.length = 0, t.mode = $t;
1257
- case $t:
1258
- if (t.flags & 4096) {
1259
- if (f === 0)
1260
- break e;
1261
- h = 0;
1262
- do
1263
- b = a[l + h++], t.head && b && t.length < 65536 && (t.head.comment += String.fromCharCode(b));
1264
- while (b && h < f);
1265
- if (t.flags & 512 && (t.check = I(t.check, a, h, l)), f -= h, l += h, b)
1266
- break e;
1267
- } else
1268
- t.head && (t.head.comment = null);
1269
- t.mode = Ft;
1270
- case Ft:
1271
- if (t.flags & 512) {
1272
- for (; _ < 16; ) {
1273
- if (f === 0)
1274
- break e;
1275
- f--, r += a[l++] << _, _ += 8;
1276
- }
1277
- if (r !== (t.check & 65535)) {
1278
- e.msg = "header crc mismatch", t.mode = z;
1279
- break;
1280
- }
1281
- r = 0, _ = 0;
1282
- }
1283
- t.head && (t.head.hcrc = t.flags >> 9 & 1, t.head.done = !0), e.adler = t.check = 0, t.mode = H;
1284
- break;
1285
- case Mt:
1286
- for (; _ < 32; ) {
1287
- if (f === 0)
1288
- break e;
1289
- f--, r += a[l++] << _, _ += 8;
1290
- }
1291
- e.adler = t.check = qt(r), r = 0, _ = 0, t.mode = Be;
1292
- case Be:
1293
- if (t.havedict === 0)
1294
- return e.next_out = o, e.avail_out = s, e.next_in = l, e.avail_in = f, t.hold = r, t.bits = _, za;
1295
- e.adler = t.check = 1, t.mode = H;
1296
- case H:
1297
- if (i === Ta || i === Oe)
1298
- break e;
1299
- case qe:
1300
- if (t.last) {
1301
- r >>>= _ & 7, _ -= _ & 7, t.mode = tt;
1302
- break;
1303
- }
1304
- for (; _ < 3; ) {
1305
- if (f === 0)
1306
- break e;
1307
- f--, r += a[l++] << _, _ += 8;
1308
- }
1309
- switch (t.last = r & 1, r >>>= 1, _ -= 1, r & 3) {
1310
- case 0:
1311
- t.mode = Ht;
1312
- break;
1313
- case 1:
1314
- if (Ca(t), t.mode = Ne, i === Oe) {
1315
- r >>>= 2, _ -= 2;
1316
- break e;
1317
- }
1318
- break;
1319
- case 2:
1320
- t.mode = Kt;
1321
- break;
1322
- case 3:
1323
- e.msg = "invalid block type", t.mode = z;
1324
- }
1325
- r >>>= 2, _ -= 2;
1326
- break;
1327
- case Ht:
1328
- for (r >>>= _ & 7, _ -= _ & 7; _ < 32; ) {
1329
- if (f === 0)
1330
- break e;
1331
- f--, r += a[l++] << _, _ += 8;
1332
- }
1333
- if ((r & 65535) !== (r >>> 16 ^ 65535)) {
1334
- e.msg = "invalid stored block lengths", t.mode = z;
1335
- break;
1336
- }
1337
- if (t.length = r & 65535, r = 0, _ = 0, t.mode = et, i === Oe)
1338
- break e;
1339
- case et:
1340
- t.mode = Bt;
1341
- case Bt:
1342
- if (h = t.length, h) {
1343
- if (h > f && (h = f), h > s && (h = s), h === 0)
1344
- break e;
1345
- n.set(a.subarray(l, l + h), o), f -= h, l += h, s -= h, o += h, t.length -= h;
1346
- break;
1347
- }
1348
- t.mode = H;
1349
- break;
1350
- case Kt:
1351
- for (; _ < 14; ) {
1352
- if (f === 0)
1353
- break e;
1354
- f--, r += a[l++] << _, _ += 8;
1355
- }
1356
- if (t.nlen = (r & 31) + 257, r >>>= 5, _ -= 5, t.ndist = (r & 31) + 1, r >>>= 5, _ -= 5, t.ncode = (r & 15) + 4, r >>>= 4, _ -= 4, t.nlen > 286 || t.ndist > 30) {
1357
- e.msg = "too many length or distance symbols", t.mode = z;
1358
- break;
1359
- }
1360
- t.have = 0, t.mode = Pt;
1361
- case Pt:
1362
- for (; t.have < t.ncode; ) {
1363
- for (; _ < 3; ) {
1364
- if (f === 0)
1365
- break e;
1366
- f--, r += a[l++] << _, _ += 8;
1367
- }
1368
- t.lens[J[t.have++]] = r & 7, r >>>= 3, _ -= 3;
1369
- }
1370
- for (; t.have < 19; )
1371
- t.lens[J[t.have++]] = 0;
1372
- if (t.lencode = t.lendyn, t.lenbits = 7, g = { bits: t.lenbits }, R = be(Aa, t.lens, 0, 19, t.lencode, 0, t.work, g), t.lenbits = g.bits, R) {
1373
- e.msg = "invalid code lengths set", t.mode = z;
1374
- break;
1375
- }
1376
- t.have = 0, t.mode = Xt;
1377
- case Xt:
1378
- for (; t.have < t.nlen + t.ndist; ) {
1379
- for (; v = t.lencode[r & (1 << t.lenbits) - 1], w = v >>> 24, A = v >>> 16 & 255, x = v & 65535, !(w <= _); ) {
1380
- if (f === 0)
1381
- break e;
1382
- f--, r += a[l++] << _, _ += 8;
1383
- }
1384
- if (x < 16)
1385
- r >>>= w, _ -= w, t.lens[t.have++] = x;
1386
- else {
1387
- if (x === 16) {
1388
- for (p = w + 2; _ < p; ) {
1389
- if (f === 0)
1390
- break e;
1391
- f--, r += a[l++] << _, _ += 8;
1392
- }
1393
- if (r >>>= w, _ -= w, t.have === 0) {
1394
- e.msg = "invalid bit length repeat", t.mode = z;
1395
- break;
1396
- }
1397
- b = t.lens[t.have - 1], h = 3 + (r & 3), r >>>= 2, _ -= 2;
1398
- } else if (x === 17) {
1399
- for (p = w + 3; _ < p; ) {
1400
- if (f === 0)
1401
- break e;
1402
- f--, r += a[l++] << _, _ += 8;
1403
- }
1404
- r >>>= w, _ -= w, b = 0, h = 3 + (r & 7), r >>>= 3, _ -= 3;
1405
- } else {
1406
- for (p = w + 7; _ < p; ) {
1407
- if (f === 0)
1408
- break e;
1409
- f--, r += a[l++] << _, _ += 8;
1410
- }
1411
- r >>>= w, _ -= w, b = 0, h = 11 + (r & 127), r >>>= 7, _ -= 7;
1412
- }
1413
- if (t.have + h > t.nlen + t.ndist) {
1414
- e.msg = "invalid bit length repeat", t.mode = z;
1415
- break;
1416
- }
1417
- for (; h--; )
1418
- t.lens[t.have++] = b;
1419
- }
1420
- }
1421
- if (t.mode === z)
1422
- break;
1423
- if (t.lens[256] === 0) {
1424
- e.msg = "invalid code -- missing end-of-block", t.mode = z;
1425
- break;
1426
- }
1427
- if (t.lenbits = 9, g = { bits: t.lenbits }, R = be(Si, t.lens, 0, t.nlen, t.lencode, 0, t.work, g), t.lenbits = g.bits, R) {
1428
- e.msg = "invalid literal/lengths set", t.mode = z;
1429
- break;
1430
- }
1431
- if (t.distbits = 6, t.distcode = t.distdyn, g = { bits: t.distbits }, R = be(Ai, t.lens, t.nlen, t.ndist, t.distcode, 0, t.work, g), t.distbits = g.bits, R) {
1432
- e.msg = "invalid distances set", t.mode = z;
1433
- break;
1434
- }
1435
- if (t.mode = Ne, i === Oe)
1436
- break e;
1437
- case Ne:
1438
- t.mode = Le;
1439
- case Le:
1440
- if (f >= 6 && s >= 258) {
1441
- e.next_out = o, e.avail_out = s, e.next_in = l, e.avail_in = f, t.hold = r, t.bits = _, xa(e, c), o = e.next_out, n = e.output, s = e.avail_out, l = e.next_in, a = e.input, f = e.avail_in, r = t.hold, _ = t.bits, t.mode === H && (t.back = -1);
1442
- break;
1443
- }
1444
- for (t.back = 0; v = t.lencode[r & (1 << t.lenbits) - 1], w = v >>> 24, A = v >>> 16 & 255, x = v & 65535, !(w <= _); ) {
1445
- if (f === 0)
1446
- break e;
1447
- f--, r += a[l++] << _, _ += 8;
1448
- }
1449
- if (A && !(A & 240)) {
1450
- for (d = w, S = A, Z = x; v = t.lencode[Z + ((r & (1 << d + S) - 1) >> d)], w = v >>> 24, A = v >>> 16 & 255, x = v & 65535, !(d + w <= _); ) {
1451
- if (f === 0)
1452
- break e;
1453
- f--, r += a[l++] << _, _ += 8;
1454
- }
1455
- r >>>= d, _ -= d, t.back += d;
1456
- }
1457
- if (r >>>= w, _ -= w, t.back += w, t.length = x, A === 0) {
1458
- t.mode = Vt;
1459
- break;
1460
- }
1461
- if (A & 32) {
1462
- t.back = -1, t.mode = H;
1463
- break;
1464
- }
1465
- if (A & 64) {
1466
- e.msg = "invalid literal/length code", t.mode = z;
1467
- break;
1468
- }
1469
- t.extra = A & 15, t.mode = Yt;
1470
- case Yt:
1471
- if (t.extra) {
1472
- for (p = t.extra; _ < p; ) {
1473
- if (f === 0)
1474
- break e;
1475
- f--, r += a[l++] << _, _ += 8;
1476
- }
1477
- t.length += r & (1 << t.extra) - 1, r >>>= t.extra, _ -= t.extra, t.back += t.extra;
1478
- }
1479
- t.was = t.length, t.mode = Gt;
1480
- case Gt:
1481
- for (; v = t.distcode[r & (1 << t.distbits) - 1], w = v >>> 24, A = v >>> 16 & 255, x = v & 65535, !(w <= _); ) {
1482
- if (f === 0)
1483
- break e;
1484
- f--, r += a[l++] << _, _ += 8;
1485
- }
1486
- if (!(A & 240)) {
1487
- for (d = w, S = A, Z = x; v = t.distcode[Z + ((r & (1 << d + S) - 1) >> d)], w = v >>> 24, A = v >>> 16 & 255, x = v & 65535, !(d + w <= _); ) {
1488
- if (f === 0)
1489
- break e;
1490
- f--, r += a[l++] << _, _ += 8;
1491
- }
1492
- r >>>= d, _ -= d, t.back += d;
1493
- }
1494
- if (r >>>= w, _ -= w, t.back += w, A & 64) {
1495
- e.msg = "invalid distance code", t.mode = z;
1496
- break;
1497
- }
1498
- t.offset = x, t.extra = A & 15, t.mode = jt;
1499
- case jt:
1500
- if (t.extra) {
1501
- for (p = t.extra; _ < p; ) {
1502
- if (f === 0)
1503
- break e;
1504
- f--, r += a[l++] << _, _ += 8;
1505
- }
1506
- t.offset += r & (1 << t.extra) - 1, r >>>= t.extra, _ -= t.extra, t.back += t.extra;
1507
- }
1508
- if (t.offset > t.dmax) {
1509
- e.msg = "invalid distance too far back", t.mode = z;
1510
- break;
1511
- }
1512
- t.mode = Wt;
1513
- case Wt:
1514
- if (s === 0)
1515
- break e;
1516
- if (h = c - s, t.offset > h) {
1517
- if (h = t.offset - h, h > t.whave && t.sane) {
1518
- e.msg = "invalid distance too far back", t.mode = z;
1519
- break;
1520
- }
1521
- h > t.wnext ? (h -= t.wnext, u = t.wsize - h) : u = t.wnext - h, h > t.length && (h = t.length), m = t.window;
1522
- } else
1523
- m = n, u = o - t.offset, h = t.length;
1524
- h > s && (h = s), s -= h, t.length -= h;
1525
- do
1526
- n[o++] = m[u++];
1527
- while (--h);
1528
- t.length === 0 && (t.mode = Le);
1529
- break;
1530
- case Vt:
1531
- if (s === 0)
1532
- break e;
1533
- n[o++] = t.length, s--, t.mode = Le;
1534
- break;
1535
- case tt:
1536
- if (t.wrap) {
1537
- for (; _ < 32; ) {
1538
- if (f === 0)
1539
- break e;
1540
- f--, r |= a[l++] << _, _ += 8;
1541
- }
1542
- if (c -= s, e.total_out += c, t.total += c, c && (e.adler = t.check = /*UPDATE(state.check, put - _out, _out);*/
1543
- t.flags ? I(t.check, n, c, o - c) : ke(t.check, n, c, o - c)), c = s, (t.flags ? r : qt(r)) !== t.check) {
1544
- e.msg = "incorrect data check", t.mode = z;
1545
- break;
1546
- }
1547
- r = 0, _ = 0;
1548
- }
1549
- t.mode = Jt;
1550
- case Jt:
1551
- if (t.wrap && t.flags) {
1552
- for (; _ < 32; ) {
1553
- if (f === 0)
1554
- break e;
1555
- f--, r += a[l++] << _, _ += 8;
1556
- }
1557
- if (r !== (t.total & 4294967295)) {
1558
- e.msg = "incorrect length check", t.mode = z;
1559
- break;
1560
- }
1561
- r = 0, _ = 0;
1562
- }
1563
- t.mode = Qt;
1564
- case Qt:
1565
- R = Ra;
1566
- break e;
1567
- case z:
1568
- R = Ti;
1569
- break e;
1570
- case mi:
1571
- return Ri;
1572
- case Da:
1573
- default:
1574
- return U;
1575
- }
1576
- return e.next_out = o, e.avail_out = s, e.next_in = l, e.avail_in = f, t.hold = r, t.bits = _, (t.wsize || c !== e.avail_out && t.mode < z && (t.mode < tt || i !== Dt)) && Ni(e, e.output, e.next_out, c - e.avail_out), E -= e.avail_in, c -= e.avail_out, e.total_in += E, e.total_out += c, t.total += c, t.wrap && c && (e.adler = t.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/
1577
- t.flags ? I(t.check, n, c, e.next_out - c) : ke(t.check, n, c, e.next_out - c)), e.data_type = t.bits + (t.last ? 64 : 0) + (t.mode === H ? 128 : 0) + (t.mode === Ne || t.mode === et ? 256 : 0), (E === 0 && c === 0 || i === Dt) && R === ie && (R = ma), R;
1578
- }, Fa = (e) => {
1579
- if (!e || !e.state)
1580
- return U;
1581
- let i = e.state;
1582
- return i.window && (i.window = null), e.state = null, ie;
1583
- }, Ma = (e, i) => {
1584
- if (!e || !e.state)
1585
- return U;
1586
- const t = e.state;
1587
- return t.wrap & 2 ? (t.head = i, i.done = !1, ie) : U;
1588
- }, Ha = (e, i) => {
1589
- const t = i.length;
1590
- let a, n, l;
1591
- return !e || !e.state || (a = e.state, a.wrap !== 0 && a.mode !== Be) ? U : a.mode === Be && (n = 1, n = ke(n, i, t, 0), n !== a.check) ? Ti : (l = Ni(e, i, t, t), l ? (a.mode = mi, Ri) : (a.havedict = 1, ie));
1592
- };
1593
- var Ba = Zi, Ka = Ii, Pa = Di, Xa = Ua, Ya = Oi, Ga = $a, ja = Fa, Wa = Ma, Va = Ha, Ja = "pako inflate (from Nodeca project)", K = {
1594
- inflateReset: Ba,
1595
- inflateReset2: Ka,
1596
- inflateResetKeep: Pa,
1597
- inflateInit: Xa,
1598
- inflateInit2: Ya,
1599
- inflate: Ga,
1600
- inflateEnd: ja,
1601
- inflateGetHeader: Wa,
1602
- inflateSetDictionary: Va,
1603
- inflateInfo: Ja
1604
- };
1605
- function Qa() {
1606
- this.text = 0, this.time = 0, this.xflags = 0, this.os = 0, this.extra = null, this.extra_len = 0, this.name = "", this.comment = "", this.hcrc = 0, this.done = !1;
1607
- }
1608
- var qa = Qa;
1609
- const Li = Object.prototype.toString, {
1610
- Z_NO_FLUSH: el,
1611
- Z_FINISH: tl,
1612
- Z_OK: ye,
1613
- Z_STREAM_END: at,
1614
- Z_NEED_DICT: lt,
1615
- Z_STREAM_ERROR: il,
1616
- Z_DATA_ERROR: ti,
1617
- Z_MEM_ERROR: nl
1618
- } = Ae;
1619
- function Re(e) {
1620
- this.options = Xe.assign({
1621
- chunkSize: 1024 * 64,
1622
- windowBits: 15,
1623
- to: ""
1624
- }, e || {});
1625
- const i = this.options;
1626
- i.raw && i.windowBits >= 0 && i.windowBits < 16 && (i.windowBits = -i.windowBits, i.windowBits === 0 && (i.windowBits = -15)), i.windowBits >= 0 && i.windowBits < 16 && !(e && e.windowBits) && (i.windowBits += 32), i.windowBits > 15 && i.windowBits < 48 && (i.windowBits & 15 || (i.windowBits |= 15)), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new Ei(), this.strm.avail_out = 0;
1627
- let t = K.inflateInit2(
1628
- this.strm,
1629
- i.windowBits
1630
- );
1631
- if (t !== ye)
1632
- throw new Error(fe[t]);
1633
- if (this.header = new qa(), K.inflateGetHeader(this.strm, this.header), i.dictionary && (typeof i.dictionary == "string" ? i.dictionary = Ee.string2buf(i.dictionary) : Li.call(i.dictionary) === "[object ArrayBuffer]" && (i.dictionary = new Uint8Array(i.dictionary)), i.raw && (t = K.inflateSetDictionary(this.strm, i.dictionary), t !== ye)))
1634
- throw new Error(fe[t]);
1635
- }
1636
- Re.prototype.push = function(e, i) {
1637
- const t = this.strm, a = this.options.chunkSize, n = this.options.dictionary;
1638
- let l, o, f;
1639
- if (this.ended)
1640
- return !1;
1641
- for (i === ~~i ? o = i : o = i === !0 ? tl : el, Li.call(e) === "[object ArrayBuffer]" ? t.input = new Uint8Array(e) : t.input = e, t.next_in = 0, t.avail_in = t.input.length; ; ) {
1642
- for (t.avail_out === 0 && (t.output = new Uint8Array(a), t.next_out = 0, t.avail_out = a), l = K.inflate(t, o), l === lt && n && (l = K.inflateSetDictionary(t, n), l === ye ? l = K.inflate(t, o) : l === ti && (l = lt)); t.avail_in > 0 && l === at && t.state.wrap > 0 && e[t.next_in] !== 0; )
1643
- K.inflateReset(t), l = K.inflate(t, o);
1644
- switch (l) {
1645
- case il:
1646
- case ti:
1647
- case lt:
1648
- case nl:
1649
- return this.onEnd(l), this.ended = !0, !1;
1650
- }
1651
- if (f = t.avail_out, t.next_out && (t.avail_out === 0 || l === at))
1652
- if (this.options.to === "string") {
1653
- let s = Ee.utf8border(t.output, t.next_out), r = t.next_out - s, _ = Ee.buf2string(t.output, s);
1654
- t.next_out = r, t.avail_out = a - r, r && t.output.set(t.output.subarray(s, s + r), 0), this.onData(_);
1655
- } else
1656
- this.onData(t.output.length === t.next_out ? t.output : t.output.subarray(0, t.next_out));
1657
- if (!(l === ye && f === 0)) {
1658
- if (l === at)
1659
- return l = K.inflateEnd(this.strm), this.onEnd(l), this.ended = !0, !0;
1660
- if (t.avail_in === 0)
1661
- break;
1662
- }
1663
- }
1664
- return !0;
1665
- };
1666
- Re.prototype.onData = function(e) {
1667
- this.chunks.push(e);
1668
- };
1669
- Re.prototype.onEnd = function(e) {
1670
- e === ye && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = Xe.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
1671
- };
1672
- function bt(e, i) {
1673
- const t = new Re(i);
1674
- if (t.push(e), t.err)
1675
- throw t.msg || fe[t.err];
1676
- return t.result;
1677
- }
1678
- function al(e, i) {
1679
- return i = i || {}, i.raw = !0, bt(e, i);
1680
- }
1681
- var ll = Re, rl = bt, fl = al, ol = bt, _l = Ae, hl = {
1682
- Inflate: ll,
1683
- inflate: rl,
1684
- inflateRaw: fl,
1685
- ungzip: ol,
1686
- constants: _l
1687
- };
1688
- const { Inflate: cl, inflate: dl, inflateRaw: sl, ungzip: ul } = hl;
1689
- var bl = dl;
1690
- export {
1691
- bl as i
1692
- };