@kalyptos/narcissus 0.1.0 → 0.1.2

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

@@ -137,7 +137,7 @@ function F(e) {
 }
 //#endregion
 //#region src/format/world.ts
-var ee = 4, te = /* @__PURE__ */ new Set([
+var ee = /* @__PURE__ */ new Set([
 	"version",
 	"crs",
 	"height",
@@ -160,7 +160,7 @@ function z(e, t) {
 	if (!Array.isArray(e) || e.length !== 2 || !e.every(Number.isFinite) || e[0] > e[1]) throw I(t);
 	return [e[0], e[1]];
 }
-function ne(e) {
+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");
 	let a = {
@@ -174,13 +174,13 @@ function ne(e) {
 		idx: s
 	};
 }
-function re(e) {
+function ne(e) {
 	let t = e.split(/[?#]/)[0];
 	return t.slice(0, t.lastIndexOf("/") + 1);
 }
-function ie(e) {
+function re(e) {
 	let t = L(e, "an unreadable world.json");
-	if (t.version !== 1 && t.version !== ee) throw Error(`This world is version ${String(t.version)}; narcissus reads 1.`);
+	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");
@@ -189,18 +189,18 @@ function ie(e) {
 		crs: R(t.crs, "no coordinate system"),
 		height: R(t.height, "no height datum"),
 		leaf: 250,
-		roots: t.roots.map(ne),
+		roots: t.roots.map(te),
 		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")
 		},
-		extra: Object.fromEntries(Object.entries(t).filter(([e]) => !te.has(e)))
+		extra: Object.fromEntries(Object.entries(t).filter(([e]) => !ee.has(e)))
 	};
 }
 //#endregion
 //#region src/format/col.ts
-async function ae(e) {
+async function ie(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,7 +220,7 @@ async function ae(e) {
 		values: i
 	};
 }
-function oe(e, t, n, r) {
+function ae(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;
@@ -228,20 +228,20 @@ function oe(e, t, n, r) {
 //#endregion
 //#region src/format/page.ts
 var B = Float64Array.from({ length: 256 }, (e, t) => (t / 255 - .5) * Math.SQRT2);
-function se(e, t, n, r, i) {
+function oe(e, t, n, r, i) {
 	let a = B[t], o = B[n], s = B[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 ce(e, t, n, r, i) {
+function se(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 le(e) {
+function ce(e) {
 	if (e.length < 128) throw Error("page payload is shorter than its header");
 	return new DataView(e.buffer, e.byteOffset, e.byteLength);
 }
-function ue(e) {
-	let t = le(e), n = t.getUint32(0, !0), r = t.getUint16(16, !0), i = 128 + (17 + (r > 0 ? 2 : 0)) * n, a = i + r * 9;
+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;
 	if (e.length !== a) throw Error(`page payload holds ${e.length} bytes, its header needs ${a}`);
 	return {
 		view: t,
@@ -250,15 +250,15 @@ function ue(e) {
 		book: i
 	};
 }
-function de(e) {
+function ue(e) {
 	return [
 		e.getUint32(4, !0),
 		e.getUint32(8, !0),
 		e.getUint32(12, !0)
 	];
 }
-function fe(e, t) {
-	let { view: n, count: r, k: i, book: a } = ue(e), o = /* @__PURE__ */ new Float32Array(27);
+function de(e, t) {
+	let { view: n, count: r, k: i, book: a } = le(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 +273,7 @@ function fe(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, se(c, E, D, O, y), ce(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, oe(c, E, D, O, y), se(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 +286,17 @@ function fe(e, t) {
 			T
 		], t * 6);
 	}
-	let T = t ? me(e, r, i, a, s, o, t) : pe(e, r, i, a);
+	let T = t ? pe(e, r, i, a, s, o, t) : fe(e, r, i, a);
 	return {
 		count: r,
-		quadrants: de(n),
+		quadrants: ue(n),
 		geometry: s,
 		colour: T,
 		params: o,
 		clusters: c
 	};
 }
-function pe(e, t, n, r) {
+function fe(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 +306,7 @@ function pe(e, t, n, r) {
 	}
 	return i;
 }
-function me(t, n, r, i, a, o, s) {
+function pe(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 +324,7 @@ function me(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];
-		oe(s, v + (o & 65535) * b, y + (o >>> 16) * x, g);
+		ae(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,11 +362,11 @@ function me(t, n, r, i, a, o, s) {
 	}
 	return O;
 }
-function he(e) {
-	let t = le(e);
+function me(e) {
+	let t = ce(e);
 	return {
 		count: t.getUint32(0, !0),
-		quadrants: de(t)
+		quadrants: ue(t)
 	};
 }
 function V(e) {
@@ -376,13 +376,13 @@ function V(e) {
 		e(2)
 	];
 }
-function ge(t, n) {
+function he(t, n) {
 	let r = t.params, i = t.geometry.subarray(n * 4, (n + 1) * 4), a = t.colour.subarray(n * 3, (n + 1) * 3), o = (e, t) => e[t >> 2] >>> 8 * (t & 3) & 255, s = (e, t, n, i) => r[e + n] + i / 255 * (r[t + n] - r[e + n]), c = [
 		i[0] & 65535,
 		i[0] >>> 16,
 		i[1] & 65535
 	], l = /* @__PURE__ */ new Float64Array(4);
-	se(o(i, 7), o(i, 8), o(i, 9), o(i, 10), l);
+	oe(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 {
@@ -401,7 +401,7 @@ function ge(t, n) {
 }
 //#endregion
 //#region node_modules/.pnpm/@noble+hashes@2.4.0/node_modules/@noble/hashes/utils.js
-function _e(e) {
+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}" ` : "";
@@ -411,27 +411,27 @@ function U(e, t = "") {
 	return e;
 }
 function W(e, t, n = "") {
-	if (_e(e) && (t === void 0 || e.length === t)) return e;
+	if (ge(e) && (t === void 0 || e.length === t)) return e;
 	t !== void 0 && U(t, "length");
-	let r = _e(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 = H(n) + "expected Uint8Array" + i + ", got " + a;
 	throw r ? RangeError(o) : TypeError(o);
 }
-function ve(e) {
+function _e(e) {
 	return Uint8Array.from(W(e));
 }
-var ye = (e, t) => {
+var ve = (e, t) => {
 	if (typeof e != "object" || !e || Array.isArray(e)) throw TypeError((t === "object" ? "" : `"${t}" `) + "expected object, got type=" + typeof e);
-}, be = (e, t) => {
-	ye(e, t);
+}, ye = (e, t) => {
+	ve(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 xe(e, t = !0) {
+function be(e, t = !0) {
 	if (e.destroyed) throw Error("hash was destroyed");
 	if (t && e.finished) throw Error("digest() was already called");
 }
-function Se(e, t) {
+function xe(e, t) {
 	W(e, void 0, "output");
 	let n = t.outputLen;
 	if (!(e.length >= n)) throw RangeError("\"output\" expected length >= " + n);
@@ -442,34 +442,34 @@ function G(e) {
 function K(...e) {
 	for (let t = 0; t < e.length; t++) e[t].fill(0);
 }
-var Ce = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
-function we(e) {
+var Se = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+function Ce(e) {
 	return e << 24 & 4278190080 | e << 8 & 16711680 | e >>> 8 & 65280 | e >>> 24 & 255;
 }
-var q = Ce ? (e) => e : (e) => we(e) >>> 0;
-function Te(e) {
-	for (let t = 0; t < e.length; t++) e[t] = we(e[t]);
+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]);
 	return e;
 }
-var J = Ce ? (e) => e : Te, Ee = typeof Uint8Array.from([]).toHex == "function" && typeof Uint8Array.fromHex == "function", De = /* @__PURE__ */ Array.from({ length: 256 }, (e, t) => t.toString(16).padStart(2, "0"));
-function Oe(e) {
-	if (W(e), Ee) return e.toHex();
+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();
 	let t = "";
-	for (let n = 0; n < e.length; n++) t += De[e[n]];
+	for (let n = 0; n < e.length; n++) t += Ee[e[n]];
 	return t;
 }
-function ke(e, t, n = "opts") {
-	return be(e, "defaults"), t !== void 0 && be(t, n), Object.assign(Object.create(null), e, 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 = {}) {
+function ke(e, t = {}) {
 	if (typeof e != "function") throw TypeError("\"hashCons\" expected function, got type=" + typeof e);
-	t = ke({}, t, "info");
+	t = Oe({}, 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 je = /* @__PURE__ */ Uint8Array.from([
+var Ae = /* @__PURE__ */ Uint8Array.from([
 	0,
 	1,
 	2,
@@ -726,15 +726,15 @@ var je = /* @__PURE__ */ Uint8Array.from([
 	14,
 	1,
 	9
-]), Me = (e) => e / 2 ** 32 | 0, Ne = (e) => e >>> 0, Pe = (e, t, n) => e >>> n | t << 32 - n, Y = (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 ze(e, t, n, r) {
+]), 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) {
 	let i = (t >>> 0) + (r >>> 0);
 	return {
 		h: e + n + (i / 2 ** 32 | 0) | 0,
 		l: i | 0
 	};
 }
-var Be = (e, t, n) => (e >>> 0) + (t >>> 0) + (n >>> 0), Ve = (e, t, n, r) => t + n + r + (e / 2 ** 32 | 0) | 0, X = /* @__PURE__ */ Uint32Array.from([
+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([
 	4089235720,
 	1779033703,
 	2227873595,
@@ -753,24 +753,24 @@ var Be = (e, t, n) => (e >>> 0) + (t >>> 0) + (n >>> 0), Ve = (e, t, n, r) => t
 	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 = Be(c, u, o);
-	l = Ve(g, l, d, s), c = g | 0;
+	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;
 	let _ = h ^ l, v = m ^ c;
-	h = Le(_, v), m = Re(_, v), {h: p, l: f} = ze(p, f, h, m), _ = d ^ p, v = u ^ f, d = Pe(_, v, 24), u = Y(_, 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 = 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;
 }
 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 = Be(c, u, o);
-	l = Ve(g, l, d, s), c = g | 0;
+	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;
 	let _ = h ^ l, v = m ^ c;
-	h = Pe(_, v, 16), m = Y(_, v, 16), {h: p, l: f} = ze(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 = 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;
 }
-function He(e, t = {}, n, r, i) {
+function Ve(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 Ue = class {
+var He = class {
 	buffer;
 	buffer32;
 	finished = !1;
@@ -784,7 +784,7 @@ var Ue = class {
 		U(e), U(t), this.blockLen = e, this.outputLen = t, this.buffer = new Uint8Array(e), this.buffer32 = G(this.buffer);
 	}
 	update(e) {
-		xe(this), W(e);
+		be(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);
@@ -799,7 +799,7 @@ var Ue = class {
 		return this;
 	}
 	digestInto(e) {
-		if (xe(this), Se(e, this), e.byteOffset & 3) throw RangeError("\"output\" expected 4-byte aligned byteOffset, got " + e.byteOffset);
+		if (be(this), xe(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);
 		let r = this.get(), i = e === this.buffer ? n : G(e), a = Math.floor(this.outputLen / 4);
@@ -822,7 +822,7 @@ var Ue = class {
 	clone() {
 		return this._cloneInto();
 	}
-}, We = class extends Ue {
+}, Ue = class extends He {
 	v0l = X[0] | 0;
 	v0h = X[1] | 0;
 	v1l = X[2] | 0;
@@ -840,18 +840,18 @@ var Ue = class {
 	v7l = X[14] | 0;
 	v7h = X[15] | 0;
 	constructor(e = {}) {
-		e = ke({}, e);
+		e = Oe({}, e);
 		let t = e.dkLen === void 0 ? 64 : e.dkLen;
-		super(128, t), He(t, e, 64, 16, 16);
+		super(128, t), Ve(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(ve(i));
+			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]);
 		}
 		if (r !== void 0) {
 			W(r, void 0, "personalization");
-			let e = G(ve(r));
+			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]);
 		}
 		if (n !== void 0) {
@@ -886,20 +886,20 @@ var Ue = 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 = Ne(this.length), b = Me(this.length);
+		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 = je;
+		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);
 	}
 	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);
 	}
-}, Ge = /* @__PURE__ */ Ae((e) => new We(e));
+}, We = /* @__PURE__ */ ke((e) => new Ue(e));
 //#endregion
 //#region src/format/hash.ts
-function Ke(e) {
-	return Oe(Ge(e, { dkLen: 8 }));
+function Ge(e) {
+	return De(We(e, { dkLen: 8 }));
 }
 //#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 _, ge as a, f as b, re as c, j as d, P as f, E as g, D as h, he as i, i as j, a as k, ie as l, M as m, fe as n, ae as o, A as p, ce as r, oe as s, Ke as t, F as u, e as v, m as w, b as x, t as y, d as z };
+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 };

package/dist/index.js

@@ -1,4 +1,4 @@
-import { S as e, _ as t, a as n, b as r, c as i, d as a, f as o, g as s, h as c, i as l, l as u, m as d, n as f, o as p, p as m, r as h, s as g, t as _, u as v, v as y, x as b, y as x } from "./controls-5FaXzanr.js";
+import { S as e, _ as t, a as n, b as r, c as i, d as a, f as o, g as s, h as c, i as l, l as u, m as d, n as f, o as p, p as m, r as h, s as g, t as _, u as v, v as y, x as b, y as x } from "./controls-mxyJLzqv.js";
 import { t as S } from "./ports-DZRKjdYD.js";
 import { t as C } from "./http-DL7R39Nc.js";
 //#region src/engine/plugins/grade.wgsl?raw

package/dist/{synthetic-BZcHRI1P.js → synthetic-BeGCzYIv.js}

@@ -1,4 +1,4 @@
-import { F as e, L as t, f as n, h as r, k as i, m as a, r as o, v as s } from "./format-CxKTIugr.js";
+import { F as e, L as t, f as n, h as r, k as i, m as a, r as o, v as s } from "./format-C3Vn0c2b.js";
 import { t as c } from "./ports-DZRKjdYD.js";
 //#region src/format/encode.ts
 var l = 5e-4, u = 2048, d = 256, f = (e, t, n) => Math.min(n, Math.max(t, e));

package/dist/tools/index.js

@@ -1 +1 @@
-export { t as exportPly, r as info, o as openWorld, n as plySplat, i as probe, a as validate, s as walk } from "../tools-DwOGah9N.js";
+export { t as exportPly, r as info, o as openWorld, n as plySplat, i as probe, a as validate, s as walk } from "../tools-NykPVccD.js";

package/dist/{tools-DwOGah9N.js → tools-NykPVccD.js}

@@ -1,4 +1,4 @@
-import { a as e, c as t, d as n, f as r, g as i, l as a, m as o, n as s, o as c, p as l, t as u, u as d, v as f } from "./format-CxKTIugr.js";
+import { a as e, c as t, d as n, f as r, g as i, l as a, m as o, n as s, o as c, p as l, t as u, u as d, v as f } from "./format-C3Vn0c2b.js";
 import { t as p } from "./ports-DZRKjdYD.js";
 //#region src/tools/walk.ts
 var m = 16;

package/package.json

@@ -1,6 +1,6 @@
 {
 	"name": "@kalyptos/narcissus",
-	"version": "0.1.0",
+	"version": "0.1.2",
 	"description": "A WebGPU engine and tools for Guldmund Trees, streamed gaussian-splat scenes",
 	"license": "BSD-3-Clause",
 	"repository": {