@unicom-cloud/utils 0.1.44 → 0.1.46

package/fflate/src/index.js

@@ -0,0 +1,1424 @@
+/* 潘启宝 2026-05-21 17:01:48 星期四 山东省济南市 */
+import e from "./worker.js";
+//#region utils/fflate/src/index.ts
+var t = Uint8Array, n = Uint16Array, r = Int32Array, i = new t([
+	0,
+	0,
+	0,
+	0,
+	0,
+	0,
+	0,
+	0,
+	1,
+	1,
+	1,
+	1,
+	2,
+	2,
+	2,
+	2,
+	3,
+	3,
+	3,
+	3,
+	4,
+	4,
+	4,
+	4,
+	5,
+	5,
+	5,
+	5,
+	0,
+	0,
+	0,
+	0
+]), a = new t([
+	0,
+	0,
+	0,
+	0,
+	1,
+	1,
+	2,
+	2,
+	3,
+	3,
+	4,
+	4,
+	5,
+	5,
+	6,
+	6,
+	7,
+	7,
+	8,
+	8,
+	9,
+	9,
+	10,
+	10,
+	11,
+	11,
+	12,
+	12,
+	13,
+	13,
+	0,
+	0
+]), o = new t([
+	16,
+	17,
+	18,
+	0,
+	8,
+	7,
+	9,
+	6,
+	10,
+	5,
+	11,
+	4,
+	12,
+	3,
+	13,
+	2,
+	14,
+	1,
+	15
+]), s = (e, t) => {
+	let i = new n(31);
+	for (let n = 0; n < 31; ++n) i[n] = t += 1 << e[n - 1];
+	let a = new r(i[30]);
+	for (let e = 1; e < 30; ++e) for (let t = i[e]; t < i[e + 1]; ++t) a[t] = t - i[e] << 5 | e;
+	return {
+		b: i,
+		r: a
+	};
+}, { b: c, r: l } = s(i, 2);
+c[28] = 258, l[258] = 28;
+var { b: u, r: d } = s(a, 0), f = new n(32768);
+for (let e = 0; e < 32768; ++e) {
+	let t = (e & 43690) >> 1 | (e & 21845) << 1;
+	t = (t & 52428) >> 2 | (t & 13107) << 2, t = (t & 61680) >> 4 | (t & 3855) << 4, f[e] = ((t & 65280) >> 8 | (t & 255) << 8) >> 1;
+}
+var p = (e, t, r) => {
+	let i = e.length, a = 0, o = new n(t);
+	for (; a < i; ++a) e[a] && ++o[e[a] - 1];
+	let s = new n(t);
+	for (a = 1; a < t; ++a) s[a] = s[a - 1] + o[a - 1] << 1;
+	let c;
+	if (r) {
+		c = new n(1 << t);
+		let r = 15 - t;
+		for (a = 0; a < i; ++a) if (e[a]) {
+			let n = a << 4 | e[a], i = t - e[a], o = s[e[a] - 1]++ << i;
+			for (let e = o | (1 << i) - 1; o <= e; ++o) c[f[o] >> r] = n;
+		}
+	} else for (c = new n(i), a = 0; a < i; ++a) e[a] && (c[a] = f[s[e[a] - 1]++] >> 15 - e[a]);
+	return c;
+}, m = new t(288);
+for (let e = 0; e < 144; ++e) m[e] = 8;
+for (let e = 144; e < 256; ++e) m[e] = 9;
+for (let e = 256; e < 280; ++e) m[e] = 7;
+for (let e = 280; e < 288; ++e) m[e] = 8;
+var h = new t(32);
+for (let e = 0; e < 32; ++e) h[e] = 5;
+var g = /* @__PURE__ */ p(m, 9, 0), _ = /* @__PURE__ */ p(m, 9, 1), v = /* @__PURE__ */ p(h, 5, 0), y = /* @__PURE__ */ p(h, 5, 1), b = (e) => {
+	let t = e[0];
+	for (let n = 1; n < e.length; ++n) e[n] > t && (t = e[n]);
+	return t;
+}, x = (e, t, n) => {
+	let r = t / 8 | 0;
+	return (e[r] | e[r + 1] << 8) >> (t & 7) & n;
+}, S = (e, t) => {
+	let n = t / 8 | 0;
+	return (e[n] | e[n + 1] << 8 | e[n + 2] << 16) >> (t & 7);
+}, C = (e) => (e + 7) / 8 | 0, w = (e, n, r) => ((n == null || n < 0) && (n = 0), (r == null || r > e.length) && (r = e.length), new t(e.subarray(n, r))), T = {
+	UnexpectedEOF: 0,
+	InvalidBlockType: 1,
+	InvalidLengthLiteral: 2,
+	InvalidDistance: 3,
+	StreamFinished: 4,
+	NoStreamHandler: 5,
+	InvalidHeader: 6,
+	NoCallback: 7,
+	InvalidUTF8: 8,
+	ExtraFieldTooLong: 9,
+	InvalidDate: 10,
+	FilenameTooLong: 11,
+	StreamFinishing: 12,
+	InvalidZipData: 13,
+	UnknownCompressionMethod: 14
+}, E = [
+	"unexpected EOF",
+	"invalid block type",
+	"invalid length/literal",
+	"invalid distance",
+	"stream finished",
+	"no stream handler",
+	,
+	"no callback",
+	"invalid UTF-8 data",
+	"extra field too long",
+	"date not in range 1980-2099",
+	"filename too long",
+	"stream finishing",
+	"invalid zip data"
+], D = (e, t, n) => {
+	let r = Error(t || E[e]);
+	if (r.code = e, Error.captureStackTrace && Error.captureStackTrace(r, D), !n) throw r;
+	return r;
+}, O = (e, n, r, s) => {
+	let l = e.length, d = s ? s.length : 0;
+	if (!l || n.f && !n.l) return r || new t(0);
+	let f = !r, m = f || n.i != 2, h = n.i;
+	f && (r = new t(l * 3));
+	let g = (e) => {
+		let n = r.length;
+		if (e > n) {
+			let i = new t(Math.max(n * 2, e));
+			i.set(r), r = i;
+		}
+	}, v = n.f || 0, T = n.p || 0, E = n.b || 0, O = n.l, k = n.d, A = n.m, j = n.n, M = l * 8;
+	do {
+		if (!O) {
+			v = x(e, T, 1);
+			let i = x(e, T + 1, 3);
+			if (T += 3, !i) {
+				let t = C(T) + 4, i = e[t - 4] | e[t - 3] << 8, a = t + i;
+				if (a > l) {
+					h && D(0);
+					break;
+				}
+				m && g(E + i), r.set(e.subarray(t, a), E), n.b = E += i, n.p = T = a * 8, n.f = v;
+				continue;
+			} else if (i == 1) O = _, k = y, A = 9, j = 5;
+			else if (i == 2) {
+				let n = x(e, T, 31) + 257, r = x(e, T + 10, 15) + 4, i = n + x(e, T + 5, 31) + 1;
+				T += 14;
+				let a = new t(i), s = new t(19);
+				for (let t = 0; t < r; ++t) s[o[t]] = x(e, T + t * 3, 7);
+				T += r * 3;
+				let c = b(s), l = (1 << c) - 1, u = p(s, c, 1);
+				for (let t = 0; t < i;) {
+					let n = u[x(e, T, l)];
+					T += n & 15;
+					let r = n >> 4;
+					if (r < 16) a[t++] = r;
+					else {
+						let n = 0, i = 0;
+						for (r == 16 ? (i = 3 + x(e, T, 3), T += 2, n = a[t - 1]) : r == 17 ? (i = 3 + x(e, T, 7), T += 3) : r == 18 && (i = 11 + x(e, T, 127), T += 7); i--;) a[t++] = n;
+					}
+				}
+				let d = a.subarray(0, n), f = a.subarray(n);
+				A = b(d), j = b(f), O = p(d, A, 1), k = p(f, j, 1);
+			} else D(1);
+			if (T > M) {
+				h && D(0);
+				break;
+			}
+		}
+		m && g(E + 131072);
+		let f = (1 << A) - 1, w = (1 << j) - 1, N = T;
+		for (;; N = T) {
+			let t = O[S(e, T) & f], n = t >> 4;
+			if (T += t & 15, T > M) {
+				h && D(0);
+				break;
+			}
+			if (t || D(2), n < 256) r[E++] = n;
+			else if (n == 256) {
+				N = T, O = null;
+				break;
+			} else {
+				let t = n - 254;
+				if (n > 264) {
+					let r = n - 257, a = i[r];
+					t = x(e, T, (1 << a) - 1) + c[r], T += a;
+				}
+				let o = k[S(e, T) & w], l = o >> 4;
+				o || D(3), T += o & 15;
+				let f = u[l];
+				if (l > 3) {
+					let t = a[l];
+					f += S(e, T) & (1 << t) - 1, T += t;
+				}
+				if (T > M) {
+					h && D(0);
+					break;
+				}
+				m && g(E + 131072);
+				let p = E + t;
+				if (E < f) {
+					let e = d - f, t = Math.min(f, p);
+					for (e + E < 0 && D(3); E < t; ++E) r[E] = s[e + E];
+				}
+				for (; E < p; ++E) r[E] = r[E - f];
+			}
+		}
+		n.l = O, n.p = N, n.b = E, n.f = v, O && (v = 1, n.m = A, n.d = k, n.n = j);
+	} while (!v);
+	return E != r.length && f ? w(r, 0, E) : r.subarray(0, E);
+}, k = (e, t, n) => {
+	n <<= t & 7;
+	let r = t / 8 | 0;
+	e[r] |= n, e[r + 1] |= n >> 8;
+}, A = (e, t, n) => {
+	n <<= t & 7;
+	let r = t / 8 | 0;
+	e[r] |= n, e[r + 1] |= n >> 8, e[r + 2] |= n >> 16;
+}, j = (e, r) => {
+	let i = [];
+	for (let t = 0; t < e.length; ++t) e[t] && i.push({
+		s: t,
+		f: e[t]
+	});
+	let a = i.length, o = i.slice();
+	if (!a) return {
+		t: I,
+		l: 0
+	};
+	if (a == 1) {
+		let e = new t(i[0].s + 1);
+		return e[i[0].s] = 1, {
+			t: e,
+			l: 1
+		};
+	}
+	i.sort((e, t) => e.f - t.f), i.push({
+		s: -1,
+		f: 25001
+	});
+	let s = i[0], c = i[1], l = 0, u = 1, d = 2;
+	for (i[0] = {
+		s: -1,
+		f: s.f + c.f,
+		l: s,
+		r: c
+	}; u != a - 1;) s = i[i[l].f < i[d].f ? l++ : d++], c = i[l != u && i[l].f < i[d].f ? l++ : d++], i[u++] = {
+		s: -1,
+		f: s.f + c.f,
+		l: s,
+		r: c
+	};
+	let f = o[0].s;
+	for (let e = 1; e < a; ++e) o[e].s > f && (f = o[e].s);
+	let p = new n(f + 1), m = M(i[u - 1], p, 0);
+	if (m > r) {
+		let e = 0, t = 0, n = m - r, i = 1 << n;
+		for (o.sort((e, t) => p[t.s] - p[e.s] || e.f - t.f); e < a; ++e) {
+			let n = o[e].s;
+			if (p[n] > r) t += i - (1 << m - p[n]), p[n] = r;
+			else break;
+		}
+		for (t >>= n; t > 0;) {
+			let n = o[e].s;
+			p[n] < r ? t -= 1 << r - p[n]++ - 1 : ++e;
+		}
+		for (; e >= 0 && t; --e) {
+			let n = o[e].s;
+			p[n] == r && (--p[n], ++t);
+		}
+		m = r;
+	}
+	return {
+		t: new t(p),
+		l: m
+	};
+}, M = (e, t, n) => e.s == -1 ? Math.max(M(e.l, t, n + 1), M(e.r, t, n + 1)) : t[e.s] = n, N = (e) => {
+	let t = e.length;
+	for (; t && !e[--t];);
+	let r = new n(++t), i = 0, a = e[0], o = 1, s = (e) => {
+		r[i++] = e;
+	};
+	for (let n = 1; n <= t; ++n) if (e[n] == a && n != t) ++o;
+	else {
+		if (!a && o > 2) {
+			for (; o > 138; o -= 138) s(32754);
+			o > 2 && (s(o > 10 ? o - 11 << 5 | 28690 : o - 3 << 5 | 12305), o = 0);
+		} else if (o > 3) {
+			for (s(a), --o; o > 6; o -= 6) s(8304);
+			o > 2 && (s(o - 3 << 5 | 8208), o = 0);
+		}
+		for (; o--;) s(a);
+		o = 1, a = e[n];
+	}
+	return {
+		c: r.subarray(0, i),
+		n: t
+	};
+}, P = (e, t) => {
+	let n = 0;
+	for (let r = 0; r < t.length; ++r) n += e[r] * t[r];
+	return n;
+}, ee = (e, t, n) => {
+	let r = n.length, i = C(t + 2);
+	e[i] = r & 255, e[i + 1] = r >> 8, e[i + 2] = e[i] ^ 255, e[i + 3] = e[i + 1] ^ 255;
+	for (let t = 0; t < r; ++t) e[i + t + 4] = n[t];
+	return (i + 4 + r) * 8;
+}, te = (e, t, r, s, c, l, u, d, f, _, y) => {
+	k(t, y++, r), ++c[256];
+	let { t: b, l: x } = j(c, 15), { t: S, l: C } = j(l, 15), { c: w, n: T } = N(b), { c: E, n: D } = N(S), O = new n(19);
+	for (let e = 0; e < w.length; ++e) ++O[w[e] & 31];
+	for (let e = 0; e < E.length; ++e) ++O[E[e] & 31];
+	let { t: M, l: te } = j(O, 7), F = 19;
+	for (; F > 4 && !M[o[F - 1]]; --F);
+	let I = _ + 5 << 3, ne = P(c, m) + P(l, h) + u, re = P(c, b) + P(l, S) + u + 14 + 3 * F + P(O, M) + 2 * O[16] + 3 * O[17] + 7 * O[18];
+	if (f >= 0 && I <= ne && I <= re) return ee(t, y, e.subarray(f, f + _));
+	let L, R, z, B;
+	if (k(t, y, 1 + (re < ne)), y += 2, re < ne) {
+		L = p(b, x, 0), R = b, z = p(S, C, 0), B = S;
+		let e = p(M, te, 0);
+		k(t, y, T - 257), k(t, y + 5, D - 1), k(t, y + 10, F - 4), y += 14;
+		for (let e = 0; e < F; ++e) k(t, y + 3 * e, M[o[e]]);
+		y += 3 * F;
+		let n = [w, E];
+		for (let r = 0; r < 2; ++r) {
+			let i = n[r];
+			for (let n = 0; n < i.length; ++n) {
+				let r = i[n] & 31;
+				k(t, y, e[r]), y += M[r], r > 15 && (k(t, y, i[n] >> 5 & 127), y += i[n] >> 12);
+			}
+		}
+	} else L = g, R = m, z = v, B = h;
+	for (let e = 0; e < d; ++e) {
+		let n = s[e];
+		if (n > 255) {
+			let e = n >> 18 & 31;
+			A(t, y, L[e + 257]), y += R[e + 257], e > 7 && (k(t, y, n >> 23 & 31), y += i[e]);
+			let r = n & 31;
+			A(t, y, z[r]), y += B[r], r > 3 && (A(t, y, n >> 5 & 8191), y += a[r]);
+		} else A(t, y, L[n]), y += R[n];
+	}
+	return A(t, y, L[256]), y + R[256];
+}, F = /* @__PURE__ */ new r([
+	65540,
+	131080,
+	131088,
+	131104,
+	262176,
+	1048704,
+	1048832,
+	2114560,
+	2117632
+]), I = /* @__PURE__ */ new t(0), ne = (e, o, s, c, u, f) => {
+	let p = f.z || e.length, m = new t(c + p + 5 * (1 + Math.ceil(p / 7e3)) + u), h = m.subarray(c, m.length - u), g = f.l, _ = (f.r || 0) & 7;
+	if (o) {
+		_ && (h[0] = f.r >> 3);
+		let t = F[o - 1], c = t >> 13, u = t & 8191, m = (1 << s) - 1, v = f.p || new n(32768), y = f.h || new n(m + 1), b = Math.ceil(s / 3), x = 2 * b, S = (t) => (e[t] ^ e[t + 1] << b ^ e[t + 2] << x) & m, C = new r(25e3), w = new n(288), T = new n(32), E = 0, D = 0, O = f.i || 0, k = 0, A = f.w || 0, j = 0;
+		for (; O + 2 < p; ++O) {
+			let t = S(O), n = O & 32767, r = y[t];
+			if (v[n] = r, y[t] = n, A <= O) {
+				let o = p - O;
+				if ((E > 7e3 || k > 24576) && (o > 423 || !g)) {
+					_ = te(e, h, 0, C, w, T, D, k, j, O - j, _), k = E = D = 0, j = O;
+					for (let e = 0; e < 286; ++e) w[e] = 0;
+					for (let e = 0; e < 30; ++e) T[e] = 0;
+				}
+				let s = 2, f = 0, m = u, y = n - r & 32767;
+				if (o > 2 && t == S(O - y)) {
+					let t = Math.min(c, o) - 1, i = Math.min(32767, O), a = Math.min(258, o);
+					for (; y <= i && --m && n != r;) {
+						if (e[O + s] == e[O + s - y]) {
+							let n = 0;
+							for (; n < a && e[O + n] == e[O + n - y]; ++n);
+							if (n > s) {
+								if (s = n, f = y, n > t) break;
+								let e = Math.min(y, n - 2), i = 0;
+								for (let t = 0; t < e; ++t) {
+									let e = O - y + t & 32767, n = e - v[e] & 32767;
+									n > i && (i = n, r = e);
+								}
+							}
+						}
+						n = r, r = v[n], y += n - r & 32767;
+					}
+				}
+				if (f) {
+					C[k++] = 268435456 | l[s] << 18 | d[f];
+					let e = l[s] & 31, t = d[f] & 31;
+					D += i[e] + a[t], ++w[257 + e], ++T[t], A = O + s, ++E;
+				} else C[k++] = e[O], ++w[e[O]];
+			}
+		}
+		for (O = Math.max(O, A); O < p; ++O) C[k++] = e[O], ++w[e[O]];
+		_ = te(e, h, g, C, w, T, D, k, j, O - j, _), g || (f.r = _ & 7 | h[_ / 8 | 0] << 3, _ -= 7, f.h = y, f.p = v, f.i = O, f.w = A);
+	} else {
+		for (let t = f.w || 0; t < p + g; t += 65535) {
+			let n = t + 65535;
+			n >= p && (h[_ / 8 | 0] = g, n = p), _ = ee(h, _ + 1, e.subarray(t, n));
+		}
+		f.i = p;
+	}
+	return w(m, 0, c + C(_) + u);
+}, re = /* @__PURE__ */ (() => {
+	let e = new Int32Array(256);
+	for (let t = 0; t < 256; ++t) {
+		let n = t, r = 9;
+		for (; --r;) n = (n & 1 && -306674912) ^ n >>> 1;
+		e[t] = n;
+	}
+	return e;
+})(), L = () => {
+	let e = -1;
+	return {
+		p(t) {
+			let n = e;
+			for (let e = 0; e < t.length; ++e) n = re[n & 255 ^ t[e]] ^ n >>> 8;
+			e = n;
+		},
+		d() {
+			return ~e;
+		}
+	};
+}, R = () => {
+	let e = 1, t = 0;
+	return {
+		p(n) {
+			let r = e, i = t, a = n.length | 0;
+			for (let e = 0; e != a;) {
+				let t = Math.min(e + 2655, a);
+				for (; e < t; ++e) i += r += n[e];
+				r = (r & 65535) + 15 * (r >> 16), i = (i & 65535) + 15 * (i >> 16);
+			}
+			e = r, t = i;
+		},
+		d() {
+			return e %= 65521, t %= 65521, (e & 255) << 24 | (e & 65280) << 8 | (t & 255) << 8 | t >> 8;
+		}
+	};
+}, z = (e, n, r, i, a) => {
+	if (!a && (a = { l: 1 }, n.dictionary)) {
+		let r = n.dictionary.subarray(-32768), i = new t(r.length + e.length);
+		i.set(r), i.set(e, r.length), e = i, a.w = r.length;
+	}
+	return ne(e, n.level == null ? 6 : n.level, n.mem == null ? a.l ? Math.ceil(Math.max(8, Math.min(13, Math.log(e.length))) * 1.5) : 20 : 12 + n.mem, r, i, a);
+}, B = (e, t) => {
+	let n = {};
+	for (let t in e) n[t] = e[t];
+	for (let e in t) n[e] = t[e];
+	return n;
+}, ie = (e, t, n) => {
+	let r = e(), i = e.toString(), a = i.slice(i.indexOf("[") + 1, i.lastIndexOf("]")).replace(/\s+/g, "").split(",");
+	for (let e = 0; e < r.length; ++e) {
+		let i = r[e], o = a[e];
+		if (typeof i == "function") {
+			t += ";" + o + "=";
+			let e = i.toString();
+			if (i.prototype) if (e.indexOf("[native code]") != -1) {
+				let n = e.indexOf(" ", 8) + 1;
+				t += e.slice(n, e.indexOf("(", n));
+			} else {
+				t += e;
+				for (let e in i.prototype) t += ";" + o + ".prototype." + e + "=" + i.prototype[e].toString();
+			}
+			else t += e;
+		} else n[o] = i;
+	}
+	return t;
+}, ae = [], oe = (e) => {
+	let t = [];
+	for (let n in e) e[n].buffer && t.push((e[n] = new e[n].constructor(e[n])).buffer);
+	return t;
+}, se = (t, n, r, i) => {
+	if (!ae[r]) {
+		let e = "", n = {}, i = t.length - 1;
+		for (let r = 0; r < i; ++r) e = ie(t[r], e, n);
+		ae[r] = {
+			c: ie(t[i], e, n),
+			e: n
+		};
+	}
+	let a = B({}, ae[r].e);
+	return e(ae[r].c + ";onmessage=function(e){for(var k in e.data)self[k]=e.data[k];onmessage=" + n.toString() + "}", r, a, oe(a), i);
+}, V = () => [
+	t,
+	n,
+	r,
+	i,
+	a,
+	o,
+	c,
+	u,
+	_,
+	y,
+	f,
+	E,
+	p,
+	b,
+	x,
+	S,
+	C,
+	w,
+	D,
+	O,
+	Ee,
+	U,
+	fe
+], H = () => [
+	t,
+	n,
+	r,
+	i,
+	a,
+	o,
+	l,
+	d,
+	g,
+	m,
+	v,
+	h,
+	f,
+	F,
+	I,
+	p,
+	k,
+	A,
+	j,
+	M,
+	N,
+	P,
+	ee,
+	te,
+	C,
+	w,
+	ne,
+	z,
+	Ce,
+	U
+], ce = () => [
+	he,
+	ve,
+	J,
+	L,
+	re
+], le = () => [ge, _e], ue = () => [
+	ye,
+	J,
+	R
+], de = () => [be], U = (e) => postMessage(e, [e.buffer]), fe = (e) => e && {
+	out: e.size && new t(e.size),
+	dictionary: e.dictionary
+}, pe = (e, t, n, r, i, a) => {
+	let o = se(n, r, i, (e, t) => {
+		o.terminate(), a(e, t);
+	});
+	return o.postMessage([e, t], t.consume ? [e.buffer] : []), () => {
+		o.terminate();
+	};
+}, W = (e) => (e.ondata = (e, t) => postMessage([e, t], [e.buffer]), (t) => {
+	t.data[0] ? (e.push(t.data[0], t.data[1]), postMessage([t.data[0].length])) : e.flush(t.data[1]);
+}), G = (e, t, n, r, i, a, o) => {
+	let s, c = se(e, r, i, (e, n) => {
+		e ? (c.terminate(), t.ondata.call(t, e)) : Array.isArray(n) ? n.length == 1 ? (t.queuedSize -= n[0], t.ondrain && t.ondrain(n[0])) : (n[1] && c.terminate(), t.ondata.call(t, e, n[0], n[1])) : o(n);
+	});
+	c.postMessage(n), t.queuedSize = 0, t.push = (e, n) => {
+		t.ondata || D(5), s && t.ondata(D(4, 0, 1), null, !!n), t.queuedSize += e.length, c.postMessage([e, s = n], e.buffer instanceof ArrayBuffer ? [e.buffer] : []);
+	}, t.terminate = () => {
+		c.terminate();
+	}, a && (t.flush = (e) => {
+		c.postMessage([0, e]);
+	});
+}, K = (e, t) => e[t] | e[t + 1] << 8, q = (e, t) => (e[t] | e[t + 1] << 8 | e[t + 2] << 16 | e[t + 3] << 24) >>> 0, me = (e, t) => q(e, t) + q(e, t + 4) * 4294967296, J = (e, t, n) => {
+	for (; n; ++t) e[t] = n, n >>>= 8;
+}, he = (e, t) => {
+	let n = t.filename;
+	if (e[0] = 31, e[1] = 139, e[2] = 8, e[8] = t.level < 2 ? 4 : t.level == 9 ? 2 : 0, e[9] = 3, t.mtime != 0 && J(e, 4, Math.floor(new Date(t.mtime || Date.now()) / 1e3)), n) {
+		e[3] = 8;
+		for (let t = 0; t <= n.length; ++t) e[t + 10] = n.charCodeAt(t);
+	}
+}, ge = (e) => {
+	(e[0] != 31 || e[1] != 139 || e[2] != 8) && D(6, "invalid gzip data");
+	let t = e[3], n = 10;
+	t & 4 && (n += (e[10] | e[11] << 8) + 2);
+	for (let r = (t >> 3 & 1) + (t >> 4 & 1); r > 0; r -= !e[n++]);
+	return n + (t & 2);
+}, _e = (e) => {
+	let t = e.length;
+	return (e[t - 4] | e[t - 3] << 8 | e[t - 2] << 16 | e[t - 1] << 24) >>> 0;
+}, ve = (e) => 10 + (e.filename ? e.filename.length + 1 : 0), ye = (e, t) => {
+	let n = t.level, r = n == 0 ? 0 : n < 6 ? 1 : n == 9 ? 3 : 2;
+	if (e[0] = 120, e[1] = r << 6 | (t.dictionary && 32), e[1] |= 31 - (e[0] << 8 | e[1]) % 31, t.dictionary) {
+		let n = R();
+		n.p(t.dictionary), J(e, 2, n.d());
+	}
+}, be = (e, t) => (((e[0] & 15) != 8 || e[0] >> 4 > 7 || (e[0] << 8 | e[1]) % 31) && D(6, "invalid zlib data"), (e[1] >> 5 & 1) == +!t && D(6, "invalid zlib data: " + (e[1] & 32 ? "need" : "unexpected") + " dictionary"), (e[1] >> 3 & 4) + 2);
+function Y(e, t) {
+	return typeof e == "function" && (t = e, e = {}), this.ondata = t, e;
+}
+var X = class {
+	constructor(e, n) {
+		if (typeof e == "function" && (n = e, e = {}), this.ondata = n, this.o = e || {}, this.s = {
+			l: 0,
+			i: 32768,
+			w: 32768,
+			z: 32768
+		}, this.b = new t(98304), this.o.dictionary) {
+			let e = this.o.dictionary.subarray(-32768);
+			this.b.set(e, 32768 - e.length), this.s.i = 32768 - e.length;
+		}
+	}
+	p(e, t) {
+		this.ondata(z(e, this.o, 0, 0, this.s), t);
+	}
+	push(e, n) {
+		this.ondata || D(5), this.s.l && D(4);
+		let r = e.length + this.s.z;
+		if (r > this.b.length) {
+			if (r > 2 * this.b.length - 32768) {
+				let e = new t(r & -32768);
+				e.set(this.b.subarray(0, this.s.z)), this.b = e;
+			}
+			let n = this.b.length - this.s.z;
+			this.b.set(e.subarray(0, n), this.s.z), this.s.z = this.b.length, this.p(this.b, !1), this.b.set(this.b.subarray(-32768)), this.b.set(e.subarray(n), 32768), this.s.z = e.length - n + 32768, this.s.i = 32766, this.s.w = 32768;
+		} else this.b.set(e, this.s.z), this.s.z += e.length;
+		this.s.l = n & 1, (this.s.z > this.s.w + 8191 || n) && (this.p(this.b, n || !1), this.s.w = this.s.i, this.s.i -= 2), n && (this.s = this.o = {}, this.b = I);
+	}
+	flush(e) {
+		if (this.ondata || D(5), this.s.l && D(4), this.p(this.b, !1), this.s.w = this.s.i, this.s.i -= 2, e) {
+			let e = new t(6);
+			e[0] = this.s.r >> 3;
+			let n = ee(e, this.s.r, I);
+			this.s.r = 0, this.ondata(e.subarray(0, n >> 3), !1);
+		}
+	}
+}, xe = class {
+	constructor(e, t) {
+		G([H, () => [W, X]], this, Y.call(this, e, t), (e) => {
+			onmessage = W(new X(e.data));
+		}, 6, 1);
+	}
+};
+function Se(e, t, n) {
+	return n || (n = t, t = {}), typeof n != "function" && D(7), pe(e, t, [H], (e) => U(Ce(e.data[0], e.data[1])), 0, n);
+}
+function Ce(e, t) {
+	return z(e, t || {}, 0, 0);
+}
+var Z = class {
+	constructor(e, n) {
+		typeof e == "function" && (n = e, e = {}), this.ondata = n;
+		let r = e && e.dictionary && e.dictionary.subarray(-32768);
+		this.s = {
+			i: 0,
+			b: r ? r.length : 0
+		}, this.o = new t(32768), this.p = new t(0), r && this.o.set(r);
+	}
+	e(e) {
+		if (this.ondata || D(5), this.d && D(4), !this.p.length) this.p = e;
+		else if (e.length) {
+			let n = new t(this.p.length + e.length);
+			n.set(this.p), n.set(e, this.p.length), this.p = n;
+		}
+	}
+	c(e) {
+		this.s.i = +(this.d = e || !1);
+		let t = this.s.b, n = O(this.p, this.s, this.o);
+		this.ondata(w(n, t, this.s.b), this.d), this.o = w(n, this.s.b - 32768), this.s.b = this.o.length, this.p = w(this.p, this.s.p / 8 | 0), this.s.p &= 7;
+	}
+	push(e, t) {
+		this.e(e), this.c(t);
+	}
+}, we = class {
+	constructor(e, t) {
+		G([V, () => [W, Z]], this, Y.call(this, e, t), (e) => {
+			onmessage = W(new Z(e.data));
+		}, 7, 0);
+	}
+};
+function Te(e, t, n) {
+	return n || (n = t, t = {}), typeof n != "function" && D(7), pe(e, t, [V], (e) => U(Ee(e.data[0], fe(e.data[1]))), 1, n);
+}
+function Ee(e, t) {
+	return O(e, { i: 2 }, t && t.out, t && t.dictionary);
+}
+var De = class {
+	constructor(e, t) {
+		this.c = L(), this.l = 0, this.v = 1, X.call(this, e, t);
+	}
+	push(e, t) {
+		this.c.p(e), this.l += e.length, X.prototype.push.call(this, e, t);
+	}
+	p(e, t) {
+		let n = z(e, this.o, this.v && ve(this.o), t && 8, this.s);
+		this.v &&= (he(n, this.o), 0), t && (J(n, n.length - 8, this.c.d()), J(n, n.length - 4, this.l)), this.ondata(n, t);
+	}
+	flush(e) {
+		X.prototype.flush.call(this, e);
+	}
+}, Oe = class {
+	constructor(e, t) {
+		G([
+			H,
+			ce,
+			() => [
+				W,
+				X,
+				De
+			]
+		], this, Y.call(this, e, t), (e) => {
+			onmessage = W(new De(e.data));
+		}, 8, 1);
+	}
+};
+function ke(e, t, n) {
+	return n || (n = t, t = {}), typeof n != "function" && D(7), pe(e, t, [
+		H,
+		ce,
+		() => [Ae]
+	], (e) => U(Ae(e.data[0], e.data[1])), 2, n);
+}
+function Ae(e, t) {
+	t ||= {};
+	let n = L(), r = e.length;
+	n.p(e);
+	let i = z(e, t, ve(t), 8), a = i.length;
+	return he(i, t), J(i, a - 8, n.d()), J(i, a - 4, r), i;
+}
+var je = class {
+	constructor(e, t) {
+		this.v = 1, this.r = 0, Z.call(this, e, t);
+	}
+	push(e, n) {
+		if (Z.prototype.e.call(this, e), this.r += e.length, this.v) {
+			let e = this.p.subarray(this.v - 1), t = e.length > 3 ? ge(e) : 4;
+			if (t > e.length) {
+				if (!n) return;
+			} else this.v > 1 && this.onmember && this.onmember(this.r - e.length);
+			this.p = e.subarray(t), this.v = 0;
+		}
+		Z.prototype.c.call(this, 0), this.s.f && !this.s.l ? (this.v = C(this.s.p) + 9, this.s = { i: 0 }, this.o = new t(0), this.push(new t(0), n)) : n && Z.prototype.c.call(this, n);
+	}
+}, Me = class {
+	constructor(e, t) {
+		G([
+			V,
+			le,
+			() => [
+				W,
+				Z,
+				je
+			]
+		], this, Y.call(this, e, t), (e) => {
+			let t = new je(e.data);
+			t.onmember = (e) => postMessage(e), onmessage = W(t);
+		}, 9, 0, (e) => this.onmember && this.onmember(e));
+	}
+};
+function Ne(e, t, n) {
+	return n || (n = t, t = {}), typeof n != "function" && D(7), pe(e, t, [
+		V,
+		le,
+		() => [Pe]
+	], (e) => U(Pe(e.data[0], e.data[1])), 3, n);
+}
+function Pe(e, n) {
+	let r = ge(e);
+	return r + 8 > e.length && D(6, "invalid gzip data"), O(e.subarray(r, -8), { i: 2 }, n && n.out || new t(_e(e)), n && n.dictionary);
+}
+var Fe = class {
+	constructor(e, t) {
+		this.c = R(), this.v = 1, X.call(this, e, t);
+	}
+	push(e, t) {
+		this.c.p(e), X.prototype.push.call(this, e, t);
+	}
+	p(e, t) {
+		let n = z(e, this.o, this.v && (this.o.dictionary ? 6 : 2), t && 4, this.s);
+		this.v &&= (ye(n, this.o), 0), t && J(n, n.length - 4, this.c.d()), this.ondata(n, t);
+	}
+	flush(e) {
+		X.prototype.flush.call(this, e);
+	}
+}, Ie = class {
+	constructor(e, t) {
+		G([
+			H,
+			ue,
+			() => [
+				W,
+				X,
+				Fe
+			]
+		], this, Y.call(this, e, t), (e) => {
+			onmessage = W(new Fe(e.data));
+		}, 10, 1);
+	}
+};
+function Le(e, t, n) {
+	return n || (n = t, t = {}), typeof n != "function" && D(7), pe(e, t, [
+		H,
+		ue,
+		() => [Re]
+	], (e) => U(Re(e.data[0], e.data[1])), 4, n);
+}
+function Re(e, t) {
+	t ||= {};
+	let n = R();
+	n.p(e);
+	let r = z(e, t, t.dictionary ? 6 : 2, 4);
+	return ye(r, t), J(r, r.length - 4, n.d()), r;
+}
+var ze = class {
+	constructor(e, t) {
+		Z.call(this, e, t), this.v = e && e.dictionary ? 2 : 1;
+	}
+	push(e, t) {
+		if (Z.prototype.e.call(this, e), this.v) {
+			if (this.p.length < 6 && !t) return;
+			this.p = this.p.subarray(be(this.p, this.v - 1)), this.v = 0;
+		}
+		t && (this.p.length < 4 && D(6, "invalid zlib data"), this.p = this.p.subarray(0, -4)), Z.prototype.c.call(this, t);
+	}
+}, Be = class {
+	constructor(e, t) {
+		G([
+			V,
+			de,
+			() => [
+				W,
+				Z,
+				ze
+			]
+		], this, Y.call(this, e, t), (e) => {
+			onmessage = W(new ze(e.data));
+		}, 11, 0);
+	}
+};
+function Ve(e, t, n) {
+	return n || (n = t, t = {}), typeof n != "function" && D(7), pe(e, t, [
+		V,
+		de,
+		() => [He]
+	], (e) => U(He(e.data[0], fe(e.data[1]))), 5, n);
+}
+function He(e, t) {
+	return O(e.subarray(be(e, t && t.dictionary), -4), { i: 2 }, t && t.out, t && t.dictionary);
+}
+var Ue = class {
+	constructor(e, t) {
+		this.o = Y.call(this, e, t) || {}, this.G = je, this.I = Z, this.Z = ze;
+	}
+	i() {
+		this.s.ondata = (e, t) => {
+			this.ondata(e, t);
+		};
+	}
+	push(e, n) {
+		if (this.ondata || D(5), this.s) this.s.push(e, n);
+		else {
+			if (this.p && this.p.length) {
+				let n = new t(this.p.length + e.length);
+				n.set(this.p), n.set(e, this.p.length);
+			} else this.p = e;
+			this.p.length > 2 && (this.s = this.p[0] == 31 && this.p[1] == 139 && this.p[2] == 8 ? new this.G(this.o) : (this.p[0] & 15) != 8 || this.p[0] >> 4 > 7 || (this.p[0] << 8 | this.p[1]) % 31 ? new this.I(this.o) : new this.Z(this.o), this.i(), this.s.push(this.p, n), this.p = null);
+		}
+	}
+}, We = class {
+	constructor(e, t) {
+		Ue.call(this, e, t), this.queuedSize = 0, this.G = Me, this.I = we, this.Z = Be;
+	}
+	i() {
+		this.s.ondata = (e, t, n) => {
+			this.ondata(e, t, n);
+		}, this.s.ondrain = (e) => {
+			this.queuedSize -= e, this.ondrain && this.ondrain(e);
+		};
+	}
+	push(e, t) {
+		this.queuedSize += e.length, Ue.prototype.push.call(this, e, t);
+	}
+};
+function Ge(e, t, n) {
+	return n || (n = t, t = {}), typeof n != "function" && D(7), e[0] == 31 && e[1] == 139 && e[2] == 8 ? Ne(e, t, n) : (e[0] & 15) != 8 || e[0] >> 4 > 7 || (e[0] << 8 | e[1]) % 31 ? Te(e, t, n) : Ve(e, t, n);
+}
+function Ke(e, t) {
+	return e[0] == 31 && e[1] == 139 && e[2] == 8 ? Pe(e, t) : (e[0] & 15) != 8 || e[0] >> 4 > 7 || (e[0] << 8 | e[1]) % 31 ? Ee(e, t) : He(e, t);
+}
+var qe = (e, n, r, i) => {
+	for (let a in e) {
+		let o = e[a], s = n + a, c = i;
+		Array.isArray(o) && (c = B(i, o[1]), o = o[0]), ArrayBuffer.isView(o) ? r[s] = [o, c] : (r[s += "/"] = [new t(0), c], qe(o, s, r, i));
+	}
+}, Je = typeof TextEncoder < "u" && /* @__PURE__ */ new TextEncoder(), Ye = typeof TextDecoder < "u" && /* @__PURE__ */ new TextDecoder(), Xe = 0;
+try {
+	Ye.decode(I, { stream: !0 }), Xe = 1;
+} catch {}
+var Ze = (e) => {
+	for (let t = "", n = 0;;) {
+		let r = e[n++], i = (r > 127) + (r > 223) + (r > 239);
+		if (n + i > e.length) return {
+			s: t,
+			r: w(e, n - 1)
+		};
+		i ? i == 3 ? (r = ((r & 15) << 18 | (e[n++] & 63) << 12 | (e[n++] & 63) << 6 | e[n++] & 63) - 65536, t += String.fromCharCode(55296 | r >> 10, 56320 | r & 1023)) : i & 1 ? t += String.fromCharCode((r & 31) << 6 | e[n++] & 63) : t += String.fromCharCode((r & 15) << 12 | (e[n++] & 63) << 6 | e[n++] & 63) : t += String.fromCharCode(r);
+	}
+}, Qe = class {
+	constructor(e) {
+		this.ondata = e, Xe ? this.t = new TextDecoder() : this.p = I;
+	}
+	push(e, n) {
+		if (this.ondata || D(5), n = !!n, this.t) {
+			this.ondata(this.t.decode(e, { stream: !0 }), n), n && (this.t.decode().length && D(8), this.t = null);
+			return;
+		}
+		this.p || D(4);
+		let r = new t(this.p.length + e.length);
+		r.set(this.p), r.set(e, this.p.length);
+		let { s: i, r: a } = Ze(r);
+		n ? (a.length && D(8), this.p = null) : this.p = a, this.ondata(i, n);
+	}
+}, $e = class {
+	constructor(e) {
+		this.ondata = e;
+	}
+	push(e, t) {
+		this.ondata || D(5), this.d && D(4), this.ondata(Q(e), this.d = t || !1);
+	}
+};
+function Q(e, n) {
+	if (n) {
+		let n = new t(e.length);
+		for (let t = 0; t < e.length; ++t) n[t] = e.charCodeAt(t);
+		return n;
+	}
+	if (Je) return Je.encode(e);
+	let r = e.length, i = new t(e.length + (e.length >> 1)), a = 0, o = (e) => {
+		i[a++] = e;
+	};
+	for (let s = 0; s < r; ++s) {
+		if (a + 5 > i.length) {
+			let e = new t(a + 8 + (r - s << 1));
+			e.set(i), i = e;
+		}
+		let c = e.charCodeAt(s);
+		c < 128 || n ? o(c) : c < 2048 ? (o(192 | c >> 6), o(128 | c & 63)) : c > 55295 && c < 57344 ? (c = 65536 + (c & 1047552) | e.charCodeAt(++s) & 1023, o(240 | c >> 18), o(128 | c >> 12 & 63), o(128 | c >> 6 & 63), o(128 | c & 63)) : (o(224 | c >> 12), o(128 | c >> 6 & 63), o(128 | c & 63));
+	}
+	return w(i, 0, a);
+}
+function et(e, t) {
+	if (t) {
+		let t = "";
+		for (let n = 0; n < e.length; n += 16384) t += String.fromCharCode.apply(null, e.subarray(n, n + 16384));
+		return t;
+	} else if (Ye) return Ye.decode(e);
+	else {
+		let { s: t, r: n } = Ze(e);
+		return n.length && D(8), t;
+	}
+}
+var tt = (e) => e == 1 ? 3 : e < 6 ? 2 : +(e == 9), nt = (e, t) => t + 30 + K(e, t + 26) + K(e, t + 28), rt = (e, t, n) => {
+	let r = K(e, t + 28), i = K(e, t + 30), a = et(e.subarray(t + 46, t + 46 + r), !(K(e, t + 8) & 2048)), o = t + 46 + r, [s, c, l] = it(e, o, i, n, q(e, t + 20), q(e, t + 24), q(e, t + 42));
+	return [
+		K(e, t + 10),
+		s,
+		c,
+		a,
+		o + i + K(e, t + 32),
+		l
+	];
+}, it = (e, t, n, r, i, a, o) => {
+	let s = i == 4294967295, c = a == 4294967295, l = o == 4294967295, u = t + n, d = s + c + l;
+	if (r && d) {
+		for (; t + 4 < u; t += 4 + K(e, t + 2)) if (K(e, t) == 1) return [
+			s ? me(e, t + 4 + 8 * c) : i,
+			c ? me(e, t + 4) : a,
+			l ? me(e, t + 4 + 8 * (c + s)) : o,
+			1
+		];
+		r < 2 && D(13);
+	}
+	return [
+		i,
+		a,
+		o,
+		0
+	];
+}, $ = (e) => {
+	let t = 0;
+	if (e) for (let n in e) {
+		let r = e[n].length;
+		r > 65535 && D(9), t += r + 4;
+	}
+	return t;
+}, at = (e, t, n, r, i, a, o, s) => {
+	let c = r.length, l = n.extra, u = s && s.length, d = $(l);
+	J(e, t, o == null ? 67324752 : 33639248), t += 4, o != null && (e[t++] = 20, e[t++] = n.os), e[t] = 20, t += 2, e[t++] = n.flag << 1 | (a < 0 && 8), e[t++] = i && 8, e[t++] = n.compression & 255, e[t++] = n.compression >> 8;
+	let f = new Date(n.mtime == null ? Date.now() : n.mtime), p = f.getFullYear() - 1980;
+	if ((p < 0 || p > 119) && D(10), J(e, t, p << 25 | f.getMonth() + 1 << 21 | f.getDate() << 16 | f.getHours() << 11 | f.getMinutes() << 5 | f.getSeconds() >> 1), t += 4, a != -1 && (J(e, t, n.crc), J(e, t + 4, a < 0 ? -a - 2 : a), J(e, t + 8, n.size)), J(e, t + 12, c), J(e, t + 14, d), t += 16, o != null && (J(e, t, u), J(e, t + 6, n.attrs), J(e, t + 10, o), t += 14), e.set(r, t), t += c, d) for (let n in l) {
+		let r = l[n], i = r.length;
+		J(e, t, +n), J(e, t + 2, i), e.set(r, t + 4), t += 4 + i;
+	}
+	return u && (e.set(s, t), t += u), t;
+}, ot = (e, t, n, r, i) => {
+	J(e, t, 101010256), J(e, t + 8, n), J(e, t + 10, n), J(e, t + 12, r), J(e, t + 16, i);
+}, st = class {
+	constructor(e) {
+		this.filename = e, this.c = L(), this.size = 0, this.compression = 0;
+	}
+	process(e, t) {
+		this.ondata(null, e, t);
+	}
+	push(e, t) {
+		this.ondata || D(5), this.c.p(e), this.size += e.length, t && (this.crc = this.c.d()), this.process(e, t || !1);
+	}
+}, ct = class {
+	constructor(e, t) {
+		t ||= {}, st.call(this, e), this.d = new X(t, (e, t) => {
+			this.ondata(null, e, t);
+		}), this.compression = 8, this.flag = tt(t.level);
+	}
+	process(e, t) {
+		try {
+			this.d.push(e, t);
+		} catch (e) {
+			this.ondata(e, null, t);
+		}
+	}
+	push(e, t) {
+		st.prototype.push.call(this, e, t);
+	}
+}, lt = class {
+	constructor(e, t) {
+		t ||= {}, st.call(this, e), this.d = new xe(t, (e, t, n) => {
+			this.ondata(e, t, n);
+		}), this.compression = 8, this.flag = tt(t.level), this.terminate = this.d.terminate;
+	}
+	process(e, t) {
+		this.d.push(e, t);
+	}
+	push(e, t) {
+		st.prototype.push.call(this, e, t);
+	}
+}, ut = class {
+	constructor(e) {
+		this.ondata = e, this.u = [], this.d = 1;
+	}
+	add(e) {
+		if (this.ondata || D(5), this.d & 2) this.ondata(D(4 + (this.d & 1) * 8, 0, 1), null, !1);
+		else {
+			let n = Q(e.filename), r = n.length, i = e.comment, a = i && Q(i), o = r != e.filename.length || a && i.length != a.length, s = r + $(e.extra) + 30;
+			r > 65535 && this.ondata(D(11, 0, 1), null, !1);
+			let c = new t(s);
+			at(c, 0, e, n, o, -1);
+			let l = [c], u = () => {
+				for (let e of l) this.ondata(null, e, !1);
+				l = [];
+			}, d = this.d;
+			this.d = 0;
+			let f = this.u.length, p = B(e, {
+				f: n,
+				u: o,
+				o: a,
+				t: () => {
+					e.terminate && e.terminate();
+				},
+				r: () => {
+					if (u(), d) {
+						let e = this.u[f + 1];
+						e ? e.r() : this.d = 1;
+					}
+					d = 1;
+				}
+			}), m = 0;
+			e.ondata = (n, r, i) => {
+				if (n) this.ondata(n, r, i), this.terminate();
+				else if (m += r.length, l.push(r), i) {
+					let n = new t(16);
+					J(n, 0, 134695760), J(n, 4, e.crc), J(n, 8, m), J(n, 12, e.size), l.push(n), p.c = m, p.b = s + m + 16, p.crc = e.crc, p.size = e.size, d && p.r(), d = 1;
+				} else d && u();
+			}, this.u.push(p);
+		}
+	}
+	end() {
+		if (this.d & 2) {
+			this.ondata(D(4 + (this.d & 1) * 8, 0, 1), null, !0);
+			return;
+		}
+		this.d ? this.e() : this.u.push({
+			r: () => {
+				this.d & 1 && (this.u.splice(-1, 1), this.e());
+			},
+			t: () => {}
+		}), this.d = 3;
+	}
+	e() {
+		let e = 0, n = 0, r = 0;
+		for (let e of this.u) r += 46 + e.f.length + $(e.extra) + (e.o ? e.o.length : 0);
+		let i = new t(r + 22);
+		for (let t of this.u) at(i, e, t, t.f, t.u, -t.c - 2, n, t.o), e += 46 + t.f.length + $(t.extra) + (t.o ? t.o.length : 0), n += t.b;
+		ot(i, e, this.u.length, r, n), this.ondata(null, i, !0), this.d = 2;
+	}
+	terminate() {
+		for (let e of this.u) e.t();
+		this.d = 2;
+	}
+};
+function dt(e, n, r) {
+	r || (r = n, n = {}), typeof r != "function" && D(7);
+	let i = {};
+	qe(e, "", i, n);
+	let a = Object.keys(i), o = a.length, s = 0, c = 0, l = o, u = Array(o), d = [], f = () => {
+		for (let e = 0; e < d.length; ++e) d[e]();
+	}, p = (e, t) => {
+		_t(() => {
+			r(e, t);
+		});
+	};
+	_t(() => {
+		p = r;
+	});
+	let m = () => {
+		let e = new t(c + 22), n = s, r = c - s;
+		c = 0;
+		for (let t = 0; t < l; ++t) {
+			let n = u[t];
+			try {
+				let t = n.c.length;
+				at(e, c, n, n.f, n.u, t);
+				let r = 30 + n.f.length + $(n.extra), i = c + r;
+				e.set(n.c, i), at(e, s, n, n.f, n.u, t, c, n.m), s += 16 + r + (n.m ? n.m.length : 0), c = i + t;
+			} catch (e) {
+				return p(e, null);
+			}
+		}
+		ot(e, s, u.length, r, n), p(null, e);
+	};
+	o || m();
+	for (let e = 0; e < l; ++e) {
+		let t = a[e], [n, r] = i[t], l = L(), h = n.length;
+		l.p(n);
+		let g = Q(t), _ = g.length, v = r.comment, y = v && Q(v), b = y && y.length, x = $(r.extra), S = r.level == 0 ? 0 : 8, C = (n, i) => {
+			if (n) f(), p(n, null);
+			else {
+				let n = i.length;
+				u[e] = B(r, {
+					size: h,
+					crc: l.d(),
+					c: i,
+					f: g,
+					m: y,
+					u: _ != t.length || y && v.length != b,
+					compression: S
+				}), s += 30 + _ + x + n, c += 76 + 2 * (_ + x) + (b || 0) + n, --o || m();
+			}
+		};
+		if (_ > 65535 && C(D(11, 0, 1), null), !S) C(null, n);
+		else if (h < 16e4) try {
+			C(null, Ce(n, r));
+		} catch (e) {
+			C(e, null);
+		}
+		else d.push(Se(n, r, C));
+	}
+	return f;
+}
+function ft(e, n) {
+	n ||= {};
+	let r = {}, i = [];
+	qe(e, "", r, n);
+	let a = 0, o = 0;
+	for (let e in r) {
+		let [t, n] = r[e], s = n.level == 0 ? 0 : 8, c = Q(e), l = c.length, u = n.comment, d = u && Q(u), f = d && d.length, p = $(n.extra);
+		l > 65535 && D(11);
+		let m = s ? Ce(t, n) : t, h = m.length, g = L();
+		g.p(t), i.push(B(n, {
+			size: t.length,
+			crc: g.d(),
+			c: m,
+			f: c,
+			m: d,
+			u: l != e.length || d && u.length != f,
+			o: a,
+			compression: s
+		})), a += 30 + l + p + h, o += 76 + 2 * (l + p) + (f || 0) + h;
+	}
+	let s = new t(o + 22), c = a, l = o - a;
+	for (let e = 0; e < i.length; ++e) {
+		let t = i[e];
+		at(s, t.o, t, t.f, t.u, t.c.length);
+		let n = 30 + t.f.length + $(t.extra);
+		s.set(t.c, t.o + n), at(s, a, t, t.f, t.u, t.c.length, t.o, t.m), a += 16 + n + (t.m ? t.m.length : 0);
+	}
+	return ot(s, a, i.length, l, c), s;
+}
+var pt = class {
+	static {
+		this.compression = 0;
+	}
+	push(e, t) {
+		this.ondata(null, e, t);
+	}
+}, mt = class {
+	static {
+		this.compression = 8;
+	}
+	constructor() {
+		this.i = new Z((e, t) => {
+			this.ondata(null, e, t);
+		});
+	}
+	push(e, t) {
+		try {
+			this.i.push(e, t);
+		} catch (e) {
+			this.ondata(e, null, t);
+		}
+	}
+}, ht = class {
+	static {
+		this.compression = 8;
+	}
+	constructor(e, t) {
+		t < 32e4 ? this.i = new Z((e, t) => {
+			this.ondata(null, e, t);
+		}) : (this.i = new we((e, t, n) => {
+			this.ondata(e, t, n);
+		}), this.terminate = this.i.terminate);
+	}
+	push(e, t) {
+		this.i.terminate && (e = w(e, 0)), this.i.push(e, t);
+	}
+}, gt = class {
+	constructor(e) {
+		this.onfile = e, this.k = [], this.o = { 0: pt }, this.p = I;
+	}
+	push(e, n) {
+		if (this.onfile || D(5), this.p || D(4), this.c > 0) {
+			let t = Math.min(this.c, e.length), r = e.subarray(0, t);
+			if (this.c -= t, this.d ? this.d.push(r, !this.c) : this.k[0].push(r), e = e.subarray(t), e.length) return this.push(e, n);
+		} else {
+			let r = 0, i = 0, a, o;
+			this.p.length ? e.length ? (o = new t(this.p.length + e.length), o.set(this.p), o.set(e, this.p.length)) : o = this.p : o = e;
+			let s = o.length, c = this.c, l = c && this.d;
+			for (; i < s - 4; ++i) {
+				let e = q(o, i);
+				if (e == 67324752) {
+					r = 1, a = i, this.d = null, this.c = 0;
+					let e = K(o, i + 6), t = K(o, i + 8), n = e & 2048, c = e & 8, l = K(o, i + 26), u = K(o, i + 28);
+					if (s > i + 30 + l + u) {
+						let e = [];
+						this.k.unshift(e), r = 2;
+						let a = q(o, i + 18), s = q(o, i + 22), d = et(o.subarray(i + 30, i += 30 + l), !n), [f, p, , m] = it(o, i, u, 2, a, s, 0);
+						c && (f = -1 - m), i += u, this.c = f;
+						let h, g = {
+							name: d,
+							compression: t,
+							start: () => {
+								if (g.ondata || D(5), !f) g.ondata(null, I, !0);
+								else {
+									let n = this.o[t];
+									n || g.ondata(D(14, "unknown compression type " + t, 1), null, !1), h = f < 0 ? new n(d) : new n(d, f, p), h.ondata = (e, t, n) => {
+										g.ondata(e, t, n);
+									};
+									for (let t of e) h.push(t, !1);
+									this.k[0] == e && this.c ? this.d = h : h.push(I, !0);
+								}
+							},
+							terminate: () => {
+								h && h.terminate && h.terminate();
+							}
+						};
+						f >= 0 && (g.size = f, g.originalSize = p), this.onfile(g);
+					}
+					break;
+				} else if (c) {
+					if (e == 134695760) {
+						a = i += 12 + (c == -2 && 8), r = 3, this.c = 0;
+						break;
+					} else if (e == 33639248) {
+						a = i -= 4, r = 3, this.c = 0;
+						break;
+					}
+				}
+			}
+			if (this.p = I, c < 0) {
+				let e = r ? o.subarray(0, a - 12 - (c == -2 && 8) - (q(o, a - 16) == 134695760 && 4)) : o.subarray(0, i);
+				l ? l.push(e, !!r) : this.k[+(r == 2)].push(e);
+			}
+			if (r & 2) return this.push(o.subarray(i), n);
+			this.p = o.subarray(i);
+		}
+		n && (this.c && D(13), this.p = null);
+	}
+	register(e) {
+		this.o[e.compression] = e;
+	}
+}, _t = typeof queueMicrotask == "function" ? queueMicrotask : typeof setTimeout == "function" ? setTimeout : (e) => {
+	e();
+};
+function vt(e, n, r) {
+	r || (r = n, n = {}), typeof r != "function" && D(7);
+	let i = [], a = () => {
+		for (let e = 0; e < i.length; ++e) i[e]();
+	}, o = {}, s = (e, t) => {
+		_t(() => {
+			r(e, t);
+		});
+	};
+	_t(() => {
+		s = r;
+	});
+	let c = e.length - 22;
+	for (; q(e, c) != 101010256; --c) if (!c || e.length - c > 65558) return s(D(13, 0, 1), null), a;
+	let l = K(e, c + 8);
+	if (l) {
+		let r = l, u = q(e, c + 16), d = q(e, c - 20) == 117853008;
+		if (d) {
+			let t = q(e, c - 12);
+			d = q(e, t) == 101075792, d && (r = l = q(e, t + 32), u = q(e, t + 48));
+		}
+		let f = n && n.filter;
+		for (let n = 0; n < r; ++n) {
+			let [n, r, c, p, m, h] = rt(e, u, d), g = nt(e, h);
+			u = m;
+			let _ = (e, t) => {
+				e ? (a(), s(e, null)) : (t && (o[p] = t), --l || s(null, o));
+			};
+			if (!f || f({
+				name: p,
+				size: r,
+				originalSize: c,
+				compression: n
+			})) if (!n) _(null, w(e, g, g + r));
+			else if (n == 8) {
+				let n = e.subarray(g, g + r);
+				if (c < 524288 || r > .8 * c) try {
+					_(null, Ee(n, { out: new t(c) }));
+				} catch (e) {
+					_(e, null);
+				}
+				else i.push(Te(n, { size: c }, _));
+			} else _(D(14, "unknown compression type " + n, 1), null);
+			else _(null, null);
+		}
+	} else s(null, {});
+	return a;
+}
+function yt(e, n) {
+	let r = {}, i = e.length - 22;
+	for (; q(e, i) != 101010256; --i) (!i || e.length - i > 65558) && D(13);
+	let a = K(e, i + 8);
+	if (!a) return {};
+	let o = q(e, i + 16), s = q(e, i - 20) == 117853008;
+	if (s) {
+		let t = q(e, i - 12);
+		s = q(e, t) == 101075792, s && (a = q(e, t + 32), o = q(e, t + 48));
+	}
+	let c = n && n.filter;
+	for (let n = 0; n < a; ++n) {
+		let [n, i, a, l, u, d] = rt(e, o, s), f = nt(e, d);
+		o = u, (!c || c({
+			name: l,
+			size: i,
+			originalSize: a,
+			compression: n
+		})) && (n ? n == 8 ? r[l] = Ee(e.subarray(f, f + i), { out: new t(a) }) : D(14, "unknown compression type " + n) : r[l] = w(e, f, f + i));
+	}
+	return r;
+}
+//#endregion
+export { We as AsyncDecompress, xe as AsyncDeflate, Me as AsyncGunzip, Oe as AsyncGzip, we as AsyncInflate, ht as AsyncUnzipInflate, Be as AsyncUnzlib, lt as AsyncZipDeflate, Ie as AsyncZlib, Qe as DecodeUTF8, Ue as Decompress, X as Deflate, $e as EncodeUTF8, T as FlateErrorCode, je as Gunzip, De as Gzip, Z as Inflate, gt as Unzip, mt as UnzipInflate, pt as UnzipPassThrough, ze as Unzlib, ut as Zip, ct as ZipDeflate, st as ZipPassThrough, Fe as Zlib, Ge as decompress, Ke as decompressSync, Se as deflate, Ce as deflateSync, Ne as gunzip, Pe as gunzipSync, ke as gzip, Ae as gzipSync, Te as inflate, Ee as inflateSync, et as strFromU8, Q as strToU8, vt as unzip, yt as unzipSync, Ve as unzlib, He as unzlibSync, dt as zip, ft as zipSync, Le as zlib, Re as zlibSync };
+/* 独立思考，明辨是非 */