@kalyptos/narcissus 0.1.3 → 0.2.1

package/dist/{format-C3Vn0c2b.js → format-CbtEy9NS.js}

@@ -71,7 +71,18 @@ function A(e, t) {
 		length: e.getUint32(t + 48, !0)
 	};
 }
-async function j(e) {
+async function j(e, t) {
+	if (t < 16) throw Error("is shorter than a pack trailer");
+	let n = await e(t - 16, t), r = new DataView(n.buffer, n.byteOffset, n.byteLength);
+	if (String.fromCharCode(...n.subarray(8, 12)) !== "GMPK") throw Error("does not end in a pack trailer");
+	let i = r.getUint16(12, !0);
+	if (i !== 1) throw Error(`is version ${i}; narcissus reads 1`);
+	let a = r.getUint32(0, !0), o = r.getUint32(4, !0);
+	if (a + o * 52 !== t - 16) throw Error("has a page table that does not end at its trailer");
+	let s = await e(a, t - 16), c = new DataView(s.buffer, s.byteOffset, s.byteLength);
+	return Array.from({ length: o }, (e, t) => A(c, t * 52));
+}
+async function M(e) {
 	let t = await O(e, a, ".idx");
 	if (t.byteLength < 40) throw Error(".idx header is cut off");
 	let n = t.getUint16(32, !0), r = t.getUint8(34), i = t.getUint16(36, !0), o = 40 + n * 52 + r * 9 + i * 11;
@@ -100,12 +111,12 @@ async function j(e) {
 	});
 	return c;
 }
-function M(e, t, n) {
+function N(e, t, n) {
 	return `u/${e.level}/${e.e}/${e.n}.${t}.${n}`;
 }
-var N = /(?:^|\/)u\/(\d+)\/(-?\d+)\/(-?\d+)\.([0-9a-f]{16})\.(?:idx|pack|col)$/;
-function P(e) {
-	let t = N.exec(e);
+var P = /(?:^|\/)u\/(\d+)\/(-?\d+)\/(-?\d+)\.([0-9a-f]{16})\.(?:idx|pack|col)$/;
+function F(e) {
+	let t = P.exec(e);
 	return t ? {
 		level: Number(t[1]),
 		e: Number(t[2]),
@@ -113,7 +124,7 @@ function P(e) {
 		hash: t[4]
 	} : null;
 }
-function F(e) {
+function I(e) {
 	let { level: t, e: n, n: r } = e, i = 250 * 2 ** (t - 1), a = e.children.map(({ quadrant: e, idx: a }) => ({
 		key: {
 			level: t - 1,
@@ -137,7 +148,7 @@ function F(e) {
 }
 //#endregion
 //#region src/format/world.ts
-var ee = /* @__PURE__ */ new Set([
+var L = /* @__PURE__ */ new Set([
 	"version",
 	"crs",
 	"height",
@@ -145,62 +156,62 @@ var ee = /* @__PURE__ */ new Set([
 	"roots",
 	"extent"
 ]);
-function I(e) {
+function R(e) {
 	return /* @__PURE__ */ Error(`This world has ${e}.`);
 }
-function L(e, t) {
-	if (typeof e != "object" || !e || Array.isArray(e)) throw I(t);
+function z(e, t) {
+	if (typeof e != "object" || !e || Array.isArray(e)) throw R(t);
 	return e;
 }
-function R(e, t) {
-	if (typeof e != "string" || e === "") throw I(t);
+function B(e, t) {
+	if (typeof e != "string" || e === "") throw R(t);
 	return e;
 }
-function z(e, t) {
-	if (!Array.isArray(e) || e.length !== 2 || !e.every(Number.isFinite) || e[0] > e[1]) throw I(t);
+function V(e, t) {
+	if (!Array.isArray(e) || e.length !== 2 || !e.every(Number.isFinite) || e[0] > e[1]) throw R(t);
 	return [e[0], e[1]];
 }
-function te(e) {
-	let t = L(e, "an invalid root"), { level: n, e: r, n: i } = t;
-	if (!Number.isInteger(n) || !Number.isInteger(r) || !Number.isInteger(i) || n < 0) throw I("an invalid root");
+function ee(e) {
+	let t = z(e, "an invalid root"), { level: n, e: r, n: i } = t;
+	if (!Number.isInteger(n) || !Number.isInteger(r) || !Number.isInteger(i) || n < 0) throw R("an invalid root");
 	let a = {
 		level: n,
 		e: r,
 		n: i
-	}, o = 250 * 2 ** a.level, s = R(t.idx, "a root without an index"), c = P(s);
-	if (a.e % o !== 0 || a.n % o !== 0 || !s.endsWith(".idx") || !c || c.level !== a.level || c.e !== a.e || c.n !== a.n) throw I("a root whose index does not match its unit");
+	}, o = 250 * 2 ** a.level, s = B(t.idx, "a root without an index"), c = F(s);
+	if (a.e % o !== 0 || a.n % o !== 0 || !s.endsWith(".idx") || !c || c.level !== a.level || c.e !== a.e || c.n !== a.n) throw R("a root whose index does not match its unit");
 	return {
 		...a,
 		idx: s
 	};
 }
-function ne(e) {
+function te(e) {
 	let t = e.split(/[?#]/)[0];
 	return t.slice(0, t.lastIndexOf("/") + 1);
 }
-function re(e) {
-	let t = L(e, "an unreadable world.json");
+function ne(e) {
+	let t = z(e, "an unreadable world.json");
 	if (t.version !== 1) throw Error(`This world is version ${String(t.version)}; narcissus reads 1.`);
-	if (t.leaf !== 250) throw I(`${String(t.leaf)} m leaf units, not 250 m`);
-	if (!Array.isArray(t.roots) || t.roots.length === 0) throw I("no roots");
-	let n = L(t.extent, "no extent");
+	if (t.leaf !== 250) throw R(`${String(t.leaf)} m leaf units, not 250 m`);
+	if (!Array.isArray(t.roots) || t.roots.length === 0) throw R("no roots");
+	let n = z(t.extent, "no extent");
 	return {
 		version: 1,
-		crs: R(t.crs, "no coordinate system"),
-		height: R(t.height, "no height datum"),
+		crs: B(t.crs, "no coordinate system"),
+		height: B(t.height, "no height datum"),
 		leaf: 250,
-		roots: t.roots.map(te),
+		roots: t.roots.map(ee),
 		extent: {
-			e: z(n.e, "an invalid easting extent"),
-			n: z(n.n, "an invalid northing extent"),
-			h: z(n.h, "an invalid height extent")
+			e: V(n.e, "an invalid easting extent"),
+			n: V(n.n, "an invalid northing extent"),
+			h: V(n.h, "an invalid height extent")
 		},
-		extra: Object.fromEntries(Object.entries(t).filter(([e]) => !ee.has(e)))
+		extra: Object.fromEntries(Object.entries(t).filter(([e]) => !L.has(e)))
 	};
 }
 //#endregion
 //#region src/format/col.ts
-async function ie(e) {
+async function re(e) {
 	let t = await O(e, o, ".col");
 	if (t.byteLength < 60) throw Error(".col header is cut off");
 	let n = t.getUint16(0, !0), r = 60 + 12 * n * n;
@@ -220,28 +231,28 @@ async function ie(e) {
 		values: i
 	};
 }
-function ae(e, t, n, r) {
+function ie(e, t, n, r) {
 	let { n: i, pitch: a, margin: o, values: s } = e, c = i - 1, l = Math.min(Math.max((t + o) / a - .5, 0), c), u = Math.min(Math.max((n + o) / a - .5, 0), c), d = Math.min(Math.floor(l), Math.max(c - 1, 0)), f = Math.min(Math.floor(u), Math.max(c - 1, 0)), p = Math.min(d + 1, c), m = Math.min(f + 1, c), h = l - d, g = u - f, _ = (1 - h) * (1 - g), v = h * (1 - g), y = (1 - h) * g, b = h * g, x = i * i;
 	for (let e = 0, t = 0; e < 12; e++, t += x) r[e] = s[t + f * i + d] * _ + s[t + f * i + p] * v + s[t + m * i + d] * y + s[t + m * i + p] * b;
 	return r;
 }
 //#endregion
 //#region src/format/page.ts
-var B = Float64Array.from({ length: 256 }, (e, t) => (t / 255 - .5) * Math.SQRT2);
-function oe(e, t, n, r, i) {
-	let a = B[t], o = B[n], s = B[r];
+var H = Float64Array.from({ length: 256 }, (e, t) => (t / 255 - .5) * Math.SQRT2);
+function ae(e, t, n, r, i) {
+	let a = H[t], o = H[n], s = H[r];
 	i[e] = Math.sqrt(Math.max(0, 1 - a * a - o * o - s * s)), i[e > 0 ? 0 : 1] = a, i[e > 1 ? 1 : 2] = o, i[e > 2 ? 2 : 3] = s;
 }
-function se(e, t, n, r, i) {
+function oe(e, t, n, r, i) {
 	let a = e[0], o = e[1], s = e[2], c = e[3], l = t * t, u = n * n, d = r * r, f = 1 - 2 * (s * s + c * c), p = 2 * (o * s - a * c), m = 2 * (o * c + a * s), h = 2 * (o * s + a * c), g = 1 - 2 * (o * o + c * c), _ = 2 * (s * c - a * o), v = 2 * (o * c - a * s), y = 2 * (s * c + a * o), b = 1 - 2 * (o * o + s * s);
 	i[0] = 3 * Math.sqrt(f * f * l + p * p * u + m * m * d), i[1] = 3 * Math.sqrt(h * h * l + g * g * u + _ * _ * d), i[2] = 3 * Math.sqrt(v * v * l + y * y * u + b * b * d);
 }
-function ce(e) {
+function se(e) {
 	if (e.length < 128) throw Error("page payload is shorter than its header");
 	return new DataView(e.buffer, e.byteOffset, e.byteLength);
 }
-function le(e) {
-	let t = ce(e), n = t.getUint32(0, !0), r = t.getUint16(16, !0), i = 128 + (17 + (r > 0 ? 2 : 0)) * n, a = i + r * 9;
+function ce(e) {
+	let t = se(e), n = t.getUint32(0, !0), r = t.getUint16(16, !0), i = 128 + (17 + (r > 0 ? 2 : 0)) * n, a = i + r * 9;
 	if (e.length !== a) throw Error(`page payload holds ${e.length} bytes, its header needs ${a}`);
 	return {
 		view: t,
@@ -250,15 +261,15 @@ function le(e) {
 		book: i
 	};
 }
-function ue(e) {
+function le(e) {
 	return [
 		e.getUint32(4, !0),
 		e.getUint32(8, !0),
 		e.getUint32(12, !0)
 	];
 }
-function de(e, t) {
-	let { view: n, count: r, k: i, book: a } = le(e), o = /* @__PURE__ */ new Float32Array(27);
+function ue(e, t) {
+	let { view: n, count: r, k: i, book: a } = ce(e), o = /* @__PURE__ */ new Float32Array(27);
 	for (let e = 0; e < 27; e++) o[e] = n.getFloat32(20 + 4 * e, !0);
 	i === 0 && o.fill(0, C.shScale);
 	let s = new Uint32Array(r * 4), c = new Float32Array(Math.ceil(r / 256) * 6), l = /* @__PURE__ */ new Float64Array(768);
@@ -273,7 +284,7 @@ function de(e, t) {
 			let t = e[p + n] | e[p + r + n] << 8;
 			x = x + (t >>> 1 ^ -(t & 1)) & 65535, t = e[p + 2 * r + n] | e[p + 3 * r + n] << 8, S = S + (t >>> 1 ^ -(t & 1)) & 65535, t = e[p + 4 * r + n] | e[p + 5 * r + n] << 8, w = w + (t >>> 1 ^ -(t & 1)) & 65535;
 			let c = e[h + n], E = e[g + n], D = e[g + r + n], O = e[g + 2 * r + n], k = e[v + n], A = e[v + r + n], j = e[v + 2 * r + n], M = n * 4;
-			s[M] = x | S << 16, s[M + 1] = w | e[m + n] << 16 | c << 24, s[M + 2] = E | D << 8 | O << 16 | k << 24, s[M + 3] = A | j << 8, oe(c, E, D, O, y), se(y, l[k], l[256 + A], l[512 + j], b);
+			s[M] = x | S << 16, s[M + 1] = w | e[m + n] << 16 | c << 24, s[M + 2] = E | D << 8 | O << 16 | k << 24, s[M + 3] = A | j << 8, ae(c, E, D, O, y), oe(y, l[k], l[256 + A], l[512 + j], b);
 			let N = x * u, P = S * d, F = w * f;
 			i = Math.min(i, N - b[0]), a = Math.min(a, P - b[1]), o = Math.min(o, F - b[2]), _ = Math.max(_, N + b[0]), C = Math.max(C, P + b[1]), T = Math.max(T, F + b[2]);
 		}
@@ -286,17 +297,17 @@ function de(e, t) {
 			T
 		], t * 6);
 	}
-	let T = t ? pe(e, r, i, a, s, o, t) : fe(e, r, i, a);
+	let T = t ? fe(e, r, i, a, s, o, t) : de(e, r, i, a);
 	return {
 		count: r,
-		quadrants: ue(n),
+		quadrants: le(n),
 		geometry: s,
 		colour: T,
 		params: o,
 		clusters: c
 	};
 }
-function fe(e, t, n, r) {
+function de(e, t, n, r) {
 	let i = new Uint32Array(t * 3), a = 128 + _.dc * t, o = 128 + _.label * t;
 	for (let s = 0; s < t; s++) {
 		let c = s * 3;
@@ -306,7 +317,7 @@ function fe(e, t, n, r) {
 	}
 	return i;
 }
-function pe(t, n, r, i, a, o, s) {
+function fe(t, n, r, i, a, o, s) {
 	let c = 128 + _.dc * n, l = 128 + _.label * n, u = new Int8Array(t.buffer, t.byteOffset + i, r * 9), d = new Float32Array(n * 3), f = new Float32Array(n * 9), p = [
 		Infinity,
 		Infinity,
@@ -324,7 +335,7 @@ function pe(t, n, r, i, a, o, s) {
 	for (let e = 0; e < r * 9; e++) w[e] = u[e] / 127 * o[C.shScale + e % 9];
 	for (let i = 0; i < n; i++) {
 		let o = a[i * 4];
-		ae(s, v + (o & 65535) * b, y + (o >>> 16) * x, g);
+		ie(s, v + (o & 65535) * b, y + (o >>> 16) * x, g);
 		for (let r = 0; r < 3; r++) {
 			let a = i * 3 + r;
 			d[a] = S[r * 256 + t[c + r * n + i]] + g[r] / e, p[r] = Math.min(p[r], d[a]), m[r] = Math.max(m[r], d[a]);
@@ -362,14 +373,14 @@ function pe(t, n, r, i, a, o, s) {
 	}
 	return O;
 }
-function me(e) {
-	let t = ce(e);
+function pe(e) {
+	let t = se(e);
 	return {
 		count: t.getUint32(0, !0),
-		quadrants: ue(t)
+		quadrants: le(t)
 	};
 }
-function V(e) {
+function me(e) {
 	return [
 		e(0),
 		e(1),
@@ -382,20 +393,20 @@ function he(t, n) {
 		i[0] >>> 16,
 		i[1] & 65535
 	], l = /* @__PURE__ */ new Float64Array(4);
-	oe(o(i, 7), o(i, 8), o(i, 9), o(i, 10), l);
+	ae(o(i, 7), o(i, 8), o(i, 9), o(i, 10), l);
 	let u = [];
 	for (let e = 0; e < 9; e++) u.push((o(a, e + 3) << 24 >> 24) / 127 * r[C.shScale + e]);
 	return {
-		position: V((e) => r[C.origin + e] + c[e] * r[C.step + e]),
+		position: me((e) => r[C.origin + e] + c[e] * r[C.step + e]),
 		rotation: [
 			l[0],
 			l[1],
 			l[2],
 			l[3]
 		],
-		scale: V((e) => Math.exp(s(C.scaleMin, C.scaleMax, e, o(i, 11 + e)))),
+		scale: me((e) => Math.exp(s(C.scaleMin, C.scaleMax, e, o(i, 11 + e)))),
 		alpha: o(i, 6) / 255,
-		colour: V((t) => .5 + e * s(C.dcMin, C.dcMax, t, o(a, t))),
+		colour: me((t) => .5 + e * s(C.dcMin, C.dcMax, t, o(a, t))),
 		sh: u
 	};
 }
@@ -404,34 +415,34 @@ function he(t, n) {
 function ge(e) {
 	return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array" && "BYTES_PER_ELEMENT" in e && e.BYTES_PER_ELEMENT === 1;
 }
-var H = (e) => e ? `"${e}" ` : "";
+var _e = (e) => e ? `"${e}" ` : "";
 function U(e, t = "") {
-	if (typeof e != "number") throw TypeError(H(t) + "expected number, got " + typeof e);
-	if (!Number.isSafeInteger(e) || e < 0) throw RangeError(H(t) + "expected integer >= 0, got " + e);
+	if (typeof e != "number") throw TypeError(_e(t) + "expected number, got " + typeof e);
+	if (!Number.isSafeInteger(e) || e < 0) throw RangeError(_e(t) + "expected integer >= 0, got " + e);
 	return e;
 }
 function W(e, t, n = "") {
 	if (ge(e) && (t === void 0 || e.length === t)) return e;
 	t !== void 0 && U(t, "length");
-	let r = ge(e), i = t === void 0 ? "" : ` of length ${t}`, a = r ? `length=${e.length}` : `type=${typeof e}`, o = H(n) + "expected Uint8Array" + i + ", got " + a;
+	let r = ge(e), i = t === void 0 ? "" : ` of length ${t}`, a = r ? `length=${e.length}` : `type=${typeof e}`, o = _e(n) + "expected Uint8Array" + i + ", got " + a;
 	throw r ? RangeError(o) : TypeError(o);
 }
-function _e(e) {
+function ve(e) {
 	return Uint8Array.from(W(e));
 }
-var ve = (e, t) => {
+var ye = (e, t) => {
 	if (typeof e != "object" || !e || Array.isArray(e)) throw TypeError((t === "object" ? "" : `"${t}" `) + "expected object, got type=" + typeof e);
-}, ye = (e, t) => {
-	ve(e, t);
+}, be = (e, t) => {
+	ye(e, t);
 	let n = Object.getPrototypeOf(e);
 	if (n !== Object.prototype && n !== null) throw TypeError(`"${t}" expected plain object`);
 	if (Object.hasOwn(e, "__proto__")) throw TypeError(`"${t}.__proto__" is not allowed`);
 };
-function be(e, t = !0) {
+function xe(e, t = !0) {
 	if (e.destroyed) throw Error("hash was destroyed");
 	if (t && e.finished) throw Error("digest() was already called");
 }
-function xe(e, t) {
+function Se(e, t) {
 	W(e, void 0, "output");
 	let n = t.outputLen;
 	if (!(e.length >= n)) throw RangeError("\"output\" expected length >= " + n);
@@ -439,37 +450,37 @@ function xe(e, t) {
 function G(e) {
 	return new Uint32Array(e.buffer, e.byteOffset, Math.floor(e.byteLength / 4));
 }
-function K(...e) {
+function Ce(...e) {
 	for (let t = 0; t < e.length; t++) e[t].fill(0);
 }
-var Se = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-function Ce(e) {
+var we = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+function Te(e) {
 	return e << 24 & 4278190080 | e << 8 & 16711680 | e >>> 8 & 65280 | e >>> 24 & 255;
 }
-var q = Se ? (e) => e : (e) => Ce(e) >>> 0;
-function we(e) {
-	for (let t = 0; t < e.length; t++) e[t] = Ce(e[t]);
+var K = we ? (e) => e : (e) => Te(e) >>> 0;
+function Ee(e) {
+	for (let t = 0; t < e.length; t++) e[t] = Te(e[t]);
 	return e;
 }
-var J = Se ? (e) => e : we, Te = typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function", Ee = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
-function De(e) {
-	if (W(e), Te) return e.toHex();
+var q = we ? (e) => e : Ee, De = typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function", Oe = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
+function ke(e) {
+	if (W(e), De) return e.toHex();
 	let t = "";
-	for (let n = 0; n < e.length; n++) t += Ee[e[n]];
+	for (let n = 0; n < e.length; n++) t += Oe[e[n]];
 	return t;
 }
-function Oe(e, t, n = "opts") {
-	return ye(e, "defaults"), t !== void 0 && ye(t, n), Object.assign(Object.create(null), e, t);
+function Ae(e, t, n = "opts") {
+	return be(e, "defaults"), t !== void 0 && be(t, n), Object.assign(Object.create(null), e, t);
 }
-function ke(e, t = {}) {
+function je(e, t = {}) {
 	if (typeof e != "function") throw TypeError("\"hashCons\" expected function, got type=" + typeof e);
-	t = Oe({}, t, "info");
+	t = Ae({}, t, "info");
 	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/.pnpm/@noble+hashes@2.4.0/node_modules/@noble/hashes/_blake.js
-var Ae = /* @__PURE__ */ Uint8Array.from([
+var Me = /* @__PURE__ */ Uint8Array.from([
 	0,
 	1,
 	2,
@@ -726,15 +737,15 @@ var Ae = /* @__PURE__ */ Uint8Array.from([
 	14,
 	1,
 	9
-]), je = (e) => e / 2 ** 32 | 0, Me = (e) => e >>> 0, Ne = (e, t, n) => e >>> n | t << 32 - n, Pe = (e, t, n) => e << 32 - n | t >>> n, Fe = (e, t, n) => e << 64 - n | t >>> n - 32, Ie = (e, t, n) => e >>> n - 32 | t << 64 - n, Le = (e, t) => t, Re = (e, t) => e;
-function Y(e, t, n, r) {
+]), Ne = (e) => e / 2 ** 32 | 0, Pe = (e) => e >>> 0, Fe = (e, t, n) => e >>> n | t << 32 - n, Ie = (e, t, n) => e << 32 - n | t >>> n, Le = (e, t, n) => e << 64 - n | t >>> n - 32, Re = (e, t, n) => e >>> n - 32 | t << 64 - n, ze = (e, t) => t, Be = (e, t) => e;
+function Ve(e, t, n, r) {
 	let i = (t >>> 0) + (r >>> 0);
 	return {
 		h: e + n + (i / 2 ** 32 | 0) | 0,
 		l: i | 0
 	};
 }
-var ze = (e, t, n) => (e >>> 0) + (t >>> 0) + (n >>> 0), Be = (e, t, n, r) => t + n + r + (e / 2 ** 32 | 0) | 0, X = /* @__PURE__ */ Uint32Array.from([
+var He = (e, t, n) => (e >>> 0) + (t >>> 0) + (n >>> 0), Ue = (e, t, n, r) => t + n + r + (e / 2 ** 32 | 0) | 0, J = /* @__PURE__ */ Uint32Array.from([
 	4089235720,
 	1779033703,
 	2227873595,
@@ -751,26 +762,26 @@ var ze = (e, t, n) => (e >>> 0) + (t >>> 0) + (n >>> 0), Be = (e, t, n, r) => t
 	528734635,
 	327033209,
 	1541459225
-]), Z = /* @__PURE__ */ new Uint32Array(32);
-function Q(e, t, n, r, i, a) {
-	let o = i[a], s = i[a + 1], c = Z[2 * e], l = Z[2 * e + 1], u = Z[2 * t], d = Z[2 * t + 1], f = Z[2 * n], p = Z[2 * n + 1], m = Z[2 * r], h = Z[2 * r + 1], g = ze(c, u, o);
-	l = Be(g, l, d, s), c = g | 0;
+]), Y = /* @__PURE__ */ new Uint32Array(32);
+function X(e, t, n, r, i, a) {
+	let o = i[a], s = i[a + 1], c = Y[2 * e], l = Y[2 * e + 1], u = Y[2 * t], d = Y[2 * t + 1], f = Y[2 * n], p = Y[2 * n + 1], m = Y[2 * r], h = Y[2 * r + 1], g = He(c, u, o);
+	l = Ue(g, l, d, s), c = g | 0;
 	let _ = h ^ l, v = m ^ c;
-	h = Le(_, v), m = Re(_, v), {h: p, l: f} = Y(p, f, h, m), _ = d ^ p, v = u ^ f, d = Ne(_, v, 24), u = Pe(_, v, 24), Z[2 * e] = c, Z[2 * e + 1] = l, Z[2 * t] = u, Z[2 * t + 1] = d, Z[2 * n] = f, Z[2 * n + 1] = p, Z[2 * r] = m, Z[2 * r + 1] = h;
+	h = ze(_, v), m = Be(_, v), {h: p, l: f} = Ve(p, f, h, m), _ = d ^ p, v = u ^ f, d = Fe(_, v, 24), u = Ie(_, v, 24), Y[2 * e] = c, Y[2 * e + 1] = l, Y[2 * t] = u, Y[2 * t + 1] = d, Y[2 * n] = f, Y[2 * n + 1] = p, Y[2 * r] = m, Y[2 * r + 1] = h;
 }
-function $(e, t, n, r, i, a) {
-	let o = i[a], s = i[a + 1], c = Z[2 * e], l = Z[2 * e + 1], u = Z[2 * t], d = Z[2 * t + 1], f = Z[2 * n], p = Z[2 * n + 1], m = Z[2 * r], h = Z[2 * r + 1], g = ze(c, u, o);
-	l = Be(g, l, d, s), c = g | 0;
+function Z(e, t, n, r, i, a) {
+	let o = i[a], s = i[a + 1], c = Y[2 * e], l = Y[2 * e + 1], u = Y[2 * t], d = Y[2 * t + 1], f = Y[2 * n], p = Y[2 * n + 1], m = Y[2 * r], h = Y[2 * r + 1], g = He(c, u, o);
+	l = Ue(g, l, d, s), c = g | 0;
 	let _ = h ^ l, v = m ^ c;
-	h = Ne(_, v, 16), m = Pe(_, v, 16), {h: p, l: f} = Y(p, f, h, m), _ = d ^ p, v = u ^ f, d = Fe(_, v, 63), u = Ie(_, v, 63), Z[2 * e] = c, Z[2 * e + 1] = l, Z[2 * t] = u, Z[2 * t + 1] = d, Z[2 * n] = f, Z[2 * n + 1] = p, Z[2 * r] = m, Z[2 * r + 1] = h;
+	h = Fe(_, v, 16), m = Ie(_, v, 16), {h: p, l: f} = Ve(p, f, h, m), _ = d ^ p, v = u ^ f, d = Le(_, v, 63), u = Re(_, v, 63), Y[2 * e] = c, Y[2 * e + 1] = l, Y[2 * t] = u, Y[2 * t + 1] = d, Y[2 * n] = f, Y[2 * n + 1] = p, Y[2 * r] = m, Y[2 * r + 1] = h;
 }
-function Ve(e, t = {}, n, r, i) {
+function We(e, t = {}, n, r, i) {
 	if (U(n), e <= 0 || e > n) throw Error("\"dkLen\" must be 1.." + n + ", got " + e);
 	let { key: a, salt: o, personalization: s } = t;
 	if (a !== void 0 && (a.length < 1 || a.length > n)) throw Error("\"key\" expected to be undefined or of length=1.." + n);
 	o !== void 0 && W(o, r, "salt"), s !== void 0 && W(s, i, "personalization");
 }
-var He = class {
+var Ge = class {
 	buffer;
 	buffer32;
 	finished = !1;
@@ -784,26 +795,26 @@ var He = class {
 		U(e), U(t), this.blockLen = e, this.outputLen = t, this.buffer = new Uint8Array(e), this.buffer32 = G(this.buffer);
 	}
 	update(e) {
-		be(this), W(e);
+		xe(this), W(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 && (J(r), this.compress(r, 0, !1), J(r), this.pos = 0);
+			this.pos === t && (q(r), this.compress(r, 0, !1), q(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));
-				J(e);
+				q(e);
 				for (let n = 0; s + t < i; n += r.length, s += t) this.length += t, this.compress(e, n, !1);
-				J(e);
+				q(e);
 			} else n.set(s === 0 && c === i ? e : e.subarray(s, s + c), this.pos), this.pos += c, this.length += c, s += c;
 		}
 		return this;
 	}
 	digestInto(e) {
-		if (be(this), xe(e, this), e.byteOffset & 3) throw RangeError("\"output\" expected 4-byte aligned byteOffset, got " + e.byteOffset);
+		if (xe(this), Se(e, this), e.byteOffset & 3) throw RangeError("\"output\" expected 4-byte aligned byteOffset, got " + e.byteOffset);
 		let { pos: t, buffer32: n } = this;
-		this.finished = !0, this.buffer.fill(0, t), J(n), this.compress(n, 0, !0), J(n);
+		this.finished = !0, this.buffer.fill(0, t), q(n), this.compress(n, 0, !0), q(n);
 		let r = this.get(), i = e === this.buffer ? n : G(e), a = Math.floor(this.outputLen / 4);
-		for (let e = 0; e < a; e++) i[e] = q(r[e]);
+		for (let e = 0; e < a; e++) i[e] = K(r[e]);
 		let o = this.outputLen % 4;
 		if (!o) return;
 		let s = a * 4, c = r[a];
@@ -822,41 +833,41 @@ var He = class {
 	clone() {
 		return this._cloneInto();
 	}
-}, Ue = class extends He {
-	v0l = X[0] | 0;
-	v0h = X[1] | 0;
-	v1l = X[2] | 0;
-	v1h = X[3] | 0;
-	v2l = X[4] | 0;
-	v2h = X[5] | 0;
-	v3l = X[6] | 0;
-	v3h = X[7] | 0;
-	v4l = X[8] | 0;
-	v4h = X[9] | 0;
-	v5l = X[10] | 0;
-	v5h = X[11] | 0;
-	v6l = X[12] | 0;
-	v6h = X[13] | 0;
-	v7l = X[14] | 0;
-	v7h = X[15] | 0;
+}, Ke = class extends Ge {
+	v0l = J[0] | 0;
+	v0h = J[1] | 0;
+	v1l = J[2] | 0;
+	v1h = J[3] | 0;
+	v2l = J[4] | 0;
+	v2h = J[5] | 0;
+	v3l = J[6] | 0;
+	v3h = J[7] | 0;
+	v4l = J[8] | 0;
+	v4h = J[9] | 0;
+	v5l = J[10] | 0;
+	v5h = J[11] | 0;
+	v6l = J[12] | 0;
+	v6h = J[13] | 0;
+	v7l = J[14] | 0;
+	v7h = J[15] | 0;
 	constructor(e = {}) {
-		e = Oe({}, e);
+		e = Ae({}, e);
 		let t = e.dkLen === void 0 ? 64 : e.dkLen;
-		super(128, t), Ve(t, e, 64, 16, 16);
+		super(128, t), We(t, e, 64, 16, 16);
 		let { key: n, personalization: r, salt: i } = e, a = 0;
 		if (n !== void 0 && (W(n, void 0, "key"), a = n.length), this.v0l ^= this.outputLen | a << 8 | 16842752, i !== void 0) {
 			W(i, void 0, "salt");
-			let e = G(_e(i));
-			this.v4l ^= q(e[0]), this.v4h ^= q(e[1]), this.v5l ^= q(e[2]), this.v5h ^= q(e[3]);
+			let e = G(ve(i));
+			this.v4l ^= K(e[0]), this.v4h ^= K(e[1]), this.v5l ^= K(e[2]), this.v5h ^= K(e[3]);
 		}
 		if (r !== void 0) {
 			W(r, void 0, "personalization");
-			let e = G(_e(r));
-			this.v6l ^= q(e[0]), this.v6h ^= q(e[1]), this.v7l ^= q(e[2]), this.v7h ^= q(e[3]);
+			let e = G(ve(r));
+			this.v6l ^= K(e[0]), this.v6h ^= K(e[1]), this.v7l ^= K(e[2]), this.v7h ^= K(e[3]);
 		}
 		if (n !== void 0) {
 			let e = new Uint8Array(this.blockLen);
-			e.set(n), this.update(e), K(e);
+			e.set(n), this.update(e), Ce(e);
 		}
 	}
 	get() {
@@ -885,21 +896,223 @@ var He = class {
 	}
 	compress(e, t, n) {
 		let { v0l: r, v0h: i, v1l: a, v1h: o, v2l: s, v2h: c, v3l: l, v3h: u, v4l: d, v4h: f, v5l: p, v5h: m, v6l: h, v6h: g, v7l: _, v7h: v } = this;
-		Z[0] = r, Z[1] = i, Z[2] = a, Z[3] = o, Z[4] = s, Z[5] = c, Z[6] = l, Z[7] = u, Z[8] = d, Z[9] = f, Z[10] = p, Z[11] = m, Z[12] = h, Z[13] = g, Z[14] = _, Z[15] = v, Z.set(X, 16);
-		let y = Me(this.length), b = je(this.length);
-		Z[24] = X[8] ^ y, Z[25] = X[9] ^ b, n && (Z[28] = ~Z[28], Z[29] = ~Z[29]);
-		let x = 0, S = Ae;
-		for (let n = 0; n < 12; n++) Q(0, 4, 8, 12, e, t + 2 * S[x++]), $(0, 4, 8, 12, e, t + 2 * S[x++]), Q(1, 5, 9, 13, e, t + 2 * S[x++]), $(1, 5, 9, 13, e, t + 2 * S[x++]), Q(2, 6, 10, 14, e, t + 2 * S[x++]), $(2, 6, 10, 14, e, t + 2 * S[x++]), Q(3, 7, 11, 15, e, t + 2 * S[x++]), $(3, 7, 11, 15, e, t + 2 * S[x++]), Q(0, 5, 10, 15, e, t + 2 * S[x++]), $(0, 5, 10, 15, e, t + 2 * S[x++]), Q(1, 6, 11, 12, e, t + 2 * S[x++]), $(1, 6, 11, 12, e, t + 2 * S[x++]), Q(2, 7, 8, 13, e, t + 2 * S[x++]), $(2, 7, 8, 13, e, t + 2 * S[x++]), Q(3, 4, 9, 14, e, t + 2 * S[x++]), $(3, 4, 9, 14, e, t + 2 * S[x++]);
-		this.v0l ^= Z[0] ^ Z[16], this.v0h ^= Z[1] ^ Z[17], this.v1l ^= Z[2] ^ Z[18], this.v1h ^= Z[3] ^ Z[19], this.v2l ^= Z[4] ^ Z[20], this.v2h ^= Z[5] ^ Z[21], this.v3l ^= Z[6] ^ Z[22], this.v3h ^= Z[7] ^ Z[23], this.v4l ^= Z[8] ^ Z[24], this.v4h ^= Z[9] ^ Z[25], this.v5l ^= Z[10] ^ Z[26], this.v5h ^= Z[11] ^ Z[27], this.v6l ^= Z[12] ^ Z[28], this.v6h ^= Z[13] ^ Z[29], this.v7l ^= Z[14] ^ Z[30], this.v7h ^= Z[15] ^ Z[31], K(Z);
+		Y[0] = r, Y[1] = i, Y[2] = a, Y[3] = o, Y[4] = s, Y[5] = c, Y[6] = l, Y[7] = u, Y[8] = d, Y[9] = f, Y[10] = p, Y[11] = m, Y[12] = h, Y[13] = g, Y[14] = _, Y[15] = v, Y.set(J, 16);
+		let y = Pe(this.length), b = Ne(this.length);
+		Y[24] = J[8] ^ y, Y[25] = J[9] ^ b, n && (Y[28] = ~Y[28], Y[29] = ~Y[29]);
+		let x = 0, S = Me;
+		for (let n = 0; n < 12; n++) X(0, 4, 8, 12, e, t + 2 * S[x++]), Z(0, 4, 8, 12, e, t + 2 * S[x++]), X(1, 5, 9, 13, e, t + 2 * S[x++]), Z(1, 5, 9, 13, e, t + 2 * S[x++]), X(2, 6, 10, 14, e, t + 2 * S[x++]), Z(2, 6, 10, 14, e, t + 2 * S[x++]), X(3, 7, 11, 15, e, t + 2 * S[x++]), Z(3, 7, 11, 15, e, t + 2 * S[x++]), X(0, 5, 10, 15, e, t + 2 * S[x++]), Z(0, 5, 10, 15, e, t + 2 * S[x++]), X(1, 6, 11, 12, e, t + 2 * S[x++]), Z(1, 6, 11, 12, e, t + 2 * S[x++]), X(2, 7, 8, 13, e, t + 2 * S[x++]), Z(2, 7, 8, 13, e, t + 2 * S[x++]), X(3, 4, 9, 14, e, t + 2 * S[x++]), Z(3, 4, 9, 14, e, t + 2 * S[x++]);
+		this.v0l ^= Y[0] ^ Y[16], this.v0h ^= Y[1] ^ Y[17], this.v1l ^= Y[2] ^ Y[18], this.v1h ^= Y[3] ^ Y[19], this.v2l ^= Y[4] ^ Y[20], this.v2h ^= Y[5] ^ Y[21], this.v3l ^= Y[6] ^ Y[22], this.v3h ^= Y[7] ^ Y[23], this.v4l ^= Y[8] ^ Y[24], this.v4h ^= Y[9] ^ Y[25], this.v5l ^= Y[10] ^ Y[26], this.v5h ^= Y[11] ^ Y[27], this.v6l ^= Y[12] ^ Y[28], this.v6h ^= Y[13] ^ Y[29], this.v7l ^= Y[14] ^ Y[30], this.v7h ^= Y[15] ^ Y[31], Ce(Y);
 	}
 	destroy() {
-		this.destroyed = !0, K(this.buffer32), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
+		this.destroyed = !0, Ce(this.buffer32), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
 	}
-}, We = /* @__PURE__ */ ke((e) => new Ue(e));
+}, qe = /* @__PURE__ */ je((e) => new Ke(e));
 //#endregion
 //#region src/format/hash.ts
-function Ge(e) {
-	return De(We(e, { dkLen: 8 }));
+function Je(e) {
+	return ke(qe(e, { dkLen: 8 }));
+}
+//#endregion
+//#region src/format/encode.ts
+var Ye = 5e-4, Xe = 2048, Ze = 256, Q = (e, t, n) => Math.min(n, Math.max(t, e));
+function Qe(e, t, n) {
+	return n > t ? Q(Math.round((e - t) / (n - t) * 255), 0, 255) : 0;
+}
+function $e(e, t) {
+	return t > 0 ? Q(Math.round(e / t * 127), -127, 127) : 0;
+}
+function et(e) {
+	return e &= 1023, e = (e | e << 16) & 50331903, e = (e | e << 8) & 50393103, e = (e | e << 4) & 51130563, (e | e << 2) & 153391689;
+}
+function tt(e, t, n) {
+	return et(e >> 6) | et(t >> 6) << 1 | et(n >> 6) << 2;
+}
+function nt(e, t) {
+	let n = /* @__PURE__ */ new Float32Array(9);
+	for (let r = 0; r < t; r++) for (let t = 0; t < 9; t++) n[t] = Math.max(n[t], Math.abs(e[r * 9 + t]));
+	return n;
+}
+function rt(e, t, n) {
+	let r = new Int8Array(t * 9);
+	for (let i = 0; i < t; i++) for (let t = 0; t < 9; t++) r[i * 9 + t] = $e(e[i * 9 + t], n[t]);
+	let i = (e) => r.subarray(e * 9, (e + 1) * 9), a = /* @__PURE__ */ new Map(), o = [], s = new Uint16Array(t);
+	for (let e = 0; e < t; e++) {
+		let t = i(e).join(), n = a.get(t);
+		n === void 0 && (n = o.length, a.set(t, n), o.push(e)), s[e] = n;
+	}
+	if (o.length > Xe) {
+		let e = o.length / Ze, n = Array.from({ length: Ze }, (t, n) => o[Math.floor(n * e)]);
+		o.splice(0, o.length, ...n);
+		for (let e = 0; e < t; e++) {
+			let t = Infinity;
+			for (let n = 0; n < Ze; n++) {
+				let i = 0;
+				for (let t = 0; t < 9; t++) i += (r[e * 9 + t] - r[o[n] * 9 + t]) ** 2;
+				i < t && (t = i, s[e] = n);
+			}
+		}
+	}
+	let c = new Int8Array(o.length * 9);
+	return o.forEach((e, t) => c.set(i(e), t * 9)), {
+		book: c,
+		labels: s
+	};
+}
+function it(e, t) {
+	let { count: r, position: i, rotation: a, scale: o, alpha: s, dc: c, sh: l } = e, u = [
+		Infinity,
+		Infinity,
+		Infinity
+	], d = [
+		-Infinity,
+		-Infinity,
+		-Infinity
+	], f = [...u], p = [...d], m = [...u], h = [...d];
+	for (let e = 0; e < r; e++) for (let t = 0; t < 3; t++) u[t] = Math.min(u[t], i[e * 3 + t]), d[t] = Math.max(d[t], i[e * 3 + t]), f[t] = Math.min(f[t], o[e * 3 + t]), p[t] = Math.max(p[t], o[e * 3 + t]), m[t] = Math.min(m[t], c[e * 3 + t]), h[t] = Math.max(h[t], c[e * 3 + t]);
+	let g = Ye * 2 ** t.g, v = Float32Array.from(u), y = Float32Array.from(u, (e, t) => Math.max(g, (d[t] - e) / 65535)), b = new Uint16Array(r * 3);
+	for (let e = 0; e < r; e++) for (let t = 0; t < 3; t++) {
+		let n = (i[e * 3 + t] - v[t]) / y[t];
+		b[e * 3 + t] = Q(Math.round(n), 0, 65535);
+	}
+	let x = n * 2 ** t.g, S = (t.i + .5) * x, C = (t.j + .5) * x, w = new Uint8Array(r), T = new Float64Array(r);
+	for (let e = 0; e < r; e++) {
+		let t = +(i[e * 3] >= S), n = +(i[e * 3 + 1] >= C);
+		w[e] = t + 2 * n, T[e] = w[e] * 2 ** 30 + tt(b[e * 3], b[e * 3 + 1], b[e * 3 + 2]);
+	}
+	let E = Uint32Array.from({ length: r }, (e, t) => t).sort((e, t) => T[e] - T[t]), D = [
+		0,
+		0,
+		0
+	];
+	for (let e = 1; e < 4; e++) D[e - 1] = w.filter((t) => t < e).length;
+	let O = l ? nt(l, r) : /* @__PURE__ */ new Float32Array(9), { book: k, labels: A } = l ? rt(l, r, O) : {
+		book: null,
+		labels: null
+	}, j = k ? k.length / 9 : 0, M = 17 + (j > 0 ? 2 : 0), N = new Uint8Array(128 + M * r + j * 9), P = new DataView(N.buffer);
+	P.setUint32(0, r, !0), D.forEach((e, t) => P.setUint32(4 + 4 * t, e, !0)), P.setUint16(16, j, !0), [
+		...v,
+		...y,
+		...f,
+		...p,
+		...m,
+		...h,
+		...O
+	].forEach((e, t) => P.setFloat32(20 + 4 * t, e, !0));
+	let F = (e) => 128 + e * r, I = new Float32Array([...u, ...d]), L = /* @__PURE__ */ new Float64Array(4), R = /* @__PURE__ */ new Float64Array(3), z = [
+		0,
+		0,
+		0
+	];
+	for (let e = 0; e < r; e++) {
+		let t = E[e];
+		for (let n = 0; n < 3; n++) {
+			let r = b[t * 3 + n] - z[n] << 16 >> 16, i = r < 0 ? -2 * r - 1 : 2 * r;
+			z[n] = b[t * 3 + n], N[F(_.position + 2 * n) + e] = i & 255, N[F(_.position + 2 * n + 1) + e] = i >> 8;
+		}
+		N[F(_.alpha) + e] = Q(Math.round(s[t] * 255), 0, 255);
+		let n = Math.hypot(...a.subarray(t * 4, t * 4 + 4));
+		for (let e = 0; e < 4; e++) L[e] = a[t * 4 + e] / n;
+		let r = 0;
+		for (let e = 1; e < 4; e++) Math.abs(L[e]) > Math.abs(L[r]) && (r = e);
+		let l = L[r] < 0 ? -1 : 1;
+		N[F(_.rotationIndex) + e] = r;
+		for (let t = 0, n = 0; t < 4; t++) {
+			if (t === r) continue;
+			let i = Math.round((l * L[t] / Math.SQRT2 + .5) * 255);
+			N[F(_.rotation + n++) + e] = Q(i, 0, 255);
+		}
+		for (let n = 0; n < 3; n++) N[F(_.scale + n) + e] = Qe(o[t * 3 + n], f[n], p[n]), N[F(_.dc + n) + e] = Qe(c[t * 3 + n], m[n], h[n]);
+		A && (N[F(_.label) + e] = A[t] & 255, N[F(_.label + 1) + e] = A[t] >> 8);
+		let [u, d, g] = [
+			0,
+			1,
+			2
+		].map((e) => Math.exp(o[t * 3 + e]));
+		oe(L, u, d, g, R);
+		for (let e = 0; e < 3; e++) I[e] = Math.min(I[e], i[t * 3 + e] - R[e]), I[3 + e] = Math.max(I[3 + e], i[t * 3 + e] + R[e]);
+	}
+	return k && N.set(new Uint8Array(k.buffer), F(M)), {
+		payload: N,
+		row: {
+			g: t.g,
+			i: t.i,
+			j: t.j,
+			count: r,
+			quadrants: D,
+			box: I,
+			offset: 0,
+			length: 0
+		}
+	};
+}
+function at(e, t, n) {
+	e.setUint8(t, n.g), e.setUint8(t + 1, n.i), e.setUint8(t + 2, n.j), e.setUint32(t + 4, n.count, !0), n.quadrants.forEach((n, r) => e.setUint32(t + 8 + 4 * r, n, !0)), n.box.forEach((n, r) => e.setFloat32(t + 20 + 4 * r, n, !0)), e.setUint32(t + 44, n.offset, !0), e.setUint32(t + 48, n.length, !0);
+}
+function ot(e) {
+	let t = e.reduce((e, t) => e + t.blob.length, 0), n = new Uint8Array(t + e.length * 52 + 16), r = new DataView(n.buffer), a = 0;
+	for (let { row: t, blob: r } of e) t.offset = a, t.length = r.length, n.set(r, a), a += r.length;
+	for (let { row: t } of e) at(r, a, t), a += 52;
+	return r.setUint32(a, t, !0), r.setUint32(a + 4, e.length, !0), ct(n, a + 8, i), r.setUint16(a + 12, 1, !0), n;
+}
+async function st(e) {
+	let { count: t, position: r } = e;
+	if (t === 0) throw Error("a layer needs at least one splat");
+	let i = [Infinity, Infinity], a = [-Infinity, -Infinity];
+	for (let e = 0; e < t; e++) for (let t = 0; t < 2; t++) i[t] = Math.min(i[t], r[e * 3 + t]), a[t] = Math.max(a[t], r[e * 3 + t]);
+	let o = [Math.floor(i[0]), Math.floor(i[1])], s = Float64Array.from(r);
+	for (let e = 0; e < t; e++) s[e * 3] -= o[0], s[e * 3 + 1] -= o[1];
+	let c = Math.max(a[0] - o[0], a[1] - o[1]), l = 0;
+	for (; n * 2 ** l <= c;) l++;
+	let { payload: u, row: d } = it({
+		...e,
+		position: s
+	}, {
+		g: l,
+		i: 0,
+		j: 0
+	});
+	return {
+		pack: ot([{
+			row: d,
+			blob: await D(u)
+		}]),
+		origin: o
+	};
+}
+function ct(e, t, n) {
+	for (let r = 0; r < 4; r++) e[t + r] = n.charCodeAt(r);
+}
+function $(e) {
+	return Uint8Array.from({ length: 8 }, (t, n) => parseInt(e.slice(2 * n, 2 * n + 2), 16));
+}
+async function lt(e, t) {
+	let n = await D(e), r = new Uint8Array(8 + n.length);
+	return ct(r, 0, t), new DataView(r.buffer).setUint16(4, 1, !0), r.set(n, 8), r;
+}
+async function ut(e) {
+	let { rows: t, children: n, descendants: r } = e, i = new Uint8Array(40 + t.length * 52 + n.length * 9 + r.length * 11), o = new DataView(i.buffer);
+	o.setUint8(0, e.level), o.setInt32(4, e.e, !0), o.setInt32(8, e.n, !0), i.set($(e.pack), 12), o.setUint32(20, e.packSize, !0), e.col && i.set($(e.col), 24), o.setUint16(32, t.length, !0), o.setUint8(34, n.length), o.setUint16(36, r.length, !0);
+	let s = 40;
+	for (let e of t) at(o, s, e), s += 52;
+	for (let e of n) o.setUint8(s, e.quadrant), i.set($(e.idx), s + 1), s += 9;
+	for (let e of r) o.setUint8(s, e.depth), o.setUint8(s + 1, e.column), o.setUint8(s + 2, e.row), i.set($(e.idx), s + 3), s += 11;
+	return lt(i, a);
+}
+function dt(e) {
+	let t = 3421674724, n = 2216829733;
+	for (let r = 0; r < e.length; r++) {
+		n = (n ^ e[r]) >>> 0;
+		let i = n * 435;
+		t = t * 435 + (n << 8 >>> 0) + Math.floor(i / 4294967296) >>> 0, n = i >>> 0;
+	}
+	return t.toString(16).padStart(8, "0") + n.toString(16).padStart(8, "0");
+}
+function ft(e) {
+	return () => {
+		e = e + 1831565813 | 0;
+		let t = Math.imul(e ^ e >>> 15, 1 | e);
+		return t = t + Math.imul(t ^ t >>> 7, 61 | t) ^ t, ((t ^ t >>> 14) >>> 0) / 2 ** 32;
+	};
 }
 //#endregion
-export { r as A, y as B, h as C, x as D, p as E, n as F, C as I, _ as L, l as M, g as N, u as O, w as P, c as R, S, o as T, s as V, v as _, he as a, f as b, ne as c, j as d, P as f, E as g, D as h, me as i, i as j, a as k, re as l, M as m, de as n, ie as o, A as p, se as r, ae as s, Ge as t, F as u, e as v, m as w, b as x, t as y, d as z };
+export { p as A, C as B, t as C, h as D, S as E, i as F, s as G, c as H, l as I, g as L, u as M, a as N, m as O, r as P, w as R, e as S, b as T, d as U, _ as V, y as W, F as _, ft as a, E as b, pe as c, ie as d, te as f, M as g, j as h, it as i, x as j, o as k, he as l, I as m, ut as n, Je as o, ne as p, st as r, ue as s, dt as t, re as u, A as v, f as w, v as x, N as y, n as z };