vitessce 3.5.12 → 3.6.0

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-BQIf2hY7.js +10 -0
  5. package/dist/{gzip-61747bf5.js → gzip-Bo8P9Xuy.js} +2 -2
  6. package/dist/{higlass-e9622d39.js → higlass-Bat4GE21.js} +22717 -22970
  7. package/dist/{index-cbdc7956.js → index-CcMPJ7FR.js} +4342 -4797
  8. package/dist/{index-a280757a.js → index-DKsNZq_H.js} +169321 -149358
  9. package/dist/{index-0d803e7f.js → index-n--TL9vD.js} +18924 -18896
  10. package/dist/index.min.js +26 -27
  11. package/dist/{jpeg-6c06bcde.js → jpeg-GIpYHoeg.js} +32 -16
  12. package/dist/lerc-DQBaC8Uo.js +1004 -0
  13. package/dist/lz4-D5NbssRf.js +640 -0
  14. package/dist/lzw-BudhLb7h.js +84 -0
  15. package/dist/packbits-CzOC0r_e.js +24 -0
  16. package/dist/pako.esm-D68R8YXe.js +1071 -0
  17. package/dist/raw-xPYeRIN6.js +9 -0
  18. package/dist/{troika-three-text.esm-4798f478.js → troika-three-text.esm-BOqKyvZt.js} +859 -1038
  19. package/dist/{webimage-5dc5b0d9.js → webimage-CGcky9Qo.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
@@ -0,0 +1,1071 @@
1
+ function U(t) {
2
+ let i = t.length;
3
+ for (; --i >= 0; )
4
+ t[i] = 0;
5
+ }
6
+ const tt = 3, it = 258, $e = 29, nt = 256, at = nt + 1 + $e, ze = 30, ft = 512, ot = new Array((at + 2) * 2);
7
+ U(ot);
8
+ const lt = new Array(ze * 2);
9
+ U(lt);
10
+ const st = new Array(ft);
11
+ U(st);
12
+ const rt = new Array(it - tt + 1);
13
+ U(rt);
14
+ const ct = new Array($e);
15
+ U(ct);
16
+ const dt = new Array(ze);
17
+ U(dt);
18
+ const ht = (t, i, e, o) => {
19
+ let r = t & 65535 | 0, n = t >>> 16 & 65535 | 0, d = 0;
20
+ for (; e !== 0; ) {
21
+ d = e > 2e3 ? 2e3 : e, e -= d;
22
+ do
23
+ r = r + i[o++] | 0, n = n + r | 0;
24
+ while (--d);
25
+ r %= 65521, n %= 65521;
26
+ }
27
+ return r | n << 16 | 0;
28
+ };
29
+ var ne = ht;
30
+ const ut = () => {
31
+ let t, i = [];
32
+ for (var e = 0; e < 256; e++) {
33
+ t = e;
34
+ for (var o = 0; o < 8; o++)
35
+ t = t & 1 ? 3988292384 ^ t >>> 1 : t >>> 1;
36
+ i[e] = t;
37
+ }
38
+ return i;
39
+ }, wt = new Uint32Array(ut()), xt = (t, i, e, o) => {
40
+ const r = wt, n = o + e;
41
+ t ^= -1;
42
+ for (let d = o; d < n; d++)
43
+ t = t >>> 8 ^ r[(t ^ i[d]) & 255];
44
+ return t ^ -1;
45
+ };
46
+ var C = xt, ae = {
47
+ 2: "need dictionary",
48
+ /* Z_NEED_DICT 2 */
49
+ 1: "stream end",
50
+ /* Z_STREAM_END 1 */
51
+ 0: "",
52
+ /* Z_OK 0 */
53
+ "-1": "file error",
54
+ /* Z_ERRNO (-1) */
55
+ "-2": "stream error",
56
+ /* Z_STREAM_ERROR (-2) */
57
+ "-3": "data error",
58
+ /* Z_DATA_ERROR (-3) */
59
+ "-4": "insufficient memory",
60
+ /* Z_MEM_ERROR (-4) */
61
+ "-5": "buffer error",
62
+ /* Z_BUF_ERROR (-5) */
63
+ "-6": "incompatible version"
64
+ /* Z_VERSION_ERROR (-6) */
65
+ }, He = {
66
+ /* Allowed flush values; see deflate() and inflate() below for details */
67
+ Z_NO_FLUSH: 0,
68
+ Z_FINISH: 4,
69
+ Z_BLOCK: 5,
70
+ Z_TREES: 6,
71
+ /* Return codes for the compression/decompression functions. Negative values
72
+ * are errors, positive values are used for special but normal events.
73
+ */
74
+ Z_OK: 0,
75
+ Z_STREAM_END: 1,
76
+ Z_NEED_DICT: 2,
77
+ Z_STREAM_ERROR: -2,
78
+ Z_DATA_ERROR: -3,
79
+ Z_MEM_ERROR: -4,
80
+ Z_BUF_ERROR: -5,
81
+ /* The deflate compression method */
82
+ Z_DEFLATED: 8
83
+ //Z_NULL: null // Use -1 or null inline, depending on var type
84
+ };
85
+ const _t = (t, i) => Object.prototype.hasOwnProperty.call(t, i);
86
+ var bt = function(t) {
87
+ const i = Array.prototype.slice.call(arguments, 1);
88
+ for (; i.length; ) {
89
+ const e = i.shift();
90
+ if (e) {
91
+ if (typeof e != "object")
92
+ throw new TypeError(e + "must be non-object");
93
+ for (const o in e)
94
+ _t(e, o) && (t[o] = e[o]);
95
+ }
96
+ }
97
+ return t;
98
+ }, kt = (t) => {
99
+ let i = 0;
100
+ for (let o = 0, r = t.length; o < r; o++)
101
+ i += t[o].length;
102
+ const e = new Uint8Array(i);
103
+ for (let o = 0, r = 0, n = t.length; o < n; o++) {
104
+ let d = t[o];
105
+ e.set(d, r), r += d.length;
106
+ }
107
+ return e;
108
+ }, Be = {
109
+ assign: bt,
110
+ flattenChunks: kt
111
+ };
112
+ let Fe = !0;
113
+ try {
114
+ String.fromCharCode.apply(null, new Uint8Array(1));
115
+ } catch {
116
+ Fe = !1;
117
+ }
118
+ const $ = new Uint8Array(256);
119
+ for (let t = 0; t < 256; t++)
120
+ $[t] = t >= 252 ? 6 : t >= 248 ? 5 : t >= 240 ? 4 : t >= 224 ? 3 : t >= 192 ? 2 : 1;
121
+ $[254] = $[254] = 1;
122
+ var gt = (t) => {
123
+ if (typeof TextEncoder == "function" && TextEncoder.prototype.encode)
124
+ return new TextEncoder().encode(t);
125
+ let i, e, o, r, n, d = t.length, l = 0;
126
+ for (r = 0; r < d; r++)
127
+ e = t.charCodeAt(r), (e & 64512) === 55296 && r + 1 < d && (o = t.charCodeAt(r + 1), (o & 64512) === 56320 && (e = 65536 + (e - 55296 << 10) + (o - 56320), r++)), l += e < 128 ? 1 : e < 2048 ? 2 : e < 65536 ? 3 : 4;
128
+ for (i = new Uint8Array(l), n = 0, r = 0; n < l; r++)
129
+ e = t.charCodeAt(r), (e & 64512) === 55296 && r + 1 < d && (o = t.charCodeAt(r + 1), (o & 64512) === 56320 && (e = 65536 + (e - 55296 << 10) + (o - 56320), r++)), e < 128 ? i[n++] = e : e < 2048 ? (i[n++] = 192 | e >>> 6, i[n++] = 128 | e & 63) : e < 65536 ? (i[n++] = 224 | e >>> 12, i[n++] = 128 | e >>> 6 & 63, i[n++] = 128 | e & 63) : (i[n++] = 240 | e >>> 18, i[n++] = 128 | e >>> 12 & 63, i[n++] = 128 | e >>> 6 & 63, i[n++] = 128 | e & 63);
130
+ return i;
131
+ };
132
+ const vt = (t, i) => {
133
+ if (i < 65534 && t.subarray && Fe)
134
+ return String.fromCharCode.apply(null, t.length === i ? t : t.subarray(0, i));
135
+ let e = "";
136
+ for (let o = 0; o < i; o++)
137
+ e += String.fromCharCode(t[o]);
138
+ return e;
139
+ };
140
+ var Et = (t, i) => {
141
+ const e = i || t.length;
142
+ if (typeof TextDecoder == "function" && TextDecoder.prototype.decode)
143
+ return new TextDecoder().decode(t.subarray(0, i));
144
+ let o, r;
145
+ const n = new Array(e * 2);
146
+ for (r = 0, o = 0; o < e; ) {
147
+ let d = t[o++];
148
+ if (d < 128) {
149
+ n[r++] = d;
150
+ continue;
151
+ }
152
+ let l = $[d];
153
+ if (l > 4) {
154
+ n[r++] = 65533, o += l - 1;
155
+ continue;
156
+ }
157
+ for (d &= l === 2 ? 31 : l === 3 ? 15 : 7; l > 1 && o < e; )
158
+ d = d << 6 | t[o++] & 63, l--;
159
+ if (l > 1) {
160
+ n[r++] = 65533;
161
+ continue;
162
+ }
163
+ d < 65536 ? n[r++] = d : (d -= 65536, n[r++] = 55296 | d >> 10 & 1023, n[r++] = 56320 | d & 1023);
164
+ }
165
+ return vt(n, r);
166
+ }, pt = (t, i) => {
167
+ i = i || t.length, i > t.length && (i = t.length);
168
+ let e = i - 1;
169
+ for (; e >= 0 && (t[e] & 192) === 128; )
170
+ e--;
171
+ return e < 0 || e === 0 ? i : e + $[t[e]] > i ? e : i;
172
+ }, fe = {
173
+ string2buf: gt,
174
+ buf2string: Et,
175
+ utf8border: pt
176
+ };
177
+ function yt() {
178
+ 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;
179
+ }
180
+ var At = yt;
181
+ const G = 30, Rt = 12;
182
+ var St = function(i, e) {
183
+ let o, r, n, d, l, p, a, f, S, w, s, u, T, g, x, E, k, c, v, D, h, A, y, _;
184
+ const b = i.state;
185
+ o = i.next_in, y = i.input, r = o + (i.avail_in - 5), n = i.next_out, _ = i.output, d = n - (e - i.avail_out), l = n + (i.avail_out - 257), p = b.dmax, a = b.wsize, f = b.whave, S = b.wnext, w = b.window, s = b.hold, u = b.bits, T = b.lencode, g = b.distcode, x = (1 << b.lenbits) - 1, E = (1 << b.distbits) - 1;
186
+ e:
187
+ do {
188
+ u < 15 && (s += y[o++] << u, u += 8, s += y[o++] << u, u += 8), k = T[s & x];
189
+ t:
190
+ for (; ; ) {
191
+ if (c = k >>> 24, s >>>= c, u -= c, c = k >>> 16 & 255, c === 0)
192
+ _[n++] = k & 65535;
193
+ else if (c & 16) {
194
+ v = k & 65535, c &= 15, c && (u < c && (s += y[o++] << u, u += 8), v += s & (1 << c) - 1, s >>>= c, u -= c), u < 15 && (s += y[o++] << u, u += 8, s += y[o++] << u, u += 8), k = g[s & E];
195
+ i:
196
+ for (; ; ) {
197
+ if (c = k >>> 24, s >>>= c, u -= c, c = k >>> 16 & 255, c & 16) {
198
+ if (D = k & 65535, c &= 15, u < c && (s += y[o++] << u, u += 8, u < c && (s += y[o++] << u, u += 8)), D += s & (1 << c) - 1, D > p) {
199
+ i.msg = "invalid distance too far back", b.mode = G;
200
+ break e;
201
+ }
202
+ if (s >>>= c, u -= c, c = n - d, D > c) {
203
+ if (c = D - c, c > f && b.sane) {
204
+ i.msg = "invalid distance too far back", b.mode = G;
205
+ break e;
206
+ }
207
+ if (h = 0, A = w, S === 0) {
208
+ if (h += a - c, c < v) {
209
+ v -= c;
210
+ do
211
+ _[n++] = w[h++];
212
+ while (--c);
213
+ h = n - D, A = _;
214
+ }
215
+ } else if (S < c) {
216
+ if (h += a + S - c, c -= S, c < v) {
217
+ v -= c;
218
+ do
219
+ _[n++] = w[h++];
220
+ while (--c);
221
+ if (h = 0, S < v) {
222
+ c = S, v -= c;
223
+ do
224
+ _[n++] = w[h++];
225
+ while (--c);
226
+ h = n - D, A = _;
227
+ }
228
+ }
229
+ } else if (h += S - c, c < v) {
230
+ v -= c;
231
+ do
232
+ _[n++] = w[h++];
233
+ while (--c);
234
+ h = n - D, A = _;
235
+ }
236
+ for (; v > 2; )
237
+ _[n++] = A[h++], _[n++] = A[h++], _[n++] = A[h++], v -= 3;
238
+ v && (_[n++] = A[h++], v > 1 && (_[n++] = A[h++]));
239
+ } else {
240
+ h = n - D;
241
+ do
242
+ _[n++] = _[h++], _[n++] = _[h++], _[n++] = _[h++], v -= 3;
243
+ while (v > 2);
244
+ v && (_[n++] = _[h++], v > 1 && (_[n++] = _[h++]));
245
+ }
246
+ } else if ((c & 64) === 0) {
247
+ k = g[(k & 65535) + (s & (1 << c) - 1)];
248
+ continue i;
249
+ } else {
250
+ i.msg = "invalid distance code", b.mode = G;
251
+ break e;
252
+ }
253
+ break;
254
+ }
255
+ } else if ((c & 64) === 0) {
256
+ k = T[(k & 65535) + (s & (1 << c) - 1)];
257
+ continue t;
258
+ } else if (c & 32) {
259
+ b.mode = Rt;
260
+ break e;
261
+ } else {
262
+ i.msg = "invalid literal/length code", b.mode = G;
263
+ break e;
264
+ }
265
+ break;
266
+ }
267
+ } while (o < r && n < l);
268
+ v = u >> 3, o -= v, u -= v << 3, s &= (1 << u) - 1, i.next_in = o, i.next_out = n, i.avail_in = o < r ? 5 + (r - o) : 5 - (o - r), i.avail_out = n < l ? 257 + (l - n) : 257 - (n - l), b.hold = s, b.bits = u;
269
+ };
270
+ const M = 15, se = 852, re = 592, ce = 0, W = 1, de = 2, Tt = new Uint16Array([
271
+ /* Length codes 257..285 base */
272
+ 3,
273
+ 4,
274
+ 5,
275
+ 6,
276
+ 7,
277
+ 8,
278
+ 9,
279
+ 10,
280
+ 11,
281
+ 13,
282
+ 15,
283
+ 17,
284
+ 19,
285
+ 23,
286
+ 27,
287
+ 31,
288
+ 35,
289
+ 43,
290
+ 51,
291
+ 59,
292
+ 67,
293
+ 83,
294
+ 99,
295
+ 115,
296
+ 131,
297
+ 163,
298
+ 195,
299
+ 227,
300
+ 258,
301
+ 0,
302
+ 0
303
+ ]), Dt = new Uint8Array([
304
+ /* Length codes 257..285 extra */
305
+ 16,
306
+ 16,
307
+ 16,
308
+ 16,
309
+ 16,
310
+ 16,
311
+ 16,
312
+ 16,
313
+ 17,
314
+ 17,
315
+ 17,
316
+ 17,
317
+ 18,
318
+ 18,
319
+ 18,
320
+ 18,
321
+ 19,
322
+ 19,
323
+ 19,
324
+ 19,
325
+ 20,
326
+ 20,
327
+ 20,
328
+ 20,
329
+ 21,
330
+ 21,
331
+ 21,
332
+ 21,
333
+ 16,
334
+ 72,
335
+ 78
336
+ ]), mt = new Uint16Array([
337
+ /* Distance codes 0..29 base */
338
+ 1,
339
+ 2,
340
+ 3,
341
+ 4,
342
+ 5,
343
+ 7,
344
+ 9,
345
+ 13,
346
+ 17,
347
+ 25,
348
+ 33,
349
+ 49,
350
+ 65,
351
+ 97,
352
+ 129,
353
+ 193,
354
+ 257,
355
+ 385,
356
+ 513,
357
+ 769,
358
+ 1025,
359
+ 1537,
360
+ 2049,
361
+ 3073,
362
+ 4097,
363
+ 6145,
364
+ 8193,
365
+ 12289,
366
+ 16385,
367
+ 24577,
368
+ 0,
369
+ 0
370
+ ]), Ct = new Uint8Array([
371
+ /* Distance codes 0..29 extra */
372
+ 16,
373
+ 16,
374
+ 16,
375
+ 16,
376
+ 17,
377
+ 17,
378
+ 18,
379
+ 18,
380
+ 19,
381
+ 19,
382
+ 20,
383
+ 20,
384
+ 21,
385
+ 21,
386
+ 22,
387
+ 22,
388
+ 23,
389
+ 23,
390
+ 24,
391
+ 24,
392
+ 25,
393
+ 25,
394
+ 26,
395
+ 26,
396
+ 27,
397
+ 27,
398
+ 28,
399
+ 28,
400
+ 29,
401
+ 29,
402
+ 64,
403
+ 64
404
+ ]), It = (t, i, e, o, r, n, d, l) => {
405
+ const p = l.bits;
406
+ let a = 0, f = 0, S = 0, w = 0, s = 0, u = 0, T = 0, g = 0, x = 0, E = 0, k, c, v, D, h, A = null, y = 0, _;
407
+ const b = new Uint16Array(M + 1), Z = new Uint16Array(M + 1);
408
+ let H = null, oe = 0, le, B, F;
409
+ for (a = 0; a <= M; a++)
410
+ b[a] = 0;
411
+ for (f = 0; f < o; f++)
412
+ b[i[e + f]]++;
413
+ for (s = p, w = M; w >= 1 && b[w] === 0; w--)
414
+ ;
415
+ if (s > w && (s = w), w === 0)
416
+ return r[n++] = 1 << 24 | 64 << 16 | 0, r[n++] = 1 << 24 | 64 << 16 | 0, l.bits = 1, 0;
417
+ for (S = 1; S < w && b[S] === 0; S++)
418
+ ;
419
+ for (s < S && (s = S), g = 1, a = 1; a <= M; a++)
420
+ if (g <<= 1, g -= b[a], g < 0)
421
+ return -1;
422
+ if (g > 0 && (t === ce || w !== 1))
423
+ return -1;
424
+ for (Z[1] = 0, a = 1; a < M; a++)
425
+ Z[a + 1] = Z[a] + b[a];
426
+ for (f = 0; f < o; f++)
427
+ i[e + f] !== 0 && (d[Z[i[e + f]]++] = f);
428
+ if (t === ce ? (A = H = d, _ = 19) : t === W ? (A = Tt, y -= 257, H = Dt, oe -= 257, _ = 256) : (A = mt, H = Ct, _ = -1), E = 0, f = 0, a = S, h = n, u = s, T = 0, v = -1, x = 1 << s, D = x - 1, t === W && x > se || t === de && x > re)
429
+ return 1;
430
+ for (; ; ) {
431
+ le = a - T, d[f] < _ ? (B = 0, F = d[f]) : d[f] > _ ? (B = H[oe + d[f]], F = A[y + d[f]]) : (B = 96, F = 0), k = 1 << a - T, c = 1 << u, S = c;
432
+ do
433
+ c -= k, r[h + (E >> T) + c] = le << 24 | B << 16 | F | 0;
434
+ while (c !== 0);
435
+ for (k = 1 << a - 1; E & k; )
436
+ k >>= 1;
437
+ if (k !== 0 ? (E &= k - 1, E += k) : E = 0, f++, --b[a] === 0) {
438
+ if (a === w)
439
+ break;
440
+ a = i[e + d[f]];
441
+ }
442
+ if (a > s && (E & D) !== v) {
443
+ for (T === 0 && (T = s), h += S, u = a - T, g = 1 << u; u + T < w && (g -= b[u + T], !(g <= 0)); )
444
+ u++, g <<= 1;
445
+ if (x += 1 << u, t === W && x > se || t === de && x > re)
446
+ return 1;
447
+ v = E & D, r[v] = s << 24 | u << 16 | h - n | 0;
448
+ }
449
+ }
450
+ return E !== 0 && (r[h + E] = a - T << 24 | 64 << 16 | 0), l.bits = s, 0;
451
+ };
452
+ var L = It;
453
+ const Ot = 0, Ge = 1, Ke = 2, {
454
+ Z_FINISH: he,
455
+ Z_BLOCK: Zt,
456
+ Z_TREES: K,
457
+ Z_OK: N,
458
+ Z_STREAM_END: Nt,
459
+ Z_NEED_DICT: Mt,
460
+ Z_STREAM_ERROR: m,
461
+ Z_DATA_ERROR: Pe,
462
+ Z_MEM_ERROR: je,
463
+ Z_BUF_ERROR: Ut,
464
+ Z_DEFLATED: ue
465
+ } = He, Xe = 1, we = 2, xe = 3, _e = 4, be = 5, ke = 6, ge = 7, ve = 8, Ee = 9, pe = 10, X = 11, I = 12, J = 13, ye = 14, Q = 15, Ae = 16, Re = 17, Se = 18, Te = 19, P = 20, j = 21, De = 22, me = 23, Ce = 24, Ie = 25, Oe = 26, V = 27, Ze = 28, Ne = 29, R = 30, Ye = 31, Lt = 32, $t = 852, zt = 592, Ht = 15, Bt = Ht, Me = (t) => (t >>> 24 & 255) + (t >>> 8 & 65280) + ((t & 65280) << 8) + ((t & 255) << 24);
466
+ function Ft() {
467
+ 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;
468
+ }
469
+ const We = (t) => {
470
+ if (!t || !t.state)
471
+ return m;
472
+ const i = t.state;
473
+ return t.total_in = t.total_out = i.total = 0, t.msg = "", i.wrap && (t.adler = i.wrap & 1), i.mode = Xe, i.last = 0, i.havedict = 0, i.dmax = 32768, i.head = null, i.hold = 0, i.bits = 0, i.lencode = i.lendyn = new Int32Array($t), i.distcode = i.distdyn = new Int32Array(zt), i.sane = 1, i.back = -1, N;
474
+ }, Je = (t) => {
475
+ if (!t || !t.state)
476
+ return m;
477
+ const i = t.state;
478
+ return i.wsize = 0, i.whave = 0, i.wnext = 0, We(t);
479
+ }, Qe = (t, i) => {
480
+ let e;
481
+ if (!t || !t.state)
482
+ return m;
483
+ const o = t.state;
484
+ return i < 0 ? (e = 0, i = -i) : (e = (i >> 4) + 1, i < 48 && (i &= 15)), i && (i < 8 || i > 15) ? m : (o.window !== null && o.wbits !== i && (o.window = null), o.wrap = e, o.wbits = i, Je(t));
485
+ }, Ve = (t, i) => {
486
+ if (!t)
487
+ return m;
488
+ const e = new Ft();
489
+ t.state = e, e.window = null;
490
+ const o = Qe(t, i);
491
+ return o !== N && (t.state = null), o;
492
+ }, Gt = (t) => Ve(t, Bt);
493
+ let Ue = !0, q, ee;
494
+ const Kt = (t) => {
495
+ if (Ue) {
496
+ q = new Int32Array(512), ee = new Int32Array(32);
497
+ let i = 0;
498
+ for (; i < 144; )
499
+ t.lens[i++] = 8;
500
+ for (; i < 256; )
501
+ t.lens[i++] = 9;
502
+ for (; i < 280; )
503
+ t.lens[i++] = 7;
504
+ for (; i < 288; )
505
+ t.lens[i++] = 8;
506
+ for (L(Ge, t.lens, 0, 288, q, 0, t.work, { bits: 9 }), i = 0; i < 32; )
507
+ t.lens[i++] = 5;
508
+ L(Ke, t.lens, 0, 32, ee, 0, t.work, { bits: 5 }), Ue = !1;
509
+ }
510
+ t.lencode = q, t.lenbits = 9, t.distcode = ee, t.distbits = 5;
511
+ }, qe = (t, i, e, o) => {
512
+ let r;
513
+ const n = t.state;
514
+ return n.window === null && (n.wsize = 1 << n.wbits, n.wnext = 0, n.whave = 0, n.window = new Uint8Array(n.wsize)), o >= n.wsize ? (n.window.set(i.subarray(e - n.wsize, e), 0), n.wnext = 0, n.whave = n.wsize) : (r = n.wsize - n.wnext, r > o && (r = o), n.window.set(i.subarray(e - o, e - o + r), n.wnext), o -= r, o ? (n.window.set(i.subarray(e - o, e), 0), n.wnext = o, n.whave = n.wsize) : (n.wnext += r, n.wnext === n.wsize && (n.wnext = 0), n.whave < n.wsize && (n.whave += r))), 0;
515
+ }, Pt = (t, i) => {
516
+ let e, o, r, n, d, l, p, a, f, S, w, s, u, T, g = 0, x, E, k, c, v, D, h, A;
517
+ const y = new Uint8Array(4);
518
+ let _, b;
519
+ const Z = (
520
+ /* permutation of code lengths */
521
+ new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15])
522
+ );
523
+ if (!t || !t.state || !t.output || !t.input && t.avail_in !== 0)
524
+ return m;
525
+ e = t.state, e.mode === I && (e.mode = J), d = t.next_out, r = t.output, p = t.avail_out, n = t.next_in, o = t.input, l = t.avail_in, a = e.hold, f = e.bits, S = l, w = p, A = N;
526
+ e:
527
+ for (; ; )
528
+ switch (e.mode) {
529
+ case Xe:
530
+ if (e.wrap === 0) {
531
+ e.mode = J;
532
+ break;
533
+ }
534
+ for (; f < 16; ) {
535
+ if (l === 0)
536
+ break e;
537
+ l--, a += o[n++] << f, f += 8;
538
+ }
539
+ if (e.wrap & 2 && a === 35615) {
540
+ e.check = 0, y[0] = a & 255, y[1] = a >>> 8 & 255, e.check = C(e.check, y, 2, 0), a = 0, f = 0, e.mode = we;
541
+ break;
542
+ }
543
+ if (e.flags = 0, e.head && (e.head.done = !1), !(e.wrap & 1) || /* check if zlib header allowed */
544
+ (((a & 255) << 8) + (a >> 8)) % 31) {
545
+ t.msg = "incorrect header check", e.mode = R;
546
+ break;
547
+ }
548
+ if ((a & 15) !== ue) {
549
+ t.msg = "unknown compression method", e.mode = R;
550
+ break;
551
+ }
552
+ if (a >>>= 4, f -= 4, h = (a & 15) + 8, e.wbits === 0)
553
+ e.wbits = h;
554
+ else if (h > e.wbits) {
555
+ t.msg = "invalid window size", e.mode = R;
556
+ break;
557
+ }
558
+ e.dmax = 1 << e.wbits, t.adler = e.check = 1, e.mode = a & 512 ? pe : I, a = 0, f = 0;
559
+ break;
560
+ case we:
561
+ for (; f < 16; ) {
562
+ if (l === 0)
563
+ break e;
564
+ l--, a += o[n++] << f, f += 8;
565
+ }
566
+ if (e.flags = a, (e.flags & 255) !== ue) {
567
+ t.msg = "unknown compression method", e.mode = R;
568
+ break;
569
+ }
570
+ if (e.flags & 57344) {
571
+ t.msg = "unknown header flags set", e.mode = R;
572
+ break;
573
+ }
574
+ e.head && (e.head.text = a >> 8 & 1), e.flags & 512 && (y[0] = a & 255, y[1] = a >>> 8 & 255, e.check = C(e.check, y, 2, 0)), a = 0, f = 0, e.mode = xe;
575
+ /* falls through */
576
+ case xe:
577
+ for (; f < 32; ) {
578
+ if (l === 0)
579
+ break e;
580
+ l--, a += o[n++] << f, f += 8;
581
+ }
582
+ e.head && (e.head.time = a), e.flags & 512 && (y[0] = a & 255, y[1] = a >>> 8 & 255, y[2] = a >>> 16 & 255, y[3] = a >>> 24 & 255, e.check = C(e.check, y, 4, 0)), a = 0, f = 0, e.mode = _e;
583
+ /* falls through */
584
+ case _e:
585
+ for (; f < 16; ) {
586
+ if (l === 0)
587
+ break e;
588
+ l--, a += o[n++] << f, f += 8;
589
+ }
590
+ e.head && (e.head.xflags = a & 255, e.head.os = a >> 8), e.flags & 512 && (y[0] = a & 255, y[1] = a >>> 8 & 255, e.check = C(e.check, y, 2, 0)), a = 0, f = 0, e.mode = be;
591
+ /* falls through */
592
+ case be:
593
+ if (e.flags & 1024) {
594
+ for (; f < 16; ) {
595
+ if (l === 0)
596
+ break e;
597
+ l--, a += o[n++] << f, f += 8;
598
+ }
599
+ e.length = a, e.head && (e.head.extra_len = a), e.flags & 512 && (y[0] = a & 255, y[1] = a >>> 8 & 255, e.check = C(e.check, y, 2, 0)), a = 0, f = 0;
600
+ } else e.head && (e.head.extra = null);
601
+ e.mode = ke;
602
+ /* falls through */
603
+ case ke:
604
+ if (e.flags & 1024 && (s = e.length, s > l && (s = l), s && (e.head && (h = e.head.extra_len - e.length, e.head.extra || (e.head.extra = new Uint8Array(e.head.extra_len)), e.head.extra.set(
605
+ o.subarray(
606
+ n,
607
+ // extra field is limited to 65536 bytes
608
+ // - no need for additional size check
609
+ n + s
610
+ ),
611
+ /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/
612
+ h
613
+ )), e.flags & 512 && (e.check = C(e.check, o, s, n)), l -= s, n += s, e.length -= s), e.length))
614
+ break e;
615
+ e.length = 0, e.mode = ge;
616
+ /* falls through */
617
+ case ge:
618
+ if (e.flags & 2048) {
619
+ if (l === 0)
620
+ break e;
621
+ s = 0;
622
+ do
623
+ h = o[n + s++], e.head && h && e.length < 65536 && (e.head.name += String.fromCharCode(h));
624
+ while (h && s < l);
625
+ if (e.flags & 512 && (e.check = C(e.check, o, s, n)), l -= s, n += s, h)
626
+ break e;
627
+ } else e.head && (e.head.name = null);
628
+ e.length = 0, e.mode = ve;
629
+ /* falls through */
630
+ case ve:
631
+ if (e.flags & 4096) {
632
+ if (l === 0)
633
+ break e;
634
+ s = 0;
635
+ do
636
+ h = o[n + s++], e.head && h && e.length < 65536 && (e.head.comment += String.fromCharCode(h));
637
+ while (h && s < l);
638
+ if (e.flags & 512 && (e.check = C(e.check, o, s, n)), l -= s, n += s, h)
639
+ break e;
640
+ } else e.head && (e.head.comment = null);
641
+ e.mode = Ee;
642
+ /* falls through */
643
+ case Ee:
644
+ if (e.flags & 512) {
645
+ for (; f < 16; ) {
646
+ if (l === 0)
647
+ break e;
648
+ l--, a += o[n++] << f, f += 8;
649
+ }
650
+ if (a !== (e.check & 65535)) {
651
+ t.msg = "header crc mismatch", e.mode = R;
652
+ break;
653
+ }
654
+ a = 0, f = 0;
655
+ }
656
+ e.head && (e.head.hcrc = e.flags >> 9 & 1, e.head.done = !0), t.adler = e.check = 0, e.mode = I;
657
+ break;
658
+ case pe:
659
+ for (; f < 32; ) {
660
+ if (l === 0)
661
+ break e;
662
+ l--, a += o[n++] << f, f += 8;
663
+ }
664
+ t.adler = e.check = Me(a), a = 0, f = 0, e.mode = X;
665
+ /* falls through */
666
+ case X:
667
+ if (e.havedict === 0)
668
+ return t.next_out = d, t.avail_out = p, t.next_in = n, t.avail_in = l, e.hold = a, e.bits = f, Mt;
669
+ t.adler = e.check = 1, e.mode = I;
670
+ /* falls through */
671
+ case I:
672
+ if (i === Zt || i === K)
673
+ break e;
674
+ /* falls through */
675
+ case J:
676
+ if (e.last) {
677
+ a >>>= f & 7, f -= f & 7, e.mode = V;
678
+ break;
679
+ }
680
+ for (; f < 3; ) {
681
+ if (l === 0)
682
+ break e;
683
+ l--, a += o[n++] << f, f += 8;
684
+ }
685
+ switch (e.last = a & 1, a >>>= 1, f -= 1, a & 3) {
686
+ case 0:
687
+ e.mode = ye;
688
+ break;
689
+ case 1:
690
+ if (Kt(e), e.mode = P, i === K) {
691
+ a >>>= 2, f -= 2;
692
+ break e;
693
+ }
694
+ break;
695
+ case 2:
696
+ e.mode = Re;
697
+ break;
698
+ case 3:
699
+ t.msg = "invalid block type", e.mode = R;
700
+ }
701
+ a >>>= 2, f -= 2;
702
+ break;
703
+ case ye:
704
+ for (a >>>= f & 7, f -= f & 7; f < 32; ) {
705
+ if (l === 0)
706
+ break e;
707
+ l--, a += o[n++] << f, f += 8;
708
+ }
709
+ if ((a & 65535) !== (a >>> 16 ^ 65535)) {
710
+ t.msg = "invalid stored block lengths", e.mode = R;
711
+ break;
712
+ }
713
+ if (e.length = a & 65535, a = 0, f = 0, e.mode = Q, i === K)
714
+ break e;
715
+ /* falls through */
716
+ case Q:
717
+ e.mode = Ae;
718
+ /* falls through */
719
+ case Ae:
720
+ if (s = e.length, s) {
721
+ if (s > l && (s = l), s > p && (s = p), s === 0)
722
+ break e;
723
+ r.set(o.subarray(n, n + s), d), l -= s, n += s, p -= s, d += s, e.length -= s;
724
+ break;
725
+ }
726
+ e.mode = I;
727
+ break;
728
+ case Re:
729
+ for (; f < 14; ) {
730
+ if (l === 0)
731
+ break e;
732
+ l--, a += o[n++] << f, f += 8;
733
+ }
734
+ if (e.nlen = (a & 31) + 257, a >>>= 5, f -= 5, e.ndist = (a & 31) + 1, a >>>= 5, f -= 5, e.ncode = (a & 15) + 4, a >>>= 4, f -= 4, e.nlen > 286 || e.ndist > 30) {
735
+ t.msg = "too many length or distance symbols", e.mode = R;
736
+ break;
737
+ }
738
+ e.have = 0, e.mode = Se;
739
+ /* falls through */
740
+ case Se:
741
+ for (; e.have < e.ncode; ) {
742
+ for (; f < 3; ) {
743
+ if (l === 0)
744
+ break e;
745
+ l--, a += o[n++] << f, f += 8;
746
+ }
747
+ e.lens[Z[e.have++]] = a & 7, a >>>= 3, f -= 3;
748
+ }
749
+ for (; e.have < 19; )
750
+ e.lens[Z[e.have++]] = 0;
751
+ if (e.lencode = e.lendyn, e.lenbits = 7, _ = { bits: e.lenbits }, A = L(Ot, e.lens, 0, 19, e.lencode, 0, e.work, _), e.lenbits = _.bits, A) {
752
+ t.msg = "invalid code lengths set", e.mode = R;
753
+ break;
754
+ }
755
+ e.have = 0, e.mode = Te;
756
+ /* falls through */
757
+ case Te:
758
+ for (; e.have < e.nlen + e.ndist; ) {
759
+ for (; g = e.lencode[a & (1 << e.lenbits) - 1], x = g >>> 24, E = g >>> 16 & 255, k = g & 65535, !(x <= f); ) {
760
+ if (l === 0)
761
+ break e;
762
+ l--, a += o[n++] << f, f += 8;
763
+ }
764
+ if (k < 16)
765
+ a >>>= x, f -= x, e.lens[e.have++] = k;
766
+ else {
767
+ if (k === 16) {
768
+ for (b = x + 2; f < b; ) {
769
+ if (l === 0)
770
+ break e;
771
+ l--, a += o[n++] << f, f += 8;
772
+ }
773
+ if (a >>>= x, f -= x, e.have === 0) {
774
+ t.msg = "invalid bit length repeat", e.mode = R;
775
+ break;
776
+ }
777
+ h = e.lens[e.have - 1], s = 3 + (a & 3), a >>>= 2, f -= 2;
778
+ } else if (k === 17) {
779
+ for (b = x + 3; f < b; ) {
780
+ if (l === 0)
781
+ break e;
782
+ l--, a += o[n++] << f, f += 8;
783
+ }
784
+ a >>>= x, f -= x, h = 0, s = 3 + (a & 7), a >>>= 3, f -= 3;
785
+ } else {
786
+ for (b = x + 7; f < b; ) {
787
+ if (l === 0)
788
+ break e;
789
+ l--, a += o[n++] << f, f += 8;
790
+ }
791
+ a >>>= x, f -= x, h = 0, s = 11 + (a & 127), a >>>= 7, f -= 7;
792
+ }
793
+ if (e.have + s > e.nlen + e.ndist) {
794
+ t.msg = "invalid bit length repeat", e.mode = R;
795
+ break;
796
+ }
797
+ for (; s--; )
798
+ e.lens[e.have++] = h;
799
+ }
800
+ }
801
+ if (e.mode === R)
802
+ break;
803
+ if (e.lens[256] === 0) {
804
+ t.msg = "invalid code -- missing end-of-block", e.mode = R;
805
+ break;
806
+ }
807
+ if (e.lenbits = 9, _ = { bits: e.lenbits }, A = L(Ge, e.lens, 0, e.nlen, e.lencode, 0, e.work, _), e.lenbits = _.bits, A) {
808
+ t.msg = "invalid literal/lengths set", e.mode = R;
809
+ break;
810
+ }
811
+ if (e.distbits = 6, e.distcode = e.distdyn, _ = { bits: e.distbits }, A = L(Ke, e.lens, e.nlen, e.ndist, e.distcode, 0, e.work, _), e.distbits = _.bits, A) {
812
+ t.msg = "invalid distances set", e.mode = R;
813
+ break;
814
+ }
815
+ if (e.mode = P, i === K)
816
+ break e;
817
+ /* falls through */
818
+ case P:
819
+ e.mode = j;
820
+ /* falls through */
821
+ case j:
822
+ if (l >= 6 && p >= 258) {
823
+ t.next_out = d, t.avail_out = p, t.next_in = n, t.avail_in = l, e.hold = a, e.bits = f, St(t, w), d = t.next_out, r = t.output, p = t.avail_out, n = t.next_in, o = t.input, l = t.avail_in, a = e.hold, f = e.bits, e.mode === I && (e.back = -1);
824
+ break;
825
+ }
826
+ for (e.back = 0; g = e.lencode[a & (1 << e.lenbits) - 1], x = g >>> 24, E = g >>> 16 & 255, k = g & 65535, !(x <= f); ) {
827
+ if (l === 0)
828
+ break e;
829
+ l--, a += o[n++] << f, f += 8;
830
+ }
831
+ if (E && (E & 240) === 0) {
832
+ for (c = x, v = E, D = k; g = e.lencode[D + ((a & (1 << c + v) - 1) >> c)], x = g >>> 24, E = g >>> 16 & 255, k = g & 65535, !(c + x <= f); ) {
833
+ if (l === 0)
834
+ break e;
835
+ l--, a += o[n++] << f, f += 8;
836
+ }
837
+ a >>>= c, f -= c, e.back += c;
838
+ }
839
+ if (a >>>= x, f -= x, e.back += x, e.length = k, E === 0) {
840
+ e.mode = Oe;
841
+ break;
842
+ }
843
+ if (E & 32) {
844
+ e.back = -1, e.mode = I;
845
+ break;
846
+ }
847
+ if (E & 64) {
848
+ t.msg = "invalid literal/length code", e.mode = R;
849
+ break;
850
+ }
851
+ e.extra = E & 15, e.mode = De;
852
+ /* falls through */
853
+ case De:
854
+ if (e.extra) {
855
+ for (b = e.extra; f < b; ) {
856
+ if (l === 0)
857
+ break e;
858
+ l--, a += o[n++] << f, f += 8;
859
+ }
860
+ e.length += a & (1 << e.extra) - 1, a >>>= e.extra, f -= e.extra, e.back += e.extra;
861
+ }
862
+ e.was = e.length, e.mode = me;
863
+ /* falls through */
864
+ case me:
865
+ for (; g = e.distcode[a & (1 << e.distbits) - 1], x = g >>> 24, E = g >>> 16 & 255, k = g & 65535, !(x <= f); ) {
866
+ if (l === 0)
867
+ break e;
868
+ l--, a += o[n++] << f, f += 8;
869
+ }
870
+ if ((E & 240) === 0) {
871
+ for (c = x, v = E, D = k; g = e.distcode[D + ((a & (1 << c + v) - 1) >> c)], x = g >>> 24, E = g >>> 16 & 255, k = g & 65535, !(c + x <= f); ) {
872
+ if (l === 0)
873
+ break e;
874
+ l--, a += o[n++] << f, f += 8;
875
+ }
876
+ a >>>= c, f -= c, e.back += c;
877
+ }
878
+ if (a >>>= x, f -= x, e.back += x, E & 64) {
879
+ t.msg = "invalid distance code", e.mode = R;
880
+ break;
881
+ }
882
+ e.offset = k, e.extra = E & 15, e.mode = Ce;
883
+ /* falls through */
884
+ case Ce:
885
+ if (e.extra) {
886
+ for (b = e.extra; f < b; ) {
887
+ if (l === 0)
888
+ break e;
889
+ l--, a += o[n++] << f, f += 8;
890
+ }
891
+ e.offset += a & (1 << e.extra) - 1, a >>>= e.extra, f -= e.extra, e.back += e.extra;
892
+ }
893
+ if (e.offset > e.dmax) {
894
+ t.msg = "invalid distance too far back", e.mode = R;
895
+ break;
896
+ }
897
+ e.mode = Ie;
898
+ /* falls through */
899
+ case Ie:
900
+ if (p === 0)
901
+ break e;
902
+ if (s = w - p, e.offset > s) {
903
+ if (s = e.offset - s, s > e.whave && e.sane) {
904
+ t.msg = "invalid distance too far back", e.mode = R;
905
+ break;
906
+ }
907
+ s > e.wnext ? (s -= e.wnext, u = e.wsize - s) : u = e.wnext - s, s > e.length && (s = e.length), T = e.window;
908
+ } else
909
+ T = r, u = d - e.offset, s = e.length;
910
+ s > p && (s = p), p -= s, e.length -= s;
911
+ do
912
+ r[d++] = T[u++];
913
+ while (--s);
914
+ e.length === 0 && (e.mode = j);
915
+ break;
916
+ case Oe:
917
+ if (p === 0)
918
+ break e;
919
+ r[d++] = e.length, p--, e.mode = j;
920
+ break;
921
+ case V:
922
+ if (e.wrap) {
923
+ for (; f < 32; ) {
924
+ if (l === 0)
925
+ break e;
926
+ l--, a |= o[n++] << f, f += 8;
927
+ }
928
+ if (w -= p, t.total_out += w, e.total += w, w && (t.adler = e.check = /*UPDATE(state.check, put - _out, _out);*/
929
+ e.flags ? C(e.check, r, w, d - w) : ne(e.check, r, w, d - w)), w = p, (e.flags ? a : Me(a)) !== e.check) {
930
+ t.msg = "incorrect data check", e.mode = R;
931
+ break;
932
+ }
933
+ a = 0, f = 0;
934
+ }
935
+ e.mode = Ze;
936
+ /* falls through */
937
+ case Ze:
938
+ if (e.wrap && e.flags) {
939
+ for (; f < 32; ) {
940
+ if (l === 0)
941
+ break e;
942
+ l--, a += o[n++] << f, f += 8;
943
+ }
944
+ if (a !== (e.total & 4294967295)) {
945
+ t.msg = "incorrect length check", e.mode = R;
946
+ break;
947
+ }
948
+ a = 0, f = 0;
949
+ }
950
+ e.mode = Ne;
951
+ /* falls through */
952
+ case Ne:
953
+ A = Nt;
954
+ break e;
955
+ case R:
956
+ A = Pe;
957
+ break e;
958
+ case Ye:
959
+ return je;
960
+ case Lt:
961
+ /* falls through */
962
+ default:
963
+ return m;
964
+ }
965
+ return t.next_out = d, t.avail_out = p, t.next_in = n, t.avail_in = l, e.hold = a, e.bits = f, (e.wsize || w !== t.avail_out && e.mode < R && (e.mode < V || i !== he)) && qe(t, t.output, t.next_out, w - t.avail_out), S -= t.avail_in, w -= t.avail_out, t.total_in += S, t.total_out += w, e.total += w, e.wrap && w && (t.adler = e.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/
966
+ e.flags ? C(e.check, r, w, t.next_out - w) : ne(e.check, r, w, t.next_out - w)), t.data_type = e.bits + (e.last ? 64 : 0) + (e.mode === I ? 128 : 0) + (e.mode === P || e.mode === Q ? 256 : 0), (S === 0 && w === 0 || i === he) && A === N && (A = Ut), A;
967
+ }, jt = (t) => {
968
+ if (!t || !t.state)
969
+ return m;
970
+ let i = t.state;
971
+ return i.window && (i.window = null), t.state = null, N;
972
+ }, Xt = (t, i) => {
973
+ if (!t || !t.state)
974
+ return m;
975
+ const e = t.state;
976
+ return (e.wrap & 2) === 0 ? m : (e.head = i, i.done = !1, N);
977
+ }, Yt = (t, i) => {
978
+ const e = i.length;
979
+ let o, r, n;
980
+ return !t || !t.state || (o = t.state, o.wrap !== 0 && o.mode !== X) ? m : o.mode === X && (r = 1, r = ne(r, i, e, 0), r !== o.check) ? Pe : (n = qe(t, i, e, e), n ? (o.mode = Ye, je) : (o.havedict = 1, N));
981
+ };
982
+ var Wt = Je, Jt = Qe, Qt = We, Vt = Gt, qt = Ve, ei = Pt, ti = jt, ii = Xt, ni = Yt, ai = "pako inflate (from Nodeca project)", O = {
983
+ inflateReset: Wt,
984
+ inflateReset2: Jt,
985
+ inflateResetKeep: Qt,
986
+ inflateInit: Vt,
987
+ inflateInit2: qt,
988
+ inflate: ei,
989
+ inflateEnd: ti,
990
+ inflateGetHeader: ii,
991
+ inflateSetDictionary: ni,
992
+ inflateInfo: ai
993
+ };
994
+ function fi() {
995
+ 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;
996
+ }
997
+ var oi = fi;
998
+ const et = Object.prototype.toString, {
999
+ Z_NO_FLUSH: li,
1000
+ Z_FINISH: si,
1001
+ Z_OK: z,
1002
+ Z_STREAM_END: te,
1003
+ Z_NEED_DICT: ie,
1004
+ Z_STREAM_ERROR: ri,
1005
+ Z_DATA_ERROR: Le,
1006
+ Z_MEM_ERROR: ci
1007
+ } = He;
1008
+ function Y(t) {
1009
+ this.options = Be.assign({
1010
+ chunkSize: 1024 * 64,
1011
+ windowBits: 15,
1012
+ to: ""
1013
+ }, t || {});
1014
+ const i = this.options;
1015
+ i.raw && i.windowBits >= 0 && i.windowBits < 16 && (i.windowBits = -i.windowBits, i.windowBits === 0 && (i.windowBits = -15)), i.windowBits >= 0 && i.windowBits < 16 && !(t && t.windowBits) && (i.windowBits += 32), i.windowBits > 15 && i.windowBits < 48 && (i.windowBits & 15) === 0 && (i.windowBits |= 15), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new At(), this.strm.avail_out = 0;
1016
+ let e = O.inflateInit2(
1017
+ this.strm,
1018
+ i.windowBits
1019
+ );
1020
+ if (e !== z)
1021
+ throw new Error(ae[e]);
1022
+ if (this.header = new oi(), O.inflateGetHeader(this.strm, this.header), i.dictionary && (typeof i.dictionary == "string" ? i.dictionary = fe.string2buf(i.dictionary) : et.call(i.dictionary) === "[object ArrayBuffer]" && (i.dictionary = new Uint8Array(i.dictionary)), i.raw && (e = O.inflateSetDictionary(this.strm, i.dictionary), e !== z)))
1023
+ throw new Error(ae[e]);
1024
+ }
1025
+ Y.prototype.push = function(t, i) {
1026
+ const e = this.strm, o = this.options.chunkSize, r = this.options.dictionary;
1027
+ let n, d, l;
1028
+ if (this.ended) return !1;
1029
+ for (i === ~~i ? d = i : d = i === !0 ? si : li, et.call(t) === "[object ArrayBuffer]" ? e.input = new Uint8Array(t) : e.input = t, e.next_in = 0, e.avail_in = e.input.length; ; ) {
1030
+ for (e.avail_out === 0 && (e.output = new Uint8Array(o), e.next_out = 0, e.avail_out = o), n = O.inflate(e, d), n === ie && r && (n = O.inflateSetDictionary(e, r), n === z ? n = O.inflate(e, d) : n === Le && (n = ie)); e.avail_in > 0 && n === te && e.state.wrap > 0 && t[e.next_in] !== 0; )
1031
+ O.inflateReset(e), n = O.inflate(e, d);
1032
+ switch (n) {
1033
+ case ri:
1034
+ case Le:
1035
+ case ie:
1036
+ case ci:
1037
+ return this.onEnd(n), this.ended = !0, !1;
1038
+ }
1039
+ if (l = e.avail_out, e.next_out && (e.avail_out === 0 || n === te))
1040
+ if (this.options.to === "string") {
1041
+ let p = fe.utf8border(e.output, e.next_out), a = e.next_out - p, f = fe.buf2string(e.output, p);
1042
+ e.next_out = a, e.avail_out = o - a, a && e.output.set(e.output.subarray(p, p + a), 0), this.onData(f);
1043
+ } else
1044
+ this.onData(e.output.length === e.next_out ? e.output : e.output.subarray(0, e.next_out));
1045
+ if (!(n === z && l === 0)) {
1046
+ if (n === te)
1047
+ return n = O.inflateEnd(this.strm), this.onEnd(n), this.ended = !0, !0;
1048
+ if (e.avail_in === 0) break;
1049
+ }
1050
+ }
1051
+ return !0;
1052
+ };
1053
+ Y.prototype.onData = function(t) {
1054
+ this.chunks.push(t);
1055
+ };
1056
+ Y.prototype.onEnd = function(t) {
1057
+ t === z && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = Be.flattenChunks(this.chunks)), this.chunks = [], this.err = t, this.msg = this.strm.msg;
1058
+ };
1059
+ function di(t, i) {
1060
+ const e = new Y(i);
1061
+ if (e.push(t), e.err) throw e.msg || ae[e.err];
1062
+ return e.result;
1063
+ }
1064
+ var hi = di, ui = {
1065
+ inflate: hi
1066
+ };
1067
+ const { inflate: wi } = ui;
1068
+ var xi = wi;
1069
+ export {
1070
+ xi as i
1071
+ };