vitessce 3.3.5 → 3.3.7

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.
@@ -0,0 +1,524 @@
1
+ var E = Uint8Array, Q = Uint16Array, xr = Int32Array, ur = new E([
2
+ 0,
3
+ 0,
4
+ 0,
5
+ 0,
6
+ 0,
7
+ 0,
8
+ 0,
9
+ 0,
10
+ 1,
11
+ 1,
12
+ 1,
13
+ 1,
14
+ 2,
15
+ 2,
16
+ 2,
17
+ 2,
18
+ 3,
19
+ 3,
20
+ 3,
21
+ 3,
22
+ 4,
23
+ 4,
24
+ 4,
25
+ 4,
26
+ 5,
27
+ 5,
28
+ 5,
29
+ 5,
30
+ 0,
31
+ /* unused */
32
+ 0,
33
+ 0,
34
+ /* impossible */
35
+ 0
36
+ ]), tr = new E([
37
+ 0,
38
+ 0,
39
+ 0,
40
+ 0,
41
+ 1,
42
+ 1,
43
+ 2,
44
+ 2,
45
+ 3,
46
+ 3,
47
+ 4,
48
+ 4,
49
+ 5,
50
+ 5,
51
+ 6,
52
+ 6,
53
+ 7,
54
+ 7,
55
+ 8,
56
+ 8,
57
+ 9,
58
+ 9,
59
+ 10,
60
+ 10,
61
+ 11,
62
+ 11,
63
+ 12,
64
+ 12,
65
+ 13,
66
+ 13,
67
+ /* unused */
68
+ 0,
69
+ 0
70
+ ]), zr = new E([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]), Tr = function(r, a) {
71
+ for (var n = new Q(31), e = 0; e < 31; ++e)
72
+ n[e] = a += 1 << r[e - 1];
73
+ for (var v = new xr(n[30]), e = 1; e < 30; ++e)
74
+ for (var f = n[e]; f < n[e + 1]; ++f)
75
+ v[f] = f - n[e] << 5 | e;
76
+ return { b: n, r: v };
77
+ }, Cr = Tr(ur, 2), Er = Cr.b, Mr = Cr.r;
78
+ Er[28] = 258, Mr[258] = 28;
79
+ var Ur = Tr(tr, 0), Gr = Ur.b, Fr = Ur.r, yr = new Q(32768);
80
+ for (var g = 0; g < 32768; ++g) {
81
+ var j = (g & 43690) >> 1 | (g & 21845) << 1;
82
+ j = (j & 52428) >> 2 | (j & 13107) << 2, j = (j & 61680) >> 4 | (j & 3855) << 4, yr[g] = ((j & 65280) >> 8 | (j & 255) << 8) >> 1;
83
+ }
84
+ var Y = function(r, a, n) {
85
+ for (var e = r.length, v = 0, f = new Q(a); v < e; ++v)
86
+ r[v] && ++f[r[v] - 1];
87
+ var o = new Q(a);
88
+ for (v = 1; v < a; ++v)
89
+ o[v] = o[v - 1] + f[v - 1] << 1;
90
+ var h;
91
+ if (n) {
92
+ h = new Q(1 << a);
93
+ var w = 15 - a;
94
+ for (v = 0; v < e; ++v)
95
+ if (r[v])
96
+ for (var x = v << 4 | r[v], i = a - r[v], l = o[r[v] - 1]++ << i, t = l | (1 << i) - 1; l <= t; ++l)
97
+ h[yr[l] >> w] = x;
98
+ } else
99
+ for (h = new Q(e), v = 0; v < e; ++v)
100
+ r[v] && (h[v] = yr[o[r[v] - 1]++] >> 15 - r[v]);
101
+ return h;
102
+ }, L = new E(288);
103
+ for (var g = 0; g < 144; ++g)
104
+ L[g] = 8;
105
+ for (var g = 144; g < 256; ++g)
106
+ L[g] = 9;
107
+ for (var g = 256; g < 280; ++g)
108
+ L[g] = 7;
109
+ for (var g = 280; g < 288; ++g)
110
+ L[g] = 8;
111
+ var fr = new E(32);
112
+ for (var g = 0; g < 32; ++g)
113
+ fr[g] = 5;
114
+ var Hr = /* @__PURE__ */ Y(L, 9, 0), Jr = /* @__PURE__ */ Y(L, 9, 1), Kr = /* @__PURE__ */ Y(fr, 5, 0), Nr = /* @__PURE__ */ Y(fr, 5, 1), hr = function(r) {
115
+ for (var a = r[0], n = 1; n < r.length; ++n)
116
+ r[n] > a && (a = r[n]);
117
+ return a;
118
+ }, W = function(r, a, n) {
119
+ var e = a / 8 | 0;
120
+ return (r[e] | r[e + 1] << 8) >> (a & 7) & n;
121
+ }, wr = function(r, a) {
122
+ var n = a / 8 | 0;
123
+ return (r[n] | r[n + 1] << 8 | r[n + 2] << 16) >> (a & 7);
124
+ }, kr = function(r) {
125
+ return (r + 7) / 8 | 0;
126
+ }, Dr = function(r, a, n) {
127
+ return (a == null || a < 0) && (a = 0), (n == null || n > r.length) && (n = r.length), new E(r.subarray(a, n));
128
+ }, Pr = [
129
+ "unexpected EOF",
130
+ "invalid block type",
131
+ "invalid length/literal",
132
+ "invalid distance",
133
+ "stream finished",
134
+ "no stream handler",
135
+ ,
136
+ "no callback",
137
+ "invalid UTF-8 data",
138
+ "extra field too long",
139
+ "date not in range 1980-2099",
140
+ "filename too long",
141
+ "stream finishing",
142
+ "invalid zip data"
143
+ // determined by unknown compression method
144
+ ], P = function(r, a, n) {
145
+ var e = new Error(a || Pr[r]);
146
+ if (e.code = r, Error.captureStackTrace && Error.captureStackTrace(e, P), !n)
147
+ throw e;
148
+ return e;
149
+ }, Ir = function(r, a, n, e) {
150
+ var v = r.length, f = e ? e.length : 0;
151
+ if (!v || a.f && !a.l)
152
+ return n || new E(0);
153
+ var o = !n, h = o || a.i != 2, w = a.i;
154
+ o && (n = new E(v * 3));
155
+ var x = function(ar) {
156
+ var nr = n.length;
157
+ if (ar > nr) {
158
+ var d = new E(Math.max(nr * 2, ar));
159
+ d.set(n), n = d;
160
+ }
161
+ }, i = a.f || 0, l = a.p || 0, t = a.b || 0, z = a.l, U = a.d, M = a.m, B = a.n, V = v * 8;
162
+ do {
163
+ if (!z) {
164
+ i = W(r, l, 1);
165
+ var H = W(r, l + 1, 3);
166
+ if (l += 3, H)
167
+ if (H == 1)
168
+ z = Jr, U = Nr, M = 9, B = 5;
169
+ else if (H == 2) {
170
+ var q = W(r, l, 31) + 257, A = W(r, l + 10, 15) + 4, c = q + W(r, l + 5, 31) + 1;
171
+ l += 14;
172
+ for (var u = new E(c), S = new E(19), k = 0; k < A; ++k)
173
+ S[zr[k]] = W(r, l + k * 3, 7);
174
+ l += A * 3;
175
+ for (var I = hr(S), _ = (1 << I) - 1, J = Y(S, I, 1), k = 0; k < c; ) {
176
+ var O = J[W(r, l, _)];
177
+ l += O & 15;
178
+ var F = O >> 4;
179
+ if (F < 16)
180
+ u[k++] = F;
181
+ else {
182
+ var T = 0, y = 0;
183
+ for (F == 16 ? (y = 3 + W(r, l, 3), l += 2, T = u[k - 1]) : F == 17 ? (y = 3 + W(r, l, 7), l += 3) : F == 18 && (y = 11 + W(r, l, 127), l += 7); y--; )
184
+ u[k++] = T;
185
+ }
186
+ }
187
+ var G = u.subarray(0, q), C = u.subarray(q);
188
+ M = hr(G), B = hr(C), z = Y(G, M, 1), U = Y(C, B, 1);
189
+ } else
190
+ P(1);
191
+ else {
192
+ var F = kr(l) + 4, m = r[F - 4] | r[F - 3] << 8, D = F + m;
193
+ if (D > v) {
194
+ w && P(0);
195
+ break;
196
+ }
197
+ h && x(t + m), n.set(r.subarray(F, D), t), a.b = t += m, a.p = l = D * 8, a.f = i;
198
+ continue;
199
+ }
200
+ if (l > V) {
201
+ w && P(0);
202
+ break;
203
+ }
204
+ }
205
+ h && x(t + 131072);
206
+ for (var rr = (1 << M) - 1, R = (1 << B) - 1, Z = l; ; Z = l) {
207
+ var T = z[wr(r, l) & rr], K = T >> 4;
208
+ if (l += T & 15, l > V) {
209
+ w && P(0);
210
+ break;
211
+ }
212
+ if (T || P(2), K < 256)
213
+ n[t++] = K;
214
+ else if (K == 256) {
215
+ Z = l, z = null;
216
+ break;
217
+ } else {
218
+ var N = K - 254;
219
+ if (K > 264) {
220
+ var k = K - 257, b = ur[k];
221
+ N = W(r, l, (1 << b) - 1) + Er[k], l += b;
222
+ }
223
+ var X = U[wr(r, l) & R], s = X >> 4;
224
+ X || P(3), l += X & 15;
225
+ var C = Gr[s];
226
+ if (s > 3) {
227
+ var b = tr[s];
228
+ C += wr(r, l) & (1 << b) - 1, l += b;
229
+ }
230
+ if (l > V) {
231
+ w && P(0);
232
+ break;
233
+ }
234
+ h && x(t + 131072);
235
+ var p = t + N;
236
+ if (t < C) {
237
+ var lr = f - C, or = Math.min(C, p);
238
+ for (lr + t < 0 && P(3); t < or; ++t)
239
+ n[t] = e[lr + t];
240
+ }
241
+ for (; t < p; ++t)
242
+ n[t] = n[t - C];
243
+ }
244
+ }
245
+ a.l = z, a.p = Z, a.b = t, a.f = i, z && (i = 1, a.m = M, a.d = U, a.n = B);
246
+ } while (!i);
247
+ return t != n.length && o ? Dr(n, 0, t) : n.subarray(0, t);
248
+ }, $ = function(r, a, n) {
249
+ n <<= a & 7;
250
+ var e = a / 8 | 0;
251
+ r[e] |= n, r[e + 1] |= n >> 8;
252
+ }, er = function(r, a, n) {
253
+ n <<= a & 7;
254
+ var e = a / 8 | 0;
255
+ r[e] |= n, r[e + 1] |= n >> 8, r[e + 2] |= n >> 16;
256
+ }, gr = function(r, a) {
257
+ for (var n = [], e = 0; e < r.length; ++e)
258
+ r[e] && n.push({ s: e, f: r[e] });
259
+ var v = n.length, f = n.slice();
260
+ if (!v)
261
+ return { t: qr, l: 0 };
262
+ if (v == 1) {
263
+ var o = new E(n[0].s + 1);
264
+ return o[n[0].s] = 1, { t: o, l: 1 };
265
+ }
266
+ n.sort(function(D, q) {
267
+ return D.f - q.f;
268
+ }), n.push({ s: -1, f: 25001 });
269
+ var h = n[0], w = n[1], x = 0, i = 1, l = 2;
270
+ for (n[0] = { s: -1, f: h.f + w.f, l: h, r: w }; i != v - 1; )
271
+ h = n[n[x].f < n[l].f ? x++ : l++], w = n[x != i && n[x].f < n[l].f ? x++ : l++], n[i++] = { s: -1, f: h.f + w.f, l: h, r: w };
272
+ for (var t = f[0].s, e = 1; e < v; ++e)
273
+ f[e].s > t && (t = f[e].s);
274
+ var z = new Q(t + 1), U = br(n[i - 1], z, 0);
275
+ if (U > a) {
276
+ var e = 0, M = 0, B = U - a, V = 1 << B;
277
+ for (f.sort(function(q, A) {
278
+ return z[A.s] - z[q.s] || q.f - A.f;
279
+ }); e < v; ++e) {
280
+ var H = f[e].s;
281
+ if (z[H] > a)
282
+ M += V - (1 << U - z[H]), z[H] = a;
283
+ else
284
+ break;
285
+ }
286
+ for (M >>= B; M > 0; ) {
287
+ var F = f[e].s;
288
+ z[F] < a ? M -= 1 << a - z[F]++ - 1 : ++e;
289
+ }
290
+ for (; e >= 0 && M; --e) {
291
+ var m = f[e].s;
292
+ z[m] == a && (--z[m], ++M);
293
+ }
294
+ U = a;
295
+ }
296
+ return { t: new E(z), l: U };
297
+ }, br = function(r, a, n) {
298
+ return r.s == -1 ? Math.max(br(r.l, a, n + 1), br(r.r, a, n + 1)) : a[r.s] = n;
299
+ }, Ar = function(r) {
300
+ for (var a = r.length; a && !r[--a]; )
301
+ ;
302
+ for (var n = new Q(++a), e = 0, v = r[0], f = 1, o = function(w) {
303
+ n[e++] = w;
304
+ }, h = 1; h <= a; ++h)
305
+ if (r[h] == v && h != a)
306
+ ++f;
307
+ else {
308
+ if (!v && f > 2) {
309
+ for (; f > 138; f -= 138)
310
+ o(32754);
311
+ f > 2 && (o(f > 10 ? f - 11 << 5 | 28690 : f - 3 << 5 | 12305), f = 0);
312
+ } else if (f > 3) {
313
+ for (o(v), --f; f > 6; f -= 6)
314
+ o(8304);
315
+ f > 2 && (o(f - 3 << 5 | 8208), f = 0);
316
+ }
317
+ for (; f--; )
318
+ o(v);
319
+ f = 1, v = r[h];
320
+ }
321
+ return { c: n.subarray(0, e), n: a };
322
+ }, vr = function(r, a) {
323
+ for (var n = 0, e = 0; e < a.length; ++e)
324
+ n += r[e] * a[e];
325
+ return n;
326
+ }, mr = function(r, a, n) {
327
+ var e = n.length, v = kr(a + 2);
328
+ r[v] = e & 255, r[v + 1] = e >> 8, r[v + 2] = r[v] ^ 255, r[v + 3] = r[v + 1] ^ 255;
329
+ for (var f = 0; f < e; ++f)
330
+ r[v + f + 4] = n[f];
331
+ return (v + 4 + e) * 8;
332
+ }, Sr = function(r, a, n, e, v, f, o, h, w, x, i) {
333
+ $(a, i++, n), ++v[256];
334
+ for (var l = gr(v, 15), t = l.t, z = l.l, U = gr(f, 15), M = U.t, B = U.l, V = Ar(t), H = V.c, F = V.n, m = Ar(M), D = m.c, q = m.n, A = new Q(19), c = 0; c < H.length; ++c)
335
+ ++A[H[c] & 31];
336
+ for (var c = 0; c < D.length; ++c)
337
+ ++A[D[c] & 31];
338
+ for (var u = gr(A, 7), S = u.t, k = u.l, I = 19; I > 4 && !S[zr[I - 1]]; --I)
339
+ ;
340
+ var _ = x + 5 << 3, J = vr(v, L) + vr(f, fr) + o, O = vr(v, t) + vr(f, M) + o + 14 + 3 * I + vr(A, S) + 2 * A[16] + 3 * A[17] + 7 * A[18];
341
+ if (w >= 0 && _ <= J && _ <= O)
342
+ return mr(a, i, r.subarray(w, w + x));
343
+ var T, y, G, C;
344
+ if ($(a, i, 1 + (O < J)), i += 2, O < J) {
345
+ T = Y(t, z, 0), y = t, G = Y(M, B, 0), C = M;
346
+ var rr = Y(S, k, 0);
347
+ $(a, i, F - 257), $(a, i + 5, q - 1), $(a, i + 10, I - 4), i += 14;
348
+ for (var c = 0; c < I; ++c)
349
+ $(a, i + 3 * c, S[zr[c]]);
350
+ i += 3 * I;
351
+ for (var R = [H, D], Z = 0; Z < 2; ++Z)
352
+ for (var K = R[Z], c = 0; c < K.length; ++c) {
353
+ var N = K[c] & 31;
354
+ $(a, i, rr[N]), i += S[N], N > 15 && ($(a, i, K[c] >> 5 & 127), i += K[c] >> 12);
355
+ }
356
+ } else
357
+ T = Hr, y = L, G = Kr, C = fr;
358
+ for (var c = 0; c < h; ++c) {
359
+ var b = e[c];
360
+ if (b > 255) {
361
+ var N = b >> 18 & 31;
362
+ er(a, i, T[N + 257]), i += y[N + 257], N > 7 && ($(a, i, b >> 23 & 31), i += ur[N]);
363
+ var X = b & 31;
364
+ er(a, i, G[X]), i += C[X], X > 3 && (er(a, i, b >> 5 & 8191), i += tr[X]);
365
+ } else
366
+ er(a, i, T[b]), i += y[b];
367
+ }
368
+ return er(a, i, T[256]), i + y[256];
369
+ }, Qr = /* @__PURE__ */ new xr([65540, 131080, 131088, 131104, 262176, 1048704, 1048832, 2114560, 2117632]), qr = /* @__PURE__ */ new E(0), Rr = function(r, a, n, e, v, f) {
370
+ var o = f.z || r.length, h = new E(e + o + 5 * (1 + Math.ceil(o / 7e3)) + v), w = h.subarray(e, h.length - v), x = f.l, i = (f.r || 0) & 7;
371
+ if (a) {
372
+ i && (w[0] = f.r >> 3);
373
+ for (var l = Qr[a - 1], t = l >> 13, z = l & 8191, U = (1 << n) - 1, M = f.p || new Q(32768), B = f.h || new Q(U + 1), V = Math.ceil(n / 3), H = 2 * V, F = function(cr) {
374
+ return (r[cr] ^ r[cr + 1] << V ^ r[cr + 2] << H) & U;
375
+ }, m = new xr(25e3), D = new Q(288), q = new Q(32), A = 0, c = 0, u = f.i || 0, S = 0, k = f.w || 0, I = 0; u + 2 < o; ++u) {
376
+ var _ = F(u), J = u & 32767, O = B[_];
377
+ if (M[J] = O, B[_] = J, k <= u) {
378
+ var T = o - u;
379
+ if ((A > 7e3 || S > 24576) && (T > 423 || !x)) {
380
+ i = Sr(r, w, 0, m, D, q, c, S, I, u - I, i), S = A = c = 0, I = u;
381
+ for (var y = 0; y < 286; ++y)
382
+ D[y] = 0;
383
+ for (var y = 0; y < 30; ++y)
384
+ q[y] = 0;
385
+ }
386
+ var G = 2, C = 0, rr = z, R = J - O & 32767;
387
+ if (T > 2 && _ == F(u - R))
388
+ for (var Z = Math.min(t, T) - 1, K = Math.min(32767, u), N = Math.min(258, T); R <= K && --rr && J != O; ) {
389
+ if (r[u + G] == r[u + G - R]) {
390
+ for (var b = 0; b < N && r[u + b] == r[u + b - R]; ++b)
391
+ ;
392
+ if (b > G) {
393
+ if (G = b, C = R, b > Z)
394
+ break;
395
+ for (var X = Math.min(R, b - 2), s = 0, y = 0; y < X; ++y) {
396
+ var p = u - R + y & 32767, lr = M[p], or = p - lr & 32767;
397
+ or > s && (s = or, O = p);
398
+ }
399
+ }
400
+ }
401
+ J = O, O = M[J], R += J - O & 32767;
402
+ }
403
+ if (C) {
404
+ m[S++] = 268435456 | Mr[G] << 18 | Fr[C];
405
+ var ar = Mr[G] & 31, nr = Fr[C] & 31;
406
+ c += ur[ar] + tr[nr], ++D[257 + ar], ++q[nr], k = u + G, ++A;
407
+ } else
408
+ m[S++] = r[u], ++D[r[u]];
409
+ }
410
+ }
411
+ for (u = Math.max(u, k); u < o; ++u)
412
+ m[S++] = r[u], ++D[r[u]];
413
+ i = Sr(r, w, x, m, D, q, c, S, I, u - I, i), x || (f.r = i & 7 | w[i / 8 | 0] << 3, i -= 7, f.h = B, f.p = M, f.i = u, f.w = k);
414
+ } else {
415
+ for (var u = f.w || 0; u < o + x; u += 65535) {
416
+ var d = u + 65535;
417
+ d >= o && (w[i / 8 | 0] = x, d = o), i = mr(w, i + 1, r.subarray(u, d));
418
+ }
419
+ f.i = o;
420
+ }
421
+ return Dr(h, 0, e + kr(i) + v);
422
+ }, Vr = /* @__PURE__ */ function() {
423
+ for (var r = new Int32Array(256), a = 0; a < 256; ++a) {
424
+ for (var n = a, e = 9; --e; )
425
+ n = (n & 1 && -306674912) ^ n >>> 1;
426
+ r[a] = n;
427
+ }
428
+ return r;
429
+ }(), Wr = function() {
430
+ var r = -1;
431
+ return {
432
+ p: function(a) {
433
+ for (var n = r, e = 0; e < a.length; ++e)
434
+ n = Vr[n & 255 ^ a[e]] ^ n >>> 8;
435
+ r = n;
436
+ },
437
+ d: function() {
438
+ return ~r;
439
+ }
440
+ };
441
+ }, Br = function() {
442
+ var r = 1, a = 0;
443
+ return {
444
+ p: function(n) {
445
+ for (var e = r, v = a, f = n.length | 0, o = 0; o != f; ) {
446
+ for (var h = Math.min(o + 2655, f); o < h; ++o)
447
+ v += e += n[o];
448
+ e = (e & 65535) + 15 * (e >> 16), v = (v & 65535) + 15 * (v >> 16);
449
+ }
450
+ r = e, a = v;
451
+ },
452
+ d: function() {
453
+ return r %= 65521, a %= 65521, (r & 255) << 24 | (r & 65280) << 8 | (a & 255) << 8 | a >> 8;
454
+ }
455
+ };
456
+ }, Or = function(r, a, n, e, v) {
457
+ if (!v && (v = { l: 1 }, a.dictionary)) {
458
+ var f = a.dictionary.subarray(-32768), o = new E(f.length + r.length);
459
+ o.set(f), o.set(r, f.length), r = o, v.w = f.length;
460
+ }
461
+ return Rr(r, a.level == null ? 6 : a.level, a.mem == null ? v.l ? Math.ceil(Math.max(8, Math.min(13, Math.log(r.length))) * 1.5) : 20 : 12 + a.mem, n, e, v);
462
+ }, ir = function(r, a, n) {
463
+ for (; n; ++a)
464
+ r[a] = n, n >>>= 8;
465
+ }, Xr = function(r, a) {
466
+ var n = a.filename;
467
+ if (r[0] = 31, r[1] = 139, r[2] = 8, r[8] = a.level < 2 ? 4 : a.level == 9 ? 2 : 0, r[9] = 3, a.mtime != 0 && ir(r, 4, Math.floor(new Date(a.mtime || Date.now()) / 1e3)), n) {
468
+ r[3] = 8;
469
+ for (var e = 0; e <= n.length; ++e)
470
+ r[e + 10] = n.charCodeAt(e);
471
+ }
472
+ }, Yr = function(r) {
473
+ (r[0] != 31 || r[1] != 139 || r[2] != 8) && P(6, "invalid gzip data");
474
+ var a = r[3], n = 10;
475
+ a & 4 && (n += (r[10] | r[11] << 8) + 2);
476
+ for (var e = (a >> 3 & 1) + (a >> 4 & 1); e > 0; e -= !r[n++])
477
+ ;
478
+ return n + (a & 2);
479
+ }, Zr = function(r) {
480
+ var a = r.length;
481
+ return (r[a - 4] | r[a - 3] << 8 | r[a - 2] << 16 | r[a - 1] << 24) >>> 0;
482
+ }, $r = function(r) {
483
+ return 10 + (r.filename ? r.filename.length + 1 : 0);
484
+ }, _r = function(r, a) {
485
+ var n = a.level, e = n == 0 ? 0 : n < 6 ? 1 : n == 9 ? 3 : 2;
486
+ if (r[0] = 120, r[1] = e << 6 | (a.dictionary && 32), r[1] |= 31 - (r[0] << 8 | r[1]) % 31, a.dictionary) {
487
+ var v = Br();
488
+ v.p(a.dictionary), ir(r, 2, v.d());
489
+ }
490
+ }, jr = function(r, a) {
491
+ return ((r[0] & 15) != 8 || r[0] >> 4 > 7 || (r[0] << 8 | r[1]) % 31) && P(6, "invalid zlib data"), (r[1] >> 5 & 1) == +!a && P(6, "invalid zlib data: " + (r[1] & 32 ? "need" : "unexpected") + " dictionary"), (r[1] >> 3 & 4) + 2;
492
+ };
493
+ function pr(r, a) {
494
+ a || (a = {});
495
+ var n = Wr(), e = r.length;
496
+ n.p(r);
497
+ var v = Or(r, a, $r(a), 8), f = v.length;
498
+ return Xr(v, a), ir(v, f - 8, n.d()), ir(v, f - 4, e), v;
499
+ }
500
+ function dr(r, a) {
501
+ var n = Yr(r);
502
+ return n + 8 > r.length && P(6, "invalid gzip data"), Ir(r.subarray(n, -8), { i: 2 }, a && a.out || new E(Zr(r)), a && a.dictionary);
503
+ }
504
+ function ra(r, a) {
505
+ a || (a = {});
506
+ var n = Br();
507
+ n.p(r);
508
+ var e = Or(r, a, a.dictionary ? 6 : 2, 4);
509
+ return _r(e, a), ir(e, e.length - 4, n.d()), e;
510
+ }
511
+ function aa(r, a) {
512
+ return Ir(r.subarray(jr(r, a && a.dictionary), -4), { i: 2 }, a && a.out, a && a.dictionary);
513
+ }
514
+ var Lr = typeof TextDecoder < "u" && /* @__PURE__ */ new TextDecoder(), sr = 0;
515
+ try {
516
+ Lr.decode(qr, { stream: !0 }), sr = 1;
517
+ } catch {
518
+ }
519
+ export {
520
+ dr as a,
521
+ pr as g,
522
+ aa as u,
523
+ ra as z
524
+ };
@@ -0,0 +1,14 @@
1
+ var C = /* @__PURE__ */ (() => {
2
+ for (var a = new Uint8Array(128), r = 0; r < 64; r++)
3
+ a[r < 26 ? r + 65 : r < 52 ? r + 71 : r < 62 ? r - 4 : r * 4 - 205] = r;
4
+ return (t) => {
5
+ for (var o = t.length, v = new Uint8Array((o - (t[o - 1] == "=") - (t[o - 2] == "=")) * 3 / 4 | 0), n = 0, e = 0; n < o; ) {
6
+ var d = a[t.charCodeAt(n++)], A = a[t.charCodeAt(n++)], h = a[t.charCodeAt(n++)], y = a[t.charCodeAt(n++)];
7
+ v[e++] = d << 2 | A >> 4, v[e++] = A << 4 | h >> 2, v[e++] = h << 6 | y;
8
+ }
9
+ return v;
10
+ };
11
+ })();
12
+ export {
13
+ C as _
14
+ };
@@ -1,5 +1,5 @@
1
1
  import { i as r } from "./pako.esm-a0be47a3.js";
2
- import { B as o } from "./index-67a2335b.js";
2
+ import { B as o } from "./index-49a32ccf.js";
3
3
  import "react";
4
4
  import "react-dom";
5
5
  class d extends o {
@@ -0,0 +1,24 @@
1
+ var o = Object.defineProperty;
2
+ var a = (t, e, i) => e in t ? o(t, e, { enumerable: !0, configurable: !0, writable: !0, value: i }) : t[e] = i;
3
+ var n = (t, e, i) => (a(t, typeof e != "symbol" ? e + "" : e, i), i);
4
+ import { g as s, a as c } from "./browser-554eb095.js";
5
+ var r, l = (r = class {
6
+ constructor(e = 1) {
7
+ n(this, "level");
8
+ if (e < 0 || e > 9)
9
+ throw new Error("Invalid gzip compression level, it should be between 0 and 9");
10
+ this.level = e;
11
+ }
12
+ static fromConfig({ level: e }) {
13
+ return new r(e);
14
+ }
15
+ encode(e) {
16
+ return s(e, { level: this.level });
17
+ }
18
+ decode(e) {
19
+ return c(e);
20
+ }
21
+ }, n(r, "codecId", "gzip"), r), u = l;
22
+ export {
23
+ u as default
24
+ };
@@ -1,6 +1,6 @@
1
1
  import gh from "react";
2
2
  import yh from "react-dom";
3
- import { c as Ca, g as Rl, e as Ll, b as Th } from "./index-67a2335b.js";
3
+ import { c as Ca, g as Rl, e as Ll, b as Th } from "./index-49a32ccf.js";
4
4
  function bh(T, g) {
5
5
  for (var a = 0; a < g.length; a++) {
6
6
  const h = g[a];