pptx-vue-viewer 3.1.2 → 3.1.4

package/dist/UTIF-CzyZ61H3.cjs

@@ -0,0 +1,2846 @@
+const t = require("./rolldown-runtime-C7a0RdOx.cjs");
+var e = t.__commonJSMin((t) => {
+	var e = "undefined" != typeof Uint8Array && "undefined" != typeof Uint16Array && "undefined" != typeof Int32Array;
+	function r(t, e) {
+		return Object.prototype.hasOwnProperty.call(t, e);
+	}
+	t.assign = function(t) {
+		for (var e = Array.prototype.slice.call(arguments, 1); e.length;) {
+			var n = e.shift();
+			if (n) {
+				if ("object" != typeof n) throw new TypeError(n + "must be non-object");
+				for (var i in n) r(n, i) && (t[i] = n[i]);
+			}
+		}
+		return t;
+	}, t.shrinkBuf = function(t, e) {
+		return t.length === e ? t : t.subarray ? t.subarray(0, e) : (t.length = e, t);
+	};
+	var n = {
+		arraySet: function(t, e, r, n, i) {
+			if (e.subarray && t.subarray) t.set(e.subarray(r, r + n), i);
+			else for (var a = 0; a < n; a++) t[i + a] = e[r + a];
+		},
+		flattenChunks: function(t) {
+			var e, r, n, i, a, o;
+			for (n = 0, e = 0, r = t.length; e < r; e++) n += t[e].length;
+			for (o = new Uint8Array(n), i = 0, e = 0, r = t.length; e < r; e++) a = t[e], o.set(a, i), i += a.length;
+			return o;
+		}
+	}, i = {
+		arraySet: function(t, e, r, n, i) {
+			for (var a = 0; a < n; a++) t[i + a] = e[r + a];
+		},
+		flattenChunks: function(t) {
+			return [].concat.apply([], t);
+		}
+	};
+	t.setTyped = function(e) {
+		e ? (t.Buf8 = Uint8Array, t.Buf16 = Uint16Array, t.Buf32 = Int32Array, t.assign(t, n)) : (t.Buf8 = Array, t.Buf16 = Array, t.Buf32 = Array, t.assign(t, i));
+	}, t.setTyped(e);
+}), r = t.__commonJSMin((t) => {
+	var r = e();
+	function n(t) {
+		for (var e = t.length; --e >= 0;) t[e] = 0;
+	}
+	var i = 256, a = 286, o = 30, s = 15, h = [
+		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
+	], f = [
+		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
+	], l = [
+		0,
+		0,
+		0,
+		0,
+		0,
+		0,
+		0,
+		0,
+		0,
+		0,
+		0,
+		0,
+		0,
+		0,
+		0,
+		0,
+		2,
+		3,
+		7
+	], d = [
+		16,
+		17,
+		18,
+		0,
+		8,
+		7,
+		9,
+		6,
+		10,
+		5,
+		11,
+		4,
+		12,
+		3,
+		13,
+		2,
+		14,
+		1,
+		15
+	], u = new Array(576);
+	n(u);
+	var c = new Array(60);
+	n(c);
+	var _ = new Array(512);
+	n(_);
+	var g = new Array(256);
+	n(g);
+	var v = new Array(29);
+	n(v);
+	var w, b, p, m = new Array(o);
+	function k(t, e, r, n, i) {
+		this.static_tree = t, this.extra_bits = e, this.extra_base = r, this.elems = n, this.max_length = i, this.has_stree = t && t.length;
+	}
+	function y(t, e) {
+		this.dyn_tree = t, this.max_code = 0, this.stat_desc = e;
+	}
+	function x(t) {
+		return t < 256 ? _[t] : _[256 + (t >>> 7)];
+	}
+	function E(t, e) {
+		t.pending_buf[t.pending++] = 255 & e, t.pending_buf[t.pending++] = e >>> 8 & 255;
+	}
+	function z(t, e, r) {
+		t.bi_valid > 16 - r ? (t.bi_buf |= e << t.bi_valid & 65535, E(t, t.bi_buf), t.bi_buf = e >> 16 - t.bi_valid, t.bi_valid += r - 16) : (t.bi_buf |= e << t.bi_valid & 65535, t.bi_valid += r);
+	}
+	function B(t, e, r) {
+		z(t, r[2 * e], r[2 * e + 1]);
+	}
+	function A(t, e) {
+		var r = 0;
+		do
+			r |= 1 & t, t >>>= 1, r <<= 1;
+		while (--e > 0);
+		return r >>> 1;
+	}
+	function S(t, e, r) {
+		var n, i, a = new Array(16), o = 0;
+		for (n = 1; n <= s; n++) a[n] = o = o + r[n - 1] << 1;
+		for (i = 0; i <= e; i++) {
+			var h = t[2 * i + 1];
+			0 !== h && (t[2 * i] = A(a[h]++, h));
+		}
+	}
+	function U(t) {
+		var e;
+		for (e = 0; e < a; e++) t.dyn_ltree[2 * e] = 0;
+		for (e = 0; e < o; e++) t.dyn_dtree[2 * e] = 0;
+		for (e = 0; e < 19; e++) t.bl_tree[2 * e] = 0;
+		t.dyn_ltree[512] = 1, t.opt_len = t.static_len = 0, t.last_lit = t.matches = 0;
+	}
+	function I(t) {
+		t.bi_valid > 8 ? E(t, t.bi_buf) : t.bi_valid > 0 && (t.pending_buf[t.pending++] = t.bi_buf), t.bi_buf = 0, t.bi_valid = 0;
+	}
+	function D(t, e, r, n) {
+		var i = 2 * e, a = 2 * r;
+		return t[i] < t[a] || t[i] === t[a] && n[e] <= n[r];
+	}
+	function M(t, e, r) {
+		for (var n = t.heap[r], i = r << 1; i <= t.heap_len && (i < t.heap_len && D(e, t.heap[i + 1], t.heap[i], t.depth) && i++, !D(e, n, t.heap[i], t.depth));) t.heap[r] = t.heap[i], r = i, i <<= 1;
+		t.heap[r] = n;
+	}
+	function N(t, e, r) {
+		var n, a, o, s, l = 0;
+		if (0 !== t.last_lit) do
+			n = t.pending_buf[t.d_buf + 2 * l] << 8 | t.pending_buf[t.d_buf + 2 * l + 1], a = t.pending_buf[t.l_buf + l], l++, 0 === n ? B(t, a, e) : (B(t, (o = g[a]) + i + 1, e), 0 !== (s = h[o]) && z(t, a -= v[o], s), B(t, o = x(--n), r), 0 !== (s = f[o]) && z(t, n -= m[o], s));
+		while (l < t.last_lit);
+		B(t, 256, e);
+	}
+	function F(t, e) {
+		var r, n, i, a = e.dyn_tree, o = e.stat_desc.static_tree, h = e.stat_desc.has_stree, f = e.stat_desc.elems, l = -1;
+		for (t.heap_len = 0, t.heap_max = 573, r = 0; r < f; r++) 0 !== a[2 * r] ? (t.heap[++t.heap_len] = l = r, t.depth[r] = 0) : a[2 * r + 1] = 0;
+		for (; t.heap_len < 2;) a[2 * (i = t.heap[++t.heap_len] = l < 2 ? ++l : 0)] = 1, t.depth[i] = 0, t.opt_len--, h && (t.static_len -= o[2 * i + 1]);
+		for (e.max_code = l, r = t.heap_len >> 1; r >= 1; r--) M(t, a, r);
+		i = f;
+		do
+			r = t.heap[1], t.heap[1] = t.heap[t.heap_len--], M(t, a, 1), n = t.heap[1], t.heap[--t.heap_max] = r, t.heap[--t.heap_max] = n, a[2 * i] = a[2 * r] + a[2 * n], t.depth[i] = (t.depth[r] >= t.depth[n] ? t.depth[r] : t.depth[n]) + 1, a[2 * r + 1] = a[2 * n + 1] = i, t.heap[1] = i++, M(t, a, 1);
+		while (t.heap_len >= 2);
+		t.heap[--t.heap_max] = t.heap[1], function(t, e) {
+			var r, n, i, a, o, h, f = e.dyn_tree, l = e.max_code, d = e.stat_desc.static_tree, u = e.stat_desc.has_stree, c = e.stat_desc.extra_bits, _ = e.stat_desc.extra_base, g = e.stat_desc.max_length, v = 0;
+			for (a = 0; a <= s; a++) t.bl_count[a] = 0;
+			for (f[2 * t.heap[t.heap_max] + 1] = 0, r = t.heap_max + 1; r < 573; r++) (a = f[2 * f[2 * (n = t.heap[r]) + 1] + 1] + 1) > g && (a = g, v++), f[2 * n + 1] = a, n > l || (t.bl_count[a]++, o = 0, n >= _ && (o = c[n - _]), h = f[2 * n], t.opt_len += h * (a + o), u && (t.static_len += h * (d[2 * n + 1] + o)));
+			if (0 !== v) {
+				do {
+					for (a = g - 1; 0 === t.bl_count[a];) a--;
+					t.bl_count[a]--, t.bl_count[a + 1] += 2, t.bl_count[g]--, v -= 2;
+				} while (v > 0);
+				for (a = g; 0 !== a; a--) for (n = t.bl_count[a]; 0 !== n;) (i = t.heap[--r]) > l || (f[2 * i + 1] !== a && (t.opt_len += (a - f[2 * i + 1]) * f[2 * i], f[2 * i + 1] = a), n--);
+			}
+		}(t, e), S(a, l, t.bl_count);
+	}
+	function C(t, e, r) {
+		var n, i, a = -1, o = e[1], s = 0, h = 7, f = 4;
+		for (0 === o && (h = 138, f = 3), e[2 * (r + 1) + 1] = 65535, n = 0; n <= r; n++) i = o, o = e[2 * (n + 1) + 1], ++s < h && i === o || (s < f ? t.bl_tree[2 * i] += s : 0 !== i ? (i !== a && t.bl_tree[2 * i]++, t.bl_tree[32]++) : s <= 10 ? t.bl_tree[34]++ : t.bl_tree[36]++, s = 0, a = i, 0 === o ? (h = 138, f = 3) : i === o ? (h = 6, f = 3) : (h = 7, f = 4));
+	}
+	function O(t, e, r) {
+		var n, i, a = -1, o = e[1], s = 0, h = 7, f = 4;
+		for (0 === o && (h = 138, f = 3), n = 0; n <= r; n++) if (i = o, o = e[2 * (n + 1) + 1], !(++s < h && i === o)) {
+			if (s < f) do
+				B(t, i, t.bl_tree);
+			while (0 !== --s);
+			else 0 !== i ? (i !== a && (B(t, i, t.bl_tree), s--), B(t, 16, t.bl_tree), z(t, s - 3, 2)) : s <= 10 ? (B(t, 17, t.bl_tree), z(t, s - 3, 3)) : (B(t, 18, t.bl_tree), z(t, s - 11, 7));
+			s = 0, a = i, 0 === o ? (h = 138, f = 3) : i === o ? (h = 6, f = 3) : (h = 7, f = 4);
+		}
+	}
+	n(m);
+	var Z = !1;
+	function L(t, e, n, i) {
+		z(t, 0 + (i ? 1 : 0), 3), function(t, e, n, i) {
+			I(t), i && (E(t, n), E(t, ~n)), r.arraySet(t.pending_buf, t.window, e, n, t.pending), t.pending += n;
+		}(t, e, n, !0);
+	}
+	t._tr_init = function(t) {
+		Z || (function() {
+			var t, e, r, n, i, d = new Array(16);
+			for (r = 0, n = 0; n < 28; n++) for (v[n] = r, t = 0; t < 1 << h[n]; t++) g[r++] = n;
+			for (g[r - 1] = n, i = 0, n = 0; n < 16; n++) for (m[n] = i, t = 0; t < 1 << f[n]; t++) _[i++] = n;
+			for (i >>= 7; n < o; n++) for (m[n] = i << 7, t = 0; t < 1 << f[n] - 7; t++) _[256 + i++] = n;
+			for (e = 0; e <= s; e++) d[e] = 0;
+			for (t = 0; t <= 143;) u[2 * t + 1] = 8, t++, d[8]++;
+			for (; t <= 255;) u[2 * t + 1] = 9, t++, d[9]++;
+			for (; t <= 279;) u[2 * t + 1] = 7, t++, d[7]++;
+			for (; t <= 287;) u[2 * t + 1] = 8, t++, d[8]++;
+			for (S(u, 287, d), t = 0; t < o; t++) c[2 * t + 1] = 5, c[2 * t] = A(t, 5);
+			w = new k(u, h, 257, a, s), b = new k(c, f, 0, o, s), p = new k(new Array(0), l, 0, 19, 7);
+		}(), Z = !0), t.l_desc = new y(t.dyn_ltree, w), t.d_desc = new y(t.dyn_dtree, b), t.bl_desc = new y(t.bl_tree, p), t.bi_buf = 0, t.bi_valid = 0, U(t);
+	}, t._tr_stored_block = L, t._tr_flush_block = function(t, e, r, n) {
+		var a, o, s = 0;
+		t.level > 0 ? (2 === t.strm.data_type && (t.strm.data_type = function(t) {
+			var e, r = 4093624447;
+			for (e = 0; e <= 31; e++, r >>>= 1) if (1 & r && 0 !== t.dyn_ltree[2 * e]) return 0;
+			if (0 !== t.dyn_ltree[18] || 0 !== t.dyn_ltree[20] || 0 !== t.dyn_ltree[26]) return 1;
+			for (e = 32; e < i; e++) if (0 !== t.dyn_ltree[2 * e]) return 1;
+			return 0;
+		}(t)), F(t, t.l_desc), F(t, t.d_desc), s = function(t) {
+			var e;
+			for (C(t, t.dyn_ltree, t.l_desc.max_code), C(t, t.dyn_dtree, t.d_desc.max_code), F(t, t.bl_desc), e = 18; e >= 3 && 0 === t.bl_tree[2 * d[e] + 1]; e--);
+			return t.opt_len += 3 * (e + 1) + 5 + 5 + 4, e;
+		}(t), a = t.opt_len + 3 + 7 >>> 3, (o = t.static_len + 3 + 7 >>> 3) <= a && (a = o)) : a = o = r + 5, r + 4 <= a && -1 !== e ? L(t, e, r, n) : 4 === t.strategy || o === a ? (z(t, 2 + (n ? 1 : 0), 3), N(t, u, c)) : (z(t, 4 + (n ? 1 : 0), 3), function(t, e, r, n) {
+			var i;
+			for (z(t, e - 257, 5), z(t, r - 1, 5), z(t, n - 4, 4), i = 0; i < n; i++) z(t, t.bl_tree[2 * d[i] + 1], 3);
+			O(t, t.dyn_ltree, e - 1), O(t, t.dyn_dtree, r - 1);
+		}(t, t.l_desc.max_code + 1, t.d_desc.max_code + 1, s + 1), N(t, t.dyn_ltree, t.dyn_dtree)), U(t), n && I(t);
+	}, t._tr_tally = function(t, e, r) {
+		return t.pending_buf[t.d_buf + 2 * t.last_lit] = e >>> 8 & 255, t.pending_buf[t.d_buf + 2 * t.last_lit + 1] = 255 & e, t.pending_buf[t.l_buf + t.last_lit] = 255 & r, t.last_lit++, 0 === e ? t.dyn_ltree[2 * r]++ : (t.matches++, e--, t.dyn_ltree[2 * (g[r] + i + 1)]++, t.dyn_dtree[2 * x(e)]++), t.last_lit === t.lit_bufsize - 1;
+	}, t._tr_align = function(t) {
+		z(t, 2, 3), B(t, 256, u), function(t) {
+			16 === t.bi_valid ? (E(t, t.bi_buf), t.bi_buf = 0, t.bi_valid = 0) : t.bi_valid >= 8 && (t.pending_buf[t.pending++] = 255 & t.bi_buf, t.bi_buf >>= 8, t.bi_valid -= 8);
+		}(t);
+	};
+}), n = t.__commonJSMin((t, e) => {
+	e.exports = function(t, e, r, n) {
+		for (var i = 65535 & t, a = t >>> 16 & 65535, o = 0; 0 !== r;) {
+			r -= o = r > 2e3 ? 2e3 : r;
+			do
+				a = a + (i = i + e[n++] | 0) | 0;
+			while (--o);
+			i %= 65521, a %= 65521;
+		}
+		return i | a << 16;
+	};
+}), i = t.__commonJSMin((t, e) => {
+	var r = function() {
+		for (var t, e = [], r = 0; r < 256; r++) {
+			t = r;
+			for (var n = 0; n < 8; n++) t = 1 & t ? 3988292384 ^ t >>> 1 : t >>> 1;
+			e[r] = t;
+		}
+		return e;
+	}();
+	e.exports = function(t, e, n, i) {
+		var a = r, o = i + n;
+		t ^= -1;
+		for (var s = i; s < o; s++) t = t >>> 8 ^ a[255 & (t ^ e[s])];
+		return -1 ^ t;
+	};
+}), a = t.__commonJSMin((t, e) => {
+	e.exports = {
+		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"
+	};
+}), o = t.__commonJSMin((t) => {
+	var o, s = e(), h = r(), f = n(), l = i(), d = a(), u = -2, c = 258, _ = 262, g = 103, v = 113, w = 666;
+	function b(t, e) {
+		return t.msg = d[e], e;
+	}
+	function p(t) {
+		return (t << 1) - (t > 4 ? 9 : 0);
+	}
+	function m(t) {
+		for (var e = t.length; --e >= 0;) t[e] = 0;
+	}
+	function k(t) {
+		var e = t.state, r = e.pending;
+		r > t.avail_out && (r = t.avail_out), 0 !== r && (s.arraySet(t.output, e.pending_buf, e.pending_out, r, t.next_out), t.next_out += r, e.pending_out += r, t.total_out += r, t.avail_out -= r, e.pending -= r, 0 === e.pending && (e.pending_out = 0));
+	}
+	function y(t, e) {
+		h._tr_flush_block(t, t.block_start >= 0 ? t.block_start : -1, t.strstart - t.block_start, e), t.block_start = t.strstart, k(t.strm);
+	}
+	function x(t, e) {
+		t.pending_buf[t.pending++] = e;
+	}
+	function E(t, e) {
+		t.pending_buf[t.pending++] = e >>> 8 & 255, t.pending_buf[t.pending++] = 255 & e;
+	}
+	function z(t, e, r, n) {
+		var i = t.avail_in;
+		return i > n && (i = n), 0 === i ? 0 : (t.avail_in -= i, s.arraySet(e, t.input, t.next_in, i, r), 1 === t.state.wrap ? t.adler = f(t.adler, e, i, r) : 2 === t.state.wrap && (t.adler = l(t.adler, e, i, r)), t.next_in += i, t.total_in += i, i);
+	}
+	function B(t, e) {
+		var r, n, i = t.max_chain_length, a = t.strstart, o = t.prev_length, s = t.nice_match, h = t.strstart > t.w_size - _ ? t.strstart - (t.w_size - _) : 0, f = t.window, l = t.w_mask, d = t.prev, u = t.strstart + c, g = f[a + o - 1], v = f[a + o];
+		t.prev_length >= t.good_match && (i >>= 2), s > t.lookahead && (s = t.lookahead);
+		do
+			if (f[(r = e) + o] === v && f[r + o - 1] === g && f[r] === f[a] && f[++r] === f[a + 1]) {
+				a += 2, r++;
+				do				;
+while (f[++a] === f[++r] && f[++a] === f[++r] && f[++a] === f[++r] && f[++a] === f[++r] && f[++a] === f[++r] && f[++a] === f[++r] && f[++a] === f[++r] && f[++a] === f[++r] && a < u);
+				if (n = c - (u - a), a = u - c, n > o) {
+					if (t.match_start = e, o = n, n >= s) break;
+					g = f[a + o - 1], v = f[a + o];
+				}
+			}
+		while ((e = d[e & l]) > h && 0 !== --i);
+		return o <= t.lookahead ? o : t.lookahead;
+	}
+	function A(t) {
+		var e, r, n, i, a, o = t.w_size;
+		do {
+			if (i = t.window_size - t.lookahead - t.strstart, t.strstart >= o + (o - _)) {
+				s.arraySet(t.window, t.window, o, o, 0), t.match_start -= o, t.strstart -= o, t.block_start -= o, e = r = t.hash_size;
+				do
+					n = t.head[--e], t.head[e] = n >= o ? n - o : 0;
+				while (--r);
+				e = r = o;
+				do
+					n = t.prev[--e], t.prev[e] = n >= o ? n - o : 0;
+				while (--r);
+				i += o;
+			}
+			if (0 === t.strm.avail_in) break;
+			if (r = z(t.strm, t.window, t.strstart + t.lookahead, i), t.lookahead += r, t.lookahead + t.insert >= 3) for (a = t.strstart - t.insert, t.ins_h = t.window[a], t.ins_h = (t.ins_h << t.hash_shift ^ t.window[a + 1]) & t.hash_mask; t.insert && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[a + 3 - 1]) & t.hash_mask, t.prev[a & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = a, a++, t.insert--, !(t.lookahead + t.insert < 3)););
+		} while (t.lookahead < _ && 0 !== t.strm.avail_in);
+	}
+	function S(t, e) {
+		for (var r, n;;) {
+			if (t.lookahead < _) {
+				if (A(t), t.lookahead < _ && 0 === e) return 1;
+				if (0 === t.lookahead) break;
+			}
+			if (r = 0, t.lookahead >= 3 && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + 3 - 1]) & t.hash_mask, r = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart), 0 !== r && t.strstart - r <= t.w_size - _ && (t.match_length = B(t, r)), t.match_length >= 3) if (n = h._tr_tally(t, t.strstart - t.match_start, t.match_length - 3), t.lookahead -= t.match_length, t.match_length <= t.max_lazy_match && t.lookahead >= 3) {
+				t.match_length--;
+				do
+					t.strstart++, t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + 3 - 1]) & t.hash_mask, r = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart;
+				while (0 !== --t.match_length);
+				t.strstart++;
+			} else t.strstart += t.match_length, t.match_length = 0, t.ins_h = t.window[t.strstart], t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + 1]) & t.hash_mask;
+			else n = h._tr_tally(t, 0, t.window[t.strstart]), t.lookahead--, t.strstart++;
+			if (n && (y(t, !1), 0 === t.strm.avail_out)) return 1;
+		}
+		return t.insert = t.strstart < 2 ? t.strstart : 2, 4 === e ? (y(t, !0), 0 === t.strm.avail_out ? 3 : 4) : t.last_lit && (y(t, !1), 0 === t.strm.avail_out) ? 1 : 2;
+	}
+	function U(t, e) {
+		for (var r, n, i;;) {
+			if (t.lookahead < _) {
+				if (A(t), t.lookahead < _ && 0 === e) return 1;
+				if (0 === t.lookahead) break;
+			}
+			if (r = 0, t.lookahead >= 3 && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + 3 - 1]) & t.hash_mask, r = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart), t.prev_length = t.match_length, t.prev_match = t.match_start, t.match_length = 2, 0 !== r && t.prev_length < t.max_lazy_match && t.strstart - r <= t.w_size - _ && (t.match_length = B(t, r), t.match_length <= 5 && (1 === t.strategy || 3 === t.match_length && t.strstart - t.match_start > 4096) && (t.match_length = 2)), t.prev_length >= 3 && t.match_length <= t.prev_length) {
+				i = t.strstart + t.lookahead - 3, n = h._tr_tally(t, t.strstart - 1 - t.prev_match, t.prev_length - 3), t.lookahead -= t.prev_length - 1, t.prev_length -= 2;
+				do
+					++t.strstart <= i && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + 3 - 1]) & t.hash_mask, r = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart);
+				while (0 !== --t.prev_length);
+				if (t.match_available = 0, t.match_length = 2, t.strstart++, n && (y(t, !1), 0 === t.strm.avail_out)) return 1;
+			} else if (t.match_available) {
+				if ((n = h._tr_tally(t, 0, t.window[t.strstart - 1])) && y(t, !1), t.strstart++, t.lookahead--, 0 === t.strm.avail_out) return 1;
+			} else t.match_available = 1, t.strstart++, t.lookahead--;
+		}
+		return t.match_available && (n = h._tr_tally(t, 0, t.window[t.strstart - 1]), t.match_available = 0), t.insert = t.strstart < 2 ? t.strstart : 2, 4 === e ? (y(t, !0), 0 === t.strm.avail_out ? 3 : 4) : t.last_lit && (y(t, !1), 0 === t.strm.avail_out) ? 1 : 2;
+	}
+	function I(t, e, r, n, i) {
+		this.good_length = t, this.max_lazy = e, this.nice_length = r, this.max_chain = n, this.func = i;
+	}
+	function D() {
+		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 = 8, 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 s.Buf16(1146), this.dyn_dtree = new s.Buf16(122), this.bl_tree = new s.Buf16(78), m(this.dyn_ltree), m(this.dyn_dtree), m(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new s.Buf16(16), this.heap = new s.Buf16(573), m(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new s.Buf16(573), m(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;
+	}
+	function M(t) {
+		var e;
+		return t && t.state ? (t.total_in = t.total_out = 0, t.data_type = 2, (e = t.state).pending = 0, e.pending_out = 0, e.wrap < 0 && (e.wrap = -e.wrap), e.status = e.wrap ? 42 : v, t.adler = 2 === e.wrap ? 0 : 1, e.last_flush = 0, h._tr_init(e), 0) : b(t, u);
+	}
+	function N(t) {
+		var e, r = M(t);
+		return 0 === r && ((e = t.state).window_size = 2 * e.w_size, m(e.head), e.max_lazy_match = o[e.level].max_lazy, e.good_match = o[e.level].good_length, e.nice_match = o[e.level].nice_length, e.max_chain_length = o[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = 2, e.match_available = 0, e.ins_h = 0), r;
+	}
+	function F(t, e, r, n, i, a) {
+		if (!t) return u;
+		var o = 1;
+		if (-1 === e && (e = 6), n < 0 ? (o = 0, n = -n) : n > 15 && (o = 2, n -= 16), i < 1 || i > 9 || 8 !== r || n < 8 || n > 15 || e < 0 || e > 9 || a < 0 || a > 4) return b(t, u);
+		8 === n && (n = 9);
+		var h = new D();
+		return t.state = h, h.strm = t, h.wrap = o, h.gzhead = null, h.w_bits = n, h.w_size = 1 << h.w_bits, h.w_mask = h.w_size - 1, h.hash_bits = i + 7, h.hash_size = 1 << h.hash_bits, h.hash_mask = h.hash_size - 1, h.hash_shift = ~~((h.hash_bits + 3 - 1) / 3), h.window = new s.Buf8(2 * h.w_size), h.head = new s.Buf16(h.hash_size), h.prev = new s.Buf16(h.w_size), h.lit_bufsize = 1 << i + 6, h.pending_buf_size = 4 * h.lit_bufsize, h.pending_buf = new s.Buf8(h.pending_buf_size), h.d_buf = 1 * h.lit_bufsize, h.l_buf = 3 * h.lit_bufsize, h.level = e, h.strategy = a, h.method = r, N(t);
+	}
+	o = [
+		new I(0, 0, 0, 0, function(t, e) {
+			var r = 65535;
+			for (r > t.pending_buf_size - 5 && (r = t.pending_buf_size - 5);;) {
+				if (t.lookahead <= 1) {
+					if (A(t), 0 === t.lookahead && 0 === e) return 1;
+					if (0 === t.lookahead) break;
+				}
+				t.strstart += t.lookahead, t.lookahead = 0;
+				var n = t.block_start + r;
+				if ((0 === t.strstart || t.strstart >= n) && (t.lookahead = t.strstart - n, t.strstart = n, y(t, !1), 0 === t.strm.avail_out)) return 1;
+				if (t.strstart - t.block_start >= t.w_size - _ && (y(t, !1), 0 === t.strm.avail_out)) return 1;
+			}
+			return t.insert = 0, 4 === e ? (y(t, !0), 0 === t.strm.avail_out ? 3 : 4) : (t.strstart > t.block_start && (y(t, !1), t.strm.avail_out), 1);
+		}),
+		new I(4, 4, 8, 4, S),
+		new I(4, 5, 16, 8, S),
+		new I(4, 6, 32, 32, S),
+		new I(4, 4, 16, 16, U),
+		new I(8, 16, 32, 32, U),
+		new I(8, 16, 128, 128, U),
+		new I(8, 32, 128, 256, U),
+		new I(32, 128, 258, 1024, U),
+		new I(32, 258, 258, 4096, U)
+	], t.deflateInit = function(t, e) {
+		return F(t, e, 8, 15, 8, 0);
+	}, t.deflateInit2 = F, t.deflateReset = N, t.deflateResetKeep = M, t.deflateSetHeader = function(t, e) {
+		return t && t.state ? 2 !== t.state.wrap ? u : (t.state.gzhead = e, 0) : u;
+	}, t.deflate = function(t, e) {
+		var r, n, i, a;
+		if (!t || !t.state || e > 5 || e < 0) return t ? b(t, u) : u;
+		if (n = t.state, !t.output || !t.input && 0 !== t.avail_in || n.status === w && 4 !== e) return b(t, 0 === t.avail_out ? -5 : u);
+		if (n.strm = t, r = n.last_flush, n.last_flush = e, 42 === n.status) if (2 === n.wrap) t.adler = 0, x(n, 31), x(n, 139), x(n, 8), n.gzhead ? (x(n, (n.gzhead.text ? 1 : 0) + (n.gzhead.hcrc ? 2 : 0) + (n.gzhead.extra ? 4 : 0) + (n.gzhead.name ? 8 : 0) + (n.gzhead.comment ? 16 : 0)), x(n, 255 & n.gzhead.time), x(n, n.gzhead.time >> 8 & 255), x(n, n.gzhead.time >> 16 & 255), x(n, n.gzhead.time >> 24 & 255), x(n, 9 === n.level ? 2 : n.strategy >= 2 || n.level < 2 ? 4 : 0), x(n, 255 & n.gzhead.os), n.gzhead.extra && n.gzhead.extra.length && (x(n, 255 & n.gzhead.extra.length), x(n, n.gzhead.extra.length >> 8 & 255)), n.gzhead.hcrc && (t.adler = l(t.adler, n.pending_buf, n.pending, 0)), n.gzindex = 0, n.status = 69) : (x(n, 0), x(n, 0), x(n, 0), x(n, 0), x(n, 0), x(n, 9 === n.level ? 2 : n.strategy >= 2 || n.level < 2 ? 4 : 0), x(n, 3), n.status = v);
+		else {
+			var s = 8 + (n.w_bits - 8 << 4) << 8;
+			s |= (n.strategy >= 2 || n.level < 2 ? 0 : n.level < 6 ? 1 : 6 === n.level ? 2 : 3) << 6, 0 !== n.strstart && (s |= 32), s += 31 - s % 31, n.status = v, E(n, s), 0 !== n.strstart && (E(n, t.adler >>> 16), E(n, 65535 & t.adler)), t.adler = 1;
+		}
+		if (69 === n.status) if (n.gzhead.extra) {
+			for (i = n.pending; n.gzindex < (65535 & n.gzhead.extra.length) && (n.pending !== n.pending_buf_size || (n.gzhead.hcrc && n.pending > i && (t.adler = l(t.adler, n.pending_buf, n.pending - i, i)), k(t), i = n.pending, n.pending !== n.pending_buf_size));) x(n, 255 & n.gzhead.extra[n.gzindex]), n.gzindex++;
+			n.gzhead.hcrc && n.pending > i && (t.adler = l(t.adler, n.pending_buf, n.pending - i, i)), n.gzindex === n.gzhead.extra.length && (n.gzindex = 0, n.status = 73);
+		} else n.status = 73;
+		if (73 === n.status) if (n.gzhead.name) {
+			i = n.pending;
+			do {
+				if (n.pending === n.pending_buf_size && (n.gzhead.hcrc && n.pending > i && (t.adler = l(t.adler, n.pending_buf, n.pending - i, i)), k(t), i = n.pending, n.pending === n.pending_buf_size)) {
+					a = 1;
+					break;
+				}
+				a = n.gzindex < n.gzhead.name.length ? 255 & n.gzhead.name.charCodeAt(n.gzindex++) : 0, x(n, a);
+			} while (0 !== a);
+			n.gzhead.hcrc && n.pending > i && (t.adler = l(t.adler, n.pending_buf, n.pending - i, i)), 0 === a && (n.gzindex = 0, n.status = 91);
+		} else n.status = 91;
+		if (91 === n.status) if (n.gzhead.comment) {
+			i = n.pending;
+			do {
+				if (n.pending === n.pending_buf_size && (n.gzhead.hcrc && n.pending > i && (t.adler = l(t.adler, n.pending_buf, n.pending - i, i)), k(t), i = n.pending, n.pending === n.pending_buf_size)) {
+					a = 1;
+					break;
+				}
+				a = n.gzindex < n.gzhead.comment.length ? 255 & n.gzhead.comment.charCodeAt(n.gzindex++) : 0, x(n, a);
+			} while (0 !== a);
+			n.gzhead.hcrc && n.pending > i && (t.adler = l(t.adler, n.pending_buf, n.pending - i, i)), 0 === a && (n.status = g);
+		} else n.status = g;
+		if (n.status === g && (n.gzhead.hcrc ? (n.pending + 2 > n.pending_buf_size && k(t), n.pending + 2 <= n.pending_buf_size && (x(n, 255 & t.adler), x(n, t.adler >> 8 & 255), t.adler = 0, n.status = v)) : n.status = v), 0 !== n.pending) {
+			if (k(t), 0 === t.avail_out) return n.last_flush = -1, 0;
+		} else if (0 === t.avail_in && p(e) <= p(r) && 4 !== e) return b(t, -5);
+		if (n.status === w && 0 !== t.avail_in) return b(t, -5);
+		if (0 !== t.avail_in || 0 !== n.lookahead || 0 !== e && n.status !== w) {
+			var f = 2 === n.strategy ? function(t, e) {
+				for (var r;;) {
+					if (0 === t.lookahead && (A(t), 0 === t.lookahead)) {
+						if (0 === e) return 1;
+						break;
+					}
+					if (t.match_length = 0, r = h._tr_tally(t, 0, t.window[t.strstart]), t.lookahead--, t.strstart++, r && (y(t, !1), 0 === t.strm.avail_out)) return 1;
+				}
+				return t.insert = 0, 4 === e ? (y(t, !0), 0 === t.strm.avail_out ? 3 : 4) : t.last_lit && (y(t, !1), 0 === t.strm.avail_out) ? 1 : 2;
+			}(n, e) : 3 === n.strategy ? function(t, e) {
+				for (var r, n, i, a, o = t.window;;) {
+					if (t.lookahead <= c) {
+						if (A(t), t.lookahead <= c && 0 === e) return 1;
+						if (0 === t.lookahead) break;
+					}
+					if (t.match_length = 0, t.lookahead >= 3 && t.strstart > 0 && (n = o[i = t.strstart - 1]) === o[++i] && n === o[++i] && n === o[++i]) {
+						a = t.strstart + c;
+						do						;
+while (n === o[++i] && n === o[++i] && n === o[++i] && n === o[++i] && n === o[++i] && n === o[++i] && n === o[++i] && n === o[++i] && i < a);
+						t.match_length = c - (a - i), t.match_length > t.lookahead && (t.match_length = t.lookahead);
+					}
+					if (t.match_length >= 3 ? (r = h._tr_tally(t, 1, t.match_length - 3), t.lookahead -= t.match_length, t.strstart += t.match_length, t.match_length = 0) : (r = h._tr_tally(t, 0, t.window[t.strstart]), t.lookahead--, t.strstart++), r && (y(t, !1), 0 === t.strm.avail_out)) return 1;
+				}
+				return t.insert = 0, 4 === e ? (y(t, !0), 0 === t.strm.avail_out ? 3 : 4) : t.last_lit && (y(t, !1), 0 === t.strm.avail_out) ? 1 : 2;
+			}(n, e) : o[n.level].func(n, e);
+			if (3 !== f && 4 !== f || (n.status = w), 1 === f || 3 === f) return 0 === t.avail_out && (n.last_flush = -1), 0;
+			if (2 === f && (1 === e ? h._tr_align(n) : 5 !== e && (h._tr_stored_block(n, 0, 0, !1), 3 === e && (m(n.head), 0 === n.lookahead && (n.strstart = 0, n.block_start = 0, n.insert = 0))), k(t), 0 === t.avail_out)) return n.last_flush = -1, 0;
+		}
+		return 4 !== e ? 0 : n.wrap <= 0 ? 1 : (2 === n.wrap ? (x(n, 255 & t.adler), x(n, t.adler >> 8 & 255), x(n, t.adler >> 16 & 255), x(n, t.adler >> 24 & 255), x(n, 255 & t.total_in), x(n, t.total_in >> 8 & 255), x(n, t.total_in >> 16 & 255), x(n, t.total_in >> 24 & 255)) : (E(n, t.adler >>> 16), E(n, 65535 & t.adler)), k(t), n.wrap > 0 && (n.wrap = -n.wrap), 0 !== n.pending ? 0 : 1);
+	}, t.deflateEnd = function(t) {
+		var e;
+		return t && t.state ? 42 !== (e = t.state.status) && 69 !== e && 73 !== e && 91 !== e && e !== g && e !== v && e !== w ? b(t, u) : (t.state = null, e === v ? b(t, -3) : 0) : u;
+	}, t.deflateSetDictionary = function(t, e) {
+		var r, n, i, a, o, h, l, d, c = e.length;
+		if (!t || !t.state) return u;
+		if (2 === (a = (r = t.state).wrap) || 1 === a && 42 !== r.status || r.lookahead) return u;
+		for (1 === a && (t.adler = f(t.adler, e, c, 0)), r.wrap = 0, c >= r.w_size && (0 === a && (m(r.head), r.strstart = 0, r.block_start = 0, r.insert = 0), d = new s.Buf8(r.w_size), s.arraySet(d, e, c - r.w_size, r.w_size, 0), e = d, c = r.w_size), o = t.avail_in, h = t.next_in, l = t.input, t.avail_in = c, t.next_in = 0, t.input = e, A(r); r.lookahead >= 3;) {
+			n = r.strstart, i = r.lookahead - 2;
+			do
+				r.ins_h = (r.ins_h << r.hash_shift ^ r.window[n + 3 - 1]) & r.hash_mask, r.prev[n & r.w_mask] = r.head[r.ins_h], r.head[r.ins_h] = n, n++;
+			while (--i);
+			r.strstart = n, r.lookahead = 2, A(r);
+		}
+		return r.strstart += r.lookahead, r.block_start = r.strstart, r.insert = r.lookahead, r.lookahead = 0, r.match_length = r.prev_length = 2, r.match_available = 0, t.next_in = h, t.input = l, t.avail_in = o, r.wrap = a, 0;
+	}, t.deflateInfo = "pako deflate (from Nodeca project)";
+}), s = t.__commonJSMin((t) => {
+	var r = e(), n = !0, i = !0;
+	try {
+		String.fromCharCode.apply(null, [0]);
+	} catch (t) {
+		n = !1;
+	}
+	try {
+		String.fromCharCode.apply(null, /* @__PURE__ */ new Uint8Array(1));
+	} catch (t) {
+		i = !1;
+	}
+	for (var a = new r.Buf8(256), o = 0; o < 256; o++) a[o] = o >= 252 ? 6 : o >= 248 ? 5 : o >= 240 ? 4 : o >= 224 ? 3 : o >= 192 ? 2 : 1;
+	function s(t, e) {
+		if (e < 65534 && (t.subarray && i || !t.subarray && n)) return String.fromCharCode.apply(null, r.shrinkBuf(t, e));
+		for (var a = "", o = 0; o < e; o++) a += String.fromCharCode(t[o]);
+		return a;
+	}
+	a[254] = a[254] = 1, t.string2buf = function(t) {
+		var e, n, i, a, o, s = t.length, h = 0;
+		for (a = 0; a < s; a++) 55296 == (64512 & (n = t.charCodeAt(a))) && a + 1 < s && 56320 == (64512 & (i = t.charCodeAt(a + 1))) && (n = 65536 + (n - 55296 << 10) + (i - 56320), a++), h += n < 128 ? 1 : n < 2048 ? 2 : n < 65536 ? 3 : 4;
+		for (e = new r.Buf8(h), o = 0, a = 0; o < h; a++) 55296 == (64512 & (n = t.charCodeAt(a))) && a + 1 < s && 56320 == (64512 & (i = t.charCodeAt(a + 1))) && (n = 65536 + (n - 55296 << 10) + (i - 56320), a++), n < 128 ? e[o++] = n : n < 2048 ? (e[o++] = 192 | n >>> 6, e[o++] = 128 | 63 & n) : n < 65536 ? (e[o++] = 224 | n >>> 12, e[o++] = 128 | n >>> 6 & 63, e[o++] = 128 | 63 & n) : (e[o++] = 240 | n >>> 18, e[o++] = 128 | n >>> 12 & 63, e[o++] = 128 | n >>> 6 & 63, e[o++] = 128 | 63 & n);
+		return e;
+	}, t.buf2binstring = function(t) {
+		return s(t, t.length);
+	}, t.binstring2buf = function(t) {
+		for (var e = new r.Buf8(t.length), n = 0, i = e.length; n < i; n++) e[n] = t.charCodeAt(n);
+		return e;
+	}, t.buf2string = function(t, e) {
+		var r, n, i, o, h = e || t.length, f = new Array(2 * h);
+		for (n = 0, r = 0; r < h;) if ((i = t[r++]) < 128) f[n++] = i;
+		else if ((o = a[i]) > 4) f[n++] = 65533, r += o - 1;
+		else {
+			for (i &= 2 === o ? 31 : 3 === o ? 15 : 7; o > 1 && r < h;) i = i << 6 | 63 & t[r++], o--;
+			o > 1 ? f[n++] = 65533 : i < 65536 ? f[n++] = i : (i -= 65536, f[n++] = 55296 | i >> 10 & 1023, f[n++] = 56320 | 1023 & i);
+		}
+		return s(f, n);
+	}, t.utf8border = function(t, e) {
+		var r;
+		for ((e = e || t.length) > t.length && (e = t.length), r = e - 1; r >= 0 && 128 == (192 & t[r]);) r--;
+		return r < 0 || 0 === r ? e : r + a[t[r]] > e ? r : e;
+	};
+}), h = t.__commonJSMin((t, e) => {
+	e.exports = function() {
+		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;
+	};
+}), f = t.__commonJSMin((t) => {
+	var r = o(), n = e(), i = s(), f = a(), l = h(), d = Object.prototype.toString;
+	function u(t) {
+		if (!(this instanceof u)) return new u(t);
+		this.options = n.assign({
+			level: -1,
+			method: 8,
+			chunkSize: 16384,
+			windowBits: 15,
+			memLevel: 8,
+			strategy: 0,
+			to: ""
+		}, t || {});
+		var e = this.options;
+		e.raw && e.windowBits > 0 ? e.windowBits = -e.windowBits : e.gzip && e.windowBits > 0 && e.windowBits < 16 && (e.windowBits += 16), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new l(), this.strm.avail_out = 0;
+		var a = r.deflateInit2(this.strm, e.level, e.method, e.windowBits, e.memLevel, e.strategy);
+		if (0 !== a) throw new Error(f[a]);
+		if (e.header && r.deflateSetHeader(this.strm, e.header), e.dictionary) {
+			var o;
+			if (o = "string" == typeof e.dictionary ? i.string2buf(e.dictionary) : "[object ArrayBuffer]" === d.call(e.dictionary) ? new Uint8Array(e.dictionary) : e.dictionary, 0 !== (a = r.deflateSetDictionary(this.strm, o))) throw new Error(f[a]);
+			this._dict_set = !0;
+		}
+	}
+	function c(t, e) {
+		var r = new u(e);
+		if (r.push(t, !0), r.err) throw r.msg || f[r.err];
+		return r.result;
+	}
+	u.prototype.push = function(t, e) {
+		var a, o, s = this.strm, h = this.options.chunkSize;
+		if (this.ended) return !1;
+		o = e === ~~e ? e : !0 === e ? 4 : 0, "string" == typeof t ? s.input = i.string2buf(t) : "[object ArrayBuffer]" === d.call(t) ? s.input = new Uint8Array(t) : s.input = t, s.next_in = 0, s.avail_in = s.input.length;
+		do {
+			if (0 === s.avail_out && (s.output = new n.Buf8(h), s.next_out = 0, s.avail_out = h), 1 !== (a = r.deflate(s, o)) && 0 !== a) return this.onEnd(a), this.ended = !0, !1;
+			0 !== s.avail_out && (0 !== s.avail_in || 4 !== o && 2 !== o) || ("string" === this.options.to ? this.onData(i.buf2binstring(n.shrinkBuf(s.output, s.next_out))) : this.onData(n.shrinkBuf(s.output, s.next_out)));
+		} while ((s.avail_in > 0 || 0 === s.avail_out) && 1 !== a);
+		return 4 === o ? (a = r.deflateEnd(this.strm), this.onEnd(a), this.ended = !0, 0 === a) : 2 !== o || (this.onEnd(0), s.avail_out = 0, !0);
+	}, u.prototype.onData = function(t) {
+		this.chunks.push(t);
+	}, u.prototype.onEnd = function(t) {
+		0 === t && ("string" === this.options.to ? this.result = this.chunks.join("") : this.result = n.flattenChunks(this.chunks)), this.chunks = [], this.err = t, this.msg = this.strm.msg;
+	}, t.Deflate = u, t.deflate = c, t.deflateRaw = function(t, e) {
+		return (e = e || {}).raw = !0, c(t, e);
+	}, t.gzip = function(t, e) {
+		return (e = e || {}).gzip = !0, c(t, e);
+	};
+}), l = t.__commonJSMin((t, e) => {
+	e.exports = function(t, e) {
+		var r = t.state, n = t.next_in, i, a, o, s, h, f, l, d, u, c, _, g, v, w, b, p, m, k, y, x, E, z = t.input, B;
+		i = n + (t.avail_in - 5), a = t.next_out, B = t.output, o = a - (e - t.avail_out), s = a + (t.avail_out - 257), h = r.dmax, f = r.wsize, l = r.whave, d = r.wnext, u = r.window, c = r.hold, _ = r.bits, g = r.lencode, v = r.distcode, w = (1 << r.lenbits) - 1, b = (1 << r.distbits) - 1;
+		t: do {
+			_ < 15 && (c += z[n++] << _, _ += 8, c += z[n++] << _, _ += 8), p = g[c & w];
+			e: for (;;) {
+				if (c >>>= m = p >>> 24, _ -= m, 0 === (m = p >>> 16 & 255)) B[a++] = 65535 & p;
+				else {
+					if (!(16 & m)) {
+						if (64 & m) {
+							if (32 & m) {
+								r.mode = 12;
+								break t;
+							}
+							t.msg = "invalid literal/length code", r.mode = 30;
+							break t;
+						}
+						p = g[(65535 & p) + (c & (1 << m) - 1)];
+						continue e;
+					}
+					for (k = 65535 & p, (m &= 15) && (_ < m && (c += z[n++] << _, _ += 8), k += c & (1 << m) - 1, c >>>= m, _ -= m), _ < 15 && (c += z[n++] << _, _ += 8, c += z[n++] << _, _ += 8), p = v[c & b];;) {
+						if (c >>>= m = p >>> 24, _ -= m, 16 & (m = p >>> 16 & 255)) {
+							if (y = 65535 & p, _ < (m &= 15) && (c += z[n++] << _, (_ += 8) < m && (c += z[n++] << _, _ += 8)), (y += c & (1 << m) - 1) > h) {
+								t.msg = "invalid distance too far back", r.mode = 30;
+								break t;
+							}
+							if (c >>>= m, _ -= m, y > (m = a - o)) {
+								if ((m = y - m) > l && r.sane) {
+									t.msg = "invalid distance too far back", r.mode = 30;
+									break t;
+								}
+								if (x = 0, E = u, 0 === d) {
+									if (x += f - m, m < k) {
+										k -= m;
+										do
+											B[a++] = u[x++];
+										while (--m);
+										x = a - y, E = B;
+									}
+								} else if (d < m) {
+									if (x += f + d - m, (m -= d) < k) {
+										k -= m;
+										do
+											B[a++] = u[x++];
+										while (--m);
+										if (x = 0, d < k) {
+											k -= m = d;
+											do
+												B[a++] = u[x++];
+											while (--m);
+											x = a - y, E = B;
+										}
+									}
+								} else if (x += d - m, m < k) {
+									k -= m;
+									do
+										B[a++] = u[x++];
+									while (--m);
+									x = a - y, E = B;
+								}
+								for (; k > 2;) B[a++] = E[x++], B[a++] = E[x++], B[a++] = E[x++], k -= 3;
+								k && (B[a++] = E[x++], k > 1 && (B[a++] = E[x++]));
+							} else {
+								x = a - y;
+								do
+									B[a++] = B[x++], B[a++] = B[x++], B[a++] = B[x++], k -= 3;
+								while (k > 2);
+								k && (B[a++] = B[x++], k > 1 && (B[a++] = B[x++]));
+							}
+							break;
+						}
+						if (64 & m) {
+							t.msg = "invalid distance code", r.mode = 30;
+							break t;
+						}
+						p = v[(65535 & p) + (c & (1 << m) - 1)];
+					}
+				}
+				break;
+			}
+		} while (n < i && a < s);
+		n -= k = _ >> 3, c &= (1 << (_ -= k << 3)) - 1, t.next_in = n, t.next_out = a, t.avail_in = n < i ? i - n + 5 : 5 - (n - i), t.avail_out = a < s ? s - a + 257 : 257 - (a - s), r.hold = c, r.bits = _;
+	};
+}), d = t.__commonJSMin((t, r) => {
+	var n = e(), i = 15, a = [
+		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
+	], o = [
+		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
+	], s = [
+		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
+	], h = [
+		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
+	];
+	r.exports = function(t, e, r, f, l, d, u, c) {
+		var _, g, v, w, b, p, m, k, y, x = c.bits, E = 0, z = 0, B = 0, A = 0, S = 0, U = 0, I = 0, D = 0, M = 0, N = 0, F = null, C = 0, O = new n.Buf16(16), Z = new n.Buf16(16), L = null, J = 0;
+		for (E = 0; E <= i; E++) O[E] = 0;
+		for (z = 0; z < f; z++) O[e[r + z]]++;
+		for (S = x, A = i; A >= 1 && 0 === O[A]; A--);
+		if (S > A && (S = A), 0 === A) return l[d++] = 20971520, l[d++] = 20971520, c.bits = 1, 0;
+		for (B = 1; B < A && 0 === O[B]; B++);
+		for (S < B && (S = B), D = 1, E = 1; E <= i; E++) if (D <<= 1, (D -= O[E]) < 0) return -1;
+		if (D > 0 && (0 === t || 1 !== A)) return -1;
+		for (Z[1] = 0, E = 1; E < i; E++) Z[E + 1] = Z[E] + O[E];
+		for (z = 0; z < f; z++) 0 !== e[r + z] && (u[Z[e[r + z]]++] = z);
+		if (0 === t ? (F = L = u, p = 19) : 1 === t ? (F = a, C -= 257, L = o, J -= 257, p = 256) : (F = s, L = h, p = -1), N = 0, z = 0, E = B, b = d, U = S, I = 0, v = -1, w = (M = 1 << S) - 1, 1 === t && M > 852 || 2 === t && M > 592) return 1;
+		for (;;) {
+			m = E - I, u[z] < p ? (k = 0, y = u[z]) : u[z] > p ? (k = L[J + u[z]], y = F[C + u[z]]) : (k = 96, y = 0), _ = 1 << E - I, B = g = 1 << U;
+			do
+				l[b + (N >> I) + (g -= _)] = m << 24 | k << 16 | y;
+			while (0 !== g);
+			for (_ = 1 << E - 1; N & _;) _ >>= 1;
+			if (0 !== _ ? (N &= _ - 1, N += _) : N = 0, z++, 0 === --O[E]) {
+				if (E === A) break;
+				E = e[r + u[z]];
+			}
+			if (E > S && (N & w) !== v) {
+				for (0 === I && (I = S), b += B, D = 1 << (U = E - I); U + I < A && !((D -= O[U + I]) <= 0);) U++, D <<= 1;
+				if (M += 1 << U, 1 === t && M > 852 || 2 === t && M > 592) return 1;
+				l[v = N & w] = S << 24 | U << 16 | b - d;
+			}
+		}
+		return 0 !== N && (l[b + N] = E - I << 24 | 64 << 16), c.bits = S, 0;
+	};
+}), u = t.__commonJSMin((t) => {
+	var r = e(), a = n(), o = i(), s = l(), h = d(), f = -2, u = 12, c = 30;
+	function _(t) {
+		return (t >>> 24 & 255) + (t >>> 8 & 65280) + ((65280 & t) << 8) + ((255 & t) << 24);
+	}
+	function g() {
+		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 r.Buf16(320), this.work = new r.Buf16(288), this.lendyn = null, this.distdyn = null, this.sane = 0, this.back = 0, this.was = 0;
+	}
+	function v(t) {
+		var e;
+		return t && t.state ? (e = t.state, t.total_in = t.total_out = e.total = 0, t.msg = "", e.wrap && (t.adler = 1 & e.wrap), e.mode = 1, e.last = 0, e.havedict = 0, e.dmax = 32768, e.head = null, e.hold = 0, e.bits = 0, e.lencode = e.lendyn = new r.Buf32(852), e.distcode = e.distdyn = new r.Buf32(592), e.sane = 1, e.back = -1, 0) : f;
+	}
+	function w(t) {
+		var e;
+		return t && t.state ? ((e = t.state).wsize = 0, e.whave = 0, e.wnext = 0, v(t)) : f;
+	}
+	function b(t, e) {
+		var r, n;
+		return t && t.state ? (n = t.state, e < 0 ? (r = 0, e = -e) : (r = 1 + (e >> 4), e < 48 && (e &= 15)), e && (e < 8 || e > 15) ? f : (null !== n.window && n.wbits !== e && (n.window = null), n.wrap = r, n.wbits = e, w(t))) : f;
+	}
+	function p(t, e) {
+		var r, n;
+		return t ? (n = new g(), t.state = n, n.window = null, 0 !== (r = b(t, e)) && (t.state = null), r) : f;
+	}
+	var m, k, y = !0;
+	function x(t) {
+		if (y) {
+			var e;
+			for (m = new r.Buf32(512), k = new r.Buf32(32), e = 0; e < 144;) t.lens[e++] = 8;
+			for (; e < 256;) t.lens[e++] = 9;
+			for (; e < 280;) t.lens[e++] = 7;
+			for (; e < 288;) t.lens[e++] = 8;
+			for (h(1, t.lens, 0, 288, m, 0, t.work, { bits: 9 }), e = 0; e < 32;) t.lens[e++] = 5;
+			h(2, t.lens, 0, 32, k, 0, t.work, { bits: 5 }), y = !1;
+		}
+		t.lencode = m, t.lenbits = 9, t.distcode = k, t.distbits = 5;
+	}
+	function E(t, e, n, i) {
+		var a, o = t.state;
+		return null === o.window && (o.wsize = 1 << o.wbits, o.wnext = 0, o.whave = 0, o.window = new r.Buf8(o.wsize)), i >= o.wsize ? (r.arraySet(o.window, e, n - o.wsize, o.wsize, 0), o.wnext = 0, o.whave = o.wsize) : ((a = o.wsize - o.wnext) > i && (a = i), r.arraySet(o.window, e, n - i, a, o.wnext), (i -= a) ? (r.arraySet(o.window, e, n - i, i, 0), o.wnext = i, o.whave = o.wsize) : (o.wnext += a, o.wnext === o.wsize && (o.wnext = 0), o.whave < o.wsize && (o.whave += a))), 0;
+	}
+	t.inflateReset = w, t.inflateReset2 = b, t.inflateResetKeep = v, t.inflateInit = function(t) {
+		return p(t, 15);
+	}, t.inflateInit2 = p, t.inflate = function(t, e) {
+		var n, i, l, d, g, v, w, b, p, m, k, y, z, B, A, S, U, I, D, M, N, F, C, O, Z = 0, L = new r.Buf8(4), J = [
+			16,
+			17,
+			18,
+			0,
+			8,
+			7,
+			9,
+			6,
+			10,
+			5,
+			11,
+			4,
+			12,
+			3,
+			13,
+			2,
+			14,
+			1,
+			15
+		];
+		if (!t || !t.state || !t.output || !t.input && 0 !== t.avail_in) return f;
+		(n = t.state).mode === u && (n.mode = 13), g = t.next_out, l = t.output, w = t.avail_out, d = t.next_in, i = t.input, v = t.avail_in, b = n.hold, p = n.bits, m = v, k = w, F = 0;
+		t: for (;;) switch (n.mode) {
+			case 1:
+				if (0 === n.wrap) {
+					n.mode = 13;
+					break;
+				}
+				for (; p < 16;) {
+					if (0 === v) break t;
+					v--, b += i[d++] << p, p += 8;
+				}
+				if (2 & n.wrap && 35615 === b) {
+					n.check = 0, L[0] = 255 & b, L[1] = b >>> 8 & 255, n.check = o(n.check, L, 2, 0), b = 0, p = 0, n.mode = 2;
+					break;
+				}
+				if (n.flags = 0, n.head && (n.head.done = !1), !(1 & n.wrap) || (((255 & b) << 8) + (b >> 8)) % 31) {
+					t.msg = "incorrect header check", n.mode = c;
+					break;
+				}
+				if (8 != (15 & b)) {
+					t.msg = "unknown compression method", n.mode = c;
+					break;
+				}
+				if (p -= 4, N = 8 + (15 & (b >>>= 4)), 0 === n.wbits) n.wbits = N;
+				else if (N > n.wbits) {
+					t.msg = "invalid window size", n.mode = c;
+					break;
+				}
+				n.dmax = 1 << N, t.adler = n.check = 1, n.mode = 512 & b ? 10 : u, b = 0, p = 0;
+				break;
+			case 2:
+				for (; p < 16;) {
+					if (0 === v) break t;
+					v--, b += i[d++] << p, p += 8;
+				}
+				if (n.flags = b, 8 != (255 & n.flags)) {
+					t.msg = "unknown compression method", n.mode = c;
+					break;
+				}
+				if (57344 & n.flags) {
+					t.msg = "unknown header flags set", n.mode = c;
+					break;
+				}
+				n.head && (n.head.text = b >> 8 & 1), 512 & n.flags && (L[0] = 255 & b, L[1] = b >>> 8 & 255, n.check = o(n.check, L, 2, 0)), b = 0, p = 0, n.mode = 3;
+			case 3:
+				for (; p < 32;) {
+					if (0 === v) break t;
+					v--, b += i[d++] << p, p += 8;
+				}
+				n.head && (n.head.time = b), 512 & n.flags && (L[0] = 255 & b, L[1] = b >>> 8 & 255, L[2] = b >>> 16 & 255, L[3] = b >>> 24 & 255, n.check = o(n.check, L, 4, 0)), b = 0, p = 0, n.mode = 4;
+			case 4:
+				for (; p < 16;) {
+					if (0 === v) break t;
+					v--, b += i[d++] << p, p += 8;
+				}
+				n.head && (n.head.xflags = 255 & b, n.head.os = b >> 8), 512 & n.flags && (L[0] = 255 & b, L[1] = b >>> 8 & 255, n.check = o(n.check, L, 2, 0)), b = 0, p = 0, n.mode = 5;
+			case 5:
+				if (1024 & n.flags) {
+					for (; p < 16;) {
+						if (0 === v) break t;
+						v--, b += i[d++] << p, p += 8;
+					}
+					n.length = b, n.head && (n.head.extra_len = b), 512 & n.flags && (L[0] = 255 & b, L[1] = b >>> 8 & 255, n.check = o(n.check, L, 2, 0)), b = 0, p = 0;
+				} else n.head && (n.head.extra = null);
+				n.mode = 6;
+			case 6:
+				if (1024 & n.flags && ((y = n.length) > v && (y = v), y && (n.head && (N = n.head.extra_len - n.length, n.head.extra || (n.head.extra = new Array(n.head.extra_len)), r.arraySet(n.head.extra, i, d, y, N)), 512 & n.flags && (n.check = o(n.check, i, y, d)), v -= y, d += y, n.length -= y), n.length)) break t;
+				n.length = 0, n.mode = 7;
+			case 7:
+				if (2048 & n.flags) {
+					if (0 === v) break t;
+					y = 0;
+					do
+						N = i[d + y++], n.head && N && n.length < 65536 && (n.head.name += String.fromCharCode(N));
+					while (N && y < v);
+					if (512 & n.flags && (n.check = o(n.check, i, y, d)), v -= y, d += y, N) break t;
+				} else n.head && (n.head.name = null);
+				n.length = 0, n.mode = 8;
+			case 8:
+				if (4096 & n.flags) {
+					if (0 === v) break t;
+					y = 0;
+					do
+						N = i[d + y++], n.head && N && n.length < 65536 && (n.head.comment += String.fromCharCode(N));
+					while (N && y < v);
+					if (512 & n.flags && (n.check = o(n.check, i, y, d)), v -= y, d += y, N) break t;
+				} else n.head && (n.head.comment = null);
+				n.mode = 9;
+			case 9:
+				if (512 & n.flags) {
+					for (; p < 16;) {
+						if (0 === v) break t;
+						v--, b += i[d++] << p, p += 8;
+					}
+					if (b !== (65535 & n.check)) {
+						t.msg = "header crc mismatch", n.mode = c;
+						break;
+					}
+					b = 0, p = 0;
+				}
+				n.head && (n.head.hcrc = n.flags >> 9 & 1, n.head.done = !0), t.adler = n.check = 0, n.mode = u;
+				break;
+			case 10:
+				for (; p < 32;) {
+					if (0 === v) break t;
+					v--, b += i[d++] << p, p += 8;
+				}
+				t.adler = n.check = _(b), b = 0, p = 0, n.mode = 11;
+			case 11:
+				if (0 === n.havedict) return t.next_out = g, t.avail_out = w, t.next_in = d, t.avail_in = v, n.hold = b, n.bits = p, 2;
+				t.adler = n.check = 1, n.mode = u;
+			case u: if (5 === e || 6 === e) break t;
+			case 13:
+				if (n.last) {
+					b >>>= 7 & p, p -= 7 & p, n.mode = 27;
+					break;
+				}
+				for (; p < 3;) {
+					if (0 === v) break t;
+					v--, b += i[d++] << p, p += 8;
+				}
+				switch (n.last = 1 & b, p -= 1, 3 & (b >>>= 1)) {
+					case 0:
+						n.mode = 14;
+						break;
+					case 1:
+						if (x(n), n.mode = 20, 6 === e) {
+							b >>>= 2, p -= 2;
+							break t;
+						}
+						break;
+					case 2:
+						n.mode = 17;
+						break;
+					case 3: t.msg = "invalid block type", n.mode = c;
+				}
+				b >>>= 2, p -= 2;
+				break;
+			case 14:
+				for (b >>>= 7 & p, p -= 7 & p; p < 32;) {
+					if (0 === v) break t;
+					v--, b += i[d++] << p, p += 8;
+				}
+				if ((65535 & b) != (b >>> 16 ^ 65535)) {
+					t.msg = "invalid stored block lengths", n.mode = c;
+					break;
+				}
+				if (n.length = 65535 & b, b = 0, p = 0, n.mode = 15, 6 === e) break t;
+			case 15: n.mode = 16;
+			case 16:
+				if (y = n.length) {
+					if (y > v && (y = v), y > w && (y = w), 0 === y) break t;
+					r.arraySet(l, i, d, y, g), v -= y, d += y, w -= y, g += y, n.length -= y;
+					break;
+				}
+				n.mode = u;
+				break;
+			case 17:
+				for (; p < 14;) {
+					if (0 === v) break t;
+					v--, b += i[d++] << p, p += 8;
+				}
+				if (n.nlen = 257 + (31 & b), b >>>= 5, p -= 5, n.ndist = 1 + (31 & b), b >>>= 5, p -= 5, n.ncode = 4 + (15 & b), b >>>= 4, p -= 4, n.nlen > 286 || n.ndist > 30) {
+					t.msg = "too many length or distance symbols", n.mode = c;
+					break;
+				}
+				n.have = 0, n.mode = 18;
+			case 18:
+				for (; n.have < n.ncode;) {
+					for (; p < 3;) {
+						if (0 === v) break t;
+						v--, b += i[d++] << p, p += 8;
+					}
+					n.lens[J[n.have++]] = 7 & b, b >>>= 3, p -= 3;
+				}
+				for (; n.have < 19;) n.lens[J[n.have++]] = 0;
+				if (n.lencode = n.lendyn, n.lenbits = 7, C = { bits: n.lenbits }, F = h(0, n.lens, 0, 19, n.lencode, 0, n.work, C), n.lenbits = C.bits, F) {
+					t.msg = "invalid code lengths set", n.mode = c;
+					break;
+				}
+				n.have = 0, n.mode = 19;
+			case 19:
+				for (; n.have < n.nlen + n.ndist;) {
+					for (; S = (Z = n.lencode[b & (1 << n.lenbits) - 1]) >>> 16 & 255, U = 65535 & Z, !((A = Z >>> 24) <= p);) {
+						if (0 === v) break t;
+						v--, b += i[d++] << p, p += 8;
+					}
+					if (U < 16) b >>>= A, p -= A, n.lens[n.have++] = U;
+					else {
+						if (16 === U) {
+							for (O = A + 2; p < O;) {
+								if (0 === v) break t;
+								v--, b += i[d++] << p, p += 8;
+							}
+							if (b >>>= A, p -= A, 0 === n.have) {
+								t.msg = "invalid bit length repeat", n.mode = c;
+								break;
+							}
+							N = n.lens[n.have - 1], y = 3 + (3 & b), b >>>= 2, p -= 2;
+						} else if (17 === U) {
+							for (O = A + 3; p < O;) {
+								if (0 === v) break t;
+								v--, b += i[d++] << p, p += 8;
+							}
+							p -= A, N = 0, y = 3 + (7 & (b >>>= A)), b >>>= 3, p -= 3;
+						} else {
+							for (O = A + 7; p < O;) {
+								if (0 === v) break t;
+								v--, b += i[d++] << p, p += 8;
+							}
+							p -= A, N = 0, y = 11 + (127 & (b >>>= A)), b >>>= 7, p -= 7;
+						}
+						if (n.have + y > n.nlen + n.ndist) {
+							t.msg = "invalid bit length repeat", n.mode = c;
+							break;
+						}
+						for (; y--;) n.lens[n.have++] = N;
+					}
+				}
+				if (n.mode === c) break;
+				if (0 === n.lens[256]) {
+					t.msg = "invalid code -- missing end-of-block", n.mode = c;
+					break;
+				}
+				if (n.lenbits = 9, C = { bits: n.lenbits }, F = h(1, n.lens, 0, n.nlen, n.lencode, 0, n.work, C), n.lenbits = C.bits, F) {
+					t.msg = "invalid literal/lengths set", n.mode = c;
+					break;
+				}
+				if (n.distbits = 6, n.distcode = n.distdyn, C = { bits: n.distbits }, F = h(2, n.lens, n.nlen, n.ndist, n.distcode, 0, n.work, C), n.distbits = C.bits, F) {
+					t.msg = "invalid distances set", n.mode = c;
+					break;
+				}
+				if (n.mode = 20, 6 === e) break t;
+			case 20: n.mode = 21;
+			case 21:
+				if (v >= 6 && w >= 258) {
+					t.next_out = g, t.avail_out = w, t.next_in = d, t.avail_in = v, n.hold = b, n.bits = p, s(t, k), g = t.next_out, l = t.output, w = t.avail_out, d = t.next_in, i = t.input, v = t.avail_in, b = n.hold, p = n.bits, n.mode === u && (n.back = -1);
+					break;
+				}
+				for (n.back = 0; S = (Z = n.lencode[b & (1 << n.lenbits) - 1]) >>> 16 & 255, U = 65535 & Z, !((A = Z >>> 24) <= p);) {
+					if (0 === v) break t;
+					v--, b += i[d++] << p, p += 8;
+				}
+				if (S && !(240 & S)) {
+					for (I = A, D = S, M = U; S = (Z = n.lencode[M + ((b & (1 << I + D) - 1) >> I)]) >>> 16 & 255, U = 65535 & Z, !(I + (A = Z >>> 24) <= p);) {
+						if (0 === v) break t;
+						v--, b += i[d++] << p, p += 8;
+					}
+					b >>>= I, p -= I, n.back += I;
+				}
+				if (b >>>= A, p -= A, n.back += A, n.length = U, 0 === S) {
+					n.mode = 26;
+					break;
+				}
+				if (32 & S) {
+					n.back = -1, n.mode = u;
+					break;
+				}
+				if (64 & S) {
+					t.msg = "invalid literal/length code", n.mode = c;
+					break;
+				}
+				n.extra = 15 & S, n.mode = 22;
+			case 22:
+				if (n.extra) {
+					for (O = n.extra; p < O;) {
+						if (0 === v) break t;
+						v--, b += i[d++] << p, p += 8;
+					}
+					n.length += b & (1 << n.extra) - 1, b >>>= n.extra, p -= n.extra, n.back += n.extra;
+				}
+				n.was = n.length, n.mode = 23;
+			case 23:
+				for (; S = (Z = n.distcode[b & (1 << n.distbits) - 1]) >>> 16 & 255, U = 65535 & Z, !((A = Z >>> 24) <= p);) {
+					if (0 === v) break t;
+					v--, b += i[d++] << p, p += 8;
+				}
+				if (!(240 & S)) {
+					for (I = A, D = S, M = U; S = (Z = n.distcode[M + ((b & (1 << I + D) - 1) >> I)]) >>> 16 & 255, U = 65535 & Z, !(I + (A = Z >>> 24) <= p);) {
+						if (0 === v) break t;
+						v--, b += i[d++] << p, p += 8;
+					}
+					b >>>= I, p -= I, n.back += I;
+				}
+				if (b >>>= A, p -= A, n.back += A, 64 & S) {
+					t.msg = "invalid distance code", n.mode = c;
+					break;
+				}
+				n.offset = U, n.extra = 15 & S, n.mode = 24;
+			case 24:
+				if (n.extra) {
+					for (O = n.extra; p < O;) {
+						if (0 === v) break t;
+						v--, b += i[d++] << p, p += 8;
+					}
+					n.offset += b & (1 << n.extra) - 1, b >>>= n.extra, p -= n.extra, n.back += n.extra;
+				}
+				if (n.offset > n.dmax) {
+					t.msg = "invalid distance too far back", n.mode = c;
+					break;
+				}
+				n.mode = 25;
+			case 25:
+				if (0 === w) break t;
+				if (y = k - w, n.offset > y) {
+					if ((y = n.offset - y) > n.whave && n.sane) {
+						t.msg = "invalid distance too far back", n.mode = c;
+						break;
+					}
+					y > n.wnext ? (y -= n.wnext, z = n.wsize - y) : z = n.wnext - y, y > n.length && (y = n.length), B = n.window;
+				} else B = l, z = g - n.offset, y = n.length;
+				y > w && (y = w), w -= y, n.length -= y;
+				do
+					l[g++] = B[z++];
+				while (--y);
+				0 === n.length && (n.mode = 21);
+				break;
+			case 26:
+				if (0 === w) break t;
+				l[g++] = n.length, w--, n.mode = 21;
+				break;
+			case 27:
+				if (n.wrap) {
+					for (; p < 32;) {
+						if (0 === v) break t;
+						v--, b |= i[d++] << p, p += 8;
+					}
+					if (k -= w, t.total_out += k, n.total += k, k && (t.adler = n.check = n.flags ? o(n.check, l, k, g - k) : a(n.check, l, k, g - k)), k = w, (n.flags ? b : _(b)) !== n.check) {
+						t.msg = "incorrect data check", n.mode = c;
+						break;
+					}
+					b = 0, p = 0;
+				}
+				n.mode = 28;
+			case 28:
+				if (n.wrap && n.flags) {
+					for (; p < 32;) {
+						if (0 === v) break t;
+						v--, b += i[d++] << p, p += 8;
+					}
+					if (b !== (4294967295 & n.total)) {
+						t.msg = "incorrect length check", n.mode = c;
+						break;
+					}
+					b = 0, p = 0;
+				}
+				n.mode = 29;
+			case 29:
+				F = 1;
+				break t;
+			case c:
+				F = -3;
+				break t;
+			case 31: return -4;
+			default: return f;
+		}
+		return t.next_out = g, t.avail_out = w, t.next_in = d, t.avail_in = v, n.hold = b, n.bits = p, (n.wsize || k !== t.avail_out && n.mode < c && (n.mode < 27 || 4 !== e)) && E(t, t.output, t.next_out, k - t.avail_out) ? (n.mode = 31, -4) : (m -= t.avail_in, k -= t.avail_out, t.total_in += m, t.total_out += k, n.total += k, n.wrap && k && (t.adler = n.check = n.flags ? o(n.check, l, k, t.next_out - k) : a(n.check, l, k, t.next_out - k)), t.data_type = n.bits + (n.last ? 64 : 0) + (n.mode === u ? 128 : 0) + (20 === n.mode || 15 === n.mode ? 256 : 0), (0 === m && 0 === k || 4 === e) && 0 === F && (F = -5), F);
+	}, t.inflateEnd = function(t) {
+		if (!t || !t.state) return f;
+		var e = t.state;
+		return e.window && (e.window = null), t.state = null, 0;
+	}, t.inflateGetHeader = function(t, e) {
+		var r;
+		return t && t.state && 2 & (r = t.state).wrap ? (r.head = e, e.done = !1, 0) : f;
+	}, t.inflateSetDictionary = function(t, e) {
+		var r, n = e.length;
+		return t && t.state ? 0 !== (r = t.state).wrap && 11 !== r.mode ? f : 11 === r.mode && a(1, e, n, 0) !== r.check ? -3 : E(t, e, n, n) ? (r.mode = 31, -4) : (r.havedict = 1, 0) : f;
+	}, t.inflateInfo = "pako inflate (from Nodeca project)";
+}), c = t.__commonJSMin((t, e) => {
+	e.exports = {
+		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_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
+	};
+}), _ = t.__commonJSMin((t, e) => {
+	e.exports = function() {
+		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;
+	};
+}), g = t.__commonJSMin((t) => {
+	var r = u(), n = e(), i = s(), o = c(), f = a(), l = h(), d = _(), g = Object.prototype.toString;
+	function v(t) {
+		if (!(this instanceof v)) return new v(t);
+		this.options = n.assign({
+			chunkSize: 16384,
+			windowBits: 0,
+			to: ""
+		}, t || {});
+		var e = this.options;
+		e.raw && e.windowBits >= 0 && e.windowBits < 16 && (e.windowBits = -e.windowBits, 0 === e.windowBits && (e.windowBits = -15)), !(e.windowBits >= 0 && e.windowBits < 16) || t && t.windowBits || (e.windowBits += 32), e.windowBits > 15 && e.windowBits < 48 && (15 & e.windowBits || (e.windowBits |= 15)), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new l(), this.strm.avail_out = 0;
+		var a = r.inflateInit2(this.strm, e.windowBits);
+		if (a !== o.Z_OK) throw new Error(f[a]);
+		if (this.header = new d(), r.inflateGetHeader(this.strm, this.header), e.dictionary && ("string" == typeof e.dictionary ? e.dictionary = i.string2buf(e.dictionary) : "[object ArrayBuffer]" === g.call(e.dictionary) && (e.dictionary = new Uint8Array(e.dictionary)), e.raw && (a = r.inflateSetDictionary(this.strm, e.dictionary)) !== o.Z_OK)) throw new Error(f[a]);
+	}
+	function w(t, e) {
+		var r = new v(e);
+		if (r.push(t, !0), r.err) throw r.msg || f[r.err];
+		return r.result;
+	}
+	v.prototype.push = function(t, e) {
+		var a, s, h, f, l, d = this.strm, u = this.options.chunkSize, c = this.options.dictionary, _ = !1;
+		if (this.ended) return !1;
+		s = e === ~~e ? e : !0 === e ? o.Z_FINISH : o.Z_NO_FLUSH, "string" == typeof t ? d.input = i.binstring2buf(t) : "[object ArrayBuffer]" === g.call(t) ? d.input = new Uint8Array(t) : d.input = t, d.next_in = 0, d.avail_in = d.input.length;
+		do {
+			if (0 === d.avail_out && (d.output = new n.Buf8(u), d.next_out = 0, d.avail_out = u), (a = r.inflate(d, o.Z_NO_FLUSH)) === o.Z_NEED_DICT && c && (a = r.inflateSetDictionary(this.strm, c)), a === o.Z_BUF_ERROR && !0 === _ && (a = o.Z_OK, _ = !1), a !== o.Z_STREAM_END && a !== o.Z_OK) return this.onEnd(a), this.ended = !0, !1;
+			d.next_out && (0 !== d.avail_out && a !== o.Z_STREAM_END && (0 !== d.avail_in || s !== o.Z_FINISH && s !== o.Z_SYNC_FLUSH) || ("string" === this.options.to ? (h = i.utf8border(d.output, d.next_out), f = d.next_out - h, l = i.buf2string(d.output, h), d.next_out = f, d.avail_out = u - f, f && n.arraySet(d.output, d.output, h, f, 0), this.onData(l)) : this.onData(n.shrinkBuf(d.output, d.next_out)))), 0 === d.avail_in && 0 === d.avail_out && (_ = !0);
+		} while ((d.avail_in > 0 || 0 === d.avail_out) && a !== o.Z_STREAM_END);
+		return a === o.Z_STREAM_END && (s = o.Z_FINISH), s === o.Z_FINISH ? (a = r.inflateEnd(this.strm), this.onEnd(a), this.ended = !0, a === o.Z_OK) : s !== o.Z_SYNC_FLUSH || (this.onEnd(o.Z_OK), d.avail_out = 0, !0);
+	}, v.prototype.onData = function(t) {
+		this.chunks.push(t);
+	}, v.prototype.onEnd = function(t) {
+		t === o.Z_OK && ("string" === this.options.to ? this.result = this.chunks.join("") : this.result = n.flattenChunks(this.chunks)), this.chunks = [], this.err = t, this.msg = this.strm.msg;
+	}, t.Inflate = v, t.inflate = w, t.inflateRaw = function(t, e) {
+		return (e = e || {}).raw = !0, w(t, e);
+	}, t.ungzip = w;
+}), v = t.__commonJSMin((t, r) => {
+	var n = {};
+	(0, e().assign)(n, f(), g(), c()), r.exports = n;
+}), w = t.__commonJSMin((t, e) => {
+	(function() {
+		var t = {};
+		function r() {
+			"undefined" != typeof process && "development" != process.env.NODE_ENV || console.log.apply(console, arguments);
+		}
+		"object" == typeof e ? e.exports = t : self.UTIF = t, function(t, e) {
+			var n = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function(t) {
+				return typeof t;
+			} : function(t) {
+				return t && "function" == typeof Symbol && t.constructor === Symbol && t !== Symbol.prototype ? "symbol" : typeof t;
+			}, i = function() {
+				function t(t) {
+					this.message = "JPEG error: " + t;
+				}
+				return t.prototype = Error(), t.prototype.name = "JpegError", t.constructor = t;
+			}(), a = function() {
+				function t(t, e) {
+					this.message = t, this.g = e;
+				}
+				return t.prototype = Error(), t.prototype.name = "DNLMarkerError", t.constructor = t;
+			}();
+			(function() {
+				function e() {
+					this.M = null, this.B = -1;
+				}
+				function r(t, e) {
+					for (var r, n, i = 0, a = [], o = 16; 0 < o && !t[o - 1];) o--;
+					a.push({
+						children: [],
+						index: 0
+					});
+					var s, h = a[0];
+					for (r = 0; r < o; r++) {
+						for (n = 0; n < t[r]; n++) {
+							for ((h = a.pop()).children[h.index] = e[i]; 0 < h.index;) h = a.pop();
+							for (h.index++, a.push(h); a.length <= r;) a.push(s = {
+								children: [],
+								index: 0
+							}), h.children[h.index] = s.children, h = s;
+							i++;
+						}
+						r + 1 < o && (a.push(s = {
+							children: [],
+							index: 0
+						}), h.children[h.index] = s.children, h = s);
+					}
+					return a[0].children;
+				}
+				function o(t, e, r, o, s, l, d, u, c) {
+					function _() {
+						if (0 < U) return U--, S >> U & 1;
+						if (255 === (S = t[e++])) {
+							var n = t[e++];
+							if (n) {
+								if (220 === n && z) {
+									e += 2;
+									var o = t[e++] << 8 | t[e++];
+									if (0 < o && o !== r.g) throw new a("Found DNL marker (0xFFDC) while parsing scan data", o);
+								}
+								throw new i("unexpected marker " + (S << 8 | n).toString(16));
+							}
+						}
+						return U = 7, S >>> 7;
+					}
+					function g(t) {
+						for (;;) {
+							if ("number" == typeof (t = t[_()])) return t;
+							if ("object" !== (void 0 === t ? "undefined" : n(t))) throw new i("invalid huffman sequence");
+						}
+					}
+					function v(t) {
+						for (var e = 0; 0 < t;) e = e << 1 | _(), t--;
+						return e;
+					}
+					function w(t) {
+						if (1 === t) return 1 === _() ? 1 : -1;
+						var e = v(t);
+						return e >= 1 << t - 1 ? e : e + (-1 << t) + 1;
+					}
+					for (var b, p, m, k, y, x, E, z = 9 < arguments.length && void 0 !== arguments[9] && arguments[9], B = r.P, A = e, S = 0, U = 0, I = 0, D = 0, M = o.length, N = r.S ? 0 === l ? 0 === u ? function(t, e) {
+						var r = g(t.D);
+						r = 0 === r ? 0 : w(r) << c, t.a[e] = t.m += r;
+					} : function(t, e) {
+						t.a[e] |= _() << c;
+					} : 0 === u ? function(t, e) {
+						if (0 < I) I--;
+						else for (var r = l; r <= d;) {
+							var n = g(t.o), i = 15 & n;
+							if (n >>= 4, 0 === i) {
+								if (15 > n) {
+									I = v(n) + (1 << n) - 1;
+									break;
+								}
+								r += 16;
+							} else r += n, t.a[e + f[r]] = w(i) * (1 << c), r++;
+						}
+					} : function(t, e) {
+						for (var r, n = l, a = 0; n <= d;) {
+							r = e + f[n];
+							var o = 0 > t.a[r] ? -1 : 1;
+							switch (D) {
+								case 0:
+									if (r = 15 & (a = g(t.o)), a >>= 4, 0 === r) 15 > a ? (I = v(a) + (1 << a), D = 4) : (a = 16, D = 1);
+									else {
+										if (1 !== r) throw new i("invalid ACn encoding");
+										b = w(r), D = a ? 2 : 3;
+									}
+									continue;
+								case 1:
+								case 2:
+									t.a[r] ? t.a[r] += o * (_() << c) : 0 === --a && (D = 2 === D ? 3 : 0);
+									break;
+								case 3:
+									t.a[r] ? t.a[r] += o * (_() << c) : (t.a[r] = b << c, D = 0);
+									break;
+								case 4: t.a[r] && (t.a[r] += o * (_() << c));
+							}
+							n++;
+						}
+						4 === D && 0 === --I && (D = 0);
+					} : function(t, e) {
+						var r = g(t.D);
+						for (r = 0 === r ? 0 : w(r), t.a[e] = t.m += r, r = 1; 64 > r;) {
+							var n = g(t.o), i = 15 & n;
+							if (n >>= 4, 0 === i) {
+								if (15 > n) break;
+								r += 16;
+							} else r += n, t.a[e + f[r]] = w(i), r++;
+						}
+					}, F = 0, C = 1 === M ? o[0].c * o[0].l : B * r.O; F < C;) {
+						var O = s ? Math.min(C - F, s) : C;
+						for (p = 0; p < M; p++) o[p].m = 0;
+						if (I = 0, 1 === M) {
+							var Z = o[0];
+							for (y = 0; y < O; y++) N(Z, 64 * ((Z.c + 1) * (F / Z.c | 0) + F % Z.c)), F++;
+						} else for (y = 0; y < O; y++) {
+							for (p = 0; p < M; p++) for (x = (Z = o[p]).h, E = Z.j, m = 0; m < E; m++) for (k = 0; k < x; k++) N(Z, 64 * ((Z.c + 1) * ((F / B | 0) * Z.j + m) + (F % B * Z.h + k)));
+							F++;
+						}
+						if (U = 0, (Z = h(t, e)) && Z.f && ((0, _util.warn)("decodeScan - unexpected MCU data, current marker is: " + Z.f), e = Z.offset), !(Z = Z && Z.F) || 65280 >= Z) throw new i("marker was not found");
+						if (!(65488 <= Z && 65495 >= Z)) break;
+						e += 2;
+					}
+					return (Z = h(t, e)) && Z.f && ((0, _util.warn)("decodeScan - unexpected Scan data, current marker is: " + Z.f), e = Z.offset), e - A;
+				}
+				function s(t, e) {
+					for (var r = e.c, n = e.l, a = /* @__PURE__ */ new Int16Array(64), o = 0; o < n; o++) for (var s = 0; s < r; s++) {
+						var h = 64 * ((e.c + 1) * o + s), f = a, l = e.G, d = e.a;
+						if (!l) throw new i("missing required Quantization Table.");
+						for (var u = 0; 64 > u; u += 8) {
+							var c = d[h + u], _ = d[h + u + 1], g = d[h + u + 2], v = d[h + u + 3], w = d[h + u + 4], b = d[h + u + 5], p = d[h + u + 6], m = d[h + u + 7];
+							if (c *= l[u], 0 === (_ | g | v | w | b | p | m)) c = 5793 * c + 512 >> 10, f[u] = c, f[u + 1] = c, f[u + 2] = c, f[u + 3] = c, f[u + 4] = c, f[u + 5] = c, f[u + 6] = c, f[u + 7] = c;
+							else {
+								_ *= l[u + 1], g *= l[u + 2], v *= l[u + 3], w *= l[u + 4], b *= l[u + 5];
+								var k = 5793 * c + 128 >> 8, y = 5793 * w + 128 >> 8, x = g, E = p *= l[u + 6];
+								y = (k = k + y + 1 >> 1) - y, c = 3784 * x + 1567 * E + 128 >> 8, x = 1567 * x - 3784 * E + 128 >> 8, b = (w = (w = 2896 * (_ - (m *= l[u + 7])) + 128 >> 8) + (b <<= 4) + 1 >> 1) - b, v = (m = (m = 2896 * (_ + m) + 128 >> 8) + (v <<= 4) + 1 >> 1) - v, E = (k = k + (E = c) + 1 >> 1) - E, x = (y = y + x + 1 >> 1) - x, c = 2276 * w + 3406 * m + 2048 >> 12, w = 3406 * w - 2276 * m + 2048 >> 12, m = c, c = 799 * v + 4017 * b + 2048 >> 12, v = 4017 * v - 799 * b + 2048 >> 12, b = c, f[u] = k + m, f[u + 7] = k - m, f[u + 1] = y + b, f[u + 6] = y - b, f[u + 2] = x + v, f[u + 5] = x - v, f[u + 3] = E + w, f[u + 4] = E - w;
+							}
+						}
+						for (l = 0; 8 > l; ++l) c = f[l], 0 === ((_ = f[l + 8]) | (g = f[l + 16]) | (v = f[l + 24]) | (w = f[l + 32]) | (b = f[l + 40]) | (p = f[l + 48]) | (m = f[l + 56])) ? (c = -2040 > (c = 5793 * c + 8192 >> 14) ? 0 : 2024 <= c ? 255 : c + 2056 >> 4, d[h + l] = c, d[h + l + 8] = c, d[h + l + 16] = c, d[h + l + 24] = c, d[h + l + 32] = c, d[h + l + 40] = c, d[h + l + 48] = c, d[h + l + 56] = c) : (k = 5793 * c + 2048 >> 12, y = 5793 * w + 2048 >> 12, c = 3784 * (x = g) + 1567 * (E = p) + 2048 >> 12, x = 1567 * x - 3784 * E + 2048 >> 12, E = c, b = (w = (w = 2896 * (_ - m) + 2048 >> 12) + b + 1 >> 1) - b, v = (m = (m = 2896 * (_ + m) + 2048 >> 12) + v + 1 >> 1) - v, c = 2276 * w + 3406 * m + 2048 >> 12, w = 3406 * w - 2276 * m + 2048 >> 12, m = c, c = 799 * v + 4017 * b + 2048 >> 12, v = 4017 * v - 799 * b + 2048 >> 12, _ = (y = (y = (k = 4112 + (k + y + 1 >> 1)) - y) + x + 1 >> 1) + (b = c), p = y - b, b = (x = y - x) - v, c = 16 > (c = (k = k + E + 1 >> 1) + m) ? 0 : 4080 <= c ? 255 : c >> 4, _ = 16 > _ ? 0 : 4080 <= _ ? 255 : _ >> 4, g = 16 > (g = x + v) ? 0 : 4080 <= g ? 255 : g >> 4, v = 16 > (v = (E = k - E) + w) ? 0 : 4080 <= v ? 255 : v >> 4, w = 16 > (w = E - w) ? 0 : 4080 <= w ? 255 : w >> 4, b = 16 > b ? 0 : 4080 <= b ? 255 : b >> 4, p = 16 > p ? 0 : 4080 <= p ? 255 : p >> 4, m = 16 > (m = k - m) ? 0 : 4080 <= m ? 255 : m >> 4, d[h + l] = c, d[h + l + 8] = _, d[h + l + 16] = g, d[h + l + 24] = v, d[h + l + 32] = w, d[h + l + 40] = b, d[h + l + 48] = p, d[h + l + 56] = m);
+					}
+					return e.a;
+				}
+				function h(t, e) {
+					var r = 2 < arguments.length && void 0 !== arguments[2] ? arguments[2] : e, n = t.length - 1;
+					if (r = r < e ? r : e, e >= n) return null;
+					var i = t[e] << 8 | t[e + 1];
+					if (65472 <= i && 65534 >= i) return {
+						f: null,
+						F: i,
+						offset: e
+					};
+					for (var a = t[r] << 8 | t[r + 1]; !(65472 <= a && 65534 >= a);) {
+						if (++r >= n) return null;
+						a = t[r] << 8 | t[r + 1];
+					}
+					return {
+						f: i.toString(16),
+						F: a,
+						offset: r
+					};
+				}
+				var f = new Uint8Array([
+					0,
+					1,
+					8,
+					16,
+					9,
+					2,
+					3,
+					10,
+					17,
+					24,
+					32,
+					25,
+					18,
+					11,
+					4,
+					5,
+					12,
+					19,
+					26,
+					33,
+					40,
+					48,
+					41,
+					34,
+					27,
+					20,
+					13,
+					6,
+					7,
+					14,
+					21,
+					28,
+					35,
+					42,
+					49,
+					56,
+					57,
+					50,
+					43,
+					36,
+					29,
+					22,
+					15,
+					23,
+					30,
+					37,
+					44,
+					51,
+					58,
+					59,
+					52,
+					45,
+					38,
+					31,
+					39,
+					46,
+					53,
+					60,
+					61,
+					54,
+					47,
+					55,
+					62,
+					63
+				]);
+				e.prototype = {
+					parse: function(t) {
+						function e() {
+							var e = t[c] << 8 | t[c + 1];
+							return c += 2, e;
+						}
+						function n() {
+							var r = e(), n = h(t, r = c + r - 2, c);
+							return n && n.f && ((0, _util.warn)("readDataBlock - incorrect length, current marker is: " + n.f), r = n.offset), r = t.subarray(c, r), c += r.length, r;
+						}
+						function l(t) {
+							for (var e = Math.ceil(t.v / 8 / t.s), r = Math.ceil(t.g / 8 / t.u), n = 0; n < t.b.length; n++) {
+								A = t.b[n];
+								var i = Math.ceil(Math.ceil(t.v / 8) * A.h / t.s), a = Math.ceil(Math.ceil(t.g / 8) * A.j / t.u);
+								A.a = new Int16Array(64 * r * A.j * (e * A.h + 1)), A.c = i, A.l = a;
+							}
+							t.P = e, t.O = r;
+						}
+						var d = (1 < arguments.length && void 0 !== arguments[1] ? arguments[1] : {}).N, u = void 0 === d ? null : d, c = 0, _ = null, g = 0;
+						d = [];
+						var v = [], w = [], b = e();
+						if (65496 !== b) throw new i("SOI not found");
+						for (b = e(); 65497 !== b;) {
+							switch (b) {
+								case 65504:
+								case 65505:
+								case 65506:
+								case 65507:
+								case 65508:
+								case 65509:
+								case 65510:
+								case 65511:
+								case 65512:
+								case 65513:
+								case 65514:
+								case 65515:
+								case 65516:
+								case 65517:
+								case 65518:
+								case 65519:
+								case 65534:
+									var p = n();
+									65518 === b && 65 === p[0] && 100 === p[1] && 111 === p[2] && 98 === p[3] && 101 === p[4] && (_ = {
+										version: p[5] << 8 | p[6],
+										Y: p[7] << 8 | p[8],
+										Z: p[9] << 8 | p[10],
+										W: p[11]
+									});
+									break;
+								case 65499:
+									b = e() + c - 2;
+									for (var m; c < b;) {
+										var k = t[c++], y = /* @__PURE__ */ new Uint16Array(64);
+										if (k >> 4) {
+											if (1 != k >> 4) throw new i("DQT - invalid table spec");
+											for (p = 0; 64 > p; p++) y[m = f[p]] = e();
+										} else for (p = 0; 64 > p; p++) y[m = f[p]] = t[c++];
+										d[15 & k] = y;
+									}
+									break;
+								case 65472:
+								case 65473:
+								case 65474:
+									if (x) throw new i("Only single frame JPEGs supported");
+									e();
+									var x = {};
+									for (x.X = 65473 === b, x.S = 65474 === b, x.precision = t[c++], b = e(), x.g = u || b, x.v = e(), x.b = [], x.C = {}, p = t[c++], b = y = k = 0; b < p; b++) {
+										m = t[c];
+										var E = t[c + 1] >> 4, z = 15 & t[c + 1];
+										k < E && (k = E), y < z && (y = z), E = x.b.push({
+											h: E,
+											j: z,
+											T: t[c + 2],
+											G: null
+										}), x.C[m] = E - 1, c += 3;
+									}
+									x.s = k, x.u = y, l(x);
+									break;
+								case 65476:
+									for (m = e(), b = 2; b < m;) {
+										for (k = t[c++], y = /* @__PURE__ */ new Uint8Array(16), p = E = 0; 16 > p; p++, c++) E += y[p] = t[c];
+										for (z = new Uint8Array(E), p = 0; p < E; p++, c++) z[p] = t[c];
+										b += 17 + E, (k >> 4 ? v : w)[15 & k] = r(y, z);
+									}
+									break;
+								case 65501:
+									e();
+									var B = e();
+									break;
+								case 65498:
+									for (p = 1 === ++g && !u, e(), k = t[c++], m = [], b = 0; b < k; b++) {
+										y = x.C[t[c++]];
+										var A = x.b[y];
+										y = t[c++], A.D = w[y >> 4], A.o = v[15 & y], m.push(A);
+									}
+									b = t[c++], k = t[c++], y = t[c++];
+									try {
+										var S = o(t, c, x, m, B, b, k, y >> 4, 15 & y, p);
+										c += S;
+									} catch (e) {
+										if (e instanceof a) return (0, _util.warn)("Attempting to re-parse JPEG image using \"scanLines\" parameter found in DNL marker (0xFFDC) segment."), this.parse(t, { N: e.g });
+										throw e;
+									}
+									break;
+								case 65500:
+									c += 4;
+									break;
+								case 65535:
+									255 !== t[c] && c--;
+									break;
+								default: if (255 === t[c - 3] && 192 <= t[c - 2] && 254 >= t[c - 2]) c -= 3;
+								else {
+									if (!(p = h(t, c - 2)) || !p.f) throw new i("unknown marker " + b.toString(16));
+									(0, _util.warn)("JpegImage.parse - unexpected data, current marker is: " + p.f), c = p.offset;
+								}
+							}
+							b = e();
+						}
+						for (this.width = x.v, this.height = x.g, this.A = _, this.b = [], b = 0; b < x.b.length; b++) (B = d[(A = x.b[b]).T]) && (A.G = B), this.b.push({
+							R: s(0, A),
+							U: A.h / x.s,
+							V: A.j / x.u,
+							c: A.c,
+							l: A.l
+						});
+						this.i = this.b.length;
+					},
+					L: function(t, e) {
+						var r, n, i = this.width / t, a = this.height / e, o = this.b.length, s = t * e * o, h = new Uint8ClampedArray(s), f = new Uint32Array(t);
+						for (n = 0; n < o; n++) {
+							var l = this.b[n], d = l.U * i, u = l.V * a, c = n, _ = l.R, g = l.c + 1 << 3;
+							for (r = 0; r < t; r++) l = 0 | r * d, f[r] = (4294967288 & l) << 3 | 7 & l;
+							for (d = 0; d < e; d++) for (l = g * (4294967288 & (l = 0 | d * u)) | (7 & l) << 3, r = 0; r < t; r++) h[c] = _[l + f[r]], c += o;
+						}
+						if (a = this.M) for (n = 0; n < s;) for (i = l = 0; l < o; l++, n++, i += 2) h[n] = (h[n] * a[i] >> 8) + a[i + 1];
+						return h;
+					},
+					w: function() {
+						return this.A ? !!this.A.W : 3 === this.i ? 0 !== this.B : 1 === this.B;
+					},
+					I: function(t) {
+						for (var e, r, n, i = 0, a = t.length; i < a; i += 3) e = t[i], r = t[i + 1], n = t[i + 2], t[i] = e - 179.456 + 1.402 * n, t[i + 1] = e + 135.459 - .344 * r - .714 * n, t[i + 2] = e - 226.816 + 1.772 * r;
+						return t;
+					},
+					K: function(t) {
+						for (var e, r, n, i, a = 0, o = 0, s = t.length; o < s; o += 4) e = t[o], r = t[o + 1], n = t[o + 2], i = t[o + 3], t[a++] = r * (-660635669420364e-19 * r + .000437130475926232 * n - 54080610064599e-18 * e + .00048449797120281 * i - .154362151871126) - 122.67195406894 + n * (-.000957964378445773 * n + .000817076911346625 * e - .00477271405408747 * i + 1.53380253221734) + e * (.000961250184130688 * e - .00266257332283933 * i + .48357088451265) + i * (-.000336197177618394 * i + .484791561490776), t[a++] = 107.268039397724 + r * (219927104525741e-19 * r - .000640992018297945 * n + .000659397001245577 * e + .000426105652938837 * i - .176491792462875) + n * (-.000778269941513683 * n + .00130872261408275 * e + .000770482631801132 * i - .151051492775562) + e * (.00126935368114843 * e - .00265090189010898 * i + .25802910206845) + i * (-.000318913117588328 * i - .213742400323665), t[a++] = r * (-.000570115196973677 * r - 263409051004589e-19 * n + .0020741088115012 * e - .00288260236853442 * i + .814272968359295) - 20.810012546947 + n * (-153496057440975e-19 * n - .000132689043961446 * e + .000560833691242812 * i - .195152027534049) + e * (.00174418132927582 * e - .00255243321439347 * i + .116935020465145) + i * (-.000343531996510555 * i + .24165260232407);
+						return t.subarray(0, a);
+					},
+					J: function(t) {
+						for (var e, r, n, i = 0, a = t.length; i < a; i += 4) e = t[i], r = t[i + 1], n = t[i + 2], t[i] = 434.456 - e - 1.402 * n, t[i + 1] = 119.541 - e + .344 * r + .714 * n, t[i + 2] = 481.816 - e - 1.772 * r;
+						return t;
+					},
+					H: function(t) {
+						for (var e, r, n, i, a = 0, o = 1 / 255, s = 0, h = t.length; s < h; s += 4) e = t[s] * o, r = t[s + 1] * o, n = t[s + 2] * o, i = t[s + 3] * o, t[a++] = 255 + e * (-4.387332384609988 * e + 54.48615194189176 * r + 18.82290502165302 * n + 212.25662451639585 * i - 285.2331026137004) + r * (1.7149763477362134 * r - 5.6096736904047315 * n - 17.873870861415444 * i - 5.497006427196366) + n * (-2.5217340131683033 * n - 21.248923337353073 * i + 17.5119270841813) - i * (21.86122147463605 * i + 189.48180835922747), t[a++] = 255 + e * (8.841041422036149 * e + 60.118027045597366 * r + 6.871425592049007 * n + 31.159100130055922 * i - 79.2970844816548) + r * (-15.310361306967817 * r + 17.575251261109482 * n + 131.35250912493976 * i - 190.9453302588951) + n * (4.444339102852739 * n + 9.8632861493405 * i - 24.86741582555878) - i * (20.737325471181034 * i + 187.80453709719578), t[a++] = 255 + e * (.8842522430003296 * e + 8.078677503112928 * r + 30.89978309703729 * n - .23883238689178934 * i - 14.183576799673286) + r * (10.49593273432072 * r + 63.02378494754052 * n + 50.606957656360734 * i - 112.23884253719248) + n * (.03296041114873217 * n + 115.60384449646641 * i - 193.58209356861505) - i * (22.33816807309886 * i + 180.12613974708367);
+						return t.subarray(0, a);
+					},
+					getData: function(t, e, r) {
+						if (4 < this.i) throw new i("Unsupported color mode");
+						if (t = this.L(t, e), 1 === this.i && r) {
+							r = t.length, e = new Uint8ClampedArray(3 * r);
+							for (var n = 0, a = 0; a < r; a++) {
+								var o = t[a];
+								e[n++] = o, e[n++] = o, e[n++] = o;
+							}
+							return e;
+						}
+						if (3 === this.i && this.w()) return this.I(t);
+						if (4 === this.i) {
+							if (this.w()) return r ? this.K(t) : this.J(t);
+							if (r) return this.H(t);
+						}
+						return t;
+					}
+				}, t.JpegDecoder = e;
+			})(), t.encodeImage = function(e, r, n, i) {
+				var a = {
+					t256: [r],
+					t257: [n],
+					t258: [
+						8,
+						8,
+						8,
+						8
+					],
+					t259: [1],
+					t262: [2],
+					t273: [1e3],
+					t277: [4],
+					t278: [n],
+					t279: [r * n * 4],
+					t282: [1],
+					t283: [1],
+					t284: [1],
+					t286: [0],
+					t287: [0],
+					t296: [1],
+					t305: ["Photopea (UTIF.js)"],
+					t338: [1]
+				};
+				if (i) for (var o in i) a[o] = i[o];
+				var s = new Uint8Array(t.encode([a])), h = new Uint8Array(e), f = new Uint8Array(1e3 + r * n * 4);
+				for (o = 0; o < s.length; o++) f[o] = s[o];
+				for (o = 0; o < h.length; o++) f[1e3 + o] = h[o];
+				return f.buffer;
+			}, t.encode = function(e) {
+				var r = /* @__PURE__ */ new Uint8Array(2e4), n = 4, i = t._binBE;
+				r[0] = 77, r[1] = 77, r[3] = 42;
+				var a = 8;
+				i.writeUint(r, n, a), n += 4;
+				for (var o = 0; o < e.length; o++) {
+					var s = t._writeIFD(i, r, a, e[o]);
+					a = s[1], o < e.length - 1 && i.writeUint(r, s[0], a);
+				}
+				return r.slice(0, a).buffer;
+			}, t.decode = function(e) {
+				t.decode._decodeG3.allow2D = null;
+				var r = new Uint8Array(e), n = 0, i = t._binBE.readASCII(r, n, 2);
+				n += 2;
+				var a = "II" == i ? t._binLE : t._binBE;
+				a.readUshort(r, n);
+				n += 2;
+				var o = a.readUint(r, n);
+				n += 4;
+				for (var s = [];;) {
+					var h = t._readIFD(a, r, o, s, 0, !1);
+					if (0 == (o = a.readUint(r, h))) break;
+				}
+				return s;
+			}, t.decodeImage = function(e, n, i) {
+				var a = new Uint8Array(e), o = t._binBE.readASCII(a, 0, 2);
+				if (null != n.t256) {
+					n.isLE = "II" == o, n.width = n.t256[0], n.height = n.t257[0];
+					var s, h = n.t259 ? n.t259[0] : 1, f = n.t266 ? n.t266[0] : 1;
+					n.t284 && 2 == n.t284[0] && r("PlanarConfiguration 2 should not be used!"), s = n.t258 ? Math.min(32, n.t258[0]) * n.t258.length : n.t277 ? n.t277[0] : 1, 1 == h && null != n.t279 && n.t278 && 32803 == n.t262[0] && (s = Math.round(8 * n.t279[0] / (n.width * n.t278[0])));
+					var l = 8 * Math.ceil(n.width * s / 8), d = n.t273;
+					null == d && (d = n.t324);
+					var u = n.t279;
+					1 == h && 1 == d.length && (u = [n.height * (l >>> 3)]), null == u && (u = n.t325);
+					var c = new Uint8Array(n.height * (l >>> 3)), _ = 0;
+					if (null != n.t322) {
+						for (var g = n.t322[0], v = n.t323[0], w = Math.floor((n.width + g - 1) / g), b = Math.floor((n.height + v - 1) / v), p = new Uint8Array(0 | Math.ceil(g * v * s / 8)), m = 0; m < b; m++) for (var k = 0; k < w; k++) {
+							for (var y = m * w + k, x = 0; x < p.length; x++) p[x] = 0;
+							t.decode._decompress(n, i, a, d[y], u[y], h, p, 0, f), 6 == h ? c = p : t._copyTile(p, 0 | Math.ceil(g * s / 8), v, c, 0 | Math.ceil(n.width * s / 8), n.height, 0 | Math.ceil(k * g * s / 8), m * v);
+						}
+						_ = 8 * c.length;
+					} else {
+						var E = n.t278 ? n.t278[0] : n.height;
+						E = Math.min(E, n.height);
+						for (y = 0; y < d.length; y++) t.decode._decompress(n, i, a, d[y], u[y], h, c, 0 | Math.ceil(_ / 8), f), _ += l * E;
+						_ = Math.min(_, 8 * c.length);
+					}
+					n.data = new Uint8Array(c.buffer, 0, 0 | Math.ceil(_ / 8));
+				}
+			}, t.decode._decompress = function(n, i, a, o, s, h, f, l, d) {
+				if (1 == h || s == f.length && 32767 != h) for (var u = 0; u < s; u++) f[l + u] = a[o + u];
+				else if (3 == h) t.decode._decodeG3(a, o, s, f, l, n.width, d);
+				else if (4 == h) t.decode._decodeG4(a, o, s, f, l, n.width, d);
+				else if (5 == h) t.decode._decodeLZW(a, o, f, l);
+				else if (6 == h) t.decode._decodeOldJPEG(n, a, o, s, f, l);
+				else if (7 == h) t.decode._decodeNewJPEG(n, a, o, s, f, l);
+				else if (8 == h) for (var c = new Uint8Array(a.buffer, o, s), _ = e.inflate(c), g = 0; g < _.length; g++) f[l + g] = _[g];
+				else 32767 == h ? t.decode._decodeARW(n, a, o, s, f, l) : 32773 == h ? t.decode._decodePackBits(a, o, s, f, l) : 32809 == h ? t.decode._decodeThunder(a, o, s, f, l) : 34713 == h ? t.decode._decodeNikon(n, i, a, o, s, f, l) : r("Unknown compression", h);
+				var v = n.t258 ? Math.min(32, n.t258[0]) : 1, w = n.t277 ? n.t277[0] : 1, b = v * w >>> 3, p = n.t278 ? n.t278[0] : n.height, m = Math.ceil(v * w * n.width / 8);
+				if (16 == v && !n.isLE && null == n.t33422) for (var k = 0; k < p; k++) for (var y = l + k * m, x = 1; x < m; x += 2) {
+					var E = f[y + x];
+					f[y + x] = f[y + x - 1], f[y + x - 1] = E;
+				}
+				if (n.t317 && 2 == n.t317[0]) for (k = 0; k < p; k++) {
+					var z = l + k * m;
+					if (16 == v) for (u = b; u < m; u += 2) {
+						var B = (f[z + u + 1] << 8 | f[z + u]) + (f[z + u - b + 1] << 8 | f[z + u - b]);
+						f[z + u] = 255 & B, f[z + u + 1] = B >>> 8 & 255;
+					}
+					else if (3 == w) for (u = 3; u < m; u += 3) f[z + u] = f[z + u] + f[z + u - 3] & 255, f[z + u + 1] = f[z + u + 1] + f[z + u - 2] & 255, f[z + u + 2] = f[z + u + 2] + f[z + u - 1] & 255;
+					else for (u = b; u < m; u++) f[z + u] = f[z + u] + f[z + u - b] & 255;
+				}
+			}, t.decode._ljpeg_diff = function(e, r, n) {
+				var i, a, o = t.decode._getbithuff;
+				return i = o(e, r, n[0], n), (a = o(e, r, i, 0)) & 1 << i - 1 || (a -= (1 << i) - 1), a;
+			}, t.decode._decodeARW = function(e, r, n, i, a, o) {
+				var s = e.t256[0], h = e.t257[0], f = e.t258[0], l = e.isLE ? t._binLE : t._binBE;
+				if (s * h == i || s * h * 1.5 == i) if (s * h * 1.5 != i) {
+					var d, u, c, _, g, v, w, b, p = /* @__PURE__ */ new Uint16Array(16), m = new Uint8Array(s + 1);
+					for (S = 0; S < h; S++) {
+						for (var k = 0; k < s; k++) m[k] = r[n++];
+						for (b = 0, A = 0; A < s - 30; b += 16) {
+							for (u = 2047 & (d = l.readUint(m, b)), c = 2047 & d >>> 11, _ = 15 & d >>> 22, g = 15 & d >>> 26, v = 0; v < 4 && 128 << v <= u - c; v++);
+							for (w = 30, y = 0; y < 16; y++) y == _ ? p[y] = u : y == g ? p[y] = c : (p[y] = ((l.readUshort(m, b + (w >> 3)) >>> (7 & w) & 127) << v) + c, p[y] > 2047 && (p[y] = 2047), w += 7);
+							for (y = 0; y < 16; y++, A += 2) {
+								O = p[y] << 1;
+								t.decode._putsF(a, (S * s + A) * f, O << 16 - f);
+							}
+							A -= 1 & A ? 1 : 31;
+						}
+					}
+				} else for (var y = 0; y < i; y += 3) {
+					var x = r[n + y + 0], E = r[n + y + 1], z = r[n + y + 2];
+					a[o + y] = E << 4 | x >>> 4, a[o + y + 1] = x << 4 | z >>> 4, a[o + y + 2] = z << 4 | E >>> 4;
+				}
+				else {
+					h += 8;
+					var B, A, S, U = [
+						n,
+						0,
+						0,
+						0
+					], I = /* @__PURE__ */ new Uint16Array(32770), D = [
+						3857,
+						3856,
+						3599,
+						3342,
+						3085,
+						2828,
+						2571,
+						2314,
+						2057,
+						1800,
+						1543,
+						1286,
+						1029,
+						772,
+						771,
+						768,
+						514,
+						513
+					], M = 0, N = t.decode._ljpeg_diff;
+					for (I[0] = 15, B = y = 0; y < 18; y++) for (var F = 32768 >>> (D[y] >>> 8), C = 0; C < F; C++) I[++B] = D[y];
+					for (A = s; A--;) for (S = 0; S < h + 1; S += 2) if (S == h && (S = 1), M += N(r, U, I), S < h) {
+						var O = 4095 & M;
+						t.decode._putsF(a, (S * s + A) * f, O << 16 - f);
+					}
+				}
+			}, t.decode._decodeNikon = function(e, r, n, i, a, o, s) {
+				var h = [
+					[
+						0,
+						0,
+						1,
+						5,
+						1,
+						1,
+						1,
+						1,
+						1,
+						1,
+						2,
+						0,
+						0,
+						0,
+						0,
+						0,
+						0,
+						5,
+						4,
+						3,
+						6,
+						2,
+						7,
+						1,
+						0,
+						8,
+						9,
+						11,
+						10,
+						12
+					],
+					[
+						0,
+						0,
+						1,
+						5,
+						1,
+						1,
+						1,
+						1,
+						1,
+						1,
+						2,
+						0,
+						0,
+						0,
+						0,
+						0,
+						0,
+						57,
+						90,
+						56,
+						39,
+						22,
+						5,
+						4,
+						3,
+						2,
+						1,
+						0,
+						11,
+						12,
+						12
+					],
+					[
+						0,
+						0,
+						1,
+						4,
+						2,
+						3,
+						1,
+						2,
+						0,
+						0,
+						0,
+						0,
+						0,
+						0,
+						0,
+						0,
+						0,
+						5,
+						4,
+						6,
+						3,
+						7,
+						2,
+						8,
+						1,
+						9,
+						0,
+						10,
+						11,
+						12
+					],
+					[
+						0,
+						0,
+						1,
+						4,
+						3,
+						1,
+						1,
+						1,
+						1,
+						1,
+						2,
+						0,
+						0,
+						0,
+						0,
+						0,
+						0,
+						5,
+						6,
+						4,
+						7,
+						8,
+						3,
+						9,
+						2,
+						1,
+						0,
+						10,
+						11,
+						12,
+						13,
+						14
+					],
+					[
+						0,
+						0,
+						1,
+						5,
+						1,
+						1,
+						1,
+						1,
+						1,
+						1,
+						1,
+						2,
+						0,
+						0,
+						0,
+						0,
+						0,
+						8,
+						92,
+						75,
+						58,
+						41,
+						7,
+						6,
+						5,
+						4,
+						3,
+						2,
+						1,
+						0,
+						13,
+						14
+					],
+					[
+						0,
+						0,
+						1,
+						4,
+						2,
+						2,
+						3,
+						1,
+						2,
+						0,
+						0,
+						0,
+						0,
+						0,
+						0,
+						0,
+						0,
+						7,
+						6,
+						8,
+						5,
+						9,
+						4,
+						10,
+						3,
+						11,
+						12,
+						2,
+						0,
+						1,
+						13,
+						14
+					]
+				], f = e.t256[0], l = e.t257[0], d = e.t258[0], u = 0, c = 0, _ = t.decode._make_decoder, g = t.decode._getbithuff, v = r[0].exifIFD.makerNote, w = v.t150 ? v.t150 : v.t140, b = 0, p = w[b++], m = w[b++];
+				73 != p && 88 != m || (b += 2110), 70 == p && (u = 2), 14 == d && (u += 3);
+				for (var k = [[0, 0], [0, 0]], y = e.isLE ? t._binLE : t._binBE, x = 0; x < 2; x++) for (var E = 0; E < 2; E++) k[x][E] = y.readShort(w, b), b += 2;
+				var z, B, A, S, U, I = 1 << d & 32767, D = 0, M = y.readShort(w, b);
+				b += 2, M > 1 && (D = Math.floor(I / (M - 1))), 68 == p && 32 == m && D > 0 && (c = y.readShort(w, 562));
+				var N = [0, 0], F = _(h[u]), C = [
+					i,
+					0,
+					0,
+					0
+				];
+				for (z = 0; z < l; z++) for (c && z == c && (F = _(h[u + 1])), B = 0; B < f; B++) {
+					x = g(n, C, F[0], F), (U = 1 + (g(n, C, (A = 15 & x) - (S = x >>> 4), 0) << 1) << S >>> 1) & 1 << A - 1 || (U -= (1 << A) - (0 == S ? 1 : 0)), B < 2 ? N[B] = k[1 & z][B] += U : N[1 & B] += U;
+					var O = Math.min(Math.max(N[1 & B], 0), (1 << d) - 1), Z = (z * f + B) * d;
+					t.decode._putsF(o, Z, O << 16 - d);
+				}
+			}, t.decode._putsF = function(t, e, r) {
+				r <<= 8 - (7 & e);
+				var n = e >>> 3;
+				t[n] |= r >>> 16, t[n + 1] |= r >>> 8, t[n + 2] |= r;
+			}, t.decode._getbithuff = function(e, r, n, i) {
+				t.decode._get_byte;
+				var a, o = r[0], s = r[1], h = r[2], f = r[3];
+				if (0 == n || h < 0) return 0;
+				for (; !f && h < n && -1 != (a = e[o++]) && !(f = 0);) s = (s << 8) + a, h += 8;
+				if (a = s << 32 - h >>> 32 - n, i ? (h -= i[a + 1] >>> 8, a = 255 & i[a + 1]) : h -= n, h < 0) throw "e";
+				return r[0] = o, r[1] = s, r[2] = h, r[3] = f, a;
+			}, t.decode._make_decoder = function(t) {
+				var e, r, n, i, a, o = [];
+				for (e = 16; 0 != e && !t[e]; e--);
+				var s = 17;
+				for (o[0] = e, n = r = 1; r <= e; r++) for (i = 0; i < t[r]; i++, ++s) for (a = 0; a < 1 << e - r; a++) n <= 1 << e && (o[n++] = r << 8 | t[s]);
+				return o;
+			}, t.decode._decodeNewJPEG = function(e, r, n, i, a, o) {
+				var s = e.t347, h = s ? s.length : 0, f = new Uint8Array(h + i);
+				if (s) {
+					for (var l = 0, d = 0; d < h - 1 && (255 != s[d] || 217 != s[d + 1]); d++) f[l++] = s[d];
+					var u = r[n], c = r[n + 1];
+					255 == u && 216 == c || (f[l++] = u, f[l++] = c);
+					for (d = 2; d < i; d++) f[l++] = r[n + d];
+				} else for (d = 0; d < i; d++) f[d] = r[n + d];
+				if (32803 == e.t262[0] || 34892 == e.t262[0]) {
+					var _ = e.t258[0], g = t.LosslessJpegDecode(f), v = g.length;
+					if (16 == _) if (e.isLE) for (d = 0; d < v; d++) a[o + (d << 1)] = 255 & g[d], a[o + (d << 1) + 1] = g[d] >>> 8;
+					else for (d = 0; d < v; d++) a[o + (d << 1)] = g[d] >>> 8, a[o + (d << 1) + 1] = 255 & g[d];
+					else {
+						if (14 != _ && 12 != _) throw new Error("unsupported bit depth " + _);
+						var w = 16 - _;
+						for (d = 0; d < v; d++) t.decode._putsF(a, d * _, g[d] << w);
+					}
+				} else {
+					var b = new t.JpegDecoder();
+					b.parse(f);
+					var p = b.getData(b.width, b.height);
+					for (d = 0; d < p.length; d++) a[o + d] = p[d];
+				}
+				6 == e.t262[0] && (e.t262[0] = 2);
+			}, t.decode._decodeOldJPEGInit = function(t, e, n, i) {
+				var a, o, s, h, f, l = 216, d = 0, u = 0, c = !1, _ = t.t513, g = _ ? _[0] : 0, v = t.t514, w = v ? v[0] : 0, b = t.t324 || t.t273 || _, p = t.t530, m = 0, k = 0, y = t.t277 ? t.t277[0] : 1, x = t.t515;
+				if (b && (u = b[0], c = b.length > 1), !c) {
+					if (255 == e[n] && e[n + 1] == l) return { jpegOffset: n };
+					if (null != _ && (255 == e[n + g] && e[n + g + 1] == l ? d = n + g : r("JPEGInterchangeFormat does not point to SOI"), null == v ? r("JPEGInterchangeFormatLength field is missing") : (g >= u || g + w <= u) && r("JPEGInterchangeFormatLength field value is invalid"), null != d)) return { jpegOffset: d };
+				}
+				if (null != p && (m = p[0], k = p[1]), null != _ && null != v) if (w >= 2 && g + w <= u) {
+					for (a = 255 == e[n + g + w - 2] && e[n + g + w - 1] == l ? new Uint8Array(w - 2) : new Uint8Array(w), s = 0; s < a.length; s++) a[s] = e[n + g + s];
+					r("Incorrect JPEG interchange format: using JPEGInterchangeFormat offset to derive tables");
+				} else r("JPEGInterchangeFormat+JPEGInterchangeFormatLength > offset to first strip or tile");
+				if (null == a) {
+					var E = 0, z = [];
+					z[E++] = 255, z[E++] = l;
+					var B = t.t519;
+					if (null == B) throw new Error("JPEGQTables tag is missing");
+					for (s = 0; s < B.length; s++) for (z[E++] = 255, z[E++] = 219, z[E++] = 0, z[E++] = 67, z[E++] = s, h = 0; h < 64; h++) z[E++] = e[n + B[s] + h];
+					for (f = 0; f < 2; f++) {
+						var A = t[0 == f ? "t520" : "t521"];
+						if (null == A) throw new Error((0 == f ? "JPEGDCTables" : "JPEGACTables") + " tag is missing");
+						for (s = 0; s < A.length; s++) {
+							z[E++] = 255, z[E++] = 196;
+							var S = 19;
+							for (h = 0; h < 16; h++) S += e[n + A[s] + h];
+							for (z[E++] = S >>> 8, z[E++] = 255 & S, z[E++] = s | f << 4, h = 0; h < 16; h++) z[E++] = e[n + A[s] + h];
+							for (h = 0; h < S; h++) z[E++] = e[n + A[s] + 16 + h];
+						}
+					}
+					if (z[E++] = 255, z[E++] = 192, z[E++] = 0, z[E++] = 8 + 3 * y, z[E++] = 8, z[E++] = t.height >>> 8 & 255, z[E++] = 255 & t.height, z[E++] = t.width >>> 8 & 255, z[E++] = 255 & t.width, z[E++] = y, 1 == y) z[E++] = 1, z[E++] = 17, z[E++] = 0;
+					else for (s = 0; s < 3; s++) z[E++] = s + 1, z[E++] = 0 != s ? 17 : (15 & m) << 4 | 15 & k, z[E++] = s;
+					null != x && 0 != x[0] && (z[E++] = 255, z[E++] = 221, z[E++] = 0, z[E++] = 4, z[E++] = x[0] >>> 8 & 255, z[E++] = 255 & x[0]), a = new Uint8Array(z);
+				}
+				var U = -1;
+				for (s = 0; s < a.length - 1;) {
+					if (255 == a[s] && 192 == a[s + 1]) {
+						U = s;
+						break;
+					}
+					s++;
+				}
+				if (-1 == U) {
+					var I = new Uint8Array(a.length + 10 + 3 * y);
+					I.set(a);
+					var D = a.length;
+					if (U = a.length, (a = I)[D++] = 255, a[D++] = 192, a[D++] = 0, a[D++] = 8 + 3 * y, a[D++] = 8, a[D++] = t.height >>> 8 & 255, a[D++] = 255 & t.height, a[D++] = t.width >>> 8 & 255, a[D++] = 255 & t.width, a[D++] = y, 1 == y) a[D++] = 1, a[D++] = 17, a[D++] = 0;
+					else for (s = 0; s < 3; s++) a[D++] = s + 1, a[D++] = 0 != s ? 17 : (15 & m) << 4 | 15 & k, a[D++] = s;
+				}
+				if (255 == e[u] && 218 == e[u + 1]) {
+					var M = e[u + 2] << 8 | e[u + 3];
+					for ((o = new Uint8Array(M + 2))[0] = e[u], o[1] = e[u + 1], o[2] = e[u + 2], o[3] = e[u + 3], s = 0; s < M - 2; s++) o[s + 4] = e[u + s + 4];
+				} else {
+					var N = 0;
+					if ((o = new Uint8Array(8 + 2 * y))[N++] = 255, o[N++] = 218, o[N++] = 0, o[N++] = 6 + 2 * y, o[N++] = y, 1 == y) o[N++] = 1, o[N++] = 0;
+					else for (s = 0; s < 3; s++) o[N++] = s + 1, o[N++] = s << 4 | s;
+					o[N++] = 0, o[N++] = 63, o[N++] = 0;
+				}
+				return {
+					jpegOffset: n,
+					tables: a,
+					sosMarker: o,
+					sofPosition: U
+				};
+			}, t.decode._decodeOldJPEG = function(e, r, n, i, a, o) {
+				var s, h, f, l, d = t.decode._decodeOldJPEGInit(e, r, n, i);
+				if (null != d.jpegOffset) for (s = n + i - d.jpegOffset, f = new Uint8Array(s), _ = 0; _ < s; _++) f[_] = r[d.jpegOffset + _];
+				else {
+					for (h = d.tables.length, (f = new Uint8Array(h + d.sosMarker.length + i + 2)).set(d.tables), l = h, f[d.sofPosition + 5] = e.height >>> 8 & 255, f[d.sofPosition + 6] = 255 & e.height, f[d.sofPosition + 7] = e.width >>> 8 & 255, f[d.sofPosition + 8] = 255 & e.width, 255 == r[n] && r[n + 1] == SOS || (f.set(d.sosMarker, l), l += sosMarker.length), _ = 0; _ < i; _++) f[l++] = r[n + _];
+					f[l++] = 255, f[l++] = EOI;
+				}
+				var u = new t.JpegDecoder();
+				u.parse(f);
+				for (var c = u.getData(u.width, u.height), _ = 0; _ < c.length; _++) a[o + _] = c[_];
+				e.t262 && 6 == e.t262[0] && (e.t262[0] = 2);
+			}, t.decode._decodePackBits = function(t, e, r, n, i) {
+				for (var a = new Int8Array(t.buffer), o = new Int8Array(n.buffer), s = e + r; e < s;) {
+					var h = a[e];
+					if (e++, h >= 0 && h < 128) for (var f = 0; f < h + 1; f++) o[i] = a[e], i++, e++;
+					if (h >= -127 && h < 0) {
+						for (f = 0; f < 1 - h; f++) o[i] = a[e], i++;
+						e++;
+					}
+				}
+			}, t.decode._decodeThunder = function(t, e, r, n, i) {
+				for (var a = [
+					0,
+					1,
+					0,
+					-1
+				], o = [
+					0,
+					1,
+					2,
+					3,
+					0,
+					-3,
+					-2,
+					-1
+				], s = e + r, h = 2 * i, f = 0; e < s;) {
+					var l = t[e], d = l >>> 6, u = 63 & l;
+					if (e++, 3 == d && (f = 15 & u, n[h >>> 1] |= f << 4 * (1 - h & 1), h++), 0 == d) for (var c = 0; c < u; c++) n[h >>> 1] |= f << 4 * (1 - h & 1), h++;
+					if (2 == d) for (c = 0; c < 2; c++) 4 != (_ = u >>> 3 * (1 - c) & 7) && (f += o[_], n[h >>> 1] |= f << 4 * (1 - h & 1), h++);
+					if (1 == d) for (c = 0; c < 3; c++) {
+						var _;
+						2 != (_ = u >>> 2 * (2 - c) & 3) && (f += a[_], n[h >>> 1] |= f << 4 * (1 - h & 1), h++);
+					}
+				}
+			}, t.decode._dmap = {
+				1: 0,
+				"011": 1,
+				"000011": 2,
+				"0000011": 3,
+				"010": -1,
+				"000010": -2,
+				"0000010": -3
+			}, t.decode._lens = function() {
+				var t = function(t, e, r, n) {
+					for (var i = 0; i < e.length; i++) t[e[i]] = r + i * n;
+				}, e = "00110101,000111,0111,1000,1011,1100,1110,1111,10011,10100,00111,01000,001000,000011,110100,110101,101010,101011,0100111,0001100,0001000,0010111,0000011,0000100,0101000,0101011,0010011,0100100,0011000,00000010,00000011,00011010,00011011,00010010,00010011,00010100,00010101,00010110,00010111,00101000,00101001,00101010,00101011,00101100,00101101,00000100,00000101,00001010,00001011,01010010,01010011,01010100,01010101,00100100,00100101,01011000,01011001,01011010,01011011,01001010,01001011,00110010,00110011,00110100", r = "0000110111,010,11,10,011,0011,0010,00011,000101,000100,0000100,0000101,0000111,00000100,00000111,000011000,0000010111,0000011000,0000001000,00001100111,00001101000,00001101100,00000110111,00000101000,00000010111,00000011000,000011001010,000011001011,000011001100,000011001101,000001101000,000001101001,000001101010,000001101011,000011010010,000011010011,000011010100,000011010101,000011010110,000011010111,000001101100,000001101101,000011011010,000011011011,000001010100,000001010101,000001010110,000001010111,000001100100,000001100101,000001010010,000001010011,000000100100,000000110111,000000111000,000000100111,000000101000,000001011000,000001011001,000000101011,000000101100,000001011010,000001100110,000001100111", n = "11011,10010,010111,0110111,00110110,00110111,01100100,01100101,01101000,01100111,011001100,011001101,011010010,011010011,011010100,011010101,011010110,011010111,011011000,011011001,011011010,011011011,010011000,010011001,010011010,011000,010011011", i = "0000001111,000011001000,000011001001,000001011011,000000110011,000000110100,000000110101,0000001101100,0000001101101,0000001001010,0000001001011,0000001001100,0000001001101,0000001110010,0000001110011,0000001110100,0000001110101,0000001110110,0000001110111,0000001010010,0000001010011,0000001010100,0000001010101,0000001011010,0000001011011,0000001100100,0000001100101", a = "00000001000,00000001100,00000001101,000000010010,000000010011,000000010100,000000010101,000000010110,000000010111,000000011100,000000011101,000000011110,000000011111";
+				e = e.split(","), r = r.split(","), n = n.split(","), i = i.split(","), a = a.split(",");
+				var o = {}, s = {};
+				return t(o, e, 0, 1), t(o, n, 64, 64), t(o, a, 1792, 64), t(s, r, 0, 1), t(s, i, 64, 64), t(s, a, 1792, 64), [o, s];
+			}(), t.decode._decodeG4 = function(e, r, n, i, a, o, s) {
+				for (var h = t.decode, f = r << 3, l = 0, d = "", u = [], c = [], _ = 0; _ < o; _++) c.push(0);
+				c = h._makeDiff(c);
+				for (var g = 0, v = 0, w = 0, b = 0, p = 0, m = 0, k = "", y = 0, x = 8 * Math.ceil(o / 8); f >>> 3 < r + n;) {
+					w = h._findDiff(c, g + (0 == g ? 0 : 1), 1 - p), b = h._findDiff(c, w, p);
+					var E = 0;
+					if (1 == s && (E = e[f >>> 3] >>> 7 - (7 & f) & 1), 2 == s && (E = e[f >>> 3] >>> (7 & f) & 1), f++, d += E, "H" == k) {
+						if (null != h._lens[p][d]) {
+							var z = h._lens[p][d];
+							d = "", l += z, z < 64 && (h._addNtimes(u, l, p), g += l, p = 1 - p, l = 0, 0 == --y && (k = ""));
+						}
+					} else "0001" == d && (d = "", h._addNtimes(u, b - g, p), g = b), "001" == d && (d = "", k = "H", y = 2), null != h._dmap[d] && (v = w + h._dmap[d], h._addNtimes(u, v - g, p), g = v, d = "", p = 1 - p);
+					u.length == o && "" == k && (h._writeBits(u, i, 8 * a + m * x), p = 0, m++, g = 0, c = h._makeDiff(u), u = []);
+				}
+			}, t.decode._findDiff = function(t, e, r) {
+				for (var n = 0; n < t.length; n += 2) if (t[n] >= e && t[n + 1] == r) return t[n];
+			}, t.decode._makeDiff = function(t) {
+				var e = [];
+				1 == t[0] && e.push(0, 1);
+				for (var r = 1; r < t.length; r++) t[r - 1] != t[r] && e.push(r, t[r]);
+				return e.push(t.length, 0, t.length, 1), e;
+			}, t.decode._decodeG3 = function(e, r, n, i, a, o, s) {
+				for (var h = t.decode, f = r << 3, l = 0, d = "", u = [], c = [], _ = 0; _ < o; _++) u.push(0);
+				for (var g = 0, v = 0, w = 0, b = 0, p = 0, m = -1, k = "", y = 0, x = !1, E = 8 * Math.ceil(o / 8); f >>> 3 < r + n;) {
+					w = h._findDiff(c, g + (0 == g ? 0 : 1), 1 - p), b = h._findDiff(c, w, p);
+					var z = 0;
+					if (1 == s && (z = e[f >>> 3] >>> 7 - (7 & f) & 1), 2 == s && (z = e[f >>> 3] >>> (7 & f) & 1), f++, d += z, x) {
+						if (null != h._lens[p][d]) {
+							var B = h._lens[p][d];
+							d = "", l += B, B < 64 && (h._addNtimes(u, l, p), p = 1 - p, l = 0);
+						}
+					} else if ("H" == k) {
+						if (null != h._lens[p][d]) {
+							B = h._lens[p][d];
+							d = "", l += B, B < 64 && (h._addNtimes(u, l, p), g += l, p = 1 - p, l = 0, 0 == --y && (k = ""));
+						}
+					} else "0001" == d && (d = "", h._addNtimes(u, b - g, p), g = b), "001" == d && (d = "", k = "H", y = 2), null != h._dmap[d] && (v = w + h._dmap[d], h._addNtimes(u, v - g, p), g = v, d = "", p = 1 - p);
+					d.endsWith("000000000001") && (m >= 0 && h._writeBits(u, i, 8 * a + m * E), 1 == s && (x = 1 == (e[f >>> 3] >>> 7 - (7 & f) & 1)), 2 == s && (x = 1 == (e[f >>> 3] >>> (7 & f) & 1)), f++, null == h._decodeG3.allow2D && (h._decodeG3.allow2D = x), h._decodeG3.allow2D || (x = !0, f--), d = "", p = 0, m++, g = 0, c = h._makeDiff(u), u = []);
+				}
+				u.length == o && h._writeBits(u, i, 8 * a + m * E);
+			}, t.decode._addNtimes = function(t, e, r) {
+				for (var n = 0; n < e; n++) t.push(r);
+			}, t.decode._writeBits = function(t, e, r) {
+				for (var n = 0; n < t.length; n++) e[r + n >>> 3] |= t[n] << 7 - (r + n & 7);
+			}, t.decode._decodeLZW = function(e, r, n, i) {
+				if (null == t.decode._lzwTab) {
+					for (var a = /* @__PURE__ */ new Uint32Array(65535), o = /* @__PURE__ */ new Uint16Array(65535), s = /* @__PURE__ */ new Uint8Array(2e6), h = 0; h < 256; h++) s[h << 2] = h, a[h] = h << 2, o[h] = 1;
+					t.decode._lzwTab = [
+						a,
+						o,
+						s
+					];
+				}
+				for (var f = t.decode._copyData, l = t.decode._lzwTab[0], d = t.decode._lzwTab[1], u = (s = t.decode._lzwTab[2], 258), c = 1032, _ = 9, g = r << 3, v = 0, w = 0; v = (e[g >>> 3] << 16 | e[g + 8 >>> 3] << 8 | e[g + 16 >>> 3]) >> 24 - (7 & g) - _ & (1 << _) - 1, g += _, 257 != v;) {
+					if (256 == v) {
+						if (_ = 9, u = 258, c = 1032, v = (e[g >>> 3] << 16 | e[g + 8 >>> 3] << 8 | e[g + 16 >>> 3]) >> 24 - (7 & g) - _ & (1 << _) - 1, g += _, 257 == v) break;
+						n[i] = v, i++;
+					} else if (v < u) {
+						var b = l[v], p = d[v];
+						if (f(s, b, n, i, p), i += p, w >= u) l[u] = c, s[l[u]] = b[0], d[u] = 1, c = c + 1 + 3 & -4, u++;
+						else l[u] = c, f(s, l[w], s, c, m = d[w]), s[c + m] = s[b], m++, d[u] = m, u++, c = c + m + 3 & -4;
+						u + 1 == 1 << _ && _++;
+					} else {
+						var m;
+						if (w >= u) l[u] = c, d[u] = 0, u++;
+						else l[u] = c, f(s, l[w], s, c, m = d[w]), s[c + m] = s[c], m++, d[u] = m, u++, f(s, c, n, i, m), i += m, c = c + m + 3 & -4;
+						u + 1 == 1 << _ && _++;
+					}
+					w = v;
+				}
+			}, t.decode._copyData = function(t, e, r, n, i) {
+				for (var a = 0; a < i; a += 4) r[n + a] = t[e + a], r[n + a + 1] = t[e + a + 1], r[n + a + 2] = t[e + a + 2], r[n + a + 3] = t[e + a + 3];
+			}, t.tags = {}, t.ttypes = {
+				256: 3,
+				257: 3,
+				258: 3,
+				259: 3,
+				262: 3,
+				273: 4,
+				274: 3,
+				277: 3,
+				278: 4,
+				279: 4,
+				282: 5,
+				283: 5,
+				284: 3,
+				286: 5,
+				287: 5,
+				296: 3,
+				305: 2,
+				306: 2,
+				338: 3,
+				513: 4,
+				514: 4,
+				34665: 4
+			}, t._readIFD = function(e, n, i, a, o, s) {
+				var h = e.readUshort(n, i);
+				i += 2;
+				var f = {};
+				a.push(f), s && r("   ".repeat(o), a.length - 1, ">>>----------------");
+				for (var l = 0; l < h; l++) {
+					var d = e.readUshort(n, i);
+					i += 2;
+					var u = e.readUshort(n, i);
+					i += 2;
+					var c = e.readUint(n, i);
+					i += 4;
+					var _ = e.readUint(n, i);
+					i += 4;
+					var g = [];
+					if (1 != u && 7 != u || (g = new Uint8Array(n.buffer, c < 5 ? i - 4 : _, c)), 2 == u) {
+						var v = c < 5 ? i - 4 : _;
+						n[v] < 128 ? g.push(e.readASCII(n, v, c - 1)) : g = new Uint8Array(n.buffer, v, c - 1);
+					}
+					if (3 == u) for (var w = 0; w < c; w++) g.push(e.readUshort(n, (c < 3 ? i - 4 : _) + 2 * w));
+					if (4 == u) for (w = 0; w < c; w++) g.push(e.readUint(n, (c < 2 ? i - 4 : _) + 4 * w));
+					if (5 == u) for (w = 0; w < c; w++) g.push(e.readUint(n, _ + 8 * w) / e.readUint(n, _ + 8 * w + 4));
+					if (8 == u) for (w = 0; w < c; w++) g.push(e.readShort(n, (c < 3 ? i - 4 : _) + 2 * w));
+					if (9 == u) for (w = 0; w < c; w++) g.push(e.readInt(n, (c < 2 ? i - 4 : _) + 4 * w));
+					if (10 == u) for (w = 0; w < c; w++) g.push(e.readInt(n, _ + 8 * w) / e.readInt(n, _ + 8 * w + 4));
+					if (11 == u) for (w = 0; w < c; w++) g.push(e.readFloat(n, _ + 4 * w));
+					if (12 == u) for (w = 0; w < c; w++) g.push(e.readDouble(n, _ + 8 * w));
+					if (f["t" + d] = g, 0 != c && 0 == g.length && r("unknown TIFF tag type: ", u, "num:", c), s && r("   ".repeat(o), d, u, t.tags[d], g), 330 == d && f.t272 && "DSLR-A100" == f.t272[0]);
+					else if (330 == d || 34665 == d || 50740 == d && e.readUshort(n, e.readUint(g, 0)) < 300) {
+						var b = 50740 == d ? [e.readUint(g, 0)] : g, p = [];
+						for (w = 0; w < b.length; w++) t._readIFD(e, n, b[w], p, o + 1, s);
+						330 == d && (f.subIFD = p), 34665 == d && (f.exifIFD = p[0]), 50740 == d && (f.dngPrvt = p[0]);
+					}
+					if (37500 == d) {
+						var m = g;
+						if ("Nikon" == e.readASCII(m, 0, 5)) f.makerNote = t.decode(m.slice(10).buffer)[0];
+						else if (e.readUshort(n, _) < 300) {
+							var k = [];
+							t._readIFD(e, n, _, k, o + 1, s), f.makerNote = k[0];
+						}
+					}
+				}
+				return s && r("   ".repeat(o), "<<<---------------"), i;
+			}, t._writeIFD = function(e, r, n, i) {
+				var a = Object.keys(i);
+				e.writeUshort(r, n, a.length);
+				for (var o = (n += 2) + 12 * a.length + 4, s = 0; s < a.length; s++) {
+					var h = a[s], f = parseInt(h.slice(1)), l = t.ttypes[f];
+					if (null == l) throw new Error("unknown type of tag: " + f);
+					var d = i[h];
+					2 == l && (d = d[0] + "\0");
+					var u = d.length;
+					e.writeUshort(r, n, f), n += 2, e.writeUshort(r, n, l), n += 2, e.writeUint(r, n, u);
+					var c = [
+						-1,
+						1,
+						1,
+						2,
+						4,
+						8,
+						0,
+						0,
+						0,
+						0,
+						0,
+						0,
+						8
+					][l] * u, _ = n += 4;
+					if (c > 4 && (e.writeUint(r, n, o), _ = o), 2 == l && e.writeASCII(r, _, d), 3 == l) for (var g = 0; g < u; g++) e.writeUshort(r, _ + 2 * g, d[g]);
+					if (4 == l) for (g = 0; g < u; g++) e.writeUint(r, _ + 4 * g, d[g]);
+					if (5 == l) for (g = 0; g < u; g++) e.writeUint(r, _ + 8 * g, Math.round(1e4 * d[g])), e.writeUint(r, _ + 8 * g + 4, 1e4);
+					if (12 == l) for (g = 0; g < u; g++) e.writeDouble(r, _ + 8 * g, d[g]);
+					c > 4 && (o += c += 1 & c), n += 4;
+				}
+				return [n, o];
+			}, t.toRGBA8 = function(t) {
+				var e = t.width, n = t.height, i = e * n, a = 4 * i, o = t.data, s = new Uint8Array(4 * i), h = t.t262 ? t.t262[0] : 2, f = t.t258 ? Math.min(32, t.t258[0]) : 1;
+				if (0 == h) for (var l = Math.ceil(f * e / 8), d = 0; d < n; d++) {
+					var u = d * l, c = d * e;
+					if (1 == f) for (var _ = 0; _ < e; _++) {
+						var g = c + _ << 2, v = o[u + (_ >> 3)] >> 7 - (7 & _) & 1;
+						s[g] = s[g + 1] = s[g + 2] = 255 * (1 - v), s[g + 3] = 255;
+					}
+					if (4 == f) for (_ = 0; _ < e; _++) {
+						g = c + _ << 2, v = o[u + (_ >> 1)] >> 4 - 4 * (1 & _) & 15;
+						s[g] = s[g + 1] = s[g + 2] = 17 * (15 - v), s[g + 3] = 255;
+					}
+					if (8 == f) for (_ = 0; _ < e; _++) {
+						g = c + _ << 2, v = o[u + _];
+						s[g] = s[g + 1] = s[g + 2] = 255 - v, s[g + 3] = 255;
+					}
+				}
+				else if (1 == h) for (l = Math.ceil(f * e / 8), d = 0; d < n; d++) {
+					u = d * l, c = d * e;
+					if (1 == f) for (_ = 0; _ < e; _++) {
+						g = c + _ << 2, v = o[u + (_ >> 3)] >> 7 - (7 & _) & 1;
+						s[g] = s[g + 1] = s[g + 2] = 255 * v, s[g + 3] = 255;
+					}
+					if (2 == f) for (_ = 0; _ < e; _++) {
+						g = c + _ << 2, v = o[u + (_ >> 2)] >> 6 - 2 * (3 & _) & 3;
+						s[g] = s[g + 1] = s[g + 2] = 85 * v, s[g + 3] = 255;
+					}
+					if (8 == f) for (_ = 0; _ < e; _++) {
+						g = c + _ << 2, v = o[u + _];
+						s[g] = s[g + 1] = s[g + 2] = v, s[g + 3] = 255;
+					}
+					if (16 == f) for (_ = 0; _ < e; _++) {
+						g = c + _ << 2, v = o[u + (2 * _ + 1)];
+						s[g] = s[g + 1] = s[g + 2] = Math.min(255, v), s[g + 3] = 255;
+					}
+				}
+				else if (2 == h) {
+					var w = t.t258 ? t.t258.length : 3;
+					if (8 == f) {
+						if (4 == w) for (_ = 0; _ < a; _++) s[_] = o[_];
+						if (3 == w) for (_ = 0; _ < i; _++) {
+							var b = 3 * _;
+							s[g = _ << 2] = o[b], s[g + 1] = o[b + 1], s[g + 2] = o[b + 2], s[g + 3] = 255;
+						}
+					} else {
+						if (4 == w) for (_ = 0; _ < i; _++) {
+							b = 8 * _ + 1;
+							s[g = _ << 2] = o[b], s[g + 1] = o[b + 2], s[g + 2] = o[b + 4], s[g + 3] = o[b + 6];
+						}
+						if (3 == w) for (_ = 0; _ < i; _++) {
+							b = 6 * _ + 1;
+							s[g = _ << 2] = o[b], s[g + 1] = o[b + 2], s[g + 2] = o[b + 4], s[g + 3] = 255;
+						}
+					}
+				} else if (3 == h) {
+					var p = t.t320;
+					for (_ = 0; _ < i; _++) {
+						g = _ << 2;
+						var m = o[_];
+						s[g] = p[m] >> 8, s[g + 1] = p[256 + m] >> 8, s[g + 2] = p[512 + m] >> 8, s[g + 3] = 255;
+					}
+				} else if (5 == h) {
+					var k = (w = t.t258 ? t.t258.length : 4) > 4 ? 1 : 0;
+					for (_ = 0; _ < i; _++) {
+						g = _ << 2;
+						var y = _ * w, x = 255 - o[y], E = 255 - o[y + 1], z = 255 - o[y + 2], B = (255 - o[y + 3]) * (1 / 255);
+						s[g] = ~~(x * B + .5), s[g + 1] = ~~(E * B + .5), s[g + 2] = ~~(z * B + .5), s[g + 3] = 255 * (1 - k) + o[y + 4] * k;
+					}
+				} else r("Unknown Photometric interpretation: " + h);
+				return s;
+			}, t.replaceIMG = function(e) {
+				null == e && (e = document.getElementsByTagName("img"));
+				for (var r = [
+					"tif",
+					"tiff",
+					"dng",
+					"cr2",
+					"nef"
+				], n = 0; n < e.length; n++) {
+					var i = e[n], a = i.getAttribute("src");
+					if (null != a) {
+						var o = a.split(".").pop().toLowerCase();
+						if (-1 != r.indexOf(o)) {
+							var s = new XMLHttpRequest();
+							t._xhrs.push(s), t._imgs.push(i), s.open("GET", a), s.responseType = "arraybuffer", s.onload = t._imgLoaded, s.send();
+						}
+					}
+				}
+			}, t._xhrs = [], t._imgs = [], t._imgLoaded = function(e) {
+				var r = e.target.response, n = t.decode(r), i = n, a = 0, o = i[0];
+				n[0].subIFD && (i = i.concat(n[0].subIFD));
+				for (var s = 0; s < i.length; s++) if (!(null == (c = i[s]).t258 || c.t258.length < 3)) {
+					var h = c.t256 * c.t257;
+					h > a && (a = h, o = c);
+				}
+				t.decodeImage(r, o, n);
+				var f = t.toRGBA8(o), l = o.width, d = o.height, u = t._xhrs.indexOf(e.target), c = t._imgs[u];
+				t._xhrs.splice(u, 1), t._imgs.splice(u, 1);
+				var _ = document.createElement("canvas");
+				_.width = l, _.height = d;
+				var g = _.getContext("2d"), v = g.createImageData(l, d);
+				for (s = 0; s < f.length; s++) v.data[s] = f[s];
+				g.putImageData(v, 0, 0), c.setAttribute("src", _.toDataURL());
+			}, t._binBE = {
+				nextZero: function(t, e) {
+					for (; 0 != t[e];) e++;
+					return e;
+				},
+				readUshort: function(t, e) {
+					return t[e] << 8 | t[e + 1];
+				},
+				readShort: function(e, r) {
+					var n = t._binBE.ui8;
+					return n[0] = e[r + 1], n[1] = e[r + 0], t._binBE.i16[0];
+				},
+				readInt: function(e, r) {
+					var n = t._binBE.ui8;
+					return n[0] = e[r + 3], n[1] = e[r + 2], n[2] = e[r + 1], n[3] = e[r + 0], t._binBE.i32[0];
+				},
+				readUint: function(e, r) {
+					var n = t._binBE.ui8;
+					return n[0] = e[r + 3], n[1] = e[r + 2], n[2] = e[r + 1], n[3] = e[r + 0], t._binBE.ui32[0];
+				},
+				readASCII: function(t, e, r) {
+					for (var n = "", i = 0; i < r; i++) n += String.fromCharCode(t[e + i]);
+					return n;
+				},
+				readFloat: function(e, r) {
+					for (var n = t._binBE.ui8, i = 0; i < 4; i++) n[i] = e[r + 3 - i];
+					return t._binBE.fl32[0];
+				},
+				readDouble: function(e, r) {
+					for (var n = t._binBE.ui8, i = 0; i < 8; i++) n[i] = e[r + 7 - i];
+					return t._binBE.fl64[0];
+				},
+				writeUshort: function(t, e, r) {
+					t[e] = r >> 8 & 255, t[e + 1] = 255 & r;
+				},
+				writeUint: function(t, e, r) {
+					t[e] = r >> 24 & 255, t[e + 1] = r >> 16 & 255, t[e + 2] = r >> 8 & 255, t[e + 3] = 255 & r;
+				},
+				writeASCII: function(t, e, r) {
+					for (var n = 0; n < r.length; n++) t[e + n] = r.charCodeAt(n);
+				},
+				writeDouble: function(e, r, n) {
+					t._binBE.fl64[0] = n;
+					for (var i = 0; i < 8; i++) e[r + i] = t._binBE.ui8[7 - i];
+				}
+			}, t._binBE.ui8 = /* @__PURE__ */ new Uint8Array(8), t._binBE.i16 = new Int16Array(t._binBE.ui8.buffer), t._binBE.i32 = new Int32Array(t._binBE.ui8.buffer), t._binBE.ui32 = new Uint32Array(t._binBE.ui8.buffer), t._binBE.fl32 = new Float32Array(t._binBE.ui8.buffer), t._binBE.fl64 = new Float64Array(t._binBE.ui8.buffer), t._binLE = {
+				nextZero: t._binBE.nextZero,
+				readUshort: function(t, e) {
+					return t[e + 1] << 8 | t[e];
+				},
+				readShort: function(e, r) {
+					var n = t._binBE.ui8;
+					return n[0] = e[r + 0], n[1] = e[r + 1], t._binBE.i16[0];
+				},
+				readInt: function(e, r) {
+					var n = t._binBE.ui8;
+					return n[0] = e[r + 0], n[1] = e[r + 1], n[2] = e[r + 2], n[3] = e[r + 3], t._binBE.i32[0];
+				},
+				readUint: function(e, r) {
+					var n = t._binBE.ui8;
+					return n[0] = e[r + 0], n[1] = e[r + 1], n[2] = e[r + 2], n[3] = e[r + 3], t._binBE.ui32[0];
+				},
+				readASCII: t._binBE.readASCII,
+				readFloat: function(e, r) {
+					for (var n = t._binBE.ui8, i = 0; i < 4; i++) n[i] = e[r + i];
+					return t._binBE.fl32[0];
+				},
+				readDouble: function(e, r) {
+					for (var n = t._binBE.ui8, i = 0; i < 8; i++) n[i] = e[r + i];
+					return t._binBE.fl64[0];
+				}
+			}, t._copyTile = function(t, e, r, n, i, a, o, s) {
+				for (var h = Math.min(e, i - o), f = Math.min(r, a - s), l = 0; l < f; l++) for (var d = (s + l) * i + o, u = l * e, c = 0; c < h; c++) n[d + c] = t[u + c];
+			}, t.LosslessJpegDecode = function() {
+				function t(t) {
+					this.w = t, this.N = 0, this._ = 0, this.G = 0;
+				}
+				t.prototype = {
+					t: function(t) {
+						this.N = Math.max(0, Math.min(this.w.length, t));
+					},
+					i: function() {
+						return this.w[this.N++];
+					},
+					l: function() {
+						var t = this.N;
+						return this.N += 2, this.w[t] << 8 | this.w[t + 1];
+					},
+					J: function() {
+						return 0 == this._ && (this.G = this.w[this.N], this.N += 1 + (this.G + 1 >>> 8), this._ = 8), this.G >>> --this._ & 1;
+					},
+					Z: function(t) {
+						var e = this._, r = this.G, n = Math.min(e, t);
+						t -= n;
+						for (var i = r >>> (e -= n) & (1 << n) - 1; t > 0;) r = this.w[this.N], this.N += 1 + (r + 1 >>> 8), t -= n = Math.min(8, t), i <<= n, i |= r >>> (e = 8 - n) & (1 << n) - 1;
+						return this._ = e, this.G = r, i;
+					}
+				};
+				var e = {};
+				function r(e) {
+					this.z = new t(e), this.D(this.z);
+				}
+				return e.X = function() {
+					return [
+						0,
+						0,
+						-1
+					];
+				}, e.s = function(t, r, n) {
+					t[e.Y(t, 0, n) + 2] = r;
+				}, e.Y = function(t, r, n) {
+					if (-1 != t[r + 2]) return 0;
+					if (0 == n) return r;
+					for (var i = 0; i < 2; i++) {
+						0 == t[r + i] && (t[r + i] = t.length, t.push(0), t.push(0), t.push(-1));
+						var a = e.Y(t, t[r + i], n - 1);
+						if (0 != a) return a;
+					}
+					return 0;
+				}, e.B = function(t, e) {
+					for (var r = 0, n = 0, i = e._, a = e.G, o = e.N;;) if (0 == i && (o += 1 + ((a = e.w[o]) + 1 >>> 8), i = 8), -1 != (n = t[(r = t[r + (a >>> --i & 1)]) + 2])) return e._ = i, e.G = a, e.N = o, n;
+					return -1;
+				}, r.prototype = {
+					$: function(t, e) {
+						this.Q = t.i(), this.F = t.l(), this.o = t.l();
+						var r = this.O = t.i();
+						this.L = [];
+						for (var n = 0; n < r; n++) {
+							var i = t.i();
+							t.i();
+							t.i(), this.L[i] = n;
+						}
+						t.t(t.N + e - (6 + 3 * r));
+					},
+					e: function() {
+						var t = 0, r = this.z.i();
+						null == this.H && (this.H = {});
+						for (var n = this.H[r] = e.X(), i = [], a = 0; a < 16; a++) i[a] = this.z.i(), t += i[a];
+						for (a = 0; a < 16; a++) for (var o = 0; o < i[a]; o++) e.s(n, this.z.i(), a + 1);
+						return t + 17;
+					},
+					W: function(t) {
+						for (; t > 0;) t -= this.e();
+					},
+					p: function(t, e) {
+						var r = t.i();
+						this.U || (this.U = []);
+						for (var n = 0; n < r; n++) {
+							var i = t.i(), a = t.i();
+							this.U[this.L[i]] = this.H[a >>> 4];
+						}
+						this.g = t.i(), t.t(t.N + e - (2 + 2 * r));
+					},
+					D: function(t) {
+						var e = !1;
+						if ((n = t.l()) === r.q) do {
+							var n = t.l(), i = t.l() - 2;
+							switch (n) {
+								case r.m:
+									this.$(t, i);
+									break;
+								case r.K:
+									this.W(i);
+									break;
+								case r.V:
+									this.p(t, i), e = !0;
+									break;
+								default: t.t(t.N + i);
+							}
+						} while (!e);
+					},
+					I: function(t, r) {
+						var n = e.B(r, t);
+						if (16 == n) return -32768;
+						var i = t.Z(n);
+						return i & 1 << n - 1 || (i -= (1 << n) - 1), i;
+					},
+					B: function(t, e) {
+						for (var r = this.z, n = this.O, i = this.F, a = this.I, o = this.g, s = this.o * n, h = this.U, f = 0; f < n; f++) t[f] = a(r, h[f]) + (1 << this.Q - 1);
+						for (var l = n; l < s; l += n) for (f = 0; f < n; f++) t[l + f] = a(r, h[f]) + t[l + f - n];
+						for (var d = e, u = 1; u < i; u++) {
+							for (f = 0; f < n; f++) t[d + f] = a(r, h[f]) + t[d + f - e];
+							for (l = n; l < s; l += n) for (f = 0; f < n; f++) {
+								var c = d + l + f, _ = t[c - n];
+								6 == o && (_ = t[c - e] + (_ - t[c - n - e] >>> 1)), t[c] = _ + a(r, h[f]);
+							}
+							d += e;
+						}
+					}
+				}, r.m = 65475, r.K = 65476, r.q = 65496, r.V = 65498, function(t) {
+					var e = new r(t), n = new (e.Q > 8 ? Uint16Array : Uint8Array)(e.o * e.F * e.O), i = e.o * e.O;
+					return e.B(n, i), n;
+				};
+			}();
+		}(t, "function" == typeof require ? v() : self.pako);
+	})();
+});
+Object.defineProperty(exports, "default", {
+	enumerable: !0,
+	get: function() {
+		return w();
+	}
+});