brs-js 3.2.4 → 3.3.0

package/dist/dist.mjs

@@ -162,41 +162,41 @@ var h = 0, g = 1, _ = 2, v = 29, y = 256, b = 286, x = 30, S = 19, C = 573, w =
 	14,
 	1,
 	15
-]), ne = 512, re = Array(288 * 2);
+]), ne = 512, N = Array(288 * 2);
+m(N);
+var re = Array(x * 2);
 m(re);
-var ie = Array(x * 2);
+var ie = Array(ne);
 m(ie);
-var ae = Array(ne);
+var ae = Array(256);
 m(ae);
-var oe = Array(256);
+var oe = Array(v);
 m(oe);
-var se = Array(v);
+var se = Array(x);
 m(se);
-var ce = Array(x);
-m(ce);
-var le = class {
+var ce = class {
 	constructor(e, t, n, r, i) {
 		this.static_tree = e, this.extra_bits = t, this.extra_base = n, this.elems = r, this.max_length = i, this.has_stree = e && e.length;
 	}
-}, ue, de, fe, pe = class {
+}, le, ue, de, fe = class {
 	constructor(e, t) {
 		this.dyn_tree = e, this.max_code = 0, this.stat_desc = t;
 	}
-}, me = (e) => e < 256 ? ae[e] : ae[256 + (e >>> 7)], he = (e, t) => {
+}, pe = (e) => e < 256 ? ie[e] : ie[256 + (e >>> 7)], me = (e, t) => {
 	e.pending_buf[e.pending++] = t & 255, e.pending_buf[e.pending++] = t >>> 8 & 255;
-}, N = (e, t, n) => {
-	e.bi_valid > T - n ? (e.bi_buf |= t << e.bi_valid & 65535, he(e, e.bi_buf), e.bi_buf = t >> T - e.bi_valid, e.bi_valid += n - T) : (e.bi_buf |= t << e.bi_valid & 65535, e.bi_valid += n);
-}, ge = (e, t, n) => {
-	N(e, n[t * 2], n[t * 2 + 1]);
-}, _e = (e, t) => {
+}, P = (e, t, n) => {
+	e.bi_valid > T - n ? (e.bi_buf |= t << e.bi_valid & 65535, me(e, e.bi_buf), e.bi_buf = t >> T - e.bi_valid, e.bi_valid += n - T) : (e.bi_buf |= t << e.bi_valid & 65535, e.bi_valid += n);
+}, he = (e, t, n) => {
+	P(e, n[t * 2], n[t * 2 + 1]);
+}, ge = (e, t) => {
 	let n = 0;
 	do
 		n |= e & 1, e >>>= 1, n <<= 1;
 	while (--t > 0);
 	return n >>> 1;
-}, ve = (e) => {
-	e.bi_valid === 16 ? (he(e, e.bi_buf), e.bi_buf = 0, e.bi_valid = 0) : e.bi_valid >= 8 && (e.pending_buf[e.pending++] = e.bi_buf & 255, e.bi_buf >>= 8, e.bi_valid -= 8);
-}, ye = (e, t) => {
+}, _e = (e) => {
+	e.bi_valid === 16 ? (me(e, e.bi_buf), e.bi_buf = 0, e.bi_valid = 0) : e.bi_valid >= 8 && (e.pending_buf[e.pending++] = e.bi_buf & 255, e.bi_buf >>= 8, e.bi_valid -= 8);
+}, ve = (e, t) => {
 	let n = t.dyn_tree, r = t.max_code, i = t.stat_desc.static_tree, a = t.stat_desc.has_stree, o = t.stat_desc.extra_bits, s = t.stat_desc.extra_base, c = t.stat_desc.max_length, l, u, d, f, p, m, h = 0;
 	for (f = 0; f <= w; f++) e.bl_count[f] = 0;
 	for (n[e.heap[e.heap_max] * 2 + 1] = 0, l = e.heap_max + 1; l < C; l++) u = e.heap[l], f = n[n[u * 2 + 1] * 2 + 1] + 1, f > c && (f = c, h++), n[u * 2 + 1] = f, !(u > r) && (e.bl_count[f]++, p = 0, u >= s && (p = o[u - s]), m = n[u * 2], e.opt_len += m * (f + p), a && (e.static_len += m * (i[u * 2 + 1] + p)));
@@ -207,92 +207,92 @@ var le = class {
 		} while (h > 0);
 		for (f = c; f !== 0; f--) for (u = e.bl_count[f]; u !== 0;) d = e.heap[--l], !(d > r) && (n[d * 2 + 1] !== f && (e.opt_len += (f - n[d * 2 + 1]) * n[d * 2], n[d * 2 + 1] = f), u--);
 	}
-}, be = (e, t, n) => {
+}, ye = (e, t, n) => {
 	let r = Array(16), i = 0, a, o;
 	for (a = 1; a <= w; a++) i = i + n[a - 1] << 1, r[a] = i;
 	for (o = 0; o <= t; o++) {
 		let t = e[o * 2 + 1];
-		t !== 0 && (e[o * 2] = _e(r[t]++, t));
+		t !== 0 && (e[o * 2] = ge(r[t]++, t));
 	}
-}, xe = () => {
+}, be = () => {
 	let e, t, n, r, i, a = Array(16);
-	for (n = 0, r = 0; r < v - 1; r++) for (se[r] = n, e = 0; e < 1 << j[r]; e++) oe[n++] = r;
-	for (oe[n - 1] = r, i = 0, r = 0; r < 16; r++) for (ce[r] = i, e = 0; e < 1 << M[r]; e++) ae[i++] = r;
-	for (i >>= 7; r < x; r++) for (ce[r] = i << 7, e = 0; e < 1 << M[r] - 7; e++) ae[256 + i++] = r;
+	for (n = 0, r = 0; r < v - 1; r++) for (oe[r] = n, e = 0; e < 1 << j[r]; e++) ae[n++] = r;
+	for (ae[n - 1] = r, i = 0, r = 0; r < 16; r++) for (se[r] = i, e = 0; e < 1 << M[r]; e++) ie[i++] = r;
+	for (i >>= 7; r < x; r++) for (se[r] = i << 7, e = 0; e < 1 << M[r] - 7; e++) ie[256 + i++] = r;
 	for (t = 0; t <= w; t++) a[t] = 0;
-	for (e = 0; e <= 143;) re[e * 2 + 1] = 8, e++, a[8]++;
-	for (; e <= 255;) re[e * 2 + 1] = 9, e++, a[9]++;
-	for (; e <= 279;) re[e * 2 + 1] = 7, e++, a[7]++;
-	for (; e <= 287;) re[e * 2 + 1] = 8, e++, a[8]++;
-	for (be(re, 287, a), e = 0; e < x; e++) ie[e * 2 + 1] = 5, ie[e * 2] = _e(e, 5);
-	ue = new le(re, j, 257, b, w), de = new le(ie, M, 0, x, w), fe = new le([], ee, 0, S, E);
-}, Se = (e) => {
+	for (e = 0; e <= 143;) N[e * 2 + 1] = 8, e++, a[8]++;
+	for (; e <= 255;) N[e * 2 + 1] = 9, e++, a[9]++;
+	for (; e <= 279;) N[e * 2 + 1] = 7, e++, a[7]++;
+	for (; e <= 287;) N[e * 2 + 1] = 8, e++, a[8]++;
+	for (ye(N, 287, a), e = 0; e < x; e++) re[e * 2 + 1] = 5, re[e * 2] = ge(e, 5);
+	le = new ce(N, j, 257, b, w), ue = new ce(re, M, 0, x, w), de = new ce([], ee, 0, S, E);
+}, xe = (e) => {
 	let t;
 	for (t = 0; t < b; t++) e.dyn_ltree[t * 2] = 0;
 	for (t = 0; t < x; t++) e.dyn_dtree[t * 2] = 0;
 	for (t = 0; t < S; t++) e.bl_tree[t * 2] = 0;
 	e.dyn_ltree[D * 2] = 1, e.opt_len = e.static_len = 0, e.sym_next = e.matches = 0;
-}, Ce = (e) => {
-	e.bi_valid > 8 ? he(e, e.bi_buf) : e.bi_valid > 0 && (e.pending_buf[e.pending++] = e.bi_buf), e.bi_buf = 0, e.bi_valid = 0;
-}, we = (e, t, n, r) => {
+}, Se = (e) => {
+	e.bi_valid > 8 ? me(e, e.bi_buf) : e.bi_valid > 0 && (e.pending_buf[e.pending++] = e.bi_buf), e.bi_buf = 0, e.bi_valid = 0;
+}, Ce = (e, t, n, r) => {
 	let i = t * 2, a = n * 2;
 	return e[i] < e[a] || e[i] === e[a] && r[t] <= r[n];
-}, Te = (e, t, n) => {
+}, we = (e, t, n) => {
 	let r = e.heap[n], i = n << 1;
-	for (; i <= e.heap_len && (i < e.heap_len && we(t, e.heap[i + 1], e.heap[i], e.depth) && i++, !we(t, r, e.heap[i], e.depth));) e.heap[n] = e.heap[i], n = i, i <<= 1;
+	for (; i <= e.heap_len && (i < e.heap_len && Ce(t, e.heap[i + 1], e.heap[i], e.depth) && i++, !Ce(t, r, e.heap[i], e.depth));) e.heap[n] = e.heap[i], n = i, i <<= 1;
 	e.heap[n] = r;
-}, Ee = (e, t, n) => {
+}, Te = (e, t, n) => {
 	let r, i, a = 0, o, s;
 	if (e.sym_next !== 0) do
-		r = e.pending_buf[e.sym_buf + a++] & 255, r += (e.pending_buf[e.sym_buf + a++] & 255) << 8, i = e.pending_buf[e.sym_buf + a++], r === 0 ? ge(e, i, t) : (o = oe[i], ge(e, o + y + 1, t), s = j[o], s !== 0 && (i -= se[o], N(e, i, s)), r--, o = me(r), ge(e, o, n), s = M[o], s !== 0 && (r -= ce[o], N(e, r, s)));
+		r = e.pending_buf[e.sym_buf + a++] & 255, r += (e.pending_buf[e.sym_buf + a++] & 255) << 8, i = e.pending_buf[e.sym_buf + a++], r === 0 ? he(e, i, t) : (o = ae[i], he(e, o + y + 1, t), s = j[o], s !== 0 && (i -= oe[o], P(e, i, s)), r--, o = pe(r), he(e, o, n), s = M[o], s !== 0 && (r -= se[o], P(e, r, s)));
 	while (a < e.sym_next);
-	ge(e, D, t);
-}, De = (e, t) => {
+	he(e, D, t);
+}, Ee = (e, t) => {
 	let n = t.dyn_tree, r = t.stat_desc.static_tree, i = t.stat_desc.has_stree, a = t.stat_desc.elems, o, s, c = -1, l;
 	for (e.heap_len = 0, e.heap_max = C, o = 0; o < a; o++) n[o * 2] === 0 ? n[o * 2 + 1] = 0 : (e.heap[++e.heap_len] = c = o, e.depth[o] = 0);
 	for (; e.heap_len < 2;) l = e.heap[++e.heap_len] = c < 2 ? ++c : 0, n[l * 2] = 1, e.depth[l] = 0, e.opt_len--, i && (e.static_len -= r[l * 2 + 1]);
-	for (t.max_code = c, o = e.heap_len >> 1; o >= 1; o--) Te(e, n, o);
+	for (t.max_code = c, o = e.heap_len >> 1; o >= 1; o--) we(e, n, o);
 	l = a;
 	do
-		o = e.heap[1], e.heap[1] = e.heap[e.heap_len--], Te(e, n, 1), s = e.heap[1], e.heap[--e.heap_max] = o, e.heap[--e.heap_max] = s, n[l * 2] = n[o * 2] + n[s * 2], e.depth[l] = (e.depth[o] >= e.depth[s] ? e.depth[o] : e.depth[s]) + 1, n[o * 2 + 1] = n[s * 2 + 1] = l, e.heap[1] = l++, Te(e, n, 1);
+		o = e.heap[1], e.heap[1] = e.heap[e.heap_len--], we(e, n, 1), s = e.heap[1], e.heap[--e.heap_max] = o, e.heap[--e.heap_max] = s, n[l * 2] = n[o * 2] + n[s * 2], e.depth[l] = (e.depth[o] >= e.depth[s] ? e.depth[o] : e.depth[s]) + 1, n[o * 2 + 1] = n[s * 2 + 1] = l, e.heap[1] = l++, we(e, n, 1);
 	while (e.heap_len >= 2);
-	e.heap[--e.heap_max] = e.heap[1], ye(e, t), be(n, c, e.bl_count);
-}, Oe = (e, t, n) => {
+	e.heap[--e.heap_max] = e.heap[1], ve(e, t), ye(n, c, e.bl_count);
+}, De = (e, t, n) => {
 	let r, i = -1, a, o = t[1], s = 0, c = 7, l = 4;
 	for (o === 0 && (c = 138, l = 3), t[(n + 1) * 2 + 1] = 65535, r = 0; r <= n; r++) a = o, o = t[(r + 1) * 2 + 1], !(++s < c && a === o) && (s < l ? e.bl_tree[a * 2] += s : a === 0 ? s <= 10 ? e.bl_tree[k * 2]++ : e.bl_tree[A * 2]++ : (a !== i && e.bl_tree[a * 2]++, e.bl_tree[O * 2]++), s = 0, i = a, o === 0 ? (c = 138, l = 3) : a === o ? (c = 6, l = 3) : (c = 7, l = 4));
-}, ke = (e, t, n) => {
+}, Oe = (e, t, n) => {
 	let r, i = -1, a, o = t[1], s = 0, c = 7, l = 4;
 	for (o === 0 && (c = 138, l = 3), r = 0; r <= n; r++) if (a = o, o = t[(r + 1) * 2 + 1], !(++s < c && a === o)) {
 		if (s < l) do
-			ge(e, a, e.bl_tree);
+			he(e, a, e.bl_tree);
 		while (--s !== 0);
-		else a === 0 ? s <= 10 ? (ge(e, k, e.bl_tree), N(e, s - 3, 3)) : (ge(e, A, e.bl_tree), N(e, s - 11, 7)) : (a !== i && (ge(e, a, e.bl_tree), s--), ge(e, O, e.bl_tree), N(e, s - 3, 2));
+		else a === 0 ? s <= 10 ? (he(e, k, e.bl_tree), P(e, s - 3, 3)) : (he(e, A, e.bl_tree), P(e, s - 11, 7)) : (a !== i && (he(e, a, e.bl_tree), s--), he(e, O, e.bl_tree), P(e, s - 3, 2));
 		s = 0, i = a, o === 0 ? (c = 138, l = 3) : a === o ? (c = 6, l = 3) : (c = 7, l = 4);
 	}
-}, Ae = (e) => {
+}, ke = (e) => {
 	let t;
-	for (Oe(e, e.dyn_ltree, e.l_desc.max_code), Oe(e, e.dyn_dtree, e.d_desc.max_code), De(e, e.bl_desc), t = S - 1; t >= 3 && e.bl_tree[te[t] * 2 + 1] === 0; t--);
+	for (De(e, e.dyn_ltree, e.l_desc.max_code), De(e, e.dyn_dtree, e.d_desc.max_code), Ee(e, e.bl_desc), t = S - 1; t >= 3 && e.bl_tree[te[t] * 2 + 1] === 0; t--);
 	return e.opt_len += 3 * (t + 1) + 5 + 5 + 4, t;
-}, je = (e, t, n, r) => {
+}, Ae = (e, t, n, r) => {
 	let i;
-	for (N(e, t - 257, 5), N(e, n - 1, 5), N(e, r - 4, 4), i = 0; i < r; i++) N(e, e.bl_tree[te[i] * 2 + 1], 3);
-	ke(e, e.dyn_ltree, t - 1), ke(e, e.dyn_dtree, n - 1);
-}, Me = (e) => {
+	for (P(e, t - 257, 5), P(e, n - 1, 5), P(e, r - 4, 4), i = 0; i < r; i++) P(e, e.bl_tree[te[i] * 2 + 1], 3);
+	Oe(e, e.dyn_ltree, t - 1), Oe(e, e.dyn_dtree, n - 1);
+}, je = (e) => {
 	let t = 4093624447, n;
 	for (n = 0; n <= 31; n++, t >>>= 1) if (t & 1 && e.dyn_ltree[n * 2] !== 0) return d;
 	if (e.dyn_ltree[18] !== 0 || e.dyn_ltree[20] !== 0 || e.dyn_ltree[26] !== 0) return f;
 	for (n = 32; n < y; n++) if (e.dyn_ltree[n * 2] !== 0) return f;
 	return d;
-}, Ne = !1, Pe = (e) => {
-	Ne || (xe(), Ne = !0), e.l_desc = new pe(e.dyn_ltree, ue), e.d_desc = new pe(e.dyn_dtree, de), e.bl_desc = new pe(e.bl_tree, fe), e.bi_buf = 0, e.bi_valid = 0, Se(e);
-}, Fe = (e, t, n, r) => {
-	N(e, (h << 1) + +!!r, 3), Ce(e), he(e, n), he(e, ~n), n && e.pending_buf.set(e.window.subarray(t, t + n), e.pending), e.pending += n;
-}, Ie = (e) => {
-	N(e, g << 1, 3), ge(e, D, re), ve(e);
-}, Le = (e, t, n, r) => {
+}, Me = !1, Ne = (e) => {
+	Me || (be(), Me = !0), e.l_desc = new fe(e.dyn_ltree, le), e.d_desc = new fe(e.dyn_dtree, ue), e.bl_desc = new fe(e.bl_tree, de), e.bi_buf = 0, e.bi_valid = 0, xe(e);
+}, Pe = (e, t, n, r) => {
+	P(e, (h << 1) + +!!r, 3), Se(e), me(e, n), me(e, ~n), n && e.pending_buf.set(e.window.subarray(t, t + n), e.pending), e.pending += n;
+}, Fe = (e) => {
+	P(e, g << 1, 3), he(e, D, N), _e(e);
+}, Ie = (e, t, n, r) => {
 	let i, a, o = 0;
-	e.level > 0 ? (e.strm.data_type === p && (e.strm.data_type = Me(e)), De(e, e.l_desc), De(e, e.d_desc), o = Ae(e), i = e.opt_len + 3 + 7 >>> 3, a = e.static_len + 3 + 7 >>> 3, a <= i && (i = a)) : i = a = n + 5, n + 4 <= i && t !== -1 ? Fe(e, t, n, r) : e.strategy === u || a === i ? (N(e, (g << 1) + +!!r, 3), Ee(e, re, ie)) : (N(e, (_ << 1) + +!!r, 3), je(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, o + 1), Ee(e, e.dyn_ltree, e.dyn_dtree)), Se(e), r && Ce(e);
-}, Re = (e, t, n) => (e.pending_buf[e.sym_buf + e.sym_next++] = t, e.pending_buf[e.sym_buf + e.sym_next++] = t >> 8, e.pending_buf[e.sym_buf + e.sym_next++] = n, t === 0 ? e.dyn_ltree[n * 2]++ : (e.matches++, t--, e.dyn_ltree[(oe[n] + y + 1) * 2]++, e.dyn_dtree[me(t) * 2]++), e.sym_next === e.sym_end), ze = (e, t, n, r) => {
+	e.level > 0 ? (e.strm.data_type === p && (e.strm.data_type = je(e)), Ee(e, e.l_desc), Ee(e, e.d_desc), o = ke(e), i = e.opt_len + 3 + 7 >>> 3, a = e.static_len + 3 + 7 >>> 3, a <= i && (i = a)) : i = a = n + 5, n + 4 <= i && t !== -1 ? Pe(e, t, n, r) : e.strategy === u || a === i ? (P(e, (g << 1) + +!!r, 3), Te(e, N, re)) : (P(e, (_ << 1) + +!!r, 3), Ae(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, o + 1), Te(e, e.dyn_ltree, e.dyn_dtree)), xe(e), r && Se(e);
+}, Le = (e, t, n) => (e.pending_buf[e.sym_buf + e.sym_next++] = t, e.pending_buf[e.sym_buf + e.sym_next++] = t >> 8, e.pending_buf[e.sym_buf + e.sym_next++] = n, t === 0 ? e.dyn_ltree[n * 2]++ : (e.matches++, t--, e.dyn_ltree[(ae[n] + y + 1) * 2]++, e.dyn_dtree[pe(t) * 2]++), e.sym_next === e.sym_end), Re = (e, t, n, r) => {
 	let i = e & 65535 | 0, a = e >>> 16 & 65535 | 0, o = 0;
 	for (; n !== 0;) {
 		o = n > 2e3 ? 2e3 : n, n -= o;
@@ -302,7 +302,7 @@ var le = class {
 		i %= 65521, a %= 65521;
 	}
 	return i | a << 16 | 0;
-}, Be = new Uint32Array((() => {
+}, ze = new Uint32Array((() => {
 	let e, t = [];
 	for (var n = 0; n < 256; n++) {
 		e = n;
@@ -310,12 +310,12 @@ var le = class {
 		t[n] = e;
 	}
 	return t;
-})()), P = (e, t, n, r) => {
-	let i = Be, a = r + n;
+})()), F = (e, t, n, r) => {
+	let i = ze, a = r + n;
 	e ^= -1;
 	for (let n = r; n < a; n++) e = e >>> 8 ^ i[(e ^ t[n]) & 255];
 	return e ^ -1;
-}, Ve = {
+}, Be = {
 	2: "need dictionary",
 	1: "stream end",
 	0: "",
@@ -325,10 +325,10 @@ var le = class {
 	"-4": "insufficient memory",
 	"-5": "buffer error",
 	"-6": "incompatible version"
-}, He = 9, Ue = 573, F = 3, We = 258, Ge = 262, Ke = 32, qe = 42, Je = 57, Ye = 69, Xe = 73, Ze = 91, Qe = 103, $e = 113, et = 666, I = 1, tt = 2, nt = 3, rt = 4, it = 3, at = (e, t) => (e.msg = Ve[t], t), ot = (e) => e * 2 - (e > 4 ? 9 : 0), st = (e) => {
+}, Ve = 9, He = 573, I = 3, Ue = 258, We = 262, Ge = 32, Ke = 42, qe = 57, Je = 69, Ye = 73, Xe = 91, Ze = 103, Qe = 113, $e = 666, L = 1, et = 2, tt = 3, nt = 4, rt = 3, it = (e, t) => (e.msg = Be[t], t), at = (e) => e * 2 - (e > 4 ? 9 : 0), ot = (e) => {
 	let t = e.length;
 	for (; --t >= 0;) e[t] = 0;
-}, ct = (e) => {
+}, st = (e) => {
 	let t, n, r, i = e.w_size;
 	t = e.hash_size, r = t;
 	do
@@ -338,254 +338,254 @@ var le = class {
 	do
 		n = e.prev[--r], e.prev[r] = n >= i ? n - i : 0;
 	while (--t);
-}, lt = (e, t, n) => (t << e.hash_shift ^ n) & e.hash_mask, ut = (e, t) => {
+}, ct = (e, t, n) => (t << e.hash_shift ^ n) & e.hash_mask, lt = (e, t) => {
 	let n;
-	if (e.legacy_hash) n = e.ins_h = lt(e, e.ins_h, e.window[t + F - 1]);
+	if (e.legacy_hash) n = e.ins_h = ct(e, e.ins_h, e.window[t + I - 1]);
 	else {
 		let r = e.window, i = r[t] | r[t + 1] << 8 | r[t + 2] << 16 | r[t + 3] << 24;
 		n = e.ins_h = Math.imul(i, 66521) + 66521 >>> 16 & e.hash_mask;
 	}
 	let r = e.prev[t & e.w_mask] = e.head[n];
 	return e.head[n] = t, r;
-}, L = (e) => {
+}, R = (e) => {
 	let t = e.state, n = t.pending;
 	n > e.avail_out && (n = e.avail_out), n !== 0 && (e.output.set(t.pending_buf.subarray(t.pending_out, t.pending_out + n), e.next_out), e.next_out += n, t.pending_out += n, e.total_out += n, e.avail_out -= n, t.pending -= n, t.pending === 0 && (t.pending_out = 0));
-}, R = (e, t) => {
-	Le(e, e.block_start >= 0 ? e.block_start : -1, e.strstart - e.block_start, t), e.block_start = e.strstart, L(e.strm);
 }, z = (e, t) => {
+	Ie(e, e.block_start >= 0 ? e.block_start : -1, e.strstart - e.block_start, t), e.block_start = e.strstart, R(e.strm);
+}, B = (e, t) => {
 	e.pending_buf[e.pending++] = t;
-}, dt = (e, t) => {
+}, ut = (e, t) => {
 	e.pending_buf[e.pending++] = t >>> 8 & 255, e.pending_buf[e.pending++] = t & 255;
-}, ft = (e, t, n, r) => {
+}, dt = (e, t, n, r) => {
 	let i = e.avail_in;
-	return i > r && (i = r), i === 0 ? 0 : (e.avail_in -= i, t.set(e.input.subarray(e.next_in, e.next_in + i), n), e.state.wrap === 1 ? e.adler = ze(e.adler, t, i, n) : e.state.wrap === 2 && (e.adler = P(e.adler, t, i, n)), e.next_in += i, e.total_in += i, i);
-}, pt = (e, t) => {
-	let n = e.max_chain_length, r = e.strstart, i, a, o = e.prev_length, s = e.nice_match, c = e.strstart > e.w_size - Ge ? e.strstart - (e.w_size - Ge) : 0, l = e.window, u = e.w_mask, d = e.prev, f = e.strstart + We, p = l[r + o - 1], m = l[r + o];
+	return i > r && (i = r), i === 0 ? 0 : (e.avail_in -= i, t.set(e.input.subarray(e.next_in, e.next_in + i), n), e.state.wrap === 1 ? e.adler = Re(e.adler, t, i, n) : e.state.wrap === 2 && (e.adler = F(e.adler, t, i, n)), e.next_in += i, e.total_in += i, i);
+}, ft = (e, t) => {
+	let n = e.max_chain_length, r = e.strstart, i, a, o = e.prev_length, s = e.nice_match, c = e.strstart > e.w_size - We ? e.strstart - (e.w_size - We) : 0, l = e.window, u = e.w_mask, d = e.prev, f = e.strstart + Ue, p = l[r + o - 1], m = l[r + o];
 	e.prev_length >= e.good_match && (n >>= 2), s > e.lookahead && (s = e.lookahead);
 	do {
 		if (i = t, l[i + o] !== m || l[i + o - 1] !== p || l[i] !== l[r] || l[++i] !== l[r + 1]) continue;
 		r += 2, i++;
 		do		;
 while (l[++r] === l[++i] && l[++r] === l[++i] && l[++r] === l[++i] && l[++r] === l[++i] && l[++r] === l[++i] && l[++r] === l[++i] && l[++r] === l[++i] && l[++r] === l[++i] && r < f);
-		if (a = We - (f - r), r = f - We, a > o) {
+		if (a = Ue - (f - r), r = f - Ue, a > o) {
 			if (e.match_start = t, o = a, a >= s) break;
 			p = l[r + o - 1], m = l[r + o];
 		}
 	} while ((t = d[t & u]) > c && --n !== 0);
 	return o <= e.lookahead ? o : e.lookahead;
-}, mt = (e) => {
+}, pt = (e) => {
 	let t = e.w_size, n, r, i;
 	do {
-		if (r = e.window_size - e.lookahead - e.strstart, e.strstart >= t + (t - Ge) && (e.window.set(e.window.subarray(t, t + t - r), 0), e.match_start -= t, e.strstart -= t, e.block_start -= t, e.insert > e.strstart && (e.insert = e.strstart), ct(e), r += t), e.strm.avail_in === 0) break;
-		if (n = ft(e.strm, e.window, e.strstart + e.lookahead, r), e.lookahead += n, !e.legacy_hash) {
-			if (e.lookahead + e.insert > F) for (i = e.strstart - e.insert; e.insert && (ut(e, i), i++, e.insert--, !(e.lookahead + e.insert <= F)););
-		} else if (e.lookahead + e.insert >= F) for (i = e.strstart - e.insert, e.ins_h = e.window[i], e.ins_h = lt(e, e.ins_h, e.window[i + 1]); e.insert && (ut(e, i), i++, e.insert--, !(e.lookahead + e.insert < F)););
-	} while (e.lookahead < Ge && e.strm.avail_in !== 0);
-}, ht = (e, t) => {
+		if (r = e.window_size - e.lookahead - e.strstart, e.strstart >= t + (t - We) && (e.window.set(e.window.subarray(t, t + t - r), 0), e.match_start -= t, e.strstart -= t, e.block_start -= t, e.insert > e.strstart && (e.insert = e.strstart), st(e), r += t), e.strm.avail_in === 0) break;
+		if (n = dt(e.strm, e.window, e.strstart + e.lookahead, r), e.lookahead += n, !e.legacy_hash) {
+			if (e.lookahead + e.insert > I) for (i = e.strstart - e.insert; e.insert && (lt(e, i), i++, e.insert--, !(e.lookahead + e.insert <= I)););
+		} else if (e.lookahead + e.insert >= I) for (i = e.strstart - e.insert, e.ins_h = e.window[i], e.ins_h = ct(e, e.ins_h, e.window[i + 1]); e.insert && (lt(e, i), i++, e.insert--, !(e.lookahead + e.insert < I)););
+	} while (e.lookahead < We && e.strm.avail_in !== 0);
+}, mt = (e, t) => {
 	let n = e.pending_buf_size - 5 > e.w_size ? e.w_size : e.pending_buf_size - 5, r, i, a, o = 0, s = e.strm.avail_in;
 	do {
 		if (r = 65535, a = e.bi_valid + 42 >> 3, e.strm.avail_out < a || (a = e.strm.avail_out - a, i = e.strstart - e.block_start, r > i + e.strm.avail_in && (r = i + e.strm.avail_in), r > a && (r = a), r < n && (r === 0 && t !== 4 || t === 0 || r !== i + e.strm.avail_in))) break;
-		o = +(t === 4 && r === i + e.strm.avail_in), Fe(e, 0, 0, o), e.pending_buf[e.pending - 4] = r, e.pending_buf[e.pending - 3] = r >> 8, e.pending_buf[e.pending - 2] = ~r, e.pending_buf[e.pending - 1] = ~r >> 8, L(e.strm), i && (i > r && (i = r), e.strm.output.set(e.window.subarray(e.block_start, e.block_start + i), e.strm.next_out), e.strm.next_out += i, e.strm.avail_out -= i, e.strm.total_out += i, e.block_start += i, r -= i), r && (ft(e.strm, e.strm.output, e.strm.next_out, r), e.strm.next_out += r, e.strm.avail_out -= r, e.strm.total_out += r);
+		o = +(t === 4 && r === i + e.strm.avail_in), Pe(e, 0, 0, o), e.pending_buf[e.pending - 4] = r, e.pending_buf[e.pending - 3] = r >> 8, e.pending_buf[e.pending - 2] = ~r, e.pending_buf[e.pending - 1] = ~r >> 8, R(e.strm), i && (i > r && (i = r), e.strm.output.set(e.window.subarray(e.block_start, e.block_start + i), e.strm.next_out), e.strm.next_out += i, e.strm.avail_out -= i, e.strm.total_out += i, e.block_start += i, r -= i), r && (dt(e.strm, e.strm.output, e.strm.next_out, r), e.strm.next_out += r, e.strm.avail_out -= r, e.strm.total_out += r);
 	} while (o === 0);
-	return s -= e.strm.avail_in, s && (s >= e.w_size ? (e.matches = 2, e.window.set(e.strm.input.subarray(e.strm.next_in - e.w_size, e.strm.next_in), 0), e.strstart = e.w_size, e.insert = e.strstart) : (e.window_size - e.strstart <= s && (e.strstart -= e.w_size, e.window.set(e.window.subarray(e.w_size, e.w_size + e.strstart), 0), e.matches < 2 && e.matches++, e.insert > e.strstart && (e.insert = e.strstart)), e.window.set(e.strm.input.subarray(e.strm.next_in - s, e.strm.next_in), e.strstart), e.strstart += s, e.insert += s > e.w_size - e.insert ? e.w_size - e.insert : s), e.block_start = e.strstart), e.high_water < e.strstart && (e.high_water = e.strstart), o ? rt : t !== 0 && t !== 4 && e.strm.avail_in === 0 && e.strstart === e.block_start ? tt : (a = e.window_size - e.strstart, e.strm.avail_in > a && e.block_start >= e.w_size && (e.block_start -= e.w_size, e.strstart -= e.w_size, e.window.set(e.window.subarray(e.w_size, e.w_size + e.strstart), 0), e.matches < 2 && e.matches++, a += e.w_size, e.insert > e.strstart && (e.insert = e.strstart)), a > e.strm.avail_in && (a = e.strm.avail_in), a && (ft(e.strm, e.window, e.strstart, a), e.strstart += a, e.insert += a > e.w_size - e.insert ? e.w_size - e.insert : a), e.high_water < e.strstart && (e.high_water = e.strstart), a = e.bi_valid + 42 >> 3, a = e.pending_buf_size - a > 65535 ? 65535 : e.pending_buf_size - a, n = a > e.w_size ? e.w_size : a, i = e.strstart - e.block_start, (i >= n || (i || t === 4) && t !== 0 && e.strm.avail_in === 0 && i <= a) && (r = i > a ? a : i, o = +(t === 4 && e.strm.avail_in === 0 && r === i), Fe(e, e.block_start, r, o), e.block_start += r, L(e.strm)), o ? nt : I);
-}, gt = (e, t) => {
+	return s -= e.strm.avail_in, s && (s >= e.w_size ? (e.matches = 2, e.window.set(e.strm.input.subarray(e.strm.next_in - e.w_size, e.strm.next_in), 0), e.strstart = e.w_size, e.insert = e.strstart) : (e.window_size - e.strstart <= s && (e.strstart -= e.w_size, e.window.set(e.window.subarray(e.w_size, e.w_size + e.strstart), 0), e.matches < 2 && e.matches++, e.insert > e.strstart && (e.insert = e.strstart)), e.window.set(e.strm.input.subarray(e.strm.next_in - s, e.strm.next_in), e.strstart), e.strstart += s, e.insert += s > e.w_size - e.insert ? e.w_size - e.insert : s), e.block_start = e.strstart), e.high_water < e.strstart && (e.high_water = e.strstart), o ? nt : t !== 0 && t !== 4 && e.strm.avail_in === 0 && e.strstart === e.block_start ? et : (a = e.window_size - e.strstart, e.strm.avail_in > a && e.block_start >= e.w_size && (e.block_start -= e.w_size, e.strstart -= e.w_size, e.window.set(e.window.subarray(e.w_size, e.w_size + e.strstart), 0), e.matches < 2 && e.matches++, a += e.w_size, e.insert > e.strstart && (e.insert = e.strstart)), a > e.strm.avail_in && (a = e.strm.avail_in), a && (dt(e.strm, e.window, e.strstart, a), e.strstart += a, e.insert += a > e.w_size - e.insert ? e.w_size - e.insert : a), e.high_water < e.strstart && (e.high_water = e.strstart), a = e.bi_valid + 42 >> 3, a = e.pending_buf_size - a > 65535 ? 65535 : e.pending_buf_size - a, n = a > e.w_size ? e.w_size : a, i = e.strstart - e.block_start, (i >= n || (i || t === 4) && t !== 0 && e.strm.avail_in === 0 && i <= a) && (r = i > a ? a : i, o = +(t === 4 && e.strm.avail_in === 0 && r === i), Pe(e, e.block_start, r, o), e.block_start += r, R(e.strm)), o ? tt : L);
+}, ht = (e, t) => {
 	let n, r;
 	for (;;) {
-		if (e.lookahead < Ge) {
-			if (mt(e), e.lookahead < Ge && t === 0) return I;
+		if (e.lookahead < We) {
+			if (pt(e), e.lookahead < We && t === 0) return L;
 			if (e.lookahead === 0) break;
 		}
-		if (n = 0, e.lookahead >= F && (n = ut(e, e.strstart)), n !== 0 && e.strstart - n <= e.w_size - Ge && (e.match_length = pt(e, n)), e.match_length >= F) if (r = Re(e, e.strstart - e.match_start, e.match_length - F), e.lookahead -= e.match_length, e.match_length <= e.max_lazy_match && e.lookahead >= F) {
+		if (n = 0, e.lookahead >= I && (n = lt(e, e.strstart)), n !== 0 && e.strstart - n <= e.w_size - We && (e.match_length = ft(e, n)), e.match_length >= I) if (r = Le(e, e.strstart - e.match_start, e.match_length - I), e.lookahead -= e.match_length, e.match_length <= e.max_lazy_match && e.lookahead >= I) {
 			e.match_length--;
 			do
-				e.strstart++, n = ut(e, e.strstart);
+				e.strstart++, n = lt(e, e.strstart);
 			while (--e.match_length !== 0);
 			e.strstart++;
-		} else e.strstart += e.match_length, e.match_length = 0, e.legacy_hash && (e.ins_h = e.window[e.strstart], e.ins_h = lt(e, e.ins_h, e.window[e.strstart + 1]));
-		else r = Re(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++;
-		if (r && (R(e, !1), e.strm.avail_out === 0)) return I;
+		} else e.strstart += e.match_length, e.match_length = 0, e.legacy_hash && (e.ins_h = e.window[e.strstart], e.ins_h = ct(e, e.ins_h, e.window[e.strstart + 1]));
+		else r = Le(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++;
+		if (r && (z(e, !1), e.strm.avail_out === 0)) return L;
 	}
-	return e.insert = e.strstart < F - 1 ? e.strstart : F - 1, t === 4 ? (R(e, !0), e.strm.avail_out === 0 ? nt : rt) : e.sym_next && (R(e, !1), e.strm.avail_out === 0) ? I : tt;
-}, _t = (e, t) => {
+	return e.insert = e.strstart < I - 1 ? e.strstart : I - 1, t === 4 ? (z(e, !0), e.strm.avail_out === 0 ? tt : nt) : e.sym_next && (z(e, !1), e.strm.avail_out === 0) ? L : et;
+}, gt = (e, t) => {
 	let n, r, i;
 	for (;;) {
-		if (e.lookahead < Ge) {
-			if (mt(e), e.lookahead < Ge && t === 0) return I;
+		if (e.lookahead < We) {
+			if (pt(e), e.lookahead < We && t === 0) return L;
 			if (e.lookahead === 0) break;
 		}
-		if (n = 0, e.lookahead >= F && (n = ut(e, e.strstart)), e.prev_length = e.match_length, e.prev_match = e.match_start, e.match_length = F - 1, n !== 0 && e.prev_length < e.max_lazy_match && e.strstart - n <= e.w_size - Ge && (e.match_length = pt(e, n), e.match_length <= 5 && (e.strategy === 1 || e.match_length === F && e.strstart - e.match_start > 4096) && (e.match_length = F - 1)), e.prev_length >= F && e.match_length <= e.prev_length) {
-			i = e.strstart + e.lookahead - F, r = Re(e, e.strstart - 1 - e.prev_match, e.prev_length - F), e.lookahead -= e.prev_length - 1, e.prev_length -= 2;
+		if (n = 0, e.lookahead >= I && (n = lt(e, e.strstart)), e.prev_length = e.match_length, e.prev_match = e.match_start, e.match_length = I - 1, n !== 0 && e.prev_length < e.max_lazy_match && e.strstart - n <= e.w_size - We && (e.match_length = ft(e, n), e.match_length <= 5 && (e.strategy === 1 || e.match_length === I && e.strstart - e.match_start > 4096) && (e.match_length = I - 1)), e.prev_length >= I && e.match_length <= e.prev_length) {
+			i = e.strstart + e.lookahead - I, r = Le(e, e.strstart - 1 - e.prev_match, e.prev_length - I), e.lookahead -= e.prev_length - 1, e.prev_length -= 2;
 			do
-				++e.strstart <= i && (n = ut(e, e.strstart));
+				++e.strstart <= i && (n = lt(e, e.strstart));
 			while (--e.prev_length !== 0);
-			if (e.match_available = 0, e.match_length = F - 1, e.strstart++, r && (R(e, !1), e.strm.avail_out === 0)) return I;
+			if (e.match_available = 0, e.match_length = I - 1, e.strstart++, r && (z(e, !1), e.strm.avail_out === 0)) return L;
 		} else if (e.match_available) {
-			if (r = Re(e, 0, e.window[e.strstart - 1]), r && R(e, !1), e.strstart++, e.lookahead--, e.strm.avail_out === 0) return I;
+			if (r = Le(e, 0, e.window[e.strstart - 1]), r && z(e, !1), e.strstart++, e.lookahead--, e.strm.avail_out === 0) return L;
 		} else e.match_available = 1, e.strstart++, e.lookahead--;
 	}
-	return e.match_available && (r = Re(e, 0, e.window[e.strstart - 1]), e.match_available = 0), e.insert = e.strstart < F - 1 ? e.strstart : F - 1, t === 4 ? (R(e, !0), e.strm.avail_out === 0 ? nt : rt) : e.sym_next && (R(e, !1), e.strm.avail_out === 0) ? I : tt;
-}, vt = (e, t) => {
+	return e.match_available && (r = Le(e, 0, e.window[e.strstart - 1]), e.match_available = 0), e.insert = e.strstart < I - 1 ? e.strstart : I - 1, t === 4 ? (z(e, !0), e.strm.avail_out === 0 ? tt : nt) : e.sym_next && (z(e, !1), e.strm.avail_out === 0) ? L : et;
+}, _t = (e, t) => {
 	let n, r, i, a, o = e.window;
 	for (;;) {
-		if (e.lookahead <= We) {
-			if (mt(e), e.lookahead <= We && t === 0) return I;
+		if (e.lookahead <= Ue) {
+			if (pt(e), e.lookahead <= Ue && t === 0) return L;
 			if (e.lookahead === 0) break;
 		}
-		if (e.match_length = 0, e.lookahead >= F && e.strstart > 0 && (i = e.strstart - 1, r = o[i], r === o[++i] && r === o[++i] && r === o[++i])) {
-			a = e.strstart + We;
+		if (e.match_length = 0, e.lookahead >= I && e.strstart > 0 && (i = e.strstart - 1, r = o[i], r === o[++i] && r === o[++i] && r === o[++i])) {
+			a = e.strstart + Ue;
 			do			;
 while (r === o[++i] && r === o[++i] && r === o[++i] && r === o[++i] && r === o[++i] && r === o[++i] && r === o[++i] && r === o[++i] && i < a);
-			e.match_length = We - (a - i), e.match_length > e.lookahead && (e.match_length = e.lookahead);
+			e.match_length = Ue - (a - i), e.match_length > e.lookahead && (e.match_length = e.lookahead);
 		}
-		if (e.match_length >= F ? (n = Re(e, 1, e.match_length - F), e.lookahead -= e.match_length, e.strstart += e.match_length, e.match_length = 0) : (n = Re(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++), n && (R(e, !1), e.strm.avail_out === 0)) return I;
+		if (e.match_length >= I ? (n = Le(e, 1, e.match_length - I), e.lookahead -= e.match_length, e.strstart += e.match_length, e.match_length = 0) : (n = Le(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++), n && (z(e, !1), e.strm.avail_out === 0)) return L;
 	}
-	return e.insert = 0, t === 4 ? (R(e, !0), e.strm.avail_out === 0 ? nt : rt) : e.sym_next && (R(e, !1), e.strm.avail_out === 0) ? I : tt;
-}, yt = (e, t) => {
+	return e.insert = 0, t === 4 ? (z(e, !0), e.strm.avail_out === 0 ? tt : nt) : e.sym_next && (z(e, !1), e.strm.avail_out === 0) ? L : et;
+}, vt = (e, t) => {
 	let n;
 	for (;;) {
-		if (e.lookahead === 0 && (mt(e), e.lookahead === 0)) {
-			if (t === 0) return I;
+		if (e.lookahead === 0 && (pt(e), e.lookahead === 0)) {
+			if (t === 0) return L;
 			break;
 		}
-		if (e.match_length = 0, n = Re(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++, n && (R(e, !1), e.strm.avail_out === 0)) return I;
+		if (e.match_length = 0, n = Le(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++, n && (z(e, !1), e.strm.avail_out === 0)) return L;
 	}
-	return e.insert = 0, t === 4 ? (R(e, !0), e.strm.avail_out === 0 ? nt : rt) : e.sym_next && (R(e, !1), e.strm.avail_out === 0) ? I : tt;
-}, bt = class {
+	return e.insert = 0, t === 4 ? (z(e, !0), e.strm.avail_out === 0 ? tt : nt) : e.sym_next && (z(e, !1), e.strm.avail_out === 0) ? L : et;
+}, yt = class {
 	constructor(e, t, n, r, i) {
 		this.good_length = e, this.max_lazy = t, this.nice_length = n, this.max_chain = r, this.func = i;
 	}
-}, xt = [
-	new bt(0, 0, 0, 0, ht),
-	new bt(4, 4, 8, 4, gt),
-	new bt(4, 5, 16, 8, gt),
-	new bt(4, 6, 32, 32, gt),
-	new bt(4, 4, 16, 16, _t),
-	new bt(8, 16, 32, 32, _t),
-	new bt(8, 16, 128, 128, _t),
-	new bt(8, 32, 128, 256, _t),
-	new bt(32, 128, 258, 1024, _t),
-	new bt(32, 258, 258, 4096, _t)
-], St = (e) => {
-	e.window_size = 2 * e.w_size, st(e.head), e.max_lazy_match = xt[e.level].max_lazy, e.good_match = xt[e.level].good_length, e.nice_match = xt[e.level].nice_length, e.max_chain_length = xt[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = F - 1, e.match_available = 0, e.ins_h = 0;
-}, Ct = class {
+}, bt = [
+	new yt(0, 0, 0, 0, mt),
+	new yt(4, 4, 8, 4, ht),
+	new yt(4, 5, 16, 8, ht),
+	new yt(4, 6, 32, 32, ht),
+	new yt(4, 4, 16, 16, gt),
+	new yt(8, 16, 32, 32, gt),
+	new yt(8, 16, 128, 128, gt),
+	new yt(8, 32, 128, 256, gt),
+	new yt(32, 128, 258, 1024, gt),
+	new yt(32, 258, 258, 4096, gt)
+], xt = (e) => {
+	e.window_size = 2 * e.w_size, ot(e.head), e.max_lazy_match = bt[e.level].max_lazy, e.good_match = bt[e.level].good_length, e.nice_match = bt[e.level].nice_length, e.max_chain_length = bt[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = I - 1, e.match_available = 0, e.ins_h = 0;
+}, St = class {
 	constructor() {
-		this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = 8, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.legacy_hash = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new Uint16Array(Ue * 2), this.dyn_dtree = /* @__PURE__ */ new Uint16Array(122), this.bl_tree = /* @__PURE__ */ new Uint16Array(78), st(this.dyn_ltree), st(this.dyn_dtree), st(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = /* @__PURE__ */ new Uint16Array(16), this.heap = /* @__PURE__ */ new Uint16Array(573), st(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = /* @__PURE__ */ new Uint16Array(573), st(this.depth), this.sym_buf = 0, this.lit_bufsize = 0, this.sym_next = 0, this.sym_end = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
+		this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = 8, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.legacy_hash = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new Uint16Array(He * 2), this.dyn_dtree = /* @__PURE__ */ new Uint16Array(122), this.bl_tree = /* @__PURE__ */ new Uint16Array(78), ot(this.dyn_ltree), ot(this.dyn_dtree), ot(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = /* @__PURE__ */ new Uint16Array(16), this.heap = /* @__PURE__ */ new Uint16Array(573), ot(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = /* @__PURE__ */ new Uint16Array(573), ot(this.depth), this.sym_buf = 0, this.lit_bufsize = 0, this.sym_next = 0, this.sym_end = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
 	}
-}, wt = (e) => {
+}, Ct = (e) => {
 	if (!e) return 1;
 	let t = e.state;
-	return +(!t || t.strm !== e || t.status !== qe && t.status !== Je && t.status !== Ye && t.status !== Xe && t.status !== Ze && t.status !== Qe && t.status !== $e && t.status !== et);
-}, Tt = (e) => {
-	if (wt(e)) return at(e, -2);
+	return +(!t || t.strm !== e || t.status !== Ke && t.status !== qe && t.status !== Je && t.status !== Ye && t.status !== Xe && t.status !== Ze && t.status !== Qe && t.status !== $e);
+}, wt = (e) => {
+	if (Ct(e)) return it(e, -2);
 	e.total_in = e.total_out = 0, e.data_type = 2;
 	let t = e.state;
-	return t.pending = 0, t.pending_out = 0, t.wrap < 0 && (t.wrap = -t.wrap), t.status = t.wrap === 2 ? Je : t.wrap ? qe : $e, e.adler = t.wrap === 2 ? 0 : 1, t.last_flush = -2, Pe(t), 0;
-}, Et = (e) => {
-	let t = Tt(e);
-	return t === 0 && St(e.state), t;
-}, Dt = (e, t, n, r, i, a, o) => {
+	return t.pending = 0, t.pending_out = 0, t.wrap < 0 && (t.wrap = -t.wrap), t.status = t.wrap === 2 ? qe : t.wrap ? Ke : Qe, e.adler = t.wrap === 2 ? 0 : 1, t.last_flush = -2, Ne(t), 0;
+}, Tt = (e) => {
+	let t = wt(e);
+	return t === 0 && xt(e.state), t;
+}, Et = (e, t, n, r, i, a, o) => {
 	if (!e) return -2;
 	let s = 1;
-	if (t === -1 && (t = 6), r < 0 ? (s = 0, r = -r) : r > 15 && (s = 2, r -= 16), i < 1 || i > He || n !== 8 || r < 8 || r > 15 || t < 0 || t > 9 || a < 0 || a > 4 || r === 8 && s !== 1) return at(e, -2);
+	if (t === -1 && (t = 6), r < 0 ? (s = 0, r = -r) : r > 15 && (s = 2, r -= 16), i < 1 || i > Ve || n !== 8 || r < 8 || r > 15 || t < 0 || t > 9 || a < 0 || a > 4 || r === 8 && s !== 1) return it(e, -2);
 	r === 8 && (r = 9);
-	let c = new Ct();
-	return e.state = c, c.strm = e, c.status = qe, c.wrap = s, c.gzhead = null, c.w_bits = r, c.w_size = 1 << c.w_bits, c.w_mask = c.w_size - 1, c.legacy_hash = +!!o, c.hash_bits = i + 7, !c.legacy_hash && c.hash_bits < 15 && (c.hash_bits = 15), c.hash_size = 1 << c.hash_bits, c.hash_mask = c.hash_size - 1, c.hash_shift = ~~((c.hash_bits + F - 1) / F), c.window = new Uint8Array(c.w_size * 2), c.head = new Uint16Array(c.hash_size), c.prev = new Uint16Array(c.w_size), c.lit_bufsize = 1 << i + 6, c.pending_buf_size = c.lit_bufsize * 4, c.pending_buf = new Uint8Array(c.pending_buf_size), c.sym_buf = c.lit_bufsize, c.sym_end = (c.lit_bufsize - 1) * 3, c.level = t, c.strategy = a, c.method = n, Et(e);
-}, Ot = (e, t) => {
-	if (wt(e) || t > 5 || t < 0) return e ? at(e, -2) : -2;
+	let c = new St();
+	return e.state = c, c.strm = e, c.status = Ke, c.wrap = s, c.gzhead = null, c.w_bits = r, c.w_size = 1 << c.w_bits, c.w_mask = c.w_size - 1, c.legacy_hash = +!!o, c.hash_bits = i + 7, !c.legacy_hash && c.hash_bits < 15 && (c.hash_bits = 15), c.hash_size = 1 << c.hash_bits, c.hash_mask = c.hash_size - 1, c.hash_shift = ~~((c.hash_bits + I - 1) / I), c.window = new Uint8Array(c.w_size * 2), c.head = new Uint16Array(c.hash_size), c.prev = new Uint16Array(c.w_size), c.lit_bufsize = 1 << i + 6, c.pending_buf_size = c.lit_bufsize * 4, c.pending_buf = new Uint8Array(c.pending_buf_size), c.sym_buf = c.lit_bufsize, c.sym_end = (c.lit_bufsize - 1) * 3, c.level = t, c.strategy = a, c.method = n, Tt(e);
+}, Dt = (e, t) => {
+	if (Ct(e) || t > 5 || t < 0) return e ? it(e, -2) : -2;
 	let n = e.state;
-	if (!e.output || e.avail_in !== 0 && !e.input || n.status === et && t !== 4) return at(e, e.avail_out === 0 ? -5 : -2);
+	if (!e.output || e.avail_in !== 0 && !e.input || n.status === $e && t !== 4) return it(e, e.avail_out === 0 ? -5 : -2);
 	let r = n.last_flush;
 	if (n.last_flush = t, n.pending !== 0) {
-		if (L(e), e.avail_out === 0) return n.last_flush = -1, 0;
-	} else if (e.avail_in === 0 && ot(t) <= ot(r) && t !== 4) return at(e, -5);
-	if (n.status === et && e.avail_in !== 0) return at(e, -5);
-	if (n.status === qe && n.wrap === 0 && (n.status = $e), n.status === qe) {
+		if (R(e), e.avail_out === 0) return n.last_flush = -1, 0;
+	} else if (e.avail_in === 0 && at(t) <= at(r) && t !== 4) return it(e, -5);
+	if (n.status === $e && e.avail_in !== 0) return it(e, -5);
+	if (n.status === Ke && n.wrap === 0 && (n.status = Qe), n.status === Ke) {
 		let t = 8 + (n.w_bits - 8 << 4) << 8, r = -1;
-		if (r = n.strategy >= 2 || n.level < 2 ? 0 : n.level < 6 ? 1 : n.level === 6 ? 2 : 3, t |= r << 6, n.strstart !== 0 && (t |= Ke), t += 31 - t % 31, dt(n, t), n.strstart !== 0 && (dt(n, e.adler >>> 16), dt(n, e.adler & 65535)), e.adler = 1, n.status = $e, L(e), n.pending !== 0) return n.last_flush = -1, 0;
+		if (r = n.strategy >= 2 || n.level < 2 ? 0 : n.level < 6 ? 1 : n.level === 6 ? 2 : 3, t |= r << 6, n.strstart !== 0 && (t |= Ge), t += 31 - t % 31, ut(n, t), n.strstart !== 0 && (ut(n, e.adler >>> 16), ut(n, e.adler & 65535)), e.adler = 1, n.status = Qe, R(e), n.pending !== 0) return n.last_flush = -1, 0;
 	}
-	if (n.status === Je) {
-		if (e.adler = 0, z(n, 31), z(n, 139), z(n, 8), n.gzhead) z(n, +!!n.gzhead.text + (n.gzhead.hcrc ? 2 : 0) + (n.gzhead.extra ? 4 : 0) + (n.gzhead.name ? 8 : 0) + (n.gzhead.comment ? 16 : 0)), z(n, n.gzhead.time & 255), z(n, n.gzhead.time >> 8 & 255), z(n, n.gzhead.time >> 16 & 255), z(n, n.gzhead.time >> 24 & 255), z(n, n.level === 9 ? 2 : n.strategy >= 2 || n.level < 2 ? 4 : 0), z(n, n.gzhead.os & 255), n.gzhead.extra && n.gzhead.extra.length && (z(n, n.gzhead.extra.length & 255), z(n, n.gzhead.extra.length >> 8 & 255)), n.gzhead.hcrc && (e.adler = P(e.adler, n.pending_buf, n.pending, 0)), n.gzindex = 0, n.status = Ye;
-		else if (z(n, 0), z(n, 0), z(n, 0), z(n, 0), z(n, 0), z(n, n.level === 9 ? 2 : n.strategy >= 2 || n.level < 2 ? 4 : 0), z(n, it), n.status = $e, L(e), n.pending !== 0) return n.last_flush = -1, 0;
+	if (n.status === qe) {
+		if (e.adler = 0, B(n, 31), B(n, 139), B(n, 8), n.gzhead) B(n, +!!n.gzhead.text + (n.gzhead.hcrc ? 2 : 0) + (n.gzhead.extra ? 4 : 0) + (n.gzhead.name ? 8 : 0) + (n.gzhead.comment ? 16 : 0)), B(n, n.gzhead.time & 255), B(n, n.gzhead.time >> 8 & 255), B(n, n.gzhead.time >> 16 & 255), B(n, n.gzhead.time >> 24 & 255), B(n, n.level === 9 ? 2 : n.strategy >= 2 || n.level < 2 ? 4 : 0), B(n, n.gzhead.os & 255), n.gzhead.extra && n.gzhead.extra.length && (B(n, n.gzhead.extra.length & 255), B(n, n.gzhead.extra.length >> 8 & 255)), n.gzhead.hcrc && (e.adler = F(e.adler, n.pending_buf, n.pending, 0)), n.gzindex = 0, n.status = Je;
+		else if (B(n, 0), B(n, 0), B(n, 0), B(n, 0), B(n, 0), B(n, n.level === 9 ? 2 : n.strategy >= 2 || n.level < 2 ? 4 : 0), B(n, rt), n.status = Qe, R(e), n.pending !== 0) return n.last_flush = -1, 0;
 	}
-	if (n.status === Ye) {
+	if (n.status === Je) {
 		if (n.gzhead.extra) {
 			let t = n.pending, r = (n.gzhead.extra.length & 65535) - n.gzindex;
 			for (; n.pending + r > n.pending_buf_size;) {
 				let i = n.pending_buf_size - n.pending;
-				if (n.pending_buf.set(n.gzhead.extra.subarray(n.gzindex, n.gzindex + i), n.pending), n.pending = n.pending_buf_size, n.gzhead.hcrc && n.pending > t && (e.adler = P(e.adler, n.pending_buf, n.pending - t, t)), n.gzindex += i, L(e), n.pending !== 0) return n.last_flush = -1, 0;
+				if (n.pending_buf.set(n.gzhead.extra.subarray(n.gzindex, n.gzindex + i), n.pending), n.pending = n.pending_buf_size, n.gzhead.hcrc && n.pending > t && (e.adler = F(e.adler, n.pending_buf, n.pending - t, t)), n.gzindex += i, R(e), n.pending !== 0) return n.last_flush = -1, 0;
 				t = 0, r -= i;
 			}
 			let i = new Uint8Array(n.gzhead.extra);
-			n.pending_buf.set(i.subarray(n.gzindex, n.gzindex + r), n.pending), n.pending += r, n.gzhead.hcrc && n.pending > t && (e.adler = P(e.adler, n.pending_buf, n.pending - t, t)), n.gzindex = 0;
+			n.pending_buf.set(i.subarray(n.gzindex, n.gzindex + r), n.pending), n.pending += r, n.gzhead.hcrc && n.pending > t && (e.adler = F(e.adler, n.pending_buf, n.pending - t, t)), n.gzindex = 0;
 		}
-		n.status = Xe;
+		n.status = Ye;
 	}
-	if (n.status === Xe) {
+	if (n.status === Ye) {
 		if (n.gzhead.name) {
 			let t = n.pending, r;
 			do {
 				if (n.pending === n.pending_buf_size) {
-					if (n.gzhead.hcrc && n.pending > t && (e.adler = P(e.adler, n.pending_buf, n.pending - t, t)), L(e), n.pending !== 0) return n.last_flush = -1, 0;
+					if (n.gzhead.hcrc && n.pending > t && (e.adler = F(e.adler, n.pending_buf, n.pending - t, t)), R(e), n.pending !== 0) return n.last_flush = -1, 0;
 					t = 0;
 				}
-				r = n.gzindex < n.gzhead.name.length ? n.gzhead.name.charCodeAt(n.gzindex++) & 255 : 0, z(n, r);
+				r = n.gzindex < n.gzhead.name.length ? n.gzhead.name.charCodeAt(n.gzindex++) & 255 : 0, B(n, r);
 			} while (r !== 0);
-			n.gzhead.hcrc && n.pending > t && (e.adler = P(e.adler, n.pending_buf, n.pending - t, t)), n.gzindex = 0;
+			n.gzhead.hcrc && n.pending > t && (e.adler = F(e.adler, n.pending_buf, n.pending - t, t)), n.gzindex = 0;
 		}
-		n.status = Ze;
+		n.status = Xe;
 	}
-	if (n.status === Ze) {
+	if (n.status === Xe) {
 		if (n.gzhead.comment) {
 			let t = n.pending, r;
 			do {
 				if (n.pending === n.pending_buf_size) {
-					if (n.gzhead.hcrc && n.pending > t && (e.adler = P(e.adler, n.pending_buf, n.pending - t, t)), L(e), n.pending !== 0) return n.last_flush = -1, 0;
+					if (n.gzhead.hcrc && n.pending > t && (e.adler = F(e.adler, n.pending_buf, n.pending - t, t)), R(e), n.pending !== 0) return n.last_flush = -1, 0;
 					t = 0;
 				}
-				r = n.gzindex < n.gzhead.comment.length ? n.gzhead.comment.charCodeAt(n.gzindex++) & 255 : 0, z(n, r);
+				r = n.gzindex < n.gzhead.comment.length ? n.gzhead.comment.charCodeAt(n.gzindex++) & 255 : 0, B(n, r);
 			} while (r !== 0);
-			n.gzhead.hcrc && n.pending > t && (e.adler = P(e.adler, n.pending_buf, n.pending - t, t));
+			n.gzhead.hcrc && n.pending > t && (e.adler = F(e.adler, n.pending_buf, n.pending - t, t));
 		}
-		n.status = Qe;
+		n.status = Ze;
 	}
-	if (n.status === Qe) {
+	if (n.status === Ze) {
 		if (n.gzhead.hcrc) {
-			if (n.pending + 2 > n.pending_buf_size && (L(e), n.pending !== 0)) return n.last_flush = -1, 0;
-			z(n, e.adler & 255), z(n, e.adler >> 8 & 255), e.adler = 0;
+			if (n.pending + 2 > n.pending_buf_size && (R(e), n.pending !== 0)) return n.last_flush = -1, 0;
+			B(n, e.adler & 255), B(n, e.adler >> 8 & 255), e.adler = 0;
 		}
-		if (n.status = $e, L(e), n.pending !== 0) return n.last_flush = -1, 0;
+		if (n.status = Qe, R(e), n.pending !== 0) return n.last_flush = -1, 0;
 	}
-	if (e.avail_in !== 0 || n.lookahead !== 0 || t !== 0 && n.status !== et) {
-		let r = n.level === 0 ? ht(n, t) : n.strategy === 2 ? yt(n, t) : n.strategy === 3 ? vt(n, t) : xt[n.level].func(n, t);
-		if ((r === nt || r === rt) && (n.status = et), r === I || r === nt) return e.avail_out === 0 && (n.last_flush = -1), 0;
-		if (r === tt && (t === 1 ? Ie(n) : t !== 5 && (Fe(n, 0, 0, !1), t === 3 && (st(n.head), n.lookahead === 0 && (n.strstart = 0, n.block_start = 0, n.insert = 0))), L(e), e.avail_out === 0)) return n.last_flush = -1, 0;
+	if (e.avail_in !== 0 || n.lookahead !== 0 || t !== 0 && n.status !== $e) {
+		let r = n.level === 0 ? mt(n, t) : n.strategy === 2 ? vt(n, t) : n.strategy === 3 ? _t(n, t) : bt[n.level].func(n, t);
+		if ((r === tt || r === nt) && (n.status = $e), r === L || r === tt) return e.avail_out === 0 && (n.last_flush = -1), 0;
+		if (r === et && (t === 1 ? Fe(n) : t !== 5 && (Pe(n, 0, 0, !1), t === 3 && (ot(n.head), n.lookahead === 0 && (n.strstart = 0, n.block_start = 0, n.insert = 0))), R(e), e.avail_out === 0)) return n.last_flush = -1, 0;
 	}
-	return t === 4 ? n.wrap <= 0 ? 1 : (n.wrap === 2 ? (z(n, e.adler & 255), z(n, e.adler >> 8 & 255), z(n, e.adler >> 16 & 255), z(n, e.adler >> 24 & 255), z(n, e.total_in & 255), z(n, e.total_in >> 8 & 255), z(n, e.total_in >> 16 & 255), z(n, e.total_in >> 24 & 255)) : (dt(n, e.adler >>> 16), dt(n, e.adler & 65535)), L(e), n.wrap > 0 && (n.wrap = -n.wrap), +(n.pending === 0)) : 0;
-}, kt = (e) => {
-	if (wt(e)) return -2;
+	return t === 4 ? n.wrap <= 0 ? 1 : (n.wrap === 2 ? (B(n, e.adler & 255), B(n, e.adler >> 8 & 255), B(n, e.adler >> 16 & 255), B(n, e.adler >> 24 & 255), B(n, e.total_in & 255), B(n, e.total_in >> 8 & 255), B(n, e.total_in >> 16 & 255), B(n, e.total_in >> 24 & 255)) : (ut(n, e.adler >>> 16), ut(n, e.adler & 65535)), R(e), n.wrap > 0 && (n.wrap = -n.wrap), +(n.pending === 0)) : 0;
+}, Ot = (e) => {
+	if (Ct(e)) return -2;
 	let t = e.state.status;
-	return e.state = null, t === $e ? at(e, -3) : 0;
-}, At = (e, t) => {
+	return e.state = null, t === Qe ? it(e, -3) : 0;
+}, kt = (e, t) => {
 	let n = t.length;
-	if (wt(e)) return -2;
+	if (Ct(e)) return -2;
 	let r = e.state, i = r.wrap;
-	if (i === 2 || i === 1 && r.status !== qe || r.lookahead) return -2;
-	if (i === 1 && (e.adler = ze(e.adler, t, n, 0)), r.wrap = 0, n >= r.w_size) {
-		i === 0 && (st(r.head), r.strstart = 0, r.block_start = 0, r.insert = 0);
+	if (i === 2 || i === 1 && r.status !== Ke || r.lookahead) return -2;
+	if (i === 1 && (e.adler = Re(e.adler, t, n, 0)), r.wrap = 0, n >= r.w_size) {
+		i === 0 && (ot(r.head), r.strstart = 0, r.block_start = 0, r.insert = 0);
 		let e = new Uint8Array(r.w_size);
 		e.set(t.subarray(n - r.w_size, n), 0), t = e, n = r.w_size;
 	}
 	let a = e.avail_in, o = e.next_in, s = e.input;
-	for (e.avail_in = n, e.next_in = 0, e.input = t, mt(r); r.lookahead >= F;) {
-		let e = r.strstart, t = r.lookahead - (F - 1);
+	for (e.avail_in = n, e.next_in = 0, e.input = t, pt(r); r.lookahead >= I;) {
+		let e = r.strstart, t = r.lookahead - (I - 1);
 		do
-			ut(r, e), e++;
+			lt(r, e), e++;
 		while (--t);
-		r.strstart = e, r.lookahead = F - 1, mt(r);
+		r.strstart = e, r.lookahead = I - 1, pt(r);
 	}
-	return r.strstart += r.lookahead, r.block_start = r.strstart, r.insert = r.lookahead, r.lookahead = 0, r.match_length = r.prev_length = F - 1, r.match_available = 0, e.next_in = o, e.input = s, e.avail_in = a, r.wrap = i, 0;
-}, jt = 16209, Mt = 16191;
-function Nt(e, t) {
+	return r.strstart += r.lookahead, r.block_start = r.strstart, r.insert = r.lookahead, r.lookahead = 0, r.match_length = r.prev_length = I - 1, r.match_available = 0, e.next_in = o, e.input = s, e.avail_in = a, r.wrap = i, 0;
+}, At = 16209, jt = 16191;
+function Mt(e, t) {
 	let n, r, i, a, o, s, c, l, u, d, f, p, m, h, g, _, v, y, b, x, S, C, w, T, E = e.state;
 	n = e.next_in, w = e.input, r = n + (e.avail_in - 5), i = e.next_out, T = e.output, a = i - (t - e.avail_out), o = i + (e.avail_out - 257), s = E.dmax, c = E.wsize, l = E.whave, u = E.wnext, d = E.window, f = E.hold, p = E.bits, m = E.lencode, h = E.distcode, g = (1 << E.lenbits) - 1, _ = (1 << E.distbits) - 1;
 	top: do {
@@ -597,12 +597,12 @@ function Nt(e, t) {
 				dodist: for (;;) {
 					if (y = v >>> 24, f >>>= y, p -= y, y = v >>> 16 & 255, y & 16) {
 						if (x = v & 65535, y &= 15, p < y && (f += w[n++] << p, p += 8, p < y && (f += w[n++] << p, p += 8)), x += f & (1 << y) - 1, x > s) {
-							e.msg = "invalid distance too far back", E.mode = jt;
+							e.msg = "invalid distance too far back", E.mode = At;
 							break top;
 						}
 						if (f >>>= y, p -= y, y = i - a, x > y) {
 							if (y = x - y, y > l && E.sane) {
-								e.msg = "invalid distance too far back", E.mode = jt;
+								e.msg = "invalid distance too far back", E.mode = At;
 								break top;
 							}
 							if (S = 0, C = d, u === 0) {
@@ -644,7 +644,7 @@ function Nt(e, t) {
 							b && (T[i++] = T[S++], b > 1 && (T[i++] = T[S++]));
 						}
 					} else if (y & 64) {
-						e.msg = "invalid distance code", E.mode = jt;
+						e.msg = "invalid distance code", E.mode = At;
 						break top;
 					} else {
 						v = h[(v & 65535) + (f & (1 << y) - 1)];
@@ -656,10 +656,10 @@ function Nt(e, t) {
 				v = m[(v & 65535) + (f & (1 << y) - 1)];
 				continue dolen;
 			} else if (y & 32) {
-				E.mode = Mt;
+				E.mode = jt;
 				break top;
 			} else {
-				e.msg = "invalid literal/length code", E.mode = jt;
+				e.msg = "invalid literal/length code", E.mode = At;
 				break top;
 			}
 			break;
@@ -667,7 +667,7 @@ function Nt(e, t) {
 	} while (n < r && i < o);
 	b = p >> 3, n -= b, p -= b << 3, f &= (1 << p) - 1, e.next_in = n, e.next_out = i, e.avail_in = n < r ? 5 + (r - n) : 5 - (n - r), e.avail_out = i < o ? 257 + (o - i) : 257 - (i - o), E.hold = f, E.bits = p;
 }
-var Pt = 15, Ft = 852, It = 592, Lt = 0, Rt = 1, zt = 2, Bt = new Uint16Array([
+var Nt = 15, Pt = 852, Ft = 592, It = 0, Lt = 1, Rt = 2, zt = new Uint16Array([
 	3,
 	4,
 	5,
@@ -699,7 +699,7 @@ var Pt = 15, Ft = 852, It = 592, Lt = 0, Rt = 1, zt = 2, Bt = new Uint16Array([
 	258,
 	0,
 	0
-]), Vt = new Uint8Array([
+]), Bt = new Uint8Array([
 	16,
 	16,
 	16,
@@ -731,7 +731,7 @@ var Pt = 15, Ft = 852, It = 592, Lt = 0, Rt = 1, zt = 2, Bt = new Uint16Array([
 	16,
 	199,
 	75
-]), Ht = new Uint16Array([
+]), Vt = new Uint16Array([
 	1,
 	2,
 	3,
@@ -764,7 +764,7 @@ var Pt = 15, Ft = 852, It = 592, Lt = 0, Rt = 1, zt = 2, Bt = new Uint16Array([
 	24577,
 	0,
 	0
-]), Ut = new Uint8Array([
+]), Ht = new Uint8Array([
 	16,
 	16,
 	16,
@@ -797,18 +797,18 @@ var Pt = 15, Ft = 852, It = 592, Lt = 0, Rt = 1, zt = 2, Bt = new Uint16Array([
 	29,
 	64,
 	64
-]), Wt = (e, t, n, r, i, a, o, s) => {
+]), Ut = (e, t, n, r, i, a, o, s) => {
 	let c = s.bits, l = 0, u = 0, d = 0, f = 0, p = 0, m = 0, h = 0, g = 0, _ = 0, v = 0, y, b, x, S, C, w = null, T, E = /* @__PURE__ */ new Uint16Array(16), D = /* @__PURE__ */ new Uint16Array(16), O = null, k, A, j;
-	for (l = 0; l <= Pt; l++) E[l] = 0;
+	for (l = 0; l <= Nt; l++) E[l] = 0;
 	for (u = 0; u < r; u++) E[t[n + u]]++;
-	for (p = c, f = Pt; f >= 1 && E[f] === 0; f--);
+	for (p = c, f = Nt; f >= 1 && E[f] === 0; f--);
 	if (p > f && (p = f), f === 0) return i[a++] = 20971520, i[a++] = 20971520, s.bits = 1, 0;
 	for (d = 1; d < f && E[d] === 0; d++);
-	for (p < d && (p = d), g = 1, l = 1; l <= Pt; l++) if (g <<= 1, g -= E[l], g < 0) return -1;
-	if (g > 0 && (e === Lt || f !== 1)) return -1;
-	for (D[1] = 0, l = 1; l < Pt; l++) D[l + 1] = D[l] + E[l];
+	for (p < d && (p = d), g = 1, l = 1; l <= Nt; l++) if (g <<= 1, g -= E[l], g < 0) return -1;
+	if (g > 0 && (e === It || f !== 1)) return -1;
+	for (D[1] = 0, l = 1; l < Nt; l++) D[l + 1] = D[l] + E[l];
 	for (u = 0; u < r; u++) t[n + u] !== 0 && (o[D[t[n + u]]++] = u);
-	if (e === Lt ? (w = O = o, T = 20) : e === Rt ? (w = Bt, O = Vt, T = 257) : (w = Ht, O = Ut, T = 0), v = 0, u = 0, l = d, C = a, m = p, h = 0, x = -1, _ = 1 << p, S = _ - 1, e === Rt && _ > Ft || e === zt && _ > It) return 1;
+	if (e === It ? (w = O = o, T = 20) : e === Lt ? (w = zt, O = Bt, T = 257) : (w = Vt, O = Ht, T = 0), v = 0, u = 0, l = d, C = a, m = p, h = 0, x = -1, _ = 1 << p, S = _ - 1, e === Lt && _ > Pt || e === Rt && _ > Ft) return 1;
 	for (;;) {
 		k = l - h, o[u] + 1 < T ? (A = 0, j = o[u]) : o[u] >= T ? (A = O[o[u] - T], j = w[o[u] - T]) : (A = 96, j = 0), y = 1 << l - h, b = 1 << m, d = b;
 		do
@@ -821,54 +821,54 @@ var Pt = 15, Ft = 852, It = 592, Lt = 0, Rt = 1, zt = 2, Bt = new Uint16Array([
 		}
 		if (l > p && (v & S) !== x) {
 			for (h === 0 && (h = p), C += d, m = l - h, g = 1 << m; m + h < f && (g -= E[m + h], !(g <= 0));) m++, g <<= 1;
-			if (_ += 1 << m, e === Rt && _ > Ft || e === zt && _ > It) return 1;
+			if (_ += 1 << m, e === Lt && _ > Pt || e === Rt && _ > Ft) return 1;
 			x = v & S, i[x] = p << 24 | m << 16 | C - a | 0;
 		}
 	}
 	return v !== 0 && (i[C + v] = l - h << 24 | 4194304), s.bits = p, 0;
-}, Gt = 0, Kt = 1, qt = 2, Jt = 16180, Yt = 16181, Xt = 16182, Zt = 16183, Qt = 16184, $t = 16185, en = 16186, tn = 16187, nn = 16188, rn = 16189, an = 16190, on = 16191, sn = 16192, cn = 16193, ln = 16194, un = 16195, dn = 16196, fn = 16197, pn = 16198, mn = 16199, hn = 16200, gn = 16201, _n = 16202, vn = 16203, yn = 16204, bn = 16205, xn = 16206, Sn = 16207, Cn = 16208, B = 16209, wn = 16210, Tn = 16211, En = 852, Dn = 592, On = (e) => (e >>> 24 & 255) + (e >>> 8 & 65280) + ((e & 65280) << 8) + ((e & 255) << 24), kn = class {
+}, Wt = 0, Gt = 1, Kt = 2, qt = 16180, Jt = 16181, Yt = 16182, Xt = 16183, Zt = 16184, Qt = 16185, $t = 16186, en = 16187, tn = 16188, nn = 16189, rn = 16190, an = 16191, on = 16192, sn = 16193, cn = 16194, ln = 16195, un = 16196, dn = 16197, fn = 16198, pn = 16199, mn = 16200, hn = 16201, gn = 16202, _n = 16203, vn = 16204, yn = 16205, bn = 16206, xn = 16207, Sn = 16208, V = 16209, Cn = 16210, wn = 16211, Tn = 852, En = 592, Dn = (e) => (e >>> 24 & 255) + (e >>> 8 & 65280) + ((e & 65280) << 8) + ((e & 255) << 24), On = class {
 	constructor() {
 		this.strm = null, this.mode = 0, this.last = !1, this.wrap = 0, this.havedict = !1, this.flags = 0, this.dmax = 0, this.check = 0, this.total = 0, this.head = null, this.wbits = 0, this.wsize = 0, this.whave = 0, this.wnext = 0, this.window = null, this.hold = 0, this.bits = 0, this.length = 0, this.offset = 0, this.extra = 0, this.lencode = null, this.distcode = null, this.lenbits = 0, this.distbits = 0, this.ncode = 0, this.nlen = 0, this.ndist = 0, this.have = 0, this.next = null, this.lens = /* @__PURE__ */ new Uint16Array(320), this.work = /* @__PURE__ */ new Uint16Array(288), this.lendyn = null, this.distdyn = null, this.sane = 0, this.back = 0, this.was = 0;
 	}
-}, An = (e) => {
+}, kn = (e) => {
 	if (!e) return 1;
 	let t = e.state;
-	return +(!t || t.strm !== e || t.mode < Jt || t.mode > Tn);
-}, jn = (e) => {
-	if (An(e)) return -2;
+	return +(!t || t.strm !== e || t.mode < qt || t.mode > wn);
+}, An = (e) => {
+	if (kn(e)) return -2;
 	let t = e.state;
-	return e.total_in = e.total_out = t.total = 0, e.msg = "", t.wrap && (e.adler = t.wrap & 1), t.mode = Jt, t.last = 0, t.havedict = 0, t.flags = -1, t.dmax = 32768, t.head = null, t.hold = 0, t.bits = 0, t.lencode = t.lendyn = new Int32Array(En), t.distcode = t.distdyn = new Int32Array(Dn), t.sane = 1, t.back = -1, 0;
-}, Mn = (e) => {
-	if (An(e)) return -2;
+	return e.total_in = e.total_out = t.total = 0, e.msg = "", t.wrap && (e.adler = t.wrap & 1), t.mode = qt, t.last = 0, t.havedict = 0, t.flags = -1, t.dmax = 32768, t.head = null, t.hold = 0, t.bits = 0, t.lencode = t.lendyn = new Int32Array(Tn), t.distcode = t.distdyn = new Int32Array(En), t.sane = 1, t.back = -1, 0;
+}, jn = (e) => {
+	if (kn(e)) return -2;
 	let t = e.state;
-	return t.wsize = 0, t.whave = 0, t.wnext = 0, jn(e);
-}, Nn = (e, t) => {
+	return t.wsize = 0, t.whave = 0, t.wnext = 0, An(e);
+}, Mn = (e, t) => {
 	let n;
-	if (An(e)) return -2;
+	if (kn(e)) return -2;
 	let r = e.state;
-	return t < 0 ? (n = 0, t = -t) : (n = (t >> 4) + 5, t < 48 && (t &= 15)), t && (t < 8 || t > 15) ? -2 : (r.window !== null && r.wbits !== t && (r.window = null), r.wrap = n, r.wbits = t, Mn(e));
-}, Pn = (e, t) => {
+	return t < 0 ? (n = 0, t = -t) : (n = (t >> 4) + 5, t < 48 && (t &= 15)), t && (t < 8 || t > 15) ? -2 : (r.window !== null && r.wbits !== t && (r.window = null), r.wrap = n, r.wbits = t, jn(e));
+}, Nn = (e, t) => {
 	if (!e) return -2;
-	let n = new kn();
-	e.state = n, n.strm = e, n.window = null, n.mode = Jt;
-	let r = Nn(e, t);
+	let n = new On();
+	e.state = n, n.strm = e, n.window = null, n.mode = qt;
+	let r = Mn(e, t);
 	return r !== 0 && (e.state = null), r;
-}, Fn = !0, In, Ln, Rn = (e) => {
-	if (Fn) {
-		In = /* @__PURE__ */ new Int32Array(512), Ln = /* @__PURE__ */ new Int32Array(32);
+}, Pn = !0, Fn, In, Ln = (e) => {
+	if (Pn) {
+		Fn = /* @__PURE__ */ new Int32Array(512), In = /* @__PURE__ */ new Int32Array(32);
 		let t = 0;
 		for (; t < 144;) e.lens[t++] = 8;
 		for (; t < 256;) e.lens[t++] = 9;
 		for (; t < 280;) e.lens[t++] = 7;
 		for (; t < 288;) e.lens[t++] = 8;
-		for (Wt(Kt, e.lens, 0, 288, In, 0, e.work, { bits: 9 }), t = 0; t < 32;) e.lens[t++] = 5;
-		Wt(qt, e.lens, 0, 32, Ln, 0, e.work, { bits: 5 }), Fn = !1;
+		for (Ut(Gt, e.lens, 0, 288, Fn, 0, e.work, { bits: 9 }), t = 0; t < 32;) e.lens[t++] = 5;
+		Ut(Kt, e.lens, 0, 32, In, 0, e.work, { bits: 5 }), Pn = !1;
 	}
-	e.lencode = In, e.lenbits = 9, e.distcode = Ln, e.distbits = 5;
-}, zn = (e, t, n, r) => {
+	e.lencode = Fn, e.lenbits = 9, e.distcode = In, e.distbits = 5;
+}, Rn = (e, t, n, r) => {
 	let i, a = e.state;
 	return a.window === null && (a.window = new Uint8Array(1 << a.wbits)), a.wsize === 0 && (a.wsize = 1 << a.wbits, a.wnext = 0, a.whave = 0), r >= a.wsize ? (a.window.set(t.subarray(n - a.wsize, n), 0), a.wnext = 0, a.whave = a.wsize) : (i = a.wsize - a.wnext, i > r && (i = r), a.window.set(t.subarray(n - r, n - r + i), a.wnext), r -= i, r ? (a.window.set(t.subarray(n - r, n), 0), a.wnext = r, a.whave = a.wsize) : (a.wnext += i, a.wnext === a.wsize && (a.wnext = 0), a.whave < a.wsize && (a.whave += i))), 0;
-}, Bn = (e, t) => {
+}, zn = (e, t) => {
 	let n, r, i, a, o, s, c, l, u, d, f, p, m, h, g = 0, _, v, y, b, x, S, C, w, T = /* @__PURE__ */ new Uint8Array(4), E, D, O = new Uint8Array([
 		16,
 		17,
@@ -890,12 +890,12 @@ var Pt = 15, Ft = 852, It = 592, Lt = 0, Rt = 1, zt = 2, Bt = new Uint16Array([
 		1,
 		15
 	]);
-	if (An(e) || !e.output || !e.input && e.avail_in !== 0) return -2;
-	n = e.state, n.mode === on && (n.mode = sn), o = e.next_out, i = e.output, c = e.avail_out, a = e.next_in, r = e.input, s = e.avail_in, l = n.hold, u = n.bits, d = s, f = c, w = 0;
+	if (kn(e) || !e.output || !e.input && e.avail_in !== 0) return -2;
+	n = e.state, n.mode === an && (n.mode = on), o = e.next_out, i = e.output, c = e.avail_out, a = e.next_in, r = e.input, s = e.avail_in, l = n.hold, u = n.bits, d = s, f = c, w = 0;
 	inf_leave: for (;;) switch (n.mode) {
-		case Jt:
+		case qt:
 			if (n.wrap === 0) {
-				n.mode = sn;
+				n.mode = on;
 				break;
 			}
 			for (; u < 16;) {
@@ -903,108 +903,108 @@ var Pt = 15, Ft = 852, It = 592, Lt = 0, Rt = 1, zt = 2, Bt = new Uint16Array([
 				s--, l += r[a++] << u, u += 8;
 			}
 			if (n.wrap & 2 && l === 35615) {
-				n.wbits === 0 && (n.wbits = 15), n.check = 0, T[0] = l & 255, T[1] = l >>> 8 & 255, n.check = P(n.check, T, 2, 0), l = 0, u = 0, n.mode = Yt;
+				n.wbits === 0 && (n.wbits = 15), n.check = 0, T[0] = l & 255, T[1] = l >>> 8 & 255, n.check = F(n.check, T, 2, 0), l = 0, u = 0, n.mode = Jt;
 				break;
 			}
 			if (n.head && (n.head.done = !1), !(n.wrap & 1) || (((l & 255) << 8) + (l >> 8)) % 31) {
-				e.msg = "incorrect header check", n.mode = B;
+				e.msg = "incorrect header check", n.mode = V;
 				break;
 			}
 			if ((l & 15) != 8) {
-				e.msg = "unknown compression method", n.mode = B;
+				e.msg = "unknown compression method", n.mode = V;
 				break;
 			}
 			if (l >>>= 4, u -= 4, C = (l & 15) + 8, n.wbits === 0 && (n.wbits = C), C > 15 || C > n.wbits) {
-				e.msg = "invalid window size", n.mode = B;
+				e.msg = "invalid window size", n.mode = V;
 				break;
 			}
-			n.dmax = 1 << n.wbits, n.flags = 0, e.adler = n.check = 1, n.mode = l & 512 ? rn : on, l = 0, u = 0;
+			n.dmax = 1 << n.wbits, n.flags = 0, e.adler = n.check = 1, n.mode = l & 512 ? nn : an, l = 0, u = 0;
 			break;
-		case Yt:
+		case Jt:
 			for (; u < 16;) {
 				if (s === 0) break inf_leave;
 				s--, l += r[a++] << u, u += 8;
 			}
 			if (n.flags = l, (n.flags & 255) != 8) {
-				e.msg = "unknown compression method", n.mode = B;
+				e.msg = "unknown compression method", n.mode = V;
 				break;
 			}
 			if (n.flags & 57344) {
-				e.msg = "unknown header flags set", n.mode = B;
+				e.msg = "unknown header flags set", n.mode = V;
 				break;
 			}
-			n.head && (n.head.text = l >> 8 & 1), n.flags & 512 && n.wrap & 4 && (T[0] = l & 255, T[1] = l >>> 8 & 255, n.check = P(n.check, T, 2, 0)), l = 0, u = 0, n.mode = Xt;
-		case Xt:
+			n.head && (n.head.text = l >> 8 & 1), n.flags & 512 && n.wrap & 4 && (T[0] = l & 255, T[1] = l >>> 8 & 255, n.check = F(n.check, T, 2, 0)), l = 0, u = 0, n.mode = Yt;
+		case Yt:
 			for (; u < 32;) {
 				if (s === 0) break inf_leave;
 				s--, l += r[a++] << u, u += 8;
 			}
-			n.head && (n.head.time = l), n.flags & 512 && n.wrap & 4 && (T[0] = l & 255, T[1] = l >>> 8 & 255, T[2] = l >>> 16 & 255, T[3] = l >>> 24 & 255, n.check = P(n.check, T, 4, 0)), l = 0, u = 0, n.mode = Zt;
-		case Zt:
+			n.head && (n.head.time = l), n.flags & 512 && n.wrap & 4 && (T[0] = l & 255, T[1] = l >>> 8 & 255, T[2] = l >>> 16 & 255, T[3] = l >>> 24 & 255, n.check = F(n.check, T, 4, 0)), l = 0, u = 0, n.mode = Xt;
+		case Xt:
 			for (; u < 16;) {
 				if (s === 0) break inf_leave;
 				s--, l += r[a++] << u, u += 8;
 			}
-			n.head && (n.head.xflags = l & 255, n.head.os = l >> 8), n.flags & 512 && n.wrap & 4 && (T[0] = l & 255, T[1] = l >>> 8 & 255, n.check = P(n.check, T, 2, 0)), l = 0, u = 0, n.mode = Qt;
-		case Qt:
+			n.head && (n.head.xflags = l & 255, n.head.os = l >> 8), n.flags & 512 && n.wrap & 4 && (T[0] = l & 255, T[1] = l >>> 8 & 255, n.check = F(n.check, T, 2, 0)), l = 0, u = 0, n.mode = Zt;
+		case Zt:
 			if (n.flags & 1024) {
 				for (; u < 16;) {
 					if (s === 0) break inf_leave;
 					s--, l += r[a++] << u, u += 8;
 				}
-				n.length = l, n.head && (n.head.extra_len = l), n.flags & 512 && n.wrap & 4 && (T[0] = l & 255, T[1] = l >>> 8 & 255, n.check = P(n.check, T, 2, 0)), l = 0, u = 0;
+				n.length = l, n.head && (n.head.extra_len = l), n.flags & 512 && n.wrap & 4 && (T[0] = l & 255, T[1] = l >>> 8 & 255, n.check = F(n.check, T, 2, 0)), l = 0, u = 0;
 			} else n.head && (n.head.extra = null);
-			n.mode = $t;
+			n.mode = Qt;
+		case Qt:
+			if (n.flags & 1024 && (p = n.length, p > s && (p = s), p && (n.head && (C = n.head.extra_len - n.length, n.head.extra || (n.head.extra = new Uint8Array(n.head.extra_len)), n.head.extra.set(r.subarray(a, a + p), C)), n.flags & 512 && n.wrap & 4 && (n.check = F(n.check, r, p, a)), s -= p, a += p, n.length -= p), n.length)) break inf_leave;
+			n.length = 0, n.mode = $t;
 		case $t:
-			if (n.flags & 1024 && (p = n.length, p > s && (p = s), p && (n.head && (C = n.head.extra_len - n.length, n.head.extra || (n.head.extra = new Uint8Array(n.head.extra_len)), n.head.extra.set(r.subarray(a, a + p), C)), n.flags & 512 && n.wrap & 4 && (n.check = P(n.check, r, p, a)), s -= p, a += p, n.length -= p), n.length)) break inf_leave;
-			n.length = 0, n.mode = en;
-		case en:
 			if (n.flags & 2048) {
 				if (s === 0) break inf_leave;
 				p = 0;
 				do
 					C = r[a + p++], n.head && C && n.length < 65536 && (n.head.name += String.fromCharCode(C));
 				while (C && p < s);
-				if (n.flags & 512 && n.wrap & 4 && (n.check = P(n.check, r, p, a)), s -= p, a += p, C) break inf_leave;
+				if (n.flags & 512 && n.wrap & 4 && (n.check = F(n.check, r, p, a)), s -= p, a += p, C) break inf_leave;
 			} else n.head && (n.head.name = null);
-			n.length = 0, n.mode = tn;
-		case tn:
+			n.length = 0, n.mode = en;
+		case en:
 			if (n.flags & 4096) {
 				if (s === 0) break inf_leave;
 				p = 0;
 				do
 					C = r[a + p++], n.head && C && n.length < 65536 && (n.head.comment += String.fromCharCode(C));
 				while (C && p < s);
-				if (n.flags & 512 && n.wrap & 4 && (n.check = P(n.check, r, p, a)), s -= p, a += p, C) break inf_leave;
+				if (n.flags & 512 && n.wrap & 4 && (n.check = F(n.check, r, p, a)), s -= p, a += p, C) break inf_leave;
 			} else n.head && (n.head.comment = null);
-			n.mode = nn;
-		case nn:
+			n.mode = tn;
+		case tn:
 			if (n.flags & 512) {
 				for (; u < 16;) {
 					if (s === 0) break inf_leave;
 					s--, l += r[a++] << u, u += 8;
 				}
 				if (n.wrap & 4 && l !== (n.check & 65535)) {
-					e.msg = "header crc mismatch", n.mode = B;
+					e.msg = "header crc mismatch", n.mode = V;
 					break;
 				}
 				l = 0, u = 0;
 			}
-			n.head && (n.head.hcrc = n.flags >> 9 & 1, n.head.done = !0), e.adler = n.check = 0, n.mode = on;
+			n.head && (n.head.hcrc = n.flags >> 9 & 1, n.head.done = !0), e.adler = n.check = 0, n.mode = an;
 			break;
-		case rn:
+		case nn:
 			for (; u < 32;) {
 				if (s === 0) break inf_leave;
 				s--, l += r[a++] << u, u += 8;
 			}
-			e.adler = n.check = On(l), l = 0, u = 0, n.mode = an;
-		case an:
+			e.adler = n.check = Dn(l), l = 0, u = 0, n.mode = rn;
+		case rn:
 			if (n.havedict === 0) return e.next_out = o, e.avail_out = c, e.next_in = a, e.avail_in = s, n.hold = l, n.bits = u, 2;
-			e.adler = n.check = 1, n.mode = on;
-		case on: if (t === 5 || t === 6) break inf_leave;
-		case sn:
+			e.adler = n.check = 1, n.mode = an;
+		case an: if (t === 5 || t === 6) break inf_leave;
+		case on:
 			if (n.last) {
-				l >>>= u & 7, u -= u & 7, n.mode = xn;
+				l >>>= u & 7, u -= u & 7, n.mode = bn;
 				break;
 			}
 			for (; u < 3;) {
@@ -1013,51 +1013,51 @@ var Pt = 15, Ft = 852, It = 592, Lt = 0, Rt = 1, zt = 2, Bt = new Uint16Array([
 			}
 			switch (n.last = l & 1, l >>>= 1, --u, l & 3) {
 				case 0:
-					n.mode = cn;
+					n.mode = sn;
 					break;
 				case 1:
-					if (Rn(n), n.mode = mn, t === 6) {
+					if (Ln(n), n.mode = pn, t === 6) {
 						l >>>= 2, u -= 2;
 						break inf_leave;
 					}
 					break;
 				case 2:
-					n.mode = dn;
+					n.mode = un;
 					break;
-				case 3: e.msg = "invalid block type", n.mode = B;
+				case 3: e.msg = "invalid block type", n.mode = V;
 			}
 			l >>>= 2, u -= 2;
 			break;
-		case cn:
+		case sn:
 			for (l >>>= u & 7, u -= u & 7; u < 32;) {
 				if (s === 0) break inf_leave;
 				s--, l += r[a++] << u, u += 8;
 			}
 			if ((l & 65535) != (l >>> 16 ^ 65535)) {
-				e.msg = "invalid stored block lengths", n.mode = B;
+				e.msg = "invalid stored block lengths", n.mode = V;
 				break;
 			}
-			if (n.length = l & 65535, l = 0, u = 0, n.mode = ln, t === 6) break inf_leave;
-		case ln: n.mode = un;
-		case un:
+			if (n.length = l & 65535, l = 0, u = 0, n.mode = cn, t === 6) break inf_leave;
+		case cn: n.mode = ln;
+		case ln:
 			if (p = n.length, p) {
 				if (p > s && (p = s), p > c && (p = c), p === 0) break inf_leave;
 				i.set(r.subarray(a, a + p), o), s -= p, a += p, c -= p, o += p, n.length -= p;
 				break;
 			}
-			n.mode = on;
+			n.mode = an;
 			break;
-		case dn:
+		case un:
 			for (; u < 14;) {
 				if (s === 0) break inf_leave;
 				s--, l += r[a++] << u, u += 8;
 			}
 			if (n.nlen = (l & 31) + 257, l >>>= 5, u -= 5, n.ndist = (l & 31) + 1, l >>>= 5, u -= 5, n.ncode = (l & 15) + 4, l >>>= 4, u -= 4, n.nlen > 286 || n.ndist > 30) {
-				e.msg = "too many length or distance symbols", n.mode = B;
+				e.msg = "too many length or distance symbols", n.mode = V;
 				break;
 			}
-			n.have = 0, n.mode = fn;
-		case fn:
+			n.have = 0, n.mode = dn;
+		case dn:
 			for (; n.have < n.ncode;) {
 				for (; u < 3;) {
 					if (s === 0) break inf_leave;
@@ -1066,12 +1066,12 @@ var Pt = 15, Ft = 852, It = 592, Lt = 0, Rt = 1, zt = 2, Bt = new Uint16Array([
 				n.lens[O[n.have++]] = l & 7, l >>>= 3, u -= 3;
 			}
 			for (; n.have < 19;) n.lens[O[n.have++]] = 0;
-			if (n.lencode = n.lendyn, n.lenbits = 7, E = { bits: n.lenbits }, w = Wt(Gt, n.lens, 0, 19, n.lencode, 0, n.work, E), n.lenbits = E.bits, w) {
-				e.msg = "invalid code lengths set", n.mode = B;
+			if (n.lencode = n.lendyn, n.lenbits = 7, E = { bits: n.lenbits }, w = Ut(Wt, n.lens, 0, 19, n.lencode, 0, n.work, E), n.lenbits = E.bits, w) {
+				e.msg = "invalid code lengths set", n.mode = V;
 				break;
 			}
-			n.have = 0, n.mode = pn;
-		case pn:
+			n.have = 0, n.mode = fn;
+		case fn:
 			for (; n.have < n.nlen + n.ndist;) {
 				for (; g = n.lencode[l & (1 << n.lenbits) - 1], _ = g >>> 24, v = g >>> 16 & 255, y = g & 65535, !(_ <= u);) {
 					if (s === 0) break inf_leave;
@@ -1085,7 +1085,7 @@ var Pt = 15, Ft = 852, It = 592, Lt = 0, Rt = 1, zt = 2, Bt = new Uint16Array([
 							s--, l += r[a++] << u, u += 8;
 						}
 						if (l >>>= _, u -= _, n.have === 0) {
-							e.msg = "invalid bit length repeat", n.mode = B;
+							e.msg = "invalid bit length repeat", n.mode = V;
 							break;
 						}
 						C = n.lens[n.have - 1], p = 3 + (l & 3), l >>>= 2, u -= 2;
@@ -1103,30 +1103,30 @@ var Pt = 15, Ft = 852, It = 592, Lt = 0, Rt = 1, zt = 2, Bt = new Uint16Array([
 						l >>>= _, u -= _, C = 0, p = 11 + (l & 127), l >>>= 7, u -= 7;
 					}
 					if (n.have + p > n.nlen + n.ndist) {
-						e.msg = "invalid bit length repeat", n.mode = B;
+						e.msg = "invalid bit length repeat", n.mode = V;
 						break;
 					}
 					for (; p--;) n.lens[n.have++] = C;
 				}
 			}
-			if (n.mode === B) break;
+			if (n.mode === V) break;
 			if (n.lens[256] === 0) {
-				e.msg = "invalid code -- missing end-of-block", n.mode = B;
+				e.msg = "invalid code -- missing end-of-block", n.mode = V;
 				break;
 			}
-			if (n.lenbits = 9, E = { bits: n.lenbits }, w = Wt(Kt, n.lens, 0, n.nlen, n.lencode, 0, n.work, E), n.lenbits = E.bits, w) {
-				e.msg = "invalid literal/lengths set", n.mode = B;
+			if (n.lenbits = 9, E = { bits: n.lenbits }, w = Ut(Gt, n.lens, 0, n.nlen, n.lencode, 0, n.work, E), n.lenbits = E.bits, w) {
+				e.msg = "invalid literal/lengths set", n.mode = V;
 				break;
 			}
-			if (n.distbits = 6, n.distcode = n.distdyn, E = { bits: n.distbits }, w = Wt(qt, n.lens, n.nlen, n.ndist, n.distcode, 0, n.work, E), n.distbits = E.bits, w) {
-				e.msg = "invalid distances set", n.mode = B;
+			if (n.distbits = 6, n.distcode = n.distdyn, E = { bits: n.distbits }, w = Ut(Kt, n.lens, n.nlen, n.ndist, n.distcode, 0, n.work, E), n.distbits = E.bits, w) {
+				e.msg = "invalid distances set", n.mode = V;
 				break;
 			}
-			if (n.mode = mn, t === 6) break inf_leave;
-		case mn: n.mode = hn;
-		case hn:
+			if (n.mode = pn, t === 6) break inf_leave;
+		case pn: n.mode = mn;
+		case mn:
 			if (s >= 6 && c >= 258) {
-				e.next_out = o, e.avail_out = c, e.next_in = a, e.avail_in = s, n.hold = l, n.bits = u, Nt(e, f), o = e.next_out, i = e.output, c = e.avail_out, a = e.next_in, r = e.input, s = e.avail_in, l = n.hold, u = n.bits, n.mode === on && (n.back = -1);
+				e.next_out = o, e.avail_out = c, e.next_in = a, e.avail_in = s, n.hold = l, n.bits = u, Mt(e, f), o = e.next_out, i = e.output, c = e.avail_out, a = e.next_in, r = e.input, s = e.avail_in, l = n.hold, u = n.bits, n.mode === an && (n.back = -1);
 				break;
 			}
 			for (n.back = 0; g = n.lencode[l & (1 << n.lenbits) - 1], _ = g >>> 24, v = g >>> 16 & 255, y = g & 65535, !(_ <= u);) {
@@ -1141,19 +1141,19 @@ var Pt = 15, Ft = 852, It = 592, Lt = 0, Rt = 1, zt = 2, Bt = new Uint16Array([
 				l >>>= b, u -= b, n.back += b;
 			}
 			if (l >>>= _, u -= _, n.back += _, n.length = y, v === 0) {
-				n.mode = bn;
+				n.mode = yn;
 				break;
 			}
 			if (v & 32) {
-				n.back = -1, n.mode = on;
+				n.back = -1, n.mode = an;
 				break;
 			}
 			if (v & 64) {
-				e.msg = "invalid literal/length code", n.mode = B;
+				e.msg = "invalid literal/length code", n.mode = V;
 				break;
 			}
-			n.extra = v & 15, n.mode = gn;
-		case gn:
+			n.extra = v & 15, n.mode = hn;
+		case hn:
 			if (n.extra) {
 				for (D = n.extra; u < D;) {
 					if (s === 0) break inf_leave;
@@ -1161,8 +1161,8 @@ var Pt = 15, Ft = 852, It = 592, Lt = 0, Rt = 1, zt = 2, Bt = new Uint16Array([
 				}
 				n.length += l & (1 << n.extra) - 1, l >>>= n.extra, u -= n.extra, n.back += n.extra;
 			}
-			n.was = n.length, n.mode = _n;
-		case _n:
+			n.was = n.length, n.mode = gn;
+		case gn:
 			for (; g = n.distcode[l & (1 << n.distbits) - 1], _ = g >>> 24, v = g >>> 16 & 255, y = g & 65535, !(_ <= u);) {
 				if (s === 0) break inf_leave;
 				s--, l += r[a++] << u, u += 8;
@@ -1175,11 +1175,11 @@ var Pt = 15, Ft = 852, It = 592, Lt = 0, Rt = 1, zt = 2, Bt = new Uint16Array([
 				l >>>= b, u -= b, n.back += b;
 			}
 			if (l >>>= _, u -= _, n.back += _, v & 64) {
-				e.msg = "invalid distance code", n.mode = B;
+				e.msg = "invalid distance code", n.mode = V;
 				break;
 			}
-			n.offset = y, n.extra = v & 15, n.mode = vn;
-		case vn:
+			n.offset = y, n.extra = v & 15, n.mode = _n;
+		case _n:
 			if (n.extra) {
 				for (D = n.extra; u < D;) {
 					if (s === 0) break inf_leave;
@@ -1188,15 +1188,15 @@ var Pt = 15, Ft = 852, It = 592, Lt = 0, Rt = 1, zt = 2, Bt = new Uint16Array([
 				n.offset += l & (1 << n.extra) - 1, l >>>= n.extra, u -= n.extra, n.back += n.extra;
 			}
 			if (n.offset > n.dmax) {
-				e.msg = "invalid distance too far back", n.mode = B;
+				e.msg = "invalid distance too far back", n.mode = V;
 				break;
 			}
-			n.mode = yn;
-		case yn:
+			n.mode = vn;
+		case vn:
 			if (c === 0) break inf_leave;
 			if (p = f - c, n.offset > p) {
 				if (p = n.offset - p, p > n.whave && n.sane) {
-					e.msg = "invalid distance too far back", n.mode = B;
+					e.msg = "invalid distance too far back", n.mode = V;
 					break;
 				}
 				p > n.wnext ? (p -= n.wnext, m = n.wsize - p) : m = n.wnext - p, p > n.length && (p = n.length), h = n.window;
@@ -1205,65 +1205,65 @@ var Pt = 15, Ft = 852, It = 592, Lt = 0, Rt = 1, zt = 2, Bt = new Uint16Array([
 			do
 				i[o++] = h[m++];
 			while (--p);
-			n.length === 0 && (n.mode = hn);
+			n.length === 0 && (n.mode = mn);
 			break;
-		case bn:
+		case yn:
 			if (c === 0) break inf_leave;
-			i[o++] = n.length, c--, n.mode = hn;
+			i[o++] = n.length, c--, n.mode = mn;
 			break;
-		case xn:
+		case bn:
 			if (n.wrap) {
 				for (; u < 32;) {
 					if (s === 0) break inf_leave;
 					s--, l |= r[a++] << u, u += 8;
 				}
-				if (f -= c, e.total_out += f, n.total += f, n.wrap & 4 && f && (e.adler = n.check = n.flags ? P(n.check, i, f, o - f) : ze(n.check, i, f, o - f)), f = c, n.wrap & 4 && (n.flags ? l : On(l)) !== n.check) {
-					e.msg = "incorrect data check", n.mode = B;
+				if (f -= c, e.total_out += f, n.total += f, n.wrap & 4 && f && (e.adler = n.check = n.flags ? F(n.check, i, f, o - f) : Re(n.check, i, f, o - f)), f = c, n.wrap & 4 && (n.flags ? l : Dn(l)) !== n.check) {
+					e.msg = "incorrect data check", n.mode = V;
 					break;
 				}
 				l = 0, u = 0;
 			}
-			n.mode = Sn;
-		case Sn:
+			n.mode = xn;
+		case xn:
 			if (n.wrap && n.flags) {
 				for (; u < 32;) {
 					if (s === 0) break inf_leave;
 					s--, l += r[a++] << u, u += 8;
 				}
 				if (n.wrap & 4 && l !== (n.total & 4294967295)) {
-					e.msg = "incorrect length check", n.mode = B;
+					e.msg = "incorrect length check", n.mode = V;
 					break;
 				}
 				l = 0, u = 0;
 			}
-			n.mode = Cn;
-		case Cn:
+			n.mode = Sn;
+		case Sn:
 			w = 1;
 			break inf_leave;
-		case B:
+		case V:
 			w = -3;
 			break inf_leave;
-		case wn: return -4;
-		case Tn:
+		case Cn: return -4;
+		case wn:
 		default: return -2;
 	}
-	return e.next_out = o, e.avail_out = c, e.next_in = a, e.avail_in = s, n.hold = l, n.bits = u, (n.wsize || f !== e.avail_out && n.mode < B && (n.mode < xn || t !== 4)) && zn(e, e.output, e.next_out, f - e.avail_out) ? (n.mode = wn, -4) : (d -= e.avail_in, f -= e.avail_out, e.total_in += d, e.total_out += f, n.total += f, n.wrap & 4 && f && (e.adler = n.check = n.flags ? P(n.check, i, f, e.next_out - f) : ze(n.check, i, f, e.next_out - f)), e.data_type = n.bits + (n.last ? 64 : 0) + (n.mode === on ? 128 : 0) + (n.mode === mn || n.mode === ln ? 256 : 0), (d === 0 && f === 0 || t === 4) && w === 0 && (w = -5), w);
-}, Vn = (e) => {
-	if (An(e)) return -2;
+	return e.next_out = o, e.avail_out = c, e.next_in = a, e.avail_in = s, n.hold = l, n.bits = u, (n.wsize || f !== e.avail_out && n.mode < V && (n.mode < bn || t !== 4)) && Rn(e, e.output, e.next_out, f - e.avail_out) ? (n.mode = Cn, -4) : (d -= e.avail_in, f -= e.avail_out, e.total_in += d, e.total_out += f, n.total += f, n.wrap & 4 && f && (e.adler = n.check = n.flags ? F(n.check, i, f, e.next_out - f) : Re(n.check, i, f, e.next_out - f)), e.data_type = n.bits + (n.last ? 64 : 0) + (n.mode === an ? 128 : 0) + (n.mode === pn || n.mode === cn ? 256 : 0), (d === 0 && f === 0 || t === 4) && w === 0 && (w = -5), w);
+}, Bn = (e) => {
+	if (kn(e)) return -2;
 	let t = e.state;
 	return t.window && (t.window = null), e.state = null, 0;
-}, Hn = (e, t) => {
+}, Vn = (e, t) => {
 	let n = t.length, r, i, a;
-	return An(e) || (r = e.state, r.wrap !== 0 && r.mode !== an) ? -2 : r.mode === an && (i = 1, i = ze(i, t, n, 0), i !== r.check) ? -3 : (a = zn(e, t, n, n), a ? (r.mode = wn, -4) : (r.havedict = 1, 0));
-}, Un = class {
+	return kn(e) || (r = e.state, r.wrap !== 0 && r.mode !== rn) ? -2 : r.mode === rn && (i = 1, i = Re(i, t, n, 0), i !== r.check) ? -3 : (a = Rn(e, t, n, n), a ? (r.mode = Cn, -4) : (r.havedict = 1, 0));
+}, Hn = class {
 	constructor() {
 		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;
 	}
-}, Wn = (e) => {
+}, Un = (e) => {
 	let t = new Uint8Array(e.reduce((e, t) => e + t.length, 0)), n = 0;
 	for (let r of e) t.set(r, n), n += r.length;
 	return t;
-}, Gn = Object.prototype.toString, Kn = {
+}, Wn = Object.prototype.toString, Gn = {
 	level: -1,
 	chunkSize: 16384,
 	windowBits: 15,
@@ -1273,30 +1273,30 @@ var Pt = 15, Ft = 852, It = 592, Lt = 0, Rt = 1, zt = 2, Bt = new Uint16Array([
 	gzip: !1,
 	legacyHash: !1,
 	dictionary: /* @__PURE__ */ new Uint8Array()
-}, qn = class {
+}, Kn = class {
 	constructor(e = {}) {
-		l(this, "options", void 0), l(this, "err", void 0), l(this, "msg", void 0), l(this, "ended", void 0), l(this, "started", void 0), l(this, "chunks", void 0), l(this, "strm", void 0), l(this, "result", void 0), this.options = Object.assign({}, Kn, e);
+		l(this, "options", void 0), l(this, "err", void 0), l(this, "msg", void 0), l(this, "ended", void 0), l(this, "started", void 0), l(this, "chunks", void 0), l(this, "strm", void 0), l(this, "result", void 0), this.options = Object.assign({}, Gn, e);
 		let t = this.options;
-		t.raw && t.windowBits > 0 ? t.windowBits = -t.windowBits : t.gzip && t.windowBits > 0 && t.windowBits < 16 && (t.windowBits += 16), this.err = 0, this.msg = "", this.ended = !1, this.started = !1, this.chunks = [], this.result = /* @__PURE__ */ new Uint8Array(), this.strm = new Un(), this.strm.avail_out = 0;
-		let n = Dt(this.strm, t.level, 8, t.windowBits, t.memLevel, t.strategy, t.legacyHash);
-		if (n !== 0) throw Error(Ve[n]);
-		Gn.call(t.dictionary) === "[object ArrayBuffer]" && (t.dictionary = new Uint8Array(t.dictionary));
+		t.raw && t.windowBits > 0 ? t.windowBits = -t.windowBits : t.gzip && t.windowBits > 0 && t.windowBits < 16 && (t.windowBits += 16), this.err = 0, this.msg = "", this.ended = !1, this.started = !1, this.chunks = [], this.result = /* @__PURE__ */ new Uint8Array(), this.strm = new Hn(), this.strm.avail_out = 0;
+		let n = Et(this.strm, t.level, 8, t.windowBits, t.memLevel, t.strategy, t.legacyHash);
+		if (n !== 0) throw Error(Be[n]);
+		Wn.call(t.dictionary) === "[object ArrayBuffer]" && (t.dictionary = new Uint8Array(t.dictionary));
 		let r = t.dictionary;
 		if (r.length) {
 			if (t.gzip) throw Error("dictionary is not supported with gzip");
-			if (n = At(this.strm, r), n !== 0) throw Error(Ve[n]);
+			if (n = kt(this.strm, r), n !== 0) throw Error(Be[n]);
 		}
 	}
 	push(e, t = !1) {
 		let n = this.strm, r = this.options.chunkSize, i, a;
 		if (this.ended) return !1;
-		for (a = typeof t == "number" ? t : t === !0 ? 4 : 0, typeof e == "string" ? n.input = new TextEncoder().encode(e) : Gn.call(e) === "[object ArrayBuffer]" ? n.input = new Uint8Array(e) : n.input = e, n.next_in = 0, n.avail_in = n.input.length, this.started || (this.started = !0, this.onStart(n));;) {
+		for (a = typeof t == "number" ? t : t === !0 ? 4 : 0, typeof e == "string" ? n.input = new TextEncoder().encode(e) : Wn.call(e) === "[object ArrayBuffer]" ? n.input = new Uint8Array(e) : n.input = e, n.next_in = 0, n.avail_in = n.input.length, this.started || (this.started = !0, this.onStart(n));;) {
 			if (n.avail_out === 0 && (n.output = new Uint8Array(r), n.next_out = 0, n.avail_out = r), (a === 2 || a === 3) && n.avail_out <= 6) {
 				this.onData(n.output.subarray(0, n.next_out)), n.avail_out = 0;
 				continue;
 			}
-			if (i = Ot(n, a), i === 1) {
-				n.next_out > 0 && this.onData(n.output.subarray(0, n.next_out)), i = kt(this.strm);
+			if (i = Dt(n, a), i === 1) {
+				n.next_out > 0 && this.onData(n.output.subarray(0, n.next_out)), i = Ot(this.strm);
 				break;
 			}
 			if (n.avail_out === 0) {
@@ -1309,140 +1309,140 @@ var Pt = 15, Ft = 852, It = 592, Lt = 0, Rt = 1, zt = 2, Bt = new Uint16Array([
 			}
 			if (n.avail_in === 0) return !0;
 		}
-		return this.err = i, this.msg = n.msg || Ve[i], this.ended = !0, this.onEnd(i), i === 0;
+		return this.err = i, this.msg = n.msg || Be[i], this.ended = !0, this.onEnd(i), i === 0;
 	}
 	onStart(e) {}
 	onData(e) {
 		this.chunks.push(e);
 	}
 	onEnd(e) {
-		e === 0 && (this.result = Wn(this.chunks)), this.chunks = [];
+		e === 0 && (this.result = Un(this.chunks)), this.chunks = [];
 	}
 };
-function Jn(e, t = {}) {
-	let n = new qn(t);
+function qn(e, t = {}) {
+	let n = new Kn(t);
 	if (n.push(e, !0), n.err) throw Error(n.msg);
 	return n.result;
 }
-var Yn = Object.prototype.toString, Xn = {
+var Jn = Object.prototype.toString, Yn = {
 	chunkSize: 1024 * 64,
 	windowBits: 15,
 	raw: !1,
 	dictionary: /* @__PURE__ */ new Uint8Array()
-}, Zn = class {
+}, Xn = class {
 	constructor(e = {}) {
-		l(this, "options", void 0), l(this, "err", void 0), l(this, "msg", void 0), l(this, "ended", void 0), l(this, "started", void 0), l(this, "chunks", void 0), l(this, "strm", void 0), l(this, "result", void 0), this.options = Object.assign({}, Xn, e);
+		l(this, "options", void 0), l(this, "err", void 0), l(this, "msg", void 0), l(this, "ended", void 0), l(this, "started", void 0), l(this, "chunks", void 0), l(this, "strm", void 0), l(this, "result", void 0), this.options = Object.assign({}, Yn, e);
 		let t = this.options;
-		t.raw && t.windowBits >= 0 && t.windowBits < 16 && (t.windowBits = -t.windowBits, t.windowBits === 0 && (t.windowBits = -15)), t.windowBits >= 0 && t.windowBits < 16 && !e.windowBits && (t.windowBits += 32), t.windowBits > 15 && t.windowBits < 48 && (t.windowBits & 15 || (t.windowBits |= 15)), this.err = 0, this.msg = "", this.ended = !1, this.started = !1, this.chunks = [], this.result = /* @__PURE__ */ new Uint8Array(), this.strm = new Un(), this.strm.avail_out = 0;
-		let n = Pn(this.strm, t.windowBits);
-		if (n !== 0) throw Error(Ve[n]);
-		Yn.call(t.dictionary) === "[object ArrayBuffer]" && (t.dictionary = new Uint8Array(t.dictionary));
+		t.raw && t.windowBits >= 0 && t.windowBits < 16 && (t.windowBits = -t.windowBits, t.windowBits === 0 && (t.windowBits = -15)), t.windowBits >= 0 && t.windowBits < 16 && !e.windowBits && (t.windowBits += 32), t.windowBits > 15 && t.windowBits < 48 && (t.windowBits & 15 || (t.windowBits |= 15)), this.err = 0, this.msg = "", this.ended = !1, this.started = !1, this.chunks = [], this.result = /* @__PURE__ */ new Uint8Array(), this.strm = new Hn(), this.strm.avail_out = 0;
+		let n = Nn(this.strm, t.windowBits);
+		if (n !== 0) throw Error(Be[n]);
+		Jn.call(t.dictionary) === "[object ArrayBuffer]" && (t.dictionary = new Uint8Array(t.dictionary));
 		let r = t.dictionary;
-		if (t.raw && r.length && (n = Hn(this.strm, r), n !== 0)) throw Error(Ve[n]);
+		if (t.raw && r.length && (n = Vn(this.strm, r), n !== 0)) throw Error(Be[n]);
 	}
 	push(e, t = !1) {
 		let n = this.strm, r = this.options.chunkSize, i, a, o;
 		if (this.ended) return this.err === 0;
-		for (a = typeof t == "number" ? t : t === !0 ? 4 : 0, Yn.call(e) === "[object ArrayBuffer]" ? n.input = new Uint8Array(e) : n.input = e, n.next_in = 0, n.avail_in = n.input.length, this.started || (this.started = !0, this.onStart(n));;) {
-			if (n.avail_out === 0 && (n.output = new Uint8Array(r), n.next_out = 0, n.avail_out = r), i = Bn(n, a), i === 2) {
+		for (a = typeof t == "number" ? t : t === !0 ? 4 : 0, Jn.call(e) === "[object ArrayBuffer]" ? n.input = new Uint8Array(e) : n.input = e, n.next_in = 0, n.avail_in = n.input.length, this.started || (this.started = !0, this.onStart(n));;) {
+			if (n.avail_out === 0 && (n.output = new Uint8Array(r), n.next_out = 0, n.avail_out = r), i = zn(n, a), i === 2) {
 				let e = this.options.dictionary;
-				e.length && (i = Hn(n, e), i === 0 ? i = Bn(n, a) : i === -3 && (i = 2));
+				e.length && (i = Vn(n, e), i === 0 ? i = zn(n, a) : i === -3 && (i = 2));
 			}
-			for (; n.avail_in > 0 && i === 1 && n.state.wrap & 2 && n.state.flags !== 0 && n.input[n.next_in] !== 0;) Mn(n), i = Bn(n, a);
+			for (; n.avail_in > 0 && i === 1 && n.state.wrap & 2 && n.state.flags !== 0 && n.input[n.next_in] !== 0;) jn(n), i = zn(n, a);
 			if (i === -2 || i === -3 || i === 2 || i === -4) break;
 			if (o = n.avail_out, n.next_out && (n.avail_out === 0 || i === 1 || a > 0) && (this.onData(n.output.length === n.next_out ? n.output : n.output.subarray(0, n.next_out)), n.avail_out = 0, n.next_out = 0), !((i === 0 || i === -5) && o === 0)) {
 				if (i === 1) {
-					i = Vn(this.strm);
+					i = Bn(this.strm);
 					break;
 				}
 				if (n.avail_in === 0) {
 					if (a === 4) {
-						i = Vn(this.strm), i === 0 && (i = -5);
+						i = Bn(this.strm), i === 0 && (i = -5);
 						break;
 					}
 					return !0;
 				}
 			}
 		}
-		return this.err = i, this.msg = n.msg || Ve[i], this.ended = !0, this.onEnd(i), i === 0;
+		return this.err = i, this.msg = n.msg || Be[i], this.ended = !0, this.onEnd(i), i === 0;
 	}
 	onStart(e) {}
 	onData(e) {
 		this.chunks.push(e);
 	}
 	onEnd(e) {
-		e === 0 && (this.result = Wn(this.chunks)), this.chunks = [];
+		e === 0 && (this.result = Un(this.chunks)), this.chunks = [];
 	}
 };
-function Qn(e, t = {}) {
-	let n = new Zn(t);
+function Zn(e, t = {}) {
+	let n = new Xn(t);
 	if (n.push(e, !0), n.err) throw Error(n.msg);
 	let r = n.result;
 	return t.toText ? new TextDecoder().decode(r) : r;
 }
 //#endregion
 //#region src/uuid.ts
-var V = Array.from({ length: 256 }).map((e, t) => (t + 256).toString(16).substr(1));
-function $n(e) {
-	return (V[e[0]] + V[e[1]] + V[e[2]] + V[e[3]] + "-" + V[e[4]] + V[e[5]] + "-" + V[e[6]] + V[e[7]] + "-" + V[e[8]] + V[e[9]] + "-" + V[e[10]] + V[e[11]] + V[e[12]] + V[e[13]] + V[e[14]] + V[e[15]]).toLowerCase();
+var H = Array.from({ length: 256 }).map((e, t) => (t + 256).toString(16).substr(1));
+function Qn(e) {
+	return (H[e[0]] + H[e[1]] + H[e[2]] + H[e[3]] + "-" + H[e[4]] + H[e[5]] + "-" + H[e[6]] + H[e[7]] + "-" + H[e[8]] + H[e[9]] + "-" + H[e[10]] + H[e[11]] + H[e[12]] + H[e[13]] + H[e[14]] + H[e[15]]).toLowerCase();
 }
-function er(e) {
+function $n(e) {
 	let t, n = /* @__PURE__ */ new Uint8Array(16);
 	return n[0] = (t = parseInt(e.slice(0, 8), 16)) >>> 24, n[1] = t >>> 16 & 255, n[2] = t >>> 8 & 255, n[3] = t & 255, n[4] = (t = parseInt(e.slice(9, 13), 16)) >>> 8, n[5] = t & 255, n[6] = (t = parseInt(e.slice(14, 18), 16)) >>> 8, n[7] = t & 255, n[8] = (t = parseInt(e.slice(19, 23), 16)) >>> 8, n[9] = t & 255, n[10] = (t = parseInt(e.slice(24, 36), 16)) / 1099511627776 & 255, n[11] = t / 4294967296 & 255, n[12] = t >>> 24 & 255, n[13] = t >>> 16 & 255, n[14] = t >>> 8 & 255, n[15] = t & 255, n;
 }
 //#endregion
 //#region src/brs/utils.ts
-var tr = /* @__PURE__ */ t({
-	BitReader: () => br,
-	BitWriter: () => xr,
-	bgra: () => H,
-	chunk: () => or,
-	concat: () => W,
-	isEqual: () => rr,
-	read: () => G,
-	subarray: () => ar,
-	write: () => K
+var er = /* @__PURE__ */ t({
+	BitReader: () => yr,
+	BitWriter: () => br,
+	bgra: () => U,
+	chunk: () => ar,
+	concat: () => G,
+	isEqual: () => nr,
+	read: () => K,
+	subarray: () => ir,
+	write: () => q
 });
-function nr(e) {
+function tr(e) {
 	return /^[\x00-\x7F]*$/.test(e);
 }
-var H = ([e, t, n, r]) => [
+var U = ([e, t, n, r]) => [
 	n,
 	t,
 	e,
 	r
 ];
-function rr(e, t) {
+function nr(e, t) {
 	return e.length === t.length && e.every((e, n) => t[n] === e);
 }
-function ir(e) {
+function rr(e) {
 	return e.brsOffset !== void 0;
 }
-function ar(e, t, n = !1) {
+function ir(e, t, n = !1) {
 	if (!(e instanceof Uint8Array)) throw Error(`Invalid data type in bytes reader (${typeof e})`);
 	let r;
-	ir(e) ? r = e : (r = e, r.brsOffset = 0);
+	rr(e) ? r = e : (r = e, r.brsOffset = 0);
 	let i = r[n ? "slice" : "subarray"](r.brsOffset, r.brsOffset + t);
 	return r.brsOffset += t, i;
 }
-function or(e, t) {
-	let n = e.length - (ir(e) ? e.brsOffset : 0), r = Array(Math.floor(n / t));
-	for (let i = 0; i < n / t; i++) r[i] = ar(e, t, !0);
+function ar(e, t) {
+	let n = e.length - (rr(e) ? e.brsOffset : 0), r = Array(Math.floor(n / t));
+	for (let i = 0; i < n / t; i++) r[i] = ir(e, t, !0);
 	return r;
 }
-function U(e, t = !0) {
-	let [n, r] = ar(e, 2);
+function W(e, t = !0) {
+	let [n, r] = ir(e, 2);
 	return t ? r << 8 | n : n << 8 | r;
 }
-function sr(e, t = !0) {
+function or(e, t = !0) {
 	let n = [e & 255, e >> 8 & 255];
 	return new Uint8Array(t ? n : n.reverse());
 }
-function cr(e, t = !0) {
-	let [n, r, i, a] = ar(e, 4);
+function sr(e, t = !0) {
+	let [n, r, i, a] = ir(e, 4);
 	return t ? a << 24 | i << 16 | r << 8 | n : n << 24 | r << 16 | i << 8 | a;
 }
-function lr(e, t = !0) {
+function cr(e, t = !0) {
 	let n = new Uint8Array([
 		e & 255,
 		e >> 8 & 255,
@@ -1451,64 +1451,64 @@ function lr(e, t = !0) {
 	]);
 	return t ? n : n.reverse();
 }
-function ur(e) {
-	let t = cr(e), n = cr(e);
+function lr(e) {
+	let t = sr(e), n = sr(e);
 	if (n < 0 || t < 0 || n >= t) throw Error(`Invalid compressed section size (comp: ${n}, uncomp: ${t})`);
-	return n === 0 ? ar(e, t) : Qn(ar(e, n));
+	return n === 0 ? ir(e, t) : Zn(ir(e, n));
 }
-function dr(...e) {
-	let t = W(...e);
-	return W(lr(t.length), lr(0), t);
+function ur(...e) {
+	let t = G(...e);
+	return G(cr(t.length), cr(0), t);
 }
-function fr(...e) {
-	let t = W(...e), n = Jn(t), r = t.length, i = n.length;
+function dr(...e) {
+	let t = G(...e), n = qn(t), r = t.length, i = n.length;
 	if (r > 2147483647) throw Error(`uncompressedSize (${r}) out of range`);
 	if (i > 2147483647) throw Error(`compressedSize (${i}) out of range`);
 	let a = i >= r;
-	return W(lr(r), lr(a ? 0 : i), a ? t : n);
+	return G(cr(r), cr(a ? 0 : i), a ? t : n);
 }
-function pr(e) {
-	let t = cr(e), n = t < 0, r = n ? -t * 2 : t;
+function fr(e) {
+	let t = sr(e), n = t < 0, r = n ? -t * 2 : t;
 	if (n) {
 		if (r % 2 != 0) throw Error("Invalid UCS-2 data size");
-		return String.fromCodePoint(...or(ar(e, r), 2).map((e) => U(e)));
+		return String.fromCodePoint(...ar(ir(e, r), 2).map((e) => W(e)));
 	} else {
-		let t = ar(e, r).subarray(0, -1);
+		let t = ir(e, r).subarray(0, -1);
 		return String.fromCharCode.apply(null, t);
 	}
 }
-function mr(e) {
-	return nr(e) ? W(lr(e.length + 1), new Uint8Array(e.split("").map((e) => e.charCodeAt(0))), new Uint8Array([0])) : W(lr(-e.length), new Uint8Array(e.split("").flatMap((e) => [e.charCodeAt(0) & 255, e.charCodeAt(0) >> 8])));
+function pr(e) {
+	return tr(e) ? G(cr(e.length + 1), new Uint8Array(e.split("").map((e) => e.charCodeAt(0))), new Uint8Array([0])) : G(cr(-e.length), new Uint8Array(e.split("").flatMap((e) => [e.charCodeAt(0) & 255, e.charCodeAt(0) >> 8])));
 }
-function hr(e) {
-	return $n(or(ar(e, 16), 4).flatMap(([e, t, n, r]) => [
+function mr(e) {
+	return Qn(ar(ir(e, 16), 4).flatMap(([e, t, n, r]) => [
 		r,
 		n,
 		t,
 		e
 	]));
 }
-function gr(e) {
-	return W(...or(er(e), 4).map(([e, t, n, r]) => new Uint8Array([
+function hr(e) {
+	return G(...ar($n(e), 4).map(([e, t, n, r]) => new Uint8Array([
 		r,
 		n,
 		t,
 		e
 	])));
 }
-function _r(e, t) {
-	let n = cr(e), r = Array(n);
+function gr(e, t) {
+	let n = sr(e), r = Array(n);
 	for (let i = 0; i < n; i++) r[i] = t(e);
 	return r;
 }
-function vr(e, t) {
-	let n = cr(e);
+function _r(e, t) {
+	let n = sr(e);
 	for (let r = 0; r < n; r++) t(e);
 }
-function yr(e, t) {
-	return W(lr(e.length), ...e.map((e) => t(e)));
+function vr(e, t) {
+	return G(cr(e.length), ...e.map((e) => t(e)));
 }
-var br = class {
+var yr = class {
 	constructor(e) {
 		this.pos = 0, this.buffer = e;
 	}
@@ -1555,36 +1555,36 @@ var br = class {
 		return this.bits(e * 8);
 	}
 	array(e) {
-		let t = cr(this.bytes(4)), n = Array(t);
+		let t = sr(this.bytes(4)), n = Array(t);
 		for (let r = 0; r < t; r++) n[r] = e(this);
 		return n;
 	}
 	each(e) {
-		let t = cr(this.bytes(4));
+		let t = sr(this.bytes(4));
 		for (let n = 0; n < t; n++) e(this);
 	}
 	string() {
-		let e = this.bytesArr(4), t = cr(new Uint8Array(e));
-		return t < 0 && (t = -t * 2), pr(new Uint8Array(e.concat(this.bytesArr(t))));
+		let e = this.bytesArr(4), t = sr(new Uint8Array(e));
+		return t < 0 && (t = -t * 2), fr(new Uint8Array(e.concat(this.bytesArr(t))));
 	}
 	float() {
 		let e = /* @__PURE__ */ new DataView(/* @__PURE__ */ new ArrayBuffer(4));
-		return e.setUint16(2, U(this.bytes(2))), e.setUint16(0, U(this.bytes(2))), e.getFloat32(0);
+		return e.setUint16(2, W(this.bytes(2))), e.setUint16(0, W(this.bytes(2))), e.getFloat32(0);
 	}
 	integer() {
 		let e = /* @__PURE__ */ new DataView(/* @__PURE__ */ new ArrayBuffer(4));
-		return e.setUint16(2, U(this.bytes(2))), e.setUint16(0, U(this.bytes(2))), e.getInt32(0);
+		return e.setUint16(2, W(this.bytes(2))), e.setUint16(0, W(this.bytes(2))), e.getInt32(0);
 	}
 	int64() {
 		let e = /* @__PURE__ */ new DataView(/* @__PURE__ */ new ArrayBuffer(8));
-		e.setUint16(6, U(this.bytes(2))), e.setUint16(4, U(this.bytes(2))), e.setUint16(2, U(this.bytes(2))), e.setUint16(0, U(this.bytes(2)));
+		e.setUint16(6, W(this.bytes(2))), e.setUint16(4, W(this.bytes(2))), e.setUint16(2, W(this.bytes(2))), e.setUint16(0, W(this.bytes(2)));
 		let t = e.getBigInt64(0);
 		if (t <= 1n << 64n) return Number(t);
 		throw Error(`Cannot read 64-bit integer ${t} as a JavaScript number...`);
 	}
 	double() {
 		let e = /* @__PURE__ */ new DataView(/* @__PURE__ */ new ArrayBuffer(8));
-		return e.setUint16(6, U(this.bytes(2))), e.setUint16(4, U(this.bytes(2))), e.setUint16(2, U(this.bytes(2))), e.setUint16(0, U(this.bytes(2))), e.getFloat64(0);
+		return e.setUint16(6, W(this.bytes(2))), e.setUint16(4, W(this.bytes(2))), e.setUint16(2, W(this.bytes(2))), e.setUint16(0, W(this.bytes(2))), e.getFloat64(0);
 	}
 	wireGraphVariant() {
 		let e = this.bytes(1)[0];
@@ -1602,12 +1602,12 @@ var br = class {
 			case "String":
 			case "Class":
 			case "Object": return this.string();
-			case "Boolean": return !!cr(this.bytes(4));
+			case "Boolean": return !!sr(this.bytes(4));
 			case "Integer": return this.integer();
 			case "Integer64": return this.int64();
 			case "Float": return this.float();
 			case "Double": return this.double();
-			case "Color": return H(this.bytesArr(4));
+			case "Color": return U(this.bytesArr(4));
 			case "Byte": return this.bytes(1)[0];
 			case "Rotator":
 			case "Rotator3d": return [
@@ -1631,7 +1631,7 @@ var br = class {
 		}
 		throw Error("Unknown unreal type " + e);
 	}
-}, xr = class {
+}, br = class {
 	constructor() {
 		this.buffer = [], this.cur = 0, this.bitNum = 0;
 	}
@@ -1666,10 +1666,10 @@ var br = class {
 		return this.align(), new Uint8Array(this.buffer);
 	}
 	finishSection() {
-		return this.align(), W(lr(this.buffer.length), new Uint8Array(this.buffer));
+		return this.align(), G(cr(this.buffer.length), new Uint8Array(this.buffer));
 	}
 	string(e) {
-		this.bytes(mr(e));
+		this.bytes(pr(e));
 	}
 	float(e) {
 		let t = /* @__PURE__ */ new Float32Array(1);
@@ -1724,7 +1724,7 @@ var br = class {
 		return e.bind(this)(), this;
 	}
 	array(e, t) {
-		return this.bytes(lr(e.length)), e.forEach(t.bind(this)), this;
+		return this.bytes(cr(e.length)), e.forEach(t.bind(this)), this;
 	}
 	each(e, t) {
 		return e.forEach(t.bind(this)), this;
@@ -1745,7 +1745,7 @@ var br = class {
 				return;
 			case "Boolean":
 				if (typeof t != "boolean") throw Error(`writing unreal type Boolean, did not receive boolean (${t})`);
-				this.bytes(lr(+!!t));
+				this.bytes(cr(+!!t));
 				return;
 			case "Float":
 				if (typeof t != "number") throw Error(`writing unreal type Float, did not receive float (${t})`);
@@ -1757,7 +1757,7 @@ var br = class {
 				return;
 			case "Color":
 				if (!Array.isArray(t) || t.length !== 4) throw Error(`writing unreal type Color, did not receive Array (${t})`);
-				this.bytes(H(t));
+				this.bytes(U(t));
 				return;
 			case "Rotator":
 			case "Rotator3d":
@@ -1800,38 +1800,38 @@ var br = class {
 		throw Error("Unknown unreal type " + e);
 	}
 };
-function W(...e) {
+function G(...e) {
 	let t = e.reduce((e, t) => e + t.length, 0), n = new Uint8Array(t), r = 0;
 	for (let t of e) n.set(t, r), r += t.length;
 	return n;
 }
-var G = {
-	bytes: ar,
-	u16: U,
+var K = {
+	bytes: ir,
+	u16: W,
+	i32: sr,
+	compressed: lr,
+	string: fr,
+	uuid: mr,
+	array: gr,
+	each: _r,
+	bits: (e) => new yr(e)
+}, q = {
+	u16: or,
 	i32: cr,
-	compressed: ur,
+	compressed: dr,
+	uncompressed: ur,
 	string: pr,
 	uuid: hr,
-	array: _r,
-	each: vr,
-	bits: (e) => new br(e)
-}, K = {
-	u16: sr,
-	i32: lr,
-	compressed: fr,
-	uncompressed: dr,
-	string: mr,
-	uuid: gr,
-	array: yr,
-	bits: () => new xr()
+	array: vr,
+	bits: () => new br()
 };
 //#endregion
 //#region src/brs/read.v1.ts
-function Sr(e, t = {}) {
-	let n = G.compressed(e), r = G.compressed(e), i = G.string(n), a = G.string(n), o = G.string(n), s = G.uuid(n), c = G.i32(n), l = G.array(r, G.string), u = G.array(r, G.string), d = G.array(r, (e) => H(Array.from(G.bytes(e, 4)))), f = [], p = Math.max(u.length, 2);
+function xr(e, t = {}) {
+	let n = K.compressed(e), r = K.compressed(e), i = K.string(n), a = K.string(n), o = K.string(n), s = K.uuid(n), c = K.i32(n), l = K.array(r, K.string), u = K.array(r, K.string), d = K.array(r, (e) => U(Array.from(K.bytes(e, 4)))), f = [], p = Math.max(u.length, 2);
 	if (t.bricks) {
 		f = Array(c);
-		let t = G.compressed(e), n = G.bits(t);
+		let t = K.compressed(e), n = K.bits(t);
 		for (let e = 0; !n.empty() && e < c; e++) {
 			n.align();
 			let t = n.int(p), r = n.bit() ? [
@@ -1846,7 +1846,7 @@ function Sr(e, t = {}) {
 				n.int_packed(),
 				n.int_packed(),
 				n.int_packed()
-			], a = n.int(24), o = (a >> 2) % 6, s = a & 3, c = n.bit(), l = n.bit(), u = n.bit() ? H(n.bytesArr(4)) : n.int(d.length);
+			], a = n.int(24), o = (a >> 2) % 6, s = a & 3, c = n.bit(), l = n.bit(), u = n.bit() ? U(n.bytesArr(4)) : n.int(d.length);
 			f[e] = {
 				asset_name_index: t,
 				size: r,
@@ -1876,23 +1876,23 @@ function Sr(e, t = {}) {
 }
 //#endregion
 //#region src/brs/read.v10.ts
-function Cr(e, t = {}) {
-	let n = G.i32(e), r = G.compressed(e), i = G.compressed(e), a = G.string(r), o = G.string(r), s = G.string(r), c = G.uuid(r), l = {
-		name: G.string(r),
-		id: G.uuid(r)
-	}, u = G.bytes(r, 8), d = G.i32(r), f = G.array(i, G.string), p = G.array(i, G.string), m = G.array(i, (e) => H(Array.from(G.bytes(e, 4)))), h = G.array(i, G.string), g = G.array(i, (e) => ({
-		id: G.uuid(e),
-		name: G.string(e),
-		bricks: G.i32(e)
-	})), _ = G.array(i, G.string), v = null;
-	if (G.bytes(e, 1)[0]) {
-		let n = G.i32(e);
-		t.preview ? v = G.bytes(e, n) : e.brsOffset += n;
+function Sr(e, t = {}) {
+	let n = K.i32(e), r = K.compressed(e), i = K.compressed(e), a = K.string(r), o = K.string(r), s = K.string(r), c = K.uuid(r), l = {
+		name: K.string(r),
+		id: K.uuid(r)
+	}, u = K.bytes(r, 8), d = K.i32(r), f = K.array(i, K.string), p = K.array(i, K.string), m = K.array(i, (e) => U(Array.from(K.bytes(e, 4)))), h = K.array(i, K.string), g = K.array(i, (e) => ({
+		id: K.uuid(e),
+		name: K.string(e),
+		bricks: K.i32(e)
+	})), _ = K.array(i, K.string), v = null;
+	if (K.bytes(e, 1)[0]) {
+		let n = K.i32(e);
+		t.preview ? v = K.bytes(e, n) : e.brsOffset += n;
 	}
 	let y = [], b = {}, x = Math.max(_.length, 2), S = Math.max(h.length, 2), C = Math.max(p.length, 2);
 	if (t.bricks) {
 		y = Array(d);
-		let t = G.compressed(e), n = G.bits(t);
+		let t = K.compressed(e), n = K.bits(t);
 		for (let e = 0; !n.empty() && e < d; e++) {
 			n.align();
 			let t = n.int(C), r = n.bit() ? [
@@ -1930,9 +1930,9 @@ function Cr(e, t = {}) {
 				components: {}
 			};
 		}
-		let r = G.compressed(e), i = Math.max(y.length, 2);
-		G.each(r, (e) => {
-			let t = G.string(e), n = G.bits(G.bytes(e, G.i32(e))), r = G.i32(n.bytes(4)), a = n.array(() => n.int(i)), o = n.array(() => [n.string(), n.string()]);
+		let r = K.compressed(e), i = Math.max(y.length, 2);
+		K.each(r, (e) => {
+			let t = K.string(e), n = K.bits(K.bytes(e, K.i32(e))), r = K.i32(n.bytes(4)), a = n.array(() => n.int(i)), o = n.array(() => [n.string(), n.string()]);
 			for (let e of a) {
 				let r = {};
 				for (let [e, t] of o) r[e] = n.unreal(t);
@@ -1970,24 +1970,24 @@ function Cr(e, t = {}) {
 }
 //#endregion
 //#region src/brs/read.v14.ts
-function wr(e, t = {}) {
-	let n = G.i32(e), r = G.compressed(e), i = G.compressed(e), a = G.string(r), o = G.string(r), s = G.string(r), c = G.uuid(r), l = {
-		name: G.string(r),
-		id: G.uuid(r)
-	}, u = G.bytes(r, 8), d = G.i32(r), f = G.array(i, G.string), p = G.array(i, G.string), m = G.array(i, (e) => H(Array.from(G.bytes(e, 4)))), h = G.array(i, G.string), g = G.array(i, (e) => ({
-		id: G.uuid(e),
-		name: G.string(e),
-		display_name: G.string(e),
-		bricks: G.i32(e)
-	})), _ = G.array(i, G.string), v = null;
-	if (G.bytes(e, 1)[0]) {
-		let n = G.i32(e);
-		t.preview ? v = G.bytes(e, n) : e.brsOffset += n;
+function Cr(e, t = {}) {
+	let n = K.i32(e), r = K.compressed(e), i = K.compressed(e), a = K.string(r), o = K.string(r), s = K.string(r), c = K.uuid(r), l = {
+		name: K.string(r),
+		id: K.uuid(r)
+	}, u = K.bytes(r, 8), d = K.i32(r), f = K.array(i, K.string), p = K.array(i, K.string), m = K.array(i, (e) => U(Array.from(K.bytes(e, 4)))), h = K.array(i, K.string), g = K.array(i, (e) => ({
+		id: K.uuid(e),
+		name: K.string(e),
+		display_name: K.string(e),
+		bricks: K.i32(e)
+	})), _ = K.array(i, K.string), v = null;
+	if (K.bytes(e, 1)[0]) {
+		let n = K.i32(e);
+		t.preview ? v = K.bytes(e, n) : e.brsOffset += n;
 	}
 	let y = [], b = {}, x = [], S = Math.max(_.length, 2), C = Math.max(h.length, 2), w = Math.max(p.length, 2);
 	if (t.bricks) {
 		y = Array(d);
-		let t = G.compressed(e), n = G.bits(t);
+		let t = K.compressed(e), n = K.bits(t);
 		for (let e = 0; !n.empty() && e < d; e++) {
 			n.align();
 			let t = n.int(w), r = n.bit() ? [
@@ -2025,9 +2025,9 @@ function wr(e, t = {}) {
 				components: {}
 			};
 		}
-		let r = G.compressed(e), i = G.compressed(e), a = Math.max(y.length, 2), o = [];
-		G.each(r, (e) => {
-			let t = G.string(e), n = G.bits(G.bytes(e, G.i32(e))), r = G.i32(n.bytes(4)), i = n.array(() => n.int(a)), s = n.array(() => [n.string(), n.string()]);
+		let r = K.compressed(e), i = K.compressed(e), a = Math.max(y.length, 2), o = [];
+		K.each(r, (e) => {
+			let t = K.string(e), n = K.bits(K.bytes(e, K.i32(e))), r = K.i32(n.bytes(4)), i = n.array(() => n.int(a)), s = n.array(() => [n.string(), n.string()]);
 			for (let e of i) {
 				let r = {};
 				for (let [e, t] of s) r[e] = n.unreal(t);
@@ -2041,7 +2041,7 @@ function wr(e, t = {}) {
 		});
 		let s = Math.max(o.length, 2);
 		{
-			let e = G.bits(i), t = e.int(4294967295);
+			let e = K.bits(i), t = e.int(4294967295);
 			for (let n = 0; n < t; n++) {
 				let t = e.int(a), n = e.int(s), r = e.string(), i = e.int(a), c = e.int(s), l = e.string();
 				e.bit(), e.align(), x.push({
@@ -2085,11 +2085,11 @@ function wr(e, t = {}) {
 }
 //#endregion
 //#region src/brs/read.v2.ts
-function Tr(e, t = {}) {
-	let n = G.compressed(e), r = G.compressed(e), i = G.string(n), a = G.string(n), o = G.string(n), s = G.uuid(n), c = G.i32(n), l = G.array(r, G.string), u = G.array(r, G.string), d = G.array(r, (e) => H(Array.from(G.bytes(e, 4)))), f = G.array(r, G.string), p = [], m = Math.max(u.length, 2);
+function wr(e, t = {}) {
+	let n = K.compressed(e), r = K.compressed(e), i = K.string(n), a = K.string(n), o = K.string(n), s = K.uuid(n), c = K.i32(n), l = K.array(r, K.string), u = K.array(r, K.string), d = K.array(r, (e) => U(Array.from(K.bytes(e, 4)))), f = K.array(r, K.string), p = [], m = Math.max(u.length, 2);
 	if (t.bricks) {
 		p = Array(c);
-		let t = G.compressed(e), n = G.bits(t);
+		let t = K.compressed(e), n = K.bits(t);
 		for (let e = 0; !n.empty() && e < c; e++) {
 			n.align();
 			let t = n.int(m), r = n.bit() ? [
@@ -2104,7 +2104,7 @@ function Tr(e, t = {}) {
 				n.int_packed(),
 				n.int_packed(),
 				n.int_packed()
-			], a = n.int(24), o = (a >> 2) % 6, s = a & 3, c = n.bit(), l = n.bit(), u = n.bit() ? n.uint_packed() : 1, f = n.bit() ? H(n.bytesArr(4)) : n.int(d.length);
+			], a = n.int(24), o = (a >> 2) % 6, s = a & 3, c = n.bit(), l = n.bit(), u = n.bit() ? n.uint_packed() : 1, f = n.bit() ? U(n.bytesArr(4)) : n.int(d.length);
 			p[e] = {
 				asset_name_index: t,
 				size: r,
@@ -2136,14 +2136,14 @@ function Tr(e, t = {}) {
 }
 //#endregion
 //#region src/brs/read.v3.ts
-function Er(e, t = {}) {
-	let n = G.compressed(e), r = G.compressed(e), i = G.string(n), a = G.string(n), o = G.string(n), s = G.uuid(n), c = G.i32(n), l = G.array(r, G.string), u = G.array(r, G.string), d = G.array(r, (e) => H(Array.from(G.bytes(e, 4)))), f = G.array(r, G.string), p = G.array(r, (e) => ({
-		id: G.uuid(e),
-		name: G.string(e)
+function Tr(e, t = {}) {
+	let n = K.compressed(e), r = K.compressed(e), i = K.string(n), a = K.string(n), o = K.string(n), s = K.uuid(n), c = K.i32(n), l = K.array(r, K.string), u = K.array(r, K.string), d = K.array(r, (e) => U(Array.from(K.bytes(e, 4)))), f = K.array(r, K.string), p = K.array(r, (e) => ({
+		id: K.uuid(e),
+		name: K.string(e)
 	})), m = [], h = Math.max(u.length, 2);
 	if (t.bricks) {
 		m = Array(c);
-		let t = G.compressed(e), n = G.bits(t);
+		let t = K.compressed(e), n = K.bits(t);
 		for (let e = 0; !n.empty() && e < c; e++) {
 			n.align();
 			let t = n.int(h), r = n.bit() ? [
@@ -2158,7 +2158,7 @@ function Er(e, t = {}) {
 				n.int_packed(),
 				n.int_packed(),
 				n.int_packed()
-			], a = n.int(24), o = (a >> 2) % 6, s = a & 3, c = n.bit(), l = n.bit(), u = n.bit() ? n.uint_packed() : 1, f = n.bit() ? H(n.bytesArr(4)) : n.int(d.length), p = n.uint_packed();
+			], a = n.int(24), o = (a >> 2) % 6, s = a & 3, c = n.bit(), l = n.bit(), u = n.bit() ? n.uint_packed() : 1, f = n.bit() ? U(n.bytesArr(4)) : n.int(d.length), p = n.uint_packed();
 			m[e] = {
 				asset_name_index: t,
 				size: r,
@@ -2192,14 +2192,14 @@ function Er(e, t = {}) {
 }
 //#endregion
 //#region src/brs/read.v4.ts
-function Dr(e, t = {}) {
-	let n = G.compressed(e), r = G.compressed(e), i = G.string(n), a = G.string(n), o = G.string(n), s = G.uuid(n), c = G.bytes(n, 8), l = G.i32(n), u = G.array(r, G.string), d = G.array(r, G.string), f = G.array(r, (e) => H(Array.from(G.bytes(e, 4)))), p = G.array(r, G.string), m = G.array(r, (e) => ({
-		id: G.uuid(e),
-		name: G.string(e)
+function Er(e, t = {}) {
+	let n = K.compressed(e), r = K.compressed(e), i = K.string(n), a = K.string(n), o = K.string(n), s = K.uuid(n), c = K.bytes(n, 8), l = K.i32(n), u = K.array(r, K.string), d = K.array(r, K.string), f = K.array(r, (e) => U(Array.from(K.bytes(e, 4)))), p = K.array(r, K.string), m = K.array(r, (e) => ({
+		id: K.uuid(e),
+		name: K.string(e)
 	})), h = [], g = Math.max(d.length, 2);
 	if (t.bricks) {
 		h = Array(l);
-		let t = G.compressed(e), n = G.bits(t);
+		let t = K.compressed(e), n = K.bits(t);
 		for (let e = 0; !n.empty() && e < l; e++) {
 			n.align();
 			let t = n.int(g), r = n.bit() ? [
@@ -2214,7 +2214,7 @@ function Dr(e, t = {}) {
 				n.int_packed(),
 				n.int_packed(),
 				n.int_packed()
-			], a = n.int(24), o = (a >> 2) % 6, s = a & 3, c = n.bit(), l = n.bit(), u = n.bit() ? n.uint_packed() : 1, d = n.bit() ? H(n.bytesArr(4)) : n.int(f.length), p = n.uint_packed();
+			], a = n.int(24), o = (a >> 2) % 6, s = a & 3, c = n.bit(), l = n.bit(), u = n.bit() ? n.uint_packed() : 1, d = n.bit() ? U(n.bytesArr(4)) : n.int(f.length), p = n.uint_packed();
 			h[e] = {
 				asset_name_index: t,
 				size: r,
@@ -2249,23 +2249,23 @@ function Dr(e, t = {}) {
 }
 //#endregion
 //#region src/brs/read.v8.ts
-function Or(e, t = {}) {
-	let n = G.i32(e), r = G.compressed(e), i = G.compressed(e), a = G.string(r), o = G.string(r), s = G.string(r), c = G.uuid(r), l = {
-		name: G.string(r),
-		id: G.uuid(r)
-	}, u = G.bytes(r, 8), d = G.i32(r), f = G.array(i, G.string), p = G.array(i, G.string), m = G.array(i, (e) => H(Array.from(G.bytes(e, 4)))), h = G.array(i, G.string), g = G.array(i, (e) => ({
-		id: G.uuid(e),
-		name: G.string(e),
-		bricks: G.i32(e)
+function Dr(e, t = {}) {
+	let n = K.i32(e), r = K.compressed(e), i = K.compressed(e), a = K.string(r), o = K.string(r), s = K.string(r), c = K.uuid(r), l = {
+		name: K.string(r),
+		id: K.uuid(r)
+	}, u = K.bytes(r, 8), d = K.i32(r), f = K.array(i, K.string), p = K.array(i, K.string), m = K.array(i, (e) => U(Array.from(K.bytes(e, 4)))), h = K.array(i, K.string), g = K.array(i, (e) => ({
+		id: K.uuid(e),
+		name: K.string(e),
+		bricks: K.i32(e)
 	})), _ = null;
-	if (G.bytes(e, 1)[0]) {
-		let n = G.i32(e);
-		t.preview ? _ = G.bytes(e, n) : e.brsOffset += n;
+	if (K.bytes(e, 1)[0]) {
+		let n = K.i32(e);
+		t.preview ? _ = K.bytes(e, n) : e.brsOffset += n;
 	}
 	let v = [], y = {}, b = Math.max(h.length, 2), x = Math.max(p.length, 2);
 	if (t.bricks) {
 		v = Array(d);
-		let t = G.compressed(e), n = G.bits(t);
+		let t = K.compressed(e), n = K.bits(t);
 		for (let e = 0; !n.empty() && e < d; e++) {
 			n.align();
 			let t = n.int(x), r = n.bit() ? [
@@ -2280,7 +2280,7 @@ function Or(e, t = {}) {
 				n.int_packed(),
 				n.int_packed(),
 				n.int_packed()
-			], a = n.int(24), o = (a >> 2) % 6, s = a & 3, c = n.bit(), l = n.bit(), u = n.int(b), d = n.bit() ? H(n.bytesArr(4)) : n.int(m.length), f = n.uint_packed();
+			], a = n.int(24), o = (a >> 2) % 6, s = a & 3, c = n.bit(), l = n.bit(), u = n.int(b), d = n.bit() ? U(n.bytesArr(4)) : n.int(m.length), f = n.uint_packed();
 			v[e] = {
 				asset_name_index: t,
 				size: r,
@@ -2295,9 +2295,9 @@ function Or(e, t = {}) {
 				components: {}
 			};
 		}
-		let r = G.compressed(e), i = Math.max(v.length, 2);
-		G.each(r, (e) => {
-			let t = G.string(e), n = G.bits(G.bytes(e, G.i32(e))), r = G.i32(n.bytes(4)), a = n.array(() => n.int(i)), o = n.array(() => [n.string(), n.string()]);
+		let r = K.compressed(e), i = Math.max(v.length, 2);
+		K.each(r, (e) => {
+			let t = K.string(e), n = K.bits(K.bytes(e, K.i32(e))), r = K.i32(n.bytes(4)), a = n.array(() => n.int(i)), o = n.array(() => [n.string(), n.string()]);
 			for (let e of a) {
 				let r = {};
 				for (let [e, t] of o) r[e] = n.unreal(t);
@@ -2334,23 +2334,23 @@ function Or(e, t = {}) {
 }
 //#endregion
 //#region src/brs/read.v9.ts
-function kr(e, t = {}) {
-	let n = G.i32(e), r = G.compressed(e), i = G.compressed(e), a = G.string(r), o = G.string(r), s = G.string(r), c = G.uuid(r), l = {
-		name: G.string(r),
-		id: G.uuid(r)
-	}, u = G.bytes(r, 8), d = G.i32(r), f = G.array(i, G.string), p = G.array(i, G.string), m = G.array(i, (e) => H(Array.from(G.bytes(e, 4)))), h = G.array(i, G.string), g = G.array(i, (e) => ({
-		id: G.uuid(e),
-		name: G.string(e),
-		bricks: G.i32(e)
-	})), _ = G.array(i, G.string), v = null;
-	if (G.bytes(e, 1)[0]) {
-		let n = G.i32(e);
-		t.preview ? v = G.bytes(e, n) : e.brsOffset += n;
+function Or(e, t = {}) {
+	let n = K.i32(e), r = K.compressed(e), i = K.compressed(e), a = K.string(r), o = K.string(r), s = K.string(r), c = K.uuid(r), l = {
+		name: K.string(r),
+		id: K.uuid(r)
+	}, u = K.bytes(r, 8), d = K.i32(r), f = K.array(i, K.string), p = K.array(i, K.string), m = K.array(i, (e) => U(Array.from(K.bytes(e, 4)))), h = K.array(i, K.string), g = K.array(i, (e) => ({
+		id: K.uuid(e),
+		name: K.string(e),
+		bricks: K.i32(e)
+	})), _ = K.array(i, K.string), v = null;
+	if (K.bytes(e, 1)[0]) {
+		let n = K.i32(e);
+		t.preview ? v = K.bytes(e, n) : e.brsOffset += n;
 	}
 	let y = [], b = {}, x = Math.max(_.length, 2), S = Math.max(h.length, 2), C = Math.max(p.length, 2);
 	if (t.bricks) {
 		y = Array(d);
-		let t = G.compressed(e), n = G.bits(t);
+		let t = K.compressed(e), n = K.bits(t);
 		for (let e = 0; !n.empty() && e < d; e++) {
 			n.align();
 			let t = n.int(C), r = n.bit() ? [
@@ -2382,9 +2382,9 @@ function kr(e, t = {}) {
 				components: {}
 			};
 		}
-		let r = G.compressed(e), i = Math.max(y.length, 2);
-		G.each(r, (e) => {
-			let t = G.string(e), n = G.bits(G.bytes(e, G.i32(e))), r = G.i32(n.bytes(4)), a = n.array(() => n.int(i)), o = n.array(() => [n.string(), n.string()]);
+		let r = K.compressed(e), i = Math.max(y.length, 2);
+		K.each(r, (e) => {
+			let t = K.string(e), n = K.bits(K.bytes(e, K.i32(e))), r = K.i32(n.bytes(4)), a = n.array(() => n.int(i)), o = n.array(() => [n.string(), n.string()]);
 			for (let e of a) {
 				let r = {};
 				for (let [e, t] of o) r[e] = n.unreal(t);
@@ -2422,27 +2422,27 @@ function kr(e, t = {}) {
 }
 //#endregion
 //#region src/brs/read.ts
-function Ar(e, t = {}) {
+function kr(e, t = {}) {
 	if (typeof t != "object") throw Error("Invalid options");
 	if (typeof t.bricks != "boolean" && (t.bricks = !0), typeof t.preview != "boolean" && (t.preview = !1), e[0] !== r[0] || e[1] !== r[1] || e[2] !== r[2]) throw Error("Invalid starting bytes");
 	let n = e;
 	n.brsOffset = 3;
-	let i = G.u16(n);
+	let i = K.u16(n);
 	switch (i) {
-		case 1: return Sr(n, t);
-		case 2: return Tr(n, t);
-		case 3: return Er(n, t);
-		case 4: return Dr(n, t);
-		case 8: return Or(n, t);
-		case 9: return kr(n, t);
-		case 10: return Cr(n, t);
-		case 14: return wr(n, t);
+		case 1: return xr(n, t);
+		case 2: return wr(n, t);
+		case 3: return Tr(n, t);
+		case 4: return Er(n, t);
+		case 8: return Dr(n, t);
+		case 9: return Or(n, t);
+		case 10: return Sr(n, t);
+		case 14: return Cr(n, t);
 		default: throw Error("Unsupported version " + i);
 	}
 }
 //#endregion
 //#region src/brs/write.ts
-var jr = new Uint8Array([]), Mr = {
+var Ar = new Uint8Array([]), jr = {
 	BCD_SpotLight: {
 		version: 1,
 		properties: {
@@ -2747,11 +2747,11 @@ var jr = new Uint8Array([]), Mr = {
 		}
 	}
 };
-function Nr(e, t = {}) {
+function Mr(e, t = {}) {
 	if (typeof e != "object") throw Error("Expected save to be an object");
 	if (!Array.isArray(e.bricks) || e.bricks.length === 0) throw Error("Expected save to have bricks field");
 	if (e.bricks.length > 2147483647) throw Error("Brick count out of range");
-	let n = t.compress ? K.compressed : K.uncompressed, i = ([e, t, n, r]) => new Uint8Array([
+	let n = t.compress ? q.compressed : q.uncompressed, i = ([e, t, n, r]) => new Uint8Array([
 		n,
 		t,
 		e,
@@ -2759,7 +2759,7 @@ function Nr(e, t = {}) {
 	]), o = {}, s = Math.max(e.colors?.length ?? 0, 2), c = Math.max(e.brick_assets?.length ?? 0, 2), l = Math.max(e.materials?.length ?? 0, 2), u = Math.max(e.physical_materials?.length ?? 0, 2);
 	if (e.preview && !Array.isArray(e.preview)) throw Error("Expected preview to be an array");
 	let d = {}, f = 0;
-	return W(r, K.u16(14), K.i32(e.game_version ?? 0), n(K.string(e.map ?? "Unknown"), K.string(e.author?.name ?? "Unknown"), K.string(e.description ?? ""), K.uuid(e.author?.id ?? "00000000-0000-0000-0000-000000000000"), W(K.string(e.host?.name ?? "Unknown"), K.uuid(e.host?.id ?? "00000000-0000-0000-0000-000000000000")), new Uint8Array(e.save_time && (Array.isArray(e.save_time) || e.save_time instanceof Uint8Array) && e.save_time.length === 8 ? e.save_time : [
+	return G(r, q.u16(14), q.i32(e.game_version ?? 0), n(q.string(e.map ?? "Unknown"), q.string(e.author?.name ?? "Unknown"), q.string(e.description ?? ""), q.uuid(e.author?.id ?? "00000000-0000-0000-0000-000000000000"), G(q.string(e.host?.name ?? "Unknown"), q.uuid(e.host?.id ?? "00000000-0000-0000-0000-000000000000")), new Uint8Array(e.save_time && (Array.isArray(e.save_time) || e.save_time instanceof Uint8Array) && e.save_time.length === 8 ? e.save_time : [
 		0,
 		0,
 		0,
@@ -2768,12 +2768,12 @@ function Nr(e, t = {}) {
 		0,
 		0,
 		0
-	]), K.i32(e.bricks.length)), n(K.array(e.mods ?? [], K.string), K.array(e.brick_assets ?? ["PB_DefaultBrick"], K.string), K.array(e.colors ?? [], i), K.array(e.materials ?? ["BMC_Plastic"], K.string), K.array(e.brick_owners ?? [], ({ id: e = a, name: t = "Unknown", display_name: n = "Unknown", bricks: r = 0 }) => W(K.uuid(e), K.string(t), K.string(n), K.i32(r))), K.array(e.physical_materials ?? ["BPMC_Default"], K.string)), W(new Uint8Array([+!!e.preview]), e.preview ? K.i32(e.preview.length) : jr, e.preview ?? jr), n(K.bits().each(e.bricks, function(e, t) {
+	]), q.i32(e.bricks.length)), n(q.array(e.mods ?? [], q.string), q.array(e.brick_assets ?? ["PB_DefaultBrick"], q.string), q.array(e.colors ?? [], i), q.array(e.materials ?? ["BMC_Plastic"], q.string), q.array(e.brick_owners ?? [], ({ id: e = a, name: t = "Unknown", display_name: n = "Unknown", bricks: r = 0 }) => G(q.uuid(e), q.string(t), q.string(n), q.i32(r))), q.array(e.physical_materials ?? ["BPMC_Default"], q.string)), G(new Uint8Array([+!!e.preview]), e.preview ? q.i32(e.preview.length) : Ar, e.preview ?? Ar), n(q.bits().each(e.bricks, function(e, t) {
 		if (typeof e != "object") throw Error(`Expected save.bricks[${t}] to be an object`);
 		if (!Array.isArray(e.size) || e.size.length !== 3) throw Error(`Expected save.bricks[${t}].size to be an array of length 3`);
 		if (!Array.isArray(e.position) || e.position.length !== 3) throw Error(`Expected save.bricks[${t}].position to be an array of length 3`);
 		this.align(), this.int(e.asset_name_index ?? 0, c);
-		let n = e.size === null || rr(e.size, [
+		let n = e.size === null || nr(e.size, [
 			0,
 			0,
 			0
@@ -2789,9 +2789,9 @@ function Nr(e, t = {}) {
 		}
 		this.uint_packed(e.owner_index >= 0 ? e.owner_index : 0);
 		for (let n in e.components ?? {}) o[n] ?? (o[n] = []), o[n].push(t);
-	}).finish()), n(K.array(Object.keys(e.components ?? Mr).filter((e) => o[e]), (t) => W(K.string(t), K.bits().self(function() {
-		let n = e.components?.[t] ?? Mr[t], r = o[t], i = Object.entries(n.properties);
-		t in d || (d[t] = f, f++), this.bytes(K.i32(n.version)), this.array(r, (t) => {
+	}).finish()), n(q.array(Object.keys(e.components ?? jr).filter((e) => o[e]), (t) => G(q.string(t), q.bits().self(function() {
+		let n = e.components?.[t] ?? jr[t], r = o[t], i = Object.entries(n.properties);
+		t in d || (d[t] = f, f++), this.bytes(q.i32(n.version)), this.array(r, (t) => {
 			this.int(t, Math.max(e.bricks.length, 2));
 		}), this.array(i, ([e, t]) => {
 			this.string(e), this.string(t);
@@ -2801,7 +2801,7 @@ function Nr(e, t = {}) {
 			this.unreal(a, e.bricks[n].components[t][r]);
 		}
 		this.align();
-	}).finishSection()))), n(K.bits().self(function() {
+	}).finishSection()))), n(q.bits().self(function() {
 		let t = 4294967295;
 		if (!e.wires || !Array.isArray(e.wires) || e.wires.length === 0) {
 			this.int(0, t);
@@ -2820,30 +2820,20 @@ function Nr(e, t = {}) {
 }
 //#endregion
 //#region src/brs/types.ts
-var Pr = /* @__PURE__ */ t({
-	Direction: () => Fr,
-	Rotation: () => Ir
-}), Fr = /* @__PURE__ */ function(e) {
+var Nr = /* @__PURE__ */ t({
+	Direction: () => Pr,
+	Rotation: () => Fr
+}), Pr = /* @__PURE__ */ function(e) {
 	return e[e.XPositive = 0] = "XPositive", e[e.XNegative = 1] = "XNegative", e[e.YPositive = 2] = "YPositive", e[e.YNegative = 3] = "YNegative", e[e.ZPositive = 4] = "ZPositive", e[e.ZNegative = 5] = "ZNegative", e;
-}({}), Ir = /* @__PURE__ */ function(e) {
+}({}), Fr = /* @__PURE__ */ function(e) {
 	return e[e.Deg0 = 0] = "Deg0", e[e.Deg90 = 1] = "Deg90", e[e.Deg180 = 2] = "Deg180", e[e.Deg270 = 3] = "Deg270", e;
-}({}), Lr = (e, t) => ((e.Flags[t >> 3] ?? 0) >> (t & 7) & 1) == 1, Rr = class {
-	constructor() {
-		this.bytes = [], this.bits = 0;
-	}
-	push(e) {
-		this.bits >= this.bytes.length * 8 && this.bytes.push(0), e && (this.bytes[this.bits >> 3] |= 1 << (this.bits & 7)), this.bits += 1;
-	}
-	toValue() {
-		return { Flags: this.bytes };
-	}
-};
+}({});
 //#endregion
 //#region node_modules/@noble/hashes/utils.js
-function zr(e) {
+function Ir(e) {
 	return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array" && "BYTES_PER_ELEMENT" in e && e.BYTES_PER_ELEMENT === 1;
 }
-function Br(e, t = "") {
+function Lr(e, t = "") {
 	if (typeof e != "number") {
 		let n = t && `"${t}" `;
 		throw TypeError(`${n}expected number, got ${typeof e}`);
@@ -2853,61 +2843,61 @@ function Br(e, t = "") {
 		throw RangeError(`${n}expected integer >= 0, got ${e}`);
 	}
 }
-function Vr(e, t, n = "") {
-	let r = zr(e), i = e?.length, a = t !== void 0;
+function Rr(e, t, n = "") {
+	let r = Ir(e), i = e?.length, a = t !== void 0;
 	if (!r || a && i !== t) {
 		let o = n && `"${n}" `, s = a ? ` of length ${t}` : "", c = r ? `length=${i}` : `type=${typeof e}`, l = o + "expected Uint8Array" + s + ", got " + c;
 		throw r ? RangeError(l) : TypeError(l);
 	}
 	return e;
 }
-function Hr(e) {
-	return Uint8Array.from(Vr(e));
+function zr(e) {
+	return Uint8Array.from(Rr(e));
 }
-function Ur(e, t = !0) {
+function Br(e, t = !0) {
 	if (e.destroyed) throw Error("Hash instance has been destroyed");
 	if (t && e.finished) throw Error("Hash#digest() has already been called");
 }
-function Wr(e, t) {
-	Vr(e, void 0, "digestInto() output");
+function Vr(e, t) {
+	Rr(e, void 0, "digestInto() output");
 	let n = t.outputLen;
 	if (e.length < n) throw RangeError("\"digestInto() output\" expected to be of length >=" + n);
 }
-function Gr(e) {
+function Hr(e) {
 	return new Uint8Array(e.buffer, e.byteOffset, e.byteLength);
 }
-function Kr(e) {
+function Ur(e) {
 	return new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4));
 }
-function qr(...e) {
+function Wr(...e) {
 	for (let t = 0; t < e.length; t++) e[t].fill(0);
 }
-function Jr(e, t) {
+function Gr(e, t) {
 	return e << 32 - t | e >>> t;
 }
-var Yr = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-function Xr(e) {
+var Kr = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+function qr(e) {
 	return e << 24 & 4278190080 | e << 8 & 16711680 | e >>> 8 & 65280 | e >>> 24 & 255;
 }
-var Zr = Yr ? (e) => e : (e) => Xr(e) >>> 0;
-function Qr(e) {
-	for (let t = 0; t < e.length; t++) e[t] = Xr(e[t]);
+var Jr = Kr ? (e) => e : (e) => qr(e) >>> 0;
+function Yr(e) {
+	for (let t = 0; t < e.length; t++) e[t] = qr(e[t]);
 	return e;
 }
-var q = Yr ? (e) => e : Qr, $r = typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function", ei = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
-function ti(e) {
-	if (Vr(e), $r) return e.toHex();
+var Xr = Kr ? (e) => e : Yr, Zr = typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function", Qr = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
+function $r(e) {
+	if (Rr(e), Zr) return e.toHex();
 	let t = "";
-	for (let n = 0; n < e.length; n++) t += ei[e[n]];
+	for (let n = 0; n < e.length; n++) t += Qr[e[n]];
 	return t;
 }
-function ni(e, t = {}) {
+function ei(e, t = {}) {
 	let n = (t, n) => e(n).update(t).digest(), r = e(void 0);
 	return n.outputLen = r.outputLen, n.blockLen = r.blockLen, n.canXOF = r.canXOF, n.create = (t) => e(t), Object.assign(n, t), Object.freeze(n);
 }
 //#endregion
 //#region node_modules/@noble/hashes/_md.js
-var ri = /* @__PURE__ */ Uint32Array.from([
+var ti = /* @__PURE__ */ Uint32Array.from([
 	1779033703,
 	3144134277,
 	1013904242,
@@ -2916,28 +2906,28 @@ var ri = /* @__PURE__ */ Uint32Array.from([
 	2600822924,
 	528734635,
 	1541459225
-]), ii = /* @__PURE__ */ BigInt(2 ** 32 - 1), ai = /* @__PURE__ */ BigInt(32);
-function oi(e, t = !1) {
+]), ni = /* @__PURE__ */ BigInt(2 ** 32 - 1), ri = /* @__PURE__ */ BigInt(32);
+function ii(e, t = !1) {
 	return t ? {
-		h: Number(e & ii),
-		l: Number(e >> ai & ii)
+		h: Number(e & ni),
+		l: Number(e >> ri & ni)
 	} : {
-		h: Number(e >> ai & ii) | 0,
-		l: Number(e & ii) | 0
+		h: Number(e >> ri & ni) | 0,
+		l: Number(e & ni) | 0
 	};
 }
 //#endregion
 //#region node_modules/@noble/hashes/_blake.js
-function si(e, t, n, r, i) {
-	return e = e + t + i | 0, r = Jr(r ^ e, 16), n = n + r | 0, t = Jr(t ^ n, 12), {
+function ai(e, t, n, r, i) {
+	return e = e + t + i | 0, r = Gr(r ^ e, 16), n = n + r | 0, t = Gr(t ^ n, 12), {
 		a: e,
 		b: t,
 		c: n,
 		d: r
 	};
 }
-function ci(e, t, n, r, i) {
-	return e = e + t + i | 0, r = Jr(r ^ e, 8), n = n + r | 0, t = Jr(t ^ n, 7), {
+function oi(e, t, n, r, i) {
+	return e = e + t + i | 0, r = Gr(r ^ e, 8), n = n + r | 0, t = Gr(t ^ n, 7), {
 		a: e,
 		b: t,
 		c: n,
@@ -2946,21 +2936,21 @@ function ci(e, t, n, r, i) {
 }
 //#endregion
 //#region node_modules/@noble/hashes/blake2.js
-var li = class {
+var si = class {
 	constructor(e, t) {
-		l(this, "buffer", void 0), l(this, "buffer32", void 0), l(this, "finished", !1), l(this, "destroyed", !1), l(this, "length", 0), l(this, "pos", 0), l(this, "blockLen", void 0), l(this, "outputLen", void 0), l(this, "canXOF", !1), Br(e), Br(t), this.blockLen = e, this.outputLen = t, this.buffer = new Uint8Array(e), this.buffer32 = Kr(this.buffer);
+		l(this, "buffer", void 0), l(this, "buffer32", void 0), l(this, "finished", !1), l(this, "destroyed", !1), l(this, "length", 0), l(this, "pos", 0), l(this, "blockLen", void 0), l(this, "outputLen", void 0), l(this, "canXOF", !1), Lr(e), Lr(t), this.blockLen = e, this.outputLen = t, this.buffer = new Uint8Array(e), this.buffer32 = Ur(this.buffer);
 	}
 	update(e) {
-		Ur(this), Vr(e);
+		Br(this), Rr(e);
 		let { blockLen: t, buffer: n, buffer32: r } = this, i = e.length, a = e.byteOffset, o = e.buffer;
 		for (let s = 0; s < i;) {
-			this.pos === t && (q(r), this.compress(r, 0, !1), q(r), this.pos = 0);
+			this.pos === t && (Xr(r), this.compress(r, 0, !1), Xr(r), this.pos = 0);
 			let c = Math.min(t - this.pos, i - s), l = a + s;
 			if (c === t && !(l % 4) && s + c < i) {
 				let e = new Uint32Array(o, l, Math.floor((i - s) / 4));
-				q(e);
+				Xr(e);
 				for (let n = 0; s + t < i; n += r.length, s += t) this.length += t, this.compress(e, n, !1);
-				q(e);
+				Xr(e);
 				continue;
 			}
 			n.set(e.subarray(s, s + c), this.pos), this.pos += c, this.length += c, s += c;
@@ -2968,11 +2958,11 @@ var li = class {
 		return this;
 	}
 	digestInto(e) {
-		Ur(this), Wr(e, this);
+		Br(this), Vr(e, this);
 		let { pos: t, buffer32: n } = this;
-		if (this.finished = !0, qr(this.buffer.subarray(t)), q(n), this.compress(n, 0, !0), q(n), e.byteOffset & 3) throw RangeError("\"digestInto() output\" expected 4-byte aligned byteOffset, got " + e.byteOffset);
-		let r = this.get(), i = Kr(e), a = Math.floor(this.outputLen / 4);
-		for (let e = 0; e < a; e++) i[e] = Zr(r[e]);
+		if (this.finished = !0, Wr(this.buffer.subarray(t)), Xr(n), this.compress(n, 0, !0), Xr(n), e.byteOffset & 3) throw RangeError("\"digestInto() output\" expected 4-byte aligned byteOffset, got " + e.byteOffset);
+		let r = this.get(), i = Ur(e), a = Math.floor(this.outputLen / 4);
+		for (let e = 0; e < a; e++) i[e] = Jr(r[e]);
 		let o = this.outputLen % 4;
 		if (!o) return;
 		let s = a * 4, c = r[a];
@@ -2992,9 +2982,9 @@ var li = class {
 		return this._cloneInto();
 	}
 };
-function ui(e, t, n, r, i, a, o, s, c, l, u, d, f, p, m, h, g, _, v, y) {
+function ci(e, t, n, r, i, a, o, s, c, l, u, d, f, p, m, h, g, _, v, y) {
 	let b = 0;
-	for (let x = 0; x < r; x++) ({a: i, b: c, c: f, d: g} = si(i, c, f, g, n[t + e[b++]])), {a: i, b: c, c: f, d: g} = ci(i, c, f, g, n[t + e[b++]]), {a: a, b: l, c: p, d: _} = si(a, l, p, _, n[t + e[b++]]), {a: a, b: l, c: p, d: _} = ci(a, l, p, _, n[t + e[b++]]), {a: o, b: u, c: m, d: v} = si(o, u, m, v, n[t + e[b++]]), {a: o, b: u, c: m, d: v} = ci(o, u, m, v, n[t + e[b++]]), {a: s, b: d, c: h, d: y} = si(s, d, h, y, n[t + e[b++]]), {a: s, b: d, c: h, d: y} = ci(s, d, h, y, n[t + e[b++]]), {a: i, b: l, c: m, d: y} = si(i, l, m, y, n[t + e[b++]]), {a: i, b: l, c: m, d: y} = ci(i, l, m, y, n[t + e[b++]]), {a: a, b: u, c: h, d: g} = si(a, u, h, g, n[t + e[b++]]), {a: a, b: u, c: h, d: g} = ci(a, u, h, g, n[t + e[b++]]), {a: o, b: d, c: f, d: _} = si(o, d, f, _, n[t + e[b++]]), {a: o, b: d, c: f, d: _} = ci(o, d, f, _, n[t + e[b++]]), {a: s, b: c, c: p, d: v} = si(s, c, p, v, n[t + e[b++]]), {a: s, b: c, c: p, d: v} = ci(s, c, p, v, n[t + e[b++]]);
+	for (let x = 0; x < r; x++) ({a: i, b: c, c: f, d: g} = ai(i, c, f, g, n[t + e[b++]])), {a: i, b: c, c: f, d: g} = oi(i, c, f, g, n[t + e[b++]]), {a: a, b: l, c: p, d: _} = ai(a, l, p, _, n[t + e[b++]]), {a: a, b: l, c: p, d: _} = oi(a, l, p, _, n[t + e[b++]]), {a: o, b: u, c: m, d: v} = ai(o, u, m, v, n[t + e[b++]]), {a: o, b: u, c: m, d: v} = oi(o, u, m, v, n[t + e[b++]]), {a: s, b: d, c: h, d: y} = ai(s, d, h, y, n[t + e[b++]]), {a: s, b: d, c: h, d: y} = oi(s, d, h, y, n[t + e[b++]]), {a: i, b: l, c: m, d: y} = ai(i, l, m, y, n[t + e[b++]]), {a: i, b: l, c: m, d: y} = oi(i, l, m, y, n[t + e[b++]]), {a: a, b: u, c: h, d: g} = ai(a, u, h, g, n[t + e[b++]]), {a: a, b: u, c: h, d: g} = oi(a, u, h, g, n[t + e[b++]]), {a: o, b: d, c: f, d: _} = ai(o, d, f, _, n[t + e[b++]]), {a: o, b: d, c: f, d: _} = oi(o, d, f, _, n[t + e[b++]]), {a: s, b: c, c: p, d: v} = ai(s, c, p, v, n[t + e[b++]]), {a: s, b: c, c: p, d: v} = oi(s, c, p, v, n[t + e[b++]]);
 	return {
 		v0: i,
 		v1: a,
@@ -3016,7 +3006,7 @@ function ui(e, t, n, r, i, a, o, s, c, l, u, d, f, p, m, h, g, _, v, y) {
 }
 //#endregion
 //#region node_modules/@noble/hashes/blake3.js
-var di = {
+var li = {
 	CHUNK_START: 1,
 	CHUNK_END: 2,
 	PARENT: 4,
@@ -3024,7 +3014,7 @@ var di = {
 	KEYED_HASH: 16,
 	DERIVE_KEY_CONTEXT: 32,
 	DERIVE_KEY_MATERIAL: 64
-}, fi = /* @__PURE__ */ ri.slice(), pi = /* @__PURE__ */ (() => {
+}, ui = /* @__PURE__ */ ti.slice(), di = /* @__PURE__ */ (() => {
 	let e = Array.from({ length: 16 }, (e, t) => t), t = (e) => [
 		2,
 		6,
@@ -3045,36 +3035,36 @@ var di = {
 	].map((t) => e[t]), n = [];
 	for (let r = 0, i = e; r < 7; r++, i = t(i)) n.push(...i);
 	return Uint8Array.from(n);
-})(), mi = class e extends li {
+})(), fi = class e extends si {
 	constructor(t = {}, n = 0) {
 		super(64, t.dkLen === void 0 ? 32 : t.dkLen), l(this, "canXOF", !0), l(this, "chunkPos", 0), l(this, "chunksDone", 0), l(this, "flags", 0), l(this, "IV", void 0), l(this, "state", void 0), l(this, "stack", []), l(this, "posOut", 0), l(this, "bufferOut32", /* @__PURE__ */ new Uint32Array(16)), l(this, "bufferOut", void 0), l(this, "chunkOut", 0), l(this, "enableXOF", !0);
 		let { key: r, context: i } = t, a = i !== void 0;
 		if (r !== void 0) {
 			if (a) throw Error("Only \"key\" or \"context\" can be specified at same time");
-			Vr(r, 32, "key");
-			let e = Hr(r);
-			this.IV = Kr(e), q(this.IV), this.flags = n | di.KEYED_HASH;
+			Rr(r, 32, "key");
+			let e = zr(r);
+			this.IV = Ur(e), Xr(this.IV), this.flags = n | li.KEYED_HASH;
 		} else if (a) {
-			Vr(i, void 0, "context");
-			let t = i, r = new e({ dkLen: 32 }, di.DERIVE_KEY_CONTEXT).update(t).digest();
-			this.IV = Kr(r), q(this.IV), this.flags = n | di.DERIVE_KEY_MATERIAL;
-		} else this.IV = fi.slice(), this.flags = n;
-		this.state = this.IV.slice(), this.bufferOut = Gr(this.bufferOut32);
+			Rr(i, void 0, "context");
+			let t = i, r = new e({ dkLen: 32 }, li.DERIVE_KEY_CONTEXT).update(t).digest();
+			this.IV = Ur(r), Xr(this.IV), this.flags = n | li.DERIVE_KEY_MATERIAL;
+		} else this.IV = ui.slice(), this.flags = n;
+		this.state = this.IV.slice(), this.bufferOut = Hr(this.bufferOut32);
 	}
 	get() {
 		return [];
 	}
 	set() {}
 	b2Compress(e, t, n, r = 0) {
-		let { state: i, pos: a } = this, { h: o, l: s } = oi(BigInt(e), !0), { v0: c, v1: l, v2: u, v3: d, v4: f, v5: p, v6: m, v7: h, v8: g, v9: _, v10: v, v11: y, v12: b, v13: x, v14: S, v15: C } = ui(pi, r, n, 7, i[0], i[1], i[2], i[3], i[4], i[5], i[6], i[7], fi[0], fi[1], fi[2], fi[3], o, s, a, t);
+		let { state: i, pos: a } = this, { h: o, l: s } = ii(BigInt(e), !0), { v0: c, v1: l, v2: u, v3: d, v4: f, v5: p, v6: m, v7: h, v8: g, v9: _, v10: v, v11: y, v12: b, v13: x, v14: S, v15: C } = ci(di, r, n, 7, i[0], i[1], i[2], i[3], i[4], i[5], i[6], i[7], ui[0], ui[1], ui[2], ui[3], o, s, a, t);
 		i[0] = c ^ g, i[1] = l ^ _, i[2] = u ^ v, i[3] = d ^ y, i[4] = f ^ b, i[5] = p ^ x, i[6] = m ^ S, i[7] = h ^ C;
 	}
 	compress(e, t = 0, n = !1) {
 		let r = this.flags;
-		if (this.chunkPos || (r |= di.CHUNK_START), (this.chunkPos === 15 || n) && (r |= di.CHUNK_END), n || (this.pos = this.blockLen), this.b2Compress(this.chunksDone, r, e, t), this.chunkPos += 1, this.chunkPos === 16 || n) {
+		if (this.chunkPos || (r |= li.CHUNK_START), (this.chunkPos === 15 || n) && (r |= li.CHUNK_END), n || (this.pos = this.blockLen), this.b2Compress(this.chunksDone, r, e, t), this.chunkPos += 1, this.chunkPos === 16 || n) {
 			let e = this.state;
 			this.state = this.IV.slice();
-			for (let t, r = this.chunksDone + 1; (n || !(r & 1)) && (t = this.stack.pop()); r >>= 1) this.buffer32.set(t, 0), this.buffer32.set(e, 8), this.pos = this.blockLen, this.b2Compress(0, this.flags | di.PARENT, this.buffer32, 0), e = this.state, this.state = this.IV.slice();
+			for (let t, r = this.chunksDone + 1; (n || !(r & 1)) && (t = this.stack.pop()); r >>= 1) this.buffer32.set(t, 0), this.buffer32.set(e, 8), this.pos = this.blockLen, this.b2Compress(0, this.flags | li.PARENT, this.buffer32, 0), e = this.state, this.state = this.IV.slice();
 			this.chunksDone++, this.chunkPos = 0, this.stack.push(e);
 		}
 		this.pos = 0;
@@ -3085,22 +3075,22 @@ var di = {
 		return e.state.set(r.slice()), e.stack = s.map((e) => Uint32Array.from(e)), e.IV.set(t), e.flags = n, e.chunkPos = i, e.chunksDone = c, e.posOut = a, e.chunkOut = o, e.enableXOF = this.enableXOF, e.bufferOut32.set(this.bufferOut32), e;
 	}
 	destroy() {
-		this.destroyed = !0, qr(this.state, this.buffer32, this.IV, this.bufferOut32), qr(...this.stack);
+		this.destroyed = !0, Wr(this.state, this.buffer32, this.IV, this.bufferOut32), Wr(...this.stack);
 	}
 	b2CompressOut() {
-		let { state: e, pos: t, flags: n, buffer32: r, bufferOut32: i } = this, { h: a, l: o } = oi(BigInt(this.chunkOut++));
-		q(r);
-		let { v0: s, v1: c, v2: l, v3: u, v4: d, v5: f, v6: p, v7: m, v8: h, v9: g, v10: _, v11: v, v12: y, v13: b, v14: x, v15: S } = ui(pi, 0, r, 7, e[0], e[1], e[2], e[3], e[4], e[5], e[6], e[7], fi[0], fi[1], fi[2], fi[3], o, a, t, n);
-		i[0] = s ^ h, i[1] = c ^ g, i[2] = l ^ _, i[3] = u ^ v, i[4] = d ^ y, i[5] = f ^ b, i[6] = p ^ x, i[7] = m ^ S, i[8] = e[0] ^ h, i[9] = e[1] ^ g, i[10] = e[2] ^ _, i[11] = e[3] ^ v, i[12] = e[4] ^ y, i[13] = e[5] ^ b, i[14] = e[6] ^ x, i[15] = e[7] ^ S, q(r), q(i), this.posOut = 0;
+		let { state: e, pos: t, flags: n, buffer32: r, bufferOut32: i } = this, { h: a, l: o } = ii(BigInt(this.chunkOut++));
+		Xr(r);
+		let { v0: s, v1: c, v2: l, v3: u, v4: d, v5: f, v6: p, v7: m, v8: h, v9: g, v10: _, v11: v, v12: y, v13: b, v14: x, v15: S } = ci(di, 0, r, 7, e[0], e[1], e[2], e[3], e[4], e[5], e[6], e[7], ui[0], ui[1], ui[2], ui[3], o, a, t, n);
+		i[0] = s ^ h, i[1] = c ^ g, i[2] = l ^ _, i[3] = u ^ v, i[4] = d ^ y, i[5] = f ^ b, i[6] = p ^ x, i[7] = m ^ S, i[8] = e[0] ^ h, i[9] = e[1] ^ g, i[10] = e[2] ^ _, i[11] = e[3] ^ v, i[12] = e[4] ^ y, i[13] = e[5] ^ b, i[14] = e[6] ^ x, i[15] = e[7] ^ S, Xr(r), Xr(i), this.posOut = 0;
 	}
 	finish() {
 		if (this.finished) return;
-		this.finished = !0, qr(this.buffer.subarray(this.pos));
-		let e = this.flags | di.ROOT;
-		this.stack.length ? (e |= di.PARENT, q(this.buffer32), this.compress(this.buffer32, 0, !0), q(this.buffer32), this.chunksDone = 0, this.pos = this.blockLen) : e |= (this.chunkPos ? 0 : di.CHUNK_START) | di.CHUNK_END, this.flags = e, this.b2CompressOut();
+		this.finished = !0, Wr(this.buffer.subarray(this.pos));
+		let e = this.flags | li.ROOT;
+		this.stack.length ? (e |= li.PARENT, Xr(this.buffer32), this.compress(this.buffer32, 0, !0), Xr(this.buffer32), this.chunksDone = 0, this.pos = this.blockLen) : e |= (this.chunkPos ? 0 : li.CHUNK_START) | li.CHUNK_END, this.flags = e, this.b2CompressOut();
 	}
 	writeInto(e) {
-		Ur(this, !1), Vr(e), this.finish();
+		Br(this, !1), Rr(e), this.finish();
 		let { blockLen: t, bufferOut: n } = this;
 		for (let r = 0, i = e.length; r < i;) {
 			this.posOut >= t && this.b2CompressOut();
@@ -3114,17 +3104,27 @@ var di = {
 		return this.writeInto(e);
 	}
 	xof(e) {
-		return Br(e), this.xofInto(new Uint8Array(e));
+		return Lr(e), this.xofInto(new Uint8Array(e));
 	}
 	digestInto(e) {
-		if (Wr(e, this), this.finished) throw Error("digest() was already called");
+		if (Vr(e, this), this.finished) throw Error("digest() was already called");
 		this.enableXOF = !1, this.writeInto(e.subarray(0, this.outputLen)), this.destroy();
 	}
 	digest() {
 		let e = new Uint8Array(this.outputLen);
 		return this.digestInto(e), e;
 	}
-}, hi = /* @__PURE__ */ ni((e = {}) => new mi(e)), gi = ArrayBuffer, J = Uint8Array, _i = Uint16Array, vi = Int16Array, yi = Int32Array, bi = function(e, t, n) {
+}, pi = /* @__PURE__ */ ei((e = {}) => new fi(e)), mi = (e, t) => ((e.Flags[t >> 3] ?? 0) >> (t & 7) & 1) == 1, hi = class {
+	constructor() {
+		this.bytes = [], this.bits = 0;
+	}
+	push(e) {
+		this.bits >= this.bytes.length * 8 && this.bytes.push(0), e && (this.bytes[this.bits >> 3] |= 1 << (this.bits & 7)), this.bits += 1;
+	}
+	toValue() {
+		return { Flags: this.bytes };
+	}
+}, gi = ArrayBuffer, J = Uint8Array, _i = Uint16Array, vi = Int16Array, yi = Int32Array, bi = function(e, t, n) {
 	if (J.prototype.slice) return J.prototype.slice.call(e, t, n);
 	(t == null || t < 0) && (t = 0), (n == null || n > e.length) && (n = e.length);
 	var r = new J(n - t);
@@ -3419,29 +3419,29 @@ var di = {
 				j = (A -= E.b) >> 3;
 				var ne = (e[j] | e[j + 1] << 8) >> (A & 7) & (1 << E.b) - 1;
 				for (++y; --y;) {
-					var re = O.s[ee], ie = O.n[ee], ae = E.s[ne], oe = E.n[ne], se = D.s[te], ce = D.n[te];
-					j = (A -= se) >> 3;
-					var le = 1 << se, ue = le + ((e[j] | e[j + 1] << 8 | e[j + 2] << 16 | e[j + 3] << 24) >>> (A & 7) & le - 1);
-					j = (A -= Ii[ae]) >> 3;
-					var de = Li[ae] + ((e[j] | e[j + 1] << 8 | e[j + 2] << 16) >> (A & 7) & (1 << Ii[ae]) - 1);
-					j = (A -= Pi[re]) >> 3;
-					var fe = Fi[re] + ((e[j] | e[j + 1] << 8 | e[j + 2] << 16) >> (A & 7) & (1 << Pi[re]) - 1);
-					if (j = (A -= ie) >> 3, ee = O.t[ee] + ((e[j] | e[j + 1] << 8) >> (A & 7) & (1 << ie) - 1), j = (A -= oe) >> 3, ne = E.t[ne] + ((e[j] | e[j + 1] << 8) >> (A & 7) & (1 << oe) - 1), j = (A -= ce) >> 3, te = D.t[te] + ((e[j] | e[j + 1] << 8) >> (A & 7) & (1 << ce) - 1), ue > 3) t.o[2] = t.o[1], t.o[1] = t.o[0], t.o[0] = ue -= 3;
+					var N = O.s[ee], re = O.n[ee], ie = E.s[ne], ae = E.n[ne], oe = D.s[te], se = D.n[te];
+					j = (A -= oe) >> 3;
+					var ce = 1 << oe, le = ce + ((e[j] | e[j + 1] << 8 | e[j + 2] << 16 | e[j + 3] << 24) >>> (A & 7) & ce - 1);
+					j = (A -= Ii[ie]) >> 3;
+					var ue = Li[ie] + ((e[j] | e[j + 1] << 8 | e[j + 2] << 16) >> (A & 7) & (1 << Ii[ie]) - 1);
+					j = (A -= Pi[N]) >> 3;
+					var de = Fi[N] + ((e[j] | e[j + 1] << 8 | e[j + 2] << 16) >> (A & 7) & (1 << Pi[N]) - 1);
+					if (j = (A -= re) >> 3, ee = O.t[ee] + ((e[j] | e[j + 1] << 8) >> (A & 7) & (1 << re) - 1), j = (A -= ae) >> 3, ne = E.t[ne] + ((e[j] | e[j + 1] << 8) >> (A & 7) & (1 << ae) - 1), j = (A -= se) >> 3, te = D.t[te] + ((e[j] | e[j + 1] << 8) >> (A & 7) & (1 << se) - 1), le > 3) t.o[2] = t.o[1], t.o[1] = t.o[0], t.o[0] = le -= 3;
 					else {
-						var pe = ue - (fe != 0);
-						pe ? (ue = pe == 3 ? t.o[0] - 1 : t.o[pe], pe > 1 && (t.o[2] = t.o[1]), t.o[1] = t.o[0], t.o[0] = ue) : ue = t.o[0];
+						var fe = le - (de != 0);
+						fe ? (le = fe == 3 ? t.o[0] - 1 : t.o[fe], fe > 1 && (t.o[2] = t.o[1]), t.o[1] = t.o[0], t.o[0] = le) : le = t.o[0];
 					}
-					for (var S = 0; S < fe; ++S) h[M + S] = h[g + S];
-					M += fe, g += fe;
-					var me = M - ue;
-					if (me < 0) {
-						var he = -me, N = t.e + me;
-						he > de && (he = de);
-						for (var S = 0; S < he; ++S) h[M + S] = t.w[N + S];
-						M += he, de -= he, me = 0;
+					for (var S = 0; S < de; ++S) h[M + S] = h[g + S];
+					M += de, g += de;
+					var pe = M - le;
+					if (pe < 0) {
+						var me = -pe, P = t.e + pe;
+						me > ue && (me = ue);
+						for (var S = 0; S < me; ++S) h[M + S] = t.w[P + S];
+						M += me, ue -= me, pe = 0;
 					}
-					for (var S = 0; S < de; ++S) h[M + S] = h[me + S];
-					M += de;
+					for (var S = 0; S < ue; ++S) h[M + S] = h[pe + S];
+					M += ue;
 				}
 				if (M != g) for (; g < h.length;) h[M++] = h[g++];
 				else M = h.length;
@@ -3680,7 +3680,7 @@ function Gi(e, t = {}) {
 			let e = g.content, n;
 			if (e.length === 0) n = -1;
 			else {
-				let r = hi(e), i = ti(r), a = p.get(i);
+				let r = pi(e), i = $r(r), a = p.get(i);
 				if (a !== void 0) n = a;
 				else {
 					n = d.length, p.set(i, n), d.push(r), l.push(e.length);
@@ -3711,7 +3711,7 @@ function Gi(e, t = {}) {
 		66,
 		82,
 		90
-	]), y.u8(0), y.u8(0), y.i32le(v.length), y.i32le(v.length), y.bytes(hi(v)), y.bytes(v);
+	]), y.u8(0), y.u8(0), y.i32le(v.length), y.i32le(v.length), y.bytes(pi(v)), y.bytes(v);
 	for (let e of f) y.bytes(e);
 	return y.toBytes();
 }
@@ -3733,7 +3733,7 @@ var Ki = class e {
 		let c = n.bytes(32), l;
 		if (a === 0) l = n.bytes(o);
 		else if (l = Hi(n.bytes(s), new Uint8Array(o)), l.length !== o) throw Error("brdb: index decompressed to the wrong size");
-		if (ti(hi(l)) !== ti(c)) throw Error("brdb: index hash mismatch");
+		if ($r(pi(l)) !== $r(c)) throw Error("brdb: index hash mismatch");
 		let u = n.bytes(n.remaining), d = new Wi(l), f = d.i32le(), p = d.i32le(), m = d.i32le();
 		if (f < 0 || p < 0 || m < 0) throw Error("brdb: negative index count");
 		let h = (e, t) => Array.from({ length: e }, t), g = h(f, () => d.i32le()), _ = h(f, () => d.u16le()), v = new TextDecoder("utf-8", { fatal: !0 }), y = _.map((e) => v.decode(d.bytes(e))), b = h(p, () => d.i32le()), x = h(p, () => d.i32le()), S = h(p, () => d.u16le()).map((e) => v.decode(d.bytes(e))), C = h(m, () => d.u8()), w = h(m, () => d.i32le()), T = h(m, () => d.i32le()), E = h(m, () => d.bytes(32).slice());
@@ -3799,7 +3799,7 @@ var Ki = class e {
 			r = Hi(n, new Uint8Array(t.sizeUncompressed));
 		}
 		if (r.length !== t.sizeUncompressed) throw Error("brdb: blob uncompressed size mismatch");
-		if (ti(hi(r)) !== ti(t.hash)) throw Error("brdb: blob hash mismatch");
+		if ($r(pi(r)) !== $r(t.hash)) throw Error("brdb: blob hash mismatch");
 		return r;
 	}
 	readFile(e) {
@@ -11761,7 +11761,7 @@ var $i = /* @__PURE__ */ new Map([
 	D: 4294967295
 };
 function oa(e) {
-	let t = er(e), n = new DataView(t.buffer, t.byteOffset, 16);
+	let t = $n(e), n = new DataView(t.buffer, t.byteOffset, 16);
 	return {
 		A: n.getUint32(0, !1),
 		B: n.getUint32(4, !1),
@@ -11771,7 +11771,7 @@ function oa(e) {
 }
 function sa(e) {
 	let t = /* @__PURE__ */ new Uint8Array(16), n = new DataView(t.buffer);
-	return n.setUint32(0, e.A, !1), n.setUint32(4, e.B, !1), n.setUint32(8, e.C, !1), n.setUint32(12, e.D, !1), $n(Array.from(t));
+	return n.setUint32(0, e.A, !1), n.setUint32(4, e.B, !1), n.setUint32(8, e.C, !1), n.setUint32(12, e.D, !1), Qn(Array.from(t));
 }
 //#endregion
 //#region src/brdb/pending.ts
@@ -12726,7 +12726,11 @@ var Ba = {
 				bInputA: "bool",
 				bInputB: "bool"
 			},
-			BrickComponentData_WireGraph_Expr_ChangeDetector: { Input: "WireGraphVariant" },
+			BrickComponentData_WireGraph_Expr_ChangeDetector: {
+				Input: "WireGraphVariant",
+				bPulseOnChange: "bool"
+			},
+			BrickComponentData_WireGraph_Expr_ChangeDetectorExec: { Input: "WireGraphVariant" },
 			BrickComponentData_WireGraph_Expr_Compare: {
 				InputA: "WireGraphVariant",
 				InputB: "WireGraphVariant"
@@ -12736,7 +12740,12 @@ var Ba = {
 				Output: "WireGraphVariant",
 				TargetType: "WireGraphVariant"
 			},
-			BrickComponentData_WireGraph_Expr_EdgeDetector: { Input: "f64" },
+			BrickComponentData_WireGraph_Expr_EdgeDetector: {
+				Input: "f64",
+				bPulseOnRisingEdge: "bool",
+				bPulseOnFallingEdge: "bool"
+			},
+			BrickComponentData_WireGraph_Expr_EdgeDetectorExec: { Input: "f64" },
 			BrickComponentData_WireGraph_Expr_Float_Float: { Input: "f64" },
 			BrickComponentData_WireGraph_Expr_Int_Int: { Input: "i64" },
 			BrickComponentData_WireGraph_Expr_IntInt_Int: {
@@ -14234,7 +14243,7 @@ var ro = class {
 	}
 }, io = class {
 	constructor() {
-		this.sizeCounters = [], this.sizes = [], this.typeIndices = [], this.ownerIndices = [], this.originalOwnerIndices = [], this.relPositions = [], this.orientations = [], this.colPlayer = new Rr(), this.colPlayer1 = new Rr(), this.colPlayer2 = new Rr(), this.colPlayer3 = new Rr(), this.colWeapon = new Rr(), this.colInteraction = new Rr(), this.colPhysics = new Rr(), this.visibility = new Rr(), this.materialIndices = [], this.colors = [], this.sizeIndexMap = /* @__PURE__ */ new Map(), this.numBrickSizes = 0, this.numBricks = 0;
+		this.sizeCounters = [], this.sizes = [], this.typeIndices = [], this.ownerIndices = [], this.originalOwnerIndices = [], this.relPositions = [], this.orientations = [], this.colPlayer = new hi(), this.colPlayer1 = new hi(), this.colPlayer2 = new hi(), this.colPlayer3 = new hi(), this.colWeapon = new hi(), this.colInteraction = new hi(), this.colPhysics = new hi(), this.visibility = new hi(), this.materialIndices = [], this.colors = [], this.sizeIndexMap = /* @__PURE__ */ new Map(), this.numBrickSizes = 0, this.numBricks = 0;
 	}
 	addBrick(e, t, n, r) {
 		let i;
@@ -14339,7 +14348,11 @@ function so(e, t = {}) {
 	let n = no(e), r = (e.wires ?? []).filter((e) => "component_type" in e.source);
 	return co({
 		description: e.description,
-		authorName: e.author?.name,
+		author: e.author?.name ? {
+			id: e.author.id,
+			name: e.author.name
+		} : void 0,
+		prefabs: [],
 		ownerRows: oo(e.brick_owners),
 		grids: [n],
 		gridIds: [1],
@@ -14363,41 +14376,41 @@ function so(e, t = {}) {
 	}, t);
 }
 function co(e, t = {}) {
-	let n = e.grids.flat(), r = new ro(), i = new ro(), a = new ro();
-	for (let e of n) r.add(e.materialName), (e.procedural ? a : i).add(e.assetName);
+	let n = e.grids.flat(), r = new ro(), i = new ro(), o = new ro();
+	for (let e of n) r.add(e.materialName), (e.procedural ? o : i).add(e.assetName);
 	if (r.size > 256) throw Error(`brdb: too many distinct materials (${r.size}); MaterialIndices is u8 (max 256)`);
-	let o = {
+	let s = {
 		materials: r,
 		basic: i,
-		procedural: a
-	}, s = i.size, c = new ro(), l = [];
+		procedural: o
+	}, c = i.size, l = new ro(), u = [];
 	for (let e of n) for (let t of e.components) {
-		let e = c.size;
-		c.add(t.type) === e && l.push($i.get(t.type));
+		let e = l.size;
+		l.add(t.type) === e && u.push($i.get(t.type));
 	}
-	let u = new ro();
+	let d = new ro();
 	e.wires.forEach((t, n) => {
 		for (let [r, i] of [["source", t.source], ["target", t.target]]) {
 			let t = e.grids[i.gridSlot]?.length ?? 0;
 			if (!Number.isInteger(i.brickIndex) || i.brickIndex < 0 || i.brickIndex >= t) throw Error(`brdb: wires[${n}].${r}: brick_index ${i.brickIndex} out of range`);
-			if (!c.has(i.componentType)) throw Error(`brdb: wires[${n}].${r}: component type '${i.componentType}' is not used by any brick`);
-			u.add(i.port);
+			if (!l.has(i.componentType)) throw Error(`brdb: wires[${n}].${r}: component type '${i.componentType}' is not used by any brick`);
+			d.add(i.port);
 		}
 	});
-	let d = new ro(), f = [];
+	let f = new ro(), p = [];
 	for (let t of e.entities) {
-		let e = d.size;
-		d.add(t.type) === e && f.push(t.className);
+		let e = f.size;
+		f.add(t.type) === e && p.push(t.className);
 	}
-	let p = Ja.fromData(Ba.BRSavedComponentChunkSoA);
-	if (c.size > 0) {
+	let m = Ja.fromData(Ba.BRSavedComponentChunkSoA);
+	if (l.size > 0) {
 		let e = [];
-		for (let t of l) t !== "None" && !e.includes(t) && e.push(t);
-		p.merge(Xa("BRSavedComponentChunkSoA_max").extractStructsTransitive(e));
+		for (let t of u) t !== "None" && !e.includes(t) && e.push(t);
+		m.merge(Xa("BRSavedComponentChunkSoA_max").extractStructsTransitive(e));
 	}
-	let m = e.ownerRows, h = m.map(() => 0), g = m.map(() => 0), _ = m.map(() => 0);
-	for (let t of e.entities) _[t.ownerIndex] += 1;
-	let v = e.grids.map((e) => {
+	let h = e.ownerRows, g = h.map(() => 0), _ = h.map(() => 0), v = h.map(() => 0);
+	for (let t of e.entities) v[t.ownerIndex] += 1;
+	let y = e.grids.map((e) => {
 		let t = {
 			chunkOrder: [],
 			chunks: /* @__PURE__ */ new Map(),
@@ -14412,34 +14425,34 @@ function co(e, t = {}) {
 				index: e,
 				builder: new io()
 			}, t.chunks.set(i, a), t.chunkOrder.push(i));
-			let u = a.builder.numBricks;
-			if (a.builder.addBrick(n, r, o, s), t.brickLocations.push({
+			let o = a.builder.numBricks;
+			if (a.builder.addBrick(n, r, s, c), t.brickLocations.push({
 				key: i,
 				chunk: e,
-				localIndex: u
-			}), h[n.ownerIndex] += 1, n.components.length > 0) {
-				g[n.ownerIndex] += n.components.length;
+				localIndex: o
+			}), g[n.ownerIndex] += 1, n.components.length > 0) {
+				_[n.ownerIndex] += n.components.length;
 				let e = t.componentChunks.get(i);
 				e || t.componentChunks.set(i, e = new ao());
 				for (let t of n.components) {
-					let n = c.indexOf(t.type);
-					e.add(n, u, l[n], t.data ?? {});
+					let n = l.indexOf(t.type);
+					e.add(n, o, u[n], t.data ?? {});
 				}
 			}
 		}
 		return t;
 	});
 	for (let t of e.microchipLinks) {
-		let e = v[t.gridSlot], n = e?.brickLocations[t.brickIndex];
+		let e = y[t.gridSlot], n = e?.brickLocations[t.brickIndex];
 		if (!n) throw Error(`brdb: microchip link brick index ${t.brickIndex} out of range`);
 		let r = e.componentChunks.get(n.key);
 		r || e.componentChunks.set(n.key, r = new ao()), r.addMicrochipLink(n.localIndex, t.gridReference);
 	}
 	for (let t of e.wires) {
-		let n = v[t.source.gridSlot].brickLocations[t.source.brickIndex], r = v[t.target.gridSlot], i = r.brickLocations[t.target.brickIndex], a = {
+		let n = y[t.source.gridSlot].brickLocations[t.source.brickIndex], r = y[t.target.gridSlot], i = r.brickLocations[t.target.brickIndex], a = {
 			BrickIndexInChunk: i.localIndex,
-			ComponentTypeIndex: c.indexOf(t.target.componentType),
-			PortIndex: u.indexOf(t.target.port)
+			ComponentTypeIndex: l.indexOf(t.target.componentType),
+			PortIndex: d.indexOf(t.target.port)
 		}, o = r.wireChunks.get(i.key);
 		o || r.wireChunks.set(i.key, o = {
 			remoteSources: [],
@@ -14448,8 +14461,8 @@ function co(e, t = {}) {
 			localTargets: []
 		}), r.chunkWireCounts.set(i.key, (r.chunkWireCounts.get(i.key) ?? 0) + 1), t.source.gridSlot === t.target.gridSlot && n.key === i.key ? (o.localSources.push({
 			BrickIndexInChunk: n.localIndex,
-			ComponentTypeIndex: c.indexOf(t.source.componentType),
-			PortIndex: u.indexOf(t.source.port)
+			ComponentTypeIndex: l.indexOf(t.source.componentType),
+			PortIndex: d.indexOf(t.source.port)
 		}), o.localTargets.push(a)) : (o.remoteSources.push({
 			GridPersistentIndex: e.gridIds[t.source.gridSlot],
 			ChunkIndex: {
@@ -14458,54 +14471,54 @@ function co(e, t = {}) {
 				Z: n.chunk[2]
 			},
 			BrickIndexInChunk: n.localIndex,
-			ComponentTypeIndex: c.indexOf(t.source.componentType),
-			PortIndex: u.indexOf(t.source.port)
+			ComponentTypeIndex: l.indexOf(t.source.componentType),
+			PortIndex: d.indexOf(t.source.port)
 		}), o.remoteTargets.push(a));
 	}
-	let y = Xa("BRSavedGlobalDataSoA"), b = Xa("BRSavedOwnerTableSoA"), x = Xa("BRSavedBrickChunkIndexSoA"), S = Xa("BRSavedBrickChunkSoA"), C = Xa("BRSavedWireChunkSoA"), w = Xa("BRSavedEntityChunkIndexSoA"), T = Xa("BRSavedEntityChunkSoA"), E = y.encode("BRSavedGlobalDataSoA", {
-		EntityTypeNames: d.names,
-		EntityDataClassNames: f,
+	let b = Xa("BRSavedGlobalDataSoA"), x = Xa("BRSavedOwnerTableSoA"), S = Xa("BRSavedBrickChunkIndexSoA"), C = Xa("BRSavedBrickChunkSoA"), w = Xa("BRSavedWireChunkSoA"), T = Xa("BRSavedEntityChunkIndexSoA"), E = Xa("BRSavedEntityChunkSoA"), D = b.encode("BRSavedGlobalDataSoA", {
+		EntityTypeNames: f.names,
+		EntityDataClassNames: p,
 		BasicBrickAssetNames: i.names,
-		ProceduralBrickAssetNames: a.names,
+		ProceduralBrickAssetNames: o.names,
 		MaterialAssetNames: r.names,
-		ComponentTypeNames: c.names,
-		ComponentDataStructNames: l,
-		ComponentWirePortNames: u.names,
+		ComponentTypeNames: l.names,
+		ComponentDataStructNames: u,
+		ComponentWirePortNames: d.names,
 		ExternalAssetReferences: [],
 		GlobalGridEntityTypeIndex: -1
-	}), D = b.encode("BRSavedOwnerTableSoA", {
-		UserIds: m.map((e) => ({
+	}), O = x.encode("BRSavedOwnerTableSoA", {
+		UserIds: h.map((e) => ({
 			A: e.guid.A,
 			B: e.guid.B,
 			C: e.guid.C,
 			D: e.guid.D
 		})),
-		UserNames: m.map((e) => e.name),
-		DisplayNames: m.map((e) => e.display),
-		EntityCounts: _,
-		BrickCounts: h,
-		ComponentCounts: g,
-		WireCounts: m.map(() => 0)
-	}), O = e.entities.length, k = w.encode("BRSavedEntityChunkIndexSoA", {
-		NextPersistentIndex: 2 + O,
-		Chunk3DIndices: O ? [{
+		UserNames: h.map((e) => e.name),
+		DisplayNames: h.map((e) => e.display),
+		EntityCounts: v,
+		BrickCounts: g,
+		ComponentCounts: _,
+		WireCounts: h.map(() => 0)
+	}), k = e.entities.length, A = T.encode("BRSavedEntityChunkIndexSoA", {
+		NextPersistentIndex: 2 + k,
+		Chunk3DIndices: k ? [{
 			X: 0,
 			Y: 0,
 			Z: 0
 		}] : [],
-		NumEntities: O ? [O] : []
-	}), A = null;
-	if (O > 0) {
-		let t = [], n = new Rr(), r = new Rr();
+		NumEntities: k ? [k] : []
+	}), j = null;
+	if (k > 0) {
+		let t = [], n = new hi(), r = new hi();
 		for (let i of e.entities) {
-			let e = d.indexOf(i.type), a = t[t.length - 1];
+			let e = f.indexOf(i.type), a = t[t.length - 1];
 			a && a.TypeIndex === e ? a.NumEntities += 1 : t.push({
 				TypeIndex: e,
 				NumEntities: 1
 			}), n.push(i.frozen), r.push(i.sleeping);
 		}
 		let i = new Ui();
-		T.writeValue(i, "BRSavedEntityChunkSoA", {
+		E.writeValue(i, "BRSavedEntityChunkSoA", {
 			TypeCounters: t,
 			PersistentIndices: e.entities.map((e, t) => 2 + t),
 			OwnerIndices: e.entities.map((e) => e.ownerIndex),
@@ -14523,27 +14536,30 @@ function co(e, t = {}) {
 			bColorsAreLinear: !1
 		}), e.entities.forEach((e, t) => {
 			if (e.className !== "None") try {
-				T.writeValue(i, e.className, T.fillStruct(e.className, e.data));
+				E.writeValue(i, e.className, E.fillStruct(e.className, e.data));
 			} catch (n) {
 				throw Error(`brdb: entities[${t}] (${e.type}) data: ${n.message}`);
 			}
-		}), A = i.toBytes();
+		}), j = i.toBytes();
 	}
-	let j = new TextEncoder(), M = {
+	let M = new TextEncoder(), ee = {
 		type: e.prefab ? "Prefab" : "World",
-		iD: "00000000-0000-0000-0000-000000000000",
+		iD: a,
 		name: "",
 		version: "",
 		tags: [],
-		authors: e.authorName ? [e.authorName] : [],
+		authors: e.author ? [{
+			iD: e.author.id ?? "00000000-0000-0000-0000-000000000000",
+			name: e.author.name
+		}] : [],
 		createdAt: "0001.01.01-00.00.00",
 		updatedAt: "0001.01.01-00.00.00",
 		description: e.description ?? "A Generated World",
 		dependencies: [],
 		gameVersion: "CL0",
 		...t.bundle
-	}, ee = (e, t) => {
-		let n = t ? 0 : Qa, r = [["ChunkIndex.mps", X(x.encode("BRSavedBrickChunkIndexSoA", {
+	}, te = (e, t) => {
+		let n = t ? 0 : Qa, r = [["ChunkIndex.mps", X(S.encode("BRSavedBrickChunkIndexSoA", {
 			Chunk3DIndices: e.chunkOrder.map((t) => {
 				let [n, r, i] = e.chunks.get(t).index;
 				return {
@@ -14562,9 +14578,9 @@ function co(e, t = {}) {
 			NumComponents: e.chunkOrder.map((t) => e.componentChunks.get(t)?.numComponents ?? 0),
 			NumWires: e.chunkOrder.map((t) => e.chunkWireCounts.get(t) ?? 0)
 		}))]];
-		return e.chunkOrder.length > 0 && r.push(["Chunks", ca(e.chunkOrder.map((t) => [`${t}.mps`, X(S.encode("BRSavedBrickChunkSoA", e.chunks.get(t).builder.toValue(s)))]))]), e.componentChunks.size > 0 && r.push(["Components", ca(e.chunkOrder.filter((t) => e.componentChunks.has(t)).map((t) => [`${t}.mps`, X(e.componentChunks.get(t).toBytes(p))]))]), e.wireChunks.size > 0 && r.push(["Wires", ca(e.chunkOrder.filter((t) => e.wireChunks.has(t)).map((t) => {
+		return e.chunkOrder.length > 0 && r.push(["Chunks", ca(e.chunkOrder.map((t) => [`${t}.mps`, X(C.encode("BRSavedBrickChunkSoA", e.chunks.get(t).builder.toValue(c)))]))]), e.componentChunks.size > 0 && r.push(["Components", ca(e.chunkOrder.filter((t) => e.componentChunks.has(t)).map((t) => [`${t}.mps`, X(e.componentChunks.get(t).toBytes(m))]))]), e.wireChunks.size > 0 && r.push(["Wires", ca(e.chunkOrder.filter((t) => e.wireChunks.has(t)).map((t) => {
 			let n = e.wireChunks.get(t);
-			return [`${t}.mps`, X(C.encode("BRSavedWireChunkSoA", {
+			return [`${t}.mps`, X(w.encode("BRSavedWireChunkSoA", {
 				RemoteWireSources: n.remoteSources,
 				LocalWireSources: n.localSources,
 				RemoteWireTargets: n.remoteTargets,
@@ -14572,27 +14588,37 @@ function co(e, t = {}) {
 				PendingPropagationFlags: { Flags: [] }
 			}))];
 		}))]), r;
-	}, te = [["Bundle.json", X(j.encode(JSON.stringify(M)))]];
-	e.prefab ? te.push(["Prefab.json", X(j.encode(JSON.stringify(e.prefab)))]) : te.push(["World.json", X(j.encode(JSON.stringify({ environment: t.environment ?? "Plate" })))]);
-	let ne = [
-		["ChunkIndex.schema", X(w.toBinary())],
-		["ChunkIndex.mps", X(k)],
-		["ChunksShared.schema", X(T.toBinary())]
+	}, ne = [["Bundle.json", X(M.encode(JSON.stringify(ee)))]];
+	e.prefab ? (ne.push(["Prefab.json", X(M.encode(mo(e.prefab)))]), t.thumbnail && ne.push(["Thumbnail.png", X(t.thumbnail)])) : (t.thumbnail && ne.push(["Thumbnail.png", X(t.thumbnail)]), ne.push(["World.json", X(M.encode(JSON.stringify({ environment: t.environment ?? "Plate" })))]));
+	let N = [
+		["ChunkIndex.schema", X(T.toBinary())],
+		["ChunkIndex.mps", X(A)],
+		["ChunksShared.schema", X(E.toBinary())]
 	];
-	return A && ne.push(["Chunks", ca([["0_0_0.mps", X(A)]])]), [["Meta", ca(te)], ["World", ca([["0", ca([
-		["GlobalData.schema", X(y.toBinary())],
-		["GlobalData.mps", X(E)],
-		["Owners.schema", X(b.toBinary())],
-		["Owners.mps", X(D)],
+	j && N.push(["Chunks", ca([["0_0_0.mps", X(j)]])]);
+	let re = [["Meta", ca(ne)], ["World", ca([["0", ca([
+		["GlobalData.schema", X(b.toBinary())],
+		["GlobalData.mps", X(D)],
+		["Owners.schema", X(x.toBinary())],
+		["Owners.mps", X(O)],
 		["Bricks", ca([
-			["ChunkIndexShared.schema", X(x.toBinary())],
-			["ChunksShared.schema", X(S.toBinary())],
-			["WiresShared.schema", X(C.toBinary())],
-			["ComponentsShared.schema", X(p.toBinary())],
-			["Grids", ca(v.map((t, n) => [String(e.gridIds[n]), ca(ee(t, e.gridIds[n] === 1))]))]
+			["ChunkIndexShared.schema", X(S.toBinary())],
+			["ChunksShared.schema", X(C.toBinary())],
+			["WiresShared.schema", X(w.toBinary())],
+			["ComponentsShared.schema", X(m.toBinary())],
+			["Grids", ca(y.map((t, n) => [String(e.gridIds[n]), ca(te(t, e.gridIds[n] === 1))]))]
 		])],
-		["Entities", ca(ne)]
+		["Entities", ca(N)]
 	])]])]];
+	if (e.prefabs.length > 0) for (let [t, n] of e.prefabs) {
+		let e = t.split("/"), r = re;
+		for (let t = 0; t < e.length - 1; t++) {
+			let n = r.find(([n, r]) => n === e[t] && r.type === "folder");
+			n || (n = [e[t], ca([])], r.push(n)), r = n[1].children;
+		}
+		r.push([e[e.length - 1], X(n)]);
+	}
+	return re;
 }
 function lo(e, t, n) {
 	let r = e.type ?? "Entity_DynamicBrickGrid", i = na.get(r);
@@ -14638,7 +14664,22 @@ function lo(e, t, n) {
 		data: e.data ?? {}
 	};
 }
-function uo(e, t) {
+var uo = "@@f64:", fo = class {
+	constructor(e) {
+		this.value = e;
+	}
+	toJSON() {
+		return `${uo}${this.value}`;
+	}
+}, po = (e, t, n) => ({
+	x: new fo(e),
+	y: new fo(t),
+	z: new fo(n)
+});
+function mo(e) {
+	return JSON.stringify(e).replace(RegExp(`"${uo}(-?[\\d.eE+-]+)"`, "g"), (e, t) => Number.isInteger(Number(t)) ? `${t}.0` : t);
+}
+function ho(e, t) {
 	let n = [
 		0,
 		0,
@@ -14664,16 +14705,8 @@ function uo(e, t) {
 		}
 	});
 	let i = {
-		center: {
-			x: (n[0] + r[0]) / 2,
-			y: (n[1] + r[1]) / 2,
-			z: (n[2] + r[2]) / 2
-		},
-		halfExtent: {
-			x: (r[0] - n[0]) / 2,
-			y: (r[1] - n[1]) / 2,
-			z: (r[2] - n[2]) / 2
-		}
+		center: po((n[0] + r[0]) / 2, (n[1] + r[1]) / 2, (n[2] + r[2]) / 2),
+		halfExtent: po((r[0] - n[0]) / 2, (r[1] - n[1]) / 2, (r[2] - n[2]) / 2)
 	};
 	return {
 		pivots: {
@@ -14697,9 +14730,9 @@ function uo(e, t) {
 		bIsMicrochipPrefab: t.isMicrochipPrefab ?? !1
 	};
 }
-var fo = class {
+var go = class {
 	constructor() {
-		this.gridBrickInputs = [[]], this.gridEntityOrders = [], this.entityInputs = [], this.wireList = [], this.chipLinks = [], this.ownerList = [], this.prefabOptions = null;
+		this.gridBrickInputs = [[]], this.gridEntityOrders = [], this.entityInputs = [], this.wireList = [], this.chipLinks = [], this.ownerList = [], this.prefabOptions = null, this.prefabList = [];
 	}
 	addOwner(e) {
 		return this.ownerList.push(e), this.ownerList.length;
@@ -14776,6 +14809,10 @@ var fo = class {
 	makePrefab(e = {}) {
 		this.prefabOptions = e;
 	}
+	addPrefab(e) {
+		let t = `Prefabs/Uploads/${$r(pi(e)).toUpperCase()}.brz`;
+		return this.prefabList.some(([e]) => e === t) || this.prefabList.push([t, e]), t;
+	}
 	toPendingFs(e = {}) {
 		let t = new ro(), n = new ro();
 		for (let e of this.gridBrickInputs) for (let r of e) t.add(r.asset ?? "PB_DefaultBrick"), n.add(r.material ?? "BMC_Plastic");
@@ -14824,35 +14861,36 @@ var fo = class {
 				brickIndex: e.brick.index,
 				gridReference: 2 + e.grid.entityOrder
 			})),
-			prefab: this.prefabOptions ? uo(r[0], this.prefabOptions) : null
+			prefab: this.prefabOptions ? ho(r[0], this.prefabOptions) : null,
+			prefabs: this.prefabList
 		}, e);
 	}
 	toBrz(e = {}) {
 		return Gi(this.toPendingFs(e), { compress: e.compress });
 	}
 };
-function po(e, t = {}) {
+function _o(e, t = {}) {
 	let n = { compress: t.compress };
 	return Gi(so(e, t), n);
 }
-function mo(e) {
+function vo(e) {
 	let t = e <= 15 ? 15 : 255;
 	return Math.trunc((e / 255) ** (1 / 2.2) * t);
 }
-function ho(e) {
+function yo(e) {
 	return {
 		...e,
-		R: mo(e.R),
-		G: mo(e.G),
-		B: mo(e.B)
+		R: vo(e.R),
+		G: vo(e.G),
+		B: vo(e.B)
 	};
 }
-function go(e) {
+function bo(e) {
 	let t = {};
-	for (let [n, r] of Object.entries(e)) t[n] = ho(r);
+	for (let [n, r] of Object.entries(e)) t[n] = yo(r);
 	return t;
 }
-function _o(e, t, n) {
+function xo(e, t, n) {
 	let r = 0;
 	for (let t of e.BrickSizeCounters) r += t.NumSizes;
 	if (r < 0 || r > e.BrickSizes.length) throw Error("brdb: brick size counters exceed size table");
@@ -14875,7 +14913,7 @@ function _o(e, t, n) {
 				r.Z
 			];
 		}
-		let d = e.RelativePositions[r], f = e.Orientations[r], p = e.ColorsAndAlphas[r], m = o ? ho(p) : p;
+		let d = e.RelativePositions[r], f = e.Orientations[r], p = e.ColorsAndAlphas[r], m = o ? yo(p) : p;
 		s.push({
 			asset_name_index: l,
 			size: u,
@@ -14887,13 +14925,13 @@ function _o(e, t, n) {
 			direction: f >> 2 & 7,
 			rotation: f & 3,
 			collision: {
-				player: Lr(e.CollisionFlags_Player, r),
-				weapon: Lr(e.CollisionFlags_Weapon, r),
-				interaction: Lr(e.CollisionFlags_Interaction, r),
+				player: mi(e.CollisionFlags_Player, r),
+				weapon: mi(e.CollisionFlags_Weapon, r),
+				interaction: mi(e.CollisionFlags_Interaction, r),
 				tool: !0,
-				physics: Lr(e.CollisionFlags_Physics, r)
+				physics: mi(e.CollisionFlags_Physics, r)
 			},
-			visibility: Lr(e.VisibilityFlags, r),
+			visibility: mi(e.VisibilityFlags, r),
 			material_index: e.MaterialIndices[r],
 			material_intensity: m.A,
 			color: [
@@ -14906,7 +14944,7 @@ function _o(e, t, n) {
 	}
 	return s;
 }
-var vo = class e {
+var So = class e {
 	constructor(e, t = 0) {
 		this.fs = e, this.worldId = t, this.schemas = /* @__PURE__ */ new Map(), this.values = /* @__PURE__ */ new Map();
 	}
@@ -14944,6 +14982,25 @@ var vo = class e {
 	environment() {
 		return this.cached("Meta/World.json", () => JSON.parse(new TextDecoder().decode(this.fs.readFile("Meta/World.json"))));
 	}
+	prefabJson() {
+		return this.cached("Meta/Prefab.json", () => this.fs.findFileByPath("Meta/Prefab.json") ? JSON.parse(new TextDecoder().decode(this.fs.readFile("Meta/Prefab.json"))) : null);
+	}
+	thumbnail() {
+		return this.fs.findFileByPath("Meta/Thumbnail.png") ? this.fs.readFile("Meta/Thumbnail.png") : null;
+	}
+	prefabPaths() {
+		let e = [], t = (n) => {
+			for (let t of this.fs.childFiles(n)) e.push(`${n}/${t}`);
+			for (let e of this.fs.childFolders(n)) t(`${n}/${e}`);
+		};
+		return this.fs.childFolders("").includes("Prefabs") && t("Prefabs"), e;
+	}
+	readPrefab(e) {
+		return this.fs.readFile(e);
+	}
+	prefabReader(t) {
+		return e.from(this.readPrefab(t));
+	}
 	globalData() {
 		return this.cached(this.path("GlobalData.mps"), () => this.decode(this.path("GlobalData.mps"), this.path("GlobalData.schema"), "BRSavedGlobalDataSoA"));
 	}
@@ -15001,7 +15058,7 @@ var vo = class e {
 	}
 	*bricks(e = 1) {
 		let t = this.globalData().BasicBrickAssetNames.length;
-		for (let n of this.brickChunkIndex(e)) yield* _o(this.brickChunkSoa(e, n.index), n.index, t);
+		for (let n of this.brickChunkIndex(e)) yield* xo(this.brickChunkSoa(e, n.index), n.index, t);
 	}
 	entityChunkIndex() {
 		let e = this.decode(this.path("Entities/ChunkIndex.mps"), this.path("Entities/ChunkIndex.schema"), "BRSavedEntityChunkIndexSoA");
@@ -15083,11 +15140,11 @@ var vo = class e {
 					originalOwnerIndex: s.OriginalOwnerIndices?.[f] ?? s.OwnerIndices[f],
 					location: s.Locations[f],
 					rotation: s.Rotations[f],
-					frozen: Lr(s.PhysicsLockedFlags, f),
-					sleeping: Lr(s.PhysicsSleepingFlags, f),
+					frozen: mi(s.PhysicsLockedFlags, f),
+					sleeping: mi(s.PhysicsSleepingFlags, f),
 					linearVelocity: s.LinearVelocities[f],
 					angularVelocity: s.AngularVelocities[f],
-					colors: u ? go(e) : e,
+					colors: u ? bo(e) : e,
 					remainingLifeSpan: s.RemainingLifeSpans?.[f] ?? 0,
 					data: r ? i.readValue(o, r) : null
 				}), f += 1;
@@ -15099,74 +15156,74 @@ var vo = class e {
 	*entities() {
 		for (let e of this.entityChunkIndex().chunks) yield* this.entityChunk(e.index);
 	}
-}, yo, $ = "\n				", bo = "\n			", xo = `CREATE TABLE blobs (${$}blob_id INTEGER PRIMARY KEY,${$}compression INTEGER,${$}size_uncompressed INTEGER,${$}size_compressed INTEGER,${$}delta_base_id INTEGER REFERENCES blobs(blob_id),${$}hash BLOB,${$}content BLOB${bo});\nCREATE TABLE revisions (${$}revision_id INTEGER PRIMARY KEY,${$}description TEXT,${$}created_at INTEGER${bo});\nCREATE TABLE folders (${$}folder_id INTEGER PRIMARY KEY,${$}parent_id INTEGER REFERENCES folders(folder_id),${$}name TEXT,${$}created_at INTEGER,${$}deleted_at INTEGER${bo});\nCREATE TABLE files (${$}file_id INTEGER PRIMARY KEY,${$}parent_id INTEGER REFERENCES folders(folder_id),${$}name TEXT,${$}content_id INTEGER REFERENCES blobs(blob_id),${$}created_at INTEGER,${$}deleted_at INTEGER${bo});\nCREATE INDEX blobs_size_hash ON blobs(size_uncompressed, hash);
+}, Co, $ = "\n				", wo = "\n			", To = `CREATE TABLE blobs (${$}blob_id INTEGER PRIMARY KEY,${$}compression INTEGER,${$}size_uncompressed INTEGER,${$}size_compressed INTEGER,${$}delta_base_id INTEGER REFERENCES blobs(blob_id),${$}hash BLOB,${$}content BLOB${wo});\nCREATE TABLE revisions (${$}revision_id INTEGER PRIMARY KEY,${$}description TEXT,${$}created_at INTEGER${wo});\nCREATE TABLE folders (${$}folder_id INTEGER PRIMARY KEY,${$}parent_id INTEGER REFERENCES folders(folder_id),${$}name TEXT,${$}created_at INTEGER,${$}deleted_at INTEGER${wo});\nCREATE TABLE files (${$}file_id INTEGER PRIMARY KEY,${$}parent_id INTEGER REFERENCES folders(folder_id),${$}name TEXT,${$}content_id INTEGER REFERENCES blobs(blob_id),${$}created_at INTEGER,${$}deleted_at INTEGER${wo});\nCREATE INDEX blobs_size_hash ON blobs(size_uncompressed, hash);
 CREATE INDEX folders_parent_name_deleted ON folders(parent_id, name, deleted_at);
-CREATE INDEX files_parent_name_deleted ON files(parent_id, name, deleted_at);`, So = [
+CREATE INDEX files_parent_name_deleted ON files(parent_id, name, deleted_at);`, Eo = [
 	"blobs",
 	"revisions",
 	"folders",
 	"files"
-], Co = () => Math.floor(Date.now() / 1e3), wo = (e) => typeof Buffer > "u" ? e : Buffer.from(e.buffer, e.byteOffset, e.byteLength), To = (e) => {
+], Do = () => Math.floor(Date.now() / 1e3), Oo = (e) => typeof Buffer > "u" ? e : Buffer.from(e.buffer, e.byteOffset, e.byteLength), ko = (e) => {
 	try {
 		return typeof process < "u" ? process?.getBuiltinModule?.(e) ?? null : null;
 	} catch {
 		return null;
 	}
-}, Eo = null, Do = (e) => (Eo ?? (Eo = Function("specifier", "return import(specifier)")), Eo(e));
-async function Oo() {
+}, Ao = null, jo = (e) => (Ao ?? (Ao = Function("specifier", "return import(specifier)")), Ao(e));
+async function Mo() {
 	try {
-		let e = await (Ao.engineLoader ?? (() => Do("better-sqlite3")))();
+		let e = await (Po.engineLoader ?? (() => jo("better-sqlite3")))();
 		return e.default ?? e;
 	} catch {
 		throw Error("brdb: the Brdb openers require better-sqlite3 (npm install better-sqlite3), or wrap your own handle with new Brdb(db)");
 	}
 }
-function ko() {
-	let e = To("node:zlib");
+function No() {
+	let e = ko("node:zlib");
 	if (typeof e?.zstdCompressSync != "function") return null;
 	let t = e.constants.ZSTD_c_compressionLevel;
 	return (n) => new Uint8Array(e.zstdCompressSync(n, { params: { [t]: 14 } }));
 }
-var Ao = class e {
+var Po = class e {
 	constructor(e) {
 		this.db = e, this.defaultCompress = null;
-		for (let e of So) if (!this.db.prepare("SELECT name FROM sqlite_schema WHERE type = 'table' AND name = ?").get(e)) throw Error(`brdb: missing required table '${e}'`);
+		for (let e of Eo) if (!this.db.prepare("SELECT name FROM sqlite_schema WHERE type = 'table' AND name = ?").get(e)) throw Error(`brdb: missing required table '${e}'`);
 	}
-	static init(t, n = Co()) {
-		t.exec(xo);
+	static init(t, n = Do()) {
+		t.exec(To);
 		let r = new e(t);
 		return r.createRevision("Initial Revision", n), r;
 	}
 	static async wrap(t, n) {
 		try {
 			let r = n ? e.init(t) : new e(t);
-			return r.defaultCompress = ko(), r;
+			return r.defaultCompress = No(), r;
 		} catch (e) {
 			throw t.close(), e;
 		}
 	}
 	static async open(t) {
-		return e.wrap(new (await (Oo()))(t, { fileMustExist: !0 }), !1);
+		return e.wrap(new (await (Mo()))(t, { fileMustExist: !0 }), !1);
 	}
 	static async openReadonly(t) {
-		return e.wrap(new (await (Oo()))(t, {
+		return e.wrap(new (await (Mo()))(t, {
 			readonly: !0,
 			fileMustExist: !0
 		}), !1);
 	}
 	static async create(t) {
-		return e.wrap(new (await (Oo()))(t), !0);
+		return e.wrap(new (await (Mo()))(t), !0);
 	}
 	static async openOrCreate(t) {
-		let n = To("node:fs");
+		let n = ko("node:fs");
 		if (!n) throw Error("brdb: openOrCreate requires node 22.3 or newer; call open or create explicitly");
 		return n.existsSync(t) ? e.open(t) : e.create(t);
 	}
 	static async memory() {
-		return e.wrap(new (await (Oo()))(":memory:"), !0);
+		return e.wrap(new (await (Mo()))(":memory:"), !0);
 	}
 	static async fromBytes(t) {
-		return e.wrap(new (await (Oo()))(Buffer.from(t)), !1);
+		return e.wrap(new (await (Mo()))(Buffer.from(t)), !1);
 	}
 	toBytes() {
 		let e = this.db.serialize;
@@ -15174,15 +15231,15 @@ var Ao = class e {
 		return new Uint8Array(e.call(this.db));
 	}
 	save(e, t, n = {}) {
-		this.writePending(e, t instanceof fo ? t.toPendingFs(n) : so(t, n), n);
+		this.writePending(e, t instanceof go ? t.toPendingFs(n) : so(t, n), n);
 	}
 	worldReader() {
-		return new vo(this);
+		return new So(this);
 	}
 	sqliteSchema() {
 		return this.db.prepare("SELECT sql FROM sqlite_schema").all().map((e) => e.sql).join("\n");
 	}
-	createRevision(e, t = Co()) {
+	createRevision(e, t = Do()) {
 		return Number(this.db.prepare("INSERT INTO revisions (description, created_at) VALUES (?, ?);").run(e, t).lastInsertRowid);
 	}
 	revisions() {
@@ -15202,16 +15259,16 @@ var Ao = class e {
 		let r = this.findBlobByHash(e.length, t);
 		if (r) return r.blobId;
 		let i = e.length, a = i, o = 0, s = e, c = n ? n(e) : null;
-		return c && c.length < i && (a = c.length, o = 1, s = c), Number(this.db.prepare("INSERT INTO blobs (compression, size_uncompressed, size_compressed, delta_base_id, hash, content) VALUES (?, ?, ?, ?, ?, ?);").run(o, i, a, null, wo(t), wo(s)).lastInsertRowid);
+		return c && c.length < i && (a = c.length, o = 1, s = c), Number(this.db.prepare("INSERT INTO blobs (compression, size_uncompressed, size_compressed, delta_base_id, hash, content) VALUES (?, ?, ?, ?, ?, ?);").run(o, i, a, null, Oo(t), Oo(s)).lastInsertRowid);
 	}
 	findBlobByHash(e, t) {
-		let n = this.db.prepare("SELECT blob_id, compression, size_uncompressed, size_compressed, delta_base_id, hash, content FROM blobs WHERE hash = ? AND size_uncompressed = ? LIMIT 1;").get(wo(t), e);
-		return n ? jo(n) : null;
+		let n = this.db.prepare("SELECT blob_id, compression, size_uncompressed, size_compressed, delta_base_id, hash, content FROM blobs WHERE hash = ? AND size_uncompressed = ? LIMIT 1;").get(Oo(t), e);
+		return n ? Fo(n) : null;
 	}
 	findBlob(e) {
 		let t = this.db.prepare("SELECT blob_id, compression, size_uncompressed, size_compressed, delta_base_id, hash, content FROM blobs WHERE blob_id = ?;").get(e);
 		if (!t) throw Error(`brdb: blob ${e} not found`);
-		return jo(t);
+		return Fo(t);
 	}
 	deleteFile(e, t) {
 		this.db.prepare("UPDATE files SET deleted_at = ? WHERE file_id = ?;").run(t, e);
@@ -15238,7 +15295,7 @@ var Ao = class e {
 	}
 	findFile(e, t) {
 		let n = this.db.prepare(`SELECT content_id, created_at FROM files WHERE parent_id ${e === null ? "IS NULL" : "= ?"} AND name = ? AND deleted_at IS NULL;`).get(...e === null ? [t] : [e, t]);
-		return n ? Mo(n) : null;
+		return n ? Io(n) : null;
 	}
 	findFileAtRevision(e, t, n) {
 		let r = this.db.prepare(`SELECT content_id, created_at FROM files WHERE parent_id ${e === null ? "IS NULL" : "= ?"} AND name = ? AND created_at <= ? AND (deleted_at IS NULL OR deleted_at > ?) ORDER BY created_at ASC LIMIT 1;`).get(...e === null ? [
@@ -15251,13 +15308,13 @@ var Ao = class e {
 			n,
 			n
 		]);
-		return r ? Mo(r) : null;
+		return r ? Io(r) : null;
 	}
 	close() {
 		this.db.close();
 	}
 	writePending(e, t, n = {}) {
-		let r = n.createdAt ?? Co(), i = n.compress === void 0 ? this.defaultCompress : n.compress;
+		let r = n.createdAt ?? Do(), i = n.compress === void 0 ? this.defaultCompress : n.compress;
 		this.db.exec("BEGIN");
 		try {
 			this.createRevision(e, r), this.mergeFolder(null, t, r, i), this.db.exec("COMMIT");
@@ -15298,7 +15355,7 @@ var Ao = class e {
 					this.insertPending(s, e, c, n, r);
 					continue;
 				}
-				let o = hi(c.content), l = this.findBlobByHash(c.content.length, o);
+				let o = pi(c.content), l = this.findBlobByHash(c.content.length, o);
 				if (l && t.contentId === l.blobId) continue;
 				this.deleteFile(t.fileId, n);
 				let u = this.insertBlob(c.content, o, r);
@@ -15316,7 +15373,7 @@ var Ao = class e {
 				o.add(e), this.insertPending(e, a, t, r, i);
 			}
 		} else {
-			let a = this.insertBlob(n.content, hi(n.content), i);
+			let a = this.insertBlob(n.content, pi(n.content), i);
 			this.insertFile(e, t, a, r);
 		}
 	}
@@ -15384,8 +15441,8 @@ var Ao = class e {
 		return e(null);
 	}
 };
-yo = Ao, yo.engineLoader = null;
-var jo = (e) => ({
+Co = Po, Co.engineLoader = null;
+var Fo = (e) => ({
 	blobId: Number(e.blob_id),
 	compression: Number(e.compression),
 	sizeUncompressed: Number(e.size_uncompressed),
@@ -15393,15 +15450,15 @@ var jo = (e) => ({
 	deltaBaseId: e.delta_base_id === null ? null : Number(e.delta_base_id),
 	hash: new Uint8Array(e.hash),
 	content: new Uint8Array(e.content)
-}), Mo = (e) => ({
+}), Io = (e) => ({
 	contentId: e.content_id === null ? -1 : Number(e.content_id),
 	createdAt: Number(e.created_at)
-}), No = /* @__PURE__ */ t({
+}), Lo = /* @__PURE__ */ t({
 	BASIC_BRICK_ASSETS: () => qi,
-	BRDB_SQLITE_SCHEMA: () => xo,
+	BRDB_SQLITE_SCHEMA: () => To,
 	BRICK_ASSETS: () => Yi,
-	BitFlags: () => Rr,
-	Brdb: () => Ao,
+	BitFlags: () => hi,
+	Brdb: () => Po,
 	BrdbSchema: () => Ja,
 	BrzReader: () => Ki,
 	ByteReader: () => Wi,
@@ -15417,9 +15474,9 @@ var jo = (e) => ({
 	PROCEDURAL_BRICK_ASSETS: () => Ji,
 	PUBLIC_GUID: () => aa,
 	WIRE_PORT_NAMES: () => ta,
-	World: () => fo,
-	WorldReader: () => vo,
-	bit: () => Lr,
+	World: () => go,
+	WorldReader: () => So,
+	bit: () => mi,
 	embeddedSchema: () => Xa,
 	file: () => X,
 	folder: () => ca,
@@ -15430,17 +15487,17 @@ var jo = (e) => ({
 	toRelative: () => to,
 	uuidToGuid: () => oa,
 	writeBrzContainer: () => Gi,
-	writeBrzLegacy: () => po
-}), Po = {
-	read: Ar,
-	write: Nr,
-	utils: tr,
+	writeBrzLegacy: () => _o
+}), Ro = {
+	read: kr,
+	write: Mr,
+	utils: er,
 	constants: n,
-	types: Pr,
-	brdb: No
+	types: Nr,
+	brdb: Lo
 };
-typeof window < "u" && (window.BRS = Po);
+typeof window < "u" && (window.BRS = Ro);
 //#endregion
-export { Ao as Brdb, Fr as Direction, Ir as Rotation, fo as World, vo as WorldReader, No as brdb, n as constants, Po as default, Ar as read, Pr as types, tr as utils, Nr as write, po as writeBrzLegacy };
+export { Po as Brdb, Pr as Direction, Fr as Rotation, go as World, So as WorldReader, Lo as brdb, n as constants, Ro as default, kr as read, Nr as types, er as utils, Mr as write, _o as writeBrzLegacy };
 
 //# sourceMappingURL=dist.mjs.map