@silvery/examples 0.5.6 → 0.17.4

package/dist/UPNG-Cy7ViL8f.mjs

@@ -0,0 +1,5074 @@
+import { i as __require, t as __commonJSMin } from "./chunk-BSw8zbkd.mjs";
+//#region ../../../node_modules/.bun/pako@1.0.11/node_modules/pako/lib/utils/common.js
+var require_common = /* @__PURE__ */ __commonJSMin(((exports) => {
+	var TYPED_OK = typeof Uint8Array !== "undefined" && typeof Uint16Array !== "undefined" && typeof Int32Array !== "undefined";
+	function _has(obj, key) {
+		return Object.prototype.hasOwnProperty.call(obj, key);
+	}
+	exports.assign = function(obj) {
+		var sources = Array.prototype.slice.call(arguments, 1);
+		while (sources.length) {
+			var source = sources.shift();
+			if (!source) continue;
+			if (typeof source !== "object") throw new TypeError(source + "must be non-object");
+			for (var p in source) if (_has(source, p)) obj[p] = source[p];
+		}
+		return obj;
+	};
+	exports.shrinkBuf = function(buf, size) {
+		if (buf.length === size) return buf;
+		if (buf.subarray) return buf.subarray(0, size);
+		buf.length = size;
+		return buf;
+	};
+	var fnTyped = {
+		arraySet: function(dest, src, src_offs, len, dest_offs) {
+			if (src.subarray && dest.subarray) {
+				dest.set(src.subarray(src_offs, src_offs + len), dest_offs);
+				return;
+			}
+			for (var i = 0; i < len; i++) dest[dest_offs + i] = src[src_offs + i];
+		},
+		flattenChunks: function(chunks) {
+			var i, l, len = 0, pos, chunk, result;
+			for (i = 0, l = chunks.length; i < l; i++) len += chunks[i].length;
+			result = new Uint8Array(len);
+			pos = 0;
+			for (i = 0, l = chunks.length; i < l; i++) {
+				chunk = chunks[i];
+				result.set(chunk, pos);
+				pos += chunk.length;
+			}
+			return result;
+		}
+	};
+	var fnUntyped = {
+		arraySet: function(dest, src, src_offs, len, dest_offs) {
+			for (var i = 0; i < len; i++) dest[dest_offs + i] = src[src_offs + i];
+		},
+		flattenChunks: function(chunks) {
+			return [].concat.apply([], chunks);
+		}
+	};
+	exports.setTyped = function(on) {
+		if (on) {
+			exports.Buf8 = Uint8Array;
+			exports.Buf16 = Uint16Array;
+			exports.Buf32 = Int32Array;
+			exports.assign(exports, fnTyped);
+		} else {
+			exports.Buf8 = Array;
+			exports.Buf16 = Array;
+			exports.Buf32 = Array;
+			exports.assign(exports, fnUntyped);
+		}
+	};
+	exports.setTyped(TYPED_OK);
+}));
+//#endregion
+//#region ../../../node_modules/.bun/pako@1.0.11/node_modules/pako/lib/zlib/trees.js
+var require_trees = /* @__PURE__ */ __commonJSMin(((exports) => {
+	var utils = require_common();
+	var Z_FIXED = 4;
+	var Z_BINARY = 0;
+	var Z_TEXT = 1;
+	var Z_UNKNOWN = 2;
+	function zero(buf) {
+		var len = buf.length;
+		while (--len >= 0) buf[len] = 0;
+	}
+	var STORED_BLOCK = 0;
+	var STATIC_TREES = 1;
+	var DYN_TREES = 2;
+	var MIN_MATCH = 3;
+	var MAX_MATCH = 258;
+	var LENGTH_CODES = 29;
+	var LITERALS = 256;
+	var L_CODES = LITERALS + 1 + LENGTH_CODES;
+	var D_CODES = 30;
+	var BL_CODES = 19;
+	var HEAP_SIZE = 2 * L_CODES + 1;
+	var MAX_BITS = 15;
+	var Buf_size = 16;
+	var MAX_BL_BITS = 7;
+	var END_BLOCK = 256;
+	var REP_3_6 = 16;
+	var REPZ_3_10 = 17;
+	var REPZ_11_138 = 18;
+	var extra_lbits = [
+		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
+	];
+	var extra_dbits = [
+		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
+	];
+	var extra_blbits = [
+		0,
+		0,
+		0,
+		0,
+		0,
+		0,
+		0,
+		0,
+		0,
+		0,
+		0,
+		0,
+		0,
+		0,
+		0,
+		0,
+		2,
+		3,
+		7
+	];
+	var bl_order = [
+		16,
+		17,
+		18,
+		0,
+		8,
+		7,
+		9,
+		6,
+		10,
+		5,
+		11,
+		4,
+		12,
+		3,
+		13,
+		2,
+		14,
+		1,
+		15
+	];
+	var DIST_CODE_LEN = 512;
+	var static_ltree = new Array((L_CODES + 2) * 2);
+	zero(static_ltree);
+	var static_dtree = new Array(D_CODES * 2);
+	zero(static_dtree);
+	var _dist_code = new Array(DIST_CODE_LEN);
+	zero(_dist_code);
+	var _length_code = new Array(MAX_MATCH - MIN_MATCH + 1);
+	zero(_length_code);
+	var base_length = new Array(LENGTH_CODES);
+	zero(base_length);
+	var base_dist = new Array(D_CODES);
+	zero(base_dist);
+	function StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) {
+		this.static_tree = static_tree;
+		this.extra_bits = extra_bits;
+		this.extra_base = extra_base;
+		this.elems = elems;
+		this.max_length = max_length;
+		this.has_stree = static_tree && static_tree.length;
+	}
+	var static_l_desc;
+	var static_d_desc;
+	var static_bl_desc;
+	function TreeDesc(dyn_tree, stat_desc) {
+		this.dyn_tree = dyn_tree;
+		this.max_code = 0;
+		this.stat_desc = stat_desc;
+	}
+	function d_code(dist) {
+		return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];
+	}
+	function put_short(s, w) {
+		s.pending_buf[s.pending++] = w & 255;
+		s.pending_buf[s.pending++] = w >>> 8 & 255;
+	}
+	function send_bits(s, value, length) {
+		if (s.bi_valid > Buf_size - length) {
+			s.bi_buf |= value << s.bi_valid & 65535;
+			put_short(s, s.bi_buf);
+			s.bi_buf = value >> Buf_size - s.bi_valid;
+			s.bi_valid += length - Buf_size;
+		} else {
+			s.bi_buf |= value << s.bi_valid & 65535;
+			s.bi_valid += length;
+		}
+	}
+	function send_code(s, c, tree) {
+		send_bits(s, tree[c * 2], tree[c * 2 + 1]);
+	}
+	function bi_reverse(code, len) {
+		var res = 0;
+		do {
+			res |= code & 1;
+			code >>>= 1;
+			res <<= 1;
+		} while (--len > 0);
+		return res >>> 1;
+	}
+	function bi_flush(s) {
+		if (s.bi_valid === 16) {
+			put_short(s, s.bi_buf);
+			s.bi_buf = 0;
+			s.bi_valid = 0;
+		} else if (s.bi_valid >= 8) {
+			s.pending_buf[s.pending++] = s.bi_buf & 255;
+			s.bi_buf >>= 8;
+			s.bi_valid -= 8;
+		}
+	}
+	function gen_bitlen(s, desc) {
+		var tree = desc.dyn_tree;
+		var max_code = desc.max_code;
+		var stree = desc.stat_desc.static_tree;
+		var has_stree = desc.stat_desc.has_stree;
+		var extra = desc.stat_desc.extra_bits;
+		var base = desc.stat_desc.extra_base;
+		var max_length = desc.stat_desc.max_length;
+		var h;
+		var n, m;
+		var bits;
+		var xbits;
+		var f;
+		var overflow = 0;
+		for (bits = 0; bits <= MAX_BITS; bits++) s.bl_count[bits] = 0;
+		tree[s.heap[s.heap_max] * 2 + 1] = 0;
+		for (h = s.heap_max + 1; h < HEAP_SIZE; h++) {
+			n = s.heap[h];
+			bits = tree[tree[n * 2 + 1] * 2 + 1] + 1;
+			if (bits > max_length) {
+				bits = max_length;
+				overflow++;
+			}
+			tree[n * 2 + 1] = bits;
+			if (n > max_code) continue;
+			s.bl_count[bits]++;
+			xbits = 0;
+			if (n >= base) xbits = extra[n - base];
+			f = tree[n * 2];
+			s.opt_len += f * (bits + xbits);
+			if (has_stree) s.static_len += f * (stree[n * 2 + 1] + xbits);
+		}
+		if (overflow === 0) return;
+		do {
+			bits = max_length - 1;
+			while (s.bl_count[bits] === 0) bits--;
+			s.bl_count[bits]--;
+			s.bl_count[bits + 1] += 2;
+			s.bl_count[max_length]--;
+			overflow -= 2;
+		} while (overflow > 0);
+		for (bits = max_length; bits !== 0; bits--) {
+			n = s.bl_count[bits];
+			while (n !== 0) {
+				m = s.heap[--h];
+				if (m > max_code) continue;
+				if (tree[m * 2 + 1] !== bits) {
+					s.opt_len += (bits - tree[m * 2 + 1]) * tree[m * 2];
+					tree[m * 2 + 1] = bits;
+				}
+				n--;
+			}
+		}
+	}
+	function gen_codes(tree, max_code, bl_count) {
+		var next_code = new Array(MAX_BITS + 1);
+		var code = 0;
+		var bits;
+		var n;
+		for (bits = 1; bits <= MAX_BITS; bits++) next_code[bits] = code = code + bl_count[bits - 1] << 1;
+		for (n = 0; n <= max_code; n++) {
+			var len = tree[n * 2 + 1];
+			if (len === 0) continue;
+			tree[n * 2] = bi_reverse(next_code[len]++, len);
+		}
+	}
+	function tr_static_init() {
+		var n;
+		var bits;
+		var length;
+		var code;
+		var dist;
+		var bl_count = new Array(MAX_BITS + 1);
+		length = 0;
+		for (code = 0; code < LENGTH_CODES - 1; code++) {
+			base_length[code] = length;
+			for (n = 0; n < 1 << extra_lbits[code]; n++) _length_code[length++] = code;
+		}
+		_length_code[length - 1] = code;
+		dist = 0;
+		for (code = 0; code < 16; code++) {
+			base_dist[code] = dist;
+			for (n = 0; n < 1 << extra_dbits[code]; n++) _dist_code[dist++] = code;
+		}
+		dist >>= 7;
+		for (; code < D_CODES; code++) {
+			base_dist[code] = dist << 7;
+			for (n = 0; n < 1 << extra_dbits[code] - 7; n++) _dist_code[256 + dist++] = code;
+		}
+		for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
+		n = 0;
+		while (n <= 143) {
+			static_ltree[n * 2 + 1] = 8;
+			n++;
+			bl_count[8]++;
+		}
+		while (n <= 255) {
+			static_ltree[n * 2 + 1] = 9;
+			n++;
+			bl_count[9]++;
+		}
+		while (n <= 279) {
+			static_ltree[n * 2 + 1] = 7;
+			n++;
+			bl_count[7]++;
+		}
+		while (n <= 287) {
+			static_ltree[n * 2 + 1] = 8;
+			n++;
+			bl_count[8]++;
+		}
+		gen_codes(static_ltree, L_CODES + 1, bl_count);
+		for (n = 0; n < D_CODES; n++) {
+			static_dtree[n * 2 + 1] = 5;
+			static_dtree[n * 2] = bi_reverse(n, 5);
+		}
+		static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS + 1, L_CODES, MAX_BITS);
+		static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0, D_CODES, MAX_BITS);
+		static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0, BL_CODES, MAX_BL_BITS);
+	}
+	function init_block(s) {
+		var n;
+		for (n = 0; n < L_CODES; n++) s.dyn_ltree[n * 2] = 0;
+		for (n = 0; n < D_CODES; n++) s.dyn_dtree[n * 2] = 0;
+		for (n = 0; n < BL_CODES; n++) s.bl_tree[n * 2] = 0;
+		s.dyn_ltree[END_BLOCK * 2] = 1;
+		s.opt_len = s.static_len = 0;
+		s.last_lit = s.matches = 0;
+	}
+	function bi_windup(s) {
+		if (s.bi_valid > 8) put_short(s, s.bi_buf);
+		else if (s.bi_valid > 0) s.pending_buf[s.pending++] = s.bi_buf;
+		s.bi_buf = 0;
+		s.bi_valid = 0;
+	}
+	function copy_block(s, buf, len, header) {
+		bi_windup(s);
+		if (header) {
+			put_short(s, len);
+			put_short(s, ~len);
+		}
+		utils.arraySet(s.pending_buf, s.window, buf, len, s.pending);
+		s.pending += len;
+	}
+	function smaller(tree, n, m, depth) {
+		var _n2 = n * 2;
+		var _m2 = m * 2;
+		return tree[_n2] < tree[_m2] || tree[_n2] === tree[_m2] && depth[n] <= depth[m];
+	}
+	function pqdownheap(s, tree, k) {
+		var v = s.heap[k];
+		var j = k << 1;
+		while (j <= s.heap_len) {
+			if (j < s.heap_len && smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) j++;
+			if (smaller(tree, v, s.heap[j], s.depth)) break;
+			s.heap[k] = s.heap[j];
+			k = j;
+			j <<= 1;
+		}
+		s.heap[k] = v;
+	}
+	function compress_block(s, ltree, dtree) {
+		var dist;
+		var lc;
+		var lx = 0;
+		var code;
+		var extra;
+		if (s.last_lit !== 0) do {
+			dist = s.pending_buf[s.d_buf + lx * 2] << 8 | s.pending_buf[s.d_buf + lx * 2 + 1];
+			lc = s.pending_buf[s.l_buf + lx];
+			lx++;
+			if (dist === 0) send_code(s, lc, ltree);
+			else {
+				code = _length_code[lc];
+				send_code(s, code + LITERALS + 1, ltree);
+				extra = extra_lbits[code];
+				if (extra !== 0) {
+					lc -= base_length[code];
+					send_bits(s, lc, extra);
+				}
+				dist--;
+				code = d_code(dist);
+				send_code(s, code, dtree);
+				extra = extra_dbits[code];
+				if (extra !== 0) {
+					dist -= base_dist[code];
+					send_bits(s, dist, extra);
+				}
+			}
+		} while (lx < s.last_lit);
+		send_code(s, END_BLOCK, ltree);
+	}
+	function build_tree(s, desc) {
+		var tree = desc.dyn_tree;
+		var stree = desc.stat_desc.static_tree;
+		var has_stree = desc.stat_desc.has_stree;
+		var elems = desc.stat_desc.elems;
+		var n, m;
+		var max_code = -1;
+		var node;
+		s.heap_len = 0;
+		s.heap_max = HEAP_SIZE;
+		for (n = 0; n < elems; n++) if (tree[n * 2] !== 0) {
+			s.heap[++s.heap_len] = max_code = n;
+			s.depth[n] = 0;
+		} else tree[n * 2 + 1] = 0;
+		while (s.heap_len < 2) {
+			node = s.heap[++s.heap_len] = max_code < 2 ? ++max_code : 0;
+			tree[node * 2] = 1;
+			s.depth[node] = 0;
+			s.opt_len--;
+			if (has_stree) s.static_len -= stree[node * 2 + 1];
+		}
+		desc.max_code = max_code;
+		for (n = s.heap_len >> 1; n >= 1; n--) pqdownheap(s, tree, n);
+		node = elems;
+		do {
+			/*** pqremove ***/
+			n = s.heap[1];
+			s.heap[1] = s.heap[s.heap_len--];
+			pqdownheap(s, tree, 1);
+			m = s.heap[1];
+			s.heap[--s.heap_max] = n;
+			s.heap[--s.heap_max] = m;
+			tree[node * 2] = tree[n * 2] + tree[m * 2];
+			s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;
+			tree[n * 2 + 1] = tree[m * 2 + 1] = node;
+			s.heap[1] = node++;
+			pqdownheap(s, tree, 1);
+		} while (s.heap_len >= 2);
+		s.heap[--s.heap_max] = s.heap[1];
+		gen_bitlen(s, desc);
+		gen_codes(tree, max_code, s.bl_count);
+	}
+	function scan_tree(s, tree, max_code) {
+		var n;
+		var prevlen = -1;
+		var curlen;
+		var nextlen = tree[1];
+		var count = 0;
+		var max_count = 7;
+		var min_count = 4;
+		if (nextlen === 0) {
+			max_count = 138;
+			min_count = 3;
+		}
+		tree[(max_code + 1) * 2 + 1] = 65535;
+		for (n = 0; n <= max_code; n++) {
+			curlen = nextlen;
+			nextlen = tree[(n + 1) * 2 + 1];
+			if (++count < max_count && curlen === nextlen) continue;
+			else if (count < min_count) s.bl_tree[curlen * 2] += count;
+			else if (curlen !== 0) {
+				if (curlen !== prevlen) s.bl_tree[curlen * 2]++;
+				s.bl_tree[REP_3_6 * 2]++;
+			} else if (count <= 10) s.bl_tree[REPZ_3_10 * 2]++;
+			else s.bl_tree[REPZ_11_138 * 2]++;
+			count = 0;
+			prevlen = curlen;
+			if (nextlen === 0) {
+				max_count = 138;
+				min_count = 3;
+			} else if (curlen === nextlen) {
+				max_count = 6;
+				min_count = 3;
+			} else {
+				max_count = 7;
+				min_count = 4;
+			}
+		}
+	}
+	function send_tree(s, tree, max_code) {
+		var n;
+		var prevlen = -1;
+		var curlen;
+		var nextlen = tree[1];
+		var count = 0;
+		var max_count = 7;
+		var min_count = 4;
+		if (nextlen === 0) {
+			max_count = 138;
+			min_count = 3;
+		}
+		for (n = 0; n <= max_code; n++) {
+			curlen = nextlen;
+			nextlen = tree[(n + 1) * 2 + 1];
+			if (++count < max_count && curlen === nextlen) continue;
+			else if (count < min_count) do
+				send_code(s, curlen, s.bl_tree);
+			while (--count !== 0);
+			else if (curlen !== 0) {
+				if (curlen !== prevlen) {
+					send_code(s, curlen, s.bl_tree);
+					count--;
+				}
+				send_code(s, REP_3_6, s.bl_tree);
+				send_bits(s, count - 3, 2);
+			} else if (count <= 10) {
+				send_code(s, REPZ_3_10, s.bl_tree);
+				send_bits(s, count - 3, 3);
+			} else {
+				send_code(s, REPZ_11_138, s.bl_tree);
+				send_bits(s, count - 11, 7);
+			}
+			count = 0;
+			prevlen = curlen;
+			if (nextlen === 0) {
+				max_count = 138;
+				min_count = 3;
+			} else if (curlen === nextlen) {
+				max_count = 6;
+				min_count = 3;
+			} else {
+				max_count = 7;
+				min_count = 4;
+			}
+		}
+	}
+	function build_bl_tree(s) {
+		var max_blindex;
+		scan_tree(s, s.dyn_ltree, s.l_desc.max_code);
+		scan_tree(s, s.dyn_dtree, s.d_desc.max_code);
+		build_tree(s, s.bl_desc);
+		for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) if (s.bl_tree[bl_order[max_blindex] * 2 + 1] !== 0) break;
+		s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;
+		return max_blindex;
+	}
+	function send_all_trees(s, lcodes, dcodes, blcodes) {
+		var rank;
+		send_bits(s, lcodes - 257, 5);
+		send_bits(s, dcodes - 1, 5);
+		send_bits(s, blcodes - 4, 4);
+		for (rank = 0; rank < blcodes; rank++) send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1], 3);
+		send_tree(s, s.dyn_ltree, lcodes - 1);
+		send_tree(s, s.dyn_dtree, dcodes - 1);
+	}
+	function detect_data_type(s) {
+		var black_mask = 4093624447;
+		var n;
+		for (n = 0; n <= 31; n++, black_mask >>>= 1) if (black_mask & 1 && s.dyn_ltree[n * 2] !== 0) return Z_BINARY;
+		if (s.dyn_ltree[18] !== 0 || s.dyn_ltree[20] !== 0 || s.dyn_ltree[26] !== 0) return Z_TEXT;
+		for (n = 32; n < LITERALS; n++) if (s.dyn_ltree[n * 2] !== 0) return Z_TEXT;
+		return Z_BINARY;
+	}
+	var static_init_done = false;
+	function _tr_init(s) {
+		if (!static_init_done) {
+			tr_static_init();
+			static_init_done = true;
+		}
+		s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc);
+		s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc);
+		s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);
+		s.bi_buf = 0;
+		s.bi_valid = 0;
+		init_block(s);
+	}
+	function _tr_stored_block(s, buf, stored_len, last) {
+		send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3);
+		copy_block(s, buf, stored_len, true);
+	}
+	function _tr_align(s) {
+		send_bits(s, STATIC_TREES << 1, 3);
+		send_code(s, END_BLOCK, static_ltree);
+		bi_flush(s);
+	}
+	function _tr_flush_block(s, buf, stored_len, last) {
+		var opt_lenb, static_lenb;
+		var max_blindex = 0;
+		if (s.level > 0) {
+			if (s.strm.data_type === Z_UNKNOWN) s.strm.data_type = detect_data_type(s);
+			build_tree(s, s.l_desc);
+			build_tree(s, s.d_desc);
+			max_blindex = build_bl_tree(s);
+			opt_lenb = s.opt_len + 3 + 7 >>> 3;
+			static_lenb = s.static_len + 3 + 7 >>> 3;
+			if (static_lenb <= opt_lenb) opt_lenb = static_lenb;
+		} else opt_lenb = static_lenb = stored_len + 5;
+		if (stored_len + 4 <= opt_lenb && buf !== -1) _tr_stored_block(s, buf, stored_len, last);
+		else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {
+			send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);
+			compress_block(s, static_ltree, static_dtree);
+		} else {
+			send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);
+			send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);
+			compress_block(s, s.dyn_ltree, s.dyn_dtree);
+		}
+		init_block(s);
+		if (last) bi_windup(s);
+	}
+	function _tr_tally(s, dist, lc) {
+		s.pending_buf[s.d_buf + s.last_lit * 2] = dist >>> 8 & 255;
+		s.pending_buf[s.d_buf + s.last_lit * 2 + 1] = dist & 255;
+		s.pending_buf[s.l_buf + s.last_lit] = lc & 255;
+		s.last_lit++;
+		if (dist === 0) s.dyn_ltree[lc * 2]++;
+		else {
+			s.matches++;
+			dist--;
+			s.dyn_ltree[(_length_code[lc] + LITERALS + 1) * 2]++;
+			s.dyn_dtree[d_code(dist) * 2]++;
+		}
+		return s.last_lit === s.lit_bufsize - 1;
+	}
+	exports._tr_init = _tr_init;
+	exports._tr_stored_block = _tr_stored_block;
+	exports._tr_flush_block = _tr_flush_block;
+	exports._tr_tally = _tr_tally;
+	exports._tr_align = _tr_align;
+}));
+//#endregion
+//#region ../../../node_modules/.bun/pako@1.0.11/node_modules/pako/lib/zlib/adler32.js
+var require_adler32 = /* @__PURE__ */ __commonJSMin(((exports, module) => {
+	function adler32(adler, buf, len, pos) {
+		var s1 = adler & 65535 | 0, s2 = adler >>> 16 & 65535 | 0, n = 0;
+		while (len !== 0) {
+			n = len > 2e3 ? 2e3 : len;
+			len -= n;
+			do {
+				s1 = s1 + buf[pos++] | 0;
+				s2 = s2 + s1 | 0;
+			} while (--n);
+			s1 %= 65521;
+			s2 %= 65521;
+		}
+		return s1 | s2 << 16 | 0;
+	}
+	module.exports = adler32;
+}));
+//#endregion
+//#region ../../../node_modules/.bun/pako@1.0.11/node_modules/pako/lib/zlib/crc32.js
+var require_crc32 = /* @__PURE__ */ __commonJSMin(((exports, module) => {
+	function makeTable() {
+		var c, table = [];
+		for (var n = 0; n < 256; n++) {
+			c = n;
+			for (var k = 0; k < 8; k++) c = c & 1 ? 3988292384 ^ c >>> 1 : c >>> 1;
+			table[n] = c;
+		}
+		return table;
+	}
+	var crcTable = makeTable();
+	function crc32(crc, buf, len, pos) {
+		var t = crcTable, end = pos + len;
+		crc ^= -1;
+		for (var i = pos; i < end; i++) crc = crc >>> 8 ^ t[(crc ^ buf[i]) & 255];
+		return crc ^ -1;
+	}
+	module.exports = crc32;
+}));
+//#endregion
+//#region ../../../node_modules/.bun/pako@1.0.11/node_modules/pako/lib/zlib/messages.js
+var require_messages = /* @__PURE__ */ __commonJSMin(((exports, module) => {
+	module.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"
+	};
+}));
+//#endregion
+//#region ../../../node_modules/.bun/pako@1.0.11/node_modules/pako/lib/zlib/deflate.js
+var require_deflate$1 = /* @__PURE__ */ __commonJSMin(((exports) => {
+	var utils = require_common();
+	var trees = require_trees();
+	var adler32 = require_adler32();
+	var crc32 = require_crc32();
+	var msg = require_messages();
+	var Z_NO_FLUSH = 0;
+	var Z_PARTIAL_FLUSH = 1;
+	var Z_FULL_FLUSH = 3;
+	var Z_FINISH = 4;
+	var Z_BLOCK = 5;
+	var Z_OK = 0;
+	var Z_STREAM_END = 1;
+	var Z_STREAM_ERROR = -2;
+	var Z_DATA_ERROR = -3;
+	var Z_BUF_ERROR = -5;
+	var Z_DEFAULT_COMPRESSION = -1;
+	var Z_FILTERED = 1;
+	var Z_HUFFMAN_ONLY = 2;
+	var Z_RLE = 3;
+	var Z_FIXED = 4;
+	var Z_DEFAULT_STRATEGY = 0;
+	var Z_UNKNOWN = 2;
+	var Z_DEFLATED = 8;
+	var MAX_MEM_LEVEL = 9;
+	var MAX_WBITS = 15;
+	var DEF_MEM_LEVEL = 8;
+	var L_CODES = 286;
+	var D_CODES = 30;
+	var BL_CODES = 19;
+	var HEAP_SIZE = 2 * L_CODES + 1;
+	var MAX_BITS = 15;
+	var MIN_MATCH = 3;
+	var MAX_MATCH = 258;
+	var MIN_LOOKAHEAD = MAX_MATCH + MIN_MATCH + 1;
+	var PRESET_DICT = 32;
+	var INIT_STATE = 42;
+	var EXTRA_STATE = 69;
+	var NAME_STATE = 73;
+	var COMMENT_STATE = 91;
+	var HCRC_STATE = 103;
+	var BUSY_STATE = 113;
+	var FINISH_STATE = 666;
+	var BS_NEED_MORE = 1;
+	var BS_BLOCK_DONE = 2;
+	var BS_FINISH_STARTED = 3;
+	var BS_FINISH_DONE = 4;
+	var OS_CODE = 3;
+	function err(strm, errorCode) {
+		strm.msg = msg[errorCode];
+		return errorCode;
+	}
+	function rank(f) {
+		return (f << 1) - (f > 4 ? 9 : 0);
+	}
+	function zero(buf) {
+		var len = buf.length;
+		while (--len >= 0) buf[len] = 0;
+	}
+	function flush_pending(strm) {
+		var s = strm.state;
+		var len = s.pending;
+		if (len > strm.avail_out) len = strm.avail_out;
+		if (len === 0) return;
+		utils.arraySet(strm.output, s.pending_buf, s.pending_out, len, strm.next_out);
+		strm.next_out += len;
+		s.pending_out += len;
+		strm.total_out += len;
+		strm.avail_out -= len;
+		s.pending -= len;
+		if (s.pending === 0) s.pending_out = 0;
+	}
+	function flush_block_only(s, last) {
+		trees._tr_flush_block(s, s.block_start >= 0 ? s.block_start : -1, s.strstart - s.block_start, last);
+		s.block_start = s.strstart;
+		flush_pending(s.strm);
+	}
+	function put_byte(s, b) {
+		s.pending_buf[s.pending++] = b;
+	}
+	function putShortMSB(s, b) {
+		s.pending_buf[s.pending++] = b >>> 8 & 255;
+		s.pending_buf[s.pending++] = b & 255;
+	}
+	function read_buf(strm, buf, start, size) {
+		var len = strm.avail_in;
+		if (len > size) len = size;
+		if (len === 0) return 0;
+		strm.avail_in -= len;
+		utils.arraySet(buf, strm.input, strm.next_in, len, start);
+		if (strm.state.wrap === 1) strm.adler = adler32(strm.adler, buf, len, start);
+		else if (strm.state.wrap === 2) strm.adler = crc32(strm.adler, buf, len, start);
+		strm.next_in += len;
+		strm.total_in += len;
+		return len;
+	}
+	function longest_match(s, cur_match) {
+		var chain_length = s.max_chain_length;
+		var scan = s.strstart;
+		var match;
+		var len;
+		var best_len = s.prev_length;
+		var nice_match = s.nice_match;
+		var limit = s.strstart > s.w_size - MIN_LOOKAHEAD ? s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0;
+		var _win = s.window;
+		var wmask = s.w_mask;
+		var prev = s.prev;
+		var strend = s.strstart + MAX_MATCH;
+		var scan_end1 = _win[scan + best_len - 1];
+		var scan_end = _win[scan + best_len];
+		if (s.prev_length >= s.good_match) chain_length >>= 2;
+		if (nice_match > s.lookahead) nice_match = s.lookahead;
+		do {
+			match = cur_match;
+			if (_win[match + best_len] !== scan_end || _win[match + best_len - 1] !== scan_end1 || _win[match] !== _win[scan] || _win[++match] !== _win[scan + 1]) continue;
+			scan += 2;
+			match++;
+			do			;
+while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && scan < strend);
+			len = MAX_MATCH - (strend - scan);
+			scan = strend - MAX_MATCH;
+			if (len > best_len) {
+				s.match_start = cur_match;
+				best_len = len;
+				if (len >= nice_match) break;
+				scan_end1 = _win[scan + best_len - 1];
+				scan_end = _win[scan + best_len];
+			}
+		} while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0);
+		if (best_len <= s.lookahead) return best_len;
+		return s.lookahead;
+	}
+	function fill_window(s) {
+		var _w_size = s.w_size;
+		var p, n, m, more, str;
+		do {
+			more = s.window_size - s.lookahead - s.strstart;
+			if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) {
+				utils.arraySet(s.window, s.window, _w_size, _w_size, 0);
+				s.match_start -= _w_size;
+				s.strstart -= _w_size;
+				s.block_start -= _w_size;
+				n = s.hash_size;
+				p = n;
+				do {
+					m = s.head[--p];
+					s.head[p] = m >= _w_size ? m - _w_size : 0;
+				} while (--n);
+				n = _w_size;
+				p = n;
+				do {
+					m = s.prev[--p];
+					s.prev[p] = m >= _w_size ? m - _w_size : 0;
+				} while (--n);
+				more += _w_size;
+			}
+			if (s.strm.avail_in === 0) break;
+			n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);
+			s.lookahead += n;
+			if (s.lookahead + s.insert >= MIN_MATCH) {
+				str = s.strstart - s.insert;
+				s.ins_h = s.window[str];
+				s.ins_h = (s.ins_h << s.hash_shift ^ s.window[str + 1]) & s.hash_mask;
+				while (s.insert) {
+					s.ins_h = (s.ins_h << s.hash_shift ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask;
+					s.prev[str & s.w_mask] = s.head[s.ins_h];
+					s.head[s.ins_h] = str;
+					str++;
+					s.insert--;
+					if (s.lookahead + s.insert < MIN_MATCH) break;
+				}
+			}
+		} while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0);
+	}
+	function deflate_stored(s, flush) {
+		var max_block_size = 65535;
+		if (max_block_size > s.pending_buf_size - 5) max_block_size = s.pending_buf_size - 5;
+		for (;;) {
+			if (s.lookahead <= 1) {
+				fill_window(s);
+				if (s.lookahead === 0 && flush === Z_NO_FLUSH) return BS_NEED_MORE;
+				if (s.lookahead === 0) break;
+			}
+			s.strstart += s.lookahead;
+			s.lookahead = 0;
+			var max_start = s.block_start + max_block_size;
+			if (s.strstart === 0 || s.strstart >= max_start) {
+				s.lookahead = s.strstart - max_start;
+				s.strstart = max_start;
+				/*** FLUSH_BLOCK(s, 0); ***/
+				flush_block_only(s, false);
+				if (s.strm.avail_out === 0) return BS_NEED_MORE;
+			}
+			if (s.strstart - s.block_start >= s.w_size - MIN_LOOKAHEAD) {
+				/*** FLUSH_BLOCK(s, 0); ***/
+				flush_block_only(s, false);
+				if (s.strm.avail_out === 0) return BS_NEED_MORE;
+			}
+		}
+		s.insert = 0;
+		if (flush === Z_FINISH) {
+			/*** FLUSH_BLOCK(s, 1); ***/
+			flush_block_only(s, true);
+			if (s.strm.avail_out === 0) return BS_FINISH_STARTED;
+			return BS_FINISH_DONE;
+		}
+		if (s.strstart > s.block_start) {
+			/*** FLUSH_BLOCK(s, 0); ***/
+			flush_block_only(s, false);
+			if (s.strm.avail_out === 0) return BS_NEED_MORE;
+		}
+		return BS_NEED_MORE;
+	}
+	function deflate_fast(s, flush) {
+		var hash_head;
+		var bflush;
+		for (;;) {
+			if (s.lookahead < MIN_LOOKAHEAD) {
+				fill_window(s);
+				if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) return BS_NEED_MORE;
+				if (s.lookahead === 0) break;
+			}
+			hash_head = 0;
+			if (s.lookahead >= MIN_MATCH) {
+				/*** INSERT_STRING(s, s.strstart, hash_head); ***/
+				s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;
+				hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];
+				s.head[s.ins_h] = s.strstart;
+			}
+			if (hash_head !== 0 && s.strstart - hash_head <= s.w_size - MIN_LOOKAHEAD) s.match_length = longest_match(s, hash_head);
+			if (s.match_length >= MIN_MATCH) {
+				/*** _tr_tally_dist(s, s.strstart - s.match_start,
+				s.match_length - MIN_MATCH, bflush); ***/
+				bflush = trees._tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);
+				s.lookahead -= s.match_length;
+				if (s.match_length <= s.max_lazy_match && s.lookahead >= MIN_MATCH) {
+					s.match_length--;
+					do {
+						s.strstart++;
+						/*** INSERT_STRING(s, s.strstart, hash_head); ***/
+						s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;
+						hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];
+						s.head[s.ins_h] = s.strstart;
+					} while (--s.match_length !== 0);
+					s.strstart++;
+				} else {
+					s.strstart += s.match_length;
+					s.match_length = 0;
+					s.ins_h = s.window[s.strstart];
+					s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + 1]) & s.hash_mask;
+				}
+			} else {
+				/*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/
+				bflush = trees._tr_tally(s, 0, s.window[s.strstart]);
+				s.lookahead--;
+				s.strstart++;
+			}
+			if (bflush) {
+				/*** FLUSH_BLOCK(s, 0); ***/
+				flush_block_only(s, false);
+				if (s.strm.avail_out === 0) return BS_NEED_MORE;
+			}
+		}
+		s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;
+		if (flush === Z_FINISH) {
+			/*** FLUSH_BLOCK(s, 1); ***/
+			flush_block_only(s, true);
+			if (s.strm.avail_out === 0) return BS_FINISH_STARTED;
+			return BS_FINISH_DONE;
+		}
+		if (s.last_lit) {
+			/*** FLUSH_BLOCK(s, 0); ***/
+			flush_block_only(s, false);
+			if (s.strm.avail_out === 0) return BS_NEED_MORE;
+		}
+		return BS_BLOCK_DONE;
+	}
+	function deflate_slow(s, flush) {
+		var hash_head;
+		var bflush;
+		var max_insert;
+		for (;;) {
+			if (s.lookahead < MIN_LOOKAHEAD) {
+				fill_window(s);
+				if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) return BS_NEED_MORE;
+				if (s.lookahead === 0) break;
+			}
+			hash_head = 0;
+			if (s.lookahead >= MIN_MATCH) {
+				/*** INSERT_STRING(s, s.strstart, hash_head); ***/
+				s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;
+				hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];
+				s.head[s.ins_h] = s.strstart;
+			}
+			s.prev_length = s.match_length;
+			s.prev_match = s.match_start;
+			s.match_length = MIN_MATCH - 1;
+			if (hash_head !== 0 && s.prev_length < s.max_lazy_match && s.strstart - hash_head <= s.w_size - MIN_LOOKAHEAD) {
+				s.match_length = longest_match(s, hash_head);
+				if (s.match_length <= 5 && (s.strategy === Z_FILTERED || s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096)) s.match_length = MIN_MATCH - 1;
+			}
+			if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {
+				max_insert = s.strstart + s.lookahead - MIN_MATCH;
+				/***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,
+				s.prev_length - MIN_MATCH, bflush);***/
+				bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);
+				s.lookahead -= s.prev_length - 1;
+				s.prev_length -= 2;
+				do
+					if (++s.strstart <= max_insert) {
+						/*** INSERT_STRING(s, s.strstart, hash_head); ***/
+						s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;
+						hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];
+						s.head[s.ins_h] = s.strstart;
+					}
+				while (--s.prev_length !== 0);
+				s.match_available = 0;
+				s.match_length = MIN_MATCH - 1;
+				s.strstart++;
+				if (bflush) {
+					/*** FLUSH_BLOCK(s, 0); ***/
+					flush_block_only(s, false);
+					if (s.strm.avail_out === 0) return BS_NEED_MORE;
+				}
+			} else if (s.match_available) {
+				/*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/
+				bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);
+				if (bflush)
+ /*** FLUSH_BLOCK_ONLY(s, 0) ***/
+				flush_block_only(s, false);
+				s.strstart++;
+				s.lookahead--;
+				if (s.strm.avail_out === 0) return BS_NEED_MORE;
+			} else {
+				s.match_available = 1;
+				s.strstart++;
+				s.lookahead--;
+			}
+		}
+		if (s.match_available) {
+			/*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/
+			bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);
+			s.match_available = 0;
+		}
+		s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;
+		if (flush === Z_FINISH) {
+			/*** FLUSH_BLOCK(s, 1); ***/
+			flush_block_only(s, true);
+			if (s.strm.avail_out === 0) return BS_FINISH_STARTED;
+			return BS_FINISH_DONE;
+		}
+		if (s.last_lit) {
+			/*** FLUSH_BLOCK(s, 0); ***/
+			flush_block_only(s, false);
+			if (s.strm.avail_out === 0) return BS_NEED_MORE;
+		}
+		return BS_BLOCK_DONE;
+	}
+	function deflate_rle(s, flush) {
+		var bflush;
+		var prev;
+		var scan, strend;
+		var _win = s.window;
+		for (;;) {
+			if (s.lookahead <= MAX_MATCH) {
+				fill_window(s);
+				if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH) return BS_NEED_MORE;
+				if (s.lookahead === 0) break;
+			}
+			s.match_length = 0;
+			if (s.lookahead >= MIN_MATCH && s.strstart > 0) {
+				scan = s.strstart - 1;
+				prev = _win[scan];
+				if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) {
+					strend = s.strstart + MAX_MATCH;
+					do					;
+while (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && scan < strend);
+					s.match_length = MAX_MATCH - (strend - scan);
+					if (s.match_length > s.lookahead) s.match_length = s.lookahead;
+				}
+			}
+			if (s.match_length >= MIN_MATCH) {
+				/*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/
+				bflush = trees._tr_tally(s, 1, s.match_length - MIN_MATCH);
+				s.lookahead -= s.match_length;
+				s.strstart += s.match_length;
+				s.match_length = 0;
+			} else {
+				/*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/
+				bflush = trees._tr_tally(s, 0, s.window[s.strstart]);
+				s.lookahead--;
+				s.strstart++;
+			}
+			if (bflush) {
+				/*** FLUSH_BLOCK(s, 0); ***/
+				flush_block_only(s, false);
+				if (s.strm.avail_out === 0) return BS_NEED_MORE;
+			}
+		}
+		s.insert = 0;
+		if (flush === Z_FINISH) {
+			/*** FLUSH_BLOCK(s, 1); ***/
+			flush_block_only(s, true);
+			if (s.strm.avail_out === 0) return BS_FINISH_STARTED;
+			return BS_FINISH_DONE;
+		}
+		if (s.last_lit) {
+			/*** FLUSH_BLOCK(s, 0); ***/
+			flush_block_only(s, false);
+			if (s.strm.avail_out === 0) return BS_NEED_MORE;
+		}
+		return BS_BLOCK_DONE;
+	}
+	function deflate_huff(s, flush) {
+		var bflush;
+		for (;;) {
+			if (s.lookahead === 0) {
+				fill_window(s);
+				if (s.lookahead === 0) {
+					if (flush === Z_NO_FLUSH) return BS_NEED_MORE;
+					break;
+				}
+			}
+			s.match_length = 0;
+			/*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/
+			bflush = trees._tr_tally(s, 0, s.window[s.strstart]);
+			s.lookahead--;
+			s.strstart++;
+			if (bflush) {
+				/*** FLUSH_BLOCK(s, 0); ***/
+				flush_block_only(s, false);
+				if (s.strm.avail_out === 0) return BS_NEED_MORE;
+			}
+		}
+		s.insert = 0;
+		if (flush === Z_FINISH) {
+			/*** FLUSH_BLOCK(s, 1); ***/
+			flush_block_only(s, true);
+			if (s.strm.avail_out === 0) return BS_FINISH_STARTED;
+			return BS_FINISH_DONE;
+		}
+		if (s.last_lit) {
+			/*** FLUSH_BLOCK(s, 0); ***/
+			flush_block_only(s, false);
+			if (s.strm.avail_out === 0) return BS_NEED_MORE;
+		}
+		return BS_BLOCK_DONE;
+	}
+	function Config(good_length, max_lazy, nice_length, max_chain, func) {
+		this.good_length = good_length;
+		this.max_lazy = max_lazy;
+		this.nice_length = nice_length;
+		this.max_chain = max_chain;
+		this.func = func;
+	}
+	var configuration_table = [
+		new Config(0, 0, 0, 0, deflate_stored),
+		new Config(4, 4, 8, 4, deflate_fast),
+		new Config(4, 5, 16, 8, deflate_fast),
+		new Config(4, 6, 32, 32, deflate_fast),
+		new Config(4, 4, 16, 16, deflate_slow),
+		new Config(8, 16, 32, 32, deflate_slow),
+		new Config(8, 16, 128, 128, deflate_slow),
+		new Config(8, 32, 128, 256, deflate_slow),
+		new Config(32, 128, 258, 1024, deflate_slow),
+		new Config(32, 258, 258, 4096, deflate_slow)
+	];
+	function lm_init(s) {
+		s.window_size = 2 * s.w_size;
+		/*** CLEAR_HASH(s); ***/
+		zero(s.head);
+		s.max_lazy_match = configuration_table[s.level].max_lazy;
+		s.good_match = configuration_table[s.level].good_length;
+		s.nice_match = configuration_table[s.level].nice_length;
+		s.max_chain_length = configuration_table[s.level].max_chain;
+		s.strstart = 0;
+		s.block_start = 0;
+		s.lookahead = 0;
+		s.insert = 0;
+		s.match_length = s.prev_length = MIN_MATCH - 1;
+		s.match_available = 0;
+		s.ins_h = 0;
+	}
+	function DeflateState() {
+		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 = Z_DEFLATED;
+		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 utils.Buf16(HEAP_SIZE * 2);
+		this.dyn_dtree = new utils.Buf16((2 * D_CODES + 1) * 2);
+		this.bl_tree = new utils.Buf16((2 * BL_CODES + 1) * 2);
+		zero(this.dyn_ltree);
+		zero(this.dyn_dtree);
+		zero(this.bl_tree);
+		this.l_desc = null;
+		this.d_desc = null;
+		this.bl_desc = null;
+		this.bl_count = new utils.Buf16(MAX_BITS + 1);
+		this.heap = new utils.Buf16(2 * L_CODES + 1);
+		zero(this.heap);
+		this.heap_len = 0;
+		this.heap_max = 0;
+		this.depth = new utils.Buf16(2 * L_CODES + 1);
+		zero(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 deflateResetKeep(strm) {
+		var s;
+		if (!strm || !strm.state) return err(strm, Z_STREAM_ERROR);
+		strm.total_in = strm.total_out = 0;
+		strm.data_type = Z_UNKNOWN;
+		s = strm.state;
+		s.pending = 0;
+		s.pending_out = 0;
+		if (s.wrap < 0) s.wrap = -s.wrap;
+		s.status = s.wrap ? INIT_STATE : BUSY_STATE;
+		strm.adler = s.wrap === 2 ? 0 : 1;
+		s.last_flush = Z_NO_FLUSH;
+		trees._tr_init(s);
+		return Z_OK;
+	}
+	function deflateReset(strm) {
+		var ret = deflateResetKeep(strm);
+		if (ret === Z_OK) lm_init(strm.state);
+		return ret;
+	}
+	function deflateSetHeader(strm, head) {
+		if (!strm || !strm.state) return Z_STREAM_ERROR;
+		if (strm.state.wrap !== 2) return Z_STREAM_ERROR;
+		strm.state.gzhead = head;
+		return Z_OK;
+	}
+	function deflateInit2(strm, level, method, windowBits, memLevel, strategy) {
+		if (!strm) return Z_STREAM_ERROR;
+		var wrap = 1;
+		if (level === Z_DEFAULT_COMPRESSION) level = 6;
+		if (windowBits < 0) {
+			wrap = 0;
+			windowBits = -windowBits;
+		} else if (windowBits > 15) {
+			wrap = 2;
+			windowBits -= 16;
+		}
+		if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED || windowBits < 8 || windowBits > 15 || level < 0 || level > 9 || strategy < 0 || strategy > Z_FIXED) return err(strm, Z_STREAM_ERROR);
+		if (windowBits === 8) windowBits = 9;
+		var s = new DeflateState();
+		strm.state = s;
+		s.strm = strm;
+		s.wrap = wrap;
+		s.gzhead = null;
+		s.w_bits = windowBits;
+		s.w_size = 1 << s.w_bits;
+		s.w_mask = s.w_size - 1;
+		s.hash_bits = memLevel + 7;
+		s.hash_size = 1 << s.hash_bits;
+		s.hash_mask = s.hash_size - 1;
+		s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH);
+		s.window = new utils.Buf8(s.w_size * 2);
+		s.head = new utils.Buf16(s.hash_size);
+		s.prev = new utils.Buf16(s.w_size);
+		s.lit_bufsize = 1 << memLevel + 6;
+		s.pending_buf_size = s.lit_bufsize * 4;
+		s.pending_buf = new utils.Buf8(s.pending_buf_size);
+		s.d_buf = 1 * s.lit_bufsize;
+		s.l_buf = 3 * s.lit_bufsize;
+		s.level = level;
+		s.strategy = strategy;
+		s.method = method;
+		return deflateReset(strm);
+	}
+	function deflateInit(strm, level) {
+		return deflateInit2(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY);
+	}
+	function deflate(strm, flush) {
+		var old_flush, s;
+		var beg, val;
+		if (!strm || !strm.state || flush > Z_BLOCK || flush < 0) return strm ? err(strm, Z_STREAM_ERROR) : Z_STREAM_ERROR;
+		s = strm.state;
+		if (!strm.output || !strm.input && strm.avail_in !== 0 || s.status === FINISH_STATE && flush !== Z_FINISH) return err(strm, strm.avail_out === 0 ? Z_BUF_ERROR : Z_STREAM_ERROR);
+		s.strm = strm;
+		old_flush = s.last_flush;
+		s.last_flush = flush;
+		if (s.status === INIT_STATE) if (s.wrap === 2) {
+			strm.adler = 0;
+			put_byte(s, 31);
+			put_byte(s, 139);
+			put_byte(s, 8);
+			if (!s.gzhead) {
+				put_byte(s, 0);
+				put_byte(s, 0);
+				put_byte(s, 0);
+				put_byte(s, 0);
+				put_byte(s, 0);
+				put_byte(s, s.level === 9 ? 2 : s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ? 4 : 0);
+				put_byte(s, OS_CODE);
+				s.status = BUSY_STATE;
+			} else {
+				put_byte(s, (s.gzhead.text ? 1 : 0) + (s.gzhead.hcrc ? 2 : 0) + (!s.gzhead.extra ? 0 : 4) + (!s.gzhead.name ? 0 : 8) + (!s.gzhead.comment ? 0 : 16));
+				put_byte(s, s.gzhead.time & 255);
+				put_byte(s, s.gzhead.time >> 8 & 255);
+				put_byte(s, s.gzhead.time >> 16 & 255);
+				put_byte(s, s.gzhead.time >> 24 & 255);
+				put_byte(s, s.level === 9 ? 2 : s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ? 4 : 0);
+				put_byte(s, s.gzhead.os & 255);
+				if (s.gzhead.extra && s.gzhead.extra.length) {
+					put_byte(s, s.gzhead.extra.length & 255);
+					put_byte(s, s.gzhead.extra.length >> 8 & 255);
+				}
+				if (s.gzhead.hcrc) strm.adler = crc32(strm.adler, s.pending_buf, s.pending, 0);
+				s.gzindex = 0;
+				s.status = EXTRA_STATE;
+			}
+		} else {
+			var header = Z_DEFLATED + (s.w_bits - 8 << 4) << 8;
+			var level_flags = -1;
+			if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) level_flags = 0;
+			else if (s.level < 6) level_flags = 1;
+			else if (s.level === 6) level_flags = 2;
+			else level_flags = 3;
+			header |= level_flags << 6;
+			if (s.strstart !== 0) header |= PRESET_DICT;
+			header += 31 - header % 31;
+			s.status = BUSY_STATE;
+			putShortMSB(s, header);
+			if (s.strstart !== 0) {
+				putShortMSB(s, strm.adler >>> 16);
+				putShortMSB(s, strm.adler & 65535);
+			}
+			strm.adler = 1;
+		}
+		if (s.status === EXTRA_STATE) if (s.gzhead.extra) {
+			beg = s.pending;
+			while (s.gzindex < (s.gzhead.extra.length & 65535)) {
+				if (s.pending === s.pending_buf_size) {
+					if (s.gzhead.hcrc && s.pending > beg) strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
+					flush_pending(strm);
+					beg = s.pending;
+					if (s.pending === s.pending_buf_size) break;
+				}
+				put_byte(s, s.gzhead.extra[s.gzindex] & 255);
+				s.gzindex++;
+			}
+			if (s.gzhead.hcrc && s.pending > beg) strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
+			if (s.gzindex === s.gzhead.extra.length) {
+				s.gzindex = 0;
+				s.status = NAME_STATE;
+			}
+		} else s.status = NAME_STATE;
+		if (s.status === NAME_STATE) if (s.gzhead.name) {
+			beg = s.pending;
+			do {
+				if (s.pending === s.pending_buf_size) {
+					if (s.gzhead.hcrc && s.pending > beg) strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
+					flush_pending(strm);
+					beg = s.pending;
+					if (s.pending === s.pending_buf_size) {
+						val = 1;
+						break;
+					}
+				}
+				if (s.gzindex < s.gzhead.name.length) val = s.gzhead.name.charCodeAt(s.gzindex++) & 255;
+				else val = 0;
+				put_byte(s, val);
+			} while (val !== 0);
+			if (s.gzhead.hcrc && s.pending > beg) strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
+			if (val === 0) {
+				s.gzindex = 0;
+				s.status = COMMENT_STATE;
+			}
+		} else s.status = COMMENT_STATE;
+		if (s.status === COMMENT_STATE) if (s.gzhead.comment) {
+			beg = s.pending;
+			do {
+				if (s.pending === s.pending_buf_size) {
+					if (s.gzhead.hcrc && s.pending > beg) strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
+					flush_pending(strm);
+					beg = s.pending;
+					if (s.pending === s.pending_buf_size) {
+						val = 1;
+						break;
+					}
+				}
+				if (s.gzindex < s.gzhead.comment.length) val = s.gzhead.comment.charCodeAt(s.gzindex++) & 255;
+				else val = 0;
+				put_byte(s, val);
+			} while (val !== 0);
+			if (s.gzhead.hcrc && s.pending > beg) strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
+			if (val === 0) s.status = HCRC_STATE;
+		} else s.status = HCRC_STATE;
+		if (s.status === HCRC_STATE) if (s.gzhead.hcrc) {
+			if (s.pending + 2 > s.pending_buf_size) flush_pending(strm);
+			if (s.pending + 2 <= s.pending_buf_size) {
+				put_byte(s, strm.adler & 255);
+				put_byte(s, strm.adler >> 8 & 255);
+				strm.adler = 0;
+				s.status = BUSY_STATE;
+			}
+		} else s.status = BUSY_STATE;
+		if (s.pending !== 0) {
+			flush_pending(strm);
+			if (strm.avail_out === 0) {
+				s.last_flush = -1;
+				return Z_OK;
+			}
+		} else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) && flush !== Z_FINISH) return err(strm, Z_BUF_ERROR);
+		if (s.status === FINISH_STATE && strm.avail_in !== 0) return err(strm, Z_BUF_ERROR);
+		if (strm.avail_in !== 0 || s.lookahead !== 0 || flush !== Z_NO_FLUSH && s.status !== FINISH_STATE) {
+			var bstate = s.strategy === Z_HUFFMAN_ONLY ? deflate_huff(s, flush) : s.strategy === Z_RLE ? deflate_rle(s, flush) : configuration_table[s.level].func(s, flush);
+			if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) s.status = FINISH_STATE;
+			if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) {
+				if (strm.avail_out === 0) s.last_flush = -1;
+				return Z_OK;
+			}
+			if (bstate === BS_BLOCK_DONE) {
+				if (flush === Z_PARTIAL_FLUSH) trees._tr_align(s);
+				else if (flush !== Z_BLOCK) {
+					trees._tr_stored_block(s, 0, 0, false);
+					if (flush === Z_FULL_FLUSH) {
+						/*** CLEAR_HASH(s); ***/ zero(s.head);
+						if (s.lookahead === 0) {
+							s.strstart = 0;
+							s.block_start = 0;
+							s.insert = 0;
+						}
+					}
+				}
+				flush_pending(strm);
+				if (strm.avail_out === 0) {
+					s.last_flush = -1;
+					return Z_OK;
+				}
+			}
+		}
+		if (flush !== Z_FINISH) return Z_OK;
+		if (s.wrap <= 0) return Z_STREAM_END;
+		if (s.wrap === 2) {
+			put_byte(s, strm.adler & 255);
+			put_byte(s, strm.adler >> 8 & 255);
+			put_byte(s, strm.adler >> 16 & 255);
+			put_byte(s, strm.adler >> 24 & 255);
+			put_byte(s, strm.total_in & 255);
+			put_byte(s, strm.total_in >> 8 & 255);
+			put_byte(s, strm.total_in >> 16 & 255);
+			put_byte(s, strm.total_in >> 24 & 255);
+		} else {
+			putShortMSB(s, strm.adler >>> 16);
+			putShortMSB(s, strm.adler & 65535);
+		}
+		flush_pending(strm);
+		if (s.wrap > 0) s.wrap = -s.wrap;
+		return s.pending !== 0 ? Z_OK : Z_STREAM_END;
+	}
+	function deflateEnd(strm) {
+		var status;
+		if (!strm || !strm.state) return Z_STREAM_ERROR;
+		status = strm.state.status;
+		if (status !== INIT_STATE && status !== EXTRA_STATE && status !== NAME_STATE && status !== COMMENT_STATE && status !== HCRC_STATE && status !== BUSY_STATE && status !== FINISH_STATE) return err(strm, Z_STREAM_ERROR);
+		strm.state = null;
+		return status === BUSY_STATE ? err(strm, Z_DATA_ERROR) : Z_OK;
+	}
+	function deflateSetDictionary(strm, dictionary) {
+		var dictLength = dictionary.length;
+		var s;
+		var str, n;
+		var wrap;
+		var avail;
+		var next;
+		var input;
+		var tmpDict;
+		if (!strm || !strm.state) return Z_STREAM_ERROR;
+		s = strm.state;
+		wrap = s.wrap;
+		if (wrap === 2 || wrap === 1 && s.status !== INIT_STATE || s.lookahead) return Z_STREAM_ERROR;
+		if (wrap === 1) strm.adler = adler32(strm.adler, dictionary, dictLength, 0);
+		s.wrap = 0;
+		if (dictLength >= s.w_size) {
+			if (wrap === 0) {
+				/*** CLEAR_HASH(s); ***/
+				zero(s.head);
+				s.strstart = 0;
+				s.block_start = 0;
+				s.insert = 0;
+			}
+			tmpDict = new utils.Buf8(s.w_size);
+			utils.arraySet(tmpDict, dictionary, dictLength - s.w_size, s.w_size, 0);
+			dictionary = tmpDict;
+			dictLength = s.w_size;
+		}
+		avail = strm.avail_in;
+		next = strm.next_in;
+		input = strm.input;
+		strm.avail_in = dictLength;
+		strm.next_in = 0;
+		strm.input = dictionary;
+		fill_window(s);
+		while (s.lookahead >= MIN_MATCH) {
+			str = s.strstart;
+			n = s.lookahead - (MIN_MATCH - 1);
+			do {
+				s.ins_h = (s.ins_h << s.hash_shift ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask;
+				s.prev[str & s.w_mask] = s.head[s.ins_h];
+				s.head[s.ins_h] = str;
+				str++;
+			} while (--n);
+			s.strstart = str;
+			s.lookahead = MIN_MATCH - 1;
+			fill_window(s);
+		}
+		s.strstart += s.lookahead;
+		s.block_start = s.strstart;
+		s.insert = s.lookahead;
+		s.lookahead = 0;
+		s.match_length = s.prev_length = MIN_MATCH - 1;
+		s.match_available = 0;
+		strm.next_in = next;
+		strm.input = input;
+		strm.avail_in = avail;
+		s.wrap = wrap;
+		return Z_OK;
+	}
+	exports.deflateInit = deflateInit;
+	exports.deflateInit2 = deflateInit2;
+	exports.deflateReset = deflateReset;
+	exports.deflateResetKeep = deflateResetKeep;
+	exports.deflateSetHeader = deflateSetHeader;
+	exports.deflate = deflate;
+	exports.deflateEnd = deflateEnd;
+	exports.deflateSetDictionary = deflateSetDictionary;
+	exports.deflateInfo = "pako deflate (from Nodeca project)";
+}));
+//#endregion
+//#region ../../../node_modules/.bun/pako@1.0.11/node_modules/pako/lib/utils/strings.js
+var require_strings = /* @__PURE__ */ __commonJSMin(((exports) => {
+	var utils = require_common();
+	var STR_APPLY_OK = true;
+	var STR_APPLY_UIA_OK = true;
+	try {
+		String.fromCharCode.apply(null, [0]);
+	} catch (__) {
+		STR_APPLY_OK = false;
+	}
+	try {
+		String.fromCharCode.apply(null, new Uint8Array(1));
+	} catch (__) {
+		STR_APPLY_UIA_OK = false;
+	}
+	var _utf8len = new utils.Buf8(256);
+	for (var q = 0; q < 256; q++) _utf8len[q] = q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1;
+	_utf8len[254] = _utf8len[254] = 1;
+	exports.string2buf = function(str) {
+		var buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0;
+		for (m_pos = 0; m_pos < str_len; m_pos++) {
+			c = str.charCodeAt(m_pos);
+			if ((c & 64512) === 55296 && m_pos + 1 < str_len) {
+				c2 = str.charCodeAt(m_pos + 1);
+				if ((c2 & 64512) === 56320) {
+					c = 65536 + (c - 55296 << 10) + (c2 - 56320);
+					m_pos++;
+				}
+			}
+			buf_len += c < 128 ? 1 : c < 2048 ? 2 : c < 65536 ? 3 : 4;
+		}
+		buf = new utils.Buf8(buf_len);
+		for (i = 0, m_pos = 0; i < buf_len; m_pos++) {
+			c = str.charCodeAt(m_pos);
+			if ((c & 64512) === 55296 && m_pos + 1 < str_len) {
+				c2 = str.charCodeAt(m_pos + 1);
+				if ((c2 & 64512) === 56320) {
+					c = 65536 + (c - 55296 << 10) + (c2 - 56320);
+					m_pos++;
+				}
+			}
+			if (c < 128) buf[i++] = c;
+			else if (c < 2048) {
+				buf[i++] = 192 | c >>> 6;
+				buf[i++] = 128 | c & 63;
+			} else if (c < 65536) {
+				buf[i++] = 224 | c >>> 12;
+				buf[i++] = 128 | c >>> 6 & 63;
+				buf[i++] = 128 | c & 63;
+			} else {
+				buf[i++] = 240 | c >>> 18;
+				buf[i++] = 128 | c >>> 12 & 63;
+				buf[i++] = 128 | c >>> 6 & 63;
+				buf[i++] = 128 | c & 63;
+			}
+		}
+		return buf;
+	};
+	function buf2binstring(buf, len) {
+		if (len < 65534) {
+			if (buf.subarray && STR_APPLY_UIA_OK || !buf.subarray && STR_APPLY_OK) return String.fromCharCode.apply(null, utils.shrinkBuf(buf, len));
+		}
+		var result = "";
+		for (var i = 0; i < len; i++) result += String.fromCharCode(buf[i]);
+		return result;
+	}
+	exports.buf2binstring = function(buf) {
+		return buf2binstring(buf, buf.length);
+	};
+	exports.binstring2buf = function(str) {
+		var buf = new utils.Buf8(str.length);
+		for (var i = 0, len = buf.length; i < len; i++) buf[i] = str.charCodeAt(i);
+		return buf;
+	};
+	exports.buf2string = function(buf, max) {
+		var i, out, c, c_len;
+		var len = max || buf.length;
+		var utf16buf = new Array(len * 2);
+		for (out = 0, i = 0; i < len;) {
+			c = buf[i++];
+			if (c < 128) {
+				utf16buf[out++] = c;
+				continue;
+			}
+			c_len = _utf8len[c];
+			if (c_len > 4) {
+				utf16buf[out++] = 65533;
+				i += c_len - 1;
+				continue;
+			}
+			c &= c_len === 2 ? 31 : c_len === 3 ? 15 : 7;
+			while (c_len > 1 && i < len) {
+				c = c << 6 | buf[i++] & 63;
+				c_len--;
+			}
+			if (c_len > 1) {
+				utf16buf[out++] = 65533;
+				continue;
+			}
+			if (c < 65536) utf16buf[out++] = c;
+			else {
+				c -= 65536;
+				utf16buf[out++] = 55296 | c >> 10 & 1023;
+				utf16buf[out++] = 56320 | c & 1023;
+			}
+		}
+		return buf2binstring(utf16buf, out);
+	};
+	exports.utf8border = function(buf, max) {
+		var pos;
+		max = max || buf.length;
+		if (max > buf.length) max = buf.length;
+		pos = max - 1;
+		while (pos >= 0 && (buf[pos] & 192) === 128) pos--;
+		if (pos < 0) return max;
+		if (pos === 0) return max;
+		return pos + _utf8len[buf[pos]] > max ? pos : max;
+	};
+}));
+//#endregion
+//#region ../../../node_modules/.bun/pako@1.0.11/node_modules/pako/lib/zlib/zstream.js
+var require_zstream = /* @__PURE__ */ __commonJSMin(((exports, module) => {
+	function ZStream() {
+		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;
+	}
+	module.exports = ZStream;
+}));
+//#endregion
+//#region ../../../node_modules/.bun/pako@1.0.11/node_modules/pako/lib/deflate.js
+var require_deflate = /* @__PURE__ */ __commonJSMin(((exports) => {
+	var zlib_deflate = require_deflate$1();
+	var utils = require_common();
+	var strings = require_strings();
+	var msg = require_messages();
+	var ZStream = require_zstream();
+	var toString = Object.prototype.toString;
+	var Z_NO_FLUSH = 0;
+	var Z_FINISH = 4;
+	var Z_OK = 0;
+	var Z_STREAM_END = 1;
+	var Z_SYNC_FLUSH = 2;
+	var Z_DEFAULT_COMPRESSION = -1;
+	var Z_DEFAULT_STRATEGY = 0;
+	var Z_DEFLATED = 8;
+	/**
+	* class Deflate
+	*
+	* Generic JS-style wrapper for zlib calls. If you don't need
+	* streaming behaviour - use more simple functions: [[deflate]],
+	* [[deflateRaw]] and [[gzip]].
+	**/
+	/**
+	* Deflate.result -> Uint8Array|Array
+	*
+	* Compressed result, generated by default [[Deflate#onData]]
+	* and [[Deflate#onEnd]] handlers. Filled after you push last chunk
+	* (call [[Deflate#push]] with `Z_FINISH` / `true` param)  or if you
+	* push a chunk with explicit flush (call [[Deflate#push]] with
+	* `Z_SYNC_FLUSH` param).
+	**/
+	/**
+	* Deflate.err -> Number
+	*
+	* Error code after deflate finished. 0 (Z_OK) on success.
+	* You will not need it in real life, because deflate errors
+	* are possible only on wrong options or bad `onData` / `onEnd`
+	* custom handlers.
+	**/
+	/**
+	* Deflate.msg -> String
+	*
+	* Error message, if [[Deflate.err]] != 0
+	**/
+	/**
+	* new Deflate(options)
+	* - options (Object): zlib deflate options.
+	*
+	* Creates new deflator instance with specified params. Throws exception
+	* on bad params. Supported options:
+	*
+	* - `level`
+	* - `windowBits`
+	* - `memLevel`
+	* - `strategy`
+	* - `dictionary`
+	*
+	* [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)
+	* for more information on these.
+	*
+	* Additional options, for internal needs:
+	*
+	* - `chunkSize` - size of generated data chunks (16K by default)
+	* - `raw` (Boolean) - do raw deflate
+	* - `gzip` (Boolean) - create gzip wrapper
+	* - `to` (String) - if equal to 'string', then result will be "binary string"
+	*    (each char code [0..255])
+	* - `header` (Object) - custom header for gzip
+	*   - `text` (Boolean) - true if compressed data believed to be text
+	*   - `time` (Number) - modification time, unix timestamp
+	*   - `os` (Number) - operation system code
+	*   - `extra` (Array) - array of bytes with extra data (max 65536)
+	*   - `name` (String) - file name (binary string)
+	*   - `comment` (String) - comment (binary string)
+	*   - `hcrc` (Boolean) - true if header crc should be added
+	*
+	* ##### Example:
+	*
+	* ```javascript
+	* var pako = require('pako')
+	*   , chunk1 = Uint8Array([1,2,3,4,5,6,7,8,9])
+	*   , chunk2 = Uint8Array([10,11,12,13,14,15,16,17,18,19]);
+	*
+	* var deflate = new pako.Deflate({ level: 3});
+	*
+	* deflate.push(chunk1, false);
+	* deflate.push(chunk2, true);  // true -> last chunk
+	*
+	* if (deflate.err) { throw new Error(deflate.err); }
+	*
+	* console.log(deflate.result);
+	* ```
+	**/
+	function Deflate(options) {
+		if (!(this instanceof Deflate)) return new Deflate(options);
+		this.options = utils.assign({
+			level: Z_DEFAULT_COMPRESSION,
+			method: Z_DEFLATED,
+			chunkSize: 16384,
+			windowBits: 15,
+			memLevel: 8,
+			strategy: Z_DEFAULT_STRATEGY,
+			to: ""
+		}, options || {});
+		var opt = this.options;
+		if (opt.raw && opt.windowBits > 0) opt.windowBits = -opt.windowBits;
+		else if (opt.gzip && opt.windowBits > 0 && opt.windowBits < 16) opt.windowBits += 16;
+		this.err = 0;
+		this.msg = "";
+		this.ended = false;
+		this.chunks = [];
+		this.strm = new ZStream();
+		this.strm.avail_out = 0;
+		var status = zlib_deflate.deflateInit2(this.strm, opt.level, opt.method, opt.windowBits, opt.memLevel, opt.strategy);
+		if (status !== Z_OK) throw new Error(msg[status]);
+		if (opt.header) zlib_deflate.deflateSetHeader(this.strm, opt.header);
+		if (opt.dictionary) {
+			var dict;
+			if (typeof opt.dictionary === "string") dict = strings.string2buf(opt.dictionary);
+			else if (toString.call(opt.dictionary) === "[object ArrayBuffer]") dict = new Uint8Array(opt.dictionary);
+			else dict = opt.dictionary;
+			status = zlib_deflate.deflateSetDictionary(this.strm, dict);
+			if (status !== Z_OK) throw new Error(msg[status]);
+			this._dict_set = true;
+		}
+	}
+	/**
+	* Deflate#push(data[, mode]) -> Boolean
+	* - data (Uint8Array|Array|ArrayBuffer|String): input data. Strings will be
+	*   converted to utf8 byte sequence.
+	* - mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.
+	*   See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.
+	*
+	* Sends input data to deflate pipe, generating [[Deflate#onData]] calls with
+	* new compressed chunks. Returns `true` on success. The last data block must have
+	* mode Z_FINISH (or `true`). That will flush internal pending buffers and call
+	* [[Deflate#onEnd]]. For interim explicit flushes (without ending the stream) you
+	* can use mode Z_SYNC_FLUSH, keeping the compression context.
+	*
+	* On fail call [[Deflate#onEnd]] with error code and return false.
+	*
+	* We strongly recommend to use `Uint8Array` on input for best speed (output
+	* array format is detected automatically). Also, don't skip last param and always
+	* use the same type in your code (boolean or number). That will improve JS speed.
+	*
+	* For regular `Array`-s make sure all elements are [0..255].
+	*
+	* ##### Example
+	*
+	* ```javascript
+	* push(chunk, false); // push one of data chunks
+	* ...
+	* push(chunk, true);  // push last chunk
+	* ```
+	**/
+	Deflate.prototype.push = function(data, mode) {
+		var strm = this.strm;
+		var chunkSize = this.options.chunkSize;
+		var status, _mode;
+		if (this.ended) return false;
+		_mode = mode === ~~mode ? mode : mode === true ? Z_FINISH : Z_NO_FLUSH;
+		if (typeof data === "string") strm.input = strings.string2buf(data);
+		else if (toString.call(data) === "[object ArrayBuffer]") strm.input = new Uint8Array(data);
+		else strm.input = data;
+		strm.next_in = 0;
+		strm.avail_in = strm.input.length;
+		do {
+			if (strm.avail_out === 0) {
+				strm.output = new utils.Buf8(chunkSize);
+				strm.next_out = 0;
+				strm.avail_out = chunkSize;
+			}
+			status = zlib_deflate.deflate(strm, _mode);
+			if (status !== Z_STREAM_END && status !== Z_OK) {
+				this.onEnd(status);
+				this.ended = true;
+				return false;
+			}
+			if (strm.avail_out === 0 || strm.avail_in === 0 && (_mode === Z_FINISH || _mode === Z_SYNC_FLUSH)) if (this.options.to === "string") this.onData(strings.buf2binstring(utils.shrinkBuf(strm.output, strm.next_out)));
+			else this.onData(utils.shrinkBuf(strm.output, strm.next_out));
+		} while ((strm.avail_in > 0 || strm.avail_out === 0) && status !== Z_STREAM_END);
+		if (_mode === Z_FINISH) {
+			status = zlib_deflate.deflateEnd(this.strm);
+			this.onEnd(status);
+			this.ended = true;
+			return status === Z_OK;
+		}
+		if (_mode === Z_SYNC_FLUSH) {
+			this.onEnd(Z_OK);
+			strm.avail_out = 0;
+			return true;
+		}
+		return true;
+	};
+	/**
+	* Deflate#onData(chunk) -> Void
+	* - chunk (Uint8Array|Array|String): output data. Type of array depends
+	*   on js engine support. When string output requested, each chunk
+	*   will be string.
+	*
+	* By default, stores data blocks in `chunks[]` property and glue
+	* those in `onEnd`. Override this handler, if you need another behaviour.
+	**/
+	Deflate.prototype.onData = function(chunk) {
+		this.chunks.push(chunk);
+	};
+	/**
+	* Deflate#onEnd(status) -> Void
+	* - status (Number): deflate status. 0 (Z_OK) on success,
+	*   other if not.
+	*
+	* Called once after you tell deflate that the input stream is
+	* complete (Z_FINISH) or should be flushed (Z_SYNC_FLUSH)
+	* or if an error happened. By default - join collected chunks,
+	* free memory and fill `results` / `err` properties.
+	**/
+	Deflate.prototype.onEnd = function(status) {
+		if (status === Z_OK) if (this.options.to === "string") this.result = this.chunks.join("");
+		else this.result = utils.flattenChunks(this.chunks);
+		this.chunks = [];
+		this.err = status;
+		this.msg = this.strm.msg;
+	};
+	/**
+	* deflate(data[, options]) -> Uint8Array|Array|String
+	* - data (Uint8Array|Array|String): input data to compress.
+	* - options (Object): zlib deflate options.
+	*
+	* Compress `data` with deflate algorithm and `options`.
+	*
+	* Supported options are:
+	*
+	* - level
+	* - windowBits
+	* - memLevel
+	* - strategy
+	* - dictionary
+	*
+	* [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)
+	* for more information on these.
+	*
+	* Sugar (options):
+	*
+	* - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify
+	*   negative windowBits implicitly.
+	* - `to` (String) - if equal to 'string', then result will be "binary string"
+	*    (each char code [0..255])
+	*
+	* ##### Example:
+	*
+	* ```javascript
+	* var pako = require('pako')
+	*   , data = Uint8Array([1,2,3,4,5,6,7,8,9]);
+	*
+	* console.log(pako.deflate(data));
+	* ```
+	**/
+	function deflate(input, options) {
+		var deflator = new Deflate(options);
+		deflator.push(input, true);
+		if (deflator.err) throw deflator.msg || msg[deflator.err];
+		return deflator.result;
+	}
+	/**
+	* deflateRaw(data[, options]) -> Uint8Array|Array|String
+	* - data (Uint8Array|Array|String): input data to compress.
+	* - options (Object): zlib deflate options.
+	*
+	* The same as [[deflate]], but creates raw data, without wrapper
+	* (header and adler32 crc).
+	**/
+	function deflateRaw(input, options) {
+		options = options || {};
+		options.raw = true;
+		return deflate(input, options);
+	}
+	/**
+	* gzip(data[, options]) -> Uint8Array|Array|String
+	* - data (Uint8Array|Array|String): input data to compress.
+	* - options (Object): zlib deflate options.
+	*
+	* The same as [[deflate]], but create gzip wrapper instead of
+	* deflate one.
+	**/
+	function gzip(input, options) {
+		options = options || {};
+		options.gzip = true;
+		return deflate(input, options);
+	}
+	exports.Deflate = Deflate;
+	exports.deflate = deflate;
+	exports.deflateRaw = deflateRaw;
+	exports.gzip = gzip;
+}));
+//#endregion
+//#region ../../../node_modules/.bun/pako@1.0.11/node_modules/pako/lib/zlib/inffast.js
+var require_inffast = /* @__PURE__ */ __commonJSMin(((exports, module) => {
+	var BAD = 30;
+	var TYPE = 12;
+	module.exports = function inflate_fast(strm, start) {
+		var state;
+		var _in;
+		var last;
+		var _out;
+		var beg;
+		var end;
+		var dmax;
+		var wsize;
+		var whave;
+		var wnext;
+		var s_window;
+		var hold;
+		var bits;
+		var lcode;
+		var dcode;
+		var lmask;
+		var dmask;
+		var here;
+		var op;
+		var len;
+		var dist;
+		var from;
+		var from_source;
+		var input, output;
+		state = strm.state;
+		_in = strm.next_in;
+		input = strm.input;
+		last = _in + (strm.avail_in - 5);
+		_out = strm.next_out;
+		output = strm.output;
+		beg = _out - (start - strm.avail_out);
+		end = _out + (strm.avail_out - 257);
+		dmax = state.dmax;
+		wsize = state.wsize;
+		whave = state.whave;
+		wnext = state.wnext;
+		s_window = state.window;
+		hold = state.hold;
+		bits = state.bits;
+		lcode = state.lencode;
+		dcode = state.distcode;
+		lmask = (1 << state.lenbits) - 1;
+		dmask = (1 << state.distbits) - 1;
+		top: do {
+			if (bits < 15) {
+				hold += input[_in++] << bits;
+				bits += 8;
+				hold += input[_in++] << bits;
+				bits += 8;
+			}
+			here = lcode[hold & lmask];
+			dolen: for (;;) {
+				op = here >>> 24;
+				hold >>>= op;
+				bits -= op;
+				op = here >>> 16 & 255;
+				if (op === 0) output[_out++] = here & 65535;
+				else if (op & 16) {
+					len = here & 65535;
+					op &= 15;
+					if (op) {
+						if (bits < op) {
+							hold += input[_in++] << bits;
+							bits += 8;
+						}
+						len += hold & (1 << op) - 1;
+						hold >>>= op;
+						bits -= op;
+					}
+					if (bits < 15) {
+						hold += input[_in++] << bits;
+						bits += 8;
+						hold += input[_in++] << bits;
+						bits += 8;
+					}
+					here = dcode[hold & dmask];
+					dodist: for (;;) {
+						op = here >>> 24;
+						hold >>>= op;
+						bits -= op;
+						op = here >>> 16 & 255;
+						if (op & 16) {
+							dist = here & 65535;
+							op &= 15;
+							if (bits < op) {
+								hold += input[_in++] << bits;
+								bits += 8;
+								if (bits < op) {
+									hold += input[_in++] << bits;
+									bits += 8;
+								}
+							}
+							dist += hold & (1 << op) - 1;
+							if (dist > dmax) {
+								strm.msg = "invalid distance too far back";
+								state.mode = BAD;
+								break top;
+							}
+							hold >>>= op;
+							bits -= op;
+							op = _out - beg;
+							if (dist > op) {
+								op = dist - op;
+								if (op > whave) {
+									if (state.sane) {
+										strm.msg = "invalid distance too far back";
+										state.mode = BAD;
+										break top;
+									}
+								}
+								from = 0;
+								from_source = s_window;
+								if (wnext === 0) {
+									from += wsize - op;
+									if (op < len) {
+										len -= op;
+										do
+											output[_out++] = s_window[from++];
+										while (--op);
+										from = _out - dist;
+										from_source = output;
+									}
+								} else if (wnext < op) {
+									from += wsize + wnext - op;
+									op -= wnext;
+									if (op < len) {
+										len -= op;
+										do
+											output[_out++] = s_window[from++];
+										while (--op);
+										from = 0;
+										if (wnext < len) {
+											op = wnext;
+											len -= op;
+											do
+												output[_out++] = s_window[from++];
+											while (--op);
+											from = _out - dist;
+											from_source = output;
+										}
+									}
+								} else {
+									from += wnext - op;
+									if (op < len) {
+										len -= op;
+										do
+											output[_out++] = s_window[from++];
+										while (--op);
+										from = _out - dist;
+										from_source = output;
+									}
+								}
+								while (len > 2) {
+									output[_out++] = from_source[from++];
+									output[_out++] = from_source[from++];
+									output[_out++] = from_source[from++];
+									len -= 3;
+								}
+								if (len) {
+									output[_out++] = from_source[from++];
+									if (len > 1) output[_out++] = from_source[from++];
+								}
+							} else {
+								from = _out - dist;
+								do {
+									output[_out++] = output[from++];
+									output[_out++] = output[from++];
+									output[_out++] = output[from++];
+									len -= 3;
+								} while (len > 2);
+								if (len) {
+									output[_out++] = output[from++];
+									if (len > 1) output[_out++] = output[from++];
+								}
+							}
+						} else if ((op & 64) === 0) {
+							here = dcode[(here & 65535) + (hold & (1 << op) - 1)];
+							continue dodist;
+						} else {
+							strm.msg = "invalid distance code";
+							state.mode = BAD;
+							break top;
+						}
+						break;
+					}
+				} else if ((op & 64) === 0) {
+					here = lcode[(here & 65535) + (hold & (1 << op) - 1)];
+					continue dolen;
+				} else if (op & 32) {
+					state.mode = TYPE;
+					break top;
+				} else {
+					strm.msg = "invalid literal/length code";
+					state.mode = BAD;
+					break top;
+				}
+				break;
+			}
+		} while (_in < last && _out < end);
+		len = bits >> 3;
+		_in -= len;
+		bits -= len << 3;
+		hold &= (1 << bits) - 1;
+		strm.next_in = _in;
+		strm.next_out = _out;
+		strm.avail_in = _in < last ? 5 + (last - _in) : 5 - (_in - last);
+		strm.avail_out = _out < end ? 257 + (end - _out) : 257 - (_out - end);
+		state.hold = hold;
+		state.bits = bits;
+	};
+}));
+//#endregion
+//#region ../../../node_modules/.bun/pako@1.0.11/node_modules/pako/lib/zlib/inftrees.js
+var require_inftrees = /* @__PURE__ */ __commonJSMin(((exports, module) => {
+	var utils = require_common();
+	var MAXBITS = 15;
+	var ENOUGH_LENS = 852;
+	var ENOUGH_DISTS = 592;
+	var CODES = 0;
+	var LENS = 1;
+	var DISTS = 2;
+	var lbase = [
+		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
+	];
+	var lext = [
+		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
+	];
+	var dbase = [
+		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
+	];
+	var dext = [
+		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
+	];
+	module.exports = function inflate_table(type, lens, lens_index, codes, table, table_index, work, opts) {
+		var bits = opts.bits;
+		var len = 0;
+		var sym = 0;
+		var min = 0, max = 0;
+		var root = 0;
+		var curr = 0;
+		var drop = 0;
+		var left = 0;
+		var used = 0;
+		var huff = 0;
+		var incr;
+		var fill;
+		var low;
+		var mask;
+		var next;
+		var base = null;
+		var base_index = 0;
+		var end;
+		var count = new utils.Buf16(MAXBITS + 1);
+		var offs = new utils.Buf16(MAXBITS + 1);
+		var extra = null;
+		var extra_index = 0;
+		var here_bits, here_op, here_val;
+		for (len = 0; len <= MAXBITS; len++) count[len] = 0;
+		for (sym = 0; sym < codes; sym++) count[lens[lens_index + sym]]++;
+		root = bits;
+		for (max = MAXBITS; max >= 1; max--) if (count[max] !== 0) break;
+		if (root > max) root = max;
+		if (max === 0) {
+			table[table_index++] = 20971520;
+			table[table_index++] = 20971520;
+			opts.bits = 1;
+			return 0;
+		}
+		for (min = 1; min < max; min++) if (count[min] !== 0) break;
+		if (root < min) root = min;
+		left = 1;
+		for (len = 1; len <= MAXBITS; len++) {
+			left <<= 1;
+			left -= count[len];
+			if (left < 0) return -1;
+		}
+		if (left > 0 && (type === CODES || max !== 1)) return -1;
+		offs[1] = 0;
+		for (len = 1; len < MAXBITS; len++) offs[len + 1] = offs[len] + count[len];
+		for (sym = 0; sym < codes; sym++) if (lens[lens_index + sym] !== 0) work[offs[lens[lens_index + sym]]++] = sym;
+		if (type === CODES) {
+			base = extra = work;
+			end = 19;
+		} else if (type === LENS) {
+			base = lbase;
+			base_index -= 257;
+			extra = lext;
+			extra_index -= 257;
+			end = 256;
+		} else {
+			base = dbase;
+			extra = dext;
+			end = -1;
+		}
+		huff = 0;
+		sym = 0;
+		len = min;
+		next = table_index;
+		curr = root;
+		drop = 0;
+		low = -1;
+		used = 1 << root;
+		mask = used - 1;
+		if (type === LENS && used > ENOUGH_LENS || type === DISTS && used > ENOUGH_DISTS) return 1;
+		for (;;) {
+			here_bits = len - drop;
+			if (work[sym] < end) {
+				here_op = 0;
+				here_val = work[sym];
+			} else if (work[sym] > end) {
+				here_op = extra[extra_index + work[sym]];
+				here_val = base[base_index + work[sym]];
+			} else {
+				here_op = 96;
+				here_val = 0;
+			}
+			incr = 1 << len - drop;
+			fill = 1 << curr;
+			min = fill;
+			do {
+				fill -= incr;
+				table[next + (huff >> drop) + fill] = here_bits << 24 | here_op << 16 | here_val | 0;
+			} while (fill !== 0);
+			incr = 1 << len - 1;
+			while (huff & incr) incr >>= 1;
+			if (incr !== 0) {
+				huff &= incr - 1;
+				huff += incr;
+			} else huff = 0;
+			sym++;
+			if (--count[len] === 0) {
+				if (len === max) break;
+				len = lens[lens_index + work[sym]];
+			}
+			if (len > root && (huff & mask) !== low) {
+				if (drop === 0) drop = root;
+				next += min;
+				curr = len - drop;
+				left = 1 << curr;
+				while (curr + drop < max) {
+					left -= count[curr + drop];
+					if (left <= 0) break;
+					curr++;
+					left <<= 1;
+				}
+				used += 1 << curr;
+				if (type === LENS && used > ENOUGH_LENS || type === DISTS && used > ENOUGH_DISTS) return 1;
+				low = huff & mask;
+				table[low] = root << 24 | curr << 16 | next - table_index | 0;
+			}
+		}
+		if (huff !== 0) table[next + huff] = len - drop << 24 | 4194304;
+		opts.bits = root;
+		return 0;
+	};
+}));
+//#endregion
+//#region ../../../node_modules/.bun/pako@1.0.11/node_modules/pako/lib/zlib/inflate.js
+var require_inflate$1 = /* @__PURE__ */ __commonJSMin(((exports) => {
+	var utils = require_common();
+	var adler32 = require_adler32();
+	var crc32 = require_crc32();
+	var inflate_fast = require_inffast();
+	var inflate_table = require_inftrees();
+	var CODES = 0;
+	var LENS = 1;
+	var DISTS = 2;
+	var Z_FINISH = 4;
+	var Z_BLOCK = 5;
+	var Z_TREES = 6;
+	var Z_OK = 0;
+	var Z_STREAM_END = 1;
+	var Z_NEED_DICT = 2;
+	var Z_STREAM_ERROR = -2;
+	var Z_DATA_ERROR = -3;
+	var Z_MEM_ERROR = -4;
+	var Z_BUF_ERROR = -5;
+	var Z_DEFLATED = 8;
+	var HEAD = 1;
+	var FLAGS = 2;
+	var TIME = 3;
+	var OS = 4;
+	var EXLEN = 5;
+	var EXTRA = 6;
+	var NAME = 7;
+	var COMMENT = 8;
+	var HCRC = 9;
+	var DICTID = 10;
+	var DICT = 11;
+	var TYPE = 12;
+	var TYPEDO = 13;
+	var STORED = 14;
+	var COPY_ = 15;
+	var COPY = 16;
+	var TABLE = 17;
+	var LENLENS = 18;
+	var CODELENS = 19;
+	var LEN_ = 20;
+	var LEN = 21;
+	var LENEXT = 22;
+	var DIST = 23;
+	var DISTEXT = 24;
+	var MATCH = 25;
+	var LIT = 26;
+	var CHECK = 27;
+	var LENGTH = 28;
+	var DONE = 29;
+	var BAD = 30;
+	var MEM = 31;
+	var SYNC = 32;
+	var ENOUGH_LENS = 852;
+	var ENOUGH_DISTS = 592;
+	var DEF_WBITS = 15;
+	function zswap32(q) {
+		return (q >>> 24 & 255) + (q >>> 8 & 65280) + ((q & 65280) << 8) + ((q & 255) << 24);
+	}
+	function InflateState() {
+		this.mode = 0;
+		this.last = false;
+		this.wrap = 0;
+		this.havedict = false;
+		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 utils.Buf16(320);
+		this.work = new utils.Buf16(288);
+		this.lendyn = null;
+		this.distdyn = null;
+		this.sane = 0;
+		this.back = 0;
+		this.was = 0;
+	}
+	function inflateResetKeep(strm) {
+		var state;
+		if (!strm || !strm.state) return Z_STREAM_ERROR;
+		state = strm.state;
+		strm.total_in = strm.total_out = state.total = 0;
+		strm.msg = "";
+		if (state.wrap) strm.adler = state.wrap & 1;
+		state.mode = HEAD;
+		state.last = 0;
+		state.havedict = 0;
+		state.dmax = 32768;
+		state.head = null;
+		state.hold = 0;
+		state.bits = 0;
+		state.lencode = state.lendyn = new utils.Buf32(ENOUGH_LENS);
+		state.distcode = state.distdyn = new utils.Buf32(ENOUGH_DISTS);
+		state.sane = 1;
+		state.back = -1;
+		return Z_OK;
+	}
+	function inflateReset(strm) {
+		var state;
+		if (!strm || !strm.state) return Z_STREAM_ERROR;
+		state = strm.state;
+		state.wsize = 0;
+		state.whave = 0;
+		state.wnext = 0;
+		return inflateResetKeep(strm);
+	}
+	function inflateReset2(strm, windowBits) {
+		var wrap;
+		var state;
+		if (!strm || !strm.state) return Z_STREAM_ERROR;
+		state = strm.state;
+		if (windowBits < 0) {
+			wrap = 0;
+			windowBits = -windowBits;
+		} else {
+			wrap = (windowBits >> 4) + 1;
+			if (windowBits < 48) windowBits &= 15;
+		}
+		if (windowBits && (windowBits < 8 || windowBits > 15)) return Z_STREAM_ERROR;
+		if (state.window !== null && state.wbits !== windowBits) state.window = null;
+		state.wrap = wrap;
+		state.wbits = windowBits;
+		return inflateReset(strm);
+	}
+	function inflateInit2(strm, windowBits) {
+		var ret;
+		var state;
+		if (!strm) return Z_STREAM_ERROR;
+		state = new InflateState();
+		strm.state = state;
+		state.window = null;
+		ret = inflateReset2(strm, windowBits);
+		if (ret !== Z_OK) strm.state = null;
+		return ret;
+	}
+	function inflateInit(strm) {
+		return inflateInit2(strm, DEF_WBITS);
+	}
+	var virgin = true;
+	var lenfix, distfix;
+	function fixedtables(state) {
+		if (virgin) {
+			var sym;
+			lenfix = new utils.Buf32(512);
+			distfix = new utils.Buf32(32);
+			sym = 0;
+			while (sym < 144) state.lens[sym++] = 8;
+			while (sym < 256) state.lens[sym++] = 9;
+			while (sym < 280) state.lens[sym++] = 7;
+			while (sym < 288) state.lens[sym++] = 8;
+			inflate_table(LENS, state.lens, 0, 288, lenfix, 0, state.work, { bits: 9 });
+			sym = 0;
+			while (sym < 32) state.lens[sym++] = 5;
+			inflate_table(DISTS, state.lens, 0, 32, distfix, 0, state.work, { bits: 5 });
+			virgin = false;
+		}
+		state.lencode = lenfix;
+		state.lenbits = 9;
+		state.distcode = distfix;
+		state.distbits = 5;
+	}
+	function updatewindow(strm, src, end, copy) {
+		var dist;
+		var state = strm.state;
+		if (state.window === null) {
+			state.wsize = 1 << state.wbits;
+			state.wnext = 0;
+			state.whave = 0;
+			state.window = new utils.Buf8(state.wsize);
+		}
+		if (copy >= state.wsize) {
+			utils.arraySet(state.window, src, end - state.wsize, state.wsize, 0);
+			state.wnext = 0;
+			state.whave = state.wsize;
+		} else {
+			dist = state.wsize - state.wnext;
+			if (dist > copy) dist = copy;
+			utils.arraySet(state.window, src, end - copy, dist, state.wnext);
+			copy -= dist;
+			if (copy) {
+				utils.arraySet(state.window, src, end - copy, copy, 0);
+				state.wnext = copy;
+				state.whave = state.wsize;
+			} else {
+				state.wnext += dist;
+				if (state.wnext === state.wsize) state.wnext = 0;
+				if (state.whave < state.wsize) state.whave += dist;
+			}
+		}
+		return 0;
+	}
+	function inflate(strm, flush) {
+		var state;
+		var input, output;
+		var next;
+		var put;
+		var have, left;
+		var hold;
+		var bits;
+		var _in, _out;
+		var copy;
+		var from;
+		var from_source;
+		var here = 0;
+		var here_bits, here_op, here_val;
+		var last_bits, last_op, last_val;
+		var len;
+		var ret;
+		var hbuf = new utils.Buf8(4);
+		var opts;
+		var n;
+		var order = [
+			16,
+			17,
+			18,
+			0,
+			8,
+			7,
+			9,
+			6,
+			10,
+			5,
+			11,
+			4,
+			12,
+			3,
+			13,
+			2,
+			14,
+			1,
+			15
+		];
+		if (!strm || !strm.state || !strm.output || !strm.input && strm.avail_in !== 0) return Z_STREAM_ERROR;
+		state = strm.state;
+		if (state.mode === TYPE) state.mode = TYPEDO;
+		put = strm.next_out;
+		output = strm.output;
+		left = strm.avail_out;
+		next = strm.next_in;
+		input = strm.input;
+		have = strm.avail_in;
+		hold = state.hold;
+		bits = state.bits;
+		_in = have;
+		_out = left;
+		ret = Z_OK;
+		inf_leave: for (;;) switch (state.mode) {
+			case HEAD:
+				if (state.wrap === 0) {
+					state.mode = TYPEDO;
+					break;
+				}
+				while (bits < 16) {
+					if (have === 0) break inf_leave;
+					have--;
+					hold += input[next++] << bits;
+					bits += 8;
+				}
+				if (state.wrap & 2 && hold === 35615) {
+					state.check = 0;
+					hbuf[0] = hold & 255;
+					hbuf[1] = hold >>> 8 & 255;
+					state.check = crc32(state.check, hbuf, 2, 0);
+					hold = 0;
+					bits = 0;
+					state.mode = FLAGS;
+					break;
+				}
+				state.flags = 0;
+				if (state.head) state.head.done = false;
+				if (!(state.wrap & 1) || (((hold & 255) << 8) + (hold >> 8)) % 31) {
+					strm.msg = "incorrect header check";
+					state.mode = BAD;
+					break;
+				}
+				if ((hold & 15) !== Z_DEFLATED) {
+					strm.msg = "unknown compression method";
+					state.mode = BAD;
+					break;
+				}
+				hold >>>= 4;
+				bits -= 4;
+				len = (hold & 15) + 8;
+				if (state.wbits === 0) state.wbits = len;
+				else if (len > state.wbits) {
+					strm.msg = "invalid window size";
+					state.mode = BAD;
+					break;
+				}
+				state.dmax = 1 << len;
+				strm.adler = state.check = 1;
+				state.mode = hold & 512 ? DICTID : TYPE;
+				hold = 0;
+				bits = 0;
+				break;
+			case FLAGS:
+				while (bits < 16) {
+					if (have === 0) break inf_leave;
+					have--;
+					hold += input[next++] << bits;
+					bits += 8;
+				}
+				state.flags = hold;
+				if ((state.flags & 255) !== Z_DEFLATED) {
+					strm.msg = "unknown compression method";
+					state.mode = BAD;
+					break;
+				}
+				if (state.flags & 57344) {
+					strm.msg = "unknown header flags set";
+					state.mode = BAD;
+					break;
+				}
+				if (state.head) state.head.text = hold >> 8 & 1;
+				if (state.flags & 512) {
+					hbuf[0] = hold & 255;
+					hbuf[1] = hold >>> 8 & 255;
+					state.check = crc32(state.check, hbuf, 2, 0);
+				}
+				hold = 0;
+				bits = 0;
+				state.mode = TIME;
+			case TIME:
+				while (bits < 32) {
+					if (have === 0) break inf_leave;
+					have--;
+					hold += input[next++] << bits;
+					bits += 8;
+				}
+				if (state.head) state.head.time = hold;
+				if (state.flags & 512) {
+					hbuf[0] = hold & 255;
+					hbuf[1] = hold >>> 8 & 255;
+					hbuf[2] = hold >>> 16 & 255;
+					hbuf[3] = hold >>> 24 & 255;
+					state.check = crc32(state.check, hbuf, 4, 0);
+				}
+				hold = 0;
+				bits = 0;
+				state.mode = OS;
+			case OS:
+				while (bits < 16) {
+					if (have === 0) break inf_leave;
+					have--;
+					hold += input[next++] << bits;
+					bits += 8;
+				}
+				if (state.head) {
+					state.head.xflags = hold & 255;
+					state.head.os = hold >> 8;
+				}
+				if (state.flags & 512) {
+					hbuf[0] = hold & 255;
+					hbuf[1] = hold >>> 8 & 255;
+					state.check = crc32(state.check, hbuf, 2, 0);
+				}
+				hold = 0;
+				bits = 0;
+				state.mode = EXLEN;
+			case EXLEN:
+				if (state.flags & 1024) {
+					while (bits < 16) {
+						if (have === 0) break inf_leave;
+						have--;
+						hold += input[next++] << bits;
+						bits += 8;
+					}
+					state.length = hold;
+					if (state.head) state.head.extra_len = hold;
+					if (state.flags & 512) {
+						hbuf[0] = hold & 255;
+						hbuf[1] = hold >>> 8 & 255;
+						state.check = crc32(state.check, hbuf, 2, 0);
+					}
+					hold = 0;
+					bits = 0;
+				} else if (state.head) state.head.extra = null;
+				state.mode = EXTRA;
+			case EXTRA:
+				if (state.flags & 1024) {
+					copy = state.length;
+					if (copy > have) copy = have;
+					if (copy) {
+						if (state.head) {
+							len = state.head.extra_len - state.length;
+							if (!state.head.extra) state.head.extra = new Array(state.head.extra_len);
+							utils.arraySet(state.head.extra, input, next, copy, len);
+						}
+						if (state.flags & 512) state.check = crc32(state.check, input, copy, next);
+						have -= copy;
+						next += copy;
+						state.length -= copy;
+					}
+					if (state.length) break inf_leave;
+				}
+				state.length = 0;
+				state.mode = NAME;
+			case NAME:
+				if (state.flags & 2048) {
+					if (have === 0) break inf_leave;
+					copy = 0;
+					do {
+						len = input[next + copy++];
+						if (state.head && len && state.length < 65536) state.head.name += String.fromCharCode(len);
+					} while (len && copy < have);
+					if (state.flags & 512) state.check = crc32(state.check, input, copy, next);
+					have -= copy;
+					next += copy;
+					if (len) break inf_leave;
+				} else if (state.head) state.head.name = null;
+				state.length = 0;
+				state.mode = COMMENT;
+			case COMMENT:
+				if (state.flags & 4096) {
+					if (have === 0) break inf_leave;
+					copy = 0;
+					do {
+						len = input[next + copy++];
+						if (state.head && len && state.length < 65536) state.head.comment += String.fromCharCode(len);
+					} while (len && copy < have);
+					if (state.flags & 512) state.check = crc32(state.check, input, copy, next);
+					have -= copy;
+					next += copy;
+					if (len) break inf_leave;
+				} else if (state.head) state.head.comment = null;
+				state.mode = HCRC;
+			case HCRC:
+				if (state.flags & 512) {
+					while (bits < 16) {
+						if (have === 0) break inf_leave;
+						have--;
+						hold += input[next++] << bits;
+						bits += 8;
+					}
+					if (hold !== (state.check & 65535)) {
+						strm.msg = "header crc mismatch";
+						state.mode = BAD;
+						break;
+					}
+					hold = 0;
+					bits = 0;
+				}
+				if (state.head) {
+					state.head.hcrc = state.flags >> 9 & 1;
+					state.head.done = true;
+				}
+				strm.adler = state.check = 0;
+				state.mode = TYPE;
+				break;
+			case DICTID:
+				while (bits < 32) {
+					if (have === 0) break inf_leave;
+					have--;
+					hold += input[next++] << bits;
+					bits += 8;
+				}
+				strm.adler = state.check = zswap32(hold);
+				hold = 0;
+				bits = 0;
+				state.mode = DICT;
+			case DICT:
+				if (state.havedict === 0) {
+					strm.next_out = put;
+					strm.avail_out = left;
+					strm.next_in = next;
+					strm.avail_in = have;
+					state.hold = hold;
+					state.bits = bits;
+					return Z_NEED_DICT;
+				}
+				strm.adler = state.check = 1;
+				state.mode = TYPE;
+			case TYPE: if (flush === Z_BLOCK || flush === Z_TREES) break inf_leave;
+			case TYPEDO:
+				if (state.last) {
+					hold >>>= bits & 7;
+					bits -= bits & 7;
+					state.mode = CHECK;
+					break;
+				}
+				while (bits < 3) {
+					if (have === 0) break inf_leave;
+					have--;
+					hold += input[next++] << bits;
+					bits += 8;
+				}
+				state.last = hold & 1;
+				hold >>>= 1;
+				bits -= 1;
+				switch (hold & 3) {
+					case 0:
+						state.mode = STORED;
+						break;
+					case 1:
+						fixedtables(state);
+						state.mode = LEN_;
+						if (flush === Z_TREES) {
+							hold >>>= 2;
+							bits -= 2;
+							break inf_leave;
+						}
+						break;
+					case 2:
+						state.mode = TABLE;
+						break;
+					case 3:
+						strm.msg = "invalid block type";
+						state.mode = BAD;
+				}
+				hold >>>= 2;
+				bits -= 2;
+				break;
+			case STORED:
+				hold >>>= bits & 7;
+				bits -= bits & 7;
+				while (bits < 32) {
+					if (have === 0) break inf_leave;
+					have--;
+					hold += input[next++] << bits;
+					bits += 8;
+				}
+				if ((hold & 65535) !== (hold >>> 16 ^ 65535)) {
+					strm.msg = "invalid stored block lengths";
+					state.mode = BAD;
+					break;
+				}
+				state.length = hold & 65535;
+				hold = 0;
+				bits = 0;
+				state.mode = COPY_;
+				if (flush === Z_TREES) break inf_leave;
+			case COPY_: state.mode = COPY;
+			case COPY:
+				copy = state.length;
+				if (copy) {
+					if (copy > have) copy = have;
+					if (copy > left) copy = left;
+					if (copy === 0) break inf_leave;
+					utils.arraySet(output, input, next, copy, put);
+					have -= copy;
+					next += copy;
+					left -= copy;
+					put += copy;
+					state.length -= copy;
+					break;
+				}
+				state.mode = TYPE;
+				break;
+			case TABLE:
+				while (bits < 14) {
+					if (have === 0) break inf_leave;
+					have--;
+					hold += input[next++] << bits;
+					bits += 8;
+				}
+				state.nlen = (hold & 31) + 257;
+				hold >>>= 5;
+				bits -= 5;
+				state.ndist = (hold & 31) + 1;
+				hold >>>= 5;
+				bits -= 5;
+				state.ncode = (hold & 15) + 4;
+				hold >>>= 4;
+				bits -= 4;
+				if (state.nlen > 286 || state.ndist > 30) {
+					strm.msg = "too many length or distance symbols";
+					state.mode = BAD;
+					break;
+				}
+				state.have = 0;
+				state.mode = LENLENS;
+			case LENLENS:
+				while (state.have < state.ncode) {
+					while (bits < 3) {
+						if (have === 0) break inf_leave;
+						have--;
+						hold += input[next++] << bits;
+						bits += 8;
+					}
+					state.lens[order[state.have++]] = hold & 7;
+					hold >>>= 3;
+					bits -= 3;
+				}
+				while (state.have < 19) state.lens[order[state.have++]] = 0;
+				state.lencode = state.lendyn;
+				state.lenbits = 7;
+				opts = { bits: state.lenbits };
+				ret = inflate_table(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts);
+				state.lenbits = opts.bits;
+				if (ret) {
+					strm.msg = "invalid code lengths set";
+					state.mode = BAD;
+					break;
+				}
+				state.have = 0;
+				state.mode = CODELENS;
+			case CODELENS:
+				while (state.have < state.nlen + state.ndist) {
+					for (;;) {
+						here = state.lencode[hold & (1 << state.lenbits) - 1];
+						here_bits = here >>> 24;
+						here_op = here >>> 16 & 255;
+						here_val = here & 65535;
+						if (here_bits <= bits) break;
+						if (have === 0) break inf_leave;
+						have--;
+						hold += input[next++] << bits;
+						bits += 8;
+					}
+					if (here_val < 16) {
+						hold >>>= here_bits;
+						bits -= here_bits;
+						state.lens[state.have++] = here_val;
+					} else {
+						if (here_val === 16) {
+							n = here_bits + 2;
+							while (bits < n) {
+								if (have === 0) break inf_leave;
+								have--;
+								hold += input[next++] << bits;
+								bits += 8;
+							}
+							hold >>>= here_bits;
+							bits -= here_bits;
+							if (state.have === 0) {
+								strm.msg = "invalid bit length repeat";
+								state.mode = BAD;
+								break;
+							}
+							len = state.lens[state.have - 1];
+							copy = 3 + (hold & 3);
+							hold >>>= 2;
+							bits -= 2;
+						} else if (here_val === 17) {
+							n = here_bits + 3;
+							while (bits < n) {
+								if (have === 0) break inf_leave;
+								have--;
+								hold += input[next++] << bits;
+								bits += 8;
+							}
+							hold >>>= here_bits;
+							bits -= here_bits;
+							len = 0;
+							copy = 3 + (hold & 7);
+							hold >>>= 3;
+							bits -= 3;
+						} else {
+							n = here_bits + 7;
+							while (bits < n) {
+								if (have === 0) break inf_leave;
+								have--;
+								hold += input[next++] << bits;
+								bits += 8;
+							}
+							hold >>>= here_bits;
+							bits -= here_bits;
+							len = 0;
+							copy = 11 + (hold & 127);
+							hold >>>= 7;
+							bits -= 7;
+						}
+						if (state.have + copy > state.nlen + state.ndist) {
+							strm.msg = "invalid bit length repeat";
+							state.mode = BAD;
+							break;
+						}
+						while (copy--) state.lens[state.have++] = len;
+					}
+				}
+				if (state.mode === BAD) break;
+				if (state.lens[256] === 0) {
+					strm.msg = "invalid code -- missing end-of-block";
+					state.mode = BAD;
+					break;
+				}
+				state.lenbits = 9;
+				opts = { bits: state.lenbits };
+				ret = inflate_table(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts);
+				state.lenbits = opts.bits;
+				if (ret) {
+					strm.msg = "invalid literal/lengths set";
+					state.mode = BAD;
+					break;
+				}
+				state.distbits = 6;
+				state.distcode = state.distdyn;
+				opts = { bits: state.distbits };
+				ret = inflate_table(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts);
+				state.distbits = opts.bits;
+				if (ret) {
+					strm.msg = "invalid distances set";
+					state.mode = BAD;
+					break;
+				}
+				state.mode = LEN_;
+				if (flush === Z_TREES) break inf_leave;
+			case LEN_: state.mode = LEN;
+			case LEN:
+				if (have >= 6 && left >= 258) {
+					strm.next_out = put;
+					strm.avail_out = left;
+					strm.next_in = next;
+					strm.avail_in = have;
+					state.hold = hold;
+					state.bits = bits;
+					inflate_fast(strm, _out);
+					put = strm.next_out;
+					output = strm.output;
+					left = strm.avail_out;
+					next = strm.next_in;
+					input = strm.input;
+					have = strm.avail_in;
+					hold = state.hold;
+					bits = state.bits;
+					if (state.mode === TYPE) state.back = -1;
+					break;
+				}
+				state.back = 0;
+				for (;;) {
+					here = state.lencode[hold & (1 << state.lenbits) - 1];
+					here_bits = here >>> 24;
+					here_op = here >>> 16 & 255;
+					here_val = here & 65535;
+					if (here_bits <= bits) break;
+					if (have === 0) break inf_leave;
+					have--;
+					hold += input[next++] << bits;
+					bits += 8;
+				}
+				if (here_op && (here_op & 240) === 0) {
+					last_bits = here_bits;
+					last_op = here_op;
+					last_val = here_val;
+					for (;;) {
+						here = state.lencode[last_val + ((hold & (1 << last_bits + last_op) - 1) >> last_bits)];
+						here_bits = here >>> 24;
+						here_op = here >>> 16 & 255;
+						here_val = here & 65535;
+						if (last_bits + here_bits <= bits) break;
+						if (have === 0) break inf_leave;
+						have--;
+						hold += input[next++] << bits;
+						bits += 8;
+					}
+					hold >>>= last_bits;
+					bits -= last_bits;
+					state.back += last_bits;
+				}
+				hold >>>= here_bits;
+				bits -= here_bits;
+				state.back += here_bits;
+				state.length = here_val;
+				if (here_op === 0) {
+					state.mode = LIT;
+					break;
+				}
+				if (here_op & 32) {
+					state.back = -1;
+					state.mode = TYPE;
+					break;
+				}
+				if (here_op & 64) {
+					strm.msg = "invalid literal/length code";
+					state.mode = BAD;
+					break;
+				}
+				state.extra = here_op & 15;
+				state.mode = LENEXT;
+			case LENEXT:
+				if (state.extra) {
+					n = state.extra;
+					while (bits < n) {
+						if (have === 0) break inf_leave;
+						have--;
+						hold += input[next++] << bits;
+						bits += 8;
+					}
+					state.length += hold & (1 << state.extra) - 1;
+					hold >>>= state.extra;
+					bits -= state.extra;
+					state.back += state.extra;
+				}
+				state.was = state.length;
+				state.mode = DIST;
+			case DIST:
+				for (;;) {
+					here = state.distcode[hold & (1 << state.distbits) - 1];
+					here_bits = here >>> 24;
+					here_op = here >>> 16 & 255;
+					here_val = here & 65535;
+					if (here_bits <= bits) break;
+					if (have === 0) break inf_leave;
+					have--;
+					hold += input[next++] << bits;
+					bits += 8;
+				}
+				if ((here_op & 240) === 0) {
+					last_bits = here_bits;
+					last_op = here_op;
+					last_val = here_val;
+					for (;;) {
+						here = state.distcode[last_val + ((hold & (1 << last_bits + last_op) - 1) >> last_bits)];
+						here_bits = here >>> 24;
+						here_op = here >>> 16 & 255;
+						here_val = here & 65535;
+						if (last_bits + here_bits <= bits) break;
+						if (have === 0) break inf_leave;
+						have--;
+						hold += input[next++] << bits;
+						bits += 8;
+					}
+					hold >>>= last_bits;
+					bits -= last_bits;
+					state.back += last_bits;
+				}
+				hold >>>= here_bits;
+				bits -= here_bits;
+				state.back += here_bits;
+				if (here_op & 64) {
+					strm.msg = "invalid distance code";
+					state.mode = BAD;
+					break;
+				}
+				state.offset = here_val;
+				state.extra = here_op & 15;
+				state.mode = DISTEXT;
+			case DISTEXT:
+				if (state.extra) {
+					n = state.extra;
+					while (bits < n) {
+						if (have === 0) break inf_leave;
+						have--;
+						hold += input[next++] << bits;
+						bits += 8;
+					}
+					state.offset += hold & (1 << state.extra) - 1;
+					hold >>>= state.extra;
+					bits -= state.extra;
+					state.back += state.extra;
+				}
+				if (state.offset > state.dmax) {
+					strm.msg = "invalid distance too far back";
+					state.mode = BAD;
+					break;
+				}
+				state.mode = MATCH;
+			case MATCH:
+				if (left === 0) break inf_leave;
+				copy = _out - left;
+				if (state.offset > copy) {
+					copy = state.offset - copy;
+					if (copy > state.whave) {
+						if (state.sane) {
+							strm.msg = "invalid distance too far back";
+							state.mode = BAD;
+							break;
+						}
+					}
+					if (copy > state.wnext) {
+						copy -= state.wnext;
+						from = state.wsize - copy;
+					} else from = state.wnext - copy;
+					if (copy > state.length) copy = state.length;
+					from_source = state.window;
+				} else {
+					from_source = output;
+					from = put - state.offset;
+					copy = state.length;
+				}
+				if (copy > left) copy = left;
+				left -= copy;
+				state.length -= copy;
+				do
+					output[put++] = from_source[from++];
+				while (--copy);
+				if (state.length === 0) state.mode = LEN;
+				break;
+			case LIT:
+				if (left === 0) break inf_leave;
+				output[put++] = state.length;
+				left--;
+				state.mode = LEN;
+				break;
+			case CHECK:
+				if (state.wrap) {
+					while (bits < 32) {
+						if (have === 0) break inf_leave;
+						have--;
+						hold |= input[next++] << bits;
+						bits += 8;
+					}
+					_out -= left;
+					strm.total_out += _out;
+					state.total += _out;
+					if (_out) strm.adler = state.check = state.flags ? crc32(state.check, output, _out, put - _out) : adler32(state.check, output, _out, put - _out);
+					_out = left;
+					if ((state.flags ? hold : zswap32(hold)) !== state.check) {
+						strm.msg = "incorrect data check";
+						state.mode = BAD;
+						break;
+					}
+					hold = 0;
+					bits = 0;
+				}
+				state.mode = LENGTH;
+			case LENGTH:
+				if (state.wrap && state.flags) {
+					while (bits < 32) {
+						if (have === 0) break inf_leave;
+						have--;
+						hold += input[next++] << bits;
+						bits += 8;
+					}
+					if (hold !== (state.total & 4294967295)) {
+						strm.msg = "incorrect length check";
+						state.mode = BAD;
+						break;
+					}
+					hold = 0;
+					bits = 0;
+				}
+				state.mode = DONE;
+			case DONE:
+				ret = Z_STREAM_END;
+				break inf_leave;
+			case BAD:
+				ret = Z_DATA_ERROR;
+				break inf_leave;
+			case MEM: return Z_MEM_ERROR;
+			case SYNC:
+			default: return Z_STREAM_ERROR;
+		}
+		strm.next_out = put;
+		strm.avail_out = left;
+		strm.next_in = next;
+		strm.avail_in = have;
+		state.hold = hold;
+		state.bits = bits;
+		if (state.wsize || _out !== strm.avail_out && state.mode < BAD && (state.mode < CHECK || flush !== Z_FINISH)) {
+			if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) {
+				state.mode = MEM;
+				return Z_MEM_ERROR;
+			}
+		}
+		_in -= strm.avail_in;
+		_out -= strm.avail_out;
+		strm.total_in += _in;
+		strm.total_out += _out;
+		state.total += _out;
+		if (state.wrap && _out) strm.adler = state.check = state.flags ? crc32(state.check, output, _out, strm.next_out - _out) : adler32(state.check, output, _out, strm.next_out - _out);
+		strm.data_type = state.bits + (state.last ? 64 : 0) + (state.mode === TYPE ? 128 : 0) + (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0);
+		if ((_in === 0 && _out === 0 || flush === Z_FINISH) && ret === Z_OK) ret = Z_BUF_ERROR;
+		return ret;
+	}
+	function inflateEnd(strm) {
+		if (!strm || !strm.state) return Z_STREAM_ERROR;
+		var state = strm.state;
+		if (state.window) state.window = null;
+		strm.state = null;
+		return Z_OK;
+	}
+	function inflateGetHeader(strm, head) {
+		var state;
+		if (!strm || !strm.state) return Z_STREAM_ERROR;
+		state = strm.state;
+		if ((state.wrap & 2) === 0) return Z_STREAM_ERROR;
+		state.head = head;
+		head.done = false;
+		return Z_OK;
+	}
+	function inflateSetDictionary(strm, dictionary) {
+		var dictLength = dictionary.length;
+		var state;
+		var dictid;
+		var ret;
+		if (!strm || !strm.state) return Z_STREAM_ERROR;
+		state = strm.state;
+		if (state.wrap !== 0 && state.mode !== DICT) return Z_STREAM_ERROR;
+		if (state.mode === DICT) {
+			dictid = 1;
+			dictid = adler32(dictid, dictionary, dictLength, 0);
+			if (dictid !== state.check) return Z_DATA_ERROR;
+		}
+		ret = updatewindow(strm, dictionary, dictLength, dictLength);
+		if (ret) {
+			state.mode = MEM;
+			return Z_MEM_ERROR;
+		}
+		state.havedict = 1;
+		return Z_OK;
+	}
+	exports.inflateReset = inflateReset;
+	exports.inflateReset2 = inflateReset2;
+	exports.inflateResetKeep = inflateResetKeep;
+	exports.inflateInit = inflateInit;
+	exports.inflateInit2 = inflateInit2;
+	exports.inflate = inflate;
+	exports.inflateEnd = inflateEnd;
+	exports.inflateGetHeader = inflateGetHeader;
+	exports.inflateSetDictionary = inflateSetDictionary;
+	exports.inflateInfo = "pako inflate (from Nodeca project)";
+}));
+//#endregion
+//#region ../../../node_modules/.bun/pako@1.0.11/node_modules/pako/lib/zlib/constants.js
+var require_constants = /* @__PURE__ */ __commonJSMin(((exports, module) => {
+	module.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
+	};
+}));
+//#endregion
+//#region ../../../node_modules/.bun/pako@1.0.11/node_modules/pako/lib/zlib/gzheader.js
+var require_gzheader = /* @__PURE__ */ __commonJSMin(((exports, module) => {
+	function GZheader() {
+		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 = false;
+	}
+	module.exports = GZheader;
+}));
+//#endregion
+//#region ../../../node_modules/.bun/pako@1.0.11/node_modules/pako/lib/inflate.js
+var require_inflate = /* @__PURE__ */ __commonJSMin(((exports) => {
+	var zlib_inflate = require_inflate$1();
+	var utils = require_common();
+	var strings = require_strings();
+	var c = require_constants();
+	var msg = require_messages();
+	var ZStream = require_zstream();
+	var GZheader = require_gzheader();
+	var toString = Object.prototype.toString;
+	/**
+	* class Inflate
+	*
+	* Generic JS-style wrapper for zlib calls. If you don't need
+	* streaming behaviour - use more simple functions: [[inflate]]
+	* and [[inflateRaw]].
+	**/
+	/**
+	* Inflate.result -> Uint8Array|Array|String
+	*
+	* Uncompressed result, generated by default [[Inflate#onData]]
+	* and [[Inflate#onEnd]] handlers. Filled after you push last chunk
+	* (call [[Inflate#push]] with `Z_FINISH` / `true` param) or if you
+	* push a chunk with explicit flush (call [[Inflate#push]] with
+	* `Z_SYNC_FLUSH` param).
+	**/
+	/**
+	* Inflate.err -> Number
+	*
+	* Error code after inflate finished. 0 (Z_OK) on success.
+	* Should be checked if broken data possible.
+	**/
+	/**
+	* Inflate.msg -> String
+	*
+	* Error message, if [[Inflate.err]] != 0
+	**/
+	/**
+	* new Inflate(options)
+	* - options (Object): zlib inflate options.
+	*
+	* Creates new inflator instance with specified params. Throws exception
+	* on bad params. Supported options:
+	*
+	* - `windowBits`
+	* - `dictionary`
+	*
+	* [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)
+	* for more information on these.
+	*
+	* Additional options, for internal needs:
+	*
+	* - `chunkSize` - size of generated data chunks (16K by default)
+	* - `raw` (Boolean) - do raw inflate
+	* - `to` (String) - if equal to 'string', then result will be converted
+	*   from utf8 to utf16 (javascript) string. When string output requested,
+	*   chunk length can differ from `chunkSize`, depending on content.
+	*
+	* By default, when no options set, autodetect deflate/gzip data format via
+	* wrapper header.
+	*
+	* ##### Example:
+	*
+	* ```javascript
+	* var pako = require('pako')
+	*   , chunk1 = Uint8Array([1,2,3,4,5,6,7,8,9])
+	*   , chunk2 = Uint8Array([10,11,12,13,14,15,16,17,18,19]);
+	*
+	* var inflate = new pako.Inflate({ level: 3});
+	*
+	* inflate.push(chunk1, false);
+	* inflate.push(chunk2, true);  // true -> last chunk
+	*
+	* if (inflate.err) { throw new Error(inflate.err); }
+	*
+	* console.log(inflate.result);
+	* ```
+	**/
+	function Inflate(options) {
+		if (!(this instanceof Inflate)) return new Inflate(options);
+		this.options = utils.assign({
+			chunkSize: 16384,
+			windowBits: 0,
+			to: ""
+		}, options || {});
+		var opt = this.options;
+		if (opt.raw && opt.windowBits >= 0 && opt.windowBits < 16) {
+			opt.windowBits = -opt.windowBits;
+			if (opt.windowBits === 0) opt.windowBits = -15;
+		}
+		if (opt.windowBits >= 0 && opt.windowBits < 16 && !(options && options.windowBits)) opt.windowBits += 32;
+		if (opt.windowBits > 15 && opt.windowBits < 48) {
+			if ((opt.windowBits & 15) === 0) opt.windowBits |= 15;
+		}
+		this.err = 0;
+		this.msg = "";
+		this.ended = false;
+		this.chunks = [];
+		this.strm = new ZStream();
+		this.strm.avail_out = 0;
+		var status = zlib_inflate.inflateInit2(this.strm, opt.windowBits);
+		if (status !== c.Z_OK) throw new Error(msg[status]);
+		this.header = new GZheader();
+		zlib_inflate.inflateGetHeader(this.strm, this.header);
+		if (opt.dictionary) {
+			if (typeof opt.dictionary === "string") opt.dictionary = strings.string2buf(opt.dictionary);
+			else if (toString.call(opt.dictionary) === "[object ArrayBuffer]") opt.dictionary = new Uint8Array(opt.dictionary);
+			if (opt.raw) {
+				status = zlib_inflate.inflateSetDictionary(this.strm, opt.dictionary);
+				if (status !== c.Z_OK) throw new Error(msg[status]);
+			}
+		}
+	}
+	/**
+	* Inflate#push(data[, mode]) -> Boolean
+	* - data (Uint8Array|Array|ArrayBuffer|String): input data
+	* - mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.
+	*   See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.
+	*
+	* Sends input data to inflate pipe, generating [[Inflate#onData]] calls with
+	* new output chunks. Returns `true` on success. The last data block must have
+	* mode Z_FINISH (or `true`). That will flush internal pending buffers and call
+	* [[Inflate#onEnd]]. For interim explicit flushes (without ending the stream) you
+	* can use mode Z_SYNC_FLUSH, keeping the decompression context.
+	*
+	* On fail call [[Inflate#onEnd]] with error code and return false.
+	*
+	* We strongly recommend to use `Uint8Array` on input for best speed (output
+	* format is detected automatically). Also, don't skip last param and always
+	* use the same type in your code (boolean or number). That will improve JS speed.
+	*
+	* For regular `Array`-s make sure all elements are [0..255].
+	*
+	* ##### Example
+	*
+	* ```javascript
+	* push(chunk, false); // push one of data chunks
+	* ...
+	* push(chunk, true);  // push last chunk
+	* ```
+	**/
+	Inflate.prototype.push = function(data, mode) {
+		var strm = this.strm;
+		var chunkSize = this.options.chunkSize;
+		var dictionary = this.options.dictionary;
+		var status, _mode;
+		var next_out_utf8, tail, utf8str;
+		var allowBufError = false;
+		if (this.ended) return false;
+		_mode = mode === ~~mode ? mode : mode === true ? c.Z_FINISH : c.Z_NO_FLUSH;
+		if (typeof data === "string") strm.input = strings.binstring2buf(data);
+		else if (toString.call(data) === "[object ArrayBuffer]") strm.input = new Uint8Array(data);
+		else strm.input = data;
+		strm.next_in = 0;
+		strm.avail_in = strm.input.length;
+		do {
+			if (strm.avail_out === 0) {
+				strm.output = new utils.Buf8(chunkSize);
+				strm.next_out = 0;
+				strm.avail_out = chunkSize;
+			}
+			status = zlib_inflate.inflate(strm, c.Z_NO_FLUSH);
+			if (status === c.Z_NEED_DICT && dictionary) status = zlib_inflate.inflateSetDictionary(this.strm, dictionary);
+			if (status === c.Z_BUF_ERROR && allowBufError === true) {
+				status = c.Z_OK;
+				allowBufError = false;
+			}
+			if (status !== c.Z_STREAM_END && status !== c.Z_OK) {
+				this.onEnd(status);
+				this.ended = true;
+				return false;
+			}
+			if (strm.next_out) {
+				if (strm.avail_out === 0 || status === c.Z_STREAM_END || strm.avail_in === 0 && (_mode === c.Z_FINISH || _mode === c.Z_SYNC_FLUSH)) if (this.options.to === "string") {
+					next_out_utf8 = strings.utf8border(strm.output, strm.next_out);
+					tail = strm.next_out - next_out_utf8;
+					utf8str = strings.buf2string(strm.output, next_out_utf8);
+					strm.next_out = tail;
+					strm.avail_out = chunkSize - tail;
+					if (tail) utils.arraySet(strm.output, strm.output, next_out_utf8, tail, 0);
+					this.onData(utf8str);
+				} else this.onData(utils.shrinkBuf(strm.output, strm.next_out));
+			}
+			if (strm.avail_in === 0 && strm.avail_out === 0) allowBufError = true;
+		} while ((strm.avail_in > 0 || strm.avail_out === 0) && status !== c.Z_STREAM_END);
+		if (status === c.Z_STREAM_END) _mode = c.Z_FINISH;
+		if (_mode === c.Z_FINISH) {
+			status = zlib_inflate.inflateEnd(this.strm);
+			this.onEnd(status);
+			this.ended = true;
+			return status === c.Z_OK;
+		}
+		if (_mode === c.Z_SYNC_FLUSH) {
+			this.onEnd(c.Z_OK);
+			strm.avail_out = 0;
+			return true;
+		}
+		return true;
+	};
+	/**
+	* Inflate#onData(chunk) -> Void
+	* - chunk (Uint8Array|Array|String): output data. Type of array depends
+	*   on js engine support. When string output requested, each chunk
+	*   will be string.
+	*
+	* By default, stores data blocks in `chunks[]` property and glue
+	* those in `onEnd`. Override this handler, if you need another behaviour.
+	**/
+	Inflate.prototype.onData = function(chunk) {
+		this.chunks.push(chunk);
+	};
+	/**
+	* Inflate#onEnd(status) -> Void
+	* - status (Number): inflate status. 0 (Z_OK) on success,
+	*   other if not.
+	*
+	* Called either after you tell inflate that the input stream is
+	* complete (Z_FINISH) or should be flushed (Z_SYNC_FLUSH)
+	* or if an error happened. By default - join collected chunks,
+	* free memory and fill `results` / `err` properties.
+	**/
+	Inflate.prototype.onEnd = function(status) {
+		if (status === c.Z_OK) if (this.options.to === "string") this.result = this.chunks.join("");
+		else this.result = utils.flattenChunks(this.chunks);
+		this.chunks = [];
+		this.err = status;
+		this.msg = this.strm.msg;
+	};
+	/**
+	* inflate(data[, options]) -> Uint8Array|Array|String
+	* - data (Uint8Array|Array|String): input data to decompress.
+	* - options (Object): zlib inflate options.
+	*
+	* Decompress `data` with inflate/ungzip and `options`. Autodetect
+	* format via wrapper header by default. That's why we don't provide
+	* separate `ungzip` method.
+	*
+	* Supported options are:
+	*
+	* - windowBits
+	*
+	* [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)
+	* for more information.
+	*
+	* Sugar (options):
+	*
+	* - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify
+	*   negative windowBits implicitly.
+	* - `to` (String) - if equal to 'string', then result will be converted
+	*   from utf8 to utf16 (javascript) string. When string output requested,
+	*   chunk length can differ from `chunkSize`, depending on content.
+	*
+	*
+	* ##### Example:
+	*
+	* ```javascript
+	* var pako = require('pako')
+	*   , input = pako.deflate([1,2,3,4,5,6,7,8,9])
+	*   , output;
+	*
+	* try {
+	*   output = pako.inflate(input);
+	* } catch (err)
+	*   console.log(err);
+	* }
+	* ```
+	**/
+	function inflate(input, options) {
+		var inflator = new Inflate(options);
+		inflator.push(input, true);
+		if (inflator.err) throw inflator.msg || msg[inflator.err];
+		return inflator.result;
+	}
+	/**
+	* inflateRaw(data[, options]) -> Uint8Array|Array|String
+	* - data (Uint8Array|Array|String): input data to decompress.
+	* - options (Object): zlib inflate options.
+	*
+	* The same as [[inflate]], but creates raw data, without wrapper
+	* (header and adler32 crc).
+	**/
+	function inflateRaw(input, options) {
+		options = options || {};
+		options.raw = true;
+		return inflate(input, options);
+	}
+	/**
+	* ungzip(data[, options]) -> Uint8Array|Array|String
+	* - data (Uint8Array|Array|String): input data to decompress.
+	* - options (Object): zlib inflate options.
+	*
+	* Just shortcut to [[inflate]], because it autodetects format
+	* by header.content. Done for convenience.
+	**/
+	exports.Inflate = Inflate;
+	exports.inflate = inflate;
+	exports.inflateRaw = inflateRaw;
+	exports.ungzip = inflate;
+}));
+//#endregion
+//#region ../../../node_modules/.bun/pako@1.0.11/node_modules/pako/index.js
+var require_pako = /* @__PURE__ */ __commonJSMin(((exports, module) => {
+	var assign = require_common().assign;
+	var deflate = require_deflate();
+	var inflate = require_inflate();
+	var constants = require_constants();
+	var pako = {};
+	assign(pako, deflate, inflate, constants);
+	module.exports = pako;
+}));
+//#endregion
+//#region ../../../node_modules/.bun/upng-js@2.1.0/node_modules/upng-js/UPNG.js
+var require_UPNG = /* @__PURE__ */ __commonJSMin(((exports, module) => {
+	(function() {
+		var UPNG = {};
+		var pako;
+		if (typeof module == "object") module.exports = UPNG;
+		else window.UPNG = UPNG;
+		if (typeof __require == "function") pako = require_pako();
+		else pako = window.pako;
+		(function(UPNG, pako) {
+			UPNG.toRGBA8 = function(out) {
+				var w = out.width, h = out.height;
+				if (out.tabs.acTL == null) return [UPNG.toRGBA8.decodeImage(out.data, w, h, out).buffer];
+				var frms = [];
+				if (out.frames[0].data == null) out.frames[0].data = out.data;
+				var img, empty = new Uint8Array(w * h * 4);
+				for (var i = 0; i < out.frames.length; i++) {
+					var frm = out.frames[i];
+					var fx = frm.rect.x, fy = frm.rect.y, fw = frm.rect.width, fh = frm.rect.height;
+					var fdata = UPNG.toRGBA8.decodeImage(frm.data, fw, fh, out);
+					if (i == 0) img = fdata;
+					else if (frm.blend == 0) UPNG._copyTile(fdata, fw, fh, img, w, h, fx, fy, 0);
+					else if (frm.blend == 1) UPNG._copyTile(fdata, fw, fh, img, w, h, fx, fy, 1);
+					frms.push(img.buffer);
+					img = img.slice(0);
+					if (frm.dispose == 0) {} else if (frm.dispose == 1) UPNG._copyTile(empty, fw, fh, img, w, h, fx, fy, 0);
+					else if (frm.dispose == 2) {
+						var pi = i - 1;
+						while (out.frames[pi].dispose == 2) pi--;
+						img = new Uint8Array(frms[pi]).slice(0);
+					}
+				}
+				return frms;
+			};
+			UPNG.toRGBA8.decodeImage = function(data, w, h, out) {
+				var area = w * h, bpp = UPNG.decode._getBPP(out);
+				var bpl = Math.ceil(w * bpp / 8);
+				var bf = new Uint8Array(area * 4), bf32 = new Uint32Array(bf.buffer);
+				var ctype = out.ctype, depth = out.depth;
+				var rs = UPNG._bin.readUshort;
+				if (ctype == 6) {
+					var qarea = area << 2;
+					if (depth == 8) for (var i = 0; i < qarea; i++) bf[i] = data[i];
+					if (depth == 16) for (var i = 0; i < qarea; i++) bf[i] = data[i << 1];
+				} else if (ctype == 2) {
+					var ts = out.tabs["tRNS"], tr = -1, tg = -1, tb = -1;
+					if (ts) {
+						tr = ts[0];
+						tg = ts[1];
+						tb = ts[2];
+					}
+					if (depth == 8) for (var i = 0; i < area; i++) {
+						var qi = i << 2, ti = i * 3;
+						bf[qi] = data[ti];
+						bf[qi + 1] = data[ti + 1];
+						bf[qi + 2] = data[ti + 2];
+						bf[qi + 3] = 255;
+						if (tr != -1 && data[ti] == tr && data[ti + 1] == tg && data[ti + 2] == tb) bf[qi + 3] = 0;
+					}
+					if (depth == 16) for (var i = 0; i < area; i++) {
+						var qi = i << 2, ti = i * 6;
+						bf[qi] = data[ti];
+						bf[qi + 1] = data[ti + 2];
+						bf[qi + 2] = data[ti + 4];
+						bf[qi + 3] = 255;
+						if (tr != -1 && rs(data, ti) == tr && rs(data, ti + 2) == tg && rs(data, ti + 4) == tb) bf[qi + 3] = 0;
+					}
+				} else if (ctype == 3) {
+					var p = out.tabs["PLTE"], ap = out.tabs["tRNS"], tl = ap ? ap.length : 0;
+					if (depth == 1) for (var y = 0; y < h; y++) {
+						var s0 = y * bpl, t0 = y * w;
+						for (var i = 0; i < w; i++) {
+							var qi = t0 + i << 2, j = data[s0 + (i >> 3)] >> 7 - ((i & 7) << 0) & 1, cj = 3 * j;
+							bf[qi] = p[cj];
+							bf[qi + 1] = p[cj + 1];
+							bf[qi + 2] = p[cj + 2];
+							bf[qi + 3] = j < tl ? ap[j] : 255;
+						}
+					}
+					if (depth == 2) for (var y = 0; y < h; y++) {
+						var s0 = y * bpl, t0 = y * w;
+						for (var i = 0; i < w; i++) {
+							var qi = t0 + i << 2, j = data[s0 + (i >> 2)] >> 6 - ((i & 3) << 1) & 3, cj = 3 * j;
+							bf[qi] = p[cj];
+							bf[qi + 1] = p[cj + 1];
+							bf[qi + 2] = p[cj + 2];
+							bf[qi + 3] = j < tl ? ap[j] : 255;
+						}
+					}
+					if (depth == 4) for (var y = 0; y < h; y++) {
+						var s0 = y * bpl, t0 = y * w;
+						for (var i = 0; i < w; i++) {
+							var qi = t0 + i << 2, j = data[s0 + (i >> 1)] >> 4 - ((i & 1) << 2) & 15, cj = 3 * j;
+							bf[qi] = p[cj];
+							bf[qi + 1] = p[cj + 1];
+							bf[qi + 2] = p[cj + 2];
+							bf[qi + 3] = j < tl ? ap[j] : 255;
+						}
+					}
+					if (depth == 8) for (var i = 0; i < area; i++) {
+						var qi = i << 2, j = data[i], cj = 3 * j;
+						bf[qi] = p[cj];
+						bf[qi + 1] = p[cj + 1];
+						bf[qi + 2] = p[cj + 2];
+						bf[qi + 3] = j < tl ? ap[j] : 255;
+					}
+				} else if (ctype == 4) {
+					if (depth == 8) for (var i = 0; i < area; i++) {
+						var qi = i << 2, di = i << 1, gr = data[di];
+						bf[qi] = gr;
+						bf[qi + 1] = gr;
+						bf[qi + 2] = gr;
+						bf[qi + 3] = data[di + 1];
+					}
+					if (depth == 16) for (var i = 0; i < area; i++) {
+						var qi = i << 2, di = i << 2, gr = data[di];
+						bf[qi] = gr;
+						bf[qi + 1] = gr;
+						bf[qi + 2] = gr;
+						bf[qi + 3] = data[di + 2];
+					}
+				} else if (ctype == 0) {
+					var tr = out.tabs["tRNS"] ? out.tabs["tRNS"] : -1;
+					if (depth == 1) for (var i = 0; i < area; i++) {
+						var gr = 255 * (data[i >> 3] >> 7 - (i & 7) & 1), al = gr == tr * 255 ? 0 : 255;
+						bf32[i] = al << 24 | gr << 16 | gr << 8 | gr;
+					}
+					if (depth == 2) for (var i = 0; i < area; i++) {
+						var gr = 85 * (data[i >> 2] >> 6 - ((i & 3) << 1) & 3), al = gr == tr * 85 ? 0 : 255;
+						bf32[i] = al << 24 | gr << 16 | gr << 8 | gr;
+					}
+					if (depth == 4) for (var i = 0; i < area; i++) {
+						var gr = 17 * (data[i >> 1] >> 4 - ((i & 1) << 2) & 15), al = gr == tr * 17 ? 0 : 255;
+						bf32[i] = al << 24 | gr << 16 | gr << 8 | gr;
+					}
+					if (depth == 8) for (var i = 0; i < area; i++) {
+						var gr = data[i], al = gr == tr ? 0 : 255;
+						bf32[i] = al << 24 | gr << 16 | gr << 8 | gr;
+					}
+					if (depth == 16) for (var i = 0; i < area; i++) {
+						var gr = data[i << 1], al = rs(data, i << 1) == tr ? 0 : 255;
+						bf32[i] = al << 24 | gr << 16 | gr << 8 | gr;
+					}
+				}
+				return bf;
+			};
+			UPNG.decode = function(buff) {
+				var data = new Uint8Array(buff), offset = 8, bin = UPNG._bin, rUs = bin.readUshort, rUi = bin.readUint;
+				var out = {
+					tabs: {},
+					frames: []
+				};
+				var dd = new Uint8Array(data.length), doff = 0;
+				var fd, foff = 0;
+				var mgck = [
+					137,
+					80,
+					78,
+					71,
+					13,
+					10,
+					26,
+					10
+				];
+				for (var i = 0; i < 8; i++) if (data[i] != mgck[i]) throw "The input is not a PNG file!";
+				while (offset < data.length) {
+					var len = bin.readUint(data, offset);
+					offset += 4;
+					var type = bin.readASCII(data, offset, 4);
+					offset += 4;
+					if (type == "IHDR") UPNG.decode._IHDR(data, offset, out);
+					else if (type == "IDAT") {
+						for (var i = 0; i < len; i++) dd[doff + i] = data[offset + i];
+						doff += len;
+					} else if (type == "acTL") {
+						out.tabs[type] = {
+							num_frames: rUi(data, offset),
+							num_plays: rUi(data, offset + 4)
+						};
+						fd = new Uint8Array(data.length);
+					} else if (type == "fcTL") {
+						if (foff != 0) {
+							var fr = out.frames[out.frames.length - 1];
+							fr.data = UPNG.decode._decompress(out, fd.slice(0, foff), fr.rect.width, fr.rect.height);
+							foff = 0;
+						}
+						var rct = {
+							x: rUi(data, offset + 12),
+							y: rUi(data, offset + 16),
+							width: rUi(data, offset + 4),
+							height: rUi(data, offset + 8)
+						};
+						var del = rUs(data, offset + 22);
+						del = rUs(data, offset + 20) / (del == 0 ? 100 : del);
+						var frm = {
+							rect: rct,
+							delay: Math.round(del * 1e3),
+							dispose: data[offset + 24],
+							blend: data[offset + 25]
+						};
+						out.frames.push(frm);
+					} else if (type == "fdAT") {
+						for (var i = 0; i < len - 4; i++) fd[foff + i] = data[offset + i + 4];
+						foff += len - 4;
+					} else if (type == "pHYs") out.tabs[type] = [
+						bin.readUint(data, offset),
+						bin.readUint(data, offset + 4),
+						data[offset + 8]
+					];
+					else if (type == "cHRM") {
+						out.tabs[type] = [];
+						for (var i = 0; i < 8; i++) out.tabs[type].push(bin.readUint(data, offset + i * 4));
+					} else if (type == "tEXt") {
+						if (out.tabs[type] == null) out.tabs[type] = {};
+						var nz = bin.nextZero(data, offset);
+						var keyw = bin.readASCII(data, offset, nz - offset);
+						var text = bin.readASCII(data, nz + 1, offset + len - nz - 1);
+						out.tabs[type][keyw] = text;
+					} else if (type == "iTXt") {
+						if (out.tabs[type] == null) out.tabs[type] = {};
+						var nz = 0, off = offset;
+						nz = bin.nextZero(data, off);
+						var keyw = bin.readASCII(data, off, nz - off);
+						off = nz + 1;
+						data[off];
+						data[off + 1];
+						off += 2;
+						nz = bin.nextZero(data, off);
+						bin.readASCII(data, off, nz - off);
+						off = nz + 1;
+						nz = bin.nextZero(data, off);
+						bin.readUTF8(data, off, nz - off);
+						off = nz + 1;
+						var text = bin.readUTF8(data, off, len - (off - offset));
+						out.tabs[type][keyw] = text;
+					} else if (type == "PLTE") out.tabs[type] = bin.readBytes(data, offset, len);
+					else if (type == "hIST") {
+						var pl = out.tabs["PLTE"].length / 3;
+						out.tabs[type] = [];
+						for (var i = 0; i < pl; i++) out.tabs[type].push(rUs(data, offset + i * 2));
+					} else if (type == "tRNS") {
+						if (out.ctype == 3) out.tabs[type] = bin.readBytes(data, offset, len);
+						else if (out.ctype == 0) out.tabs[type] = rUs(data, offset);
+						else if (out.ctype == 2) out.tabs[type] = [
+							rUs(data, offset),
+							rUs(data, offset + 2),
+							rUs(data, offset + 4)
+						];
+					} else if (type == "gAMA") out.tabs[type] = bin.readUint(data, offset) / 1e5;
+					else if (type == "sRGB") out.tabs[type] = data[offset];
+					else if (type == "bKGD") {
+						if (out.ctype == 0 || out.ctype == 4) out.tabs[type] = [rUs(data, offset)];
+						else if (out.ctype == 2 || out.ctype == 6) out.tabs[type] = [
+							rUs(data, offset),
+							rUs(data, offset + 2),
+							rUs(data, offset + 4)
+						];
+						else if (out.ctype == 3) out.tabs[type] = data[offset];
+					} else if (type == "IEND") {
+						if (foff != 0) {
+							var fr = out.frames[out.frames.length - 1];
+							fr.data = UPNG.decode._decompress(out, fd.slice(0, foff), fr.rect.width, fr.rect.height);
+							foff = 0;
+						}
+						out.data = UPNG.decode._decompress(out, dd, out.width, out.height);
+						break;
+					}
+					offset += len;
+					bin.readUint(data, offset);
+					offset += 4;
+				}
+				delete out.compress;
+				delete out.interlace;
+				delete out.filter;
+				return out;
+			};
+			UPNG.decode._decompress = function(out, dd, w, h) {
+				if (out.compress == 0) dd = UPNG.decode._inflate(dd);
+				if (out.interlace == 0) dd = UPNG.decode._filterZero(dd, out, 0, w, h);
+				else if (out.interlace == 1) dd = UPNG.decode._readInterlace(dd, out);
+				return dd;
+			};
+			UPNG.decode._inflate = function(data) {
+				return pako["inflate"](data);
+			};
+			UPNG.decode._readInterlace = function(data, out) {
+				var w = out.width, h = out.height;
+				var bpp = UPNG.decode._getBPP(out), cbpp = bpp >> 3, bpl = Math.ceil(w * bpp / 8);
+				var img = new Uint8Array(h * bpl);
+				var di = 0;
+				var starting_row = [
+					0,
+					0,
+					4,
+					0,
+					2,
+					0,
+					1
+				];
+				var starting_col = [
+					0,
+					4,
+					0,
+					2,
+					0,
+					1,
+					0
+				];
+				var row_increment = [
+					8,
+					8,
+					8,
+					4,
+					4,
+					2,
+					2
+				];
+				var col_increment = [
+					8,
+					8,
+					4,
+					4,
+					2,
+					2,
+					1
+				];
+				var pass = 0;
+				while (pass < 7) {
+					var ri = row_increment[pass], ci = col_increment[pass];
+					var sw = 0, sh = 0;
+					var cr = starting_row[pass];
+					while (cr < h) {
+						cr += ri;
+						sh++;
+					}
+					var cc = starting_col[pass];
+					while (cc < w) {
+						cc += ci;
+						sw++;
+					}
+					var bpll = Math.ceil(sw * bpp / 8);
+					UPNG.decode._filterZero(data, out, di, sw, sh);
+					var y = 0, row = starting_row[pass];
+					while (row < h) {
+						var col = starting_col[pass];
+						var cdi = di + y * bpll << 3;
+						while (col < w) {
+							if (bpp == 1) {
+								var val = data[cdi >> 3];
+								val = val >> 7 - (cdi & 7) & 1;
+								img[row * bpl + (col >> 3)] |= val << 7 - ((col & 3) << 0);
+							}
+							if (bpp == 2) {
+								var val = data[cdi >> 3];
+								val = val >> 6 - (cdi & 7) & 3;
+								img[row * bpl + (col >> 2)] |= val << 6 - ((col & 3) << 1);
+							}
+							if (bpp == 4) {
+								var val = data[cdi >> 3];
+								val = val >> 4 - (cdi & 7) & 15;
+								img[row * bpl + (col >> 1)] |= val << 4 - ((col & 1) << 2);
+							}
+							if (bpp >= 8) {
+								var ii = row * bpl + col * cbpp;
+								for (var j = 0; j < cbpp; j++) img[ii + j] = data[(cdi >> 3) + j];
+							}
+							cdi += bpp;
+							col += ci;
+						}
+						y++;
+						row += ri;
+					}
+					if (sw * sh != 0) di += sh * (1 + bpll);
+					pass = pass + 1;
+				}
+				return img;
+			};
+			UPNG.decode._getBPP = function(out) {
+				return [
+					1,
+					null,
+					3,
+					1,
+					2,
+					null,
+					4
+				][out.ctype] * out.depth;
+			};
+			UPNG.decode._filterZero = function(data, out, off, w, h) {
+				var bpp = UPNG.decode._getBPP(out), bpl = Math.ceil(w * bpp / 8), paeth = UPNG.decode._paeth;
+				bpp = Math.ceil(bpp / 8);
+				for (var y = 0; y < h; y++) {
+					var i = off + y * bpl, di = i + y + 1;
+					var type = data[di - 1];
+					if (type == 0) for (var x = 0; x < bpl; x++) data[i + x] = data[di + x];
+					else if (type == 1) {
+						for (var x = 0; x < bpp; x++) data[i + x] = data[di + x];
+						for (var x = bpp; x < bpl; x++) data[i + x] = data[di + x] + data[i + x - bpp] & 255;
+					} else if (y == 0) {
+						for (var x = 0; x < bpp; x++) data[i + x] = data[di + x];
+						if (type == 2) for (var x = bpp; x < bpl; x++) data[i + x] = data[di + x] & 255;
+						if (type == 3) for (var x = bpp; x < bpl; x++) data[i + x] = data[di + x] + (data[i + x - bpp] >> 1) & 255;
+						if (type == 4) for (var x = bpp; x < bpl; x++) data[i + x] = data[di + x] + paeth(data[i + x - bpp], 0, 0) & 255;
+					} else {
+						if (type == 2) for (var x = 0; x < bpl; x++) data[i + x] = data[di + x] + data[i + x - bpl] & 255;
+						if (type == 3) {
+							for (var x = 0; x < bpp; x++) data[i + x] = data[di + x] + (data[i + x - bpl] >> 1) & 255;
+							for (var x = bpp; x < bpl; x++) data[i + x] = data[di + x] + (data[i + x - bpl] + data[i + x - bpp] >> 1) & 255;
+						}
+						if (type == 4) {
+							for (var x = 0; x < bpp; x++) data[i + x] = data[di + x] + paeth(0, data[i + x - bpl], 0) & 255;
+							for (var x = bpp; x < bpl; x++) data[i + x] = data[di + x] + paeth(data[i + x - bpp], data[i + x - bpl], data[i + x - bpp - bpl]) & 255;
+						}
+					}
+				}
+				return data;
+			};
+			UPNG.decode._paeth = function(a, b, c) {
+				var p = a + b - c, pa = Math.abs(p - a), pb = Math.abs(p - b), pc = Math.abs(p - c);
+				if (pa <= pb && pa <= pc) return a;
+				else if (pb <= pc) return b;
+				return c;
+			};
+			UPNG.decode._IHDR = function(data, offset, out) {
+				var bin = UPNG._bin;
+				out.width = bin.readUint(data, offset);
+				offset += 4;
+				out.height = bin.readUint(data, offset);
+				offset += 4;
+				out.depth = data[offset];
+				offset++;
+				out.ctype = data[offset];
+				offset++;
+				out.compress = data[offset];
+				offset++;
+				out.filter = data[offset];
+				offset++;
+				out.interlace = data[offset];
+				offset++;
+			};
+			UPNG._bin = {
+				nextZero: function(data, p) {
+					while (data[p] != 0) p++;
+					return p;
+				},
+				readUshort: function(buff, p) {
+					return buff[p] << 8 | buff[p + 1];
+				},
+				writeUshort: function(buff, p, n) {
+					buff[p] = n >> 8 & 255;
+					buff[p + 1] = n & 255;
+				},
+				readUint: function(buff, p) {
+					return buff[p] * (256 * 256 * 256) + (buff[p + 1] << 16 | buff[p + 2] << 8 | buff[p + 3]);
+				},
+				writeUint: function(buff, p, n) {
+					buff[p] = n >> 24 & 255;
+					buff[p + 1] = n >> 16 & 255;
+					buff[p + 2] = n >> 8 & 255;
+					buff[p + 3] = n & 255;
+				},
+				readASCII: function(buff, p, l) {
+					var s = "";
+					for (var i = 0; i < l; i++) s += String.fromCharCode(buff[p + i]);
+					return s;
+				},
+				writeASCII: function(data, p, s) {
+					for (var i = 0; i < s.length; i++) data[p + i] = s.charCodeAt(i);
+				},
+				readBytes: function(buff, p, l) {
+					var arr = [];
+					for (var i = 0; i < l; i++) arr.push(buff[p + i]);
+					return arr;
+				},
+				pad: function(n) {
+					return n.length < 2 ? "0" + n : n;
+				},
+				readUTF8: function(buff, p, l) {
+					var s = "", ns;
+					for (var i = 0; i < l; i++) s += "%" + UPNG._bin.pad(buff[p + i].toString(16));
+					try {
+						ns = decodeURIComponent(s);
+					} catch (e) {
+						return UPNG._bin.readASCII(buff, p, l);
+					}
+					return ns;
+				}
+			};
+			UPNG._copyTile = function(sb, sw, sh, tb, tw, th, xoff, yoff, mode) {
+				var w = Math.min(sw, tw), h = Math.min(sh, th);
+				var si = 0, ti = 0;
+				for (var y = 0; y < h; y++) for (var x = 0; x < w; x++) {
+					if (xoff >= 0 && yoff >= 0) {
+						si = y * sw + x << 2;
+						ti = (yoff + y) * tw + xoff + x << 2;
+					} else {
+						si = (-yoff + y) * sw - xoff + x << 2;
+						ti = y * tw + x << 2;
+					}
+					if (mode == 0) {
+						tb[ti] = sb[si];
+						tb[ti + 1] = sb[si + 1];
+						tb[ti + 2] = sb[si + 2];
+						tb[ti + 3] = sb[si + 3];
+					} else if (mode == 1) {
+						var fa = sb[si + 3] * (1 / 255), fr = sb[si] * fa, fg = sb[si + 1] * fa, fb = sb[si + 2] * fa;
+						var ba = tb[ti + 3] * (1 / 255), br = tb[ti] * ba, bg = tb[ti + 1] * ba, bb = tb[ti + 2] * ba;
+						var ifa = 1 - fa, oa = fa + ba * ifa, ioa = oa == 0 ? 0 : 1 / oa;
+						tb[ti + 3] = 255 * oa;
+						tb[ti + 0] = (fr + br * ifa) * ioa;
+						tb[ti + 1] = (fg + bg * ifa) * ioa;
+						tb[ti + 2] = (fb + bb * ifa) * ioa;
+					} else if (mode == 2) {
+						var fa = sb[si + 3], fr = sb[si], fg = sb[si + 1], fb = sb[si + 2];
+						var ba = tb[ti + 3], br = tb[ti], bg = tb[ti + 1], bb = tb[ti + 2];
+						if (fa == ba && fr == br && fg == bg && fb == bb) {
+							tb[ti] = 0;
+							tb[ti + 1] = 0;
+							tb[ti + 2] = 0;
+							tb[ti + 3] = 0;
+						} else {
+							tb[ti] = fr;
+							tb[ti + 1] = fg;
+							tb[ti + 2] = fb;
+							tb[ti + 3] = fa;
+						}
+					} else if (mode == 3) {
+						var fa = sb[si + 3], fr = sb[si], fg = sb[si + 1], fb = sb[si + 2];
+						var ba = tb[ti + 3], br = tb[ti], bg = tb[ti + 1], bb = tb[ti + 2];
+						if (fa == ba && fr == br && fg == bg && fb == bb) continue;
+						if (fa < 220 && ba > 20) return false;
+					}
+				}
+				return true;
+			};
+			UPNG.encode = function(bufs, w, h, ps, dels, forbidPlte) {
+				if (ps == null) ps = 0;
+				if (forbidPlte == null) forbidPlte = false;
+				var data = new Uint8Array(bufs[0].byteLength * bufs.length + 100);
+				var wr = [
+					137,
+					80,
+					78,
+					71,
+					13,
+					10,
+					26,
+					10
+				];
+				for (var i = 0; i < 8; i++) data[i] = wr[i];
+				var offset = 8, bin = UPNG._bin, crc = UPNG.crc.crc, wUi = bin.writeUint, wUs = bin.writeUshort, wAs = bin.writeASCII;
+				var nimg = UPNG.encode.compressPNG(bufs, w, h, ps, forbidPlte);
+				wUi(data, offset, 13);
+				offset += 4;
+				wAs(data, offset, "IHDR");
+				offset += 4;
+				wUi(data, offset, w);
+				offset += 4;
+				wUi(data, offset, h);
+				offset += 4;
+				data[offset] = nimg.depth;
+				offset++;
+				data[offset] = nimg.ctype;
+				offset++;
+				data[offset] = 0;
+				offset++;
+				data[offset] = 0;
+				offset++;
+				data[offset] = 0;
+				offset++;
+				wUi(data, offset, crc(data, offset - 17, 17));
+				offset += 4;
+				wUi(data, offset, 1);
+				offset += 4;
+				wAs(data, offset, "sRGB");
+				offset += 4;
+				data[offset] = 1;
+				offset++;
+				wUi(data, offset, crc(data, offset - 5, 5));
+				offset += 4;
+				var anim = bufs.length > 1;
+				if (anim) {
+					wUi(data, offset, 8);
+					offset += 4;
+					wAs(data, offset, "acTL");
+					offset += 4;
+					wUi(data, offset, bufs.length);
+					offset += 4;
+					wUi(data, offset, 0);
+					offset += 4;
+					wUi(data, offset, crc(data, offset - 12, 12));
+					offset += 4;
+				}
+				if (nimg.ctype == 3) {
+					var dl = nimg.plte.length;
+					wUi(data, offset, dl * 3);
+					offset += 4;
+					wAs(data, offset, "PLTE");
+					offset += 4;
+					for (var i = 0; i < dl; i++) {
+						var ti = i * 3, c = nimg.plte[i], r = c & 255, g = c >> 8 & 255, b = c >> 16 & 255;
+						data[offset + ti + 0] = r;
+						data[offset + ti + 1] = g;
+						data[offset + ti + 2] = b;
+					}
+					offset += dl * 3;
+					wUi(data, offset, crc(data, offset - dl * 3 - 4, dl * 3 + 4));
+					offset += 4;
+					if (nimg.gotAlpha) {
+						wUi(data, offset, dl);
+						offset += 4;
+						wAs(data, offset, "tRNS");
+						offset += 4;
+						for (var i = 0; i < dl; i++) data[offset + i] = nimg.plte[i] >> 24 & 255;
+						offset += dl;
+						wUi(data, offset, crc(data, offset - dl - 4, dl + 4));
+						offset += 4;
+					}
+				}
+				var fi = 0;
+				for (var j = 0; j < nimg.frames.length; j++) {
+					var fr = nimg.frames[j];
+					if (anim) {
+						wUi(data, offset, 26);
+						offset += 4;
+						wAs(data, offset, "fcTL");
+						offset += 4;
+						wUi(data, offset, fi++);
+						offset += 4;
+						wUi(data, offset, fr.rect.width);
+						offset += 4;
+						wUi(data, offset, fr.rect.height);
+						offset += 4;
+						wUi(data, offset, fr.rect.x);
+						offset += 4;
+						wUi(data, offset, fr.rect.y);
+						offset += 4;
+						wUs(data, offset, dels[j]);
+						offset += 2;
+						wUs(data, offset, 1e3);
+						offset += 2;
+						data[offset] = fr.dispose;
+						offset++;
+						data[offset] = fr.blend;
+						offset++;
+						wUi(data, offset, crc(data, offset - 30, 30));
+						offset += 4;
+					}
+					var imgd = fr.cimg, dl = imgd.length;
+					wUi(data, offset, dl + (j == 0 ? 0 : 4));
+					offset += 4;
+					var ioff = offset;
+					wAs(data, offset, j == 0 ? "IDAT" : "fdAT");
+					offset += 4;
+					if (j != 0) {
+						wUi(data, offset, fi++);
+						offset += 4;
+					}
+					for (var i = 0; i < dl; i++) data[offset + i] = imgd[i];
+					offset += dl;
+					wUi(data, offset, crc(data, ioff, offset - ioff));
+					offset += 4;
+				}
+				wUi(data, offset, 0);
+				offset += 4;
+				wAs(data, offset, "IEND");
+				offset += 4;
+				wUi(data, offset, crc(data, offset - 4, 4));
+				offset += 4;
+				return data.buffer.slice(0, offset);
+			};
+			UPNG.encode.compressPNG = function(bufs, w, h, ps, forbidPlte) {
+				var out = UPNG.encode.compress(bufs, w, h, ps, false, forbidPlte);
+				for (var i = 0; i < bufs.length; i++) {
+					var frm = out.frames[i];
+					frm.rect.width;
+					var nh = frm.rect.height, bpl = frm.bpl, bpp = frm.bpp;
+					var fdata = new Uint8Array(nh * bpl + nh);
+					frm.cimg = UPNG.encode._filterZero(frm.img, nh, bpp, bpl, fdata);
+				}
+				return out;
+			};
+			UPNG.encode.compress = function(bufs, w, h, ps, forGIF, forbidPlte) {
+				if (forbidPlte == null) forbidPlte = false;
+				var ctype = 6, depth = 8, bpp = 4, alphaAnd = 255;
+				for (var j = 0; j < bufs.length; j++) {
+					var img = new Uint8Array(bufs[j]), ilen = img.length;
+					for (var i = 0; i < ilen; i += 4) alphaAnd &= img[i + 3];
+				}
+				var gotAlpha = alphaAnd != 255;
+				var cmap = {}, plte = [];
+				if (bufs.length != 0) {
+					cmap[0] = 0;
+					plte.push(0);
+					if (ps != 0) ps--;
+				}
+				if (ps != 0) {
+					var qres = UPNG.quantize(bufs, ps, forGIF);
+					bufs = qres.bufs;
+					for (var i = 0; i < qres.plte.length; i++) {
+						var c = qres.plte[i].est.rgba;
+						if (cmap[c] == null) {
+							cmap[c] = plte.length;
+							plte.push(c);
+						}
+					}
+				} else for (var j = 0; j < bufs.length; j++) {
+					var img32 = new Uint32Array(bufs[j]), ilen = img32.length;
+					for (var i = 0; i < ilen; i++) {
+						var c = img32[i];
+						if ((i < w || c != img32[i - 1] && c != img32[i - w]) && cmap[c] == null) {
+							cmap[c] = plte.length;
+							plte.push(c);
+							if (plte.length >= 300) break;
+						}
+					}
+				}
+				var brute = gotAlpha ? forGIF : false;
+				var cc = plte.length;
+				if (cc <= 256 && forbidPlte == false) {
+					if (cc <= 2) depth = 1;
+					else if (cc <= 4) depth = 2;
+					else if (cc <= 16) depth = 4;
+					else depth = 8;
+					if (forGIF) depth = 8;
+					gotAlpha = true;
+				}
+				var frms = [];
+				for (var j = 0; j < bufs.length; j++) {
+					var cimg = new Uint8Array(bufs[j]), cimg32 = new Uint32Array(cimg.buffer);
+					var nx = 0, ny = 0, nw = w, nh = h, blend = 0;
+					if (j != 0 && !brute) {
+						var tlim = forGIF || j == 1 || frms[frms.length - 2].dispose == 2 ? 1 : 2, tstp = 0, tarea = 1e9;
+						for (var it = 0; it < tlim; it++) {
+							var pimg = new Uint8Array(bufs[j - 1 - it]), p32 = new Uint32Array(bufs[j - 1 - it]);
+							var mix = w, miy = h, max = -1, may = -1;
+							for (var y = 0; y < h; y++) for (var x = 0; x < w; x++) {
+								var i = y * w + x;
+								if (cimg32[i] != p32[i]) {
+									if (x < mix) mix = x;
+									if (x > max) max = x;
+									if (y < miy) miy = y;
+									if (y > may) may = y;
+								}
+							}
+							var sarea = max == -1 ? 1 : (max - mix + 1) * (may - miy + 1);
+							if (sarea < tarea) {
+								tarea = sarea;
+								tstp = it;
+								if (max == -1) {
+									nx = ny = 0;
+									nw = nh = 1;
+								} else {
+									nx = mix;
+									ny = miy;
+									nw = max - mix + 1;
+									nh = may - miy + 1;
+								}
+							}
+						}
+						var pimg = new Uint8Array(bufs[j - 1 - tstp]);
+						if (tstp == 1) frms[frms.length - 1].dispose = 2;
+						var nimg = new Uint8Array(nw * nh * 4);
+						new Uint32Array(nimg.buffer);
+						UPNG._copyTile(pimg, w, h, nimg, nw, nh, -nx, -ny, 0);
+						if (UPNG._copyTile(cimg, w, h, nimg, nw, nh, -nx, -ny, 3)) {
+							UPNG._copyTile(cimg, w, h, nimg, nw, nh, -nx, -ny, 2);
+							blend = 1;
+						} else {
+							UPNG._copyTile(cimg, w, h, nimg, nw, nh, -nx, -ny, 0);
+							blend = 0;
+						}
+						cimg = nimg;
+						cimg32 = new Uint32Array(cimg.buffer);
+					}
+					var bpl = 4 * nw;
+					if (cc <= 256 && forbidPlte == false) {
+						bpl = Math.ceil(depth * nw / 8);
+						var nimg = new Uint8Array(bpl * nh);
+						for (var y = 0; y < nh; y++) {
+							var i = y * bpl, ii = y * nw;
+							if (depth == 8) for (var x = 0; x < nw; x++) nimg[i + x] = cmap[cimg32[ii + x]];
+							else if (depth == 4) for (var x = 0; x < nw; x++) nimg[i + (x >> 1)] |= cmap[cimg32[ii + x]] << 4 - (x & 1) * 4;
+							else if (depth == 2) for (var x = 0; x < nw; x++) nimg[i + (x >> 2)] |= cmap[cimg32[ii + x]] << 6 - (x & 3) * 2;
+							else if (depth == 1) for (var x = 0; x < nw; x++) nimg[i + (x >> 3)] |= cmap[cimg32[ii + x]] << 7 - (x & 7) * 1;
+						}
+						cimg = nimg;
+						ctype = 3;
+						bpp = 1;
+					} else if (gotAlpha == false && bufs.length == 1) {
+						var nimg = new Uint8Array(nw * nh * 3), area = nw * nh;
+						for (var i = 0; i < area; i++) {
+							var ti = i * 3, qi = i * 4;
+							nimg[ti] = cimg[qi];
+							nimg[ti + 1] = cimg[qi + 1];
+							nimg[ti + 2] = cimg[qi + 2];
+						}
+						cimg = nimg;
+						ctype = 2;
+						bpp = 3;
+						bpl = 3 * nw;
+					}
+					frms.push({
+						rect: {
+							x: nx,
+							y: ny,
+							width: nw,
+							height: nh
+						},
+						img: cimg,
+						bpl,
+						bpp,
+						blend,
+						dispose: brute ? 1 : 0
+					});
+				}
+				return {
+					ctype,
+					depth,
+					plte,
+					gotAlpha,
+					frames: frms
+				};
+			};
+			UPNG.encode._filterZero = function(img, h, bpp, bpl, data) {
+				var fls = [];
+				for (var t = 0; t < 5; t++) {
+					if (h * bpl > 5e5 && (t == 2 || t == 3 || t == 4)) continue;
+					for (var y = 0; y < h; y++) UPNG.encode._filterLine(data, img, y, bpl, bpp, t);
+					fls.push(pako["deflate"](data));
+					if (bpp == 1) break;
+				}
+				var ti, tsize = 1e9;
+				for (var i = 0; i < fls.length; i++) if (fls[i].length < tsize) {
+					ti = i;
+					tsize = fls[i].length;
+				}
+				return fls[ti];
+			};
+			UPNG.encode._filterLine = function(data, img, y, bpl, bpp, type) {
+				var i = y * bpl, di = i + y, paeth = UPNG.decode._paeth;
+				data[di] = type;
+				di++;
+				if (type == 0) for (var x = 0; x < bpl; x++) data[di + x] = img[i + x];
+				else if (type == 1) {
+					for (var x = 0; x < bpp; x++) data[di + x] = img[i + x];
+					for (var x = bpp; x < bpl; x++) data[di + x] = img[i + x] - img[i + x - bpp] + 256 & 255;
+				} else if (y == 0) {
+					for (var x = 0; x < bpp; x++) data[di + x] = img[i + x];
+					if (type == 2) for (var x = bpp; x < bpl; x++) data[di + x] = img[i + x];
+					if (type == 3) for (var x = bpp; x < bpl; x++) data[di + x] = img[i + x] - (img[i + x - bpp] >> 1) + 256 & 255;
+					if (type == 4) for (var x = bpp; x < bpl; x++) data[di + x] = img[i + x] - paeth(img[i + x - bpp], 0, 0) + 256 & 255;
+				} else {
+					if (type == 2) for (var x = 0; x < bpl; x++) data[di + x] = img[i + x] + 256 - img[i + x - bpl] & 255;
+					if (type == 3) {
+						for (var x = 0; x < bpp; x++) data[di + x] = img[i + x] + 256 - (img[i + x - bpl] >> 1) & 255;
+						for (var x = bpp; x < bpl; x++) data[di + x] = img[i + x] + 256 - (img[i + x - bpl] + img[i + x - bpp] >> 1) & 255;
+					}
+					if (type == 4) {
+						for (var x = 0; x < bpp; x++) data[di + x] = img[i + x] + 256 - paeth(0, img[i + x - bpl], 0) & 255;
+						for (var x = bpp; x < bpl; x++) data[di + x] = img[i + x] + 256 - paeth(img[i + x - bpp], img[i + x - bpl], img[i + x - bpp - bpl]) & 255;
+					}
+				}
+			};
+			UPNG.crc = {
+				table: (function() {
+					var tab = new Uint32Array(256);
+					for (var n = 0; n < 256; n++) {
+						var c = n;
+						for (var k = 0; k < 8; k++) if (c & 1) c = 3988292384 ^ c >>> 1;
+						else c = c >>> 1;
+						tab[n] = c;
+					}
+					return tab;
+				})(),
+				update: function(c, buf, off, len) {
+					for (var i = 0; i < len; i++) c = UPNG.crc.table[(c ^ buf[off + i]) & 255] ^ c >>> 8;
+					return c;
+				},
+				crc: function(b, o, l) {
+					return UPNG.crc.update(4294967295, b, o, l) ^ 4294967295;
+				}
+			};
+			UPNG.quantize = function(bufs, ps, roundAlpha) {
+				var imgs = [], totl = 0;
+				for (var i = 0; i < bufs.length; i++) {
+					imgs.push(UPNG.encode.alphaMul(new Uint8Array(bufs[i]), roundAlpha));
+					totl += bufs[i].byteLength;
+				}
+				var nimg = new Uint8Array(totl), nimg32 = new Uint32Array(nimg.buffer), noff = 0;
+				for (var i = 0; i < imgs.length; i++) {
+					var img = imgs[i], il = img.length;
+					for (var j = 0; j < il; j++) nimg[noff + j] = img[j];
+					noff += il;
+				}
+				var root = {
+					i0: 0,
+					i1: nimg.length,
+					bst: null,
+					est: null,
+					tdst: 0,
+					left: null,
+					right: null
+				};
+				root.bst = UPNG.quantize.stats(nimg, root.i0, root.i1);
+				root.est = UPNG.quantize.estats(root.bst);
+				var leafs = [root];
+				while (leafs.length < ps) {
+					var maxL = 0, mi = 0;
+					for (var i = 0; i < leafs.length; i++) if (leafs[i].est.L > maxL) {
+						maxL = leafs[i].est.L;
+						mi = i;
+					}
+					if (maxL < .001) break;
+					var node = leafs[mi];
+					var s0 = UPNG.quantize.splitPixels(nimg, nimg32, node.i0, node.i1, node.est.e, node.est.eMq255);
+					var ln = {
+						i0: node.i0,
+						i1: s0,
+						bst: null,
+						est: null,
+						tdst: 0,
+						left: null,
+						right: null
+					};
+					ln.bst = UPNG.quantize.stats(nimg, ln.i0, ln.i1);
+					ln.est = UPNG.quantize.estats(ln.bst);
+					var rn = {
+						i0: s0,
+						i1: node.i1,
+						bst: null,
+						est: null,
+						tdst: 0,
+						left: null,
+						right: null
+					};
+					rn.bst = {
+						R: [],
+						m: [],
+						N: node.bst.N - ln.bst.N
+					};
+					for (var i = 0; i < 16; i++) rn.bst.R[i] = node.bst.R[i] - ln.bst.R[i];
+					for (var i = 0; i < 4; i++) rn.bst.m[i] = node.bst.m[i] - ln.bst.m[i];
+					rn.est = UPNG.quantize.estats(rn.bst);
+					node.left = ln;
+					node.right = rn;
+					leafs[mi] = ln;
+					leafs.push(rn);
+				}
+				leafs.sort(function(a, b) {
+					return b.bst.N - a.bst.N;
+				});
+				for (var ii = 0; ii < imgs.length; ii++) {
+					var planeDst = UPNG.quantize.planeDst;
+					var sb = new Uint8Array(imgs[ii].buffer), tb = new Uint32Array(imgs[ii].buffer), len = sb.length;
+					for (var i = 0; i < len; i += 4) {
+						var r = sb[i] * (1 / 255), g = sb[i + 1] * (1 / 255), b = sb[i + 2] * (1 / 255), a = sb[i + 3] * (1 / 255);
+						var nd = root;
+						while (nd.left) nd = planeDst(nd.est, r, g, b, a) <= 0 ? nd.left : nd.right;
+						tb[i >> 2] = nd.est.rgba;
+					}
+					imgs[ii] = tb.buffer;
+				}
+				return {
+					bufs: imgs,
+					plte: leafs
+				};
+			};
+			UPNG.quantize.getNearest = function(nd, r, g, b, a) {
+				if (nd.left == null) {
+					nd.tdst = UPNG.quantize.dist(nd.est.q, r, g, b, a);
+					return nd;
+				}
+				var planeDst = UPNG.quantize.planeDst(nd.est, r, g, b, a);
+				var node0 = nd.left, node1 = nd.right;
+				if (planeDst > 0) {
+					node0 = nd.right;
+					node1 = nd.left;
+				}
+				var ln = UPNG.quantize.getNearest(node0, r, g, b, a);
+				if (ln.tdst <= planeDst * planeDst) return ln;
+				var rn = UPNG.quantize.getNearest(node1, r, g, b, a);
+				return rn.tdst < ln.tdst ? rn : ln;
+			};
+			UPNG.quantize.planeDst = function(est, r, g, b, a) {
+				var e = est.e;
+				return e[0] * r + e[1] * g + e[2] * b + e[3] * a - est.eMq;
+			};
+			UPNG.quantize.dist = function(q, r, g, b, a) {
+				var d0 = r - q[0], d1 = g - q[1], d2 = b - q[2], d3 = a - q[3];
+				return d0 * d0 + d1 * d1 + d2 * d2 + d3 * d3;
+			};
+			UPNG.quantize.splitPixels = function(nimg, nimg32, i0, i1, e, eMq) {
+				var vecDot = UPNG.quantize.vecDot;
+				i1 -= 4;
+				while (i0 < i1) {
+					while (vecDot(nimg, i0, e) <= eMq) i0 += 4;
+					while (vecDot(nimg, i1, e) > eMq) i1 -= 4;
+					if (i0 >= i1) break;
+					var t = nimg32[i0 >> 2];
+					nimg32[i0 >> 2] = nimg32[i1 >> 2];
+					nimg32[i1 >> 2] = t;
+					i0 += 4;
+					i1 -= 4;
+				}
+				while (vecDot(nimg, i0, e) > eMq) i0 -= 4;
+				return i0 + 4;
+			};
+			UPNG.quantize.vecDot = function(nimg, i, e) {
+				return nimg[i] * e[0] + nimg[i + 1] * e[1] + nimg[i + 2] * e[2] + nimg[i + 3] * e[3];
+			};
+			UPNG.quantize.stats = function(nimg, i0, i1) {
+				var R = [
+					0,
+					0,
+					0,
+					0,
+					0,
+					0,
+					0,
+					0,
+					0,
+					0,
+					0,
+					0,
+					0,
+					0,
+					0,
+					0
+				];
+				var m = [
+					0,
+					0,
+					0,
+					0
+				];
+				var N = i1 - i0 >> 2;
+				for (var i = i0; i < i1; i += 4) {
+					var r = nimg[i] * (1 / 255), g = nimg[i + 1] * (1 / 255), b = nimg[i + 2] * (1 / 255), a = nimg[i + 3] * (1 / 255);
+					m[0] += r;
+					m[1] += g;
+					m[2] += b;
+					m[3] += a;
+					R[0] += r * r;
+					R[1] += r * g;
+					R[2] += r * b;
+					R[3] += r * a;
+					R[5] += g * g;
+					R[6] += g * b;
+					R[7] += g * a;
+					R[10] += b * b;
+					R[11] += b * a;
+					R[15] += a * a;
+				}
+				R[4] = R[1];
+				R[8] = R[2];
+				R[12] = R[3];
+				R[9] = R[6];
+				R[13] = R[7];
+				R[14] = R[11];
+				return {
+					R,
+					m,
+					N
+				};
+			};
+			UPNG.quantize.estats = function(stats) {
+				var R = stats.R, m = stats.m, N = stats.N;
+				var m0 = m[0], m1 = m[1], m2 = m[2], m3 = m[3], iN = N == 0 ? 0 : 1 / N;
+				var Rj = [
+					R[0] - m0 * m0 * iN,
+					R[1] - m0 * m1 * iN,
+					R[2] - m0 * m2 * iN,
+					R[3] - m0 * m3 * iN,
+					R[4] - m1 * m0 * iN,
+					R[5] - m1 * m1 * iN,
+					R[6] - m1 * m2 * iN,
+					R[7] - m1 * m3 * iN,
+					R[8] - m2 * m0 * iN,
+					R[9] - m2 * m1 * iN,
+					R[10] - m2 * m2 * iN,
+					R[11] - m2 * m3 * iN,
+					R[12] - m3 * m0 * iN,
+					R[13] - m3 * m1 * iN,
+					R[14] - m3 * m2 * iN,
+					R[15] - m3 * m3 * iN
+				];
+				var A = Rj, M = UPNG.M4;
+				var b = [
+					.5,
+					.5,
+					.5,
+					.5
+				], mi = 0, tmi = 0;
+				if (N != 0) for (var i = 0; i < 10; i++) {
+					b = M.multVec(A, b);
+					tmi = Math.sqrt(M.dot(b, b));
+					b = M.sml(1 / tmi, b);
+					if (Math.abs(tmi - mi) < 1e-9) break;
+					mi = tmi;
+				}
+				var q = [
+					m0 * iN,
+					m1 * iN,
+					m2 * iN,
+					m3 * iN
+				];
+				var eMq255 = M.dot(M.sml(255, q), b);
+				var ia = q[3] < .001 ? 0 : 1 / q[3];
+				return {
+					Cov: Rj,
+					q,
+					e: b,
+					L: mi,
+					eMq255,
+					eMq: M.dot(b, q),
+					rgba: (Math.round(255 * q[3]) << 24 | Math.round(255 * q[2] * ia) << 16 | Math.round(255 * q[1] * ia) << 8 | Math.round(255 * q[0] * ia) << 0) >>> 0
+				};
+			};
+			UPNG.M4 = {
+				multVec: function(m, v) {
+					return [
+						m[0] * v[0] + m[1] * v[1] + m[2] * v[2] + m[3] * v[3],
+						m[4] * v[0] + m[5] * v[1] + m[6] * v[2] + m[7] * v[3],
+						m[8] * v[0] + m[9] * v[1] + m[10] * v[2] + m[11] * v[3],
+						m[12] * v[0] + m[13] * v[1] + m[14] * v[2] + m[15] * v[3]
+					];
+				},
+				dot: function(x, y) {
+					return x[0] * y[0] + x[1] * y[1] + x[2] * y[2] + x[3] * y[3];
+				},
+				sml: function(a, y) {
+					return [
+						a * y[0],
+						a * y[1],
+						a * y[2],
+						a * y[3]
+					];
+				}
+			};
+			UPNG.encode.alphaMul = function(img, roundA) {
+				var nimg = new Uint8Array(img.length), area = img.length >> 2;
+				for (var i = 0; i < area; i++) {
+					var qi = i << 2, ia = img[qi + 3];
+					if (roundA) ia = ia < 128 ? 0 : 255;
+					var a = ia * (1 / 255);
+					nimg[qi + 0] = img[qi + 0] * a;
+					nimg[qi + 1] = img[qi + 1] * a;
+					nimg[qi + 2] = img[qi + 2] * a;
+					nimg[qi + 3] = ia;
+				}
+				return nimg;
+			};
+		})(UPNG, pako);
+	})();
+}));
+//#endregion
+export default require_UPNG();
+export {};