file-viewer3 1.0.8 → 1.0.26

package/dist/components/UmdViewer.js

@@ -0,0 +1,1873 @@
+import { n as e, t } from "./defineProperty.js";
+import { n, t as r } from "./asyncToGenerator.js";
+import { t as i } from "./_plugin-vue_export-helper.js";
+import { Fragment as a, computed as o, createCommentVNode as s, createElementBlock as c, createElementVNode as l, defineComponent as u, nextTick as d, normalizeClass as f, onBeforeUnmount as p, onMounted as m, openBlock as h, ref as g, renderList as _, toDisplayString as v } from "vue";
+//#region node_modules/.pnpm/pako@2.1.0/node_modules/pako/dist/pako.esm.mjs
+n();
+var y = 4, b = 0, x = 1, S = 2;
+function C(e) {
+	let t = e.length;
+	for (; --t >= 0;) e[t] = 0;
+}
+var w = 0, T = 1, E = 2, D = 29, O = 256, ee = 286, k = 30, A = 19, te = 573, ne = 15, re = 16, ie = 7, ae = 256, oe = 16, se = 17, ce = 18, le = 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
+]), ue = 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
+]), de = new Uint8Array([
+	0,
+	0,
+	0,
+	0,
+	0,
+	0,
+	0,
+	0,
+	0,
+	0,
+	0,
+	0,
+	0,
+	0,
+	0,
+	0,
+	2,
+	3,
+	7
+]), fe = new Uint8Array([
+	16,
+	17,
+	18,
+	0,
+	8,
+	7,
+	9,
+	6,
+	10,
+	5,
+	11,
+	4,
+	12,
+	3,
+	13,
+	2,
+	14,
+	1,
+	15
+]), pe = 512, j = Array(288 * 2);
+C(j);
+var me = Array(k * 2);
+C(me);
+var he = Array(pe);
+C(he);
+var ge = Array(256);
+C(ge);
+var _e = Array(D);
+C(_e);
+var ve = Array(k);
+C(ve);
+function ye(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 be, xe, Se;
+function Ce(e, t) {
+	this.dyn_tree = e, this.max_code = 0, this.stat_desc = t;
+}
+var we = (e) => e < 256 ? he[e] : he[256 + (e >>> 7)], Te = (e, t) => {
+	e.pending_buf[e.pending++] = t & 255, e.pending_buf[e.pending++] = t >>> 8 & 255;
+}, M = (e, t, n) => {
+	e.bi_valid > re - n ? (e.bi_buf |= t << e.bi_valid & 65535, Te(e, e.bi_buf), e.bi_buf = t >> re - e.bi_valid, e.bi_valid += n - re) : (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]);
+}, Ee = (e, t) => {
+	let n = 0;
+	do
+		n |= e & 1, e >>>= 1, n <<= 1;
+	while (--t > 0);
+	return n >>> 1;
+}, De = (e) => {
+	e.bi_valid === 16 ? (Te(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);
+}, Oe = (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, h = 0;
+	for (f = 0; f <= ne; f++) e.bl_count[f] = 0;
+	for (n[e.heap[e.heap_max] * 2 + 1] = 0, l = e.heap_max + 1; l < te; l++) u = e.heap[l], f = n[n[u * 2 + 1] * 2 + 1] + 1, f > c && (f = c, h++), 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 (h !== 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]--, h -= 2;
+		} while (h > 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--);
+	}
+}, ke = (e, t, n) => {
+	let r = Array(16), i = 0, a, o;
+	for (a = 1; a <= ne; a++) i = i + n[a - 1] << 1, r[a] = i;
+	for (o = 0; o <= t; o++) {
+		let t = e[o * 2 + 1];
+		t !== 0 && (e[o * 2] = Ee(r[t]++, t));
+	}
+}, Ae = () => {
+	let e, t, n, r, i, a = Array(16);
+	for (n = 0, r = 0; r < D - 1; r++) for (_e[r] = n, e = 0; e < 1 << le[r]; e++) ge[n++] = r;
+	for (ge[n - 1] = r, i = 0, r = 0; r < 16; r++) for (ve[r] = i, e = 0; e < 1 << ue[r]; e++) he[i++] = r;
+	for (i >>= 7; r < k; r++) for (ve[r] = i << 7, e = 0; e < 1 << ue[r] - 7; e++) he[256 + i++] = r;
+	for (t = 0; t <= ne; t++) a[t] = 0;
+	for (e = 0; e <= 143;) j[e * 2 + 1] = 8, e++, a[8]++;
+	for (; e <= 255;) j[e * 2 + 1] = 9, e++, a[9]++;
+	for (; e <= 279;) j[e * 2 + 1] = 7, e++, a[7]++;
+	for (; e <= 287;) j[e * 2 + 1] = 8, e++, a[8]++;
+	for (ke(j, 287, a), e = 0; e < k; e++) me[e * 2 + 1] = 5, me[e * 2] = Ee(e, 5);
+	be = new ye(j, le, 257, ee, ne), xe = new ye(me, ue, 0, k, ne), Se = new ye([], de, 0, A, ie);
+}, je = (e) => {
+	let t;
+	for (t = 0; t < ee; t++) e.dyn_ltree[t * 2] = 0;
+	for (t = 0; t < k; t++) e.dyn_dtree[t * 2] = 0;
+	for (t = 0; t < A; t++) e.bl_tree[t * 2] = 0;
+	e.dyn_ltree[ae * 2] = 1, e.opt_len = e.static_len = 0, e.sym_next = e.matches = 0;
+}, Me = (e) => {
+	e.bi_valid > 8 ? Te(e, e.bi_buf) : e.bi_valid > 0 && (e.pending_buf[e.pending++] = e.bi_buf), e.bi_buf = 0, e.bi_valid = 0;
+}, Ne = (e, t, n, r) => {
+	let i = t * 2, a = n * 2;
+	return e[i] < e[a] || e[i] === e[a] && r[t] <= r[n];
+}, Pe = (e, t, n) => {
+	let r = e.heap[n], i = n << 1;
+	for (; i <= e.heap_len && (i < e.heap_len && Ne(t, e.heap[i + 1], e.heap[i], e.depth) && i++, !Ne(t, r, e.heap[i], e.depth));) e.heap[n] = e.heap[i], n = i, i <<= 1;
+	e.heap[n] = r;
+}, Fe = (e, t, n) => {
+	let r, i, a = 0, o, s;
+	if (e.sym_next !== 0) do
+		r = e.pending_buf[e.sym_buf + a++] & 255, r += (e.pending_buf[e.sym_buf + a++] & 255) << 8, i = e.pending_buf[e.sym_buf + a++], r === 0 ? N(e, i, t) : (o = ge[i], N(e, o + O + 1, t), s = le[o], s !== 0 && (i -= _e[o], M(e, i, s)), r--, o = we(r), N(e, o, n), s = ue[o], s !== 0 && (r -= ve[o], M(e, r, s)));
+	while (a < e.sym_next);
+	N(e, ae, t);
+}, Ie = (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 = te, 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--) Pe(e, n, o);
+	l = a;
+	do
+		o = e.heap[1], e.heap[1] = e.heap[e.heap_len--], Pe(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++, Pe(e, n, 1);
+	while (e.heap_len >= 2);
+	e.heap[--e.heap_max] = e.heap[1], Oe(e, t), ke(n, c, e.bl_count);
+}, Le = (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[se * 2]++ : e.bl_tree[ce * 2]++ : (a !== i && e.bl_tree[a * 2]++, e.bl_tree[oe * 2]++), s = 0, i = a, o === 0 ? (c = 138, l = 3) : a === o ? (c = 6, l = 3) : (c = 7, l = 4));
+}, Re = (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, se, e.bl_tree), M(e, s - 3, 3)) : (N(e, ce, e.bl_tree), M(e, s - 11, 7)) : (a !== i && (N(e, a, e.bl_tree), s--), N(e, oe, 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);
+	}
+}, ze = (e) => {
+	let t;
+	for (Le(e, e.dyn_ltree, e.l_desc.max_code), Le(e, e.dyn_dtree, e.d_desc.max_code), Ie(e, e.bl_desc), t = A - 1; t >= 3 && e.bl_tree[fe[t] * 2 + 1] === 0; t--);
+	return e.opt_len += 3 * (t + 1) + 5 + 5 + 4, t;
+}, Be = (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[fe[i] * 2 + 1], 3);
+	Re(e, e.dyn_ltree, t - 1), Re(e, e.dyn_dtree, n - 1);
+}, Ve = (e) => {
+	let t = 4093624447, n;
+	for (n = 0; n <= 31; n++, t >>>= 1) if (t & 1 && e.dyn_ltree[n * 2] !== 0) return b;
+	if (e.dyn_ltree[18] !== 0 || e.dyn_ltree[20] !== 0 || e.dyn_ltree[26] !== 0) return x;
+	for (n = 32; n < O; n++) if (e.dyn_ltree[n * 2] !== 0) return x;
+	return b;
+}, He = !1, Ue = (e) => {
+	He || (Ae(), He = !0), e.l_desc = new Ce(e.dyn_ltree, be), e.d_desc = new Ce(e.dyn_dtree, xe), e.bl_desc = new Ce(e.bl_tree, Se), e.bi_buf = 0, e.bi_valid = 0, je(e);
+}, We = (e, t, n, r) => {
+	M(e, (w << 1) + +!!r, 3), Me(e), Te(e, n), Te(e, ~n), n && e.pending_buf.set(e.window.subarray(t, t + n), e.pending), e.pending += n;
+}, Ge = {
+	_tr_init: Ue,
+	_tr_stored_block: We,
+	_tr_flush_block: (e, t, n, r) => {
+		let i, a, o = 0;
+		e.level > 0 ? (e.strm.data_type === S && (e.strm.data_type = Ve(e)), Ie(e, e.l_desc), Ie(e, e.d_desc), o = ze(e), i = e.opt_len + 3 + 7 >>> 3, a = e.static_len + 3 + 7 >>> 3, a <= i && (i = a)) : i = a = n + 5, n + 4 <= i && t !== -1 ? We(e, t, n, r) : e.strategy === y || a === i ? (M(e, (T << 1) + +!!r, 3), Fe(e, j, me)) : (M(e, (E << 1) + +!!r, 3), Be(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, o + 1), Fe(e, e.dyn_ltree, e.dyn_dtree)), je(e), r && Me(e);
+	},
+	_tr_tally: (e, t, n) => (e.pending_buf[e.sym_buf + e.sym_next++] = t, e.pending_buf[e.sym_buf + e.sym_next++] = t >> 8, e.pending_buf[e.sym_buf + e.sym_next++] = n, t === 0 ? e.dyn_ltree[n * 2]++ : (e.matches++, t--, e.dyn_ltree[(ge[n] + O + 1) * 2]++, e.dyn_dtree[we(t) * 2]++), e.sym_next === e.sym_end),
+	_tr_align: (e) => {
+		M(e, T << 1, 3), N(e, ae, j), De(e);
+	}
+}, Ke = (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;
+}, qe = new Uint32Array((() => {
+	let e, t = [];
+	for (var n = 0; n < 256; n++) {
+		e = n;
+		for (var r = 0; r < 8; r++) e = e & 1 ? 3988292384 ^ e >>> 1 : e >>> 1;
+		t[n] = e;
+	}
+	return t;
+})()), P = (e, t, n, r) => {
+	let i = qe, a = r + n;
+	e ^= -1;
+	for (let n = r; n < a; n++) e = e >>> 8 ^ i[(e ^ t[n]) & 255];
+	return e ^ -1;
+}, Je = {
+	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"
+}, Ye = {
+	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: Xe, _tr_stored_block: Ze, _tr_flush_block: Qe, _tr_tally: F, _tr_align: $e } = Ge, { Z_NO_FLUSH: I, Z_PARTIAL_FLUSH: et, Z_FULL_FLUSH: tt, Z_FINISH: L, Z_BLOCK: nt, Z_OK: R, Z_STREAM_END: rt, Z_STREAM_ERROR: z, Z_DATA_ERROR: it, Z_BUF_ERROR: at, Z_DEFAULT_COMPRESSION: ot, Z_FILTERED: st, Z_HUFFMAN_ONLY: ct, Z_RLE: lt, Z_FIXED: ut, Z_DEFAULT_STRATEGY: dt, Z_UNKNOWN: ft, Z_DEFLATED: pt } = Ye, mt = 9, ht = 15, gt = 8, _t = 573, B = 3, vt = 258, V = 262, yt = 32, bt = 42, xt = 57, St = 69, Ct = 73, wt = 91, Tt = 103, Et = 113, Dt = 666, H = 1, Ot = 2, kt = 3, At = 4, jt = 3, Mt = (e, t) => (e.msg = Je[t], t), Nt = (e) => e * 2 - (e > 4 ? 9 : 0), U = (e) => {
+	let t = e.length;
+	for (; --t >= 0;) e[t] = 0;
+}, Pt = (e) => {
+	let t, n, r, i = e.w_size;
+	t = e.hash_size, r = t;
+	do
+		n = e.head[--r], e.head[r] = n >= i ? n - i : 0;
+	while (--t);
+	t = i, r = t;
+	do
+		n = e.prev[--r], e.prev[r] = n >= i ? n - i : 0;
+	while (--t);
+}, Ft = (e, t, n) => (t << e.hash_shift ^ n) & e.hash_mask, W = (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));
+}, G = (e, t) => {
+	Qe(e, e.block_start >= 0 ? e.block_start : -1, e.strstart - e.block_start, t), e.block_start = e.strstart, W(e.strm);
+}, K = (e, t) => {
+	e.pending_buf[e.pending++] = t;
+}, It = (e, t) => {
+	e.pending_buf[e.pending++] = t >>> 8 & 255, e.pending_buf[e.pending++] = t & 255;
+}, Lt = (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 = Ke(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);
+}, Rt = (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 + vt, 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 = vt - (f - r), r = f - vt, 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;
+}, zt = (e) => {
+	let t = e.w_size, n, r, i;
+	do {
+		if (r = e.window_size - e.lookahead - e.strstart, e.strstart >= t + (t - V) && (e.window.set(e.window.subarray(t, t + t - r), 0), e.match_start -= t, e.strstart -= t, e.block_start -= t, e.insert > e.strstart && (e.insert = e.strstart), Pt(e), r += t), e.strm.avail_in === 0) break;
+		if (n = Lt(e.strm, e.window, e.strstart + e.lookahead, r), e.lookahead += n, e.lookahead + e.insert >= B) for (i = e.strstart - e.insert, e.ins_h = e.window[i], e.ins_h = Ft(e, e.ins_h, e.window[i + 1]); e.insert && (e.ins_h = Ft(e, e.ins_h, e.window[i + B - 1]), e.prev[i & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = i, i++, e.insert--, !(e.lookahead + e.insert < B)););
+	} while (e.lookahead < V && e.strm.avail_in !== 0);
+}, Bt = (e, t) => {
+	let n = e.pending_buf_size - 5 > e.w_size ? e.w_size : e.pending_buf_size - 5, r, i, a, o = 0, s = e.strm.avail_in;
+	do {
+		if (r = 65535, a = e.bi_valid + 42 >> 3, e.strm.avail_out < a || (a = e.strm.avail_out - a, i = e.strstart - e.block_start, r > i + e.strm.avail_in && (r = i + e.strm.avail_in), r > a && (r = a), r < n && (r === 0 && t !== L || t === I || r !== i + e.strm.avail_in))) break;
+		o = +(t === L && r === i + e.strm.avail_in), Ze(e, 0, 0, o), e.pending_buf[e.pending - 4] = r, e.pending_buf[e.pending - 3] = r >> 8, e.pending_buf[e.pending - 2] = ~r, e.pending_buf[e.pending - 1] = ~r >> 8, W(e.strm), i && (i > r && (i = r), e.strm.output.set(e.window.subarray(e.block_start, e.block_start + i), e.strm.next_out), e.strm.next_out += i, e.strm.avail_out -= i, e.strm.total_out += i, e.block_start += i, r -= i), r && (Lt(e.strm, e.strm.output, e.strm.next_out, r), e.strm.next_out += r, e.strm.avail_out -= r, e.strm.total_out += r);
+	} while (o === 0);
+	return s -= e.strm.avail_in, s && (s >= e.w_size ? (e.matches = 2, e.window.set(e.strm.input.subarray(e.strm.next_in - e.w_size, e.strm.next_in), 0), e.strstart = e.w_size, e.insert = e.strstart) : (e.window_size - e.strstart <= s && (e.strstart -= e.w_size, e.window.set(e.window.subarray(e.w_size, e.w_size + e.strstart), 0), e.matches < 2 && e.matches++, e.insert > e.strstart && (e.insert = e.strstart)), e.window.set(e.strm.input.subarray(e.strm.next_in - s, e.strm.next_in), e.strstart), e.strstart += s, e.insert += s > e.w_size - e.insert ? e.w_size - e.insert : s), e.block_start = e.strstart), e.high_water < e.strstart && (e.high_water = e.strstart), o ? At : t !== I && t !== L && e.strm.avail_in === 0 && e.strstart === e.block_start ? Ot : (a = e.window_size - e.strstart, e.strm.avail_in > a && e.block_start >= e.w_size && (e.block_start -= e.w_size, e.strstart -= e.w_size, e.window.set(e.window.subarray(e.w_size, e.w_size + e.strstart), 0), e.matches < 2 && e.matches++, a += e.w_size, e.insert > e.strstart && (e.insert = e.strstart)), a > e.strm.avail_in && (a = e.strm.avail_in), a && (Lt(e.strm, e.window, e.strstart, a), e.strstart += a, e.insert += a > e.w_size - e.insert ? e.w_size - e.insert : a), e.high_water < e.strstart && (e.high_water = e.strstart), a = e.bi_valid + 42 >> 3, a = e.pending_buf_size - a > 65535 ? 65535 : e.pending_buf_size - a, n = a > e.w_size ? e.w_size : a, i = e.strstart - e.block_start, (i >= n || (i || t === L) && t !== I && e.strm.avail_in === 0 && i <= a) && (r = i > a ? a : i, o = +(t === L && e.strm.avail_in === 0 && r === i), Ze(e, e.block_start, r, o), e.block_start += r, W(e.strm)), o ? kt : H);
+}, Vt = (e, t) => {
+	let n, r;
+	for (;;) {
+		if (e.lookahead < V) {
+			if (zt(e), e.lookahead < V && t === I) return H;
+			if (e.lookahead === 0) break;
+		}
+		if (n = 0, e.lookahead >= B && (e.ins_h = Ft(e, e.ins_h, e.window[e.strstart + B - 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 = Rt(e, n)), e.match_length >= B) if (r = F(e, e.strstart - e.match_start, e.match_length - B), e.lookahead -= e.match_length, e.match_length <= e.max_lazy_match && e.lookahead >= B) {
+			e.match_length--;
+			do
+				e.strstart++, e.ins_h = Ft(e, e.ins_h, e.window[e.strstart + B - 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 = Ft(e, e.ins_h, e.window[e.strstart + 1]);
+		else r = F(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++;
+		if (r && (G(e, !1), e.strm.avail_out === 0)) return H;
+	}
+	return e.insert = e.strstart < B - 1 ? e.strstart : B - 1, t === L ? (G(e, !0), e.strm.avail_out === 0 ? kt : At) : e.sym_next && (G(e, !1), e.strm.avail_out === 0) ? H : Ot;
+}, Ht = (e, t) => {
+	let n, r, i;
+	for (;;) {
+		if (e.lookahead < V) {
+			if (zt(e), e.lookahead < V && t === I) return H;
+			if (e.lookahead === 0) break;
+		}
+		if (n = 0, e.lookahead >= B && (e.ins_h = Ft(e, e.ins_h, e.window[e.strstart + B - 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 = B - 1, n !== 0 && e.prev_length < e.max_lazy_match && e.strstart - n <= e.w_size - V && (e.match_length = Rt(e, n), e.match_length <= 5 && (e.strategy === st || e.match_length === B && e.strstart - e.match_start > 4096) && (e.match_length = B - 1)), e.prev_length >= B && e.match_length <= e.prev_length) {
+			i = e.strstart + e.lookahead - B, r = F(e, e.strstart - 1 - e.prev_match, e.prev_length - B), e.lookahead -= e.prev_length - 1, e.prev_length -= 2;
+			do
+				++e.strstart <= i && (e.ins_h = Ft(e, e.ins_h, e.window[e.strstart + B - 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 = B - 1, e.strstart++, r && (G(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 && G(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]), e.match_available = 0), e.insert = e.strstart < B - 1 ? e.strstart : B - 1, t === L ? (G(e, !0), e.strm.avail_out === 0 ? kt : At) : e.sym_next && (G(e, !1), e.strm.avail_out === 0) ? H : Ot;
+}, Ut = (e, t) => {
+	let n, r, i, a, o = e.window;
+	for (;;) {
+		if (e.lookahead <= vt) {
+			if (zt(e), e.lookahead <= vt && t === I) return H;
+			if (e.lookahead === 0) break;
+		}
+		if (e.match_length = 0, e.lookahead >= B && e.strstart > 0 && (i = e.strstart - 1, r = o[i], r === o[++i] && r === o[++i] && r === o[++i])) {
+			a = e.strstart + vt;
+			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 = vt - (a - i), e.match_length > e.lookahead && (e.match_length = e.lookahead);
+		}
+		if (e.match_length >= B ? (n = F(e, 1, e.match_length - B), 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 && (G(e, !1), e.strm.avail_out === 0)) return H;
+	}
+	return e.insert = 0, t === L ? (G(e, !0), e.strm.avail_out === 0 ? kt : At) : e.sym_next && (G(e, !1), e.strm.avail_out === 0) ? H : Ot;
+}, Wt = (e, t) => {
+	let n;
+	for (;;) {
+		if (e.lookahead === 0 && (zt(e), e.lookahead === 0)) {
+			if (t === I) return H;
+			break;
+		}
+		if (e.match_length = 0, n = F(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++, n && (G(e, !1), e.strm.avail_out === 0)) return H;
+	}
+	return e.insert = 0, t === L ? (G(e, !0), e.strm.avail_out === 0 ? kt : At) : e.sym_next && (G(e, !1), e.strm.avail_out === 0) ? H : Ot;
+};
+function q(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 Gt = [
+	new q(0, 0, 0, 0, Bt),
+	new q(4, 4, 8, 4, Vt),
+	new q(4, 5, 16, 8, Vt),
+	new q(4, 6, 32, 32, Vt),
+	new q(4, 4, 16, 16, Ht),
+	new q(8, 16, 32, 32, Ht),
+	new q(8, 16, 128, 128, Ht),
+	new q(8, 32, 128, 256, Ht),
+	new q(32, 128, 258, 1024, Ht),
+	new q(32, 258, 258, 4096, Ht)
+], Kt = (e) => {
+	e.window_size = 2 * e.w_size, U(e.head), e.max_lazy_match = Gt[e.level].max_lazy, e.good_match = Gt[e.level].good_length, e.nice_match = Gt[e.level].nice_length, e.max_chain_length = Gt[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = B - 1, e.match_available = 0, e.ins_h = 0;
+};
+function qt() {
+	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 = pt, 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(_t * 2), this.dyn_dtree = new Uint16Array(122), this.bl_tree = new Uint16Array(78), U(this.dyn_ltree), U(this.dyn_dtree), U(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new Uint16Array(16), this.heap = new Uint16Array(573), U(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new Uint16Array(573), U(this.depth), this.sym_buf = 0, this.lit_bufsize = 0, this.sym_next = 0, this.sym_end = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
+}
+var Jt = (e) => {
+	if (!e) return 1;
+	let t = e.state;
+	return +(!t || t.strm !== e || t.status !== bt && t.status !== xt && t.status !== St && t.status !== Ct && t.status !== wt && t.status !== Tt && t.status !== Et && t.status !== Dt);
+}, Yt = (e) => {
+	if (Jt(e)) return Mt(e, z);
+	e.total_in = e.total_out = 0, e.data_type = ft;
+	let t = e.state;
+	return t.pending = 0, t.pending_out = 0, t.wrap < 0 && (t.wrap = -t.wrap), t.status = t.wrap === 2 ? xt : t.wrap ? bt : Et, e.adler = t.wrap === 2 ? 0 : 1, t.last_flush = -2, Xe(t), R;
+}, Xt = (e) => {
+	let t = Yt(e);
+	return t === R && Kt(e.state), t;
+}, Zt = (e, t) => Jt(e) || e.state.wrap !== 2 ? z : (e.state.gzhead = t, R), Qt = (e, t, n, r, i, a) => {
+	if (!e) return z;
+	let o = 1;
+	if (t === ot && (t = 6), r < 0 ? (o = 0, r = -r) : r > 15 && (o = 2, r -= 16), i < 1 || i > mt || n !== pt || r < 8 || r > 15 || t < 0 || t > 9 || a < 0 || a > ut || r === 8 && o !== 1) return Mt(e, z);
+	r === 8 && (r = 9);
+	let s = new qt();
+	return e.state = s, s.strm = e, s.status = bt, 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 + B - 1) / B), 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.sym_buf = s.lit_bufsize, s.sym_end = (s.lit_bufsize - 1) * 3, s.level = t, s.strategy = a, s.method = n, Xt(e);
+}, $t = {
+	deflateInit: (e, t) => Qt(e, t, pt, ht, gt, dt),
+	deflateInit2: Qt,
+	deflateReset: Xt,
+	deflateResetKeep: Yt,
+	deflateSetHeader: Zt,
+	deflate: (e, t) => {
+		if (Jt(e) || t > nt || t < 0) return e ? Mt(e, z) : z;
+		let n = e.state;
+		if (!e.output || e.avail_in !== 0 && !e.input || n.status === Dt && t !== L) return Mt(e, e.avail_out === 0 ? at : z);
+		let r = n.last_flush;
+		if (n.last_flush = t, n.pending !== 0) {
+			if (W(e), e.avail_out === 0) return n.last_flush = -1, R;
+		} else if (e.avail_in === 0 && Nt(t) <= Nt(r) && t !== L) return Mt(e, at);
+		if (n.status === Dt && e.avail_in !== 0) return Mt(e, at);
+		if (n.status === bt && n.wrap === 0 && (n.status = Et), n.status === bt) {
+			let t = pt + (n.w_bits - 8 << 4) << 8, r = -1;
+			if (r = n.strategy >= ct || n.level < 2 ? 0 : n.level < 6 ? 1 : n.level === 6 ? 2 : 3, t |= r << 6, n.strstart !== 0 && (t |= yt), t += 31 - t % 31, It(n, t), n.strstart !== 0 && (It(n, e.adler >>> 16), It(n, e.adler & 65535)), e.adler = 1, n.status = Et, W(e), n.pending !== 0) return n.last_flush = -1, R;
+		}
+		if (n.status === xt) {
+			if (e.adler = 0, K(n, 31), K(n, 139), K(n, 8), n.gzhead) K(n, +!!n.gzhead.text + (n.gzhead.hcrc ? 2 : 0) + (n.gzhead.extra ? 4 : 0) + (n.gzhead.name ? 8 : 0) + (n.gzhead.comment ? 16 : 0)), K(n, n.gzhead.time & 255), K(n, n.gzhead.time >> 8 & 255), K(n, n.gzhead.time >> 16 & 255), K(n, n.gzhead.time >> 24 & 255), K(n, n.level === 9 ? 2 : n.strategy >= ct || n.level < 2 ? 4 : 0), K(n, n.gzhead.os & 255), n.gzhead.extra && n.gzhead.extra.length && (K(n, n.gzhead.extra.length & 255), K(n, n.gzhead.extra.length >> 8 & 255)), n.gzhead.hcrc && (e.adler = P(e.adler, n.pending_buf, n.pending, 0)), n.gzindex = 0, n.status = St;
+			else if (K(n, 0), K(n, 0), K(n, 0), K(n, 0), K(n, 0), K(n, n.level === 9 ? 2 : n.strategy >= ct || n.level < 2 ? 4 : 0), K(n, jt), n.status = Et, W(e), n.pending !== 0) return n.last_flush = -1, R;
+		}
+		if (n.status === St) {
+			if (n.gzhead.extra) {
+				let t = n.pending, r = (n.gzhead.extra.length & 65535) - n.gzindex;
+				for (; n.pending + r > n.pending_buf_size;) {
+					let i = n.pending_buf_size - n.pending;
+					if (n.pending_buf.set(n.gzhead.extra.subarray(n.gzindex, n.gzindex + i), n.pending), n.pending = n.pending_buf_size, n.gzhead.hcrc && n.pending > t && (e.adler = P(e.adler, n.pending_buf, n.pending - t, t)), n.gzindex += i, W(e), n.pending !== 0) return n.last_flush = -1, R;
+					t = 0, r -= i;
+				}
+				let i = new Uint8Array(n.gzhead.extra);
+				n.pending_buf.set(i.subarray(n.gzindex, n.gzindex + r), n.pending), n.pending += r, n.gzhead.hcrc && n.pending > t && (e.adler = P(e.adler, n.pending_buf, n.pending - t, t)), n.gzindex = 0;
+			}
+			n.status = Ct;
+		}
+		if (n.status === Ct) {
+			if (n.gzhead.name) {
+				let t = n.pending, r;
+				do {
+					if (n.pending === n.pending_buf_size) {
+						if (n.gzhead.hcrc && n.pending > t && (e.adler = P(e.adler, n.pending_buf, n.pending - t, t)), W(e), n.pending !== 0) return n.last_flush = -1, R;
+						t = 0;
+					}
+					r = n.gzindex < n.gzhead.name.length ? n.gzhead.name.charCodeAt(n.gzindex++) & 255 : 0, K(n, r);
+				} while (r !== 0);
+				n.gzhead.hcrc && n.pending > t && (e.adler = P(e.adler, n.pending_buf, n.pending - t, t)), n.gzindex = 0;
+			}
+			n.status = wt;
+		}
+		if (n.status === wt) {
+			if (n.gzhead.comment) {
+				let t = n.pending, r;
+				do {
+					if (n.pending === n.pending_buf_size) {
+						if (n.gzhead.hcrc && n.pending > t && (e.adler = P(e.adler, n.pending_buf, n.pending - t, t)), W(e), n.pending !== 0) return n.last_flush = -1, R;
+						t = 0;
+					}
+					r = n.gzindex < n.gzhead.comment.length ? n.gzhead.comment.charCodeAt(n.gzindex++) & 255 : 0, K(n, r);
+				} while (r !== 0);
+				n.gzhead.hcrc && n.pending > t && (e.adler = P(e.adler, n.pending_buf, n.pending - t, t));
+			}
+			n.status = Tt;
+		}
+		if (n.status === Tt) {
+			if (n.gzhead.hcrc) {
+				if (n.pending + 2 > n.pending_buf_size && (W(e), n.pending !== 0)) return n.last_flush = -1, R;
+				K(n, e.adler & 255), K(n, e.adler >> 8 & 255), e.adler = 0;
+			}
+			if (n.status = Et, W(e), n.pending !== 0) return n.last_flush = -1, R;
+		}
+		if (e.avail_in !== 0 || n.lookahead !== 0 || t !== I && n.status !== Dt) {
+			let r = n.level === 0 ? Bt(n, t) : n.strategy === ct ? Wt(n, t) : n.strategy === lt ? Ut(n, t) : Gt[n.level].func(n, t);
+			if ((r === kt || r === At) && (n.status = Dt), r === H || r === kt) return e.avail_out === 0 && (n.last_flush = -1), R;
+			if (r === Ot && (t === et ? $e(n) : t !== nt && (Ze(n, 0, 0, !1), t === tt && (U(n.head), n.lookahead === 0 && (n.strstart = 0, n.block_start = 0, n.insert = 0))), W(e), e.avail_out === 0)) return n.last_flush = -1, R;
+		}
+		return t === L ? n.wrap <= 0 ? rt : (n.wrap === 2 ? (K(n, e.adler & 255), K(n, e.adler >> 8 & 255), K(n, e.adler >> 16 & 255), K(n, e.adler >> 24 & 255), K(n, e.total_in & 255), K(n, e.total_in >> 8 & 255), K(n, e.total_in >> 16 & 255), K(n, e.total_in >> 24 & 255)) : (It(n, e.adler >>> 16), It(n, e.adler & 65535)), W(e), n.wrap > 0 && (n.wrap = -n.wrap), n.pending === 0 ? rt : R) : R;
+	},
+	deflateEnd: (e) => {
+		if (Jt(e)) return z;
+		let t = e.state.status;
+		return e.state = null, t === Et ? Mt(e, it) : R;
+	},
+	deflateSetDictionary: (e, t) => {
+		let n = t.length;
+		if (Jt(e)) return z;
+		let r = e.state, i = r.wrap;
+		if (i === 2 || i === 1 && r.status !== bt || r.lookahead) return z;
+		if (i === 1 && (e.adler = Ke(e.adler, t, n, 0)), r.wrap = 0, n >= r.w_size) {
+			i === 0 && (U(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, zt(r); r.lookahead >= B;) {
+			let e = r.strstart, t = r.lookahead - (B - 1);
+			do
+				r.ins_h = Ft(r, r.ins_h, r.window[e + B - 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 = B - 1, zt(r);
+		}
+		return r.strstart += r.lookahead, r.block_start = r.strstart, r.insert = r.lookahead, r.lookahead = 0, r.match_length = r.prev_length = B - 1, r.match_available = 0, e.next_in = o, e.input = s, e.avail_in = a, r.wrap = i, R;
+	},
+	deflateInfo: "pako deflate (from Nodeca project)"
+}, en = (e, t) => Object.prototype.hasOwnProperty.call(e, t), tn = {
+	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) en(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;
+	}
+}, nn = !0;
+try {
+	String.fromCharCode.apply(null, new Uint8Array(1));
+} catch (e) {
+	nn = !1;
+}
+var rn = new Uint8Array(256);
+for (let e = 0; e < 256; e++) rn[e] = e >= 252 ? 6 : e >= 248 ? 5 : e >= 240 ? 4 : e >= 224 ? 3 : e >= 192 ? 2 : 1;
+rn[254] = rn[254] = 1;
+var an = (e) => {
+	if (typeof TextEncoder == "function" && TextEncoder.prototype.encode) return new TextEncoder().encode(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;
+}, on = (e, t) => {
+	if (t < 65534 && e.subarray && nn) 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;
+}, sn = {
+	string2buf: an,
+	buf2string: (e, t) => {
+		let n = t || e.length;
+		if (typeof TextDecoder == "function" && TextDecoder.prototype.decode) return new TextDecoder().decode(e.subarray(0, t));
+		let r, i, a = Array(n * 2);
+		for (i = 0, r = 0; r < n;) {
+			let t = e[r++];
+			if (t < 128) {
+				a[i++] = t;
+				continue;
+			}
+			let o = rn[t];
+			if (o > 4) {
+				a[i++] = 65533, r += o - 1;
+				continue;
+			}
+			for (t &= o === 2 ? 31 : o === 3 ? 15 : 7; o > 1 && r < n;) t = t << 6 | e[r++] & 63, o--;
+			if (o > 1) {
+				a[i++] = 65533;
+				continue;
+			}
+			t < 65536 ? a[i++] = t : (t -= 65536, a[i++] = 55296 | t >> 10 & 1023, a[i++] = 56320 | t & 1023);
+		}
+		return on(a, i);
+	},
+	utf8border: (e, t) => {
+		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 + rn[e[n]] > t ? n : t;
+	}
+};
+function cn() {
+	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 ln = cn, un = Object.prototype.toString, { Z_NO_FLUSH: dn, Z_SYNC_FLUSH: fn, Z_FULL_FLUSH: pn, Z_FINISH: mn, Z_OK: hn, Z_STREAM_END: gn, Z_DEFAULT_COMPRESSION: _n, Z_DEFAULT_STRATEGY: vn, Z_DEFLATED: yn } = Ye;
+function bn(e) {
+	this.options = tn.assign({
+		level: _n,
+		method: yn,
+		chunkSize: 16384,
+		windowBits: 15,
+		memLevel: 8,
+		strategy: vn
+	}, 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 ln(), this.strm.avail_out = 0;
+	let n = $t.deflateInit2(this.strm, t.level, t.method, t.windowBits, t.memLevel, t.strategy);
+	if (n !== hn) throw Error(Je[n]);
+	if (t.header && $t.deflateSetHeader(this.strm, t.header), t.dictionary) {
+		let e;
+		if (e = typeof t.dictionary == "string" ? sn.string2buf(t.dictionary) : un.call(t.dictionary) === "[object ArrayBuffer]" ? new Uint8Array(t.dictionary) : t.dictionary, n = $t.deflateSetDictionary(this.strm, e), n !== hn) throw Error(Je[n]);
+		this._dict_set = !0;
+	}
+}
+bn.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 ? mn : dn, typeof e == "string" ? n.input = sn.string2buf(e) : un.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 === fn || a === pn) && n.avail_out <= 6) {
+			this.onData(n.output.subarray(0, n.next_out)), n.avail_out = 0;
+			continue;
+		}
+		if (i = $t.deflate(n, a), i === gn) return n.next_out > 0 && this.onData(n.output.subarray(0, n.next_out)), i = $t.deflateEnd(this.strm), this.onEnd(i), this.ended = !0, i === hn;
+		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;
+}, bn.prototype.onData = function(e) {
+	this.chunks.push(e);
+}, bn.prototype.onEnd = function(e) {
+	e === hn && (this.result = tn.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
+};
+function xn(e, t) {
+	let n = new bn(t);
+	if (n.push(e, !0), n.err) throw n.msg || Je[n.err];
+	return n.result;
+}
+function Sn(e, t) {
+	return t = t || {}, t.raw = !0, xn(e, t);
+}
+function Cn(e, t) {
+	return t = t || {}, t.gzip = !0, xn(e, t);
+}
+var wn = {
+	Deflate: bn,
+	deflate: xn,
+	deflateRaw: Sn,
+	gzip: Cn,
+	constants: Ye
+}, Tn = 16209, En = 16191, Dn = 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 = Tn;
+							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 = Tn;
+								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 = Tn;
+						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 = En;
+				break top;
+			} else {
+				e.msg = "invalid literal/length code", E.mode = Tn;
+				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;
+}, On = 15, kn = 852, An = 592, jn = 0, Mn = 1, Nn = 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
+]), Fn = 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
+]), In = 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
+]), Ln = 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
+]), Rn = (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, E = new Uint16Array(16), D = new Uint16Array(16), O = null, ee, k, A;
+	for (l = 0; l <= On; l++) E[l] = 0;
+	for (u = 0; u < r; u++) E[t[n + u]]++;
+	for (p = c, f = On; f >= 1 && E[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 && E[d] === 0; d++);
+	for (p < d && (p = d), g = 1, l = 1; l <= On; l++) if (g <<= 1, g -= E[l], g < 0) return -1;
+	if (g > 0 && (e === jn || f !== 1)) return -1;
+	for (D[1] = 0, l = 1; l < On; l++) D[l + 1] = D[l] + E[l];
+	for (u = 0; u < r; u++) t[n + u] !== 0 && (o[D[t[n + u]]++] = u);
+	if (e === jn ? (w = O = o, T = 20) : e === Mn ? (w = Pn, O = Fn, T = 257) : (w = In, O = Ln, T = 0), v = 0, u = 0, l = d, C = a, m = p, h = 0, x = -1, _ = 1 << p, S = _ - 1, e === Mn && _ > kn || e === Nn && _ > An) return 1;
+	for (;;) {
+		ee = l - h, o[u] + 1 < T ? (k = 0, A = o[u]) : o[u] >= T ? (k = O[o[u] - T], A = w[o[u] - T]) : (k = 96, A = 0), y = 1 << l - h, b = 1 << m, d = b;
+		do
+			b -= y, i[C + (v >> h) + b] = ee << 24 | k << 16 | A | 0;
+		while (b !== 0);
+		for (y = 1 << l - 1; v & y;) y >>= 1;
+		if (y === 0 ? v = 0 : (v &= y - 1, v += y), u++, --E[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 -= E[m + h], !(g <= 0));) m++, g <<= 1;
+			if (_ += 1 << m, e === Mn && _ > kn || e === Nn && _ > An) 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;
+}, zn = 0, Bn = 1, Vn = 2, { Z_FINISH: Hn, Z_BLOCK: Un, Z_TREES: Wn, Z_OK: Gn, Z_STREAM_END: Kn, Z_NEED_DICT: qn, Z_STREAM_ERROR: J, Z_DATA_ERROR: Jn, Z_MEM_ERROR: Yn, Z_BUF_ERROR: Xn, Z_DEFLATED: Zn } = Ye, Qn = 16180, $n = 16181, er = 16182, tr = 16183, nr = 16184, rr = 16185, ir = 16186, ar = 16187, or = 16188, sr = 16189, cr = 16190, Y = 16191, lr = 16192, ur = 16193, dr = 16194, fr = 16195, pr = 16196, mr = 16197, hr = 16198, gr = 16199, _r = 16200, vr = 16201, yr = 16202, br = 16203, xr = 16204, Sr = 16205, Cr = 16206, wr = 16207, Tr = 16208, X = 16209, Er = 16210, Dr = 16211, Or = 852, kr = 592, Ar = 15, jr = (e) => (e >>> 24 & 255) + (e >>> 8 & 65280) + ((e & 65280) << 8) + ((e & 255) << 24);
+function Mr() {
+	this.strm = null, this.mode = 0, this.last = !1, this.wrap = 0, this.havedict = !1, this.flags = 0, this.dmax = 0, this.check = 0, this.total = 0, this.head = null, this.wbits = 0, this.wsize = 0, this.whave = 0, this.wnext = 0, this.window = null, this.hold = 0, this.bits = 0, this.length = 0, this.offset = 0, this.extra = 0, this.lencode = null, this.distcode = null, this.lenbits = 0, this.distbits = 0, this.ncode = 0, this.nlen = 0, this.ndist = 0, this.have = 0, this.next = null, this.lens = new Uint16Array(320), this.work = new Uint16Array(288), this.lendyn = null, this.distdyn = null, this.sane = 0, this.back = 0, this.was = 0;
+}
+var Nr = (e) => {
+	if (!e) return 1;
+	let t = e.state;
+	return +(!t || t.strm !== e || t.mode < Qn || t.mode > Dr);
+}, Pr = (e) => {
+	if (Nr(e)) return J;
+	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 = Qn, t.last = 0, t.havedict = 0, t.flags = -1, t.dmax = 32768, t.head = null, t.hold = 0, t.bits = 0, t.lencode = t.lendyn = new Int32Array(Or), t.distcode = t.distdyn = new Int32Array(kr), t.sane = 1, t.back = -1, Gn;
+}, Fr = (e) => {
+	if (Nr(e)) return J;
+	let t = e.state;
+	return t.wsize = 0, t.whave = 0, t.wnext = 0, Pr(e);
+}, Ir = (e, t) => {
+	let n;
+	if (Nr(e)) return J;
+	let r = e.state;
+	return t < 0 ? (n = 0, t = -t) : (n = (t >> 4) + 5, t < 48 && (t &= 15)), t && (t < 8 || t > 15) ? J : (r.window !== null && r.wbits !== t && (r.window = null), r.wrap = n, r.wbits = t, Fr(e));
+}, Lr = (e, t) => {
+	if (!e) return J;
+	let n = new Mr();
+	e.state = n, n.strm = e, n.window = null, n.mode = Qn;
+	let r = Ir(e, t);
+	return r !== Gn && (e.state = null), r;
+}, Rr = (e) => Lr(e, Ar), zr = !0, Br, Vr, Hr = (e) => {
+	if (zr) {
+		Br = new Int32Array(512), Vr = 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 (Rn(Bn, e.lens, 0, 288, Br, 0, e.work, { bits: 9 }), t = 0; t < 32;) e.lens[t++] = 5;
+		Rn(Vn, e.lens, 0, 32, Vr, 0, e.work, { bits: 5 }), zr = !1;
+	}
+	e.lencode = Br, e.lenbits = 9, e.distcode = Vr, e.distbits = 5;
+}, Ur = (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;
+}, Z = {
+	inflateReset: Fr,
+	inflateReset2: Ir,
+	inflateResetKeep: Pr,
+	inflateInit: Rr,
+	inflateInit2: Lr,
+	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 = 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 (Nr(e) || !e.output || !e.input && e.avail_in !== 0) return J;
+		n = e.state, n.mode === Y && (n.mode = lr), 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 = Gn;
+		inf_leave: for (;;) switch (n.mode) {
+			case Qn:
+				if (n.wrap === 0) {
+					n.mode = lr;
+					break;
+				}
+				for (; u < 16;) {
+					if (s === 0) break inf_leave;
+					s--, l += r[a++] << u, u += 8;
+				}
+				if (n.wrap & 2 && l === 35615) {
+					n.wbits === 0 && (n.wbits = 15), 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 = $n;
+					break;
+				}
+				if (n.head && (n.head.done = !1), !(n.wrap & 1) || (((l & 255) << 8) + (l >> 8)) % 31) {
+					e.msg = "incorrect header check", n.mode = X;
+					break;
+				}
+				if ((l & 15) !== Zn) {
+					e.msg = "unknown compression method", n.mode = X;
+					break;
+				}
+				if (l >>>= 4, u -= 4, C = (l & 15) + 8, n.wbits === 0 && (n.wbits = C), C > 15 || C > n.wbits) {
+					e.msg = "invalid window size", n.mode = X;
+					break;
+				}
+				n.dmax = 1 << n.wbits, n.flags = 0, e.adler = n.check = 1, n.mode = l & 512 ? sr : Y, l = 0, u = 0;
+				break;
+			case $n:
+				for (; u < 16;) {
+					if (s === 0) break inf_leave;
+					s--, l += r[a++] << u, u += 8;
+				}
+				if (n.flags = l, (n.flags & 255) !== Zn) {
+					e.msg = "unknown compression method", n.mode = X;
+					break;
+				}
+				if (n.flags & 57344) {
+					e.msg = "unknown header flags set", n.mode = X;
+					break;
+				}
+				n.head && (n.head.text = l >> 8 & 1), n.flags & 512 && n.wrap & 4 && (T[0] = l & 255, T[1] = l >>> 8 & 255, n.check = P(n.check, T, 2, 0)), l = 0, u = 0, n.mode = er;
+			case er:
+				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 && n.wrap & 4 && (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 = tr;
+			case tr:
+				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 && n.wrap & 4 && (T[0] = l & 255, T[1] = l >>> 8 & 255, n.check = P(n.check, T, 2, 0)), l = 0, u = 0, n.mode = nr;
+			case nr:
+				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 && n.wrap & 4 && (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 = rr;
+			case rr:
+				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.wrap & 4 && (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 = ir;
+			case ir:
+				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.wrap & 4 && (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 = ar;
+			case ar:
+				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.wrap & 4 && (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 = or;
+			case or:
+				if (n.flags & 512) {
+					for (; u < 16;) {
+						if (s === 0) break inf_leave;
+						s--, l += r[a++] << u, u += 8;
+					}
+					if (n.wrap & 4 && l !== (n.check & 65535)) {
+						e.msg = "header crc mismatch", n.mode = X;
+						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 = Y;
+				break;
+			case sr:
+				for (; u < 32;) {
+					if (s === 0) break inf_leave;
+					s--, l += r[a++] << u, u += 8;
+				}
+				e.adler = n.check = jr(l), l = 0, u = 0, n.mode = cr;
+			case cr:
+				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, qn;
+				e.adler = n.check = 1, n.mode = Y;
+			case Y: if (t === Un || t === Wn) break inf_leave;
+			case lr:
+				if (n.last) {
+					l >>>= u & 7, u -= u & 7, n.mode = Cr;
+					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 = ur;
+						break;
+					case 1:
+						if (Hr(n), n.mode = gr, t === Wn) {
+							l >>>= 2, u -= 2;
+							break inf_leave;
+						}
+						break;
+					case 2:
+						n.mode = pr;
+						break;
+					case 3: e.msg = "invalid block type", n.mode = X;
+				}
+				l >>>= 2, u -= 2;
+				break;
+			case ur:
+				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 = X;
+					break;
+				}
+				if (n.length = l & 65535, l = 0, u = 0, n.mode = dr, t === Wn) break inf_leave;
+			case dr: n.mode = fr;
+			case fr:
+				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 = Y;
+				break;
+			case pr:
+				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 = X;
+					break;
+				}
+				n.have = 0, n.mode = mr;
+			case mr:
+				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 = Rn(zn, n.lens, 0, 19, n.lencode, 0, n.work, E), n.lenbits = E.bits, w) {
+					e.msg = "invalid code lengths set", n.mode = X;
+					break;
+				}
+				n.have = 0, n.mode = hr;
+			case hr:
+				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 = X;
+								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 = X;
+							break;
+						}
+						for (; p--;) n.lens[n.have++] = C;
+					}
+				}
+				if (n.mode === X) break;
+				if (n.lens[256] === 0) {
+					e.msg = "invalid code -- missing end-of-block", n.mode = X;
+					break;
+				}
+				if (n.lenbits = 9, E = { bits: n.lenbits }, w = Rn(Bn, n.lens, 0, n.nlen, n.lencode, 0, n.work, E), n.lenbits = E.bits, w) {
+					e.msg = "invalid literal/lengths set", n.mode = X;
+					break;
+				}
+				if (n.distbits = 6, n.distcode = n.distdyn, E = { bits: n.distbits }, w = Rn(Vn, n.lens, n.nlen, n.ndist, n.distcode, 0, n.work, E), n.distbits = E.bits, w) {
+					e.msg = "invalid distances set", n.mode = X;
+					break;
+				}
+				if (n.mode = gr, t === Wn) break inf_leave;
+			case gr: n.mode = _r;
+			case _r:
+				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, Dn(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 === Y && (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 = Sr;
+					break;
+				}
+				if (v & 32) {
+					n.back = -1, n.mode = Y;
+					break;
+				}
+				if (v & 64) {
+					e.msg = "invalid literal/length code", n.mode = X;
+					break;
+				}
+				n.extra = v & 15, n.mode = vr;
+			case vr:
+				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 = yr;
+			case yr:
+				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 = X;
+					break;
+				}
+				n.offset = y, n.extra = v & 15, n.mode = br;
+			case br:
+				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 = X;
+					break;
+				}
+				n.mode = xr;
+			case xr:
+				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 = X;
+						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 = _r);
+				break;
+			case Sr:
+				if (c === 0) break inf_leave;
+				i[o++] = n.length, c--, n.mode = _r;
+				break;
+			case Cr:
+				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, n.wrap & 4 && f && (e.adler = n.check = n.flags ? P(n.check, i, f, o - f) : Ke(n.check, i, f, o - f)), f = c, n.wrap & 4 && (n.flags ? l : jr(l)) !== n.check) {
+						e.msg = "incorrect data check", n.mode = X;
+						break;
+					}
+					l = 0, u = 0;
+				}
+				n.mode = wr;
+			case wr:
+				if (n.wrap && n.flags) {
+					for (; u < 32;) {
+						if (s === 0) break inf_leave;
+						s--, l += r[a++] << u, u += 8;
+					}
+					if (n.wrap & 4 && l !== (n.total & 4294967295)) {
+						e.msg = "incorrect length check", n.mode = X;
+						break;
+					}
+					l = 0, u = 0;
+				}
+				n.mode = Tr;
+			case Tr:
+				w = Kn;
+				break inf_leave;
+			case X:
+				w = Jn;
+				break inf_leave;
+			case Er: return Yn;
+			case Dr:
+			default: return J;
+		}
+		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 < X && (n.mode < Cr || t !== Hn)) && Ur(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 & 4 && f && (e.adler = n.check = n.flags ? P(n.check, i, f, e.next_out - f) : Ke(n.check, i, f, e.next_out - f)), e.data_type = n.bits + (n.last ? 64 : 0) + (n.mode === Y ? 128 : 0) + (n.mode === gr || n.mode === dr ? 256 : 0), (d === 0 && f === 0 || t === Hn) && w === Gn && (w = Xn), w;
+	},
+	inflateEnd: (e) => {
+		if (Nr(e)) return J;
+		let t = e.state;
+		return t.window && (t.window = null), e.state = null, Gn;
+	},
+	inflateGetHeader: (e, t) => {
+		if (Nr(e)) return J;
+		let n = e.state;
+		return n.wrap & 2 ? (n.head = t, t.done = !1, Gn) : J;
+	},
+	inflateSetDictionary: (e, t) => {
+		let n = t.length, r, i, a;
+		return Nr(e) || (r = e.state, r.wrap !== 0 && r.mode !== cr) ? J : r.mode === cr && (i = 1, i = Ke(i, t, n, 0), i !== r.check) ? Jn : (a = Ur(e, t, n, n), a ? (r.mode = Er, Yn) : (r.havedict = 1, Gn));
+	},
+	inflateInfo: "pako inflate (from Nodeca project)"
+};
+function Wr() {
+	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 Gr = Wr, Kr = Object.prototype.toString, { Z_NO_FLUSH: qr, Z_FINISH: Jr, Z_OK: Yr, Z_STREAM_END: Xr, Z_NEED_DICT: Zr, Z_STREAM_ERROR: Qr, Z_DATA_ERROR: $r, Z_MEM_ERROR: ei } = Ye;
+function ti(e) {
+	this.options = tn.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 ln(), this.strm.avail_out = 0;
+	let n = Z.inflateInit2(this.strm, t.windowBits);
+	if (n !== Yr || (this.header = new Gr(), Z.inflateGetHeader(this.strm, this.header), t.dictionary && (typeof t.dictionary == "string" ? t.dictionary = sn.string2buf(t.dictionary) : Kr.call(t.dictionary) === "[object ArrayBuffer]" && (t.dictionary = new Uint8Array(t.dictionary)), t.raw && (n = Z.inflateSetDictionary(this.strm, t.dictionary), n !== Yr)))) throw Error(Je[n]);
+}
+ti.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 ? Jr : qr, Kr.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 = Z.inflate(n, o), a === Zr && i && (a = Z.inflateSetDictionary(n, i), a === Yr ? a = Z.inflate(n, o) : a === $r && (a = Zr)); n.avail_in > 0 && a === Xr && n.state.wrap > 0 && e[n.next_in] !== 0;) Z.inflateReset(n), a = Z.inflate(n, o);
+		switch (a) {
+			case Qr:
+			case $r:
+			case Zr:
+			case ei: return this.onEnd(a), this.ended = !0, !1;
+		}
+		if (s = n.avail_out, n.next_out && (n.avail_out === 0 || a === Xr)) if (this.options.to === "string") {
+			let e = sn.utf8border(n.output, n.next_out), t = n.next_out - e, i = sn.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 === Yr && s === 0)) {
+			if (a === Xr) return a = Z.inflateEnd(this.strm), this.onEnd(a), this.ended = !0, !0;
+			if (n.avail_in === 0) break;
+		}
+	}
+	return !0;
+}, ti.prototype.onData = function(e) {
+	this.chunks.push(e);
+}, ti.prototype.onEnd = function(e) {
+	e === Yr && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = tn.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
+};
+function ni(e, t) {
+	let n = new ti(t);
+	if (n.push(e), n.err) throw n.msg || Je[n.err];
+	return n.result;
+}
+function ri(e, t) {
+	return t = t || {}, t.raw = !0, ni(e, t);
+}
+var ii = {
+	Inflate: ti,
+	inflate: ni,
+	inflateRaw: ri,
+	ungzip: ni,
+	constants: Ye
+}, { Deflate: ai, deflate: oi, deflateRaw: si, gzip: ci } = wn, { Inflate: li, inflate: ui, inflateRaw: di, ungzip: fi } = ii, pi = ui, mi = di;
+//#endregion
+//#region src/package/vendors/umd/parser.ts
+e();
+var hi = 3734674313, gi = 35, _i = 36, vi = 5, yi = new TextDecoder("utf-16le"), Q = {
+	VERSION: 1,
+	TITLE: 2,
+	AUTHOR: 3,
+	YEAR: 4,
+	MONTH: 5,
+	DAY: 6,
+	CATEGORY: 7,
+	PUBLISHER: 8,
+	VENDOR: 9,
+	CID: 10,
+	CONTENT_LENGTH: 11,
+	IMAGE: 14,
+	MIXED_IMAGE: 15,
+	TEXT_SEGMENT_INDEX: 129,
+	COVER: 130,
+	CHAPTER_OFFSETS: 131,
+	CHAPTER_TITLES: 132,
+	PAGE_OFFSETS: 135,
+	SPLASH: 241
+}, bi = class {
+	constructor(e) {
+		t(this, "view", void 0), t(this, "bytes", void 0), t(this, "offset", 0), this.bytes = new Uint8Array(e), this.view = new DataView(e);
+	}
+	get remaining() {
+		return this.bytes.length - this.offset;
+	}
+	peek() {
+		return this.remaining > 0 ? this.bytes[this.offset] : void 0;
+	}
+	readUint8() {
+		this.ensure(1);
+		let e = this.view.getUint8(this.offset);
+		return this.offset += 1, e;
+	}
+	readUint16() {
+		this.ensure(2);
+		let e = this.view.getUint16(this.offset, !0);
+		return this.offset += 2, e;
+	}
+	readUint32() {
+		this.ensure(4);
+		let e = this.view.getUint32(this.offset, !0);
+		return this.offset += 4, e;
+	}
+	readBytes(e) {
+		let t = Math.max(0, Math.min(e, this.remaining)), n = this.offset;
+		return this.offset += t, this.bytes.slice(n, n + t);
+	}
+	ensure(e) {
+		if (this.remaining < e) throw Error("UMD 文件结构不完整，读取时遇到意外结尾");
+	}
+}, xi = (e, t = 0) => e.length < t + 4 ? 0 : new DataView(e.buffer, e.byteOffset + t, 4).getUint32(0, !0), Si = (e) => e.length ? yi.decode(e) : "", $ = (e) => Si(e).replace(/\u0000+$/g, "").trim(), Ci = (e) => e.replace(/\u0000+$/g, "").replace(/\u2029/g, "\n").replace(/\r\n?/g, "\n"), wi = (e, t = 0) => {
+	let n = e.reduce((e, t) => e + t.length, 0), r = t > 0 ? Math.min(t, n) : n, i = new Uint8Array(r), a = 0;
+	for (let t of e) {
+		if (a >= r) break;
+		let e = t.subarray(0, Math.min(t.length, r - a));
+		i.set(e, a), a += e.length;
+	}
+	return i;
+}, Ti = (e) => {
+	try {
+		return pi(e);
+	} catch (t) {
+		return mi(e);
+	}
+}, Ei = (e) => {
+	let t = [], n = 0;
+	for (; n < e.length;) {
+		let r = e[n];
+		if (n += 1, !r || n + r > e.length) break;
+		t.push($(e.subarray(n, n + r))), n += r;
+	}
+	return t;
+}, Di = (e) => {
+	let t = [], n = new DataView(e.buffer, e.byteOffset, e.byteLength);
+	for (let r = 0; r + 4 <= e.length; r += 4) t.push(n.getUint32(r, !0));
+	return t;
+}, Oi = (e) => e.length >= 8 && e[0] === 137 && e[1] === 80 && e[2] === 78 && e[3] === 71 ? {
+	extension: "png",
+	mimeType: "image/png"
+} : e.length >= 3 && e[0] === 255 && e[1] === 216 && e[2] === 255 ? {
+	extension: "jpg",
+	mimeType: "image/jpeg"
+} : e.length >= 6 && e[0] === 71 && e[1] === 73 && e[2] === 70 ? {
+	extension: "gif",
+	mimeType: "image/gif"
+} : e.length >= 2 && e[0] === 66 && e[1] === 77 ? {
+	extension: "bmp",
+	mimeType: "image/bmp"
+} : e.length >= 12 && e[0] === 82 && e[1] === 73 && e[2] === 70 && e[3] === 70 && e[8] === 87 && e[9] === 69 && e[10] === 66 && e[11] === 80 ? {
+	extension: "webp",
+	mimeType: "image/webp"
+} : {
+	extension: "bin",
+	mimeType: "application/octet-stream"
+}, ki = (e, t, n) => {
+	let { extension: r, mimeType: i } = Oi(e);
+	return {
+		bytes: e,
+		extension: r,
+		id: `${t}-${n}-${e.length}`,
+		mimeType: i
+	};
+}, Ai = (e) => e === 1 ? "text" : e === 2 ? "comic" : e === 3 ? "mixed" : "unknown", ji = ({ day: e, month: t, year: n }) => [
+	n,
+	t,
+	e
+].filter(Boolean).join("-"), Mi = (e, t, n) => {
+	if (!e.length) return [];
+	let r = (t.length ? t : [0]).map((t) => Math.max(0, Math.min(t, e.length))).filter((e, t, n) => t === 0 || e > n[t - 1]);
+	return r.map((t, i) => {
+		let a = i + 1 < r.length ? r[i + 1] : e.length, o = t - t % 2, s = a - a % 2;
+		return {
+			content: Ci(Si(e.subarray(o, s))),
+			end: s,
+			id: `chapter-${i}-${o}`,
+			images: [],
+			start: o,
+			title: n[i] || `章节 ${i + 1}`
+		};
+	});
+}, Ni = (e, t, n) => {
+	if (!e.length) return [];
+	let r = (t.length ? t : [0]).map((t) => Math.max(0, Math.min(t, e.length))).filter((e, t, n) => t === 0 || e > n[t - 1]);
+	return r.map((t, i) => {
+		let a = i + 1 < r.length ? r[i + 1] : e.length;
+		return {
+			content: "",
+			end: a,
+			id: `image-chapter-${i}-${t}`,
+			images: e.slice(t, a),
+			start: t,
+			title: n[i] || `图集 ${i + 1}`
+		};
+	});
+}, Pi = (e) => e.map((e, t) => ({
+	content: "",
+	end: t,
+	id: `empty-chapter-${t}`,
+	images: [],
+	start: t,
+	title: e || `章节 ${t + 1}`
+})), Fi = (e) => {
+	let t = new bi(e), n = {
+		author: "",
+		category: "",
+		day: "",
+		month: "",
+		publishedAt: "",
+		publisher: "",
+		title: "",
+		vendor: "",
+		year: ""
+	}, r = /* @__PURE__ */ new Map(), i = [], a = [], o = [], s = 0, c = [], l = [], u = 0, d, f = 0;
+	if (t.readUint32() !== hi) throw Error("不是有效的 UMD 电子书文件");
+	for (; t.remaining > 0 && t.peek() === gi;) {
+		t.readUint8();
+		let e = t.readUint16(), i = t.readUint8(), p = Math.max(0, t.readUint8() - vi), m = t.readBytes(p), h = e === Q.CID || e === Q.SPLASH ? s : e;
+		switch (e) {
+			case Q.VERSION:
+				f = m[0] || i;
+				break;
+			case Q.TITLE:
+				n.title = $(m);
+				break;
+			case Q.AUTHOR:
+				n.author = $(m);
+				break;
+			case Q.YEAR:
+				n.year = $(m);
+				break;
+			case Q.MONTH:
+				n.month = $(m);
+				break;
+			case Q.DAY:
+				n.day = $(m);
+				break;
+			case Q.CATEGORY:
+				n.category = $(m);
+				break;
+			case Q.PUBLISHER:
+				n.publisher = $(m);
+				break;
+			case Q.VENDOR:
+				n.vendor = $(m);
+				break;
+			case Q.CONTENT_LENGTH:
+				u = xi(m);
+				break;
+			case Q.TEXT_SEGMENT_INDEX:
+			case Q.CHAPTER_OFFSETS:
+			case Q.CHAPTER_TITLES:
+			case Q.PAGE_OFFSETS:
+				r.set(e, xi(m));
+				break;
+			case Q.COVER:
+				r.set(e, xi(m, 1));
+				break;
+			case Q.IMAGE:
+			case Q.MIXED_IMAGE:
+				f = f || (e === Q.MIXED_IMAGE ? 3 : 2);
+				break;
+			default: break;
+		}
+		for (s = h || s; t.peek() === _i;) {
+			t.readUint8();
+			let e = t.readUint32(), n = Math.max(0, t.readUint32() - 9), i = t.readBytes(n);
+			switch (h) {
+				case Q.COVER:
+					d = ki(i, "cover", e);
+					break;
+				case Q.CHAPTER_OFFSETS:
+					c = Di(i);
+					break;
+				case Q.CHAPTER_TITLES:
+					e === r.get(Q.CHAPTER_TITLES) ? l = Ei(i) : a.push(i);
+					break;
+				case Q.IMAGE:
+				case Q.MIXED_IMAGE:
+					o.push(ki(i, "image", o.length));
+					break;
+				default: break;
+			}
+		}
+	}
+	let p = wi(a.map((e) => {
+		try {
+			return Ti(e);
+		} catch (e) {
+			return i.push(e instanceof Error ? e.message : String(e)), new Uint8Array();
+		}
+	}), u);
+	u > p.length && a.length && i.push("UMD 正文长度小于声明长度，文件可能不完整");
+	let m = Mi(p, c, l);
+	return m.length ? o.length && f !== 1 && (m = Ni(o, c, l)) : m = Ni(o, c, l), !m.length && l.length && (m = Pi(l)), n.publishedAt = ji(n), {
+		author: n.author,
+		category: n.category,
+		chapters: m,
+		contentLength: u || p.length,
+		cover: d,
+		kind: Ai(f),
+		publishedAt: n.publishedAt,
+		publisher: n.publisher,
+		rawType: f,
+		title: n.title || "UMD 电子书",
+		vendor: n.vendor,
+		warnings: i
+	};
+}, Ii = { class: "umd-toolbar" }, Li = { class: "umd-title" }, Ri = { class: "umd-actions" }, zi = ["disabled"], Bi = { class: "umd-progress" }, Vi = ["disabled"], Hi = { class: "umd-body" }, Ui = {
+	key: 0,
+	class: "umd-toc"
+}, Wi = { class: "umd-toc-head" }, Gi = { class: "umd-toc-list" }, Ki = ["onClick"], qi = { class: "umd-stage-wrap" }, Ji = {
+	key: 0,
+	class: "umd-book-head"
+}, Yi = ["src", "alt"], Xi = { key: 0 }, Zi = { key: 1 }, Qi = {
+	key: 1,
+	class: "umd-chapter"
+}, $i = {
+	key: 0,
+	class: "umd-image-list"
+}, ea = ["src", "alt"], ta = ["textContent"], na = {
+	key: 2,
+	class: "umd-empty"
+}, ra = {
+	key: 2,
+	class: "umd-warning"
+}, ia = {
+	key: 0,
+	class: "umd-state"
+}, aa = {
+	key: 1,
+	class: "umd-state error"
+}, oa = /*#__PURE__*/ i(/* @__PURE__ */ u({
+	__name: "UmdViewer",
+	props: { data: {} },
+	setup(e) {
+		let t = e, n = g("loading"), i = g(""), u = g(!0), y = g(null), b = g(0), x = g(null), S = /* @__PURE__ */ new Map(), C = o(() => {
+			var e;
+			return (e = y.value) == null ? void 0 : e.chapters[b.value];
+		}), w = o(() => y.value ? [
+			y.value.author,
+			y.value.category,
+			y.value.publishedAt
+		].filter(Boolean).join(" / ") : ""), T = o(() => {
+			var e;
+			let t = ((e = y.value) == null ? void 0 : e.chapters.length) || 0;
+			return t ? `${b.value + 1}/${t}` : "0/0";
+		}), E = o(() => b.value <= 0), D = o(() => {
+			var e;
+			let t = ((e = y.value) == null ? void 0 : e.chapters.length) || 0;
+			return t === 0 || b.value >= t - 1;
+		}), O = o(() => {
+			var e;
+			return ((e = y.value) == null ? void 0 : e.warnings.filter(Boolean).join("；")) || "";
+		}), ee = (e) => {
+			let t = new Uint8Array(e.bytes.byteLength);
+			return t.set(e.bytes), t.buffer;
+		}, k = (e) => {
+			if (!e) return "";
+			let t = S.get(e.id);
+			if (t) return t;
+			let n = URL.createObjectURL(new Blob([ee(e)], { type: e.mimeType }));
+			return S.set(e.id, n), n;
+		}, A = o(() => {
+			var e;
+			return k((e = y.value) == null ? void 0 : e.cover);
+		}), te = o(() => {
+			var e;
+			return ((e = C.value) == null ? void 0 : e.images.map((e) => ({
+				image: e,
+				url: k(e)
+			}))) || [];
+		}), ne = () => {
+			S.forEach((e) => URL.revokeObjectURL(e)), S.clear();
+		}, re = function() {
+			var e = r(function* () {
+				var e;
+				yield d(), (e = x.value) == null || e.scrollTo({ top: 0 });
+			});
+			return function() {
+				return e.apply(this, arguments);
+			};
+		}(), ie = function() {
+			var e = r(function* (e) {
+				b.value = e, u.value = !1, yield re();
+			});
+			return function(t) {
+				return e.apply(this, arguments);
+			};
+		}(), ae = function() {
+			var e = r(function* () {
+				E.value || (--b.value, yield re());
+			});
+			return function() {
+				return e.apply(this, arguments);
+			};
+		}(), oe = function() {
+			var e = r(function* () {
+				D.value || (b.value += 1, yield re());
+			});
+			return function() {
+				return e.apply(this, arguments);
+			};
+		}();
+		return m(function() {
+			var e = r(function* () {
+				n.value = "loading", i.value = "", ne();
+				try {
+					yield d(), y.value = Fi(t.data.slice(0)), b.value = 0, n.value = "ready";
+				} catch (e) {
+					console.error(e), i.value = e instanceof Error ? e.message : String(e), n.value = "error";
+				}
+			});
+			return function() {
+				return e.apply(this, arguments);
+			};
+		}()), p(() => {
+			ne();
+		}), (e, t) => {
+			var r, o, d, p;
+			return h(), c("div", { class: f(["umd-viewer", { "umd-viewer--toc-hidden": !u.value }]) }, [l("div", Ii, [
+				l("button", {
+					type: "button",
+					class: f(["umd-icon-button", { active: u.value }]),
+					title: "目录",
+					onClick: t[0] || (t[0] = (e) => u.value = !u.value)
+				}, [...t[1] || (t[1] = [l("span", null, null, -1)])], 2),
+				l("div", Li, [l("strong", null, v(((r = y.value) == null ? void 0 : r.title) || "UMD 电子书"), 1), l("span", null, v(w.value || ((o = C.value) == null ? void 0 : o.title) || "阅读中"), 1)]),
+				l("div", Ri, [
+					l("button", {
+						type: "button",
+						class: "umd-button",
+						disabled: n.value !== "ready" || E.value,
+						onClick: ae
+					}, " 上一章 ", 8, zi),
+					l("span", Bi, v(T.value), 1),
+					l("button", {
+						type: "button",
+						class: "umd-button",
+						disabled: n.value !== "ready" || D.value,
+						onClick: oe
+					}, " 下一章 ", 8, Vi)
+				])
+			]), l("div", Hi, [u.value ? (h(), c("aside", Ui, [l("div", Wi, [t[2] || (t[2] = l("strong", null, "目录", -1)), l("span", null, v(((d = y.value) == null ? void 0 : d.chapters.length) || 0) + " 项", 1)]), l("div", Gi, [(h(!0), c(a, null, _((p = y.value) == null ? void 0 : p.chapters, (e, t) => (h(), c("button", {
+				key: e.id,
+				type: "button",
+				class: f(["umd-toc-item", { active: t === b.value }]),
+				onClick: (e) => ie(t)
+			}, v(e.title), 11, Ki))), 128))])])) : s("", !0), l("main", qi, [l("article", {
+				ref_key: "stage",
+				ref: x,
+				class: "umd-stage"
+			}, [
+				y.value && (A.value || w.value) ? (h(), c("header", Ji, [A.value ? (h(), c("img", {
+					key: 0,
+					src: A.value,
+					alt: y.value.title
+				}, null, 8, Yi)) : s("", !0), l("div", null, [
+					l("h1", null, v(y.value.title), 1),
+					w.value ? (h(), c("p", Xi, v(w.value), 1)) : s("", !0),
+					y.value.publisher || y.value.vendor ? (h(), c("p", Zi, v([y.value.publisher, y.value.vendor].filter(Boolean).join(" / ")), 1)) : s("", !0)
+				])])) : s("", !0),
+				C.value ? (h(), c("section", Qi, [
+					l("h2", null, v(C.value.title), 1),
+					te.value.length ? (h(), c("div", $i, [(h(!0), c(a, null, _(te.value, (e) => (h(), c("figure", { key: e.image.id }, [l("img", {
+						src: e.url,
+						alt: C.value.title
+					}, null, 8, ea)]))), 128))])) : s("", !0),
+					C.value.content ? (h(), c("div", {
+						key: 1,
+						class: "umd-text",
+						textContent: v(C.value.content)
+					}, null, 8, ta)) : te.value.length ? s("", !0) : (h(), c("div", na, "未解析到正文内容"))
+				])) : s("", !0),
+				O.value ? (h(), c("div", ra, v(O.value), 1)) : s("", !0)
+			], 512), n.value === "loading" ? (h(), c("div", ia, "正在解析 UMD...")) : n.value === "error" ? (h(), c("div", aa, v(i.value), 1)) : s("", !0)])])], 2);
+		};
+	}
+}), [["__scopeId", "data-v-79b242a1"]]);
+//#endregion
+export { oa as default };