@roomle/web-sdk 3.6.0-alpha.3 → 3.6.0-alpha.5

package/lib/fflate.module-dFNj5UPI.mjs

@@ -0,0 +1,536 @@
+//#region ../../node_modules/three/examples/jsm/libs/fflate.module.js
+var e = Uint8Array, t = Uint16Array, n = Int32Array, r = new e([
+	0,
+	0,
+	0,
+	0,
+	0,
+	0,
+	0,
+	0,
+	1,
+	1,
+	1,
+	1,
+	2,
+	2,
+	2,
+	2,
+	3,
+	3,
+	3,
+	3,
+	4,
+	4,
+	4,
+	4,
+	5,
+	5,
+	5,
+	5,
+	0,
+	0,
+	0,
+	0
+]), i = new e([
+	0,
+	0,
+	0,
+	0,
+	1,
+	1,
+	2,
+	2,
+	3,
+	3,
+	4,
+	4,
+	5,
+	5,
+	6,
+	6,
+	7,
+	7,
+	8,
+	8,
+	9,
+	9,
+	10,
+	10,
+	11,
+	11,
+	12,
+	12,
+	13,
+	13,
+	0,
+	0
+]), a = new e([
+	16,
+	17,
+	18,
+	0,
+	8,
+	7,
+	9,
+	6,
+	10,
+	5,
+	11,
+	4,
+	12,
+	3,
+	13,
+	2,
+	14,
+	1,
+	15
+]), o = function(e, r) {
+	for (var i = new t(31), a = 0; a < 31; ++a) i[a] = r += 1 << e[a - 1];
+	for (var o = new n(i[30]), a = 1; a < 30; ++a) for (var s = i[a]; s < i[a + 1]; ++s) o[s] = s - i[a] << 5 | a;
+	return {
+		b: i,
+		r: o
+	};
+}, s = o(r, 2), c = s.b, l = s.r;
+c[28] = 258, l[258] = 28;
+for (var u = o(i, 0), d = u.b, f = u.r, p = new t(32768), m = 0; m < 32768; ++m) {
+	var h = (m & 43690) >> 1 | (m & 21845) << 1;
+	h = (h & 52428) >> 2 | (h & 13107) << 2, h = (h & 61680) >> 4 | (h & 3855) << 4, p[m] = ((h & 65280) >> 8 | (h & 255) << 8) >> 1;
+}
+for (var g = (function(e, n, r) {
+	for (var i = e.length, a = 0, o = new t(n); a < i; ++a) e[a] && ++o[e[a] - 1];
+	var s = new t(n);
+	for (a = 1; a < n; ++a) s[a] = s[a - 1] + o[a - 1] << 1;
+	var c;
+	if (r) {
+		c = new t(1 << n);
+		var l = 15 - n;
+		for (a = 0; a < i; ++a) if (e[a]) for (var u = a << 4 | e[a], d = n - e[a], f = s[e[a] - 1]++ << d, m = f | (1 << d) - 1; f <= m; ++f) c[p[f] >> l] = u;
+	} else for (c = new t(i), a = 0; a < i; ++a) e[a] && (c[a] = p[s[e[a] - 1]++] >> 15 - e[a]);
+	return c;
+}), _ = new e(288), m = 0; m < 144; ++m) _[m] = 8;
+for (var m = 144; m < 256; ++m) _[m] = 9;
+for (var m = 256; m < 280; ++m) _[m] = 7;
+for (var m = 280; m < 288; ++m) _[m] = 8;
+for (var v = new e(32), m = 0; m < 32; ++m) v[m] = 5;
+var y = /* @__PURE__ */ g(_, 9, 0), b = /* @__PURE__ */ g(_, 9, 1), x = /* @__PURE__ */ g(v, 5, 0), S = /* @__PURE__ */ g(v, 5, 1), C = function(e) {
+	for (var t = e[0], n = 1; n < e.length; ++n) e[n] > t && (t = e[n]);
+	return t;
+}, w = function(e, t, n) {
+	var r = t / 8 | 0;
+	return (e[r] | e[r + 1] << 8) >> (t & 7) & n;
+}, T = function(e, t) {
+	var n = t / 8 | 0;
+	return (e[n] | e[n + 1] << 8 | e[n + 2] << 16) >> (t & 7);
+}, ee = function(e) {
+	return (e + 7) / 8 | 0;
+}, E = function(t, n, r) {
+	return (n == null || n < 0) && (n = 0), (r == null || r > t.length) && (r = t.length), new e(t.subarray(n, r));
+}, D = [
+	"unexpected EOF",
+	"invalid block type",
+	"invalid length/literal",
+	"invalid distance",
+	"stream finished",
+	"no stream handler",
+	,
+	"no callback",
+	"invalid UTF-8 data",
+	"extra field too long",
+	"date not in range 1980-2099",
+	"filename too long",
+	"stream finishing",
+	"invalid zip data"
+], O = function(e, t, n) {
+	var r = Error(t || D[e]);
+	if (r.code = e, Error.captureStackTrace && Error.captureStackTrace(r, O), !n) throw r;
+	return r;
+}, k = function(t, n, o, s) {
+	var l = t.length, u = s ? s.length : 0;
+	if (!l || n.f && !n.l) return o || new e(0);
+	var f = !o, p = f || n.i != 2, m = n.i;
+	f && (o = new e(l * 3));
+	var h = function(t) {
+		var n = o.length;
+		if (t > n) {
+			var r = new e(Math.max(n * 2, t));
+			r.set(o), o = r;
+		}
+	}, _ = n.f || 0, v = n.p || 0, y = n.b || 0, x = n.l, D = n.d, k = n.m, A = n.n, j = l * 8;
+	do {
+		if (!x) {
+			_ = w(t, v, 1);
+			var M = w(t, v + 1, 3);
+			if (v += 3, !M) {
+				var N = ee(v) + 4, P = t[N - 4] | t[N - 3] << 8, F = N + P;
+				if (F > l) {
+					m && O(0);
+					break;
+				}
+				p && h(y + P), o.set(t.subarray(N, F), y), n.b = y += P, n.p = v = F * 8, n.f = _;
+				continue;
+			} else if (M == 1) x = b, D = S, k = 9, A = 5;
+			else if (M == 2) {
+				var te = w(t, v, 31) + 257, I = w(t, v + 10, 15) + 4, L = te + w(t, v + 5, 31) + 1;
+				v += 14;
+				for (var R = new e(L), z = new e(19), B = 0; B < I; ++B) z[a[B]] = w(t, v + B * 3, 7);
+				v += I * 3;
+				for (var V = C(z), H = (1 << V) - 1, U = g(z, V, 1), B = 0; B < L;) {
+					var W = U[w(t, v, H)];
+					v += W & 15;
+					var N = W >> 4;
+					if (N < 16) R[B++] = N;
+					else {
+						var G = 0, K = 0;
+						for (N == 16 ? (K = 3 + w(t, v, 3), v += 2, G = R[B - 1]) : N == 17 ? (K = 3 + w(t, v, 7), v += 3) : N == 18 && (K = 11 + w(t, v, 127), v += 7); K--;) R[B++] = G;
+					}
+				}
+				var q = R.subarray(0, te), J = R.subarray(te);
+				k = C(q), A = C(J), x = g(q, k, 1), D = g(J, A, 1);
+			} else O(1);
+			if (v > j) {
+				m && O(0);
+				break;
+			}
+		}
+		p && h(y + 131072);
+		for (var ne = (1 << k) - 1, re = (1 << A) - 1, Y = v;; Y = v) {
+			var G = x[T(t, v) & ne], X = G >> 4;
+			if (v += G & 15, v > j) {
+				m && O(0);
+				break;
+			}
+			if (G || O(2), X < 256) o[y++] = X;
+			else if (X == 256) {
+				Y = v, x = null;
+				break;
+			} else {
+				var Z = X - 254;
+				if (X > 264) {
+					var B = X - 257, Q = r[B];
+					Z = w(t, v, (1 << Q) - 1) + c[B], v += Q;
+				}
+				var $ = D[T(t, v) & re], ie = $ >> 4;
+				$ || O(3), v += $ & 15;
+				var J = d[ie];
+				if (ie > 3) {
+					var Q = i[ie];
+					J += T(t, v) & (1 << Q) - 1, v += Q;
+				}
+				if (v > j) {
+					m && O(0);
+					break;
+				}
+				p && h(y + 131072);
+				var ae = y + Z;
+				if (y < J) {
+					var oe = u - J, se = Math.min(J, ae);
+					for (oe + y < 0 && O(3); y < se; ++y) o[y] = s[oe + y];
+				}
+				for (; y < ae; ++y) o[y] = o[y - J];
+			}
+		}
+		n.l = x, n.p = Y, n.b = y, n.f = _, x && (_ = 1, n.m = k, n.d = D, n.n = A);
+	} while (!_);
+	return y != o.length && f ? E(o, 0, y) : o.subarray(0, y);
+}, A = function(e, t, n) {
+	n <<= t & 7;
+	var r = t / 8 | 0;
+	e[r] |= n, e[r + 1] |= n >> 8;
+}, j = function(e, t, n) {
+	n <<= t & 7;
+	var r = t / 8 | 0;
+	e[r] |= n, e[r + 1] |= n >> 8, e[r + 2] |= n >> 16;
+}, M = function(n, r) {
+	for (var i = [], a = 0; a < n.length; ++a) n[a] && i.push({
+		s: a,
+		f: n[a]
+	});
+	var o = i.length, s = i.slice();
+	if (!o) return {
+		t: R,
+		l: 0
+	};
+	if (o == 1) {
+		var c = new e(i[0].s + 1);
+		return c[i[0].s] = 1, {
+			t: c,
+			l: 1
+		};
+	}
+	i.sort(function(e, t) {
+		return e.f - t.f;
+	}), i.push({
+		s: -1,
+		f: 25001
+	});
+	var l = i[0], u = i[1], d = 0, f = 1, p = 2;
+	for (i[0] = {
+		s: -1,
+		f: l.f + u.f,
+		l,
+		r: u
+	}; f != o - 1;) l = i[i[d].f < i[p].f ? d++ : p++], u = i[d != f && i[d].f < i[p].f ? d++ : p++], i[f++] = {
+		s: -1,
+		f: l.f + u.f,
+		l,
+		r: u
+	};
+	for (var m = s[0].s, a = 1; a < o; ++a) s[a].s > m && (m = s[a].s);
+	var h = new t(m + 1), g = N(i[f - 1], h, 0);
+	if (g > r) {
+		var a = 0, _ = 0, v = g - r, y = 1 << v;
+		for (s.sort(function(e, t) {
+			return h[t.s] - h[e.s] || e.f - t.f;
+		}); a < o; ++a) {
+			var b = s[a].s;
+			if (h[b] > r) _ += y - (1 << g - h[b]), h[b] = r;
+			else break;
+		}
+		for (_ >>= v; _ > 0;) {
+			var x = s[a].s;
+			h[x] < r ? _ -= 1 << r - h[x]++ - 1 : ++a;
+		}
+		for (; a >= 0 && _; --a) {
+			var S = s[a].s;
+			h[S] == r && (--h[S], ++_);
+		}
+		g = r;
+	}
+	return {
+		t: new e(h),
+		l: g
+	};
+}, N = function(e, t, n) {
+	return e.s == -1 ? Math.max(N(e.l, t, n + 1), N(e.r, t, n + 1)) : t[e.s] = n;
+}, P = function(e) {
+	for (var n = e.length; n && !e[--n];);
+	for (var r = new t(++n), i = 0, a = e[0], o = 1, s = function(e) {
+		r[i++] = e;
+	}, c = 1; c <= n; ++c) if (e[c] == a && c != n) ++o;
+	else {
+		if (!a && o > 2) {
+			for (; o > 138; o -= 138) s(32754);
+			o > 2 && (s(o > 10 ? o - 11 << 5 | 28690 : o - 3 << 5 | 12305), o = 0);
+		} else if (o > 3) {
+			for (s(a), --o; o > 6; o -= 6) s(8304);
+			o > 2 && (s(o - 3 << 5 | 8208), o = 0);
+		}
+		for (; o--;) s(a);
+		o = 1, a = e[c];
+	}
+	return {
+		c: r.subarray(0, i),
+		n
+	};
+}, F = function(e, t) {
+	for (var n = 0, r = 0; r < t.length; ++r) n += e[r] * t[r];
+	return n;
+}, te = function(e, t, n) {
+	var r = n.length, i = ee(t + 2);
+	e[i] = r & 255, e[i + 1] = r >> 8, e[i + 2] = e[i] ^ 255, e[i + 3] = e[i + 1] ^ 255;
+	for (var a = 0; a < r; ++a) e[i + a + 4] = n[a];
+	return (i + 4 + r) * 8;
+}, I = function(e, n, o, s, c, l, u, d, f, p, m) {
+	A(n, m++, o), ++c[256];
+	for (var h = M(c, 15), b = h.t, S = h.l, C = M(l, 15), w = C.t, T = C.l, ee = P(b), E = ee.c, D = ee.n, O = P(w), k = O.c, N = O.n, I = new t(19), L = 0; L < E.length; ++L) ++I[E[L] & 31];
+	for (var L = 0; L < k.length; ++L) ++I[k[L] & 31];
+	for (var R = M(I, 7), z = R.t, B = R.l, V = 19; V > 4 && !z[a[V - 1]]; --V);
+	var H = p + 5 << 3, U = F(c, _) + F(l, v) + u, W = F(c, b) + F(l, w) + u + 14 + 3 * V + F(I, z) + 2 * I[16] + 3 * I[17] + 7 * I[18];
+	if (f >= 0 && H <= U && H <= W) return te(n, m, e.subarray(f, f + p));
+	var G, K, q, J;
+	if (A(n, m, 1 + (W < U)), m += 2, W < U) {
+		G = g(b, S, 0), K = b, q = g(w, T, 0), J = w;
+		var ne = g(z, B, 0);
+		A(n, m, D - 257), A(n, m + 5, N - 1), A(n, m + 10, V - 4), m += 14;
+		for (var L = 0; L < V; ++L) A(n, m + 3 * L, z[a[L]]);
+		m += 3 * V;
+		for (var re = [E, k], Y = 0; Y < 2; ++Y) for (var X = re[Y], L = 0; L < X.length; ++L) {
+			var Z = X[L] & 31;
+			A(n, m, ne[Z]), m += z[Z], Z > 15 && (A(n, m, X[L] >> 5 & 127), m += X[L] >> 12);
+		}
+	} else G = y, K = _, q = x, J = v;
+	for (var L = 0; L < d; ++L) {
+		var Q = s[L];
+		if (Q > 255) {
+			var Z = Q >> 18 & 31;
+			j(n, m, G[Z + 257]), m += K[Z + 257], Z > 7 && (A(n, m, Q >> 23 & 31), m += r[Z]);
+			var $ = Q & 31;
+			j(n, m, q[$]), m += J[$], $ > 3 && (j(n, m, Q >> 5 & 8191), m += i[$]);
+		} else j(n, m, G[Q]), m += K[Q];
+	}
+	return j(n, m, G[256]), m + K[256];
+}, L = /* @__PURE__ */ new n([
+	65540,
+	131080,
+	131088,
+	131104,
+	262176,
+	1048704,
+	1048832,
+	2114560,
+	2117632
+]), R = /* @__PURE__ */ new e(0), z = function(a, o, s, c, u, d) {
+	var p = d.z || a.length, m = new e(c + p + 5 * (1 + Math.ceil(p / 7e3)) + u), h = m.subarray(c, m.length - u), g = d.l, _ = (d.r || 0) & 7;
+	if (o) {
+		_ && (h[0] = d.r >> 3);
+		for (var v = L[o - 1], y = v >> 13, b = v & 8191, x = (1 << s) - 1, S = d.p || new t(32768), C = d.h || new t(x + 1), w = Math.ceil(s / 3), T = 2 * w, D = function(e) {
+			return (a[e] ^ a[e + 1] << w ^ a[e + 2] << T) & x;
+		}, O = new n(25e3), k = new t(288), A = new t(32), j = 0, M = 0, N = d.i || 0, P = 0, F = d.w || 0, R = 0; N + 2 < p; ++N) {
+			var z = D(N), B = N & 32767, V = C[z];
+			if (S[B] = V, C[z] = B, F <= N) {
+				var H = p - N;
+				if ((j > 7e3 || P > 24576) && (H > 423 || !g)) {
+					_ = I(a, h, 0, O, k, A, M, P, R, N - R, _), P = j = M = 0, R = N;
+					for (var U = 0; U < 286; ++U) k[U] = 0;
+					for (var U = 0; U < 30; ++U) A[U] = 0;
+				}
+				var W = 2, G = 0, K = b, q = B - V & 32767;
+				if (H > 2 && z == D(N - q)) for (var J = Math.min(y, H) - 1, ne = Math.min(32767, N), re = Math.min(258, H); q <= ne && --K && B != V;) {
+					if (a[N + W] == a[N + W - q]) {
+						for (var Y = 0; Y < re && a[N + Y] == a[N + Y - q]; ++Y);
+						if (Y > W) {
+							if (W = Y, G = q, Y > J) break;
+							for (var X = Math.min(q, Y - 2), Z = 0, U = 0; U < X; ++U) {
+								var Q = N - q + U & 32767, $ = Q - S[Q] & 32767;
+								$ > Z && (Z = $, V = Q);
+							}
+						}
+					}
+					B = V, V = S[B], q += B - V & 32767;
+				}
+				if (G) {
+					O[P++] = 268435456 | l[W] << 18 | f[G];
+					var ie = l[W] & 31, ae = f[G] & 31;
+					M += r[ie] + i[ae], ++k[257 + ie], ++A[ae], F = N + W, ++j;
+				} else O[P++] = a[N], ++k[a[N]];
+			}
+		}
+		for (N = Math.max(N, F); N < p; ++N) O[P++] = a[N], ++k[a[N]];
+		_ = I(a, h, g, O, k, A, M, P, R, N - R, _), g || (d.r = _ & 7 | h[_ / 8 | 0] << 3, _ -= 7, d.h = C, d.p = S, d.i = N, d.w = F);
+	} else {
+		for (var N = d.w || 0; N < p + g; N += 65535) {
+			var oe = N + 65535;
+			oe >= p && (h[_ / 8 | 0] = g, oe = p), _ = te(h, _ + 1, a.subarray(N, oe));
+		}
+		d.i = p;
+	}
+	return E(m, 0, c + ee(_) + u);
+}, B = /* @__PURE__ */ (function() {
+	for (var e = new Int32Array(256), t = 0; t < 256; ++t) {
+		for (var n = t, r = 9; --r;) n = (n & 1 && -306674912) ^ n >>> 1;
+		e[t] = n;
+	}
+	return e;
+})(), V = function() {
+	var e = -1;
+	return {
+		p: function(t) {
+			for (var n = e, r = 0; r < t.length; ++r) n = B[n & 255 ^ t[r]] ^ n >>> 8;
+			e = n;
+		},
+		d: function() {
+			return ~e;
+		}
+	};
+}, H = function(t, n, r, i, a) {
+	if (!a && (a = { l: 1 }, n.dictionary)) {
+		var o = n.dictionary.subarray(-32768), s = new e(o.length + t.length);
+		s.set(o), s.set(t, o.length), t = s, a.w = o.length;
+	}
+	return z(t, n.level == null ? 6 : n.level, n.mem == null ? a.l ? Math.ceil(Math.max(8, Math.min(13, Math.log(t.length))) * 1.5) : 20 : 12 + n.mem, r, i, a);
+}, U = function(e, t) {
+	var n = {};
+	for (var r in e) n[r] = e[r];
+	for (var r in t) n[r] = t[r];
+	return n;
+}, W = function(e, t, n) {
+	for (; n; ++t) e[t] = n, n >>>= 8;
+}, G = function(e, t) {
+	return ((e[0] & 15) != 8 || e[0] >> 4 > 7 || (e[0] << 8 | e[1]) % 31) && O(6, "invalid zlib data"), (e[1] >> 5 & 1) == +!t && O(6, "invalid zlib data: " + (e[1] & 32 ? "need" : "unexpected") + " dictionary"), (e[1] >> 3 & 4) + 2;
+};
+function K(e, t) {
+	return H(e, t || {}, 0, 0);
+}
+function q(e, t) {
+	return k(e.subarray(G(e, t && t.dictionary), -4), { i: 2 }, t && t.out, t && t.dictionary);
+}
+var J = function(t, n, r, i) {
+	for (var a in t) {
+		var o = t[a], s = n + a, c = i;
+		Array.isArray(o) && (c = U(i, o[1]), o = o[0]), o instanceof e ? r[s] = [o, c] : (r[s += "/"] = [new e(0), c], J(o, s, r, i));
+	}
+}, ne = typeof TextEncoder < "u" && /* @__PURE__ */ new TextEncoder(), re = typeof TextDecoder < "u" && /* @__PURE__ */ new TextDecoder();
+try {
+	re.decode(R, { stream: !0 });
+} catch {}
+function Y(t, n) {
+	if (n) {
+		for (var r = new e(t.length), i = 0; i < t.length; ++i) r[i] = t.charCodeAt(i);
+		return r;
+	}
+	if (ne) return ne.encode(t);
+	for (var a = t.length, o = new e(t.length + (t.length >> 1)), s = 0, c = function(e) {
+		o[s++] = e;
+	}, i = 0; i < a; ++i) {
+		if (s + 5 > o.length) {
+			var l = new e(s + 8 + (a - i << 1));
+			l.set(o), o = l;
+		}
+		var u = t.charCodeAt(i);
+		u < 128 || n ? c(u) : u < 2048 ? (c(192 | u >> 6), c(128 | u & 63)) : u > 55295 && u < 57344 ? (u = 65536 + (u & 1047552) | t.charCodeAt(++i) & 1023, c(240 | u >> 18), c(128 | u >> 12 & 63), c(128 | u >> 6 & 63), c(128 | u & 63)) : (c(224 | u >> 12), c(128 | u >> 6 & 63), c(128 | u & 63));
+	}
+	return E(o, 0, s);
+}
+var X = function(e) {
+	var t = 0;
+	if (e) for (var n in e) {
+		var r = e[n].length;
+		r > 65535 && O(9), t += r + 4;
+	}
+	return t;
+}, Z = function(e, t, n, r, i, a, o, s) {
+	var c = r.length, l = n.extra, u = s && s.length, d = X(l);
+	W(e, t, o == null ? 67324752 : 33639248), t += 4, o != null && (e[t++] = 20, e[t++] = n.os), e[t] = 20, t += 2, e[t++] = n.flag << 1 | (a < 0 && 8), e[t++] = i && 8, e[t++] = n.compression & 255, e[t++] = n.compression >> 8;
+	var f = new Date(n.mtime == null ? Date.now() : n.mtime), p = f.getFullYear() - 1980;
+	if ((p < 0 || p > 119) && O(10), W(e, t, p << 25 | f.getMonth() + 1 << 21 | f.getDate() << 16 | f.getHours() << 11 | f.getMinutes() << 5 | f.getSeconds() >> 1), t += 4, a != -1 && (W(e, t, n.crc), W(e, t + 4, a < 0 ? -a - 2 : a), W(e, t + 8, n.size)), W(e, t + 12, c), W(e, t + 14, d), t += 16, o != null && (W(e, t, u), W(e, t + 6, n.attrs), W(e, t + 10, o), t += 14), e.set(r, t), t += c, d) for (var m in l) {
+		var h = l[m], g = h.length;
+		W(e, t, +m), W(e, t + 2, g), e.set(h, t + 4), t += 4 + g;
+	}
+	return u && (e.set(s, t), t += u), t;
+}, Q = function(e, t, n, r, i) {
+	W(e, t, 101010256), W(e, t + 8, n), W(e, t + 10, n), W(e, t + 12, r), W(e, t + 16, i);
+};
+function $(t, n) {
+	n ||= {};
+	var r = {}, i = [];
+	J(t, "", r, n);
+	var a = 0, o = 0;
+	for (var s in r) {
+		var c = r[s], l = c[0], u = c[1], d = u.level == 0 ? 0 : 8, f = Y(s), p = f.length, m = u.comment, h = m && Y(m), g = h && h.length, _ = X(u.extra);
+		p > 65535 && O(11);
+		var v = d ? K(l, u) : l, y = v.length, b = V();
+		b.p(l), i.push(U(u, {
+			size: l.length,
+			crc: b.d(),
+			c: v,
+			f,
+			m: h,
+			u: p != s.length || h && m.length != g,
+			o: a,
+			compression: d
+		})), a += 30 + p + _ + y, o += 76 + 2 * (p + _) + (g || 0) + y;
+	}
+	for (var x = new e(o + 22), S = a, C = o - a, w = 0; w < i.length; ++w) {
+		var f = i[w];
+		Z(x, f.o, f, f.f, f.u, f.c.length);
+		var T = 30 + f.f.length + X(f.extra);
+		x.set(f.c, f.o + T), Z(x, a, f, f.f, f.u, f.c.length, f.o, f.m), a += 16 + T + (f.m ? f.m.length : 0);
+	}
+	return Q(x, a, i.length, C, S), x;
+}
+//#endregion
+export { q as n, $ as r, Y as t };
+
+//# sourceMappingURL=fflate.module-dFNj5UPI.mjs.map