@unicom-cloud/ui 0.8.168 → 0.8.169

package/draw/libs/pako/index.js

@@ -0,0 +1,1445 @@
+/* 潘启宝 2026-06-25 08:58:50 星期四 山东省济南市 */
+import { __exportAll as e } from "../../../.virtual/_rolldown/runtime.js";
+//#region components/pc/draw/libs/pako/index.ts
+var t = /* @__PURE__ */ e({
+	Deflate: () => Gr,
+	Inflate: () => Yr,
+	constants: () => $r,
+	default: () => ei,
+	deflate: () => Kr,
+	deflateRaw: () => qr,
+	gzip: () => Jr,
+	inflate: () => Xr,
+	inflateRaw: () => Zr,
+	pako: () => ei,
+	ungzip: () => Qr
+}), n = 4, r = 0, i = 1, a = 2;
+function o(e) {
+	let t = e.length;
+	for (; --t >= 0;) e[t] = 0;
+}
+var s = 0, c = 1, l = 2, u = 29, d = 256, f = 286, p = 30, m = 19, h = 573, g = 15, _ = 16, v = 7, y = 256, b = 16, x = 17, S = 18, C = new Uint8Array([
+	0,
+	0,
+	0,
+	0,
+	0,
+	0,
+	0,
+	0,
+	1,
+	1,
+	1,
+	1,
+	2,
+	2,
+	2,
+	2,
+	3,
+	3,
+	3,
+	3,
+	4,
+	4,
+	4,
+	4,
+	5,
+	5,
+	5,
+	5,
+	0
+]), w = new Uint8Array([
+	0,
+	0,
+	0,
+	0,
+	1,
+	1,
+	2,
+	2,
+	3,
+	3,
+	4,
+	4,
+	5,
+	5,
+	6,
+	6,
+	7,
+	7,
+	8,
+	8,
+	9,
+	9,
+	10,
+	10,
+	11,
+	11,
+	12,
+	12,
+	13,
+	13
+]), T = new Uint8Array([
+	0,
+	0,
+	0,
+	0,
+	0,
+	0,
+	0,
+	0,
+	0,
+	0,
+	0,
+	0,
+	0,
+	0,
+	0,
+	0,
+	2,
+	3,
+	7
+]), E = new Uint8Array([
+	16,
+	17,
+	18,
+	0,
+	8,
+	7,
+	9,
+	6,
+	10,
+	5,
+	11,
+	4,
+	12,
+	3,
+	13,
+	2,
+	14,
+	1,
+	15
+]), D = 512, O = Array(288 * 2);
+o(O);
+var k = Array(p * 2);
+o(k);
+var A = Array(D);
+o(A);
+var ee = Array(256);
+o(ee);
+var te = Array(u);
+o(te);
+var j = Array(p);
+o(j);
+function ne(e, t, n, r, i) {
+	this.static_tree = e, this.extra_bits = t, this.extra_base = n, this.elems = r, this.max_length = i, this.has_stree = e && e.length;
+}
+var re, ie, ae;
+function oe(e, t) {
+	this.dyn_tree = e, this.max_code = 0, this.stat_desc = t;
+}
+var se = (e) => e < 256 ? A[e] : A[256 + (e >>> 7)], ce = (e, t) => {
+	e.pending_buf[e.pending++] = t & 255, e.pending_buf[e.pending++] = t >>> 8 & 255;
+}, M = (e, t, n) => {
+	e.bi_valid > _ - n ? (e.bi_buf |= t << e.bi_valid & 65535, ce(e, e.bi_buf), e.bi_buf = t >> _ - e.bi_valid, e.bi_valid += n - _) : (e.bi_buf |= t << e.bi_valid & 65535, e.bi_valid += n);
+}, N = (e, t, n) => {
+	M(e, n[t * 2], n[t * 2 + 1]);
+}, le = (e, t) => {
+	let n = 0;
+	do
+		n |= e & 1, e >>>= 1, n <<= 1;
+	while (--t > 0);
+	return n >>> 1;
+}, ue = (e) => {
+	e.bi_valid === 16 ? (ce(e, e.bi_buf), e.bi_buf = 0, e.bi_valid = 0) : e.bi_valid >= 8 && (e.pending_buf[e.pending++] = e.bi_buf & 255, e.bi_buf >>= 8, e.bi_valid -= 8);
+}, de = (e, t) => {
+	let n = t.dyn_tree, r = t.max_code, i = t.stat_desc.static_tree, a = t.stat_desc.has_stree, o = t.stat_desc.extra_bits, s = t.stat_desc.extra_base, c = t.stat_desc.max_length, l, u, d, f, p, m, _ = 0;
+	for (f = 0; f <= g; f++) e.bl_count[f] = 0;
+	for (n[e.heap[e.heap_max] * 2 + 1] = 0, l = e.heap_max + 1; l < h; l++) u = e.heap[l], f = n[n[u * 2 + 1] * 2 + 1] + 1, f > c && (f = c, _++), n[u * 2 + 1] = f, !(u > r) && (e.bl_count[f]++, p = 0, u >= s && (p = o[u - s]), m = n[u * 2], e.opt_len += m * (f + p), a && (e.static_len += m * (i[u * 2 + 1] + p)));
+	if (_ !== 0) {
+		do {
+			for (f = c - 1; e.bl_count[f] === 0;) f--;
+			e.bl_count[f]--, e.bl_count[f + 1] += 2, e.bl_count[c]--, _ -= 2;
+		} while (_ > 0);
+		for (f = c; f !== 0; f--) for (u = e.bl_count[f]; u !== 0;) d = e.heap[--l], !(d > r) && (n[d * 2 + 1] !== f && (e.opt_len += (f - n[d * 2 + 1]) * n[d * 2], n[d * 2 + 1] = f), u--);
+	}
+}, fe = (e, t, n) => {
+	let r = Array(16), i = 0, a, o;
+	for (a = 1; a <= g; a++) r[a] = i = i + n[a - 1] << 1;
+	for (o = 0; o <= t; o++) {
+		let t = e[o * 2 + 1];
+		t !== 0 && (e[o * 2] = le(r[t]++, t));
+	}
+}, pe = () => {
+	let e, t, n, r, i, a = Array(16);
+	for (n = 0, r = 0; r < u - 1; r++) for (te[r] = n, e = 0; e < 1 << C[r]; e++) ee[n++] = r;
+	for (ee[n - 1] = r, i = 0, r = 0; r < 16; r++) for (j[r] = i, e = 0; e < 1 << w[r]; e++) A[i++] = r;
+	for (i >>= 7; r < p; r++) for (j[r] = i << 7, e = 0; e < 1 << w[r] - 7; e++) A[256 + i++] = r;
+	for (t = 0; t <= g; t++) a[t] = 0;
+	for (e = 0; e <= 143;) O[e * 2 + 1] = 8, e++, a[8]++;
+	for (; e <= 255;) O[e * 2 + 1] = 9, e++, a[9]++;
+	for (; e <= 279;) O[e * 2 + 1] = 7, e++, a[7]++;
+	for (; e <= 287;) O[e * 2 + 1] = 8, e++, a[8]++;
+	for (fe(O, 287, a), e = 0; e < p; e++) k[e * 2 + 1] = 5, k[e * 2] = le(e, 5);
+	re = new ne(O, C, 257, f, g), ie = new ne(k, w, 0, p, g), ae = new ne([], T, 0, m, v);
+}, me = (e) => {
+	let t;
+	for (t = 0; t < f; t++) e.dyn_ltree[t * 2] = 0;
+	for (t = 0; t < p; t++) e.dyn_dtree[t * 2] = 0;
+	for (t = 0; t < m; t++) e.bl_tree[t * 2] = 0;
+	e.dyn_ltree[y * 2] = 1, e.opt_len = e.static_len = 0, e.last_lit = e.matches = 0;
+}, he = (e) => {
+	e.bi_valid > 8 ? ce(e, e.bi_buf) : e.bi_valid > 0 && (e.pending_buf[e.pending++] = e.bi_buf), e.bi_buf = 0, e.bi_valid = 0;
+}, ge = (e, t, n, r) => {
+	he(e), r && (ce(e, n), ce(e, ~n)), e.pending_buf.set(e.window.subarray(t, t + n), e.pending), e.pending += n;
+}, _e = (e, t, n, r) => {
+	let i = t * 2, a = n * 2;
+	return e[i] < e[a] || e[i] === e[a] && r[t] <= r[n];
+}, ve = (e, t, n) => {
+	let r = e.heap[n], i = n << 1;
+	for (; i <= e.heap_len && (i < e.heap_len && _e(t, e.heap[i + 1], e.heap[i], e.depth) && i++, !_e(t, r, e.heap[i], e.depth));) e.heap[n] = e.heap[i], n = i, i <<= 1;
+	e.heap[n] = r;
+}, ye = (e, t, n) => {
+	let r, i, a = 0, o, s;
+	if (e.last_lit !== 0) do
+		r = e.pending_buf[e.d_buf + a * 2] << 8 | e.pending_buf[e.d_buf + a * 2 + 1], i = e.pending_buf[e.l_buf + a], a++, r === 0 ? N(e, i, t) : (o = ee[i], N(e, o + d + 1, t), s = C[o], s !== 0 && (i -= te[o], M(e, i, s)), r--, o = se(r), N(e, o, n), s = w[o], s !== 0 && (r -= j[o], M(e, r, s)));
+	while (a < e.last_lit);
+	N(e, y, t);
+}, be = (e, t) => {
+	let n = t.dyn_tree, r = t.stat_desc.static_tree, i = t.stat_desc.has_stree, a = t.stat_desc.elems, o, s, c = -1, l;
+	for (e.heap_len = 0, e.heap_max = h, o = 0; o < a; o++) n[o * 2] === 0 ? n[o * 2 + 1] = 0 : (e.heap[++e.heap_len] = c = o, e.depth[o] = 0);
+	for (; e.heap_len < 2;) l = e.heap[++e.heap_len] = c < 2 ? ++c : 0, n[l * 2] = 1, e.depth[l] = 0, e.opt_len--, i && (e.static_len -= r[l * 2 + 1]);
+	for (t.max_code = c, o = e.heap_len >> 1; o >= 1; o--) ve(e, n, o);
+	l = a;
+	do
+		o = e.heap[1], e.heap[1] = e.heap[e.heap_len--], ve(e, n, 1), s = e.heap[1], e.heap[--e.heap_max] = o, e.heap[--e.heap_max] = s, n[l * 2] = n[o * 2] + n[s * 2], e.depth[l] = (e.depth[o] >= e.depth[s] ? e.depth[o] : e.depth[s]) + 1, n[o * 2 + 1] = n[s * 2 + 1] = l, e.heap[1] = l++, ve(e, n, 1);
+	while (e.heap_len >= 2);
+	e.heap[--e.heap_max] = e.heap[1], de(e, t), fe(n, c, e.bl_count);
+}, xe = (e, t, n) => {
+	let r, i = -1, a, o = t[1], s = 0, c = 7, l = 4;
+	for (o === 0 && (c = 138, l = 3), t[(n + 1) * 2 + 1] = 65535, r = 0; r <= n; r++) a = o, o = t[(r + 1) * 2 + 1], !(++s < c && a === o) && (s < l ? e.bl_tree[a * 2] += s : a === 0 ? s <= 10 ? e.bl_tree[x * 2]++ : e.bl_tree[S * 2]++ : (a !== i && e.bl_tree[a * 2]++, e.bl_tree[b * 2]++), s = 0, i = a, o === 0 ? (c = 138, l = 3) : a === o ? (c = 6, l = 3) : (c = 7, l = 4));
+}, Se = (e, t, n) => {
+	let r, i = -1, a, o = t[1], s = 0, c = 7, l = 4;
+	for (o === 0 && (c = 138, l = 3), r = 0; r <= n; r++) if (a = o, o = t[(r + 1) * 2 + 1], !(++s < c && a === o)) {
+		if (s < l) do
+			N(e, a, e.bl_tree);
+		while (--s !== 0);
+		else a === 0 ? s <= 10 ? (N(e, x, e.bl_tree), M(e, s - 3, 3)) : (N(e, S, e.bl_tree), M(e, s - 11, 7)) : (a !== i && (N(e, a, e.bl_tree), s--), N(e, b, e.bl_tree), M(e, s - 3, 2));
+		s = 0, i = a, o === 0 ? (c = 138, l = 3) : a === o ? (c = 6, l = 3) : (c = 7, l = 4);
+	}
+}, Ce = (e) => {
+	let t;
+	for (xe(e, e.dyn_ltree, e.l_desc.max_code), xe(e, e.dyn_dtree, e.d_desc.max_code), be(e, e.bl_desc), t = m - 1; t >= 3 && e.bl_tree[E[t] * 2 + 1] === 0; t--);
+	return e.opt_len += 3 * (t + 1) + 5 + 5 + 4, t;
+}, we = (e, t, n, r) => {
+	let i;
+	for (M(e, t - 257, 5), M(e, n - 1, 5), M(e, r - 4, 4), i = 0; i < r; i++) M(e, e.bl_tree[E[i] * 2 + 1], 3);
+	Se(e, e.dyn_ltree, t - 1), Se(e, e.dyn_dtree, n - 1);
+}, Te = (e) => {
+	let t = 4093624447, n;
+	for (n = 0; n <= 31; n++, t >>>= 1) if (t & 1 && e.dyn_ltree[n * 2] !== 0) return r;
+	if (e.dyn_ltree[18] !== 0 || e.dyn_ltree[20] !== 0 || e.dyn_ltree[26] !== 0) return i;
+	for (n = 32; n < d; n++) if (e.dyn_ltree[n * 2] !== 0) return i;
+	return r;
+}, Ee = !1, De = (e) => {
+	Ee ||= (pe(), !0), e.l_desc = new oe(e.dyn_ltree, re), e.d_desc = new oe(e.dyn_dtree, ie), e.bl_desc = new oe(e.bl_tree, ae), e.bi_buf = 0, e.bi_valid = 0, me(e);
+}, Oe = (e, t, n, r) => {
+	M(e, (s << 1) + +!!r, 3), ge(e, t, n, !0);
+}, ke = {
+	_tr_init: De,
+	_tr_stored_block: Oe,
+	_tr_flush_block: (e, t, r, i) => {
+		let o, s, u = 0;
+		e.level > 0 ? (e.strm.data_type === a && (e.strm.data_type = Te(e)), be(e, e.l_desc), be(e, e.d_desc), u = Ce(e), o = e.opt_len + 3 + 7 >>> 3, s = e.static_len + 3 + 7 >>> 3, s <= o && (o = s)) : o = s = r + 5, r + 4 <= o && t !== -1 ? Oe(e, t, r, i) : e.strategy === n || s === o ? (M(e, (c << 1) + +!!i, 3), ye(e, O, k)) : (M(e, (l << 1) + +!!i, 3), we(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, u + 1), ye(e, e.dyn_ltree, e.dyn_dtree)), me(e), i && he(e);
+	},
+	_tr_tally: (e, t, n) => (e.pending_buf[e.d_buf + e.last_lit * 2] = t >>> 8 & 255, e.pending_buf[e.d_buf + e.last_lit * 2 + 1] = t & 255, e.pending_buf[e.l_buf + e.last_lit] = n & 255, e.last_lit++, t === 0 ? e.dyn_ltree[n * 2]++ : (e.matches++, t--, e.dyn_ltree[(ee[n] + d + 1) * 2]++, e.dyn_dtree[se(t) * 2]++), e.last_lit === e.lit_bufsize - 1),
+	_tr_align: (e) => {
+		M(e, c << 1, 3), N(e, y, O), ue(e);
+	}
+}, Ae = (e, t, n, r) => {
+	let i = e & 65535 | 0, a = e >>> 16 & 65535 | 0, o = 0;
+	for (; n !== 0;) {
+		o = n > 2e3 ? 2e3 : n, n -= o;
+		do
+			i = i + t[r++] | 0, a = a + i | 0;
+		while (--o);
+		i %= 65521, a %= 65521;
+	}
+	return i | a << 16 | 0;
+}, je = new Uint32Array((() => {
+	let e, t = [];
+	for (let n = 0; n < 256; n++) {
+		e = n;
+		for (let t = 0; t < 8; t++) e = e & 1 ? 3988292384 ^ e >>> 1 : e >>> 1;
+		t[n] = e;
+	}
+	return t;
+})()), P = (e, t, n, r) => {
+	let i = je, a = r + n;
+	e ^= -1;
+	for (let n = r; n < a; n++) e = e >>> 8 ^ i[(e ^ t[n]) & 255];
+	return e ^ -1;
+}, Me = {
+	2: "need dictionary",
+	1: "stream end",
+	0: "",
+	"-1": "file error",
+	"-2": "stream error",
+	"-3": "data error",
+	"-4": "insufficient memory",
+	"-5": "buffer error",
+	"-6": "incompatible version"
+}, Ne = {
+	Z_NO_FLUSH: 0,
+	Z_PARTIAL_FLUSH: 1,
+	Z_SYNC_FLUSH: 2,
+	Z_FULL_FLUSH: 3,
+	Z_FINISH: 4,
+	Z_BLOCK: 5,
+	Z_TREES: 6,
+	Z_OK: 0,
+	Z_STREAM_END: 1,
+	Z_NEED_DICT: 2,
+	Z_ERRNO: -1,
+	Z_STREAM_ERROR: -2,
+	Z_DATA_ERROR: -3,
+	Z_MEM_ERROR: -4,
+	Z_BUF_ERROR: -5,
+	Z_NO_COMPRESSION: 0,
+	Z_BEST_SPEED: 1,
+	Z_BEST_COMPRESSION: 9,
+	Z_DEFAULT_COMPRESSION: -1,
+	Z_FILTERED: 1,
+	Z_HUFFMAN_ONLY: 2,
+	Z_RLE: 3,
+	Z_FIXED: 4,
+	Z_DEFAULT_STRATEGY: 0,
+	Z_BINARY: 0,
+	Z_TEXT: 1,
+	Z_UNKNOWN: 2,
+	Z_DEFLATED: 8
+}, { _tr_init: Pe, _tr_stored_block: Fe, _tr_flush_block: Ie, _tr_tally: F, _tr_align: Le } = ke, { Z_NO_FLUSH: Re, Z_PARTIAL_FLUSH: ze, Z_FULL_FLUSH: Be, Z_FINISH: I, Z_BLOCK: Ve, Z_OK: L, Z_STREAM_END: He, Z_STREAM_ERROR: R, Z_DATA_ERROR: Ue, Z_BUF_ERROR: We, Z_DEFAULT_COMPRESSION: Ge, Z_FILTERED: Ke, Z_HUFFMAN_ONLY: qe, Z_RLE: Je, Z_FIXED: Ye, Z_DEFAULT_STRATEGY: Xe, Z_UNKNOWN: Ze, Z_DEFLATED: Qe } = Ne, $e = 9, et = 15, tt = 8, nt = 573, z = 3, B = 258, V = 262, rt = 32, it = 42, at = 69, ot = 73, st = 91, ct = 103, lt = 113, ut = 666, H = 1, dt = 2, ft = 3, pt = 4, mt = 3, U = (e, t) => (e.msg = Me[t], t), ht = (e) => (e << 1) - (e > 4 ? 9 : 0), W = (e) => {
+	let t = e.length;
+	for (; --t >= 0;) e[t] = 0;
+}, G = (e, t, n) => (t << e.hash_shift ^ n) & e.hash_mask, K = (e) => {
+	let t = e.state, n = t.pending;
+	n > e.avail_out && (n = e.avail_out), n !== 0 && (e.output.set(t.pending_buf.subarray(t.pending_out, t.pending_out + n), e.next_out), e.next_out += n, t.pending_out += n, e.total_out += n, e.avail_out -= n, t.pending -= n, t.pending === 0 && (t.pending_out = 0));
+}, q = (e, t) => {
+	Ie(e, e.block_start >= 0 ? e.block_start : -1, e.strstart - e.block_start, t), e.block_start = e.strstart, K(e.strm);
+}, J = (e, t) => {
+	e.pending_buf[e.pending++] = t;
+}, gt = (e, t) => {
+	e.pending_buf[e.pending++] = t >>> 8 & 255, e.pending_buf[e.pending++] = t & 255;
+}, _t = (e, t, n, r) => {
+	let i = e.avail_in;
+	return i > r && (i = r), i === 0 ? 0 : (e.avail_in -= i, t.set(e.input.subarray(e.next_in, e.next_in + i), n), e.state.wrap === 1 ? e.adler = Ae(e.adler, t, i, n) : e.state.wrap === 2 && (e.adler = P(e.adler, t, i, n)), e.next_in += i, e.total_in += i, i);
+}, vt = (e, t) => {
+	let n = e.max_chain_length, r = e.strstart, i, a, o = e.prev_length, s = e.nice_match, c = e.strstart > e.w_size - V ? e.strstart - (e.w_size - V) : 0, l = e.window, u = e.w_mask, d = e.prev, f = e.strstart + B, p = l[r + o - 1], m = l[r + o];
+	e.prev_length >= e.good_match && (n >>= 2), s > e.lookahead && (s = e.lookahead);
+	do {
+		if (i = t, l[i + o] !== m || l[i + o - 1] !== p || l[i] !== l[r] || l[++i] !== l[r + 1]) continue;
+		r += 2, i++;
+		do		;
+while (l[++r] === l[++i] && l[++r] === l[++i] && l[++r] === l[++i] && l[++r] === l[++i] && l[++r] === l[++i] && l[++r] === l[++i] && l[++r] === l[++i] && l[++r] === l[++i] && r < f);
+		if (a = B - (f - r), r = f - B, a > o) {
+			if (e.match_start = t, o = a, a >= s) break;
+			p = l[r + o - 1], m = l[r + o];
+		}
+	} while ((t = d[t & u]) > c && --n !== 0);
+	return o <= e.lookahead ? o : e.lookahead;
+}, yt = (e) => {
+	let t = e.w_size, n, r, i, a, o;
+	do {
+		if (a = e.window_size - e.lookahead - e.strstart, e.strstart >= t + (t - V)) {
+			e.window.set(e.window.subarray(t, t + t), 0), e.match_start -= t, e.strstart -= t, e.block_start -= t, r = e.hash_size, n = r;
+			do
+				i = e.head[--n], e.head[n] = i >= t ? i - t : 0;
+			while (--r);
+			r = t, n = r;
+			do
+				i = e.prev[--n], e.prev[n] = i >= t ? i - t : 0;
+			while (--r);
+			a += t;
+		}
+		if (e.strm.avail_in === 0) break;
+		if (r = _t(e.strm, e.window, e.strstart + e.lookahead, a), e.lookahead += r, e.lookahead + e.insert >= z) for (o = e.strstart - e.insert, e.ins_h = e.window[o], e.ins_h = G(e, e.ins_h, e.window[o + 1]); e.insert && (e.ins_h = G(e, e.ins_h, e.window[o + z - 1]), e.prev[o & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = o, o++, e.insert--, !(e.lookahead + e.insert < z)););
+	} while (e.lookahead < V && e.strm.avail_in !== 0);
+}, bt = (e, t) => {
+	let n = 65535;
+	for (n > e.pending_buf_size - 5 && (n = e.pending_buf_size - 5);;) {
+		if (e.lookahead <= 1) {
+			if (yt(e), e.lookahead === 0 && t === Re) return H;
+			if (e.lookahead === 0) break;
+		}
+		e.strstart += e.lookahead, e.lookahead = 0;
+		let r = e.block_start + n;
+		if ((e.strstart === 0 || e.strstart >= r) && (e.lookahead = e.strstart - r, e.strstart = r, q(e, !1), e.strm.avail_out === 0) || e.strstart - e.block_start >= e.w_size - V && (q(e, !1), e.strm.avail_out === 0)) return H;
+	}
+	return e.insert = 0, t === I ? (q(e, !0), e.strm.avail_out === 0 ? ft : pt) : (e.strstart > e.block_start && (q(e, !1), e.strm.avail_out), H);
+}, xt = (e, t) => {
+	let n, r;
+	for (;;) {
+		if (e.lookahead < V) {
+			if (yt(e), e.lookahead < V && t === Re) return H;
+			if (e.lookahead === 0) break;
+		}
+		if (n = 0, e.lookahead >= z && (e.ins_h = G(e, e.ins_h, e.window[e.strstart + z - 1]), n = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), n !== 0 && e.strstart - n <= e.w_size - V && (e.match_length = vt(e, n)), e.match_length >= z) if (r = F(e, e.strstart - e.match_start, e.match_length - z), e.lookahead -= e.match_length, e.match_length <= e.max_lazy_match && e.lookahead >= z) {
+			e.match_length--;
+			do
+				e.strstart++, e.ins_h = G(e, e.ins_h, e.window[e.strstart + z - 1]), n = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart;
+			while (--e.match_length !== 0);
+			e.strstart++;
+		} else e.strstart += e.match_length, e.match_length = 0, e.ins_h = e.window[e.strstart], e.ins_h = G(e, e.ins_h, e.window[e.strstart + 1]);
+		else r = F(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++;
+		if (r && (q(e, !1), e.strm.avail_out === 0)) return H;
+	}
+	return e.insert = e.strstart < z - 1 ? e.strstart : z - 1, t === I ? (q(e, !0), e.strm.avail_out === 0 ? ft : pt) : e.last_lit && (q(e, !1), e.strm.avail_out === 0) ? H : dt;
+}, St = (e, t) => {
+	let n, r, i;
+	for (;;) {
+		if (e.lookahead < V) {
+			if (yt(e), e.lookahead < V && t === Re) return H;
+			if (e.lookahead === 0) break;
+		}
+		if (n = 0, e.lookahead >= z && (e.ins_h = G(e, e.ins_h, e.window[e.strstart + z - 1]), n = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), e.prev_length = e.match_length, e.prev_match = e.match_start, e.match_length = z - 1, n !== 0 && e.prev_length < e.max_lazy_match && e.strstart - n <= e.w_size - V && (e.match_length = vt(e, n), e.match_length <= 5 && (e.strategy === Ke || e.match_length === z && e.strstart - e.match_start > 4096) && (e.match_length = z - 1)), e.prev_length >= z && e.match_length <= e.prev_length) {
+			i = e.strstart + e.lookahead - z, r = F(e, e.strstart - 1 - e.prev_match, e.prev_length - z), e.lookahead -= e.prev_length - 1, e.prev_length -= 2;
+			do
+				++e.strstart <= i && (e.ins_h = G(e, e.ins_h, e.window[e.strstart + z - 1]), n = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart);
+			while (--e.prev_length !== 0);
+			if (e.match_available = 0, e.match_length = z - 1, e.strstart++, r && (q(e, !1), e.strm.avail_out === 0)) return H;
+		} else if (e.match_available) {
+			if (r = F(e, 0, e.window[e.strstart - 1]), r && q(e, !1), e.strstart++, e.lookahead--, e.strm.avail_out === 0) return H;
+		} else e.match_available = 1, e.strstart++, e.lookahead--;
+	}
+	return e.match_available &&= (r = F(e, 0, e.window[e.strstart - 1]), 0), e.insert = e.strstart < z - 1 ? e.strstart : z - 1, t === I ? (q(e, !0), e.strm.avail_out === 0 ? ft : pt) : e.last_lit && (q(e, !1), e.strm.avail_out === 0) ? H : dt;
+}, Ct = (e, t) => {
+	let n, r, i, a, o = e.window;
+	for (;;) {
+		if (e.lookahead <= B) {
+			if (yt(e), e.lookahead <= B && t === Re) return H;
+			if (e.lookahead === 0) break;
+		}
+		if (e.match_length = 0, e.lookahead >= z && e.strstart > 0 && (i = e.strstart - 1, r = o[i], r === o[++i] && r === o[++i] && r === o[++i])) {
+			a = e.strstart + B;
+			do			;
+while (r === o[++i] && r === o[++i] && r === o[++i] && r === o[++i] && r === o[++i] && r === o[++i] && r === o[++i] && r === o[++i] && i < a);
+			e.match_length = B - (a - i), e.match_length > e.lookahead && (e.match_length = e.lookahead);
+		}
+		if (e.match_length >= z ? (n = F(e, 1, e.match_length - z), e.lookahead -= e.match_length, e.strstart += e.match_length, e.match_length = 0) : (n = F(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++), n && (q(e, !1), e.strm.avail_out === 0)) return H;
+	}
+	return e.insert = 0, t === I ? (q(e, !0), e.strm.avail_out === 0 ? ft : pt) : e.last_lit && (q(e, !1), e.strm.avail_out === 0) ? H : dt;
+}, wt = (e, t) => {
+	let n;
+	for (;;) {
+		if (e.lookahead === 0 && (yt(e), e.lookahead === 0)) {
+			if (t === Re) return H;
+			break;
+		}
+		if (e.match_length = 0, n = F(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++, n && (q(e, !1), e.strm.avail_out === 0)) return H;
+	}
+	return e.insert = 0, t === I ? (q(e, !0), e.strm.avail_out === 0 ? ft : pt) : e.last_lit && (q(e, !1), e.strm.avail_out === 0) ? H : dt;
+};
+function Y(e, t, n, r, i) {
+	this.good_length = e, this.max_lazy = t, this.nice_length = n, this.max_chain = r, this.func = i;
+}
+var Tt = [
+	new Y(0, 0, 0, 0, bt),
+	new Y(4, 4, 8, 4, xt),
+	new Y(4, 5, 16, 8, xt),
+	new Y(4, 6, 32, 32, xt),
+	new Y(4, 4, 16, 16, St),
+	new Y(8, 16, 32, 32, St),
+	new Y(8, 16, 128, 128, St),
+	new Y(8, 32, 128, 256, St),
+	new Y(32, 128, 258, 1024, St),
+	new Y(32, 258, 258, 4096, St)
+], Et = (e) => {
+	e.window_size = 2 * e.w_size, W(e.head), e.max_lazy_match = Tt[e.level].max_lazy, e.good_match = Tt[e.level].good_length, e.nice_match = Tt[e.level].nice_length, e.max_chain_length = Tt[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = z - 1, e.match_available = 0, e.ins_h = 0;
+};
+function Dt() {
+	this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = Qe, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new Uint16Array(nt * 2), this.dyn_dtree = /* @__PURE__ */ new Uint16Array(122), this.bl_tree = /* @__PURE__ */ new Uint16Array(78), W(this.dyn_ltree), W(this.dyn_dtree), W(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = /* @__PURE__ */ new Uint16Array(16), this.heap = /* @__PURE__ */ new Uint16Array(573), W(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = /* @__PURE__ */ new Uint16Array(573), W(this.depth), this.l_buf = 0, this.lit_bufsize = 0, this.last_lit = 0, this.d_buf = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
+}
+var Ot = (e) => {
+	if (!e || !e.state) return U(e, R);
+	e.total_in = e.total_out = 0, e.data_type = Ze;
+	let t = e.state;
+	return t.pending = 0, t.pending_out = 0, t.wrap < 0 && (t.wrap = -t.wrap), t.status = t.wrap ? it : lt, e.adler = t.wrap === 2 ? 0 : 1, t.last_flush = Re, Pe(t), L;
+}, kt = (e) => {
+	let t = Ot(e);
+	return t === L && Et(e.state), t;
+}, At = (e, t) => !e || !e.state || e.state.wrap !== 2 ? R : (e.state.gzhead = t, L), jt = (e, t, n, r, i, a) => {
+	if (!e) return R;
+	let o = 1;
+	if (t === Ge && (t = 6), r < 0 ? (o = 0, r = -r) : r > 15 && (o = 2, r -= 16), i < 1 || i > $e || n !== Qe || r < 8 || r > 15 || t < 0 || t > 9 || a < 0 || a > Ye) return U(e, R);
+	r === 8 && (r = 9);
+	let s = new Dt();
+	return e.state = s, s.strm = e, s.wrap = o, s.gzhead = null, s.w_bits = r, s.w_size = 1 << s.w_bits, s.w_mask = s.w_size - 1, s.hash_bits = i + 7, s.hash_size = 1 << s.hash_bits, s.hash_mask = s.hash_size - 1, s.hash_shift = ~~((s.hash_bits + z - 1) / z), s.window = new Uint8Array(s.w_size * 2), s.head = new Uint16Array(s.hash_size), s.prev = new Uint16Array(s.w_size), s.lit_bufsize = 1 << i + 6, s.pending_buf_size = s.lit_bufsize * 4, s.pending_buf = new Uint8Array(s.pending_buf_size), s.d_buf = 1 * s.lit_bufsize, s.l_buf = 3 * s.lit_bufsize, s.level = t, s.strategy = a, s.method = n, kt(e);
+}, Mt = {
+	deflateInit: (e, t) => jt(e, t, Qe, et, tt, Xe),
+	deflateInit2: jt,
+	deflateReset: kt,
+	deflateResetKeep: Ot,
+	deflateSetHeader: At,
+	deflate: (e, t) => {
+		let n, r;
+		if (!e || !e.state || t > Ve || t < 0) return e ? U(e, R) : R;
+		let i = e.state;
+		if (!e.output || !e.input && e.avail_in !== 0 || i.status === ut && t !== I) return U(e, e.avail_out === 0 ? We : R);
+		i.strm = e;
+		let a = i.last_flush;
+		if (i.last_flush = t, i.status === it) if (i.wrap === 2) e.adler = 0, J(i, 31), J(i, 139), J(i, 8), i.gzhead ? (J(i, +!!i.gzhead.text + (i.gzhead.hcrc ? 2 : 0) + (i.gzhead.extra ? 4 : 0) + (i.gzhead.name ? 8 : 0) + (i.gzhead.comment ? 16 : 0)), J(i, i.gzhead.time & 255), J(i, i.gzhead.time >> 8 & 255), J(i, i.gzhead.time >> 16 & 255), J(i, i.gzhead.time >> 24 & 255), J(i, i.level === 9 ? 2 : i.strategy >= qe || i.level < 2 ? 4 : 0), J(i, i.gzhead.os & 255), i.gzhead.extra && i.gzhead.extra.length && (J(i, i.gzhead.extra.length & 255), J(i, i.gzhead.extra.length >> 8 & 255)), i.gzhead.hcrc && (e.adler = P(e.adler, i.pending_buf, i.pending, 0)), i.gzindex = 0, i.status = at) : (J(i, 0), J(i, 0), J(i, 0), J(i, 0), J(i, 0), J(i, i.level === 9 ? 2 : i.strategy >= qe || i.level < 2 ? 4 : 0), J(i, mt), i.status = lt);
+		else {
+			let t = Qe + (i.w_bits - 8 << 4) << 8, n = -1;
+			n = i.strategy >= qe || i.level < 2 ? 0 : i.level < 6 ? 1 : i.level === 6 ? 2 : 3, t |= n << 6, i.strstart !== 0 && (t |= rt), t += 31 - t % 31, i.status = lt, gt(i, t), i.strstart !== 0 && (gt(i, e.adler >>> 16), gt(i, e.adler & 65535)), e.adler = 1;
+		}
+		if (i.status === at) if (i.gzhead.extra) {
+			for (n = i.pending; i.gzindex < (i.gzhead.extra.length & 65535) && !(i.pending === i.pending_buf_size && (i.gzhead.hcrc && i.pending > n && (e.adler = P(e.adler, i.pending_buf, i.pending - n, n)), K(e), n = i.pending, i.pending === i.pending_buf_size));) J(i, i.gzhead.extra[i.gzindex] & 255), i.gzindex++;
+			i.gzhead.hcrc && i.pending > n && (e.adler = P(e.adler, i.pending_buf, i.pending - n, n)), i.gzindex === i.gzhead.extra.length && (i.gzindex = 0, i.status = ot);
+		} else i.status = ot;
+		if (i.status === ot) if (i.gzhead.name) {
+			n = i.pending;
+			do {
+				if (i.pending === i.pending_buf_size && (i.gzhead.hcrc && i.pending > n && (e.adler = P(e.adler, i.pending_buf, i.pending - n, n)), K(e), n = i.pending, i.pending === i.pending_buf_size)) {
+					r = 1;
+					break;
+				}
+				r = i.gzindex < i.gzhead.name.length ? i.gzhead.name.charCodeAt(i.gzindex++) & 255 : 0, J(i, r);
+			} while (r !== 0);
+			i.gzhead.hcrc && i.pending > n && (e.adler = P(e.adler, i.pending_buf, i.pending - n, n)), r === 0 && (i.gzindex = 0, i.status = st);
+		} else i.status = st;
+		if (i.status === st) if (i.gzhead.comment) {
+			n = i.pending;
+			do {
+				if (i.pending === i.pending_buf_size && (i.gzhead.hcrc && i.pending > n && (e.adler = P(e.adler, i.pending_buf, i.pending - n, n)), K(e), n = i.pending, i.pending === i.pending_buf_size)) {
+					r = 1;
+					break;
+				}
+				r = i.gzindex < i.gzhead.comment.length ? i.gzhead.comment.charCodeAt(i.gzindex++) & 255 : 0, J(i, r);
+			} while (r !== 0);
+			i.gzhead.hcrc && i.pending > n && (e.adler = P(e.adler, i.pending_buf, i.pending - n, n)), r === 0 && (i.status = ct);
+		} else i.status = ct;
+		if (i.status === ct && (i.gzhead.hcrc ? (i.pending + 2 > i.pending_buf_size && K(e), i.pending + 2 <= i.pending_buf_size && (J(i, e.adler & 255), J(i, e.adler >> 8 & 255), e.adler = 0, i.status = lt)) : i.status = lt), i.pending !== 0) {
+			if (K(e), e.avail_out === 0) return i.last_flush = -1, L;
+		} else if (e.avail_in === 0 && ht(t) <= ht(a) && t !== I) return U(e, We);
+		if (i.status === ut && e.avail_in !== 0) return U(e, We);
+		if (e.avail_in !== 0 || i.lookahead !== 0 || t !== Re && i.status !== ut) {
+			let n = i.strategy === qe ? wt(i, t) : i.strategy === Je ? Ct(i, t) : Tt[i.level].func(i, t);
+			if ((n === ft || n === pt) && (i.status = ut), n === H || n === ft) return e.avail_out === 0 && (i.last_flush = -1), L;
+			if (n === dt && (t === ze ? Le(i) : t !== Ve && (Fe(i, 0, 0, !1), t === Be && (W(i.head), i.lookahead === 0 && (i.strstart = 0, i.block_start = 0, i.insert = 0))), K(e), e.avail_out === 0)) return i.last_flush = -1, L;
+		}
+		return t === I ? i.wrap <= 0 ? He : (i.wrap === 2 ? (J(i, e.adler & 255), J(i, e.adler >> 8 & 255), J(i, e.adler >> 16 & 255), J(i, e.adler >> 24 & 255), J(i, e.total_in & 255), J(i, e.total_in >> 8 & 255), J(i, e.total_in >> 16 & 255), J(i, e.total_in >> 24 & 255)) : (gt(i, e.adler >>> 16), gt(i, e.adler & 65535)), K(e), i.wrap > 0 && (i.wrap = -i.wrap), i.pending === 0 ? He : L) : L;
+	},
+	deflateEnd: (e) => {
+		if (!e || !e.state) return R;
+		let t = e.state.status;
+		return t !== it && t !== at && t !== ot && t !== st && t !== ct && t !== lt && t !== ut ? U(e, R) : (e.state = null, t === lt ? U(e, Ue) : L);
+	},
+	deflateSetDictionary: (e, t) => {
+		let n = t.length;
+		if (!e || !e.state) return R;
+		let r = e.state, i = r.wrap;
+		if (i === 2 || i === 1 && r.status !== it || r.lookahead) return R;
+		if (i === 1 && (e.adler = Ae(e.adler, t, n, 0)), r.wrap = 0, n >= r.w_size) {
+			i === 0 && (W(r.head), r.strstart = 0, r.block_start = 0, r.insert = 0);
+			let e = new Uint8Array(r.w_size);
+			e.set(t.subarray(n - r.w_size, n), 0), t = e, n = r.w_size;
+		}
+		let a = e.avail_in, o = e.next_in, s = e.input;
+		for (e.avail_in = n, e.next_in = 0, e.input = t, yt(r); r.lookahead >= z;) {
+			let e = r.strstart, t = r.lookahead - (z - 1);
+			do
+				r.ins_h = G(r, r.ins_h, r.window[e + z - 1]), r.prev[e & r.w_mask] = r.head[r.ins_h], r.head[r.ins_h] = e, e++;
+			while (--t);
+			r.strstart = e, r.lookahead = z - 1, yt(r);
+		}
+		return r.strstart += r.lookahead, r.block_start = r.strstart, r.insert = r.lookahead, r.lookahead = 0, r.match_length = r.prev_length = z - 1, r.match_available = 0, e.next_in = o, e.input = s, e.avail_in = a, r.wrap = i, L;
+	},
+	deflateInfo: "pako deflate (from Nodeca project)"
+}, Nt = (e, t) => Object.prototype.hasOwnProperty.call(e, t), Pt = {
+	assign: function(e) {
+		let t = Array.prototype.slice.call(arguments, 1);
+		for (; t.length;) {
+			let n = t.shift();
+			if (n) {
+				if (typeof n != "object") throw TypeError(n + "must be non-object");
+				for (let t in n) Nt(n, t) && (e[t] = n[t]);
+			}
+		}
+		return e;
+	},
+	flattenChunks: (e) => {
+		let t = 0;
+		for (let n = 0, r = e.length; n < r; n++) t += e[n].length;
+		let n = new Uint8Array(t);
+		for (let t = 0, r = 0, i = e.length; t < i; t++) {
+			let i = e[t];
+			n.set(i, r), r += i.length;
+		}
+		return n;
+	}
+}, Ft = !0;
+try {
+	String.fromCharCode.apply(null, /* @__PURE__ */ new Uint8Array(1));
+} catch {
+	Ft = !1;
+}
+var It = /* @__PURE__ */ new Uint8Array(256);
+for (let e = 0; e < 256; e++) It[e] = e >= 252 ? 6 : e >= 248 ? 5 : e >= 240 ? 4 : e >= 224 ? 3 : e >= 192 ? 2 : 1;
+It[254] = It[254] = 1;
+var Lt = (e) => {
+	let t, n, r, i, a, o = e.length, s = 0;
+	for (i = 0; i < o; i++) n = e.charCodeAt(i), (n & 64512) == 55296 && i + 1 < o && (r = e.charCodeAt(i + 1), (r & 64512) == 56320 && (n = 65536 + (n - 55296 << 10) + (r - 56320), i++)), s += n < 128 ? 1 : n < 2048 ? 2 : n < 65536 ? 3 : 4;
+	for (t = new Uint8Array(s), a = 0, i = 0; a < s; i++) n = e.charCodeAt(i), (n & 64512) == 55296 && i + 1 < o && (r = e.charCodeAt(i + 1), (r & 64512) == 56320 && (n = 65536 + (n - 55296 << 10) + (r - 56320), i++)), n < 128 ? t[a++] = n : n < 2048 ? (t[a++] = 192 | n >>> 6, t[a++] = 128 | n & 63) : n < 65536 ? (t[a++] = 224 | n >>> 12, t[a++] = 128 | n >>> 6 & 63, t[a++] = 128 | n & 63) : (t[a++] = 240 | n >>> 18, t[a++] = 128 | n >>> 12 & 63, t[a++] = 128 | n >>> 6 & 63, t[a++] = 128 | n & 63);
+	return t;
+}, Rt = (e, t) => {
+	if (t < 65534 && e.subarray && Ft) return String.fromCharCode.apply(null, e.length === t ? e : e.subarray(0, t));
+	let n = "";
+	for (let r = 0; r < t; r++) n += String.fromCharCode(e[r]);
+	return n;
+}, zt = {
+	string2buf: Lt,
+	buf2string: (e, t) => {
+		let n, r, i = t || e.length, a = Array(i * 2);
+		for (r = 0, n = 0; n < i;) {
+			let t = e[n++];
+			if (t < 128) {
+				a[r++] = t;
+				continue;
+			}
+			let o = It[t];
+			if (o > 4) {
+				a[r++] = 65533, n += o - 1;
+				continue;
+			}
+			for (t &= o === 2 ? 31 : o === 3 ? 15 : 7; o > 1 && n < i;) t = t << 6 | e[n++] & 63, o--;
+			if (o > 1) {
+				a[r++] = 65533;
+				continue;
+			}
+			t < 65536 ? a[r++] = t : (t -= 65536, a[r++] = 55296 | t >> 10 & 1023, a[r++] = 56320 | t & 1023);
+		}
+		return Rt(a, r);
+	},
+	utf8border: (e, t) => {
+		t ||= e.length, t > e.length && (t = e.length);
+		let n = t - 1;
+		for (; n >= 0 && (e[n] & 192) == 128;) n--;
+		return n < 0 || n === 0 ? t : n + It[e[n]] > t ? n : t;
+	}
+};
+function Bt() {
+	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;
+}
+var Vt = Bt, Ht = Object.prototype.toString, { Z_NO_FLUSH: Ut, Z_SYNC_FLUSH: Wt, Z_FULL_FLUSH: Gt, Z_FINISH: Kt, Z_OK: qt, Z_STREAM_END: Jt, Z_DEFAULT_COMPRESSION: Yt, Z_DEFAULT_STRATEGY: Xt, Z_DEFLATED: Zt } = Ne;
+function Qt(e) {
+	this.options = Pt.assign({
+		level: Yt,
+		method: Zt,
+		chunkSize: 16384,
+		windowBits: 15,
+		memLevel: 8,
+		strategy: Xt
+	}, e || {});
+	let t = this.options;
+	t.raw && t.windowBits > 0 ? t.windowBits = -t.windowBits : t.gzip && t.windowBits > 0 && t.windowBits < 16 && (t.windowBits += 16), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new Vt(), this.strm.avail_out = 0;
+	let n = Mt.deflateInit2(this.strm, t.level, t.method, t.windowBits, t.memLevel, t.strategy);
+	if (n !== qt) throw Error(Me[n]);
+	if (t.header && Mt.deflateSetHeader(this.strm, t.header), t.dictionary) {
+		let e;
+		if (e = typeof t.dictionary == "string" ? zt.string2buf(t.dictionary) : Ht.call(t.dictionary) === "[object ArrayBuffer]" ? new Uint8Array(t.dictionary) : t.dictionary, n = Mt.deflateSetDictionary(this.strm, e), n !== qt) throw Error(Me[n]);
+		this._dict_set = !0;
+	}
+}
+Qt.prototype.push = function(e, t) {
+	let n = this.strm, r = this.options.chunkSize, i, a;
+	if (this.ended) return !1;
+	for (a = t === ~~t ? t : t === !0 ? Kt : Ut, typeof e == "string" ? n.input = zt.string2buf(e) : Ht.call(e) === "[object ArrayBuffer]" ? n.input = new Uint8Array(e) : n.input = e, n.next_in = 0, n.avail_in = n.input.length;;) {
+		if (n.avail_out === 0 && (n.output = new Uint8Array(r), n.next_out = 0, n.avail_out = r), (a === Wt || a === Gt) && n.avail_out <= 6) {
+			this.onData(n.output.subarray(0, n.next_out)), n.avail_out = 0;
+			continue;
+		}
+		if (i = Mt.deflate(n, a), i === Jt) return n.next_out > 0 && this.onData(n.output.subarray(0, n.next_out)), i = Mt.deflateEnd(this.strm), this.onEnd(i), this.ended = !0, i === qt;
+		if (n.avail_out === 0) {
+			this.onData(n.output);
+			continue;
+		}
+		if (a > 0 && n.next_out > 0) {
+			this.onData(n.output.subarray(0, n.next_out)), n.avail_out = 0;
+			continue;
+		}
+		if (n.avail_in === 0) break;
+	}
+	return !0;
+}, Qt.prototype.onData = function(e) {
+	this.chunks.push(e);
+}, Qt.prototype.onEnd = function(e) {
+	e === qt && (this.result = Pt.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
+};
+function $t(e, t) {
+	let n = new Qt(t);
+	if (n.push(e, !0), n.err) throw n.msg || Me[n.err];
+	return n.result;
+}
+function en(e, t) {
+	return t ||= {}, t.raw = !0, $t(e, t);
+}
+function tn(e, t) {
+	return t ||= {}, t.gzip = !0, $t(e, t);
+}
+var nn = {
+	Deflate: Qt,
+	deflate: $t,
+	deflateRaw: en,
+	gzip: tn,
+	constants: Ne
+}, rn = 30, an = 12, on = function(e, t) {
+	let n, r, i, a, o, s, c, l, u, d, f, p, m, h, g, _, v, y, b, x, S, C, w, T, E = e.state;
+	n = e.next_in, w = e.input, r = n + (e.avail_in - 5), i = e.next_out, T = e.output, a = i - (t - e.avail_out), o = i + (e.avail_out - 257), s = E.dmax, c = E.wsize, l = E.whave, u = E.wnext, d = E.window, f = E.hold, p = E.bits, m = E.lencode, h = E.distcode, g = (1 << E.lenbits) - 1, _ = (1 << E.distbits) - 1;
+	top: do {
+		p < 15 && (f += w[n++] << p, p += 8, f += w[n++] << p, p += 8), v = m[f & g];
+		dolen: for (;;) {
+			if (y = v >>> 24, f >>>= y, p -= y, y = v >>> 16 & 255, y === 0) T[i++] = v & 65535;
+			else if (y & 16) {
+				b = v & 65535, y &= 15, y && (p < y && (f += w[n++] << p, p += 8), b += f & (1 << y) - 1, f >>>= y, p -= y), p < 15 && (f += w[n++] << p, p += 8, f += w[n++] << p, p += 8), v = h[f & _];
+				dodist: for (;;) {
+					if (y = v >>> 24, f >>>= y, p -= y, y = v >>> 16 & 255, y & 16) {
+						if (x = v & 65535, y &= 15, p < y && (f += w[n++] << p, p += 8, p < y && (f += w[n++] << p, p += 8)), x += f & (1 << y) - 1, x > s) {
+							e.msg = "invalid distance too far back", E.mode = rn;
+							break top;
+						}
+						if (f >>>= y, p -= y, y = i - a, x > y) {
+							if (y = x - y, y > l && E.sane) {
+								e.msg = "invalid distance too far back", E.mode = rn;
+								break top;
+							}
+							if (S = 0, C = d, u === 0) {
+								if (S += c - y, y < b) {
+									b -= y;
+									do
+										T[i++] = d[S++];
+									while (--y);
+									S = i - x, C = T;
+								}
+							} else if (u < y) {
+								if (S += c + u - y, y -= u, y < b) {
+									b -= y;
+									do
+										T[i++] = d[S++];
+									while (--y);
+									if (S = 0, u < b) {
+										y = u, b -= y;
+										do
+											T[i++] = d[S++];
+										while (--y);
+										S = i - x, C = T;
+									}
+								}
+							} else if (S += u - y, y < b) {
+								b -= y;
+								do
+									T[i++] = d[S++];
+								while (--y);
+								S = i - x, C = T;
+							}
+							for (; b > 2;) T[i++] = C[S++], T[i++] = C[S++], T[i++] = C[S++], b -= 3;
+							b && (T[i++] = C[S++], b > 1 && (T[i++] = C[S++]));
+						} else {
+							S = i - x;
+							do
+								T[i++] = T[S++], T[i++] = T[S++], T[i++] = T[S++], b -= 3;
+							while (b > 2);
+							b && (T[i++] = T[S++], b > 1 && (T[i++] = T[S++]));
+						}
+					} else if (y & 64) {
+						e.msg = "invalid distance code", E.mode = rn;
+						break top;
+					} else {
+						v = h[(v & 65535) + (f & (1 << y) - 1)];
+						continue dodist;
+					}
+					break;
+				}
+			} else if (!(y & 64)) {
+				v = m[(v & 65535) + (f & (1 << y) - 1)];
+				continue dolen;
+			} else if (y & 32) {
+				E.mode = an;
+				break top;
+			} else {
+				e.msg = "invalid literal/length code", E.mode = rn;
+				break top;
+			}
+			break;
+		}
+	} while (n < r && i < o);
+	b = p >> 3, n -= b, p -= b << 3, f &= (1 << p) - 1, e.next_in = n, e.next_out = i, e.avail_in = n < r ? 5 + (r - n) : 5 - (n - r), e.avail_out = i < o ? 257 + (o - i) : 257 - (i - o), E.hold = f, E.bits = p;
+}, sn = 15, cn = 852, ln = 592, un = 0, dn = 1, fn = 2, pn = new Uint16Array([
+	3,
+	4,
+	5,
+	6,
+	7,
+	8,
+	9,
+	10,
+	11,
+	13,
+	15,
+	17,
+	19,
+	23,
+	27,
+	31,
+	35,
+	43,
+	51,
+	59,
+	67,
+	83,
+	99,
+	115,
+	131,
+	163,
+	195,
+	227,
+	258,
+	0,
+	0
+]), mn = new Uint8Array([
+	16,
+	16,
+	16,
+	16,
+	16,
+	16,
+	16,
+	16,
+	17,
+	17,
+	17,
+	17,
+	18,
+	18,
+	18,
+	18,
+	19,
+	19,
+	19,
+	19,
+	20,
+	20,
+	20,
+	20,
+	21,
+	21,
+	21,
+	21,
+	16,
+	72,
+	78
+]), hn = new Uint16Array([
+	1,
+	2,
+	3,
+	4,
+	5,
+	7,
+	9,
+	13,
+	17,
+	25,
+	33,
+	49,
+	65,
+	97,
+	129,
+	193,
+	257,
+	385,
+	513,
+	769,
+	1025,
+	1537,
+	2049,
+	3073,
+	4097,
+	6145,
+	8193,
+	12289,
+	16385,
+	24577,
+	0,
+	0
+]), gn = new Uint8Array([
+	16,
+	16,
+	16,
+	16,
+	17,
+	17,
+	18,
+	18,
+	19,
+	19,
+	20,
+	20,
+	21,
+	21,
+	22,
+	22,
+	23,
+	23,
+	24,
+	24,
+	25,
+	25,
+	26,
+	26,
+	27,
+	27,
+	28,
+	28,
+	29,
+	29,
+	64,
+	64
+]), _n = (e, t, n, r, i, a, o, s) => {
+	let c = s.bits, l = 0, u = 0, d = 0, f = 0, p = 0, m = 0, h = 0, g = 0, _ = 0, v = 0, y, b, x, S, C, w = null, T = 0, E, D = /* @__PURE__ */ new Uint16Array(16), O = /* @__PURE__ */ new Uint16Array(16), k = null, A = 0, ee, te, j;
+	for (l = 0; l <= sn; l++) D[l] = 0;
+	for (u = 0; u < r; u++) D[t[n + u]]++;
+	for (p = c, f = sn; f >= 1 && D[f] === 0; f--);
+	if (p > f && (p = f), f === 0) return i[a++] = 20971520, i[a++] = 20971520, s.bits = 1, 0;
+	for (d = 1; d < f && D[d] === 0; d++);
+	for (p < d && (p = d), g = 1, l = 1; l <= sn; l++) if (g <<= 1, g -= D[l], g < 0) return -1;
+	if (g > 0 && (e === un || f !== 1)) return -1;
+	for (O[1] = 0, l = 1; l < sn; l++) O[l + 1] = O[l] + D[l];
+	for (u = 0; u < r; u++) t[n + u] !== 0 && (o[O[t[n + u]]++] = u);
+	if (e === un ? (w = k = o, E = 19) : e === dn ? (w = pn, T -= 257, k = mn, A -= 257, E = 256) : (w = hn, k = gn, E = -1), v = 0, u = 0, l = d, C = a, m = p, h = 0, x = -1, _ = 1 << p, S = _ - 1, e === dn && _ > cn || e === fn && _ > ln) return 1;
+	for (;;) {
+		ee = l - h, o[u] < E ? (te = 0, j = o[u]) : o[u] > E ? (te = k[A + o[u]], j = w[T + o[u]]) : (te = 96, j = 0), y = 1 << l - h, b = 1 << m, d = b;
+		do
+			b -= y, i[C + (v >> h) + b] = ee << 24 | te << 16 | j | 0;
+		while (b !== 0);
+		for (y = 1 << l - 1; v & y;) y >>= 1;
+		if (y === 0 ? v = 0 : (v &= y - 1, v += y), u++, --D[l] === 0) {
+			if (l === f) break;
+			l = t[n + o[u]];
+		}
+		if (l > p && (v & S) !== x) {
+			for (h === 0 && (h = p), C += d, m = l - h, g = 1 << m; m + h < f && (g -= D[m + h], !(g <= 0));) m++, g <<= 1;
+			if (_ += 1 << m, e === dn && _ > cn || e === fn && _ > ln) return 1;
+			x = v & S, i[x] = p << 24 | m << 16 | C - a | 0;
+		}
+	}
+	return v !== 0 && (i[C + v] = l - h << 24 | 4194304), s.bits = p, 0;
+}, vn = 0, yn = 1, bn = 2, { Z_FINISH: xn, Z_BLOCK: Sn, Z_TREES: Cn, Z_OK: wn, Z_STREAM_END: Tn, Z_NEED_DICT: En, Z_STREAM_ERROR: X, Z_DATA_ERROR: Dn, Z_MEM_ERROR: On, Z_BUF_ERROR: kn, Z_DEFLATED: An } = Ne, jn = 1, Mn = 2, Nn = 3, Pn = 4, Fn = 5, In = 6, Ln = 7, Rn = 8, zn = 9, Bn = 10, Vn = 11, Z = 12, Hn = 13, Un = 14, Wn = 15, Gn = 16, Kn = 17, qn = 18, Jn = 19, Yn = 20, Xn = 21, Zn = 22, Qn = 23, $n = 24, er = 25, tr = 26, nr = 27, rr = 28, ir = 29, Q = 30, ar = 31, or = 32, sr = 852, cr = 592, lr = 15, ur = (e) => (e >>> 24 & 255) + (e >>> 8 & 65280) + ((e & 65280) << 8) + ((e & 255) << 24);
+function dr() {
+	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 = /* @__PURE__ */ new Uint16Array(320), this.work = /* @__PURE__ */ new Uint16Array(288), this.lendyn = null, this.distdyn = null, this.sane = 0, this.back = 0, this.was = 0;
+}
+var fr = (e) => {
+	if (!e || !e.state) return X;
+	let t = e.state;
+	return e.total_in = e.total_out = t.total = 0, e.msg = "", t.wrap && (e.adler = t.wrap & 1), t.mode = jn, t.last = 0, t.havedict = 0, t.dmax = 32768, t.head = null, t.hold = 0, t.bits = 0, t.lencode = t.lendyn = new Int32Array(sr), t.distcode = t.distdyn = new Int32Array(cr), t.sane = 1, t.back = -1, wn;
+}, pr = (e) => {
+	if (!e || !e.state) return X;
+	let t = e.state;
+	return t.wsize = 0, t.whave = 0, t.wnext = 0, fr(e);
+}, mr = (e, t) => {
+	let n;
+	if (!e || !e.state) return X;
+	let r = e.state;
+	return t < 0 ? (n = 0, t = -t) : (n = (t >> 4) + 1, t < 48 && (t &= 15)), t && (t < 8 || t > 15) ? X : (r.window !== null && r.wbits !== t && (r.window = null), r.wrap = n, r.wbits = t, pr(e));
+}, hr = (e, t) => {
+	if (!e) return X;
+	let n = new dr();
+	e.state = n, n.window = null;
+	let r = mr(e, t);
+	return r !== wn && (e.state = null), r;
+}, gr = (e) => hr(e, lr), _r = !0, vr, yr, br = (e) => {
+	if (_r) {
+		vr = /* @__PURE__ */ new Int32Array(512), yr = /* @__PURE__ */ new Int32Array(32);
+		let t = 0;
+		for (; t < 144;) e.lens[t++] = 8;
+		for (; t < 256;) e.lens[t++] = 9;
+		for (; t < 280;) e.lens[t++] = 7;
+		for (; t < 288;) e.lens[t++] = 8;
+		for (_n(yn, e.lens, 0, 288, vr, 0, e.work, { bits: 9 }), t = 0; t < 32;) e.lens[t++] = 5;
+		_n(bn, e.lens, 0, 32, yr, 0, e.work, { bits: 5 }), _r = !1;
+	}
+	e.lencode = vr, e.lenbits = 9, e.distcode = yr, e.distbits = 5;
+}, xr = (e, t, n, r) => {
+	let i, a = e.state;
+	return a.window === null && (a.wsize = 1 << a.wbits, a.wnext = 0, a.whave = 0, a.window = new Uint8Array(a.wsize)), r >= a.wsize ? (a.window.set(t.subarray(n - a.wsize, n), 0), a.wnext = 0, a.whave = a.wsize) : (i = a.wsize - a.wnext, i > r && (i = r), a.window.set(t.subarray(n - r, n - r + i), a.wnext), r -= i, r ? (a.window.set(t.subarray(n - r, n), 0), a.wnext = r, a.whave = a.wsize) : (a.wnext += i, a.wnext === a.wsize && (a.wnext = 0), a.whave < a.wsize && (a.whave += i))), 0;
+}, $ = {
+	inflateReset: pr,
+	inflateReset2: mr,
+	inflateResetKeep: fr,
+	inflateInit: gr,
+	inflateInit2: hr,
+	inflate: (e, t) => {
+		let n, r, i, a, o, s, c, l, u, d, f, p, m, h, g = 0, _, v, y, b, x, S, C, w, T = /* @__PURE__ */ new Uint8Array(4), E, D, O = new Uint8Array([
+			16,
+			17,
+			18,
+			0,
+			8,
+			7,
+			9,
+			6,
+			10,
+			5,
+			11,
+			4,
+			12,
+			3,
+			13,
+			2,
+			14,
+			1,
+			15
+		]);
+		if (!e || !e.state || !e.output || !e.input && e.avail_in !== 0) return X;
+		n = e.state, n.mode === Z && (n.mode = Hn), o = e.next_out, i = e.output, c = e.avail_out, a = e.next_in, r = e.input, s = e.avail_in, l = n.hold, u = n.bits, d = s, f = c, w = wn;
+		inf_leave: for (;;) switch (n.mode) {
+			case jn:
+				if (n.wrap === 0) {
+					n.mode = Hn;
+					break;
+				}
+				for (; u < 16;) {
+					if (s === 0) break inf_leave;
+					s--, l += r[a++] << u, u += 8;
+				}
+				if (n.wrap & 2 && l === 35615) {
+					n.check = 0, T[0] = l & 255, T[1] = l >>> 8 & 255, n.check = P(n.check, T, 2, 0), l = 0, u = 0, n.mode = Mn;
+					break;
+				}
+				if (n.flags = 0, n.head && (n.head.done = !1), !(n.wrap & 1) || (((l & 255) << 8) + (l >> 8)) % 31) {
+					e.msg = "incorrect header check", n.mode = Q;
+					break;
+				}
+				if ((l & 15) !== An) {
+					e.msg = "unknown compression method", n.mode = Q;
+					break;
+				}
+				if (l >>>= 4, u -= 4, C = (l & 15) + 8, n.wbits === 0) n.wbits = C;
+				else if (C > n.wbits) {
+					e.msg = "invalid window size", n.mode = Q;
+					break;
+				}
+				n.dmax = 1 << n.wbits, e.adler = n.check = 1, n.mode = l & 512 ? Bn : Z, l = 0, u = 0;
+				break;
+			case Mn:
+				for (; u < 16;) {
+					if (s === 0) break inf_leave;
+					s--, l += r[a++] << u, u += 8;
+				}
+				if (n.flags = l, (n.flags & 255) !== An) {
+					e.msg = "unknown compression method", n.mode = Q;
+					break;
+				}
+				if (n.flags & 57344) {
+					e.msg = "unknown header flags set", n.mode = Q;
+					break;
+				}
+				n.head && (n.head.text = l >> 8 & 1), n.flags & 512 && (T[0] = l & 255, T[1] = l >>> 8 & 255, n.check = P(n.check, T, 2, 0)), l = 0, u = 0, n.mode = Nn;
+			case Nn:
+				for (; u < 32;) {
+					if (s === 0) break inf_leave;
+					s--, l += r[a++] << u, u += 8;
+				}
+				n.head && (n.head.time = l), n.flags & 512 && (T[0] = l & 255, T[1] = l >>> 8 & 255, T[2] = l >>> 16 & 255, T[3] = l >>> 24 & 255, n.check = P(n.check, T, 4, 0)), l = 0, u = 0, n.mode = Pn;
+			case Pn:
+				for (; u < 16;) {
+					if (s === 0) break inf_leave;
+					s--, l += r[a++] << u, u += 8;
+				}
+				n.head && (n.head.xflags = l & 255, n.head.os = l >> 8), n.flags & 512 && (T[0] = l & 255, T[1] = l >>> 8 & 255, n.check = P(n.check, T, 2, 0)), l = 0, u = 0, n.mode = Fn;
+			case Fn:
+				if (n.flags & 1024) {
+					for (; u < 16;) {
+						if (s === 0) break inf_leave;
+						s--, l += r[a++] << u, u += 8;
+					}
+					n.length = l, n.head && (n.head.extra_len = l), n.flags & 512 && (T[0] = l & 255, T[1] = l >>> 8 & 255, n.check = P(n.check, T, 2, 0)), l = 0, u = 0;
+				} else n.head && (n.head.extra = null);
+				n.mode = In;
+			case In:
+				if (n.flags & 1024 && (p = n.length, p > s && (p = s), p && (n.head && (C = n.head.extra_len - n.length, n.head.extra || (n.head.extra = new Uint8Array(n.head.extra_len)), n.head.extra.set(r.subarray(a, a + p), C)), n.flags & 512 && (n.check = P(n.check, r, p, a)), s -= p, a += p, n.length -= p), n.length)) break inf_leave;
+				n.length = 0, n.mode = Ln;
+			case Ln:
+				if (n.flags & 2048) {
+					if (s === 0) break inf_leave;
+					p = 0;
+					do
+						C = r[a + p++], n.head && C && n.length < 65536 && (n.head.name += String.fromCharCode(C));
+					while (C && p < s);
+					if (n.flags & 512 && (n.check = P(n.check, r, p, a)), s -= p, a += p, C) break inf_leave;
+				} else n.head && (n.head.name = null);
+				n.length = 0, n.mode = Rn;
+			case Rn:
+				if (n.flags & 4096) {
+					if (s === 0) break inf_leave;
+					p = 0;
+					do
+						C = r[a + p++], n.head && C && n.length < 65536 && (n.head.comment += String.fromCharCode(C));
+					while (C && p < s);
+					if (n.flags & 512 && (n.check = P(n.check, r, p, a)), s -= p, a += p, C) break inf_leave;
+				} else n.head && (n.head.comment = null);
+				n.mode = zn;
+			case zn:
+				if (n.flags & 512) {
+					for (; u < 16;) {
+						if (s === 0) break inf_leave;
+						s--, l += r[a++] << u, u += 8;
+					}
+					if (l !== (n.check & 65535)) {
+						e.msg = "header crc mismatch", n.mode = Q;
+						break;
+					}
+					l = 0, u = 0;
+				}
+				n.head && (n.head.hcrc = n.flags >> 9 & 1, n.head.done = !0), e.adler = n.check = 0, n.mode = Z;
+				break;
+			case Bn:
+				for (; u < 32;) {
+					if (s === 0) break inf_leave;
+					s--, l += r[a++] << u, u += 8;
+				}
+				e.adler = n.check = ur(l), l = 0, u = 0, n.mode = Vn;
+			case Vn:
+				if (n.havedict === 0) return e.next_out = o, e.avail_out = c, e.next_in = a, e.avail_in = s, n.hold = l, n.bits = u, En;
+				e.adler = n.check = 1, n.mode = Z;
+			case Z: if (t === Sn || t === Cn) break inf_leave;
+			case Hn:
+				if (n.last) {
+					l >>>= u & 7, u -= u & 7, n.mode = nr;
+					break;
+				}
+				for (; u < 3;) {
+					if (s === 0) break inf_leave;
+					s--, l += r[a++] << u, u += 8;
+				}
+				switch (n.last = l & 1, l >>>= 1, --u, l & 3) {
+					case 0:
+						n.mode = Un;
+						break;
+					case 1:
+						if (br(n), n.mode = Yn, t === Cn) {
+							l >>>= 2, u -= 2;
+							break inf_leave;
+						}
+						break;
+					case 2:
+						n.mode = Kn;
+						break;
+					case 3: e.msg = "invalid block type", n.mode = Q;
+				}
+				l >>>= 2, u -= 2;
+				break;
+			case Un:
+				for (l >>>= u & 7, u -= u & 7; u < 32;) {
+					if (s === 0) break inf_leave;
+					s--, l += r[a++] << u, u += 8;
+				}
+				if ((l & 65535) != (l >>> 16 ^ 65535)) {
+					e.msg = "invalid stored block lengths", n.mode = Q;
+					break;
+				}
+				if (n.length = l & 65535, l = 0, u = 0, n.mode = Wn, t === Cn) break inf_leave;
+			case Wn: n.mode = Gn;
+			case Gn:
+				if (p = n.length, p) {
+					if (p > s && (p = s), p > c && (p = c), p === 0) break inf_leave;
+					i.set(r.subarray(a, a + p), o), s -= p, a += p, c -= p, o += p, n.length -= p;
+					break;
+				}
+				n.mode = Z;
+				break;
+			case Kn:
+				for (; u < 14;) {
+					if (s === 0) break inf_leave;
+					s--, l += r[a++] << u, u += 8;
+				}
+				if (n.nlen = (l & 31) + 257, l >>>= 5, u -= 5, n.ndist = (l & 31) + 1, l >>>= 5, u -= 5, n.ncode = (l & 15) + 4, l >>>= 4, u -= 4, n.nlen > 286 || n.ndist > 30) {
+					e.msg = "too many length or distance symbols", n.mode = Q;
+					break;
+				}
+				n.have = 0, n.mode = qn;
+			case qn:
+				for (; n.have < n.ncode;) {
+					for (; u < 3;) {
+						if (s === 0) break inf_leave;
+						s--, l += r[a++] << u, u += 8;
+					}
+					n.lens[O[n.have++]] = l & 7, l >>>= 3, u -= 3;
+				}
+				for (; n.have < 19;) n.lens[O[n.have++]] = 0;
+				if (n.lencode = n.lendyn, n.lenbits = 7, E = { bits: n.lenbits }, w = _n(vn, n.lens, 0, 19, n.lencode, 0, n.work, E), n.lenbits = E.bits, w) {
+					e.msg = "invalid code lengths set", n.mode = Q;
+					break;
+				}
+				n.have = 0, n.mode = Jn;
+			case Jn:
+				for (; n.have < n.nlen + n.ndist;) {
+					for (; g = n.lencode[l & (1 << n.lenbits) - 1], _ = g >>> 24, v = g >>> 16 & 255, y = g & 65535, !(_ <= u);) {
+						if (s === 0) break inf_leave;
+						s--, l += r[a++] << u, u += 8;
+					}
+					if (y < 16) l >>>= _, u -= _, n.lens[n.have++] = y;
+					else {
+						if (y === 16) {
+							for (D = _ + 2; u < D;) {
+								if (s === 0) break inf_leave;
+								s--, l += r[a++] << u, u += 8;
+							}
+							if (l >>>= _, u -= _, n.have === 0) {
+								e.msg = "invalid bit length repeat", n.mode = Q;
+								break;
+							}
+							C = n.lens[n.have - 1], p = 3 + (l & 3), l >>>= 2, u -= 2;
+						} else if (y === 17) {
+							for (D = _ + 3; u < D;) {
+								if (s === 0) break inf_leave;
+								s--, l += r[a++] << u, u += 8;
+							}
+							l >>>= _, u -= _, C = 0, p = 3 + (l & 7), l >>>= 3, u -= 3;
+						} else {
+							for (D = _ + 7; u < D;) {
+								if (s === 0) break inf_leave;
+								s--, l += r[a++] << u, u += 8;
+							}
+							l >>>= _, u -= _, C = 0, p = 11 + (l & 127), l >>>= 7, u -= 7;
+						}
+						if (n.have + p > n.nlen + n.ndist) {
+							e.msg = "invalid bit length repeat", n.mode = Q;
+							break;
+						}
+						for (; p--;) n.lens[n.have++] = C;
+					}
+				}
+				if (n.mode === Q) break;
+				if (n.lens[256] === 0) {
+					e.msg = "invalid code -- missing end-of-block", n.mode = Q;
+					break;
+				}
+				if (n.lenbits = 9, E = { bits: n.lenbits }, w = _n(yn, n.lens, 0, n.nlen, n.lencode, 0, n.work, E), n.lenbits = E.bits, w) {
+					e.msg = "invalid literal/lengths set", n.mode = Q;
+					break;
+				}
+				if (n.distbits = 6, n.distcode = n.distdyn, E = { bits: n.distbits }, w = _n(bn, n.lens, n.nlen, n.ndist, n.distcode, 0, n.work, E), n.distbits = E.bits, w) {
+					e.msg = "invalid distances set", n.mode = Q;
+					break;
+				}
+				if (n.mode = Yn, t === Cn) break inf_leave;
+			case Yn: n.mode = Xn;
+			case Xn:
+				if (s >= 6 && c >= 258) {
+					e.next_out = o, e.avail_out = c, e.next_in = a, e.avail_in = s, n.hold = l, n.bits = u, on(e, f), o = e.next_out, i = e.output, c = e.avail_out, a = e.next_in, r = e.input, s = e.avail_in, l = n.hold, u = n.bits, n.mode === Z && (n.back = -1);
+					break;
+				}
+				for (n.back = 0; g = n.lencode[l & (1 << n.lenbits) - 1], _ = g >>> 24, v = g >>> 16 & 255, y = g & 65535, !(_ <= u);) {
+					if (s === 0) break inf_leave;
+					s--, l += r[a++] << u, u += 8;
+				}
+				if (v && !(v & 240)) {
+					for (b = _, x = v, S = y; g = n.lencode[S + ((l & (1 << b + x) - 1) >> b)], _ = g >>> 24, v = g >>> 16 & 255, y = g & 65535, !(b + _ <= u);) {
+						if (s === 0) break inf_leave;
+						s--, l += r[a++] << u, u += 8;
+					}
+					l >>>= b, u -= b, n.back += b;
+				}
+				if (l >>>= _, u -= _, n.back += _, n.length = y, v === 0) {
+					n.mode = tr;
+					break;
+				}
+				if (v & 32) {
+					n.back = -1, n.mode = Z;
+					break;
+				}
+				if (v & 64) {
+					e.msg = "invalid literal/length code", n.mode = Q;
+					break;
+				}
+				n.extra = v & 15, n.mode = Zn;
+			case Zn:
+				if (n.extra) {
+					for (D = n.extra; u < D;) {
+						if (s === 0) break inf_leave;
+						s--, l += r[a++] << u, u += 8;
+					}
+					n.length += l & (1 << n.extra) - 1, l >>>= n.extra, u -= n.extra, n.back += n.extra;
+				}
+				n.was = n.length, n.mode = Qn;
+			case Qn:
+				for (; g = n.distcode[l & (1 << n.distbits) - 1], _ = g >>> 24, v = g >>> 16 & 255, y = g & 65535, !(_ <= u);) {
+					if (s === 0) break inf_leave;
+					s--, l += r[a++] << u, u += 8;
+				}
+				if (!(v & 240)) {
+					for (b = _, x = v, S = y; g = n.distcode[S + ((l & (1 << b + x) - 1) >> b)], _ = g >>> 24, v = g >>> 16 & 255, y = g & 65535, !(b + _ <= u);) {
+						if (s === 0) break inf_leave;
+						s--, l += r[a++] << u, u += 8;
+					}
+					l >>>= b, u -= b, n.back += b;
+				}
+				if (l >>>= _, u -= _, n.back += _, v & 64) {
+					e.msg = "invalid distance code", n.mode = Q;
+					break;
+				}
+				n.offset = y, n.extra = v & 15, n.mode = $n;
+			case $n:
+				if (n.extra) {
+					for (D = n.extra; u < D;) {
+						if (s === 0) break inf_leave;
+						s--, l += r[a++] << u, u += 8;
+					}
+					n.offset += l & (1 << n.extra) - 1, l >>>= n.extra, u -= n.extra, n.back += n.extra;
+				}
+				if (n.offset > n.dmax) {
+					e.msg = "invalid distance too far back", n.mode = Q;
+					break;
+				}
+				n.mode = er;
+			case er:
+				if (c === 0) break inf_leave;
+				if (p = f - c, n.offset > p) {
+					if (p = n.offset - p, p > n.whave && n.sane) {
+						e.msg = "invalid distance too far back", n.mode = Q;
+						break;
+					}
+					p > n.wnext ? (p -= n.wnext, m = n.wsize - p) : m = n.wnext - p, p > n.length && (p = n.length), h = n.window;
+				} else h = i, m = o - n.offset, p = n.length;
+				p > c && (p = c), c -= p, n.length -= p;
+				do
+					i[o++] = h[m++];
+				while (--p);
+				n.length === 0 && (n.mode = Xn);
+				break;
+			case tr:
+				if (c === 0) break inf_leave;
+				i[o++] = n.length, c--, n.mode = Xn;
+				break;
+			case nr:
+				if (n.wrap) {
+					for (; u < 32;) {
+						if (s === 0) break inf_leave;
+						s--, l |= r[a++] << u, u += 8;
+					}
+					if (f -= c, e.total_out += f, n.total += f, f && (e.adler = n.check = n.flags ? P(n.check, i, f, o - f) : Ae(n.check, i, f, o - f)), f = c, (n.flags ? l : ur(l)) !== n.check) {
+						e.msg = "incorrect data check", n.mode = Q;
+						break;
+					}
+					l = 0, u = 0;
+				}
+				n.mode = rr;
+			case rr:
+				if (n.wrap && n.flags) {
+					for (; u < 32;) {
+						if (s === 0) break inf_leave;
+						s--, l += r[a++] << u, u += 8;
+					}
+					if (l !== (n.total & 4294967295)) {
+						e.msg = "incorrect length check", n.mode = Q;
+						break;
+					}
+					l = 0, u = 0;
+				}
+				n.mode = ir;
+			case ir:
+				w = Tn;
+				break inf_leave;
+			case Q:
+				w = Dn;
+				break inf_leave;
+			case ar: return On;
+			case or:
+			default: return X;
+		}
+		return e.next_out = o, e.avail_out = c, e.next_in = a, e.avail_in = s, n.hold = l, n.bits = u, (n.wsize || f !== e.avail_out && n.mode < Q && (n.mode < nr || t !== xn)) && xr(e, e.output, e.next_out, f - e.avail_out), d -= e.avail_in, f -= e.avail_out, e.total_in += d, e.total_out += f, n.total += f, n.wrap && f && (e.adler = n.check = n.flags ? P(n.check, i, f, e.next_out - f) : Ae(n.check, i, f, e.next_out - f)), e.data_type = n.bits + (n.last ? 64 : 0) + (n.mode === Z ? 128 : 0) + (n.mode === Yn || n.mode === Wn ? 256 : 0), (d === 0 && f === 0 || t === xn) && w === wn && (w = kn), w;
+	},
+	inflateEnd: (e) => {
+		if (!e || !e.state) return X;
+		let t = e.state;
+		return t.window &&= null, e.state = null, wn;
+	},
+	inflateGetHeader: (e, t) => {
+		if (!e || !e.state) return X;
+		let n = e.state;
+		return n.wrap & 2 ? (n.head = t, t.done = !1, wn) : X;
+	},
+	inflateSetDictionary: (e, t) => {
+		let n = t.length, r, i, a;
+		return !e || !e.state || (r = e.state, r.wrap !== 0 && r.mode !== Vn) ? X : r.mode === Vn && (i = 1, i = Ae(i, t, n, 0), i !== r.check) ? Dn : (a = xr(e, t, n, n), a ? (r.mode = ar, On) : (r.havedict = 1, wn));
+	},
+	inflateInfo: "pako inflate (from Nodeca project)"
+};
+function Sr() {
+	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;
+}
+var Cr = Sr, wr = Object.prototype.toString, { Z_NO_FLUSH: Tr, Z_FINISH: Er, Z_OK: Dr, Z_STREAM_END: Or, Z_NEED_DICT: kr, Z_STREAM_ERROR: Ar, Z_DATA_ERROR: jr, Z_MEM_ERROR: Mr } = Ne;
+function Nr(e) {
+	this.options = Pt.assign({
+		chunkSize: 1024 * 64,
+		windowBits: 15,
+		to: ""
+	}, e || {});
+	let t = this.options;
+	t.raw && t.windowBits >= 0 && t.windowBits < 16 && (t.windowBits = -t.windowBits, t.windowBits === 0 && (t.windowBits = -15)), t.windowBits >= 0 && t.windowBits < 16 && !(e && e.windowBits) && (t.windowBits += 32), t.windowBits > 15 && t.windowBits < 48 && (t.windowBits & 15 || (t.windowBits |= 15)), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new Vt(), this.strm.avail_out = 0;
+	let n = $.inflateInit2(this.strm, t.windowBits);
+	if (n !== Dr || (this.header = new Cr(), $.inflateGetHeader(this.strm, this.header), t.dictionary && (typeof t.dictionary == "string" ? t.dictionary = zt.string2buf(t.dictionary) : wr.call(t.dictionary) === "[object ArrayBuffer]" && (t.dictionary = new Uint8Array(t.dictionary)), t.raw && (n = $.inflateSetDictionary(this.strm, t.dictionary), n !== Dr)))) throw Error(Me[n]);
+}
+Nr.prototype.push = function(e, t) {
+	let n = this.strm, r = this.options.chunkSize, i = this.options.dictionary, a, o, s;
+	if (this.ended) return !1;
+	for (o = t === ~~t ? t : t === !0 ? Er : Tr, wr.call(e) === "[object ArrayBuffer]" ? n.input = new Uint8Array(e) : n.input = e, n.next_in = 0, n.avail_in = n.input.length;;) {
+		for (n.avail_out === 0 && (n.output = new Uint8Array(r), n.next_out = 0, n.avail_out = r), a = $.inflate(n, o), a === kr && i && (a = $.inflateSetDictionary(n, i), a === Dr ? a = $.inflate(n, o) : a === jr && (a = kr)); n.avail_in > 0 && a === Or && n.state.wrap > 0 && e[n.next_in] !== 0;) $.inflateReset(n), a = $.inflate(n, o);
+		switch (a) {
+			case Ar:
+			case jr:
+			case kr:
+			case Mr: return this.onEnd(a), this.ended = !0, !1;
+		}
+		if (s = n.avail_out, n.next_out && (n.avail_out === 0 || a === Or)) if (this.options.to === "string") {
+			let e = zt.utf8border(n.output, n.next_out), t = n.next_out - e, i = zt.buf2string(n.output, e);
+			n.next_out = t, n.avail_out = r - t, t && n.output.set(n.output.subarray(e, e + t), 0), this.onData(i);
+		} else this.onData(n.output.length === n.next_out ? n.output : n.output.subarray(0, n.next_out));
+		if (!(a === Dr && s === 0)) {
+			if (a === Or) return a = $.inflateEnd(this.strm), this.onEnd(a), this.ended = !0, !0;
+			if (n.avail_in === 0) break;
+		}
+	}
+	return !0;
+}, Nr.prototype.onData = function(e) {
+	this.chunks.push(e);
+}, Nr.prototype.onEnd = function(e) {
+	e === Dr && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = Pt.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
+};
+function Pr(e, t) {
+	let n = new Nr(t);
+	if (n.push(e), n.err) throw n.msg || Me[n.err];
+	return n.result;
+}
+function Fr(e, t) {
+	return t ||= {}, t.raw = !0, Pr(e, t);
+}
+var Ir = {
+	Inflate: Nr,
+	inflate: Pr,
+	inflateRaw: Fr,
+	ungzip: Pr,
+	constants: Ne
+}, { Deflate: Lr, deflate: Rr, deflateRaw: zr, gzip: Br } = nn, { Inflate: Vr, inflate: Hr, inflateRaw: Ur, ungzip: Wr } = Ir, Gr = Lr, Kr = Rr, qr = zr, Jr = Br, Yr = Vr, Xr = Hr, Zr = Ur, Qr = Wr, $r = Ne, ei = {
+	Deflate: Gr,
+	deflate: Kr,
+	deflateRaw: qr,
+	gzip: Jr,
+	Inflate: Yr,
+	inflate: Xr,
+	inflateRaw: Zr,
+	ungzip: Qr,
+	constants: $r
+};
+//#endregion
+export { Kr as deflate_1$2, Xr as inflate_1$2, t as pako_exports };
+/* 独立思考，明辨是非 */