@kalyptos/narcissus 0.2.0 → 0.2.1

package/dist/{controls-Dlxyn7yr.js → controls--A-CvrQ5.js}

@@ -116,7 +116,7 @@ function S(e, t, n, r) {
 }
 //#endregion
 //#region src/engine/gpu/masks.ts
-var C = 8, w = 3e38, T = class {
+var C = 8, w = 3e38, T = 4, E = class {
 	layout;
 	#e;
 	#t;
@@ -129,8 +129,9 @@ var C = 8, w = 3e38, T = class {
 		0
 	];
 	#o = [];
+	#s = null;
 	constructor(e) {
-		this.#e = e, this.layout = x(e, "masks", GPUShaderStage.COMPUTE, ["read-only-storage"]), this.#t = this.#s(64);
+		this.#e = e, this.layout = x(e, "masks", GPUShaderStage.COMPUTE, ["read-only-storage"]), this.#t = this.#c(64);
 	}
 	get group() {
 		return this.#n ??= S(this.#e, "masks", this.layout, [this.#t]);
@@ -151,20 +152,21 @@ var C = 8, w = 3e38, T = class {
 			targets: t,
 			enabled: !0,
 			area: r
-		}), this.#i;
+		}), this.#s = null, this.#i;
 	}
 	enable(e, t) {
 		let n = this.#r.get(e);
 		n && (n.enabled = t);
 	}
 	delete(e) {
-		this.#r.delete(e);
+		this.#r.delete(e) && (this.#s = null);
 	}
 	area(e) {
 		return this.#r.get(e)?.area;
 	}
 	relate(e, t, n, r) {
-		for (let [i, { prism: a, targets: o, enabled: s, area: c }] of this.#r) {
+		for (let i of (this.#s ??= new D(this.#r)).near(t, n)) {
+			let { prism: a, targets: o, enabled: s, area: c } = this.#r.get(i);
 			if (!s || !o.has(e) || n[0] < c[0] || n[1] < c[1] || t[0] > c[2] || t[1] > c[3]) continue;
 			let l = y(a, t, n);
 			if (l === 1) return !0;
@@ -195,19 +197,55 @@ var C = 8, w = 3e38, T = class {
 			o.set(e, c++);
 		}
 		for (let n = 0; n < e.length; n++) t[s + n] = o.get(e[n]) ?? 0;
-		t.byteLength > this.#t.size && (this.#t.destroy(), this.#t = this.#s(t.byteLength), this.#n = null), t.length && this.#e.queue.writeBuffer(this.#t, 0, t);
+		t.byteLength > this.#t.size && (this.#t.destroy(), this.#t = this.#c(t.byteLength), this.#n = null), t.length && this.#e.queue.writeBuffer(this.#t, 0, t);
 	}
 	destroy() {
 		this.#t.destroy();
 	}
-	#s(e) {
+	#c(e) {
 		return this.#e.createBuffer({
 			label: "masks",
 			size: Math.max(256, 2 ** Math.ceil(Math.log2(e))),
 			usage: GPUBufferUsage.STORAGE | GPUBufferUsage.COPY_DST
 		});
 	}
-}, E = 19, D = 23, O = 7, k = 11, A = [], j = 1024, M = class {
+}, D = class {
+	#e;
+	#t;
+	#n = /* @__PURE__ */ new Map();
+	#r = [];
+	constructor(e) {
+		this.#e = [...e.keys()];
+		let t = [...e.values()].map(({ area: e }) => Math.max(e[2] - e[0], e[3] - e[1])).sort((e, t) => e - t);
+		this.#t = Math.max(t[t.length >> 1] ?? 1, .001);
+		for (let [t, { area: n }] of e) {
+			let [e, r, i, a] = O(n[0], n[1], n[2], n[3], this.#t);
+			if (i - e >= T || a - r >= T) this.#r.push(t);
+			else for (let n = e; n <= i; n++) for (let e = r; e <= a; e++) {
+				let r = this.#n.get(`${n},${e}`);
+				r ? r.push(t) : this.#n.set(`${n},${e}`, [t]);
+			}
+		}
+	}
+	near(e, t) {
+		let [n, r, i, a] = O(e[0], e[1], t[0], t[1], this.#t);
+		if ((i - n + 1) * (a - r + 1) > this.#e.length) return this.#e;
+		let o = new Set(this.#r);
+		for (let e = n; e <= i; e++) for (let t = r; t <= a; t++) for (let n of this.#n.get(`${e},${t}`) ?? []) o.add(n);
+		return o;
+	}
+};
+function O(e, t, n, r, i) {
+	return [
+		Math.floor(e / i),
+		Math.floor(t / i),
+		Math.floor(n / i),
+		Math.floor(r / i)
+	];
+}
+//#endregion
+//#region src/engine/gpu/pool.ts
+var k = 19, A = 23, j = 7, M = 11, N = [], ee = 1024, te = class {
 	#e = [];
 	mark(e, t) {
 		this.#e.push([e, t]);
@@ -220,11 +258,11 @@ var C = 8, w = 3e38, T = class {
 		this.#e = [];
 		for (let i = 0; i < r.length;) {
 			let a = r[i][0], o = r[i++][1];
-			for (; i < r.length && r[i][0] <= o + j;) o = Math.max(o, r[i++][1]);
+			for (; i < r.length && r[i][0] <= o + ee;) o = Math.max(o, r[i++][1]);
 			e.writeBuffer(t, a * 4, n, a, o - a);
 		}
 	}
-}, ee = class {
+}, ne = class {
 	geometry;
 	colour;
 	pages;
@@ -249,25 +287,26 @@ var C = 8, w = 3e38, T = class {
 	];
 	#u;
 	#d;
-	#f = new M();
+	#f = new te();
 	#p;
 	#m;
-	#h = new M();
+	#h = new te();
 	#g;
 	#_ = [];
 	#v;
 	#y;
 	#b = !1;
+	#x = null;
 	constructor(e, t) {
-		this.capacity = t, this.masks = new T(e), this.#e = e;
+		this.capacity = t, this.masks = new E(e), this.#e = e;
 		let n = this.slots;
-		this.#S(), this.#a = new Uint8Array(n), this.#o = n, this.#c = Array.from({ length: n }, (e, t) => n - 1 - t), this.#u = new Uint32Array(n * 36), this.#d = new Float32Array(this.#u.buffer), this.#p = new Uint32Array(n * 12), this.#m = new Float32Array(this.#p.buffer), this.#g = new Uint32Array(n), this.#v = new Uint8Array(n), this.#y = Array(n).fill(A);
+		this.#w(), this.#a = new Uint8Array(n), this.#o = n, this.#c = Array.from({ length: n }, (e, t) => n - 1 - t), this.#u = new Uint32Array(n * 36), this.#d = new Float32Array(this.#u.buffer), this.#p = new Uint32Array(n * 12), this.#m = new Float32Array(this.#p.buffer), this.#g = new Uint32Array(n), this.#v = new Uint8Array(n), this.#y = Array(n).fill(N);
 	}
 	get slots() {
 		return this.capacity / 256;
 	}
 	get bytes() {
-		return this.#x().reduce((e, t) => e + t.size, 0);
+		return this.#C().reduce((e, t) => e + t.size, 0);
 	}
 	has(e) {
 		let t = this.#t.get(e);
@@ -282,13 +321,13 @@ var C = 8, w = 3e38, T = class {
 	add(t, n, r, i, a = 0) {
 		if (this.#t.has(t)) return !0;
 		let o = d(n.count) / 256;
-		if (!this.#T(o, i)) return !1;
+		if (!this.#D(o, i)) return !1;
 		let s = e.origin, c = {
 			id: t,
 			previous: null,
 			next: null,
 			page: n,
-			slots: this.#N(o),
+			slots: this.#F(o),
 			active: [],
 			mask: 0,
 			table: this.#c.pop(),
@@ -300,14 +339,14 @@ var C = 8, w = 3e38, T = class {
 			factors: 0,
 			layer: a
 		};
-		return this.#t.set(t, c), this.#w(c), this.#i.add(t), !0;
+		return this.#t.set(t, c), this.#E(c), this.#i.add(t), !0;
 	}
 	remove(e) {
 		let t = this.#t.get(e);
 		if (t) {
-			this.#C(t), this.#t.delete(e), this.#i.delete(e);
-			for (let e of t.slots) this.#a[e] = 0, this.#v[e] = 0, this.#y[e].length && (this.#b = !0), this.#y[e] = A;
-			this.#s = Math.min(this.#s, t.slots[0]), this.#o += t.slots.length, this.#c.push(t.table), t.page === null && t.factors !== 0 && this.#O(t, 0);
+			this.#T(t), this.#t.delete(e), this.#i.delete(e);
+			for (let e of t.slots) this.#a[e] = 0, this.#v[e] = 0, this.#y[e].length && (this.#b = !0), this.#y[e] = N;
+			this.#s = Math.min(this.#s, t.slots[0]), this.#o += t.slots.length, this.#c.push(t.table), t.page === null && t.factors !== 0 && this.#A(t, 0);
 		}
 	}
 	clear() {
@@ -320,19 +359,20 @@ var C = 8, w = 3e38, T = class {
 		let t = 0;
 		for (let n of this.#i) {
 			if (t >= e) break;
-			t += this.#E(this.#t.get(n)), this.#i.delete(n);
+			t += this.#O(this.#t.get(n)), this.#i.delete(n);
 		}
 		return t;
 	}
 	draw(e) {
+		this.#x &&= (this.#j(this.#x), null);
 		let t = 0, n = 0, r = !1;
 		for (let { id: i, factors: a } of e) {
 			let e = this.#t.get(i);
 			if (!e || e.page !== null) continue;
 			let o = e.active;
-			(e.factors !== a || e.mask < 0) && this.#O(e, a), r ||= o !== e.active, this.#w(e), r ||= this.#_[n] !== e, this.#_[n++] = e, r && this.#g.set(e.active, t), t += e.active.length;
+			(e.factors !== a || e.mask < 0) && this.#A(e, a), r ||= o !== e.active, this.#E(e), r ||= this.#_[n] !== e, this.#_[n++] = e, r && this.#g.set(e.active, t), t += e.active.length;
 		}
-		r ||= this.#_.length !== n, this.#_.length = n, this.listed = t, this.#b && this.#M();
+		r ||= this.#_.length !== n, this.#_.length = n, this.listed = t, this.#b && this.#P();
 		let i = this.#e.queue;
 		this.#f.flush(i, this.pages, this.#u), this.#h.flush(i, this.clusters, this.#p), r && t && i.writeBuffer(this.list, 0, this.#g, 0, t);
 	}
@@ -342,26 +382,35 @@ var C = 8, w = 3e38, T = class {
 			e[1],
 			e[2]
 		];
-		for (let e of this.#t.values()) e.page === null && this.#D(e);
+		for (let e of this.#t.values()) e.page === null && this.#k(e);
 		this.#e.queue.writeBuffer(this.pages, 0, this.#u), this.#f.clear(), this.masks.setOrigin(this.#l), this.masks.size && this.masks.write();
 	}
 	addMask(e, t) {
 		let n = this.masks.add(e, t);
-		return this.#k(this.masks.area(n)), n;
+		return this.#S(this.masks.area(n)), n;
 	}
 	enableMask(e, t) {
-		this.masks.enable(e, t), this.#k(this.masks.area(e));
+		this.masks.enable(e, t), this.#S(this.masks.area(e));
 	}
 	deleteMask(e) {
 		let t = this.masks.area(e);
-		this.masks.delete(e), this.#k(t);
+		this.masks.delete(e), this.#S(t);
+	}
+	#S(e) {
+		let t = this.#x ??= [
+			Infinity,
+			Infinity,
+			-Infinity,
+			-Infinity
+		];
+		t[0] = Math.min(t[0], e[0]), t[1] = Math.min(t[1], e[1]), t[2] = Math.max(t[2], e[2]), t[3] = Math.max(t[3], e[3]);
 	}
 	grow(e) {
 		if (e <= this.capacity) return;
-		let t = this.slots, n = this.#x();
-		this.capacity = e, this.#S();
+		let t = this.slots, n = this.#C();
+		this.capacity = e, this.#w();
 		let r = this.#e.createCommandEncoder({ label: "pool grow" });
-		this.#x().forEach((e, t) => r.copyBufferToBuffer(n[t], 0, e, 0, n[t].size)), this.#e.queue.submit([r.finish()]);
+		this.#C().forEach((e, t) => r.copyBufferToBuffer(n[t], 0, e, 0, n[t].size)), this.#e.queue.submit([r.finish()]);
 		for (let e of n) e.destroy();
 		let i = this.slots, a = new Uint8Array(i);
 		a.set(this.#a), this.#a = a, this.#o += i - t;
@@ -374,13 +423,13 @@ var C = 8, w = 3e38, T = class {
 		c.set(this.#g), this.#g = c;
 		let l = new Uint8Array(i);
 		l.set(this.#v), this.#v = l;
-		for (let e = t; e < i; e++) this.#y.push(A);
+		for (let e = t; e < i; e++) this.#y.push(N);
 	}
 	destroy() {
-		for (let e of this.#x()) e.destroy();
+		for (let e of this.#C()) e.destroy();
 		this.masks.destroy();
 	}
-	#x() {
+	#C() {
 		return [
 			this.geometry,
 			this.colour,
@@ -389,7 +438,7 @@ var C = 8, w = 3e38, T = class {
 			this.list
 		];
 	}
-	#S() {
+	#w() {
 		let { capacity: e, slots: t } = this, n = GPUBufferUsage.STORAGE | GPUBufferUsage.COPY_DST | GPUBufferUsage.COPY_SRC, r = (e, t) => this.#e.createBuffer({
 			label: e,
 			size: t,
@@ -397,13 +446,13 @@ var C = 8, w = 3e38, T = class {
 		});
 		this.geometry = r("pool geometry", e * 4 * 4), this.colour = r("pool colour", e * 3 * 4), this.pages = r("pool pages", t * 36 * 4), this.clusters = r("pool clusters", t * 12 * 4), this.list = r("pool list", t * 4);
 	}
-	#C(e) {
+	#T(e) {
 		e.previous ? e.previous.next = e.next : this.#n === e && (this.#n = e.next), e.next ? e.next.previous = e.previous : this.#r === e && (this.#r = e.previous), e.previous = null, e.next = null;
 	}
-	#w(e) {
-		this.#r !== e && (this.#C(e), e.previous = this.#r, this.#r ? this.#r.next = e : this.#n = e, this.#r = e);
+	#E(e) {
+		this.#r !== e && (this.#T(e), e.previous = this.#r, this.#r ? this.#r.next = e : this.#n = e, this.#r = e);
 	}
-	#T(e, t) {
+	#D(e, t) {
 		let n = this.#o;
 		if (n >= e) return !0;
 		let r = [];
@@ -412,7 +461,7 @@ var C = 8, w = 3e38, T = class {
 		for (let e of r) this.remove(e);
 		return !0;
 	}
-	#E(t) {
+	#O(t) {
 		let n = t.page, { slots: r } = t, i = this.#e.queue, a = r.length, o = this.#p, s = this.#m;
 		for (let e = 0; e < a; e++) {
 			let i = r[e] * 12;
@@ -426,13 +475,13 @@ var C = 8, w = 3e38, T = class {
 			i.writeBuffer(this.geometry, c * 4 * 4, n.geometry, o * 4, s * 4), i.writeBuffer(this.colour, c * 3 * 4, n.colour, o * 3, s * 3), this.#h.mark(r[e] * 12, (r[e] + t) * 12), e += t;
 		}
 		let c = t.table * 36, l = this.#u, u = this.#d, d = n.params, [f, p, m] = n.quadrants;
-		return l.fill(0, c, c + 36), this.#D(t), l[c + 3] = n.count, u.set(d.subarray(e.step, e.step + 3), c + 4), l[c + 7] = f, u.set(d.subarray(e.scaleMin, e.scaleMin + 3), c + 8), l[c + 11] = p, u.set(d.subarray(e.scaleMax, e.scaleMax + 3), c + 12), l[c + 15] = m, u.set(d.subarray(e.dcMin, e.dcMin + 3), c + 16), u.set(d.subarray(e.dcMax, e.dcMax + 3), c + 20), l[c + D] = t.layer, u.set(d.subarray(e.shScale, e.shScale + 9), c + 24), this.#f.mark(c, c + 36), t.page = null, this.masks.size && this.#j(t), n.count * 7 * 4 + a * 12 * 4 + 144;
+		return l.fill(0, c, c + 36), this.#k(t), l[c + 3] = n.count, u.set(d.subarray(e.step, e.step + 3), c + 4), l[c + 7] = f, u.set(d.subarray(e.scaleMin, e.scaleMin + 3), c + 8), l[c + 11] = p, u.set(d.subarray(e.scaleMax, e.scaleMax + 3), c + 12), l[c + 15] = m, u.set(d.subarray(e.dcMin, e.dcMin + 3), c + 16), u.set(d.subarray(e.dcMax, e.dcMax + 3), c + 20), l[c + A] = t.layer, u.set(d.subarray(e.shScale, e.shScale + 9), c + 24), this.#f.mark(c, c + 36), t.page = null, this.masks.size && this.#N(t), n.count * 7 * 4 + a * 12 * 4 + 144;
 	}
-	#D(e) {
+	#k(e) {
 		let t = e.table * 36;
 		for (let n = 0; n < 3; n++) this.#d[t + n] = e.base[n] - this.#l[n];
 	}
-	#O(e, t) {
+	#A(e, t) {
 		let n = 0;
 		for (let e = 0; e < 4; e++) t >>> 8 * e & 255 && (n |= 1 << e);
 		if (n !== e.mask) {
@@ -450,10 +499,10 @@ var C = 8, w = 3e38, T = class {
 			}
 		}
 		e.factors = t;
-		let r = e.table * 36 + E;
+		let r = e.table * 36 + k;
 		this.#u[r] = t, this.#f.mark(r, r + 1);
 	}
-	#k(e) {
+	#j(e) {
 		let t = [
 			0,
 			0,
@@ -463,14 +512,14 @@ var C = 8, w = 3e38, T = class {
 			0,
 			0
 		];
-		for (let r of this.#t.values()) r.page === null && r.slots.some((i) => (this.#A(r, i, t, n), n[0] >= e[0] && n[1] >= e[1] && t[0] <= e[2] && t[1] <= e[3])) && this.#j(r);
+		for (let r of this.#t.values()) r.page === null && r.slots.some((i) => (this.#M(r, i, t, n), n[0] >= e[0] && n[1] >= e[1] && t[0] <= e[2] && t[1] <= e[3])) && this.#N(r);
 		this.#b = !0;
 	}
-	#A(e, t, n, r) {
+	#M(e, t, n, r) {
 		let i = this.#m, a = t * 12;
 		for (let t = 0; t < 3; t++) n[t] = e.base[t] + i[a + 4 + t], r[t] = e.base[t] + i[a + 8 + t];
 	}
-	#j(e) {
+	#N(e) {
 		let t = [
 			0,
 			0,
@@ -481,23 +530,23 @@ var C = 8, w = 3e38, T = class {
 			0
 		];
 		for (let r of e.slots) {
-			this.#A(e, r, t, n);
+			this.#M(e, r, t, n);
 			let i = [], a = +!!this.masks.relate(e.layer, t, n, i), o = this.#y[r];
-			a !== this.#v[r] && (e.mask = -1), this.#v[r] = a, (o.length || i.length) && (this.#b = !0), this.#y[r] = i.length ? i : A;
+			a !== this.#v[r] && (e.mask = -1), this.#v[r] = a, (o.length || i.length) && (this.#b = !0), this.#y[r] = i.length ? i : N;
 		}
 	}
-	#M() {
+	#P() {
 		this.#b = !1;
 		let e = this.#p, t = [], n = this.masks.listBase;
 		for (let r = 0; r < this.#y.length; r++) {
 			let i = this.#y[r], a = r * 12, o = i.length ? n : 0;
-			(e[a + O] !== o || e[a + k] !== i.length) && (e[a + O] = o, e[a + k] = i.length, this.#h.mark(a, a + 12));
+			(e[a + j] !== o || e[a + M] !== i.length) && (e[a + j] = o, e[a + M] = i.length, this.#h.mark(a, a + 12));
 			for (let e of i) t.push(e);
 			n += i.length;
 		}
 		this.masks.write(t);
 	}
-	#N(e) {
+	#F(e) {
 		let t = this.#a, n = -1;
 		for (let r = this.#s; r <= t.length - e;) {
 			let i = r;
@@ -518,7 +567,7 @@ var C = 8, w = 3e38, T = class {
 };
 //#endregion
 //#region src/engine/math/mat4.ts
-function te(e, t) {
+function re(e, t) {
 	let n = Math.cos(t);
 	return [
 		Math.sin(e) * n,
@@ -526,30 +575,30 @@ function te(e, t) {
 		Math.sin(t)
 	];
 }
-function ne(e, t, n, r) {
-	let [i, a, o] = te(n, r), s = Math.cos(n), c = -Math.sin(n), l = c * o, u = -s * o, d = s * a - c * i;
+function ie(e, t, n, r) {
+	let [i, a, o] = re(n, r), s = Math.cos(n), c = -Math.sin(n), l = c * o, u = -s * o, d = s * a - c * i;
 	return e[0] = s, e[1] = l, e[2] = -i, e[3] = 0, e[4] = c, e[5] = u, e[6] = -a, e[7] = 0, e[8] = 0, e[9] = d, e[10] = -o, e[11] = 0, e[12] = -(s * t[0] + c * t[1]), e[13] = -(l * t[0] + u * t[1] + d * t[2]), e[14] = i * t[0] + a * t[1] + o * t[2], e[15] = 1, e;
 }
-function re(e, t, n, r, i) {
+function ae(e, t, n, r, i) {
 	let a = 1 / Math.tan(t / 2);
 	return e.fill(0), e[0] = a / n, e[5] = a, e[10] = i / (r - i), e[11] = -1, e[14] = r * i / (r - i), e;
 }
-var ie = /* @__PURE__ */ new Float64Array(16);
-function N(e, t, n) {
+var oe = /* @__PURE__ */ new Float64Array(16);
+function P(e, t, n) {
 	for (let e = 0; e < 4; e++) for (let r = 0; r < 4; r++) {
 		let i = 0;
 		for (let a = 0; a < 4; a++) i += t[a * 4 + r] * n[e * 4 + a];
-		ie[e * 4 + r] = i;
+		oe[e * 4 + r] = i;
 	}
-	return e.set(ie), e;
+	return e.set(oe), e;
 }
-function ae(e, t) {
+function se(e, t) {
 	let [n, r, i, a, o, s, c, l, u, d, f, p, m, h, g, _] = t, v = n * s - r * o, y = n * c - i * o, b = n * l - a * o, x = r * c - i * s, S = r * l - a * s, C = i * l - a * c, w = u * h - d * m, T = u * g - f * m, E = u * _ - p * m, D = d * g - f * h, O = d * _ - p * h, k = f * _ - p * g, A = v * k - y * O + b * D + x * E - S * T + C * w;
 	if (!A) return null;
 	let j = 1 / A;
 	return e[0] = (s * k - c * O + l * D) * j, e[1] = (i * O - r * k - a * D) * j, e[2] = (h * C - g * S + _ * x) * j, e[3] = (f * S - d * C - p * x) * j, e[4] = (c * E - o * k - l * T) * j, e[5] = (n * k - i * E + a * T) * j, e[6] = (g * b - m * C - _ * y) * j, e[7] = (u * C - f * b + p * y) * j, e[8] = (o * O - s * E + l * w) * j, e[9] = (r * E - n * O - a * w) * j, e[10] = (m * S - h * b + _ * v) * j, e[11] = (d * b - u * S - p * v) * j, e[12] = (s * T - o * D - c * w) * j, e[13] = (n * D - r * T + i * w) * j, e[14] = (h * y - m * x - g * v) * j, e[15] = (u * x - d * y + f * v) * j, e;
 }
-function oe(e, t) {
+function ce(e, t) {
 	let [n, r, i] = t;
 	return [
 		e[0] * n + e[4] * r + e[8] * i + e[12],
@@ -560,7 +609,7 @@ function oe(e, t) {
 }
 //#endregion
 //#region src/engine/gpu/common.wgsl?raw
-var P = "// shared by every engine pass; sizes and word offsets mirror format/spec.ts\n\nconst KEY_BITS: u32 = 24u;\n// word offsets in the work buffer, layout.ts WORK\nconst WORK_VISIBLE: u32 = 0u;\nconst WORK_PROJECTED: u32 = 4u;\nconst WORK_LIST: u32 = 16u;\n// workgroups a dispatch row holds\nconst GROUPS_X: u32 = 65535u;\nconst C0: f32 = 0.28209479177387814;\nconst C1: f32 = 0.4886025119029199;\n\n// floating-origin ENU frame; camera looks down -z of view space\nstruct FrameUniforms {\n	view: mat4x4f,\n	proj: mat4x4f,\n	viewProj: mat4x4f,\n	// inside when dot(plane.xyz, p) + plane.w >= 0\n	planes: array<vec4f, 6>,\n	camera: vec3f,\n	time: f32,\n	// render target pixels\n	viewport: vec2f,\n	focal: vec2f,\n	near: f32,\n	far: f32,\n	lowPass: f32,\n	// drawn cluster ids in the pool's list\n	clusters: u32,\n}\n\n// one resident page; dc and sh ranges are after the colour correction\nstruct Page {\n	origin: vec3f,\n	count: u32,\n	step: vec3f,\n	q1: u32,\n	scaleMin: vec3f,\n	q2: u32,\n	scaleMax: vec3f,\n	q3: u32,\n	dcMin: vec3f,\n	// quadrant k opacity 0-255 at bits 8k\n	factors: u32,\n	dcMax: vec3f,\n	// 0 for the world, else the layer that holds the page\n	layer: u32,\n	shScale: array<vec4f, 3>,\n}\n\n// up to CLUSTER consecutive splats of one page in one pool slot\nstruct Cluster {\n	page: u32,\n	// first pool record\n	slot: u32,\n	// index in the page of its first splat\n	first: u32,\n	count: u32,\n	// extents relative to the page origin\n	boxMin: vec3f,\n	// word in masks.wgsl's buffer of the list of masks that may hide some of its splats\n	maskList: u32,\n	boxMax: vec3f,\n	maskCount: u32,\n}\n\n// a splat on screen; pixels with y up from the bottom-left of the target\nstruct Projected {\n	centre: vec2f,\n	// pack2x16float: 1-sigma major axis xy, 1-sigma minor axis xy\n	axes: vec2u,\n	// pack2x16float: r g, b opacity\n	colour: vec2u,\n}\n\n// what a shade hook may change; position in the floating-origin frame, depth in view metres\nstruct Splat {\n	position: vec3f,\n	depth: f32,\n	colour: vec3f,\n	opacity: f32,\n	scale: vec3f,\n}\n\n// the byte of word at bit, 0 to 1\nfn fraction(word: u32, bit: u32) -> f32 {\n	return f32(extractBits(word, bit, 8u)) / 255.0;\n}\n\n// sigmas out to where a gaussian of opacity falls under 1/255, at most 3; the quad raster draws\nfn reach(opacity: f32) -> f32 {\n	return min(3.0, sqrt(max(2.0 * log(255.0 * opacity), 0.0)));\n}\n", se = "// one thread per listed cluster\n\n@group(0) @binding(0) var<uniform> uniforms: FrameUniforms;\n@group(0) @binding(1) var<storage, read> pages: array<Page>;\n@group(0) @binding(2) var<storage, read> clusters: array<Cluster>;\n@group(0) @binding(3) var<storage, read> list: array<u32>;\n@group(0) @binding(4) var<storage, read_write> work: array<atomic<u32>>;\n\n// false only when the box lies wholly outside one plane\nfn inside(lo: vec3f, hi: vec3f) -> bool {\n	for (var p = 0u; p < 6u; p++) {\n		let plane = uniforms.planes[p];\n		let corner = select(lo, hi, plane.xyz >= vec3f(0.0));\n		if (dot(plane.xyz, corner) + plane.w < 0.0) {\n			return false;\n		}\n	}\n	return true;\n}\n\n@compute @workgroup_size(64)\nfn cull(@builtin(global_invocation_id) id: vec3u) {\n	if (id.x >= uniforms.clusters) {\n		return;\n	}\n	let slot = list[id.x];\n	let cluster = clusters[slot];\n	let page = pages[cluster.page];\n	if (!inside(page.origin + cluster.boxMin, page.origin + cluster.boxMax)) {\n		return;\n	}\n	atomicStore(&work[WORK_LIST + atomicAdd(&work[WORK_VISIBLE], 1u)], slot);\n}\n", ce = 64, le = class {
+var F = "// shared by every engine pass; sizes and word offsets mirror format/spec.ts\n\nconst KEY_BITS: u32 = 24u;\n// word offsets in the work buffer, layout.ts WORK\nconst WORK_VISIBLE: u32 = 0u;\nconst WORK_PROJECTED: u32 = 4u;\nconst WORK_LIST: u32 = 16u;\n// workgroups a dispatch row holds\nconst GROUPS_X: u32 = 65535u;\nconst C0: f32 = 0.28209479177387814;\nconst C1: f32 = 0.4886025119029199;\n\n// floating-origin ENU frame; camera looks down -z of view space\nstruct FrameUniforms {\n	view: mat4x4f,\n	proj: mat4x4f,\n	viewProj: mat4x4f,\n	// inside when dot(plane.xyz, p) + plane.w >= 0\n	planes: array<vec4f, 6>,\n	camera: vec3f,\n	time: f32,\n	// render target pixels\n	viewport: vec2f,\n	focal: vec2f,\n	near: f32,\n	far: f32,\n	lowPass: f32,\n	// drawn cluster ids in the pool's list\n	clusters: u32,\n}\n\n// one resident page; dc and sh ranges are after the colour correction\nstruct Page {\n	origin: vec3f,\n	count: u32,\n	step: vec3f,\n	q1: u32,\n	scaleMin: vec3f,\n	q2: u32,\n	scaleMax: vec3f,\n	q3: u32,\n	dcMin: vec3f,\n	// quadrant k opacity 0-255 at bits 8k\n	factors: u32,\n	dcMax: vec3f,\n	// 0 for the world, else the layer that holds the page\n	layer: u32,\n	shScale: array<vec4f, 3>,\n}\n\n// up to CLUSTER consecutive splats of one page in one pool slot\nstruct Cluster {\n	page: u32,\n	// first pool record\n	slot: u32,\n	// index in the page of its first splat\n	first: u32,\n	count: u32,\n	// extents relative to the page origin\n	boxMin: vec3f,\n	// word in masks.wgsl's buffer of the list of masks that may hide some of its splats\n	maskList: u32,\n	boxMax: vec3f,\n	maskCount: u32,\n}\n\n// a splat on screen; pixels with y up from the bottom-left of the target\nstruct Projected {\n	centre: vec2f,\n	// pack2x16float: 1-sigma major axis xy, 1-sigma minor axis xy\n	axes: vec2u,\n	// pack2x16float: r g, b opacity\n	colour: vec2u,\n}\n\n// what a shade hook may change; position in the floating-origin frame, depth in view metres\nstruct Splat {\n	position: vec3f,\n	depth: f32,\n	colour: vec3f,\n	opacity: f32,\n	scale: vec3f,\n}\n\n// the byte of word at bit, 0 to 1\nfn fraction(word: u32, bit: u32) -> f32 {\n	return f32(extractBits(word, bit, 8u)) / 255.0;\n}\n\n// sigmas out to where a gaussian of opacity falls under 1/255, at most 3; the quad raster draws\nfn reach(opacity: f32) -> f32 {\n	return min(3.0, sqrt(max(2.0 * log(255.0 * opacity), 0.0)));\n}\n", le = "// one thread per listed cluster\n\n@group(0) @binding(0) var<uniform> uniforms: FrameUniforms;\n@group(0) @binding(1) var<storage, read> pages: array<Page>;\n@group(0) @binding(2) var<storage, read> clusters: array<Cluster>;\n@group(0) @binding(3) var<storage, read> list: array<u32>;\n@group(0) @binding(4) var<storage, read_write> work: array<atomic<u32>>;\n\n// false only when the box lies wholly outside one plane\nfn inside(lo: vec3f, hi: vec3f) -> bool {\n	for (var p = 0u; p < 6u; p++) {\n		let plane = uniforms.planes[p];\n		let corner = select(lo, hi, plane.xyz >= vec3f(0.0));\n		if (dot(plane.xyz, corner) + plane.w < 0.0) {\n			return false;\n		}\n	}\n	return true;\n}\n\n@compute @workgroup_size(64)\nfn cull(@builtin(global_invocation_id) id: vec3u) {\n	if (id.x >= uniforms.clusters) {\n		return;\n	}\n	let slot = list[id.x];\n	let cluster = clusters[slot];\n	let page = pages[cluster.page];\n	if (!inside(page.origin + cluster.boxMin, page.origin + cluster.boxMax)) {\n		return;\n	}\n	atomicStore(&work[WORK_LIST + atomicAdd(&work[WORK_VISIBLE], 1u)], slot);\n}\n", ue = 64, de = class {
 	#e;
 	#t;
 	#n;
@@ -574,7 +623,7 @@ var P = "// shared by every engine pass; sizes and word offsets mirror format/sp
 			"storage"
 		]), i = e.createShaderModule({
 			label: "cull",
-			code: `${P}\n${se}`
+			code: `${F}\n${le}`
 		});
 		this.#t = e.createComputePipeline({
 			label: "cull",
@@ -598,10 +647,10 @@ var P = "// shared by every engine pass; sizes and word offsets mirror format/sp
 			label: "cull",
 			timestampWrites: t
 		});
-		n.setBindGroup(0, this.#n), n.setPipeline(this.#t), this.#e.listed && n.dispatchWorkgroups(Math.ceil(this.#e.listed / ce)), n.end();
+		n.setBindGroup(0, this.#n), n.setPipeline(this.#t), this.#e.listed && n.dispatchWorkgroups(Math.ceil(this.#e.listed / ue)), n.end();
 	}
-}, ue = "// prisms that hide splats by centre; masks.ts writes the records, their vertices, then the clusters' lists\n\n// words of a record: min x y, max x y, min z, max z (f32), first vertex word, vertices\nconst MASK_WORDS: u32 = 8u;\n\n@group(1) @binding(0) var<storage, read> masks: array<u32>;\n\nfn maskFloat(k: u32) -> f32 {\n	return bitcast<f32>(masks[k]);\n}\n\n// p, floating-origin frame, inside a mask of the cluster's list: its polygon by the even-odd rule and its z range\nfn masked(cluster: Cluster, p: vec3f) -> bool {\n	for (var k = 0u; k < cluster.maskCount; k++) {\n		let m = masks[cluster.maskList + k] * MASK_WORDS;\n		if (p.x < maskFloat(m) || p.y < maskFloat(m + 1u) || p.x > maskFloat(m + 2u) ||\n			p.y > maskFloat(m + 3u) || p.z < maskFloat(m + 4u) || p.z > maskFloat(m + 5u)) {\n			continue;\n		}\n		let first = masks[m + 6u];\n		let n = masks[m + 7u];\n		var odd = false;\n		var b = vec2f(maskFloat(first + 2u * n - 2u), maskFloat(first + 2u * n - 1u));\n		for (var i = 0u; i < n; i++) {\n			let a = vec2f(maskFloat(first + 2u * i), maskFloat(first + 2u * i + 1u));\n			if ((a.y > p.y) != (b.y > p.y) && p.x < (b.x - a.x) * (p.y - a.y) / (b.y - a.y) + a.x) {\n				odd = !odd;\n			}\n			b = a;\n		}\n		if (odd) {\n			return true;\n		}\n	}\n	return false;\n}\n", de = "// the top of the solid drawn splats over a square of 1 m cells; one workgroup per listed cluster\n\nconst GROUP: u32 = 64u;\n\nstruct Area {\n	// south-west corner, floating-origin frame\n	corner: vec2f,\n	cells: u32,\n	clusters: u32,\n	// least opacity and largest scale in metres of a splat that counts\n	opacity: f32,\n	scale: f32,\n}\n\n@group(0) @binding(0) var<uniform> area: Area;\n@group(0) @binding(1) var<storage, read> pages: array<Page>;\n@group(0) @binding(2) var<storage, read> clusters: array<Cluster>;\n@group(0) @binding(3) var<storage, read> list: array<u32>;\n@group(0) @binding(4) var<storage, read> geometry: array<vec4u>;\n@group(0) @binding(5) var<storage, read_write> tops: array<atomic<u32>>;\n\n// order-preserving bits of z, never 0, which marks an empty cell\nfn ordered(z: f32) -> u32 {\n	let bits = bitcast<u32>(z);\n	return select(bits | 0x80000000u, ~bits, z < 0.0);\n}\n\n@compute @workgroup_size(64)\nfn heights(@builtin(workgroup_id) wid: vec3u, @builtin(local_invocation_index) t: u32) {\n	let index = wid.y * GROUPS_X + wid.x;\n	if (index >= area.clusters) {\n		return;\n	}\n	let cluster = clusters[list[index]];\n	let page = pages[cluster.page];\n	let size = f32(area.cells);\n	let lo = page.origin.xy + cluster.boxMin.xy - area.corner;\n	let hi = page.origin.xy + cluster.boxMax.xy - area.corner;\n	if (any(hi < vec2f(0.0)) || any(lo >= vec2f(size))) {\n		return;\n	}\n	for (var k = t; k < cluster.count; k += GROUP) {\n		let g = geometry[cluster.slot + k];\n		let i = cluster.first + k;\n		let quadrant = u32(i >= page.q1) + u32(i >= page.q2) + u32(i >= page.q3);\n		let opacity = fraction(g.y, 16u) * fraction(page.factors, 8u * quadrant);\n		let level = vec3f(fraction(g.z, 24u), fraction(g.w, 0u), fraction(g.w, 8u));\n		let scale = exp(mix(page.scaleMin, page.scaleMax, level));\n		if (opacity < area.opacity || max(scale.x, max(scale.y, scale.z)) > area.scale) {\n			continue;\n		}\n		let q = vec3f(f32(g.x & 0xffffu), f32(g.x >> 16u), f32(g.y & 0xffffu));\n		let p = page.origin + q * page.step;\n		if (masked(cluster, p)) {\n			continue;\n		}\n		let cell = floor(p.xy - area.corner);\n		if (any(cell < vec2f(0.0)) || any(cell >= vec2f(size))) {\n			continue;\n		}\n		let c = vec2u(cell);\n		atomicMax(&tops[c.y * area.cells + c.x], ordered(p.z));\n	}\n}\n", fe = 32, pe = .5, me = 1;
-function he(e) {
+}, fe = "// prisms that hide splats by centre; masks.ts writes the records, their vertices, then the clusters' lists\n\n// words of a record: min x y, max x y, min z, max z (f32), first vertex word, vertices\nconst MASK_WORDS: u32 = 8u;\n\n@group(1) @binding(0) var<storage, read> masks: array<u32>;\n\nfn maskFloat(k: u32) -> f32 {\n	return bitcast<f32>(masks[k]);\n}\n\n// p, floating-origin frame, inside a mask of the cluster's list: its polygon by the even-odd rule and its z range\nfn masked(cluster: Cluster, p: vec3f) -> bool {\n	for (var k = 0u; k < cluster.maskCount; k++) {\n		let m = masks[cluster.maskList + k] * MASK_WORDS;\n		if (p.x < maskFloat(m) || p.y < maskFloat(m + 1u) || p.x > maskFloat(m + 2u) ||\n			p.y > maskFloat(m + 3u) || p.z < maskFloat(m + 4u) || p.z > maskFloat(m + 5u)) {\n			continue;\n		}\n		let first = masks[m + 6u];\n		let n = masks[m + 7u];\n		var odd = false;\n		var b = vec2f(maskFloat(first + 2u * n - 2u), maskFloat(first + 2u * n - 1u));\n		for (var i = 0u; i < n; i++) {\n			let a = vec2f(maskFloat(first + 2u * i), maskFloat(first + 2u * i + 1u));\n			if ((a.y > p.y) != (b.y > p.y) && p.x < (b.x - a.x) * (p.y - a.y) / (b.y - a.y) + a.x) {\n				odd = !odd;\n			}\n			b = a;\n		}\n		if (odd) {\n			return true;\n		}\n	}\n	return false;\n}\n", pe = "// the top of the solid drawn splats over a square of 1 m cells; one workgroup per listed cluster\n\nconst GROUP: u32 = 64u;\n\nstruct Area {\n	// south-west corner, floating-origin frame\n	corner: vec2f,\n	cells: u32,\n	clusters: u32,\n	// least opacity and largest scale in metres of a splat that counts\n	opacity: f32,\n	scale: f32,\n}\n\n@group(0) @binding(0) var<uniform> area: Area;\n@group(0) @binding(1) var<storage, read> pages: array<Page>;\n@group(0) @binding(2) var<storage, read> clusters: array<Cluster>;\n@group(0) @binding(3) var<storage, read> list: array<u32>;\n@group(0) @binding(4) var<storage, read> geometry: array<vec4u>;\n@group(0) @binding(5) var<storage, read_write> tops: array<atomic<u32>>;\n\n// order-preserving bits of z, never 0, which marks an empty cell\nfn ordered(z: f32) -> u32 {\n	let bits = bitcast<u32>(z);\n	return select(bits | 0x80000000u, ~bits, z < 0.0);\n}\n\n@compute @workgroup_size(64)\nfn heights(@builtin(workgroup_id) wid: vec3u, @builtin(local_invocation_index) t: u32) {\n	let index = wid.y * GROUPS_X + wid.x;\n	if (index >= area.clusters) {\n		return;\n	}\n	let cluster = clusters[list[index]];\n	let page = pages[cluster.page];\n	let size = f32(area.cells);\n	let lo = page.origin.xy + cluster.boxMin.xy - area.corner;\n	let hi = page.origin.xy + cluster.boxMax.xy - area.corner;\n	if (any(hi < vec2f(0.0)) || any(lo >= vec2f(size))) {\n		return;\n	}\n	for (var k = t; k < cluster.count; k += GROUP) {\n		let g = geometry[cluster.slot + k];\n		let i = cluster.first + k;\n		let quadrant = u32(i >= page.q1) + u32(i >= page.q2) + u32(i >= page.q3);\n		let opacity = fraction(g.y, 16u) * fraction(page.factors, 8u * quadrant);\n		let level = vec3f(fraction(g.z, 24u), fraction(g.w, 0u), fraction(g.w, 8u));\n		let scale = exp(mix(page.scaleMin, page.scaleMax, level));\n		if (opacity < area.opacity || max(scale.x, max(scale.y, scale.z)) > area.scale) {\n			continue;\n		}\n		let q = vec3f(f32(g.x & 0xffffu), f32(g.x >> 16u), f32(g.y & 0xffffu));\n		let p = page.origin + q * page.step;\n		if (masked(cluster, p)) {\n			continue;\n		}\n		let cell = floor(p.xy - area.corner);\n		if (any(cell < vec2f(0.0)) || any(cell >= vec2f(size))) {\n			continue;\n		}\n		let c = vec2u(cell);\n		atomicMax(&tops[c.y * area.cells + c.x], ordered(p.z));\n	}\n}\n", me = 32, he = .5, ge = 1;
+function _e(e) {
 	let t = new Uint32Array(e.length);
 	for (let n = 0; n < e.length; n++) {
 		let r = e[n];
@@ -609,7 +658,7 @@ function he(e) {
 	}
 	return new Float32Array(t.buffer);
 }
-var ge = class {
+var ve = class {
 	#e;
 	#t;
 	#n;
@@ -623,7 +672,7 @@ var ge = class {
 			"read-only-storage",
 			"storage"
 		]);
-		let n = `${P}\n${ue}\n${de}`, r = e.createShaderModule({
+		let n = `${F}\n${fe}\n${pe}`, r = e.createShaderModule({
 			label: "heights",
 			code: n
 		});
@@ -639,7 +688,7 @@ var ge = class {
 	encode(e, t, n, r, i) {
 		let a = this.#e, o = this.#t, { listed: s } = o, c = r * r * 4, l = a.createBuffer({
 			label: "heights area",
-			size: fe,
+			size: me,
 			usage: GPUBufferUsage.UNIFORM | GPUBufferUsage.COPY_DST
 		}), u = a.createBuffer({
 			label: "heights",
@@ -649,14 +698,14 @@ var ge = class {
 			label: "heights readback",
 			size: c,
 			usage: GPUBufferUsage.COPY_DST | GPUBufferUsage.MAP_READ
-		}), f = /* @__PURE__ */ new ArrayBuffer(fe);
+		}), f = /* @__PURE__ */ new ArrayBuffer(me);
 		new Float32Array(f).set([
 			t,
 			n,
 			0,
 			0,
-			pe,
-			me
+			he,
+			ge
 		]), new Uint32Array(f).set([r, s], 2), a.queue.writeBuffer(l, 0, f);
 		let p = [
 			l,
@@ -669,11 +718,11 @@ var ge = class {
 			label: "heights",
 			timestampWrites: i
 		});
-		return g.setPipeline(this.#r), g.setBindGroup(0, h), g.setBindGroup(1, o.masks.group), s > 0 && g.dispatchWorkgroups(...m(s)), g.end(), e.copyBufferToBuffer(u, 0, d, 0, c), () => d.mapAsync(GPUMapMode.READ).then(() => he(new Uint32Array(d.getMappedRange())), () => null).finally(() => {
+		return g.setPipeline(this.#r), g.setBindGroup(0, h), g.setBindGroup(1, o.masks.group), s > 0 && g.dispatchWorkgroups(...m(s)), g.end(), e.copyBufferToBuffer(u, 0, d, 0, c), () => d.mapAsync(GPUMapMode.READ).then(() => _e(new Uint32Array(d.getMappedRange())), () => null).finally(() => {
 			l.destroy(), u.destroy(), d.destroy();
 		});
 	}
-}, _e = "@vertex\nfn vs(@builtin(vertex_index) i: u32) -> @builtin(position) vec4f {\n	// one triangle over the whole target\n	let p = vec2f(f32((i << 1u) & 2u), f32(i & 2u));\n	return vec4f(p * 2.0 - 1.0, 0.0, 1.0);\n}\n", ve = class {
+}, ye = "@vertex\nfn vs(@builtin(vertex_index) i: u32) -> @builtin(position) vec4f {\n	// one triangle over the whole target\n	let p = vec2f(f32((i << 1u) & 2u), f32(i & 2u));\n	return vec4f(p * 2.0 - 1.0, 0.0, 1.0);\n}\n", be = class {
 	#e;
 	#t;
 	#n;
@@ -682,7 +731,7 @@ var ge = class {
 	constructor(e, t, n, r) {
 		let i = e.createShaderModule({
 			label: t,
-			code: _e + n
+			code: ye + n
 		});
 		this.#e = e, this.#t = t, this.#n = e.createRenderPipeline({
 			label: t,
@@ -717,7 +766,7 @@ var ge = class {
 		});
 		r.setPipeline(this.#n), r.setBindGroup(0, this.#i), r.draw(3), r.end();
 	}
-}, ye = "// the finished colour target onto the canvas, opaque\n\n@group(0) @binding(0) var scene: texture_2d<f32>;\n\n@fragment\nfn fs(@builtin(position) coord: vec4f) -> @location(0) vec4f {\n	return vec4f(textureLoad(scene, vec2i(coord.xy), 0).rgb, 1.0);\n}\n", be = (e, t) => new ve(e, "present", ye, t), xe = "// workgroups loop over visible clusters, one thread per splat\n\n// ndc reach past the frustum, so splats centred just outside still cover the edge\nconst GUARD: f32 = 1.3;\n\n@group(0) @binding(0) var<uniform> uniforms: FrameUniforms;\n@group(0) @binding(1) var<uniform> plugins: array<vec4f, 16>;\n@group(0) @binding(2) var<storage, read> geometry: array<vec4u>;\n@group(0) @binding(3) var<storage, read> colours: array<u32>;\n@group(0) @binding(4) var<storage, read> pages: array<Page>;\n@group(0) @binding(5) var<storage, read> clusters: array<Cluster>;\n@group(0) @binding(6) var<storage, read_write> work: array<atomic<u32>>;\n@group(0) @binding(7) var<storage, read_write> projected: array<Projected>;\n// keys in [0, capacity), values in [capacity, 2 capacity)\n@group(0) @binding(8) var<storage, read_write> sort: array<u32>;\n\n@group(0) @binding(9) var<uniform> visible: u32;\nvar<workgroup> kept: atomic<u32>;\nvar<workgroup> base: u32;\n\n// false when splat t of the cluster cannot show; else its Projected and sort key\nfn shown(cluster: Cluster, t: u32, dest: ptr<function, Projected>, key: ptr<function, u32>) -> bool {\n	var s: Splat;\n	var g: vec4u;\n	if (!decode(cluster, t, &s, &g)) {\n		return false;\n	}\n	shade(&s);\n	if (s.opacity < 1.0 / 255.0) {\n		return false;\n	}\n\n	// project\n	let viewPos = (uniforms.view * vec4f(s.position, 1.0)).xyz;\n	let depth = -viewPos.z;\n	if (depth < uniforms.near || depth > uniforms.far) {\n		return false;\n	}\n	let clip = uniforms.proj * vec4f(viewPos, 1.0);\n	let ndc = clip.xy / clip.w;\n	if (any(abs(ndc) > vec2f(GUARD))) {\n		return false;\n	}\n\n	let cov = covariance(g, s.scale, viewPos);\n	let a = cov.x;\n	let b = cov.y;\n	let c = cov.z;\n	let mid = 0.5 * (a + c);\n	let rad = length(vec2f(0.5 * (a - c), b));\n	let major = sqrt(mid + rad);\n	if (3.0 * major < 0.5) {\n		return false;\n	}\n	let minor = sqrt(max(mid - rad, 0.0));\n	let angle = 0.5 * atan2(2.0 * b, a - c);\n	let axis = vec2f(cos(angle), sin(angle));\n	// the quad raster draws; a centre inside the guard band can still miss the screen\n	let centre = (ndc * 0.5 + 0.5) * uniforms.viewport;\n	let extent = reach(s.opacity) * (abs(axis) * major + abs(axis.yx) * minor);\n	if (any(centre + extent < vec2f(0.0)) || any(centre - extent > uniforms.viewport)) {\n		return false;\n	}\n\n	*dest = Projected(\n		centre,\n		vec2u(pack2x16float(axis * major), pack2x16float(vec2f(-axis.y, axis.x) * minor)),\n		vec2u(pack2x16float(s.colour.rg), pack2x16float(vec2f(s.colour.b, s.opacity)))\n	);\n	let span = clamp(log(depth / uniforms.near) / log(uniforms.far / uniforms.near), 0.0, 1.0);\n	*key = u32((1.0 - span) * f32((1u << KEY_BITS) - 1u));\n	return true;\n}\n\n@compute @workgroup_size(256)\nfn project(\n	@builtin(workgroup_id) wid: vec3u,\n	@builtin(num_workgroups) groups: vec3u,\n	@builtin(local_invocation_index) t: u32\n) {\n	for (var index = wid.y * groups.x + wid.x; index < visible; index += groups.x * groups.y) {\n		let cluster = clusters[atomicLoad(&work[WORK_LIST + index])];\n		var splat: Projected;\n		var key = 0u;\n		var keep = false;\n		if (t < cluster.count) {\n			keep = shown(cluster, t, &splat, &key);\n		}\n\n		// one global atomic per cluster\n		var rank = 0u;\n		if (keep) {\n			rank = atomicAdd(&kept, 1u);\n		}\n		workgroupBarrier();\n		if (t == 0u) {\n			base = atomicAdd(&work[WORK_PROJECTED], atomicExchange(&kept, 0u));\n		}\n		let i = workgroupUniformLoad(&base) + rank;\n		let capacity = arrayLength(&projected);\n		if (keep && i < capacity) {\n			projected[i] = splat;\n			sort[i] = key;\n			sort[capacity + i] = i;\n		}\n	}\n}\n", Se = "// a pool splat decoded and its screen covariance, shared by project and pick; each declares the\n// uniforms, geometry, colours and pages bindings these read\n\n// i8 over 127, sign-extended by extractBits on i32\nfn code(word: u32, bit: u32) -> f32 {\n	return f32(extractBits(i32(word), bit, 8u)) / 127.0;\n}\n\n// smallest three: w x y z with the largest at the stored index\nfn rotation(g: vec4u) -> vec4f {\n	let v = (vec3f(fraction(g.z, 0u), fraction(g.z, 8u), fraction(g.z, 16u)) - 0.5) * sqrt(2.0);\n	let big = sqrt(max(0.0, 1.0 - dot(v, v)));\n	switch extractBits(g.y, 24u, 8u) {\n		case 0u: {\n			return normalize(vec4f(big, v));\n		}\n		case 1u: {\n			return normalize(vec4f(v.x, big, v.yz));\n		}\n		case 2u: {\n			return normalize(vec4f(v.xy, big, v.z));\n		}\n		default: {\n			return normalize(vec4f(v, big));\n		}\n	}\n}\n\nfn rotate(q: vec4f) -> mat3x3f {\n	let w = q.x;\n	let x = q.y;\n	let y = q.z;\n	let z = q.w;\n	return mat3x3f(\n		1.0 - 2.0 * (y * y + z * z), 2.0 * (x * y + w * z), 2.0 * (x * z - w * y),\n		2.0 * (x * y - w * z), 1.0 - 2.0 * (x * x + z * z), 2.0 * (y * z + w * x),\n		2.0 * (x * z + w * y), 2.0 * (y * z - w * x), 1.0 - 2.0 * (x * x + y * y)\n	);\n}\n\n// splat t of a cluster in the floating-origin frame, its record in g; false when a mask hides it\nfn decode(cluster: Cluster, t: u32, s: ptr<function, Splat>, g: ptr<function, vec4u>) -> bool {\n	let page = pages[cluster.page];\n	let rec = cluster.slot + t;\n	*g = geometry[rec];\n	let w0 = colours[rec * 3u];\n	let w1 = colours[rec * 3u + 1u];\n	let w2 = colours[rec * 3u + 2u];\n	let i = cluster.first + t;\n	let quadrant = u32(i >= page.q1) + u32(i >= page.q2) + u32(i >= page.q3);\n\n	var d: Splat;\n	let q = vec3f(f32((*g).x & 0xffffu), f32((*g).x >> 16u), f32((*g).y & 0xffffu));\n	d.position = page.origin + q * page.step;\n	if (masked(cluster, d.position)) {\n		return false;\n	}\n	d.opacity = fraction((*g).y, 16u) * fraction(page.factors, 8u * quadrant);\n	let level = vec3f(fraction((*g).z, 24u), fraction((*g).w, 0u), fraction((*g).w, 8u));\n	d.scale = exp(mix(page.scaleMin, page.scaleMax, level));\n	let dc = mix(page.dcMin, page.dcMax, vec3f(fraction(w0, 0u), fraction(w0, 8u), fraction(w0, 16u)));\n	// sh[c][m] at 3c + m, gathered per m across the colours\n	let k = page.shScale;\n	let m0 = vec3f(code(w0, 24u), code(w1, 16u), code(w2, 8u)) * vec3f(k[0].x, k[0].w, k[1].z);\n	let m1 = vec3f(code(w1, 0u), code(w1, 24u), code(w2, 16u)) * vec3f(k[0].y, k[1].x, k[1].w);\n	let m2 = vec3f(code(w1, 8u), code(w2, 0u), code(w2, 24u)) * vec3f(k[0].z, k[1].y, k[2].x);\n	let toward = normalize(d.position - uniforms.camera);\n	d.colour = max(0.5 + C0 * dc + C1 * (-toward.y * m0 + toward.z * m1 - toward.x * m2), vec3f(0.0));\n	d.depth = -(uniforms.view * vec4f(d.position, 1.0)).z;\n	*s = d;\n	return true;\n}\n\n// ewa: view-space covariance wm wm^T through the jacobian of the pixel projection, as a b c in px²\nfn covariance(g: vec4u, scale: vec3f, viewPos: vec3f) -> vec3f {\n	let depth = -viewPos.z;\n	let r = rotate(rotation(g));\n	let m = mat3x3f(r[0] * scale.x, r[1] * scale.y, r[2] * scale.z);\n	let w = mat3x3f(uniforms.view[0].xyz, uniforms.view[1].xyz, uniforms.view[2].xyz);\n	let wm = w * m;\n	let focal = uniforms.focal;\n	let j0 = vec3f(focal.x / depth, 0.0, focal.x * viewPos.x / (depth * depth));\n	let j1 = vec3f(0.0, focal.y / depth, focal.y * viewPos.y / (depth * depth));\n	let u = j0 * wm;\n	let v = j1 * wm;\n	return vec3f(dot(u, u) + uniforms.lowPass, dot(u, v), dot(v, v) + uniforms.lowPass);\n}\n", Ce = class {
+}, xe = "// the finished colour target onto the canvas, opaque\n\n@group(0) @binding(0) var scene: texture_2d<f32>;\n\n@fragment\nfn fs(@builtin(position) coord: vec4f) -> @location(0) vec4f {\n	return vec4f(textureLoad(scene, vec2i(coord.xy), 0).rgb, 1.0);\n}\n", Se = (e, t) => new be(e, "present", xe, t), Ce = "// workgroups loop over visible clusters, one thread per splat\n\n@group(0) @binding(0) var<uniform> uniforms: FrameUniforms;\n@group(0) @binding(1) var<uniform> plugins: array<vec4f, 16>;\n@group(0) @binding(2) var<storage, read> geometry: array<vec4u>;\n@group(0) @binding(3) var<storage, read> colours: array<u32>;\n@group(0) @binding(4) var<storage, read> pages: array<Page>;\n@group(0) @binding(5) var<storage, read> clusters: array<Cluster>;\n@group(0) @binding(6) var<storage, read_write> work: array<atomic<u32>>;\n@group(0) @binding(7) var<storage, read_write> projected: array<Projected>;\n// keys in [0, capacity), values in [capacity, 2 capacity)\n@group(0) @binding(8) var<storage, read_write> sort: array<u32>;\n\n@group(0) @binding(9) var<uniform> visible: u32;\nvar<workgroup> kept: atomic<u32>;\nvar<workgroup> base: u32;\n\n// false when splat t of the cluster cannot show; else its Projected and sort key\nfn shown(cluster: Cluster, t: u32, dest: ptr<function, Projected>, key: ptr<function, u32>) -> bool {\n	var s: Splat;\n	var g: vec4u;\n	if (!decode(cluster, t, &s, &g)) {\n		return false;\n	}\n	shade(&s);\n	var d: Drawn;\n	if (!drawn(s, g, &d)) {\n		return false;\n	}\n	*dest = Projected(\n		d.centre,\n		vec2u(pack2x16float(d.axis * d.major), pack2x16float(vec2f(-d.axis.y, d.axis.x) * d.minor)),\n		vec2u(pack2x16float(s.colour.rg), pack2x16float(vec2f(s.colour.b, s.opacity)))\n	);\n	let span = clamp(log(d.depth / uniforms.near) / log(uniforms.far / uniforms.near), 0.0, 1.0);\n	*key = u32((1.0 - span) * f32((1u << KEY_BITS) - 1u));\n	return true;\n}\n\n@compute @workgroup_size(256)\nfn project(\n	@builtin(workgroup_id) wid: vec3u,\n	@builtin(num_workgroups) groups: vec3u,\n	@builtin(local_invocation_index) t: u32\n) {\n	for (var index = wid.y * groups.x + wid.x; index < visible; index += groups.x * groups.y) {\n		let cluster = clusters[atomicLoad(&work[WORK_LIST + index])];\n		var splat: Projected;\n		var key = 0u;\n		var keep = false;\n		if (t < cluster.count) {\n			keep = shown(cluster, t, &splat, &key);\n		}\n\n		// one global atomic per cluster\n		var rank = 0u;\n		if (keep) {\n			rank = atomicAdd(&kept, 1u);\n		}\n		workgroupBarrier();\n		if (t == 0u) {\n			base = atomicAdd(&work[WORK_PROJECTED], atomicExchange(&kept, 0u));\n		}\n		let i = workgroupUniformLoad(&base) + rank;\n		let capacity = arrayLength(&projected);\n		if (keep && i < capacity) {\n			projected[i] = splat;\n			sort[i] = key;\n			sort[capacity + i] = i;\n		}\n	}\n}\n", we = "// a pool splat decoded, its screen covariance and how the frame draws it, shared by project and\n// pick; each declares the uniforms, geometry, colours and pages bindings these read\n\n// ndc reach past the frustum, so splats centred just outside still cover the edge\nconst GUARD: f32 = 1.3;\n\n// i8 over 127, sign-extended by extractBits on i32\nfn code(word: u32, bit: u32) -> f32 {\n	return f32(extractBits(i32(word), bit, 8u)) / 127.0;\n}\n\n// smallest three: w x y z with the largest at the stored index\nfn rotation(g: vec4u) -> vec4f {\n	let v = (vec3f(fraction(g.z, 0u), fraction(g.z, 8u), fraction(g.z, 16u)) - 0.5) * sqrt(2.0);\n	let big = sqrt(max(0.0, 1.0 - dot(v, v)));\n	switch extractBits(g.y, 24u, 8u) {\n		case 0u: {\n			return normalize(vec4f(big, v));\n		}\n		case 1u: {\n			return normalize(vec4f(v.x, big, v.yz));\n		}\n		case 2u: {\n			return normalize(vec4f(v.xy, big, v.z));\n		}\n		default: {\n			return normalize(vec4f(v, big));\n		}\n	}\n}\n\nfn rotate(q: vec4f) -> mat3x3f {\n	let w = q.x;\n	let x = q.y;\n	let y = q.z;\n	let z = q.w;\n	return mat3x3f(\n		1.0 - 2.0 * (y * y + z * z), 2.0 * (x * y + w * z), 2.0 * (x * z - w * y),\n		2.0 * (x * y - w * z), 1.0 - 2.0 * (x * x + z * z), 2.0 * (y * z + w * x),\n		2.0 * (x * z + w * y), 2.0 * (y * z - w * x), 1.0 - 2.0 * (x * x + y * y)\n	);\n}\n\n// splat t of a cluster in the floating-origin frame, its record in g; false when a mask hides it\nfn decode(cluster: Cluster, t: u32, s: ptr<function, Splat>, g: ptr<function, vec4u>) -> bool {\n	let page = pages[cluster.page];\n	let rec = cluster.slot + t;\n	*g = geometry[rec];\n	let w0 = colours[rec * 3u];\n	let w1 = colours[rec * 3u + 1u];\n	let w2 = colours[rec * 3u + 2u];\n	let i = cluster.first + t;\n	let quadrant = u32(i >= page.q1) + u32(i >= page.q2) + u32(i >= page.q3);\n\n	var d: Splat;\n	let q = vec3f(f32((*g).x & 0xffffu), f32((*g).x >> 16u), f32((*g).y & 0xffffu));\n	d.position = page.origin + q * page.step;\n	if (masked(cluster, d.position)) {\n		return false;\n	}\n	d.opacity = fraction((*g).y, 16u) * fraction(page.factors, 8u * quadrant);\n	let level = vec3f(fraction((*g).z, 24u), fraction((*g).w, 0u), fraction((*g).w, 8u));\n	d.scale = exp(mix(page.scaleMin, page.scaleMax, level));\n	let dc = mix(page.dcMin, page.dcMax, vec3f(fraction(w0, 0u), fraction(w0, 8u), fraction(w0, 16u)));\n	// sh[c][m] at 3c + m, gathered per m across the colours\n	let k = page.shScale;\n	let m0 = vec3f(code(w0, 24u), code(w1, 16u), code(w2, 8u)) * vec3f(k[0].x, k[0].w, k[1].z);\n	let m1 = vec3f(code(w1, 0u), code(w1, 24u), code(w2, 16u)) * vec3f(k[0].y, k[1].x, k[1].w);\n	let m2 = vec3f(code(w1, 8u), code(w2, 0u), code(w2, 24u)) * vec3f(k[0].z, k[1].y, k[2].x);\n	let toward = normalize(d.position - uniforms.camera);\n	d.colour = max(0.5 + C0 * dc + C1 * (-toward.y * m0 + toward.z * m1 - toward.x * m2), vec3f(0.0));\n	d.depth = -(uniforms.view * vec4f(d.position, 1.0)).z;\n	*s = d;\n	return true;\n}\n\n// ewa: view-space covariance wm wm^T through the jacobian of the pixel projection, as a b c in px²\nfn covariance(g: vec4u, scale: vec3f, viewPos: vec3f) -> vec3f {\n	let depth = -viewPos.z;\n	let r = rotate(rotation(g));\n	let m = mat3x3f(r[0] * scale.x, r[1] * scale.y, r[2] * scale.z);\n	let w = mat3x3f(uniforms.view[0].xyz, uniforms.view[1].xyz, uniforms.view[2].xyz);\n	let wm = w * m;\n	let focal = uniforms.focal;\n	let j0 = vec3f(focal.x / depth, 0.0, focal.x * viewPos.x / (depth * depth));\n	let j1 = vec3f(0.0, focal.y / depth, focal.y * viewPos.y / (depth * depth));\n	let u = j0 * wm;\n	let v = j1 * wm;\n	return vec3f(dot(u, u) + uniforms.lowPass, dot(u, v), dot(v, v) + uniforms.lowPass);\n}\n\n// a splat as the frame draws it: its view depth, its centre in pixels from the bottom-left, and\n// its quad's axis with the sigmas along it and across\nstruct Drawn {\n	depth: f32,\n	centre: vec2f,\n	axis: vec2f,\n	major: f32,\n	minor: f32,\n}\n\n// false where the frame draws none of the shaded splat: too faint, out of range, centred past the\n// guard band, under half a pixel, or off the screen\nfn drawn(s: Splat, g: vec4u, d: ptr<function, Drawn>) -> bool {\n	if (s.opacity < 1.0 / 255.0) {\n		return false;\n	}\n	let viewPos = (uniforms.view * vec4f(s.position, 1.0)).xyz;\n	let depth = -viewPos.z;\n	if (depth < uniforms.near || depth > uniforms.far) {\n		return false;\n	}\n	let clip = uniforms.proj * vec4f(viewPos, 1.0);\n	let ndc = clip.xy / clip.w;\n	if (any(abs(ndc) > vec2f(GUARD))) {\n		return false;\n	}\n\n	let cov = covariance(g, s.scale, viewPos);\n	let mid = 0.5 * (cov.x + cov.z);\n	let rad = length(vec2f(0.5 * (cov.x - cov.z), cov.y));\n	let major = sqrt(mid + rad);\n	if (3.0 * major < 0.5) {\n		return false;\n	}\n	let minor = sqrt(max(mid - rad, 0.0));\n	let angle = 0.5 * atan2(2.0 * cov.y, cov.x - cov.z);\n	let axis = vec2f(cos(angle), sin(angle));\n	// the quad raster draws; a centre inside the guard band can still miss the screen\n	let centre = (ndc * 0.5 + 0.5) * uniforms.viewport;\n	let extent = reach(s.opacity) * (abs(axis) * major + abs(axis.yx) * minor);\n	if (any(centre + extent < vec2f(0.0)) || any(centre - extent > uniforms.viewport)) {\n		return false;\n	}\n	*d = Drawn(depth, centre, axis, major, minor);\n	return true;\n}\n", Te = class {
 	#e;
 	#t;
 	#n;
@@ -767,11 +816,11 @@ var ge = class {
 		i.setPipeline(this.#n ??= this.#c()), i.setBindGroup(0, this.#i), i.setBindGroup(1, this.#a.masks.group), i.dispatchWorkgroups(r), i.end();
 	}
 	#c() {
-		let e = we([
-			P,
-			ue,
-			Se,
-			xe
+		let e = Ee([
+			F,
+			fe,
+			we,
+			Ce
 		], this.#r), t = this.#e.createShaderModule({
 			label: "project",
 			code: e
@@ -786,7 +835,7 @@ var ge = class {
 		});
 	}
 };
-function we(e, t) {
+function Ee(e, t) {
 	let n = t.map(({ shade: e, slot: t }) => {
 		let n = Array.from({ length: e.uniforms }, (e, n) => `plugins[${t + n}]`);
 		return `\t${e.name}(s, array<vec4f, ${e.uniforms}>(${n.join(", ")}));`;
@@ -801,10 +850,10 @@ function we(e, t) {
 }
 //#endregion
 //#region src/engine/gpu/overlay.wgsl?raw
-var Te = "// host graphics over the frame: capsules in screen space from a to b, a marker where a is b\n\n// share of the view depth an occluding fragment may lie behind the splats, so a line on the ground clears their fringe\nconst SLACK: f32 = 0.02;\n\nstruct Capsule {\n	@location(0) a: vec3f,\n	@location(1) b: vec3f,\n	// pixels\n	@location(2) radius: f32,\n	@location(3) colour: vec4f,\n	@location(4) occlude: u32,\n}\n\nstruct Fragment {\n	@builtin(position) position: vec4f,\n	// target pixels from the top-left, of the ends\n	@location(0) @interpolate(flat) a: vec2f,\n	@location(1) @interpolate(flat) b: vec2f,\n	// view depth of the ends\n	@location(2) @interpolate(flat) depths: vec2f,\n	@location(3) @interpolate(flat) radius: f32,\n	@location(4) @interpolate(flat) colour: vec4f,\n	@location(5) @interpolate(flat) occlude: u32,\n}\n\n@group(0) @binding(0) var<uniform> uniforms: FrameUniforms;\n@group(0) @binding(1) var depth: texture_depth_2d;\n\nfn pixel(view: vec3f) -> vec2f {\n	let clip = uniforms.proj * vec4f(view, 1.0);\n	let ndc = clip.xy / clip.w;\n	return vec2f(ndc.x * 0.5 + 0.5, 0.5 - ndc.y * 0.5) * uniforms.viewport;\n}\n\n@vertex\nfn vs(@builtin(vertex_index) v: u32, c: Capsule) -> Fragment {\n	var a = (uniforms.view * vec4f(c.a, 1.0)).xyz;\n	var b = (uniforms.view * vec4f(c.b, 1.0)).xyz;\n	var out: Fragment;\n	// cut the part behind the near plane; nothing left draws nothing\n	let near = -uniforms.near;\n	if (a.z > near && b.z > near) {\n		out.position = vec4f(2.0, 2.0, 0.0, 1.0);\n		return out;\n	}\n	if (a.z > near) {\n		a = mix(b, a, (near - b.z) / (a.z - b.z));\n	} else if (b.z > near) {\n		b = mix(a, b, (near - a.z) / (b.z - a.z));\n	}\n	let pa = pixel(a);\n	let pb = pixel(b);\n	let span = pb - pa;\n	let along = select(vec2f(1.0, 0.0), normalize(span), dot(span, span) > 1e-6);\n	let across = vec2f(-along.y, along.x);\n	let r = c.radius + 1.0;\n	let corner = select(pa - along * r, pb + along * r, (v & 1u) == 1u) + across * r * select(-1.0, 1.0, v > 1u);\n	out.position = vec4f(corner.x / uniforms.viewport.x * 2.0 - 1.0, 1.0 - corner.y / uniforms.viewport.y * 2.0, 0.0, 1.0);\n	out.a = pa;\n	out.b = pb;\n	out.depths = vec2f(-a.z, -b.z);\n	out.radius = c.radius;\n	out.colour = c.colour;\n	out.occlude = c.occlude;\n	return out;\n}\n\n@fragment\nfn fs(f: Fragment) -> @location(0) vec4f {\n	let p = f.position.xy;\n	let span = f.b - f.a;\n	let t = select(0.0, clamp(dot(p - f.a, span) / dot(span, span), 0.0, 1.0), dot(span, span) > 1e-6);\n	let coverage = clamp(f.radius - distance(p, f.a + span * t) + 0.5, 0.0, 1.0);\n	if (coverage <= 0.0) {\n		discard;\n	}\n	if (f.occlude != 0u) {\n		// screen-linear in 1 / depth along a segment\n		let here = 1.0 / mix(1.0 / f.depths.x, 1.0 / f.depths.y, t);\n		let stored = textureLoad(depth, vec2i(p), 0);\n		let scene = uniforms.near * pow(uniforms.far / uniforms.near, stored);\n		if (stored < 1.0 && here > scene * (1.0 + SLACK)) {\n			discard;\n		}\n	}\n	let a = f.colour.a * coverage;\n	return vec4f(f.colour.rgb * a, a);\n}\n", Ee = 36, De = {
+var De = "// host graphics over the frame: capsules in screen space from a to b, a marker where a is b\n\n// share of the view depth an occluding fragment may lie behind the splats, so a line on the ground clears their fringe\nconst SLACK: f32 = 0.02;\n\nstruct Capsule {\n	@location(0) a: vec3f,\n	@location(1) b: vec3f,\n	// pixels\n	@location(2) radius: f32,\n	@location(3) colour: vec4f,\n	@location(4) occlude: u32,\n}\n\nstruct Fragment {\n	@builtin(position) position: vec4f,\n	// target pixels from the top-left, of the ends\n	@location(0) @interpolate(flat) a: vec2f,\n	@location(1) @interpolate(flat) b: vec2f,\n	// view depth of the ends\n	@location(2) @interpolate(flat) depths: vec2f,\n	@location(3) @interpolate(flat) radius: f32,\n	@location(4) @interpolate(flat) colour: vec4f,\n	@location(5) @interpolate(flat) occlude: u32,\n}\n\n@group(0) @binding(0) var<uniform> uniforms: FrameUniforms;\n@group(0) @binding(1) var depth: texture_depth_2d;\n\nfn pixel(view: vec3f) -> vec2f {\n	let clip = uniforms.proj * vec4f(view, 1.0);\n	let ndc = clip.xy / clip.w;\n	return vec2f(ndc.x * 0.5 + 0.5, 0.5 - ndc.y * 0.5) * uniforms.viewport;\n}\n\n@vertex\nfn vs(@builtin(vertex_index) v: u32, c: Capsule) -> Fragment {\n	var a = (uniforms.view * vec4f(c.a, 1.0)).xyz;\n	var b = (uniforms.view * vec4f(c.b, 1.0)).xyz;\n	var out: Fragment;\n	// cut the part behind the near plane; nothing left draws nothing\n	let near = -uniforms.near;\n	if (a.z > near && b.z > near) {\n		out.position = vec4f(2.0, 2.0, 0.0, 1.0);\n		return out;\n	}\n	if (a.z > near) {\n		a = mix(b, a, (near - b.z) / (a.z - b.z));\n	} else if (b.z > near) {\n		b = mix(a, b, (near - a.z) / (b.z - a.z));\n	}\n	let pa = pixel(a);\n	let pb = pixel(b);\n	let span = pb - pa;\n	let along = select(vec2f(1.0, 0.0), normalize(span), dot(span, span) > 1e-6);\n	let across = vec2f(-along.y, along.x);\n	let r = c.radius + 1.0;\n	let corner = select(pa - along * r, pb + along * r, (v & 1u) == 1u) + across * r * select(-1.0, 1.0, v > 1u);\n	out.position = vec4f(corner.x / uniforms.viewport.x * 2.0 - 1.0, 1.0 - corner.y / uniforms.viewport.y * 2.0, 0.0, 1.0);\n	out.a = pa;\n	out.b = pb;\n	out.depths = vec2f(-a.z, -b.z);\n	out.radius = c.radius;\n	out.colour = c.colour;\n	out.occlude = c.occlude;\n	return out;\n}\n\n@fragment\nfn fs(f: Fragment) -> @location(0) vec4f {\n	let p = f.position.xy;\n	let span = f.b - f.a;\n	let t = select(0.0, clamp(dot(p - f.a, span) / dot(span, span), 0.0, 1.0), dot(span, span) > 1e-6);\n	let coverage = clamp(f.radius - distance(p, f.a + span * t) + 0.5, 0.0, 1.0);\n	if (coverage <= 0.0) {\n		discard;\n	}\n	if (f.occlude != 0u) {\n		// screen-linear in 1 / depth along a segment\n		let here = 1.0 / mix(1.0 / f.depths.x, 1.0 / f.depths.y, t);\n		let stored = textureLoad(depth, vec2i(p), 0);\n		let scene = uniforms.near * pow(uniforms.far / uniforms.near, stored);\n		if (stored < 1.0 && here > scene * (1.0 + SLACK)) {\n			discard;\n		}\n	}\n	let a = f.colour.a * coverage;\n	return vec4f(f.colour.rgb * a, a);\n}\n", Oe = 36, ke = {
 	srcFactor: "one",
 	dstFactor: "one-minus-src-alpha"
-}, Oe = class {
+}, Ae = class {
 	#e;
 	#t;
 	#n;
@@ -816,7 +865,7 @@ var Te = "// host graphics over the frame: capsules in screen space from a to b,
 		this.#e = e, this.#t = n;
 		let r = e.createShaderModule({
 			label: "overlay",
-			code: P + Te
+			code: F + De
 		}), i = [
 			{
 				shaderLocation: 0,
@@ -851,7 +900,7 @@ var Te = "// host graphics over the frame: capsules in screen space from a to b,
 				module: r,
 				entryPoint: "vs",
 				buffers: [{
-					arrayStride: Ee,
+					arrayStride: Oe,
 					stepMode: "instance",
 					attributes: i
 				}]
@@ -862,8 +911,8 @@ var Te = "// host graphics over the frame: capsules in screen space from a to b,
 				targets: [{
 					format: t,
 					blend: {
-						color: De,
-						alpha: De
+						color: ke,
+						alpha: ke
 					}
 				}]
 			},
@@ -875,9 +924,9 @@ var Te = "// host graphics over the frame: capsules in screen space from a to b,
 	}
 	set(e, t) {
 		if (this.#i = e.length, !e.length) return;
-		let n = /* @__PURE__ */ new ArrayBuffer(e.length * Ee), r = new Float32Array(n), i = new Uint32Array(n), a = new Uint8Array(n);
+		let n = /* @__PURE__ */ new ArrayBuffer(e.length * Oe), r = new Float32Array(n), i = new Uint32Array(n), a = new Uint8Array(n);
 		e.forEach(({ a: e, b: n, radius: o, colour: s, occlude: c }, l) => {
-			let u = l * Ee / 4;
+			let u = l * Oe / 4;
 			for (let i = 0; i < 3; i++) r[u + i] = e[i] - t[i], r[u + 3 + i] = n[i] - t[i];
 			r[u + 6] = o, s.forEach((e, t) => a[(u + 7) * 4 + t] = Math.round(Math.min(1, Math.max(0, e)) * 255)), i[u + 8] = +!!c;
 		}), (!this.#r || this.#r.size < n.byteLength) && (this.#r?.destroy(), this.#r = this.#e.createBuffer({
@@ -912,7 +961,7 @@ var Te = "// host graphics over the frame: capsules in screen space from a to b,
 	destroy() {
 		this.#r?.destroy();
 	}
-}, ke = [
+}, je = [
 	[
 		0,
 		-1,
@@ -944,15 +993,15 @@ var Te = "// host graphics over the frame: capsules in screen space from a to b,
 		-1
 	]
 ];
-function Ae(e, t, n) {
-	return ke.forEach(([r, i, a], o) => {
+function Me(e, t, n) {
+	return je.forEach(([r, i, a], o) => {
 		let s = n?.[o] ?? i;
 		for (let n = 0; n < 4; n++) e[o * 4 + n] = a * (t[n * 4 + r] - s * t[n * 4 + 3]);
 		let c = Math.hypot(e[o * 4], e[o * 4 + 1], e[o * 4 + 2]) || 1;
 		for (let t = 0; t < 4; t++) e[o * 4 + t] /= c;
 	}), e;
 }
-function je(e, t, n) {
+function Ne(e, t, n) {
 	for (let r = 0; r < 24; r += 4) {
 		let i = e[r] >= 0 ? n[0] : t[0], a = e[r + 1] >= 0 ? n[1] : t[1], o = e[r + 2] >= 0 ? n[2] : t[2];
 		if (e[r] * i + e[r + 1] * a + e[r + 2] * o + e[r + 3] < 0) return !1;
@@ -961,13 +1010,7 @@ function je(e, t, n) {
 }
 //#endregion
 //#region src/engine/gpu/pick.wgsl?raw
-var Me = "// the nearest solid splat under one pixel, over the last frame's visible clusters\n\n// workgroups of the dispatch, pick.ts's GROUPS; each loops over the visible clusters\nconst PICK_GROUPS: u32 = 256u;\n// least alpha at the pixel of a splat that counts as the surface\nconst SOLID: f32 = 0.5;\n\nstruct Probe {\n	// target pixel, y up from the bottom-left\n	pixel: vec2f,\n	// the pixel's frustum sides; inside when dot(plane.xyz, p) + plane.w >= 0\n	planes: array<vec4f, 4>,\n}\n\n@group(0) @binding(0) var<uniform> uniforms: FrameUniforms;\n@group(0) @binding(1) var<uniform> plugins: array<vec4f, 16>;\n@group(0) @binding(2) var<storage, read> geometry: array<vec4u>;\n@group(0) @binding(3) var<storage, read> colours: array<u32>;\n@group(0) @binding(4) var<storage, read> pages: array<Page>;\n@group(0) @binding(5) var<storage, read> clusters: array<Cluster>;\n@group(0) @binding(6) var<storage, read> work: array<u32>;\n@group(0) @binding(7) var<uniform> probe: Probe;\n// view depth bits of the nearest hit, then its layer, then its normal\n@group(0) @binding(8) var<storage, read_write> hit: array<atomic<u32>>;\n\n// false only when the box lies wholly outside one side of the pixel\nfn under(lo: vec3f, hi: vec3f) -> bool {\n	for (var p = 0u; p < 4u; p++) {\n		let plane = probe.planes[p];\n		let corner = select(lo, hi, plane.xyz >= vec3f(0.0));\n		if (dot(plane.xyz, corner) + plane.w < 0.0) {\n			return false;\n		}\n	}\n	return true;\n}\n\n// splat t of the cluster draws the pixel solid; its view depth and decoded splat then\nfn covers(cluster: Cluster, t: u32, s: ptr<function, Splat>, g: ptr<function, vec4u>) -> bool {\n	if (!decode(cluster, t, s, g)) {\n		return false;\n	}\n	shade(s);\n	let viewPos = (uniforms.view * vec4f((*s).position, 1.0)).xyz;\n	let depth = -viewPos.z;\n	if ((*s).opacity < SOLID || depth < uniforms.near || depth > uniforms.far) {\n		return false;\n	}\n	let clip = uniforms.proj * vec4f(viewPos, 1.0);\n	let centre = (clip.xy / clip.w * 0.5 + 0.5) * uniforms.viewport;\n	let cov = covariance(*g, (*s).scale, viewPos);\n	let d = probe.pixel - centre;\n	let power = (cov.z * d.x * d.x - 2.0 * cov.y * d.x * d.y + cov.x * d.y * d.y) / (cov.x * cov.z - cov.y * cov.y);\n	(*s).depth = depth;\n	return (*s).opacity * exp(-0.5 * power) >= SOLID;\n}\n\n// the cluster of visible index under the pixel, or none\nfn candidate(index: u32, cluster: ptr<function, Cluster>) -> bool {\n	*cluster = clusters[work[WORK_LIST + index]];\n	let page = pages[(*cluster).page];\n	return under(page.origin + (*cluster).boxMin, page.origin + (*cluster).boxMax);\n}\n\n@compute @workgroup_size(256)\nfn nearest(@builtin(workgroup_id) wid: vec3u, @builtin(local_invocation_index) t: u32) {\n	for (var index = wid.x; index < work[WORK_VISIBLE]; index += PICK_GROUPS) {\n		var cluster: Cluster;\n		var s: Splat;\n		var g: vec4u;\n		if (candidate(index, &cluster) && t < cluster.count && covers(cluster, t, &s, &g)) {\n			atomicMin(&hit[0], bitcast<u32>(s.depth));\n		}\n	}\n}\n\n// the splat at the nearest depth writes its layer and its thinnest axis, toward the camera\n@compute @workgroup_size(256)\nfn surface(@builtin(workgroup_id) wid: vec3u, @builtin(local_invocation_index) t: u32) {\n	let nearest = atomicLoad(&hit[0]);\n	for (var index = wid.x; index < work[WORK_VISIBLE]; index += PICK_GROUPS) {\n		var cluster: Cluster;\n		var s: Splat;\n		var g: vec4u;\n		if (candidate(index, &cluster) && t < cluster.count && covers(cluster, t, &s, &g) &&\n			bitcast<u32>(s.depth) == nearest) {\n			let r = rotate(rotation(g));\n			let k = select(select(2u, 1u, s.scale.y <= s.scale.z), 0u,\n				s.scale.x <= s.scale.y && s.scale.x <= s.scale.z);\n			let normal = r[k] * sign(dot(r[k], uniforms.camera - s.position) + 1e-20);\n			atomicStore(&hit[1], pages[cluster.page].layer);\n			atomicStore(&hit[2], bitcast<u32>(normal.x));\n			atomicStore(&hit[3], bitcast<u32>(normal.y));\n			atomicStore(&hit[4], bitcast<u32>(normal.z));\n		}\n	}\n}\n", Ne = 256, Pe = 80, Fe = 4294967295, Ie = new Uint32Array([
-	Fe,
-	0,
-	0,
-	0,
-	0
-]), Le = class {
+var Pe = "// every splat the last frame drew over one pixel, with its alpha there, over the frame's visible\n// clusters; the host blends them front to back as the frame did\n\n// workgroups of the dispatch, pick.ts's GROUPS; each loops over the visible clusters\nconst PICK_GROUPS: u32 = 256u;\n\nstruct Probe {\n	// target pixel, y up from the bottom-left\n	pixel: vec2f,\n	// the pixel's frustum sides; inside when dot(plane.xyz, p) + plane.w >= 0\n	planes: array<vec4f, 4>,\n}\n\n// a splat over the pixel: its face toward the camera, its view depth, which orders the blend, the\n// view depth where the pixel's ray meets its plane, its alpha at the pixel and its layer\nstruct Entry {\n	normal: vec3f,\n	depth: f32,\n	meets: f32,\n	alpha: f32,\n	layer: u32,\n}\n\n// entries past the buffer's length are counted and not kept\nstruct Hits {\n	count: atomic<u32>,\n	entries: array<Entry>,\n}\n\n@group(0) @binding(0) var<uniform> uniforms: FrameUniforms;\n@group(0) @binding(1) var<uniform> plugins: array<vec4f, 16>;\n@group(0) @binding(2) var<storage, read> geometry: array<vec4u>;\n@group(0) @binding(3) var<storage, read> colours: array<u32>;\n@group(0) @binding(4) var<storage, read> pages: array<Page>;\n@group(0) @binding(5) var<storage, read> clusters: array<Cluster>;\n@group(0) @binding(6) var<storage, read> work: array<u32>;\n@group(0) @binding(7) var<uniform> probe: Probe;\n@group(0) @binding(8) var<storage, read_write> hits: Hits;\n\n// false only when the box lies wholly outside one side of the pixel\nfn under(lo: vec3f, hi: vec3f) -> bool {\n	for (var p = 0u; p < 4u; p++) {\n		let plane = probe.planes[p];\n		let corner = select(lo, hi, plane.xyz >= vec3f(0.0));\n		if (dot(plane.xyz, corner) + plane.w < 0.0) {\n			return false;\n		}\n	}\n	return true;\n}\n\n// the cluster of visible index under the pixel, or none\nfn candidate(index: u32, cluster: ptr<function, Cluster>) -> bool {\n	*cluster = clusters[work[WORK_LIST + index]];\n	let page = pages[(*cluster).page];\n	return under(page.origin + (*cluster).boxMin, page.origin + (*cluster).boxMax);\n}\n\n// the alpha a drawn splat gives the pixel as raster.wgsl blends it: its quad stops at reach\n// sigmas along each axis, and a fragment under 1/255 is discarded\nfn coverage(s: Splat, d: Drawn) -> f32 {\n	let off = probe.pixel - d.centre;\n	let uv = vec2f(dot(off, d.axis) / d.major, dot(off, vec2f(-d.axis.y, d.axis.x)) / d.minor);\n	if (any(abs(uv) > vec2f(reach(s.opacity)))) {\n		return 0.0;\n	}\n	let a = s.opacity * exp(-0.5 * dot(uv, uv));\n	return select(0.0, a, a >= 1.0 / 255.0);\n}\n\n// the splat's thinnest axis, toward the camera\nfn face(s: Splat, g: vec4u) -> vec3f {\n	let r = rotate(rotation(g));\n	let k = select(select(2u, 1u, s.scale.y <= s.scale.z), 0u,\n		s.scale.x <= s.scale.y && s.scale.x <= s.scale.z);\n	return r[k] * sign(dot(r[k], uniforms.camera - s.position) + 1e-20);\n}\n\n// the view depth where the pixel's ray meets the plane of the splat's face, kept within its\n// reach of the centre: a splat seen edge on meets the ray far off\nfn meets(s: Splat, d: Drawn, normal: vec3f) -> f32 {\n	let ndc = probe.pixel / uniforms.viewport * 2.0 - 1.0;\n	let ray = vec3f(ndc.x / uniforms.proj[0].x, ndc.y / uniforms.proj[1].y, -1.0);\n	let n = (uniforms.view * vec4f(normal, 0.0)).xyz;\n	let centre = (uniforms.view * vec4f(s.position, 1.0)).xyz;\n	let across = dot(n, ray);\n	if (abs(across) < 1e-6) {\n		return d.depth;\n	}\n	let spread = reach(s.opacity) * max(s.scale.x, max(s.scale.y, s.scale.z));\n	return clamp(dot(n, centre) / across, d.depth - spread, d.depth + spread);\n}\n\n@compute @workgroup_size(256)\nfn gather(@builtin(workgroup_id) wid: vec3u, @builtin(local_invocation_index) t: u32) {\n	for (var index = wid.x; index < work[WORK_VISIBLE]; index += PICK_GROUPS) {\n		var cluster: Cluster;\n		var s: Splat;\n		var g: vec4u;\n		if (!candidate(index, &cluster) || t >= cluster.count || !decode(cluster, t, &s, &g)) {\n			continue;\n		}\n		shade(&s);\n		var d: Drawn;\n		if (!drawn(s, g, &d)) {\n			continue;\n		}\n		let a = coverage(s, d);\n		if (a == 0.0) {\n			continue;\n		}\n		let normal = face(s, g);\n		let slot = atomicAdd(&hits.count, 1u);\n		if (slot < arrayLength(&hits.entries)) {\n			hits.entries[slot] = Entry(normal, d.depth, meets(s, d, normal), a, pages[cluster.page].layer);\n		}\n	}\n}\n", Fe = 256, Ie = 80, I = 16, Le = 32, Re = 4096, ze = new Uint32Array([0]), Be = class {
 	#e;
 	#t;
 	#n;
@@ -976,10 +1019,12 @@ var Me = "// the nearest solid splat under one pixel, over the last frame's visi
 	#a = [];
 	#o = /* @__PURE__ */ new Float32Array(16);
 	#s = /* @__PURE__ */ new Float32Array(24);
-	#c = new Float32Array(Pe / 4);
+	#c = new Float32Array(Ie / 4);
 	#l;
 	#u;
-	#d;
+	#d = 0;
+	#f;
+	#p;
 	constructor(e, t, n) {
 		this.#e = e, this.#t = t, this.#n = x(e, "pick", GPUShaderStage.COMPUTE, [
 			"uniform",
@@ -993,12 +1038,8 @@ var Me = "// the nearest solid splat under one pixel, over the last frame's visi
 			"storage"
 		]), this.#r = e.createPipelineLayout({ bindGroupLayouts: [this.#n, t.masks.layout] }), this.#l = e.createBuffer({
 			label: "pick probe",
-			size: Pe,
+			size: Ie,
 			usage: GPUBufferUsage.UNIFORM | GPUBufferUsage.COPY_DST
-		}), this.#u = e.createBuffer({
-			label: "pick",
-			size: 20,
-			usage: GPUBufferUsage.STORAGE | GPUBufferUsage.COPY_SRC | GPUBufferUsage.COPY_DST
 		});
 		let { uniforms: r, plugins: i, work: a } = n, o = [
 			r,
@@ -1008,77 +1049,90 @@ var Me = "// the nearest solid splat under one pixel, over the last frame's visi
 			t.pages,
 			t.clusters
 		];
-		this.#d = S(e, "pick", this.#n, [
+		this.#u = [
 			...o,
 			a,
-			this.#l,
-			this.#u
-		]);
+			this.#l
+		], this.#m(Re);
 	}
 	hooks(e) {
 		this.#a = e, this.#i = void 0;
 	}
 	run(e, t, n) {
-		let r = this.#e, i = this.#t, a = r.createBuffer({
+		let r = this.#e, i = this.#t, a = this.#d, o = I + a * Le, s = r.createBuffer({
 			label: "pick readback",
-			size: 20,
+			size: o,
 			usage: GPUBufferUsage.COPY_DST | GPUBufferUsage.MAP_READ
-		}), o = this.#c, s = n.height - t;
-		o.set([e, s], 0), o.set(this.#f(e, s, n), 4), r.queue.writeBuffer(this.#l, 0, o), r.queue.writeBuffer(this.#u, 0, Ie);
-		let c = this.#i ??= this.#p(), l = r.createCommandEncoder({ label: "pick" }), u = l.beginComputePass({ label: "pick" });
-		return u.setBindGroup(0, this.#d), u.setBindGroup(1, i.masks.group), u.setPipeline(c.nearest), u.dispatchWorkgroups(Ne), u.setPipeline(c.surface), u.dispatchWorkgroups(Ne), u.end(), l.copyBufferToBuffer(this.#u, 0, a, 0, 20), r.queue.submit([l.finish()]), a.mapAsync(GPUMapMode.READ).then(() => {
-			let e = new Uint32Array(a.getMappedRange());
-			if (e[0] === Fe) return null;
-			let t = new Float32Array(e.buffer), n = [
-				t[2],
-				t[3],
-				t[4]
-			];
-			return {
-				depth: t[0],
-				layer: e[1],
-				normal: n
-			};
-		}, () => null).finally(() => a.destroy());
+		}), c = this.#c, l = n.height - t;
+		c.set([e, l], 0), c.set(this.#h(e, l, n), 4), r.queue.writeBuffer(this.#l, 0, c), r.queue.writeBuffer(this.#f, 0, ze);
+		let u = r.createCommandEncoder({ label: "pick" }), d = u.beginComputePass({ label: "pick" });
+		return d.setBindGroup(0, this.#p), d.setBindGroup(1, i.masks.group), d.setPipeline(this.#i ??= this.#g()), d.dispatchWorkgroups(Fe), d.end(), u.copyBufferToBuffer(this.#f, 0, s, 0, o), r.queue.submit([u.finish()]), s.mapAsync(GPUMapMode.READ).then(() => {
+			let e = s.getMappedRange(), t = new Uint32Array(e, 0, 1)[0];
+			return t > a ? (this.#m(2 ** Math.ceil(Math.log2(t))), null) : Ve(new Float32Array(e, I), new Uint32Array(e, I), t);
+		}, () => null).finally(() => s.destroy());
 	}
 	destroy() {
-		this.#l.destroy(), this.#u.destroy();
+		this.#l.destroy(), this.#f.destroy();
+	}
+	#m(e) {
+		let t = this.#f;
+		this.#d = e, this.#f = this.#e.createBuffer({
+			label: "pick",
+			size: I + e * Le,
+			usage: GPUBufferUsage.STORAGE | GPUBufferUsage.COPY_SRC | GPUBufferUsage.COPY_DST
+		}), this.#p = S(this.#e, "pick", this.#n, [...this.#u, this.#f]), t?.destroy();
 	}
-	#f(e, t, n) {
-		let r = (e, t) => 2 * e / t - 1, i = N(this.#o, n.proj, n.view), a = [
+	#h(e, t, n) {
+		let r = (e, t) => 2 * e / t - 1, i = P(this.#o, n.proj, n.view), a = [
 			r(e - .5, n.width),
 			r(e + .5, n.width),
 			r(t - .5, n.height),
 			r(t + .5, n.height)
 		];
-		return Ae(this.#s, i, a), this.#s.subarray(0, 16);
-	}
-	#p() {
-		let e = we([
-			P,
-			ue,
-			Se,
-			Me
+		return Me(this.#s, i, a), this.#s.subarray(0, 16);
+	}
+	#g() {
+		let e = Ee([
+			F,
+			fe,
+			we,
+			Pe
 		], this.#a), t = this.#e.createShaderModule({
 			label: "pick",
 			code: e
-		}), n = (e) => this.#e.createComputePipeline({
-			label: `pick ${e}`,
+		});
+		return this.#e.createComputePipeline({
+			label: "pick",
 			layout: this.#r,
 			compute: {
 				module: t,
-				entryPoint: e
+				entryPoint: "gather"
 			}
 		});
-		return {
-			nearest: n("nearest"),
-			surface: n("surface")
+	}
+};
+function Ve(e, t, n) {
+	let r = Le / 4, i = Array.from({ length: n }, (e, t) => t).sort((t, n) => e[t * r + 3] - e[n * r + 3]), a = 1;
+	for (let n of i) {
+		let i = n * r;
+		if (a *= 1 - e[i + 5], a <= .5) return {
+			depth: e[i + 4],
+			layer: t[i + 6],
+			normal: [
+				e[i],
+				e[i + 1],
+				e[i + 2]
+			]
 		};
 	}
-}, Re = "// sorted splats as screen quads, premultiplied over what lies behind them\n\n// word offsets of the sorted keys and values in the sort buffer\nstruct Sorted {\n	keys: u32,\n	values: u32,\n}\n\nstruct Corner {\n	@builtin(position) position: vec4f,\n	// offset from the centre in sigmas\n	@location(0) uv: vec2f,\n	@location(1) colour: vec4f,\n}\n\n@group(0) @binding(0) var<uniform> frame: FrameUniforms;\n@group(0) @binding(1) var<storage, read> projected: array<Projected>;\n@group(0) @binding(2) var<storage, read> sort: array<u32>;\n@group(0) @binding(3) var<uniform> sorted: Sorted;\n\nfn corner(v: u32, i: u32) -> Corner {\n	let p = projected[sort[sorted.values + i]];\n	let major = unpack2x16float(p.axes.x);\n	let minor = unpack2x16float(p.axes.y);\n	let colour = vec4f(unpack2x16float(p.colour.x), unpack2x16float(p.colour.y));\n	let r = reach(colour.a);\n	let uv = vec2f(f32(v & 1u), f32(v >> 1u)) * 2.0 - 1.0;\n	let pixel = p.centre + (major * uv.x + minor * uv.y) * r;\n	return Corner(vec4f(pixel / frame.viewport * 2.0 - 1.0, 0.0, 1.0), uv * r, colour);\n}\n\nfn alpha(uv: vec2f, opacity: f32) -> f32 {\n	return opacity * exp(-0.5 * dot(uv, uv));\n}\n\n@vertex\nfn vsColour(@builtin(vertex_index) v: u32, @builtin(instance_index) i: u32) -> Corner {\n	return corner(v, i);\n}\n\n@vertex\nfn vsDepth(@builtin(vertex_index) v: u32, @builtin(instance_index) i: u32) -> Corner {\n	var c = corner(v, i);\n	// inverse of the key: the span from near to far in log depth\n	c.position.z = 1.0 - f32(sort[sorted.keys + i]) / f32((1u << KEY_BITS) - 1u);\n	return c;\n}\n\n@fragment\nfn fs(c: Corner) -> @location(0) vec4f {\n	let a = alpha(c.uv, c.colour.a);\n	if (a < 1.0 / 255.0) {\n		discard;\n	}\n	return vec4f(c.colour.rgb * a, a);\n}\n", ze = "rgb10a2unorm", Be = "depth16unorm", Ve = {
+	return null;
+}
+//#endregion
+//#region src/engine/gpu/raster.wgsl?raw
+var He = "// sorted splats as screen quads, premultiplied over what lies behind them\n\n// word offsets of the sorted keys and values in the sort buffer\nstruct Sorted {\n	keys: u32,\n	values: u32,\n}\n\nstruct Corner {\n	@builtin(position) position: vec4f,\n	// offset from the centre in sigmas\n	@location(0) uv: vec2f,\n	@location(1) colour: vec4f,\n}\n\n@group(0) @binding(0) var<uniform> frame: FrameUniforms;\n@group(0) @binding(1) var<storage, read> projected: array<Projected>;\n@group(0) @binding(2) var<storage, read> sort: array<u32>;\n@group(0) @binding(3) var<uniform> sorted: Sorted;\n\nfn corner(v: u32, i: u32) -> Corner {\n	let p = projected[sort[sorted.values + i]];\n	let major = unpack2x16float(p.axes.x);\n	let minor = unpack2x16float(p.axes.y);\n	let colour = vec4f(unpack2x16float(p.colour.x), unpack2x16float(p.colour.y));\n	let r = reach(colour.a);\n	let uv = vec2f(f32(v & 1u), f32(v >> 1u)) * 2.0 - 1.0;\n	let pixel = p.centre + (major * uv.x + minor * uv.y) * r;\n	return Corner(vec4f(pixel / frame.viewport * 2.0 - 1.0, 0.0, 1.0), uv * r, colour);\n}\n\nfn alpha(uv: vec2f, opacity: f32) -> f32 {\n	return opacity * exp(-0.5 * dot(uv, uv));\n}\n\n@vertex\nfn vsColour(@builtin(vertex_index) v: u32, @builtin(instance_index) i: u32) -> Corner {\n	return corner(v, i);\n}\n\n@vertex\nfn vsDepth(@builtin(vertex_index) v: u32, @builtin(instance_index) i: u32) -> Corner {\n	var c = corner(v, i);\n	// inverse of the key: the span from near to far in log depth\n	c.position.z = 1.0 - f32(sort[sorted.keys + i]) / f32((1u << KEY_BITS) - 1u);\n	return c;\n}\n\n@fragment\nfn fs(c: Corner) -> @location(0) vec4f {\n	let a = alpha(c.uv, c.colour.a);\n	if (a < 1.0 / 255.0) {\n		discard;\n	}\n	return vec4f(c.colour.rgb * a, a);\n}\n", Ue = "rgb10a2unorm", We = "depth16unorm", Ge = {
 	srcFactor: "one",
 	dstFactor: "one-minus-src-alpha"
-}, He = class {
+}, Ke = class {
 	#e;
 	#t;
 	#n;
@@ -1111,7 +1165,7 @@ var Me = "// the nearest solid splat under one pixel, over the last frame's visi
 		]);
 		let a = e.createShaderModule({
 			label: "raster",
-			code: P + Re
+			code: F + He
 		}), o = e.createPipelineLayout({ bindGroupLayouts: [i] }), s = (t, n) => e.createRenderPipeline({
 			label: `raster ${t}`,
 			layout: o,
@@ -1123,10 +1177,10 @@ var Me = "// the nearest solid splat under one pixel, over the last frame's visi
 				module: a,
 				entryPoint: "fs",
 				targets: [{
-					format: ze,
+					format: Ue,
 					blend: {
-						color: Ve,
-						alpha: Ve
+						color: Ge,
+						alpha: Ge
 					}
 				}]
 			},
@@ -1134,7 +1188,7 @@ var Me = "// the nearest solid splat under one pixel, over the last frame's visi
 			depthStencil: n
 		});
 		this.#n = s("Colour"), this.#r = s("Depth", {
-			format: Be,
+			format: We,
 			depthWriteEnabled: !0,
 			depthCompare: "always"
 		});
@@ -1161,7 +1215,7 @@ var Me = "// the nearest solid splat under one pixel, over the last frame's visi
 	destroy() {
 		this.#t.destroy();
 	}
-}, Ue = "// lsd radix sort, 8 bits a pass: block digit counts, a two-level scan, a stable scatter; no spin-waits\n\nconst THREADS: u32 = 128u;\nconst ITEMS: u32 = 8u;\nconst BLOCK: u32 = 1024u;\n// blocks per scan chunk\nconst CHUNK: u32 = 64u;\nconst DIGITS: u32 = 256u;\n\nstruct SortParams {\n	shift: u32,\n	// word offsets of the keys read and written; their values follow capacity words later\n	src: u32,\n	dst: u32,\n	capacity: u32,\n	// word offsets in the work buffer\n	projected: u32,\n	drawArgs: u32,\n}\n\nstruct SortState {\n	count: u32,\n	blocks: u32,\n	chunks: u32,\n}\n\n@group(0) @binding(0) var<uniform> params: SortParams;\n@group(0) @binding(1) var<storage, read_write> data: array<u32>;\n// block-major: count, then exclusive global offset, of digit d in block b at b DIGITS + d\n@group(0) @binding(2) var<storage, read_write> hist: array<u32>;\n// chunk-major sums of hist, then their exclusive global offsets\n@group(0) @binding(3) var<storage, read_write> sums: array<u32>;\n@group(0) @binding(4) var<storage, read> state: SortState;\n@group(0) @binding(5) var<storage, read_write> stateOut: SortState;\n@group(0) @binding(6) var<storage, read_write> work: array<u32>;\n\nvar<workgroup> bins: array<atomic<u32>, DIGITS>;\nvar<workgroup> totals: array<u32, DIGITS>;\nvar<workgroup> bitValues: atomic<u32>;\nvar<workgroup> activeBits: u32;\nvar<workgroup> sk: array<u32, BLOCK>;\nvar<workgroup> sv: array<u32, BLOCK>;\n// three 10-bit counts; the fourth follows from the number of items\nvar<workgroup> counts: array<u32, THREADS * 2u>;\nvar<workgroup> tail: u32;\nvar<workgroup> starts: array<u32, DIGITS>;\nvar<workgroup> offsets: array<u32, DIGITS>;\n\nfn unpack(packed: u32, count: u32) -> vec4u {\n	let a = packed & 1023u;\n	let b = (packed >> 10u) & 1023u;\n	let c = (packed >> 20u) & 1023u;\n	return vec4u(a, b, c, count - a - b - c);\n}\n\nfn digit(key: u32) -> u32 {\n	return (key >> params.shift) & 0xffu;\n}\n\n@compute @workgroup_size(1)\nfn prepare() {\n	let count = min(work[params.projected], params.capacity);\n	let blocks = (count + BLOCK - 1u) / BLOCK;\n	work[params.drawArgs] = 4u;\n	work[params.drawArgs + 1u] = count;\n	work[params.drawArgs + 2u] = 0u;\n	work[params.drawArgs + 3u] = 0u;\n	stateOut = SortState(count, blocks, (blocks + CHUNK - 1u) / CHUNK);\n}\n\n@compute @workgroup_size(THREADS)\nfn histogram(\n	@builtin(workgroup_id) wid: vec3u,\n	@builtin(num_workgroups) groups: vec3u,\n	@builtin(local_invocation_index) t: u32\n) {\n	for (var block = wid.y * groups.x + wid.x; block < state.blocks; block += groups.x * groups.y) {\n		let head = block * BLOCK;\n		for (var k = 0u; k < ITEMS; k++) {\n			let i = head + k * THREADS + t;\n			if (i < state.count) {\n				atomicAdd(&bins[digit(data[params.src + i])], 1u);\n			}\n		}\n		workgroupBarrier();\n		for (var d = t; d < DIGITS; d += THREADS) {\n			hist[block * DIGITS + d] = atomicExchange(&bins[d], 0u);\n		}\n		workgroupBarrier();\n	}\n}\n\n@compute @workgroup_size(DIGITS)\nfn reduce(@builtin(workgroup_id) wid: vec3u, @builtin(local_invocation_index) t: u32) {\n	let end = min((wid.x + 1u) * CHUNK, state.blocks);\n	var sum = 0u;\n	for (var b = wid.x * CHUNK; b < end; b++) {\n		sum += hist[b * DIGITS + t];\n	}\n	sums[wid.x * DIGITS + t] = sum;\n}\n\n@compute @workgroup_size(DIGITS)\nfn top(@builtin(local_invocation_index) t: u32) {\n	var run = 0u;\n	for (var c = 0u; c < state.chunks; c++) {\n		let x = sums[c * DIGITS + t];\n		sums[c * DIGITS + t] = run;\n		run += x;\n	}\n	totals[t] = run;\n	// a bit varies only when both zero and one occur in nonempty digits\n	if (run > 0u) {\n		atomicOr(&bitValues, t | ((255u ^ t) << 8u));\n	}\n	workgroupBarrier();\n	if (t == 0u) {\n		let values = atomicLoad(&bitValues);\n		sums[arrayLength(&sums) - 1u] = values & (values >> 8u);\n	}\n	for (var o = 1u; o < DIGITS; o *= 2u) {\n		var x = 0u;\n		if (t >= o) {\n			x = totals[t - o];\n		}\n		workgroupBarrier();\n		totals[t] += x;\n		workgroupBarrier();\n	}\n	let base = totals[t] - run;\n	for (var c = 0u; c < state.chunks; c++) {\n		sums[c * DIGITS + t] += base;\n	}\n}\n\n@compute @workgroup_size(DIGITS)\nfn down(@builtin(workgroup_id) wid: vec3u, @builtin(local_invocation_index) t: u32) {\n	let end = min((wid.x + 1u) * CHUNK, state.blocks);\n	var run = sums[wid.x * DIGITS + t];\n	for (var b = wid.x * CHUNK; b < end; b++) {\n		let x = hist[b * DIGITS + t];\n		hist[b * DIGITS + t] = run;\n		run += x;\n	}\n}\n\n@compute @workgroup_size(THREADS)\nfn scatter(\n	@builtin(workgroup_id) wid: vec3u,\n	@builtin(num_workgroups) groups: vec3u,\n	@builtin(local_invocation_index) t: u32\n) {\n	let first = wid.y * groups.x + wid.x;\n	if (first >= state.blocks) {\n		return;\n	}\n	if (t == 0u) {\n		activeBits = sums[arrayLength(&sums) - 1u];\n	}\n	let bits = workgroupUniformLoad(&activeBits);\n	for (var block = first; block < state.blocks; block += groups.x * groups.y) {\n		let head = block * BLOCK;\n		let valid = min(BLOCK, state.count - head);\n		// padding has digit 255 at every shift, so it sorts behind the valid keys and is never written\n		for (var k = 0u; k < ITEMS; k++) {\n			let i = k * THREADS + t;\n			var key = 0xffffffffu;\n			var value = 0u;\n			if (i < valid) {\n				key = data[params.src + head + i];\n				value = data[params.src + params.capacity + head + i];\n			}\n			sk[i] = key;\n			sv[i] = value;\n		}\n		for (var d = t; d < DIGITS; d += THREADS) {\n			offsets[d] = hist[block * DIGITS + d];\n		}\n		workgroupBarrier();\n\n		// stable local sort by the digit, two bits a split; thread t owns positions t ITEMS + k\n		for (var bit = 0u; bit < 8u; bit += 2u) {\n			if ((bits & (3u << bit)) == 0u) {\n				continue;\n			}\n			var keys: array<u32, ITEMS>;\n			var values: array<u32, ITEMS>;\n			var before: array<u32, ITEMS>;\n			var mine = vec4u(0u);\n			for (var k = 0u; k < ITEMS; k++) {\n				keys[k] = sk[t * ITEMS + k];\n				values[k] = sv[t * ITEMS + k];\n				let b = (keys[k] >> (params.shift + bit)) & 3u;\n				before[k] = mine[b];\n				mine[b] += 1u;\n			}\n			counts[t] = mine.x | (mine.y << 10u) | (mine.z << 20u);\n			if (t == THREADS - 1u) {\n				tail = counts[t];\n			}\n			workgroupBarrier();\n			// separate reads and writes need only one barrier per scan step\n			var source = 0u;\n			for (var o = 1u; o < THREADS; o *= 2u) {\n				var x = counts[source + t];\n				if (t >= o) {\n					x += counts[source + t - o];\n				}\n				let dest = source ^ THREADS;\n				counts[dest + t] = x;\n				workgroupBarrier();\n				source = dest;\n			}\n			// prefixes stop at 1016 items, so no count carries into its neighbour\n			let total = unpack(counts[source + THREADS - 2u], BLOCK - ITEMS) + unpack(tail, ITEMS);\n			var prior = vec4u(0u);\n			if (t > 0u) {\n				prior = unpack(counts[source + t - 1u], t * ITEMS);\n			}\n			let base = vec4u(0u, total.x, total.x + total.y, total.x + total.y + total.z);\n			for (var k = 0u; k < ITEMS; k++) {\n				let b = (keys[k] >> (params.shift + bit)) & 3u;\n				let p = base[b] + prior[b] + before[k];\n				sk[p] = keys[k];\n				sv[p] = values[k];\n			}\n			workgroupBarrier();\n		}\n\n		for (var k = 0u; k < ITEMS; k++) {\n			let i = t * ITEMS + k;\n			let d = digit(sk[i]);\n			if (i == 0u || digit(sk[i - 1u]) != d) {\n				starts[d] = i;\n			}\n		}\n		workgroupBarrier();\n		for (var k = 0u; k < ITEMS; k++) {\n			let i = k * THREADS + t;\n			if (i < valid) {\n				let d = digit(sk[i]);\n				let slot = offsets[d] + i - starts[d];\n				data[params.dst + slot] = sk[i];\n				data[params.dst + params.capacity + slot] = sv[i];\n			}\n		}\n		workgroupBarrier();\n	}\n}\n", We = 1024, Ge = 64, Ke = 256, F = 3, I = 256, qe = 32, Je = class {
+}, qe = "// lsd radix sort, 8 bits a pass: block digit counts, a two-level scan, a stable scatter; no spin-waits\n\nconst THREADS: u32 = 128u;\nconst ITEMS: u32 = 8u;\nconst BLOCK: u32 = 1024u;\n// blocks per scan chunk\nconst CHUNK: u32 = 64u;\nconst DIGITS: u32 = 256u;\n\nstruct SortParams {\n	shift: u32,\n	// word offsets of the keys read and written; their values follow capacity words later\n	src: u32,\n	dst: u32,\n	capacity: u32,\n	// word offsets in the work buffer\n	projected: u32,\n	drawArgs: u32,\n}\n\nstruct SortState {\n	count: u32,\n	blocks: u32,\n	chunks: u32,\n}\n\n@group(0) @binding(0) var<uniform> params: SortParams;\n@group(0) @binding(1) var<storage, read_write> data: array<u32>;\n// block-major: count, then exclusive global offset, of digit d in block b at b DIGITS + d\n@group(0) @binding(2) var<storage, read_write> hist: array<u32>;\n// chunk-major sums of hist, then their exclusive global offsets\n@group(0) @binding(3) var<storage, read_write> sums: array<u32>;\n@group(0) @binding(4) var<storage, read> state: SortState;\n@group(0) @binding(5) var<storage, read_write> stateOut: SortState;\n@group(0) @binding(6) var<storage, read_write> work: array<u32>;\n\nvar<workgroup> bins: array<atomic<u32>, DIGITS>;\nvar<workgroup> totals: array<u32, DIGITS>;\nvar<workgroup> bitValues: atomic<u32>;\nvar<workgroup> activeBits: u32;\nvar<workgroup> sk: array<u32, BLOCK>;\nvar<workgroup> sv: array<u32, BLOCK>;\n// three 10-bit counts; the fourth follows from the number of items\nvar<workgroup> counts: array<u32, THREADS * 2u>;\nvar<workgroup> tail: u32;\nvar<workgroup> starts: array<u32, DIGITS>;\nvar<workgroup> offsets: array<u32, DIGITS>;\n\nfn unpack(packed: u32, count: u32) -> vec4u {\n	let a = packed & 1023u;\n	let b = (packed >> 10u) & 1023u;\n	let c = (packed >> 20u) & 1023u;\n	return vec4u(a, b, c, count - a - b - c);\n}\n\nfn digit(key: u32) -> u32 {\n	return (key >> params.shift) & 0xffu;\n}\n\n@compute @workgroup_size(1)\nfn prepare() {\n	let count = min(work[params.projected], params.capacity);\n	let blocks = (count + BLOCK - 1u) / BLOCK;\n	work[params.drawArgs] = 4u;\n	work[params.drawArgs + 1u] = count;\n	work[params.drawArgs + 2u] = 0u;\n	work[params.drawArgs + 3u] = 0u;\n	stateOut = SortState(count, blocks, (blocks + CHUNK - 1u) / CHUNK);\n}\n\n@compute @workgroup_size(THREADS)\nfn histogram(\n	@builtin(workgroup_id) wid: vec3u,\n	@builtin(num_workgroups) groups: vec3u,\n	@builtin(local_invocation_index) t: u32\n) {\n	for (var block = wid.y * groups.x + wid.x; block < state.blocks; block += groups.x * groups.y) {\n		let head = block * BLOCK;\n		for (var k = 0u; k < ITEMS; k++) {\n			let i = head + k * THREADS + t;\n			if (i < state.count) {\n				atomicAdd(&bins[digit(data[params.src + i])], 1u);\n			}\n		}\n		workgroupBarrier();\n		for (var d = t; d < DIGITS; d += THREADS) {\n			hist[block * DIGITS + d] = atomicExchange(&bins[d], 0u);\n		}\n		workgroupBarrier();\n	}\n}\n\n@compute @workgroup_size(DIGITS)\nfn reduce(@builtin(workgroup_id) wid: vec3u, @builtin(local_invocation_index) t: u32) {\n	let end = min((wid.x + 1u) * CHUNK, state.blocks);\n	var sum = 0u;\n	for (var b = wid.x * CHUNK; b < end; b++) {\n		sum += hist[b * DIGITS + t];\n	}\n	sums[wid.x * DIGITS + t] = sum;\n}\n\n@compute @workgroup_size(DIGITS)\nfn top(@builtin(local_invocation_index) t: u32) {\n	var run = 0u;\n	for (var c = 0u; c < state.chunks; c++) {\n		let x = sums[c * DIGITS + t];\n		sums[c * DIGITS + t] = run;\n		run += x;\n	}\n	totals[t] = run;\n	// a bit varies only when both zero and one occur in nonempty digits\n	if (run > 0u) {\n		atomicOr(&bitValues, t | ((255u ^ t) << 8u));\n	}\n	workgroupBarrier();\n	if (t == 0u) {\n		let values = atomicLoad(&bitValues);\n		sums[arrayLength(&sums) - 1u] = values & (values >> 8u);\n	}\n	for (var o = 1u; o < DIGITS; o *= 2u) {\n		var x = 0u;\n		if (t >= o) {\n			x = totals[t - o];\n		}\n		workgroupBarrier();\n		totals[t] += x;\n		workgroupBarrier();\n	}\n	let base = totals[t] - run;\n	for (var c = 0u; c < state.chunks; c++) {\n		sums[c * DIGITS + t] += base;\n	}\n}\n\n@compute @workgroup_size(DIGITS)\nfn down(@builtin(workgroup_id) wid: vec3u, @builtin(local_invocation_index) t: u32) {\n	let end = min((wid.x + 1u) * CHUNK, state.blocks);\n	var run = sums[wid.x * DIGITS + t];\n	for (var b = wid.x * CHUNK; b < end; b++) {\n		let x = hist[b * DIGITS + t];\n		hist[b * DIGITS + t] = run;\n		run += x;\n	}\n}\n\n@compute @workgroup_size(THREADS)\nfn scatter(\n	@builtin(workgroup_id) wid: vec3u,\n	@builtin(num_workgroups) groups: vec3u,\n	@builtin(local_invocation_index) t: u32\n) {\n	let first = wid.y * groups.x + wid.x;\n	if (first >= state.blocks) {\n		return;\n	}\n	if (t == 0u) {\n		activeBits = sums[arrayLength(&sums) - 1u];\n	}\n	let bits = workgroupUniformLoad(&activeBits);\n	for (var block = first; block < state.blocks; block += groups.x * groups.y) {\n		let head = block * BLOCK;\n		let valid = min(BLOCK, state.count - head);\n		// padding has digit 255 at every shift, so it sorts behind the valid keys and is never written\n		for (var k = 0u; k < ITEMS; k++) {\n			let i = k * THREADS + t;\n			var key = 0xffffffffu;\n			var value = 0u;\n			if (i < valid) {\n				key = data[params.src + head + i];\n				value = data[params.src + params.capacity + head + i];\n			}\n			sk[i] = key;\n			sv[i] = value;\n		}\n		for (var d = t; d < DIGITS; d += THREADS) {\n			offsets[d] = hist[block * DIGITS + d];\n		}\n		workgroupBarrier();\n\n		// stable local sort by the digit, two bits a split; thread t owns positions t ITEMS + k\n		for (var bit = 0u; bit < 8u; bit += 2u) {\n			if ((bits & (3u << bit)) == 0u) {\n				continue;\n			}\n			var keys: array<u32, ITEMS>;\n			var values: array<u32, ITEMS>;\n			var before: array<u32, ITEMS>;\n			var mine = vec4u(0u);\n			for (var k = 0u; k < ITEMS; k++) {\n				keys[k] = sk[t * ITEMS + k];\n				values[k] = sv[t * ITEMS + k];\n				let b = (keys[k] >> (params.shift + bit)) & 3u;\n				before[k] = mine[b];\n				mine[b] += 1u;\n			}\n			counts[t] = mine.x | (mine.y << 10u) | (mine.z << 20u);\n			if (t == THREADS - 1u) {\n				tail = counts[t];\n			}\n			workgroupBarrier();\n			// separate reads and writes need only one barrier per scan step\n			var source = 0u;\n			for (var o = 1u; o < THREADS; o *= 2u) {\n				var x = counts[source + t];\n				if (t >= o) {\n					x += counts[source + t - o];\n				}\n				let dest = source ^ THREADS;\n				counts[dest + t] = x;\n				workgroupBarrier();\n				source = dest;\n			}\n			// prefixes stop at 1016 items, so no count carries into its neighbour\n			let total = unpack(counts[source + THREADS - 2u], BLOCK - ITEMS) + unpack(tail, ITEMS);\n			var prior = vec4u(0u);\n			if (t > 0u) {\n				prior = unpack(counts[source + t - 1u], t * ITEMS);\n			}\n			let base = vec4u(0u, total.x, total.x + total.y, total.x + total.y + total.z);\n			for (var k = 0u; k < ITEMS; k++) {\n				let b = (keys[k] >> (params.shift + bit)) & 3u;\n				let p = base[b] + prior[b] + before[k];\n				sk[p] = keys[k];\n				sv[p] = values[k];\n			}\n			workgroupBarrier();\n		}\n\n		for (var k = 0u; k < ITEMS; k++) {\n			let i = t * ITEMS + k;\n			let d = digit(sk[i]);\n			if (i == 0u || digit(sk[i - 1u]) != d) {\n				starts[d] = i;\n			}\n		}\n		workgroupBarrier();\n		for (var k = 0u; k < ITEMS; k++) {\n			let i = k * THREADS + t;\n			if (i < valid) {\n				let d = digit(sk[i]);\n				let slot = offsets[d] + i - starts[d];\n				data[params.dst + slot] = sk[i];\n				data[params.dst + params.capacity + slot] = sv[i];\n			}\n		}\n		workgroupBarrier();\n	}\n}\n", Je = 1024, Ye = 64, Xe = 256, L = 3, R = 256, Ze = 32, Qe = class {
 	keys;
 	values;
 	bytes;
@@ -1174,21 +1228,21 @@ var Me = "// the nearest solid splat under one pixel, over the last frame's visi
 	constructor(e, t) {
 		let { capacity: n } = t;
 		this.keys = n * 8, this.values = n * 12;
-		let r = Math.max(1, Math.ceil(n / We));
+		let r = Math.max(1, Math.ceil(n / Je));
 		this.#a = r;
-		let i = Math.ceil(r / Ge), a = (t, n, r) => e.createBuffer({
+		let i = Math.ceil(r / Ye), a = (t, n, r) => e.createBuffer({
 			label: t,
 			size: n,
 			usage: r
-		}), o = GPUBufferUsage.STORAGE, s = a("sort params", F * I, GPUBufferUsage.UNIFORM | GPUBufferUsage.COPY_DST), c = a("sort histograms", r * Ke * 4, o), l = a("sort chunk sums", (i * Ke + 1) * 4, o), u = a("sort state", 12, o);
+		}), o = GPUBufferUsage.STORAGE, s = a("sort params", L * R, GPUBufferUsage.UNIFORM | GPUBufferUsage.COPY_DST), c = a("sort histograms", r * Xe * 4, o), l = a("sort chunk sums", (i * Xe + 1) * 4, o), u = a("sort state", 12, o);
 		this.#e = [
 			s,
 			c,
 			l,
 			u
 		], this.bytes = this.#e.reduce((e, t) => e + t.size, 0);
-		let d = new Uint32Array(F * I / 4);
-		for (let e = 0; e < F; e++) {
+		let d = new Uint32Array(L * R / 4);
+		for (let e = 0; e < L; e++) {
 			let [t, r] = e % 2 ? [2 * n, 0] : [0, 2 * n];
 			d.set([
 				8 * e,
@@ -1197,7 +1251,7 @@ var Me = "// the nearest solid splat under one pixel, over the last frame's visi
 				n,
 				f.projected,
 				f.drawArgs
-			], e * I / 4);
+			], e * R / 4);
 		}
 		e.queue.writeBuffer(s, 0, d);
 		let p = (e, t) => ({
@@ -1219,7 +1273,7 @@ var Me = "// the nearest solid splat under one pixel, over the last frame's visi
 			]
 		}), g = e.createShaderModule({
 			label: "sort",
-			code: P + Ue
+			code: F + qe
 		}), _ = (t, n) => e.createComputePipeline({
 			label: `sort ${t}`,
 			layout: e.createPipelineLayout({ bindGroupLayouts: [n] }),
@@ -1237,8 +1291,8 @@ var Me = "// the nearest solid splat under one pixel, over the last frame's visi
 		].map((e) => _(e, m));
 		let v = (e) => ({
 			buffer: s,
-			offset: e * I,
-			size: qe
+			offset: e * R,
+			size: Ze
 		});
 		this.#r = e.createBindGroup({
 			label: "sort prepare",
@@ -1257,7 +1311,7 @@ var Me = "// the nearest solid splat under one pixel, over the last frame's visi
 					resource: { buffer: t.work }
 				}
 			]
-		}), this.#i = Array.from({ length: F }, (n, r) => e.createBindGroup({
+		}), this.#i = Array.from({ length: L }, (n, r) => e.createBindGroup({
 			label: `sort pass ${r}`,
 			layout: m,
 			entries: [
@@ -1285,7 +1339,7 @@ var Me = "// the nearest solid splat under one pixel, over the last frame's visi
 		}));
 	}
 	encode(e, t, n, r) {
-		let [i, a, o, s, c] = this.#n, l = Math.max(1, Math.min(this.#a, Math.ceil(t / We))), u = Math.max(l / 16, (n || t) / We), d = m(Math.min(Math.ceil(l / 4), Math.ceil(u))), f = Math.ceil(l / Ge), p = e.beginComputePass({
+		let [i, a, o, s, c] = this.#n, l = Math.max(1, Math.min(this.#a, Math.ceil(t / Je))), u = Math.max(l / 16, (n || t) / Je), d = m(Math.min(Math.ceil(l / 4), Math.ceil(u))), f = Math.ceil(l / Ye), p = e.beginComputePass({
 			label: "sort",
 			timestampWrites: r
 		});
@@ -1296,7 +1350,7 @@ var Me = "// the nearest solid splat under one pixel, over the last frame's visi
 	destroy() {
 		for (let e of this.#e) e.destroy();
 	}
-}, Ye = class {
+}, $e = class {
 	ms = {};
 	#e;
 	#t;
@@ -1347,14 +1401,14 @@ var Me = "// the nearest solid splat under one pixel, over the last frame's visi
 	destroy() {
 		this.#t?.destroy(), this.#n?.destroy(), this.#r?.destroy();
 	}
-}, Xe = [
+}, et = [
 	"cull",
 	"project",
 	"sort",
 	"raster",
 	"heights",
 	"post"
-], L = {
+], z = {
 	view: 0,
 	proj: 16,
 	viewProj: 32,
@@ -1367,7 +1421,7 @@ var Me = "// the nearest solid splat under one pixel, over the last frame's visi
 	far: 81,
 	lowPass: 82,
 	clusters: 83
-}, Ze = class {
+}, tt = class {
 	#e;
 	#t;
 	#n;
@@ -1398,7 +1452,7 @@ var Me = "// the nearest solid splat under one pixel, over the last frame's visi
 	#D = 0;
 	constructor(e, t, n, r) {
 		let { device: i } = e;
-		this.#e = i, this.#t = t, this.#n = e.format, this.#r = n, this.#i = b(i, r, n.slots), this.#a = new le(i, n, this.#i), this.#o = new Ce(i, n, this.#i), this.#s = new Je(i, this.#i), this.#c = new He(i, this.#i, this.#s), this.#u = new ge(i, n), this.#d = new Le(i, n, this.#i), this.#f = new Oe(i, e.format, this.#i.uniforms), this.#p = new Ye(i, e.timestamps, Xe), this.#w = i.createBuffer({
+		this.#e = i, this.#t = t, this.#n = e.format, this.#r = n, this.#i = b(i, r, n.slots), this.#a = new de(i, n, this.#i), this.#o = new Te(i, n, this.#i), this.#s = new Qe(i, this.#i), this.#c = new Ke(i, this.#i, this.#s), this.#u = new ve(i, n), this.#d = new Be(i, n, this.#i), this.#f = new Ae(i, e.format, this.#i.uniforms), this.#p = new $e(i, e.timestamps, et), this.#w = i.createBuffer({
 			label: "counts readback",
 			size: (f.projected + 1) * 4,
 			usage: GPUBufferUsage.COPY_DST | GPUBufferUsage.MAP_READ
@@ -1435,7 +1489,7 @@ var Me = "// the nearest solid splat under one pixel, over the last frame's visi
 		this.#f.set(e, t);
 	}
 	render(e, t, n, r) {
-		let i = this.#e, a = this.#p, o = this.#y, s = this.#j(this.#A("colour", ze)), c = this.#f.count > 0, l = c || o.some(({ post: e }) => e.depth), u = this.#M("depth", Be, l), d = u ? this.#j(u) : null, p = [this.#M("ping", this.#n, o.length > 1), this.#M("pong", this.#n, o.length > 2)];
+		let i = this.#e, a = this.#p, o = this.#y, s = this.#j(this.#A("colour", Ue)), c = this.#f.count > 0, l = c || o.some(({ post: e }) => e.depth), u = this.#M("depth", We, l), d = u ? this.#j(u) : null, p = [this.#M("ping", this.#n, o.length > 1), this.#M("pong", this.#n, o.length > 2)];
 		this.#k(e, t);
 		let m = i.createCommandEncoder({ label: "frame" });
 		m.clearBuffer(this.#i.work, 0, f.list * 4), this.#a.encode(m, a.writes("cull")), this.#o.encode(m, this.#D, a.writes("project")), this.#s.encode(m, this.#r.listed * 256, this.#E, a.writes("sort")), this.#c.encode(m, s, d, n, a.writes("raster"));
@@ -1451,7 +1505,7 @@ var Me = "// the nearest solid splat under one pixel, over the last frame's visi
 			} }).end();
 		}
 		let _ = this.#t.getCurrentTexture().createView();
-		if (!o.length) this.#l ??= be(i, this.#n), this.#l.encode(m, [s], _);
+		if (!o.length) this.#l ??= Se(i, this.#n), this.#l.encode(m, [s], _);
 		else {
 			let t = s;
 			o.forEach(({ post: n, pass: r }, i) => {
@@ -1493,7 +1547,7 @@ var Me = "// the nearest solid splat under one pixel, over the last frame's visi
 	}
 	#k(e, t) {
 		let n = this.#m, [r, i] = [this.#S, this.#C];
-		n.set(e.view, L.view), n.set(e.proj, L.proj), n.set(N(this.#g, e.proj, e.view), L.viewProj), n.set(t, L.planes), n.set(e.camera.subarray(0, 3), L.camera), n[L.time] = e.time, n.set([r, i], L.viewport), n.set([e.proj[0] * r / 2, e.proj[5] * i / 2], L.focal), n[L.near] = e.near, n[L.far] = e.far, n[L.lowPass] = h, this.#h[L.clusters] = this.#r.listed, this.#e.queue.writeBuffer(this.#i.uniforms, 0, n);
+		n.set(e.view, z.view), n.set(e.proj, z.proj), n.set(P(this.#g, e.proj, e.view), z.viewProj), n.set(t, z.planes), n.set(e.camera.subarray(0, 3), z.camera), n[z.time] = e.time, n.set([r, i], z.viewport), n.set([e.proj[0] * r / 2, e.proj[5] * i / 2], z.focal), n[z.near] = e.near, n[z.far] = e.far, n[z.lowPass] = h, this.#h[z.clusters] = this.#r.listed, this.#e.queue.writeBuffer(this.#i.uniforms, 0, n);
 		for (let { shade: t, slot: n } of this.#v) t.update(e, this.#_.subarray(n * 4, (n + t.uniforms) * 4));
 		this.#v.length && this.#e.queue.writeBuffer(this.#i.plugins, 0, this.#_);
 	}
@@ -1529,7 +1583,7 @@ var Me = "// the nearest solid splat under one pixel, over the last frame's visi
 };
 //#endregion
 //#region src/engine/layer.ts
-async function Qe(e, n) {
+async function nt(e, n) {
 	let i = await r(async (t, n) => e.subarray(t, n), e.length);
 	if (i.length === 0) throw Error("the pack holds no pages");
 	let a = Math.min(...i.map((e) => e.g));
@@ -1541,7 +1595,7 @@ async function Qe(e, n) {
 		};
 	}));
 }
-function $e(e) {
+function rt(e) {
 	let t = (t) => [Math.min(...e.map((e) => e[t])), Math.max(...e.map((e) => e[t + 3]))];
 	return {
 		e: t(0),
@@ -1549,19 +1603,19 @@ function $e(e) {
 		h: t(2)
 	};
 }
-var et = class {
+var it = class {
 	#e = /* @__PURE__ */ new Map();
 	update(e, t, n, r) {
-		let i = this.#e, a = tt(e, t), o = -1;
-		for (let [e, r] of i) t(r.page.id) ? (o = Math.max(o, r.level), !r.held && (r.start !== null && n - r.start >= 250 && (r.start = null), a.has(e) || (r.frozen = R(r, n), r.start = null, r.out = null, r.covered = !1, r.held = !0))) : i.delete(e);
+		let i = this.#e, a = at(e, t), o = -1;
+		for (let [e, r] of i) t(r.page.id) ? (o = Math.max(o, r.level), !r.held && (r.start !== null && n - r.start >= 250 && (r.start = null), a.has(e) || (r.frozen = B(r, n), r.start = null, r.out = null, r.covered = !1, r.held = !0))) : i.delete(e);
 		let s = /* @__PURE__ */ new Set();
 		for (let [e, t] of a) {
 			let r = i.get(e);
 			if (!r) {
-				let r = nt(t, e % 4, n);
+				let r = ot(t, e % 4, n);
 				o = Math.max(o, r.level), i.set(e, r), s.add(r);
 			} else if (r.held) {
-				let e = R(r, n);
+				let e = B(r, n);
 				r.held = !1, r.out = null, e < 255 && (r.start = n - e / 255 * 250, s.add(r));
 			}
 		}
@@ -1569,14 +1623,14 @@ var et = class {
 		for (let e of i.values()) if (e.held) {
 			c.set(e.cell, e);
 			for (let t = e.level, n = e.col, r = e.row; t <= o; t++, n >>= 1, r >>= 1) {
-				let i = rt(t, n, r), a = l.get(i);
+				let i = st(t, n, r), a = l.get(i);
 				a ? a.push(e) : l.set(i, [e]);
 			}
 		}
 		let u = (e) => {
 			let t = [...l.get(e.cell) ?? []];
 			for (let n = e.level + 1, r = e.col >> 1, i = e.row >> 1; n <= o; n++, r >>= 1, i >>= 1) {
-				let e = c.get(rt(n, r, i));
+				let e = c.get(st(n, r, i));
 				e && t.push(e);
 			}
 			return t;
@@ -1600,13 +1654,13 @@ var et = class {
 		}
 		let v = /* @__PURE__ */ new Map(), y = !1;
 		for (let [e, t] of i) {
-			if (t.held && f.has(t)) t.out !== null && (t.frozen = R(t, n)), t.out = null, t.covered = !0;
-			else if (t.held && (t.covered && t.out === null && (t.out = n), !t.covered || R(t, n) === 0)) {
+			if (t.held && f.has(t)) t.out !== null && (t.frozen = B(t, n)), t.out = null, t.covered = !0;
+			else if (t.held && (t.covered && t.out === null && (t.out = n), !t.covered || B(t, n) === 0)) {
 				i.delete(e);
 				continue;
 			}
 			(t.held || t.start !== null) && (y = !0);
-			let r = R(t, n);
+			let r = B(t, n);
 			if (!r) continue;
 			let a = v.get(t.page.id);
 			a ? a.factors = (a.factors | r << 8 * t.q) >>> 0 : v.set(t.page.id, {
@@ -1620,7 +1674,7 @@ var et = class {
 		};
 	}
 };
-function tt(e, t) {
+function at(e, t) {
 	let n = new Set(e), r = /* @__PURE__ */ new Set(), i = [];
 	for (let t of e) for (let e = t; e && !r.has(e); e = e.parent) r.add(e), e.parent || i.push(e);
 	let a = /* @__PURE__ */ new Map(), o = (e) => {
@@ -1632,7 +1686,7 @@ function tt(e, t) {
 	for (let e of i) t(e.id) && o(e);
 	return a;
 }
-function nt(e, t, n) {
+function ot(e, t, n) {
 	let r = c * 2 ** e.g, i = e.g - 1, a = 2 * (Math.round(e.unit.e / r) + e.row.i) + (t & 1), o = 2 * (Math.round(e.unit.n / r) + e.row.j) + (t >> 1);
 	return {
 		page: e,
@@ -1640,8 +1694,8 @@ function nt(e, t, n) {
 		level: i,
 		col: a,
 		row: o,
-		cell: rt(i, a, o),
-		splats: it(e.row, t),
+		cell: st(i, a, o),
+		splats: ct(e.row, t),
 		start: n,
 		frozen: 0,
 		out: null,
@@ -1649,56 +1703,56 @@ function nt(e, t, n) {
 		held: !1
 	};
 }
-var rt = (e, t, n) => ((e + 1) * 2 ** 21 + t) * 2 ** 21 + n;
-function it({ count: e, quadrants: t }, n) {
+var st = (e, t, n) => ((e + 1) * 2 ** 21 + t) * 2 ** 21 + n;
+function ct({ count: e, quadrants: t }, n) {
 	return (n < 3 ? t[n] : e) - (n > 0 ? t[n - 1] : 0);
 }
-function R(e, t) {
+function B(e, t) {
 	return e.held ? e.out === null ? e.frozen : Math.max(0, Math.round(e.frozen * (1 - (t - e.out) / 250))) : e.start === null ? 255 : Math.min(255, Math.round((t - e.start) / 250 * 255));
 }
 //#endregion
 //#region src/engine/plan/footprint.ts
-var at = [
+var lt = [
 	0,
 	0,
 	0
 ];
-function ot(e, t, n, r) {
+function ut(e, t, n, r) {
 	let i = (e * e + e * t + t * t + n * n + n * r + r * r) / 3;
 	return 1 + 15 * Math.max(0, 1 - i) ** 2;
 }
-function st(e, t, n, r, i, a, o, s = 1, c = {
+function dt(e, t, n, r, i, a, o, s = 1, c = {
 	shown: !1,
 	pixels: 0,
 	weight: 1
-}, l = at) {
+}, l = lt) {
 	let u = (e[0] + e[3]) / 2 - l[0], d = (e[1] + e[4]) / 2 - l[1], f = (e[2] + e[5]) / 2 - l[2], p = (e[3] - e[0]) / 2, m = (e[4] - e[1]) / 2, h = (e[5] - e[2]) / 2, g = t[0] * u + t[4] * d + t[8] * f + t[12], _ = t[1] * u + t[5] * d + t[9] * f + t[13], v = -(t[2] * u + t[6] * d + t[10] * f + t[14]), y = Math.abs(t[0]) * p + Math.abs(t[4]) * m + Math.abs(t[8]) * h, b = Math.abs(t[1]) * p + Math.abs(t[5]) * m + Math.abs(t[9]) * h, x = Math.abs(t[2]) * p + Math.abs(t[6]) * m + Math.abs(t[10]) * h;
 	if (c.pixels = 0, c.weight = 1, c.shown = !1, v + x < a || v - x > o) return c;
 	let S = Math.max(a, v - x), C = Math.max(a, v + x), w = i * n / r;
 	if (Math.abs(g) - y > s * w * C || Math.abs(_) - b > s * i * C) return c;
 	let T = Math.min((g - y) / S, (g - y) / C) / w, E = Math.max((g + y) / S, (g + y) / C) / w, D = Math.min((_ - b) / S, (_ - b) / C) / i, O = Math.max((_ + b) / S, (_ + b) / C) / i;
 	if (E < -s || T > s || O < -s || D > s) return c;
-	let k = Math.max(-s, T), A = Math.min(s, E), j = Math.max(-s, D), M = Math.min(s, O), ee = (E - T) * (O - D), te = (A - k) * (M - j);
-	return ee <= 0 || te <= 0 || (c.shown = E > -1 && T < 1 && O > -1 && D < 1, c.pixels = ee * n * r / 4, c.weight = ot(k, A, j, M)), c;
+	let k = Math.max(-s, T), A = Math.min(s, E), j = Math.max(-s, D), M = Math.min(s, O), N = (E - T) * (O - D), ee = (A - k) * (M - j);
+	return N <= 0 || ee <= 0 || (c.shown = E > -1 && T < 1 && O > -1 && D < 1, c.pixels = N * n * r / 4, c.weight = ut(k, A, j, M)), c;
 }
-var z = /* @__PURE__ */ new Float64Array(6), ct = {
+var V = /* @__PURE__ */ new Float64Array(6), ft = {
 	shown: !1,
 	pixels: 0,
 	weight: 1
 };
-function lt(e, [t, n, r], i, a, o, s, c, l, u = at) {
+function pt(e, [t, n, r], i, a, o, s, c, l, u = lt) {
 	let d = r / 2, f = Math.max(0, t - e[0], n - e[1], e[3] - t - r, e[4] - n - r);
-	z[2] = e[2], z[5] = e[5];
+	V[2] = e[2], V[5] = e[5];
 	let p = 0;
 	for (let r = 0; r < 4; r++) {
 		let m = t + (r & 1) * d, h = n + (r >> 1) * d;
-		z[0] = Math.max(e[0], m - f), z[1] = Math.max(e[1], h - f), z[3] = Math.min(e[3], m + d + f), z[4] = Math.min(e[4], h + d + f), !(z[0] > z[3] || z[1] > z[4]) && st(z, i, a, o, s, c, l, 1, ct, u).shown && (p |= 1 << r);
+		V[0] = Math.max(e[0], m - f), V[1] = Math.max(e[1], h - f), V[3] = Math.min(e[3], m + d + f), V[4] = Math.min(e[4], h + d + f), !(V[0] > V[3] || V[1] > V[4]) && dt(V, i, a, o, s, c, l, 1, ft, u).shown && (p |= 1 << r);
 	}
 	return p;
 }
 //#endregion
 //#region src/engine/world/tree.ts
-var B = (e, t, n) => (e * 256 + t) * 256 + n, ut = class {
+var H = (e, t, n) => (e * 256 + t) * 256 + n, mt = class {
 	roots = [];
 	pages = /* @__PURE__ */ new Map();
 	units = /* @__PURE__ */ new Map();
@@ -1708,10 +1762,10 @@ var B = (e, t, n) => (e * 256 + t) * 256 + n, ut = class {
 	#r = /* @__PURE__ */ new Map();
 	#i = /* @__PURE__ */ new Map();
 	constructor(e) {
-		this.#e = new Set(e.roots.map(V)), this.#t = Math.max(...e.roots.map((e) => e.level));
+		this.#e = new Set(e.roots.map(U)), this.#t = Math.max(...e.roots.map((e) => e.level));
 	}
 	add(e, t) {
-		let n = V(e), r = this.units.get(n);
+		let n = U(e), r = this.units.get(n);
 		if (r) return r;
 		let a = /* @__PURE__ */ new Map(), o = {
 			level: e.level,
@@ -1738,34 +1792,34 @@ var B = (e, t, n) => (e * 256 + t) * 256 + n, ut = class {
 					null
 				]
 			};
-			this.pages.set(r.id, r), o.pages.push(r), a.set(B(t.g, t.i, t.j), r);
+			this.pages.set(r.id, r), o.pages.push(r), a.set(H(t.g, t.i, t.j), r);
 		}
 		this.units.set(n, o), this.#r.delete(n);
 		for (let t = e.level + 1; t <= this.#t; t++) {
-			let n = V(H(e, t));
+			let n = U(W(e, t));
 			this.#i.set(n, (this.#i.get(n) ?? 0) + 1);
 		}
 		let c = new Set(e.rows.map((e) => e.g)), l = Math.max(...c), u = e.level === 0 ? 0 : e.level + 1, d = new Set(e.children.map((e) => e.quadrant));
 		for (let e of o.pages) {
 			let { g: t, i: n, j: r } = e.row;
-			c.has(t + 1) && (e.parent = a.get(B(t + 1, n >> 1, r >> 1)) ?? null);
+			c.has(t + 1) && (e.parent = a.get(H(t + 1, n >> 1, r >> 1)) ?? null);
 			for (let i = 0; i < 4; i++) {
 				let o = 2 * n + (i & 1), s = 2 * r + (i >> 1);
-				c.has(t - 1) ? e.children[i] = a.get(B(t - 1, o, s)) ?? null : t === u && t > 0 && (e.children[i] = d.has((o >> 3) + 2 * (s >> 3)) ? void 0 : null);
+				c.has(t - 1) ? e.children[i] = a.get(H(t - 1, o, s)) ?? null : t === u && t > 0 && (e.children[i] = d.has((o >> 3) + 2 * (s >> 3)) ? void 0 : null);
 			}
 		}
 		if (this.#e.has(n)) for (let e of o.pages) e.g === l && this.roots.push(e);
 		else {
-			let t = this.units.get(V(H(e, e.level + 1)));
+			let t = this.units.get(U(W(e, e.level + 1)));
 			t && this.#o(t, o);
 		}
 		let f = i(o.idx);
 		for (let { key: t } of f) {
-			let n = t.level === e.level - 1 ? this.units.get(V(t)) : void 0;
+			let n = t.level === e.level - 1 ? this.units.get(U(t)) : void 0;
 			n && this.#o(o, n);
 		}
 		for (let { key: e, hash: t } of f) {
-			let n = V(e);
+			let n = U(e);
 			if (this.units.has(n)) continue;
 			let r = this.#r.get(n);
 			if (r && r.from <= o.level) continue;
@@ -1786,19 +1840,19 @@ var B = (e, t, n) => (e * 256 + t) * 256 + n, ut = class {
 	}
 	ground(e, t) {
 		for (let n of this.roots) {
-			let [r, i, a] = ft(n);
+			let [r, i, a] = gt(n);
 			if (e < r || e >= r + a || t < i || t >= i + a) continue;
 			let o = n;
 			for (;;) {
 				let n = +(e >= r + a / 2), s = +(t >= i + a / 2), c = o.children[n + 2 * s];
 				if (!c) return o.box[2];
-				o = c, [r, i, a] = ft(o);
+				o = c, [r, i, a] = gt(o);
 			}
 		}
 	}
 	async load(e, t, n) {
 		for (;;) {
-			let r = this.wanted().filter((n) => dt(n, e, t));
+			let r = this.wanted().filter((n) => ht(n, e, t));
 			if (r.length === 0) return;
 			(await Promise.all(r.map((e) => n(e.path)))).forEach((e, t) => this.add(e, r[t].path));
 		}
@@ -1806,7 +1860,7 @@ var B = (e, t, n) => (e * 256 + t) * 256 + n, ut = class {
 	prune(e) {
 		let t = [], n = [...this.units.values()].sort((e, t) => e.level - t.level);
 		for (let r of n) {
-			let n = V(r);
+			let n = U(r);
 			if (this.#e.has(n) || this.#i.has(n) || r.pages.some((t) => e.has(t.id))) continue;
 			for (let e of r.pages) this.pages.delete(e.id), t.push(e.id);
 			let a = r.parent;
@@ -1816,7 +1870,7 @@ var B = (e, t, n) => (e * 256 + t) * 256 + n, ut = class {
 			}
 			this.units.delete(n);
 			for (let e = r.level + 1; e <= this.#t; e++) {
-				let t = V(H(r, e)), n = this.#i.get(t) - 1;
+				let t = U(W(r, e)), n = this.#i.get(t) - 1;
 				n ? this.#i.set(t, n) : this.#i.delete(t);
 			}
 			for (let { key: e } of i(r.idx)) this.#a(e);
@@ -1825,12 +1879,12 @@ var B = (e, t, n) => (e * 256 + t) * 256 + n, ut = class {
 		return t;
 	}
 	#a(e) {
-		let t = V(e);
+		let t = U(e);
 		this.#r.delete(t);
 		for (let n = e.level + 1; n <= e.level + 3; n++) {
-			let r = this.units.get(V(H(e, n)));
+			let r = this.units.get(U(W(e, n)));
 			if (!r) continue;
-			let a = i(r.idx).find((e) => V(e.key) === t);
+			let a = i(r.idx).find((e) => U(e.key) === t);
 			if (!a) continue;
 			let o = {
 				level: e.level,
@@ -1852,23 +1906,23 @@ var B = (e, t, n) => (e * 256 + t) * 256 + n, ut = class {
 		for (let n of this.#s(e, t)) n.children.fill(null);
 		for (let e of t.pages) {
 			if (e.g !== n) continue;
-			let t = 8 * i + e.row.i, r = 8 * a + e.row.j, s = o.get(B(n + 1, t >> 1, r >> 1)) ?? null;
+			let t = 8 * i + e.row.i, r = 8 * a + e.row.j, s = o.get(H(n + 1, t >> 1, r >> 1)) ?? null;
 			e.parent = s, s && (s.children[(t & 1) + 2 * (r & 1)] = e);
 		}
 	}
 	#s(e, t) {
 		let n = e.level + 1, r = c * 2 ** n, i = (t.e - e.e) / r, a = (t.n - e.n) / r, o = 250 * 2 ** t.level / r, s = [];
 		for (let t = a; t < a + o; t++) for (let r = i; r < i + o; r++) {
-			let i = e.grid.get(B(n, r, t));
+			let i = e.grid.get(H(n, r, t));
 			i && s.push(i);
 		}
 		return s;
 	}
 };
-function V(e) {
+function U(e) {
 	return `${e.level}/${e.e}/${e.n}`;
 }
-function H(e, t) {
+function W(e, t) {
 	let n = 250 * 2 ** t;
 	return {
 		level: t,
@@ -1876,11 +1930,11 @@ function H(e, t) {
 		n: Math.floor(e.n / n) * n
 	};
 }
-function dt(e, t, n) {
+function ht(e, t, n) {
 	let r = 250 * 2 ** e.level;
 	return t >= e.e && t < e.e + r && n >= e.n && n < e.n + r;
 }
-function ft(e) {
+function gt(e) {
 	let t = c * 2 ** e.g;
 	return [
 		e.unit.e + e.row.i * t,
@@ -1890,7 +1944,7 @@ function ft(e) {
 }
 //#endregion
 //#region src/engine/plan/cut.ts
-var pt = 1 / .8 ** 2, mt = 1.1, ht = class {
+var _t = 1 / .8 ** 2, vt = 1.1, yt = class {
 	#e = /* @__PURE__ */ new Map();
 	#t = /* @__PURE__ */ new Map();
 	#n = {
@@ -1899,13 +1953,13 @@ var pt = 1 / .8 ** 2, mt = 1.1, ht = class {
 		weight: 1
 	};
 	plan(e, t, n, r) {
-		let { budget: i, capacity: a, now: o, predicted: s } = r, c = [], l = [], u = [], f = /* @__PURE__ */ new Map(), p = /* @__PURE__ */ new Map(), m = e.wanted(), h = /* @__PURE__ */ new Map(), g = new vt(), _ = 0, v = 0, y = (e) => {
+		let { budget: i, capacity: a, now: o, predicted: s } = r, c = [], l = [], u = [], f = /* @__PURE__ */ new Map(), p = /* @__PURE__ */ new Map(), m = e.wanted(), h = /* @__PURE__ */ new Map(), g = new St(), _ = 0, v = 0, y = (e) => {
 			let t = e.page, r = t.row.count;
 			c.push(t), l.push(e.visible), u.push(e.near), v += d(r), _ += e.visible;
 			let i = this.#e.get(t.id), a = i !== void 0, s = e.pixels * e.weight, f = s / Math.max(1, r);
 			m.length && e.pixels > 0 && h.set(t.id, f);
 			let p = a && !e.shown && o - (this.#t.get(t.id) ?? -Infinity) <= 1500 ? i : null;
-			(r < s * (a ? pt : 1) || p !== null) && _t(t, n) && g.push({
+			(r < s * (a ? _t : 1) || p !== null) && xt(t, n) && g.push({
 				page: t,
 				shown: e.shown,
 				held: p,
@@ -1965,35 +2019,35 @@ var pt = 1 / .8 ** 2, mt = 1.1, ht = class {
 		};
 	}
 	#r(e, t, n) {
-		let r = this.#i(e, t, mt), i = r.shown, { pixels: a, weight: o } = r, s = i;
+		let r = this.#i(e, t, vt), i = r.shown, { pixels: a, weight: o } = r, s = i;
 		if (n) {
-			let t = this.#i(e, n, mt);
+			let t = this.#i(e, n, vt);
 			t.pixels > a && ({pixels: a, weight: o} = t), s ||= t.shown;
 		}
 		return {
 			page: e,
 			shown: i,
 			near: s,
-			visible: i ? gt(e, t) : 0,
+			visible: i ? bt(e, t) : 0,
 			pixels: a,
 			weight: o
 		};
 	}
 	#i(e, t, n) {
 		let { width: r, height: i, tan: a, near: o, far: s } = t;
-		return st(e.box, t.view, r, i, a, o, s, n, this.#n, t.origin);
+		return dt(e.box, t.view, r, i, a, o, s, n, this.#n, t.origin);
 	}
 };
-function gt(e, t) {
-	let { width: n, height: r, tan: i, near: a, far: o, origin: s } = t, c = lt(e.box, ft(e), t.view, n, r, i, a, o, s), l = 0;
-	for (let t = 0; t < 4; t++) c & 1 << t && (l += it(e.row, t));
+function bt(e, t) {
+	let { width: n, height: r, tan: i, near: a, far: o, origin: s } = t, c = pt(e.box, gt(e), t.view, n, r, i, a, o, s), l = 0;
+	for (let t = 0; t < 4; t++) c & 1 << t && (l += ct(e.row, t));
 	return l;
 }
-function _t(e, t) {
+function xt(e, t) {
 	let { children: n } = e;
 	return e.g > 0 && t(e.id) && !n.includes(void 0) && n.some((e) => e !== null);
 }
-var vt = class {
+var St = class {
 	#e = [];
 	get size() {
 		return this.#e.length;
@@ -2004,7 +2058,7 @@ var vt = class {
 		let n = t.length - 1;
 		for (; n > 0;) {
 			let r = n - 1 >> 1;
-			if (!U(e, t[r])) break;
+			if (!Ct(e, t[r])) break;
 			t[n] = t[r], n = r;
 		}
 		t[n] = e;
@@ -2015,7 +2069,7 @@ var vt = class {
 			let t = 0;
 			for (; 2 * t + 1 < e.length;) {
 				let r = 2 * t + 1;
-				if (r + 1 < e.length && U(e[r + 1], e[r]) && r++, !U(e[r], n)) break;
+				if (r + 1 < e.length && Ct(e[r + 1], e[r]) && r++, !Ct(e[r], n)) break;
 				e[t] = e[r], t = r;
 			}
 			e[t] = n;
@@ -2023,21 +2077,21 @@ var vt = class {
 		return t;
 	}
 };
-function U(e, t) {
+function Ct(e, t) {
 	return e.shown === t.shown ? e.ratio > t.ratio : e.shown;
 }
 //#endregion
 //#region src/engine/quality.ts
-var yt = 5e5, bt = 2073600, xt = [1, .85], St = 30, Ct = 55, wt = 2e3, Tt = 5e3, Et = 5e5, Dt = .9;
-function Ot(e, t, n, r) {
-	return Math.min(n, Math.sqrt(bt / Math.max(1, e * t))) * r;
+var wt = 5e5, Tt = 2073600, Et = [1, .85], Dt = 30, Ot = 55, kt = 2e3, At = 5e3, jt = 5e5, Mt = .9;
+function Nt(e, t, n, r) {
+	return Math.min(n, Math.sqrt(Tt / Math.max(1, e * t))) * r;
 }
-function kt(e, t) {
+function Pt(e, t) {
 	if (!e.length) return 0;
 	let n = [...e].sort((e, t) => e - t);
 	return n[Math.ceil(n.length * t) - 1];
 }
-var At = class {
+var Ft = class {
 	#e = 0;
 	#t;
 	#n;
@@ -2050,7 +2104,7 @@ var At = class {
 		this.#n = t, this.#r = Math.max(t, n), this.#t = Math.min(this.#r, Math.max(this.#n, e));
 	}
 	get scale() {
-		return xt[this.#e];
+		return Et[this.#e];
 	}
 	get budget() {
 		return this.#t;
@@ -2069,19 +2123,19 @@ var At = class {
 			ms: e
 		}), this.#i = this.#i.filter((n) => t - n.time <= Math.max(1e3, 2 * e)), t - this.#i[0].time < 300) return !1;
 		let a = this.#i.reduce((e, t) => e + t.ms, 0) / this.#i.length;
-		if (this.#o = a > 1e3 / St ? this.#o + i : 0, this.#s = a <= 1e3 / Ct ? this.#s + i : 0, this.#o >= wt) {
-			let e = Math.floor(Math.min(.9, 1e3 / St / a) * this.#t);
+		if (this.#o = a > 1e3 / Dt ? this.#o + i : 0, this.#s = a <= 1e3 / Ot ? this.#s + i : 0, this.#o >= kt) {
+			let e = Math.floor(Math.min(.9, 1e3 / Dt / a) * this.#t);
 			if (this.#t > this.#n) this.#t = Math.max(this.#n, e);
-			else if (this.#e < xt.length - 1) this.#e++;
+			else if (this.#e < Et.length - 1) this.#e++;
 			else return !1;
-		} else if (this.#s >= Tt) {
+		} else if (this.#s >= At) {
 			if (this.#e > 0) this.#e--;
-			else if (this.#t < this.#r && r >= Dt * this.#t) this.#t = Math.min(this.#r, this.#t + Et);
+			else if (this.#t < this.#r && r >= Mt * this.#t) this.#t = Math.min(this.#r, this.#t + jt);
 			else return !1;
 		} else return !1;
 		return this.#c(), !0;
 	}
-}, jt = class {
+}, It = class {
 	#e;
 	#t = [];
 	#n = /* @__PURE__ */ new Set();
@@ -2160,12 +2214,12 @@ var At = class {
 			pages: o
 		};
 	}
-}, Mt = {
+}, Lt = {
 	idx: 8,
 	concurrency: 8,
 	gap: 65536,
 	span: 2097152
-}, Nt = 1e3, Pt = 3e4, Ft = 1e3, It = 2e3, Lt = class {
+}, Rt = 1e3, zt = 3e4, Bt = 1e3, Vt = 2e3, Ht = class {
 	#e;
 	#t;
 	#n;
@@ -2195,8 +2249,8 @@ var At = class {
 	#y = -Infinity;
 	#b = !1;
 	#x = !1;
-	constructor(e, t, n, r, i, a = Mt) {
-		this.#e = e, this.#t = t, this.#n = n, this.#r = r, this.#i = i, this.#a = a, this.#o = new jt(a);
+	constructor(e, t, n, r, i, a = Lt) {
+		this.#e = e, this.#t = t, this.#n = n, this.#r = r, this.#i = i, this.#a = a, this.#o = new It(a);
 	}
 	update(e, t, n) {
 		if (!this.#x) {
@@ -2262,7 +2316,7 @@ var At = class {
 	#T = ({ id: e, page: t }) => {
 		if (this.#x) return;
 		let n = this.#e.pages.get(e);
-		n && (this.#n.add(e, t, [n.unit.e, n.unit.n], this.protects) ? (this.#g.add(e), this.#m.delete(e) && this.#j(e)) : (this.#m.set(e, this.#u + Ft), this.#A(e, Ft)), this.#r());
+		n && (this.#n.add(e, t, [n.unit.e, n.unit.n], this.protects) ? (this.#g.add(e), this.#m.delete(e) && this.#j(e)) : (this.#m.set(e, this.#u + Bt), this.#A(e, Bt)), this.#r());
 	};
 	#E(e) {
 		this.#x || (this.#f.delete(e), this.#k(e.pack), this.#l = this.#l.filter((e) => this.#N(e.id, e.pack)), this.#o.want(this.#l), this.#o.done(e), this.#w(), this.#r());
@@ -2276,7 +2330,7 @@ var At = class {
 			this.#b = !0, this.#i();
 			return;
 		}
-		let n = this.#p.get(e), r = n ? Math.min(2 * n.delay, Pt) : Nt;
+		let n = this.#p.get(e), r = n ? Math.min(2 * n.delay, zt) : Rt;
 		this.#p.set(e, {
 			delay: r,
 			until: this.#u + r
@@ -2297,11 +2351,11 @@ var At = class {
 	}
 	#M() {
 		let e = this.#u;
-		if (e - this.#y < It) return;
+		if (e - this.#y < Vt) return;
 		this.#y = e;
 		for (let e of this.#g) this.#n.holds(e) || this.#g.delete(e);
 		for (let [t, n] of this.#m) n <= e && this.#m.delete(t);
-		for (let [t, n] of this.#_) e - n >= It && this.#_.delete(t);
+		for (let [t, n] of this.#_) e - n >= Vt && this.#_.delete(t);
 		let { keep: t } = this.#s;
 		if (this.#e.pages.size <= 2 * (this.#g.size + t.size)) return;
 		let n = /* @__PURE__ */ new Set([
@@ -2326,7 +2380,7 @@ var At = class {
 };
 //#endregion
 //#region src/engine/stream/remote.ts
-function Rt(e, t) {
+function Ut(e, t) {
 	let n = /* @__PURE__ */ new Map();
 	return (r) => {
 		if ("unfetch" in r) return void n.get(r.unfetch)?.abort();
@@ -2349,29 +2403,29 @@ function Rt(e, t) {
 }
 //#endregion
 //#region src/engine/stream/worker.ts?worker&inline
-var zt = "(function(){var e=class extends Error{name=`Missing`};let t=async(t,n,r)=>{let i=await fetch(t,n?{signal:r,headers:{Range:`bytes=${n[0]}-${n[1]-1}`}}:{signal:r});if(i.status===404)throw new e(`http 404 for ${t}`);if(i.status!==200&&i.status!==206)throw Error(`http ${i.status} for ${t}`);let a=new Uint8Array(await i.arrayBuffer());return n&&i.status===200?a.slice(n[0],n[1]):a},n=.28209479177387814,r=15.625,i=`GMIX`,a={position:0,alpha:6,rotationIndex:7,rotation:8,scale:11,dc:14,label:17},o={origin:0,step:3,scaleMin:6,scaleMax:9,dcMin:12,dcMax:15,shScale:18};async function s(e,t){let n=new ReadableStream({start(t){t.enqueue(e),t.close()}}).pipeThrough(t);return new Uint8Array(await new Response(n).arrayBuffer())}function c(e){return s(e,new DecompressionStream(`deflate-raw`))}function l(e){return s(e,new CompressionStream(`deflate-raw`))}async function u(e,t,n){let r=new DataView(e.buffer,e.byteOffset,e.byteLength);if(e.length<8||String.fromCharCode(...e.subarray(0,4))!==t)throw Error(`not a ${n} file`);let i=r.getUint16(4,!0);if(i!==1)throw Error(`${n} version ${i}; narcissus reads 1`);let a;try{a=await c(e.subarray(8))}catch{throw Error(`${n} body is not a valid deflate stream`)}return new DataView(a.buffer,a.byteOffset,a.byteLength)}function d(e,t){let n=``;for(let r=0;r<8;r++){let i=e.getUint8(t+r);n+=i.toString(16).padStart(2,`0`)}return n}function f(e,t){let n=/* @__PURE__ */ new Float32Array(6);for(let r=0;r<6;r++)n[r]=e.getFloat32(t+20+4*r,!0);return{g:e.getUint8(t),i:e.getUint8(t+1),j:e.getUint8(t+2),count:e.getUint32(t+4,!0),quadrants:[e.getUint32(t+8,!0),e.getUint32(t+12,!0),e.getUint32(t+16,!0)],box:n,offset:e.getUint32(t+44,!0),length:e.getUint32(t+48,!0)}}async function p(e){let t=await u(e,i,`.idx`);if(t.byteLength<40)throw Error(`.idx header is cut off`);let n=t.getUint16(32,!0),r=t.getUint8(34),a=t.getUint16(36,!0),o=40+n*52+r*9+a*11;if(t.byteLength!==o)throw Error(`.idx holds ${t.byteLength} bytes, its counts need ${o}`);let s=d(t,24),c={level:t.getUint8(0),e:t.getInt32(4,!0),n:t.getInt32(8,!0),pack:d(t,12),packSize:t.getUint32(20,!0),col:s===`0000000000000000`?null:s,rows:[],children:[],descendants:[]},l=40;for(let e=0;e<n;e++,l+=52)c.rows.push(f(t,l));for(let e=0;e<r;e++,l+=9)c.children.push({quadrant:t.getUint8(l),idx:d(t,l+1)});for(let e=0;e<a;e++,l+=11)c.descendants.push({depth:t.getUint8(l),column:t.getUint8(l+1),row:t.getUint8(l+2),idx:d(t,l+3)});return c}function m(e,t,n){return`u/${e.level}/${e.e}/${e.n}.${t}.${n}`}let h=/(?:^|\\/)u\\/(\\d+)\\/(-?\\d+)\\/(-?\\d+)\\.([0-9a-f]{16})\\.(?:idx|pack|col)$/;function g(e){let t=h.exec(e);return t?{level:Number(t[1]),e:Number(t[2]),n:Number(t[3]),hash:t[4]}:null}async function _(e){let t=await u(e,`GMCL`,`.col`);if(t.byteLength<60)throw Error(`.col header is cut off`);let n=t.getUint16(0,!0),r=60+12*n*n;if(t.byteLength!==r)throw Error(`.col holds ${t.byteLength} bytes, ${n} nodes need ${r}`);let i=new Float32Array(12*n*n),a=60;for(let e=0;e<12;e++){let r=t.getFloat32(12+4*e,!0)/127;for(let o=0;o<n;o++){let s=0;for(let c=0;c<n;c++,a++)s=s+t.getInt8(a)<<24>>24,i[(e*n+o)*n+c]=s*r}}return{n,pitch:t.getFloat32(4,!0),margin:t.getFloat32(8,!0),values:i}}function v(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}let y=Float64Array.from({length:256},(e,t)=>(t/255-.5)*Math.SQRT2);function b(e,t,n,r,i){let a=y[t],o=y[n],s=y[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 x(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 S(e){if(e.length<128)throw Error(`page payload is shorter than its header`);return new DataView(e.buffer,e.byteOffset,e.byteLength)}function C(e){let t=S(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,count:n,k:r,book:i}}function w(e){return[e.getUint32(4,!0),e.getUint32(8,!0),e.getUint32(12,!0)]}function T(e,t){let{view:n,count:r,k:i,book:s}=C(e),c=/* @__PURE__ */ new Float32Array(27);for(let e=0;e<27;e++)c[e]=n.getFloat32(20+4*e,!0);i===0&&c.fill(0,o.shScale);let l=new Uint32Array(r*4),u=new Float32Array(Math.ceil(r/256)*6),d=/* @__PURE__ */ new Float64Array(768);for(let e=0;e<3;e++){let t=c[o.scaleMin+e],n=c[o.scaleMax+e]-t;for(let r=0;r<256;r++)d[e*256+r]=Math.exp(t+r/255*n)}let f=c[o.step],p=c[o.step+1],m=c[o.step+2],h=128+a.position*r,g=128+a.alpha*r,_=128+a.rotationIndex*r,v=128+a.rotation*r,y=128+a.scale*r,S=/* @__PURE__ */ new Float64Array(4),T=/* @__PURE__ */ new Float64Array(3),O=0,k=0,A=0;for(let t=0,n=0;n<r;t++){let i=1/0,a=1/0,o=1/0,s=-1/0,c=-1/0,C=-1/0;for(let t=Math.min(n+256,r);n<t;n++){let t=e[h+n]|e[h+r+n]<<8;O=O+(t>>>1^-(t&1))&65535,t=e[h+2*r+n]|e[h+3*r+n]<<8,k=k+(t>>>1^-(t&1))&65535,t=e[h+4*r+n]|e[h+5*r+n]<<8,A=A+(t>>>1^-(t&1))&65535;let u=e[_+n],w=e[v+n],E=e[v+r+n],D=e[v+2*r+n],j=e[y+n],M=e[y+r+n],N=e[y+2*r+n],P=n*4;l[P]=O|k<<16,l[P+1]=A|e[g+n]<<16|u<<24,l[P+2]=w|E<<8|D<<16|j<<24,l[P+3]=M|N<<8,b(u,w,E,D,S),x(S,d[j],d[256+M],d[512+N],T);let F=O*f,I=k*p,L=A*m;i=Math.min(i,F-T[0]),a=Math.min(a,I-T[1]),o=Math.min(o,L-T[2]),s=Math.max(s,F+T[0]),c=Math.max(c,I+T[1]),C=Math.max(C,L+T[2])}u.set([i,a,o,s,c,C],t*6)}let j=t?D(e,r,i,s,l,c,t):E(e,r,i,s);return{count:r,quadrants:w(n),geometry:l,colour:j,params:c,clusters:u}}function E(e,t,n,r){let i=new Uint32Array(t*3),o=128+a.dc*t,s=128+a.label*t;for(let a=0;a<t;a++){let c=a*3;if(i[c]=e[o+a]|e[o+t+a]<<8|e[o+2*t+a]<<16,n===0)continue;let l=r+(e[s+a]|e[s+t+a]<<8)*9;i[c]|=e[l]<<24,i[c+1]=e[l+1]|e[l+2]<<8|e[l+3]<<16|e[l+4]<<24,i[c+2]=e[l+5]|e[l+6]<<8|e[l+7]<<16|e[l+8]<<24}return i}function D(e,t,r,i,s,c,l){let u=128+a.dc*t,d=128+a.label*t,f=new Int8Array(e.buffer,e.byteOffset+i,r*9),p=new Float32Array(t*3),m=new Float32Array(t*9),h=[1/0,1/0,1/0],g=[-1/0,-1/0,-1/0],_=/* @__PURE__ */ new Float32Array(9),y=/* @__PURE__ */ new Float32Array(12),b=c[o.origin],x=c[o.origin+1],S=c[o.step],C=c[o.step+1],w=/* @__PURE__ */ new Float64Array(768);for(let e=0;e<3;e++){let t=c[o.dcMin+e],n=c[o.dcMax+e]-t;for(let r=0;r<256;r++)w[e*256+r]=t+r/255*n}let T=new Float64Array(Math.max(r,1)*9);for(let e=0;e<r*9;e++)T[e]=f[e]/127*c[o.shScale+e%9];for(let i=0;i<t;i++){let a=s[i*4];v(l,b+(a&65535)*S,x+(a>>>16)*C,y);for(let r=0;r<3;r++){let a=i*3+r;p[a]=w[r*256+e[u+r*t+i]]+y[r]/n,h[r]=Math.min(h[r],p[a]),g[r]=Math.max(g[r],p[a])}let o=r>0?(e[d+i]|e[d+t+i]<<8)*9:0;for(let e=0;e<9;e++){let t=i*9+e;m[t]=T[o+e]+y[3+e],_[e]=Math.max(_[e],Math.abs(m[t]))}}for(let e=0;e<3;e++)c[o.dcMin+e]=t>0?h[e]:0,c[o.dcMax+e]=t>0?g[e]:0;c.set(_,o.shScale);let E=[0,1,2].map(e=>{let t=c[o.dcMax+e]-c[o.dcMin+e];return t>0?255/t:0}),D=Array.from(_,e=>e>0?127/e:0),O=[0,1,2].map(e=>c[o.dcMin+e]),k=new Uint32Array(t*3),A=new Uint8Array(k.buffer);for(let e=0;e<t;e++){let t=e*4*3;for(let n=0;n<3;n++){let r=Math.round((p[e*3+n]-O[n])*E[n]);A[t+n]=Math.min(255,Math.max(0,r))}for(let n=0;n<9;n++){let r=Math.round(m[e*9+n]*D[n]);A[t+3+n]=Math.min(127,Math.max(-127,r))}}return k}let O=(e,t,n)=>Math.min(n,Math.max(t,e));function k(e,t,n){return n>t?O(Math.round((e-t)/(n-t)*255),0,255):0}function A(e,t){return t>0?O(Math.round(e/t*127),-127,127):0}function j(e){return e&=1023,e=(e|e<<16)&50331903,e=(e|e<<8)&50393103,e=(e|e<<4)&51130563,(e|e<<2)&153391689}function M(e,t,n){return j(e>>6)|j(t>>6)<<1|j(n>>6)<<2}function N(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 P(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]=A(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>2048){let e=o.length/256,n=Array.from({length:256},(t,n)=>o[Math.floor(n*e)]);o.splice(0,o.length,...n);for(let e=0;e<t;e++){let t=1/0;for(let n=0;n<256;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 F(e,t){let{count:n,position:i,rotation:o,scale:s,alpha:c,dc:l,sh:u}=e,d=[1/0,1/0,1/0],f=[-1/0,-1/0,-1/0],p=[...d],m=[...f],h=[...d],g=[...f];for(let e=0;e<n;e++)for(let t=0;t<3;t++)d[t]=Math.min(d[t],i[e*3+t]),f[t]=Math.max(f[t],i[e*3+t]),p[t]=Math.min(p[t],s[e*3+t]),m[t]=Math.max(m[t],s[e*3+t]),h[t]=Math.min(h[t],l[e*3+t]),g[t]=Math.max(g[t],l[e*3+t]);let _=5e-4*2**t.g,v=Float32Array.from(d),y=Float32Array.from(d,(e,t)=>Math.max(_,(f[t]-e)/65535)),b=new Uint16Array(n*3);for(let e=0;e<n;e++)for(let t=0;t<3;t++){let n=(i[e*3+t]-v[t])/y[t];b[e*3+t]=O(Math.round(n),0,65535)}let S=r*2**t.g,C=(t.i+.5)*S,w=(t.j+.5)*S,T=new Uint8Array(n),E=new Float64Array(n);for(let e=0;e<n;e++){let t=+(i[e*3]>=C),n=+(i[e*3+1]>=w);T[e]=t+2*n,E[e]=T[e]*2**30+M(b[e*3],b[e*3+1],b[e*3+2])}let D=Uint32Array.from({length:n},(e,t)=>t).sort((e,t)=>E[e]-E[t]),A=[0,0,0];for(let e=1;e<4;e++)A[e-1]=T.filter(t=>t<e).length;let j=u?N(u,n):/* @__PURE__ */ new Float32Array(9),{book:F,labels:I}=u?P(u,n,j):{book:null,labels:null},L=F?F.length/9:0,R=17+(L>0?2:0),z=new Uint8Array(128+R*n+L*9),B=new DataView(z.buffer);B.setUint32(0,n,!0),A.forEach((e,t)=>B.setUint32(4+4*t,e,!0)),B.setUint16(16,L,!0),[...v,...y,...p,...m,...h,...g,...j].forEach((e,t)=>B.setFloat32(20+4*t,e,!0));let V=e=>128+e*n,H=new Float32Array([...d,...f]),U=/* @__PURE__ */ new Float64Array(4),W=/* @__PURE__ */ new Float64Array(3),G=[0,0,0];for(let e=0;e<n;e++){let t=D[e];for(let n=0;n<3;n++){let r=b[t*3+n]-G[n]<<16>>16,i=r<0?-2*r-1:2*r;G[n]=b[t*3+n],z[V(a.position+2*n)+e]=i&255,z[V(a.position+2*n+1)+e]=i>>8}z[V(a.alpha)+e]=O(Math.round(c[t]*255),0,255);let n=Math.hypot(...o.subarray(t*4,t*4+4));for(let e=0;e<4;e++)U[e]=o[t*4+e]/n;let r=0;for(let e=1;e<4;e++)Math.abs(U[e])>Math.abs(U[r])&&(r=e);let u=U[r]<0?-1:1;z[V(a.rotationIndex)+e]=r;for(let t=0,n=0;t<4;t++){if(t===r)continue;let i=Math.round((u*U[t]/Math.SQRT2+.5)*255);z[V(a.rotation+n++)+e]=O(i,0,255)}for(let n=0;n<3;n++)z[V(a.scale+n)+e]=k(s[t*3+n],p[n],m[n]),z[V(a.dc+n)+e]=k(l[t*3+n],h[n],g[n]);I&&(z[V(a.label)+e]=I[t]&255,z[V(a.label+1)+e]=I[t]>>8);let[d,f,_]=[0,1,2].map(e=>Math.exp(s[t*3+e]));x(U,d,f,_,W);for(let e=0;e<3;e++)H[e]=Math.min(H[e],i[t*3+e]-W[e]),H[3+e]=Math.max(H[3+e],i[t*3+e]+W[e])}return F&&z.set(new Uint8Array(F.buffer),V(R)),{payload:z,row:{g:t.g,i:t.i,j:t.j,count:n,quadrants:A,box:H,offset:0,length:0}}}function I(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 L(e,t,n){for(let r=0;r<4;r++)e[t+r]=n.charCodeAt(r)}function R(e){return Uint8Array.from({length:8},(t,n)=>parseInt(e.slice(2*n,2*n+2),16))}async function z(e,t){let n=await l(e),r=new Uint8Array(8+n.length);return L(r,0,t),new DataView(r.buffer).setUint16(4,1,!0),r.set(n,8),r}async function B(e){let{rows:t,children:n,descendants:r}=e,a=new Uint8Array(40+t.length*52+n.length*9+r.length*11),o=new DataView(a.buffer);o.setUint8(0,e.level),o.setInt32(4,e.e,!0),o.setInt32(8,e.n,!0),a.set(R(e.pack),12),o.setUint32(20,e.packSize,!0),e.col&&a.set(R(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)I(o,s,e),s+=52;for(let e of n)o.setUint8(s,e.quadrant),a.set(R(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),a.set(R(e.idx),s+3),s+=11;return z(a,i)}function V(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 H(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}}async function U(e,t){return p(await G(e,t))}async function*W(e,t,n,r){let i=t.col===null?null:te(e,t.col,n),a=await ee(e,t,r),o=await i;for(let[e,n]of t.pages.entries()){let t=await c(a[e]);r?.throwIfAborted(),yield{id:n.id,page:T(t,o)}}}async function G(e,t){let n=await e.cache.get(t);if(n)return n;let r=await e.fetch(e.base+t,null);return e.cache.put(t,r),r}async function ee(e,t,n){let r=t.pages.map(e=>`${t.pack}#${e.offset}+${e.length}`),i=await Promise.all(r.map(t=>e.cache.get(t)));if(n?.throwIfAborted(),i.every(e=>e!==void 0))return i;let a=await e.fetch(e.base+t.pack,[t.start,t.end],n);if(a.length!==t.end-t.start)throw Error(`${t.pack}: ${a.length} bytes for ${t.start}-${t.end}`);return t.pages.map((n,o)=>{let s=a.slice(n.offset-t.start,n.offset-t.start+n.length);return i[o]||e.cache.put(r[o],s),s})}function te(e,t,n){let r=n.get(t);if(r)n.delete(t);else{let i=G(e,t).then(_);i.catch(()=>{n.get(t)===i&&n.delete(t)}),r=i}if(n.set(t,r),n.size>64){let[e]=n.keys();n.delete(e)}return r}function ne(e){let t=/* @__PURE__ */ new Map,n=0;return{async get(e){let n=t.get(e);return n&&(t.delete(e),t.set(e,n)),n},async put(r,i){let a=t.get(r);if(a&&(t.delete(r),n-=a.length),!(i.length>e)){t.set(r,i),n+=i.length;for(let[r,i]of t){if(n<=e)break;t.delete(r),n-=i.length}}}}}async function re(e,t){let n;try{n=await(await ae()).getDirectoryHandle(String(t),{create:!0})}catch{return null}let r=/* @__PURE__ */ new Map,i=0,a=!1,o=(e,t)=>{i+=t-(r.get(e)??0),r.delete(e),r.set(e,t)},s=e=>{i-=r.get(e)??0,r.delete(e)},c=()=>{if(a)for(let[t,a]of r){if(i<=e)break;r.delete(t),i-=a,n.removeEntry(t).catch(()=>void 0)}};return ce(n).then(e=>{let t=[...r];r.clear(),i=0;for(let{name:t,size:n}of e.sort((e,t)=>e.time-t.time))o(t,n);for(let[e,n]of t)o(e,n);a=!0,c()}),{async get(e){let t=encodeURIComponent(e);if(a&&!r.has(t))return;let i=await oe(n,t);return i?o(t,i.length):s(t),i},async put(t,r){if(r.length===0||r.length>e)return;let i=encodeURIComponent(t);await se(n,i,r)&&(o(i,r.length),c())}}}async function ie(e){let t=new Set(Array.from({length:e},(e,t)=>String(t)));try{let e=await ae(),n=[];for await(let[r,i]of e.entries())(i.kind!==`directory`||!t.has(r))&&n.push(r);let r={recursive:!0};for(let t of n)await e.removeEntry(t,r).catch(()=>void 0)}catch{}}async function ae(){return(await navigator.storage.getDirectory()).getDirectoryHandle(`cache`,{create:!0})}async function oe(e,t){try{let n=await(await e.getFileHandle(t)).getFile();return n.size>0?new Uint8Array(await n.arrayBuffer()):void 0}catch{return}}async function se(e,t,n){let r;try{return r=await(await e.getFileHandle(t,{create:!0})).createWritable(),await r.write(n),await r.close(),!0}catch{return r?.abort().catch(()=>void 0),!1}}async function ce(e){let t=[];try{for await(let[n,r]of e.entries()){if(r.kind!==`file`)continue;let e=await r.getFile().catch(()=>null);e&&t.push({name:n,size:e.size,time:e.lastModified})}}catch{}return t}function le(t){let n=/* @__PURE__ */ new Map,r=0;return{fetch:(i,a,o)=>new Promise((s,c)=>{if(o?.aborted)return c(o.reason);let l=++r,u=()=>{n.delete(l),t({unfetch:l}),c(o.reason)};n.set(l,t=>{o?.removeEventListener(`abort`,u),`bytes`in t?s(t.bytes):c(t.missing?new e(t.error):Error(t.error))}),o?.addEventListener(`abort`,u,{once:!0}),t({fetch:l,url:i,range:a})}),take(e){let t=n.get(e.fetched);n.delete(e.fetched),t?.(e)}}}let K=16384,ue=1408,de=65535,q=324121,fe=.4,pe=[[12,1/7e3,0,1/9e3,.7],[9,1/2300,1.1,1/3100,.4],[6,1/800,.3,1/1100,2],[3,1/150,.9,1/210,1.7]],me=pe.reduce((e,[t,n,,r])=>e+t*(n+r),0),he=Float32Array.from({length:ue*9},(e,t)=>{let n=Math.floor(t/9),r=t%9,i=(n*(37+2*r)+11*r)%255-127;return r===0&&(i=n%255-127),r===1&&(i=20*Math.floor(n/255)-50),i/127*.04}),J=new TextEncoder,ge={version:1,crs:`synthetic`,height:`synthetic`,leaf:250,roots:[512e4,6144e3].map(e=>({level:12,e:0,n:e})).map(e=>({...e,idx:m(e,Y(e,`idx`),`idx`)})),extent:{e:[44e4,9e5],n:[605e4,641e4],h:[0,80]}},_e=J.encode(JSON.stringify(ge));function ve(){return async(t,n)=>{if(t.endsWith(`world.json`))return be(_e,n);let r=g(t),i=t.slice(t.lastIndexOf(`.`)+1);if(!r||i!==`idx`&&i!==`pack`||!xe(r)||r.hash!==Y(r,i))throw new e(`no file ${t}`);return i===`idx`?be(await De(r),n):Oe(r,n,t)}}function ye(e,t){let n=30;for(let[r,i,a,o,s]of pe)n+=r*Math.sin(i*e+a)*Math.sin(o*t+s);return n}function be(e,t){return t?e.slice(t[0],t[1]):e.slice()}function Y(e,t){return V(J.encode(`${e.level}/${e.e}/${e.n}.${t}`))}function X(e,t,n){let{e:r,n:i}=ge.extent;return e<r[1]&&e+n>r[0]&&t<i[1]&&t+n>i[0]}function xe({level:e,e:t,n}){let r=250*2**e;return e<=12&&t%r===0&&n%r===0&&X(t,n,r)}function Se(e){return e===0?[1,0]:e===12?[16,15,14,13]:[e+1]}function Ce(e){let t=0;for(let n=0;n<8;n++)t|=(e>>2*n&1)<<n;return t}function we(e){let t=[];for(let n of Se(e.level)){let i=r*2**n,a=250*2**e.level/i;for(let r=0;r<a*a;r++){let a=Ce(r),o=Ce(r>>1);X(e.e+a*i,e.n+o*i,i)&&t.push({g:n,i:a,j:o})}}return t}function Te(e,t){let n=e.level-t,r=250*2**n,i=[];for(let a=0;n>=0&&a<2**t;a++)for(let o=0;o<2**t;o++){let t={level:n,e:e.e+o*r,n:e.n+a*r};X(t.e,t.n,r)&&i.push({column:o,row:a,unit:t})}return i}function Ee(e,{g:t,i:n,j:i},a){let o=r*2**t,s=o/128,c=3*1.2*s,l=1.17*s,u=ye(e.e+(n+.5)*o,e.n+(i+.5)*o),d=me*o/2,f=Float32Array.of(n*o-c,i*o-c,Math.max(0,u-d)-l,(n+1)*o+c,(i+1)*o+c,Math.min(60,u+d)+l),p=K/4;return{g:t,i:n,j:i,count:K,quadrants:[p,2*p,3*p],box:f,offset:a,length:q}}function De(e){let t=we(e),n=[];for(let{column:t,row:r,unit:i}of Te(e,1))n.push({quadrant:t+2*r,idx:Y(i,`idx`)});let r=[];for(let t of[2,3])for(let{column:n,row:i,unit:a}of Te(e,t))r.push({depth:t,column:n,row:i,idx:Y(a,`idx`)});return B({level:e.level,e:e.e,n:e.n,pack:Y(e,`pack`),packSize:t.length*324173+16,col:null,rows:t.map((t,n)=>Ee(e,t,n*q)),children:n,descendants:r})}function Oe(e,t,n){let r=we(e);if(!t||t[0]%q!=0||t[1]%q!=0||t[0]>=t[1]||t[1]>r.length*q)throw Error(`${n}: the synthetic world serves whole pages only`);let i=new Uint8Array(t[1]-t[0]);for(let n=0;n<i.length;n+=q)ke(je(e,r[(t[0]+n)/q]),i,n);return i}function ke(e,t,n){let r=n;for(let n=0;n<e.length;n+=de){let i=Math.min(de,e.length-n);t[r]=+(n+i===e.length),t[r+1]=i&255,t[r+2]=i>>8,t[r+3]=~i&255,t[r+4]=~i>>8&255,t.set(e.subarray(n,n+i),r+5),r+=5+i}}let Ae=e=>H(parseInt(V(J.encode(e)).slice(8),16));function je(e,{g:t,i,j:a}){let o=K,s=r*2**t/128,c=Ae(`${e.level}/${e.e}/${e.n}/${t}/${i}/${a}`),l=new Float64Array(3*o),u=new Float32Array(4*o),d=new Float32Array(3*o),f=new Float32Array(o),p=new Float32Array(3*o),m=new Float32Array(9*o);for(let t=0;t<o;t++){let r=(i*128+t%128+.5+fe*(2*c()-1))*s,o=(a*128+Math.floor(t/128)+.5+fe*(2*c()-1))*s,h=ye(e.e+r,e.n+o);l[3*t]=r,l[3*t+1]=o,l[3*t+2]=h;let g=Math.PI*c(),_=.1/2*(2*c()-1);u[4*t]=Math.cos(g)*Math.cos(_),u[4*t+1]=Math.cos(g)*Math.sin(_),u[4*t+2]=Math.sin(g)*Math.sin(_),u[4*t+3]=Math.sin(g)*Math.cos(_);for(let e=0;e<2;e++)d[3*t+e]=Math.log(s*(.6+.6*c()));d[3*t+2]=Math.log(s*.15*(.5+.5*c())),f[t]=.35+.65*c();let v=h/60,y=.5+.5*Math.sin((e.e+r)/410)*Math.sin((e.n+o)/330);p[3*t]=(.32+.2*v+.1*y-.5)/n,p[3*t+1]=(.42+.15*y-.1*v-.5)/n,p[3*t+2]=(.25+.1*v+.04*c()-.5)/n;let b=t%ue;m.set(he.subarray(9*b,9*(b+1)),9*t)}return F({count:o,position:l,rotation:u,scale:d,alpha:f,dc:p,sh:m},{g:t,i,j:a}).payload}let Z=2**20,Q=self,$,Me=/* @__PURE__ */ new Map,Ne=/* @__PURE__ */ new Map,Pe=le(e=>Q.postMessage(e,[]));Q.onmessage=({data:e})=>{`fetched`in e?Pe.take(e):e.type===`init`?($=Fe(e),$.catch(()=>void 0)):e.type===`abort`?Ne.get(e.id)?.abort():Re(e)};async function Fe(e){return e.source===`synthetic`?{fetch:ve(),cache:await Ie({...e,cache:`none`}),base:e.base}:{fetch:e.source===`page`?Pe.fetch:t,cache:await Ie(e),base:e.base}}async function Ie({cache:e,shard:t,shards:n}){return e===`memory`?ne(256*Z):e===`none`?{get:async()=>void 0,put:async()=>void 0}:(t===0&&ie(n),await re(await Le()/n,t)??ne(256*Z))}async function Le(){try{let{quota:e}=await navigator.storage.estimate();return Math.min(4096*Z,e===void 0?1/0:e/2)}catch{return 4096*Z}}async function Re(t){let{id:n}=t,r=new AbortController;Ne.set(n,r);try{if(!$)throw Error(`stream worker used before init`);let e=await $;if(t.type===`idx`)Q.postMessage({id:n,value:await U(e,t.path)},[]);else{for await(let i of W(e,t.batch,Me,r.signal))Q.postMessage({id:n,page:i},ze(i));Q.postMessage({id:n,done:!0},[])}}catch(t){let r=t instanceof Error?t.message:String(t);Q.postMessage({id:n,error:r,missing:t instanceof e},[])}finally{Ne.delete(n)}}function ze({page:e}){let t=/* @__PURE__ */ new Set;for(let n of[e.geometry,e.colour,e.params,e.clusters])t.add(n.buffer);return[...t]}})();", Bt = typeof self < "u" && self.Blob && new Blob(["(self.URL || self.webkitURL).revokeObjectURL(self.location.href);", zt], { type: "text/javascript;charset=utf-8" });
-function Vt(e) {
+var Wt = "(function(){var e=class extends Error{name=`Missing`};let t=async(t,n,r)=>{let i=await fetch(t,n?{signal:r,headers:{Range:`bytes=${n[0]}-${n[1]-1}`}}:{signal:r});if(i.status===404)throw new e(`http 404 for ${t}`);if(i.status!==200&&i.status!==206)throw Error(`http ${i.status} for ${t}`);let a=new Uint8Array(await i.arrayBuffer());return n&&i.status===200?a.slice(n[0],n[1]):a},n=.28209479177387814,r=15.625,i=`GMIX`,a={position:0,alpha:6,rotationIndex:7,rotation:8,scale:11,dc:14,label:17},o={origin:0,step:3,scaleMin:6,scaleMax:9,dcMin:12,dcMax:15,shScale:18};async function s(e,t){let n=new ReadableStream({start(t){t.enqueue(e),t.close()}}).pipeThrough(t);return new Uint8Array(await new Response(n).arrayBuffer())}function c(e){return s(e,new DecompressionStream(`deflate-raw`))}function l(e){return s(e,new CompressionStream(`deflate-raw`))}async function u(e,t,n){let r=new DataView(e.buffer,e.byteOffset,e.byteLength);if(e.length<8||String.fromCharCode(...e.subarray(0,4))!==t)throw Error(`not a ${n} file`);let i=r.getUint16(4,!0);if(i!==1)throw Error(`${n} version ${i}; narcissus reads 1`);let a;try{a=await c(e.subarray(8))}catch{throw Error(`${n} body is not a valid deflate stream`)}return new DataView(a.buffer,a.byteOffset,a.byteLength)}function d(e,t){let n=``;for(let r=0;r<8;r++){let i=e.getUint8(t+r);n+=i.toString(16).padStart(2,`0`)}return n}function f(e,t){let n=/* @__PURE__ */ new Float32Array(6);for(let r=0;r<6;r++)n[r]=e.getFloat32(t+20+4*r,!0);return{g:e.getUint8(t),i:e.getUint8(t+1),j:e.getUint8(t+2),count:e.getUint32(t+4,!0),quadrants:[e.getUint32(t+8,!0),e.getUint32(t+12,!0),e.getUint32(t+16,!0)],box:n,offset:e.getUint32(t+44,!0),length:e.getUint32(t+48,!0)}}async function p(e){let t=await u(e,i,`.idx`);if(t.byteLength<40)throw Error(`.idx header is cut off`);let n=t.getUint16(32,!0),r=t.getUint8(34),a=t.getUint16(36,!0),o=40+n*52+r*9+a*11;if(t.byteLength!==o)throw Error(`.idx holds ${t.byteLength} bytes, its counts need ${o}`);let s=d(t,24),c={level:t.getUint8(0),e:t.getInt32(4,!0),n:t.getInt32(8,!0),pack:d(t,12),packSize:t.getUint32(20,!0),col:s===`0000000000000000`?null:s,rows:[],children:[],descendants:[]},l=40;for(let e=0;e<n;e++,l+=52)c.rows.push(f(t,l));for(let e=0;e<r;e++,l+=9)c.children.push({quadrant:t.getUint8(l),idx:d(t,l+1)});for(let e=0;e<a;e++,l+=11)c.descendants.push({depth:t.getUint8(l),column:t.getUint8(l+1),row:t.getUint8(l+2),idx:d(t,l+3)});return c}function m(e,t,n){return`u/${e.level}/${e.e}/${e.n}.${t}.${n}`}let h=/(?:^|\\/)u\\/(\\d+)\\/(-?\\d+)\\/(-?\\d+)\\.([0-9a-f]{16})\\.(?:idx|pack|col)$/;function g(e){let t=h.exec(e);return t?{level:Number(t[1]),e:Number(t[2]),n:Number(t[3]),hash:t[4]}:null}async function _(e){let t=await u(e,`GMCL`,`.col`);if(t.byteLength<60)throw Error(`.col header is cut off`);let n=t.getUint16(0,!0),r=60+12*n*n;if(t.byteLength!==r)throw Error(`.col holds ${t.byteLength} bytes, ${n} nodes need ${r}`);let i=new Float32Array(12*n*n),a=60;for(let e=0;e<12;e++){let r=t.getFloat32(12+4*e,!0)/127;for(let o=0;o<n;o++){let s=0;for(let c=0;c<n;c++,a++)s=s+t.getInt8(a)<<24>>24,i[(e*n+o)*n+c]=s*r}}return{n,pitch:t.getFloat32(4,!0),margin:t.getFloat32(8,!0),values:i}}function v(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}let y=Float64Array.from({length:256},(e,t)=>(t/255-.5)*Math.SQRT2);function b(e,t,n,r,i){let a=y[t],o=y[n],s=y[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 x(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 S(e){if(e.length<128)throw Error(`page payload is shorter than its header`);return new DataView(e.buffer,e.byteOffset,e.byteLength)}function C(e){let t=S(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,count:n,k:r,book:i}}function w(e){return[e.getUint32(4,!0),e.getUint32(8,!0),e.getUint32(12,!0)]}function T(e,t){let{view:n,count:r,k:i,book:s}=C(e),c=/* @__PURE__ */ new Float32Array(27);for(let e=0;e<27;e++)c[e]=n.getFloat32(20+4*e,!0);i===0&&c.fill(0,o.shScale);let l=new Uint32Array(r*4),u=new Float32Array(Math.ceil(r/256)*6),d=/* @__PURE__ */ new Float64Array(768);for(let e=0;e<3;e++){let t=c[o.scaleMin+e],n=c[o.scaleMax+e]-t;for(let r=0;r<256;r++)d[e*256+r]=Math.exp(t+r/255*n)}let f=c[o.step],p=c[o.step+1],m=c[o.step+2],h=128+a.position*r,g=128+a.alpha*r,_=128+a.rotationIndex*r,v=128+a.rotation*r,y=128+a.scale*r,S=/* @__PURE__ */ new Float64Array(4),T=/* @__PURE__ */ new Float64Array(3),O=0,k=0,A=0;for(let t=0,n=0;n<r;t++){let i=1/0,a=1/0,o=1/0,s=-1/0,c=-1/0,C=-1/0;for(let t=Math.min(n+256,r);n<t;n++){let t=e[h+n]|e[h+r+n]<<8;O=O+(t>>>1^-(t&1))&65535,t=e[h+2*r+n]|e[h+3*r+n]<<8,k=k+(t>>>1^-(t&1))&65535,t=e[h+4*r+n]|e[h+5*r+n]<<8,A=A+(t>>>1^-(t&1))&65535;let u=e[_+n],w=e[v+n],E=e[v+r+n],D=e[v+2*r+n],j=e[y+n],M=e[y+r+n],N=e[y+2*r+n],P=n*4;l[P]=O|k<<16,l[P+1]=A|e[g+n]<<16|u<<24,l[P+2]=w|E<<8|D<<16|j<<24,l[P+3]=M|N<<8,b(u,w,E,D,S),x(S,d[j],d[256+M],d[512+N],T);let F=O*f,I=k*p,L=A*m;i=Math.min(i,F-T[0]),a=Math.min(a,I-T[1]),o=Math.min(o,L-T[2]),s=Math.max(s,F+T[0]),c=Math.max(c,I+T[1]),C=Math.max(C,L+T[2])}u.set([i,a,o,s,c,C],t*6)}let j=t?D(e,r,i,s,l,c,t):E(e,r,i,s);return{count:r,quadrants:w(n),geometry:l,colour:j,params:c,clusters:u}}function E(e,t,n,r){let i=new Uint32Array(t*3),o=128+a.dc*t,s=128+a.label*t;for(let a=0;a<t;a++){let c=a*3;if(i[c]=e[o+a]|e[o+t+a]<<8|e[o+2*t+a]<<16,n===0)continue;let l=r+(e[s+a]|e[s+t+a]<<8)*9;i[c]|=e[l]<<24,i[c+1]=e[l+1]|e[l+2]<<8|e[l+3]<<16|e[l+4]<<24,i[c+2]=e[l+5]|e[l+6]<<8|e[l+7]<<16|e[l+8]<<24}return i}function D(e,t,r,i,s,c,l){let u=128+a.dc*t,d=128+a.label*t,f=new Int8Array(e.buffer,e.byteOffset+i,r*9),p=new Float32Array(t*3),m=new Float32Array(t*9),h=[1/0,1/0,1/0],g=[-1/0,-1/0,-1/0],_=/* @__PURE__ */ new Float32Array(9),y=/* @__PURE__ */ new Float32Array(12),b=c[o.origin],x=c[o.origin+1],S=c[o.step],C=c[o.step+1],w=/* @__PURE__ */ new Float64Array(768);for(let e=0;e<3;e++){let t=c[o.dcMin+e],n=c[o.dcMax+e]-t;for(let r=0;r<256;r++)w[e*256+r]=t+r/255*n}let T=new Float64Array(Math.max(r,1)*9);for(let e=0;e<r*9;e++)T[e]=f[e]/127*c[o.shScale+e%9];for(let i=0;i<t;i++){let a=s[i*4];v(l,b+(a&65535)*S,x+(a>>>16)*C,y);for(let r=0;r<3;r++){let a=i*3+r;p[a]=w[r*256+e[u+r*t+i]]+y[r]/n,h[r]=Math.min(h[r],p[a]),g[r]=Math.max(g[r],p[a])}let o=r>0?(e[d+i]|e[d+t+i]<<8)*9:0;for(let e=0;e<9;e++){let t=i*9+e;m[t]=T[o+e]+y[3+e],_[e]=Math.max(_[e],Math.abs(m[t]))}}for(let e=0;e<3;e++)c[o.dcMin+e]=t>0?h[e]:0,c[o.dcMax+e]=t>0?g[e]:0;c.set(_,o.shScale);let E=[0,1,2].map(e=>{let t=c[o.dcMax+e]-c[o.dcMin+e];return t>0?255/t:0}),D=Array.from(_,e=>e>0?127/e:0),O=[0,1,2].map(e=>c[o.dcMin+e]),k=new Uint32Array(t*3),A=new Uint8Array(k.buffer);for(let e=0;e<t;e++){let t=e*4*3;for(let n=0;n<3;n++){let r=Math.round((p[e*3+n]-O[n])*E[n]);A[t+n]=Math.min(255,Math.max(0,r))}for(let n=0;n<9;n++){let r=Math.round(m[e*9+n]*D[n]);A[t+3+n]=Math.min(127,Math.max(-127,r))}}return k}let O=(e,t,n)=>Math.min(n,Math.max(t,e));function k(e,t,n){return n>t?O(Math.round((e-t)/(n-t)*255),0,255):0}function A(e,t){return t>0?O(Math.round(e/t*127),-127,127):0}function j(e){return e&=1023,e=(e|e<<16)&50331903,e=(e|e<<8)&50393103,e=(e|e<<4)&51130563,(e|e<<2)&153391689}function M(e,t,n){return j(e>>6)|j(t>>6)<<1|j(n>>6)<<2}function N(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 P(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]=A(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>2048){let e=o.length/256,n=Array.from({length:256},(t,n)=>o[Math.floor(n*e)]);o.splice(0,o.length,...n);for(let e=0;e<t;e++){let t=1/0;for(let n=0;n<256;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 F(e,t){let{count:n,position:i,rotation:o,scale:s,alpha:c,dc:l,sh:u}=e,d=[1/0,1/0,1/0],f=[-1/0,-1/0,-1/0],p=[...d],m=[...f],h=[...d],g=[...f];for(let e=0;e<n;e++)for(let t=0;t<3;t++)d[t]=Math.min(d[t],i[e*3+t]),f[t]=Math.max(f[t],i[e*3+t]),p[t]=Math.min(p[t],s[e*3+t]),m[t]=Math.max(m[t],s[e*3+t]),h[t]=Math.min(h[t],l[e*3+t]),g[t]=Math.max(g[t],l[e*3+t]);let _=5e-4*2**t.g,v=Float32Array.from(d),y=Float32Array.from(d,(e,t)=>Math.max(_,(f[t]-e)/65535)),b=new Uint16Array(n*3);for(let e=0;e<n;e++)for(let t=0;t<3;t++){let n=(i[e*3+t]-v[t])/y[t];b[e*3+t]=O(Math.round(n),0,65535)}let S=r*2**t.g,C=(t.i+.5)*S,w=(t.j+.5)*S,T=new Uint8Array(n),E=new Float64Array(n);for(let e=0;e<n;e++){let t=+(i[e*3]>=C),n=+(i[e*3+1]>=w);T[e]=t+2*n,E[e]=T[e]*2**30+M(b[e*3],b[e*3+1],b[e*3+2])}let D=Uint32Array.from({length:n},(e,t)=>t).sort((e,t)=>E[e]-E[t]),A=[0,0,0];for(let e=1;e<4;e++)A[e-1]=T.filter(t=>t<e).length;let j=u?N(u,n):/* @__PURE__ */ new Float32Array(9),{book:F,labels:I}=u?P(u,n,j):{book:null,labels:null},L=F?F.length/9:0,R=17+(L>0?2:0),z=new Uint8Array(128+R*n+L*9),B=new DataView(z.buffer);B.setUint32(0,n,!0),A.forEach((e,t)=>B.setUint32(4+4*t,e,!0)),B.setUint16(16,L,!0),[...v,...y,...p,...m,...h,...g,...j].forEach((e,t)=>B.setFloat32(20+4*t,e,!0));let V=e=>128+e*n,H=new Float32Array([...d,...f]),U=/* @__PURE__ */ new Float64Array(4),W=/* @__PURE__ */ new Float64Array(3),G=[0,0,0];for(let e=0;e<n;e++){let t=D[e];for(let n=0;n<3;n++){let r=b[t*3+n]-G[n]<<16>>16,i=r<0?-2*r-1:2*r;G[n]=b[t*3+n],z[V(a.position+2*n)+e]=i&255,z[V(a.position+2*n+1)+e]=i>>8}z[V(a.alpha)+e]=O(Math.round(c[t]*255),0,255);let n=Math.hypot(...o.subarray(t*4,t*4+4));for(let e=0;e<4;e++)U[e]=o[t*4+e]/n;let r=0;for(let e=1;e<4;e++)Math.abs(U[e])>Math.abs(U[r])&&(r=e);let u=U[r]<0?-1:1;z[V(a.rotationIndex)+e]=r;for(let t=0,n=0;t<4;t++){if(t===r)continue;let i=Math.round((u*U[t]/Math.SQRT2+.5)*255);z[V(a.rotation+n++)+e]=O(i,0,255)}for(let n=0;n<3;n++)z[V(a.scale+n)+e]=k(s[t*3+n],p[n],m[n]),z[V(a.dc+n)+e]=k(l[t*3+n],h[n],g[n]);I&&(z[V(a.label)+e]=I[t]&255,z[V(a.label+1)+e]=I[t]>>8);let[d,f,_]=[0,1,2].map(e=>Math.exp(s[t*3+e]));x(U,d,f,_,W);for(let e=0;e<3;e++)H[e]=Math.min(H[e],i[t*3+e]-W[e]),H[3+e]=Math.max(H[3+e],i[t*3+e]+W[e])}return F&&z.set(new Uint8Array(F.buffer),V(R)),{payload:z,row:{g:t.g,i:t.i,j:t.j,count:n,quadrants:A,box:H,offset:0,length:0}}}function I(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 L(e,t,n){for(let r=0;r<4;r++)e[t+r]=n.charCodeAt(r)}function R(e){return Uint8Array.from({length:8},(t,n)=>parseInt(e.slice(2*n,2*n+2),16))}async function z(e,t){let n=await l(e),r=new Uint8Array(8+n.length);return L(r,0,t),new DataView(r.buffer).setUint16(4,1,!0),r.set(n,8),r}async function B(e){let{rows:t,children:n,descendants:r}=e,a=new Uint8Array(40+t.length*52+n.length*9+r.length*11),o=new DataView(a.buffer);o.setUint8(0,e.level),o.setInt32(4,e.e,!0),o.setInt32(8,e.n,!0),a.set(R(e.pack),12),o.setUint32(20,e.packSize,!0),e.col&&a.set(R(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)I(o,s,e),s+=52;for(let e of n)o.setUint8(s,e.quadrant),a.set(R(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),a.set(R(e.idx),s+3),s+=11;return z(a,i)}function V(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 H(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}}async function U(e,t){return p(await G(e,t))}async function*W(e,t,n,r){let i=t.col===null?null:te(e,t.col,n),a=await ee(e,t,r),o=await i;for(let[e,n]of t.pages.entries()){let t=await c(a[e]);r?.throwIfAborted(),yield{id:n.id,page:T(t,o)}}}async function G(e,t){let n=await e.cache.get(t);if(n)return n;let r=await e.fetch(e.base+t,null);return e.cache.put(t,r),r}async function ee(e,t,n){let r=t.pages.map(e=>`${t.pack}#${e.offset}+${e.length}`),i=await Promise.all(r.map(t=>e.cache.get(t)));if(n?.throwIfAborted(),i.every(e=>e!==void 0))return i;let a=await e.fetch(e.base+t.pack,[t.start,t.end],n);if(a.length!==t.end-t.start)throw Error(`${t.pack}: ${a.length} bytes for ${t.start}-${t.end}`);return t.pages.map((n,o)=>{let s=a.slice(n.offset-t.start,n.offset-t.start+n.length);return i[o]||e.cache.put(r[o],s),s})}function te(e,t,n){let r=n.get(t);if(r)n.delete(t);else{let i=G(e,t).then(_);i.catch(()=>{n.get(t)===i&&n.delete(t)}),r=i}if(n.set(t,r),n.size>64){let[e]=n.keys();n.delete(e)}return r}function ne(e){let t=/* @__PURE__ */ new Map,n=0;return{async get(e){let n=t.get(e);return n&&(t.delete(e),t.set(e,n)),n},async put(r,i){let a=t.get(r);if(a&&(t.delete(r),n-=a.length),!(i.length>e)){t.set(r,i),n+=i.length;for(let[r,i]of t){if(n<=e)break;t.delete(r),n-=i.length}}}}}async function re(e,t){let n;try{n=await(await ae()).getDirectoryHandle(String(t),{create:!0})}catch{return null}let r=/* @__PURE__ */ new Map,i=0,a=!1,o=(e,t)=>{i+=t-(r.get(e)??0),r.delete(e),r.set(e,t)},s=e=>{i-=r.get(e)??0,r.delete(e)},c=()=>{if(a)for(let[t,a]of r){if(i<=e)break;r.delete(t),i-=a,n.removeEntry(t).catch(()=>void 0)}};return ce(n).then(e=>{let t=[...r];r.clear(),i=0;for(let{name:t,size:n}of e.sort((e,t)=>e.time-t.time))o(t,n);for(let[e,n]of t)o(e,n);a=!0,c()}),{async get(e){let t=encodeURIComponent(e);if(a&&!r.has(t))return;let i=await oe(n,t);return i?o(t,i.length):s(t),i},async put(t,r){if(r.length===0||r.length>e)return;let i=encodeURIComponent(t);await se(n,i,r)&&(o(i,r.length),c())}}}async function ie(e){let t=new Set(Array.from({length:e},(e,t)=>String(t)));try{let e=await ae(),n=[];for await(let[r,i]of e.entries())(i.kind!==`directory`||!t.has(r))&&n.push(r);let r={recursive:!0};for(let t of n)await e.removeEntry(t,r).catch(()=>void 0)}catch{}}async function ae(){return(await navigator.storage.getDirectory()).getDirectoryHandle(`cache`,{create:!0})}async function oe(e,t){try{let n=await(await e.getFileHandle(t)).getFile();return n.size>0?new Uint8Array(await n.arrayBuffer()):void 0}catch{return}}async function se(e,t,n){let r;try{return r=await(await e.getFileHandle(t,{create:!0})).createWritable(),await r.write(n),await r.close(),!0}catch{return r?.abort().catch(()=>void 0),!1}}async function ce(e){let t=[];try{for await(let[n,r]of e.entries()){if(r.kind!==`file`)continue;let e=await r.getFile().catch(()=>null);e&&t.push({name:n,size:e.size,time:e.lastModified})}}catch{}return t}function le(t){let n=/* @__PURE__ */ new Map,r=0;return{fetch:(i,a,o)=>new Promise((s,c)=>{if(o?.aborted)return c(o.reason);let l=++r,u=()=>{n.delete(l),t({unfetch:l}),c(o.reason)};n.set(l,t=>{o?.removeEventListener(`abort`,u),`bytes`in t?s(t.bytes):c(t.missing?new e(t.error):Error(t.error))}),o?.addEventListener(`abort`,u,{once:!0}),t({fetch:l,url:i,range:a})}),take(e){let t=n.get(e.fetched);n.delete(e.fetched),t?.(e)}}}let K=16384,ue=1408,de=65535,q=324121,fe=.4,pe=[[12,1/7e3,0,1/9e3,.7],[9,1/2300,1.1,1/3100,.4],[6,1/800,.3,1/1100,2],[3,1/150,.9,1/210,1.7]],me=pe.reduce((e,[t,n,,r])=>e+t*(n+r),0),he=Float32Array.from({length:ue*9},(e,t)=>{let n=Math.floor(t/9),r=t%9,i=(n*(37+2*r)+11*r)%255-127;return r===0&&(i=n%255-127),r===1&&(i=20*Math.floor(n/255)-50),i/127*.04}),J=new TextEncoder,ge={version:1,crs:`synthetic`,height:`synthetic`,leaf:250,roots:[512e4,6144e3].map(e=>({level:12,e:0,n:e})).map(e=>({...e,idx:m(e,Y(e,`idx`),`idx`)})),extent:{e:[44e4,9e5],n:[605e4,641e4],h:[0,80]}},_e=J.encode(JSON.stringify(ge));function ve(){return async(t,n)=>{if(t.endsWith(`world.json`))return be(_e,n);let r=g(t),i=t.slice(t.lastIndexOf(`.`)+1);if(!r||i!==`idx`&&i!==`pack`||!xe(r)||r.hash!==Y(r,i))throw new e(`no file ${t}`);return i===`idx`?be(await De(r),n):Oe(r,n,t)}}function ye(e,t){let n=30;for(let[r,i,a,o,s]of pe)n+=r*Math.sin(i*e+a)*Math.sin(o*t+s);return n}function be(e,t){return t?e.slice(t[0],t[1]):e.slice()}function Y(e,t){return V(J.encode(`${e.level}/${e.e}/${e.n}.${t}`))}function X(e,t,n){let{e:r,n:i}=ge.extent;return e<r[1]&&e+n>r[0]&&t<i[1]&&t+n>i[0]}function xe({level:e,e:t,n}){let r=250*2**e;return e<=12&&t%r===0&&n%r===0&&X(t,n,r)}function Se(e){return e===0?[1,0]:e===12?[16,15,14,13]:[e+1]}function Ce(e){let t=0;for(let n=0;n<8;n++)t|=(e>>2*n&1)<<n;return t}function we(e){let t=[];for(let n of Se(e.level)){let i=r*2**n,a=250*2**e.level/i;for(let r=0;r<a*a;r++){let a=Ce(r),o=Ce(r>>1);X(e.e+a*i,e.n+o*i,i)&&t.push({g:n,i:a,j:o})}}return t}function Te(e,t){let n=e.level-t,r=250*2**n,i=[];for(let a=0;n>=0&&a<2**t;a++)for(let o=0;o<2**t;o++){let t={level:n,e:e.e+o*r,n:e.n+a*r};X(t.e,t.n,r)&&i.push({column:o,row:a,unit:t})}return i}function Ee(e,{g:t,i:n,j:i},a){let o=r*2**t,s=o/128,c=3*1.2*s,l=1.17*s,u=ye(e.e+(n+.5)*o,e.n+(i+.5)*o),d=me*o/2,f=Float32Array.of(n*o-c,i*o-c,Math.max(0,u-d)-l,(n+1)*o+c,(i+1)*o+c,Math.min(60,u+d)+l),p=K/4;return{g:t,i:n,j:i,count:K,quadrants:[p,2*p,3*p],box:f,offset:a,length:q}}function De(e){let t=we(e),n=[];for(let{column:t,row:r,unit:i}of Te(e,1))n.push({quadrant:t+2*r,idx:Y(i,`idx`)});let r=[];for(let t of[2,3])for(let{column:n,row:i,unit:a}of Te(e,t))r.push({depth:t,column:n,row:i,idx:Y(a,`idx`)});return B({level:e.level,e:e.e,n:e.n,pack:Y(e,`pack`),packSize:t.length*324173+16,col:null,rows:t.map((t,n)=>Ee(e,t,n*q)),children:n,descendants:r})}function Oe(e,t,n){let r=we(e);if(!t||t[0]%q!=0||t[1]%q!=0||t[0]>=t[1]||t[1]>r.length*q)throw Error(`${n}: the synthetic world serves whole pages only`);let i=new Uint8Array(t[1]-t[0]);for(let n=0;n<i.length;n+=q)ke(je(e,r[(t[0]+n)/q]),i,n);return i}function ke(e,t,n){let r=n;for(let n=0;n<e.length;n+=de){let i=Math.min(de,e.length-n);t[r]=+(n+i===e.length),t[r+1]=i&255,t[r+2]=i>>8,t[r+3]=~i&255,t[r+4]=~i>>8&255,t.set(e.subarray(n,n+i),r+5),r+=5+i}}let Ae=e=>H(parseInt(V(J.encode(e)).slice(8),16));function je(e,{g:t,i,j:a}){let o=K,s=r*2**t/128,c=Ae(`${e.level}/${e.e}/${e.n}/${t}/${i}/${a}`),l=new Float64Array(3*o),u=new Float32Array(4*o),d=new Float32Array(3*o),f=new Float32Array(o),p=new Float32Array(3*o),m=new Float32Array(9*o);for(let t=0;t<o;t++){let r=(i*128+t%128+.5+fe*(2*c()-1))*s,o=(a*128+Math.floor(t/128)+.5+fe*(2*c()-1))*s,h=ye(e.e+r,e.n+o);l[3*t]=r,l[3*t+1]=o,l[3*t+2]=h;let g=Math.PI*c(),_=.1/2*(2*c()-1);u[4*t]=Math.cos(g)*Math.cos(_),u[4*t+1]=Math.cos(g)*Math.sin(_),u[4*t+2]=Math.sin(g)*Math.sin(_),u[4*t+3]=Math.sin(g)*Math.cos(_);for(let e=0;e<2;e++)d[3*t+e]=Math.log(s*(.6+.6*c()));d[3*t+2]=Math.log(s*.15*(.5+.5*c())),f[t]=.35+.65*c();let v=h/60,y=.5+.5*Math.sin((e.e+r)/410)*Math.sin((e.n+o)/330);p[3*t]=(.32+.2*v+.1*y-.5)/n,p[3*t+1]=(.42+.15*y-.1*v-.5)/n,p[3*t+2]=(.25+.1*v+.04*c()-.5)/n;let b=t%ue;m.set(he.subarray(9*b,9*(b+1)),9*t)}return F({count:o,position:l,rotation:u,scale:d,alpha:f,dc:p,sh:m},{g:t,i,j:a}).payload}let Z=2**20,Q=self,$,Me=/* @__PURE__ */ new Map,Ne=/* @__PURE__ */ new Map,Pe=le(e=>Q.postMessage(e,[]));Q.onmessage=({data:e})=>{`fetched`in e?Pe.take(e):e.type===`init`?($=Fe(e),$.catch(()=>void 0)):e.type===`abort`?Ne.get(e.id)?.abort():Re(e)};async function Fe(e){return e.source===`synthetic`?{fetch:ve(),cache:await Ie({...e,cache:`none`}),base:e.base}:{fetch:e.source===`page`?Pe.fetch:t,cache:await Ie(e),base:e.base}}async function Ie({cache:e,shard:t,shards:n}){return e===`memory`?ne(256*Z):e===`none`?{get:async()=>void 0,put:async()=>void 0}:(t===0&&ie(n),await re(await Le()/n,t)??ne(256*Z))}async function Le(){try{let{quota:e}=await navigator.storage.estimate();return Math.min(4096*Z,e===void 0?1/0:e/2)}catch{return 4096*Z}}async function Re(t){let{id:n}=t,r=new AbortController;Ne.set(n,r);try{if(!$)throw Error(`stream worker used before init`);let e=await $;if(t.type===`idx`)Q.postMessage({id:n,value:await U(e,t.path)},[]);else{for await(let i of W(e,t.batch,Me,r.signal))Q.postMessage({id:n,page:i},ze(i));Q.postMessage({id:n,done:!0},[])}}catch(t){let r=t instanceof Error?t.message:String(t);Q.postMessage({id:n,error:r,missing:t instanceof e},[])}finally{Ne.delete(n)}}function ze({page:e}){let t=/* @__PURE__ */ new Set;for(let n of[e.geometry,e.colour,e.params,e.clusters])t.add(n.buffer);return[...t]}})();", Gt = typeof self < "u" && self.Blob && new Blob(["(self.URL || self.webkitURL).revokeObjectURL(self.location.href);", Wt], { type: "text/javascript;charset=utf-8" });
+function Kt(e) {
 	let t;
 	try {
-		if (t = Bt && (self.URL || self.webkitURL).createObjectURL(Bt), !t) throw "";
+		if (t = Gt && (self.URL || self.webkitURL).createObjectURL(Gt), !t) throw "";
 		let n = new Worker(t, { name: e?.name });
 		return n.addEventListener("error", () => {
 			(self.URL || self.webkitURL).revokeObjectURL(t);
 		}), n;
 	} catch {
-		return new Worker("data:text/javascript;charset=utf-8," + encodeURIComponent(zt), { name: e?.name });
+		return new Worker("data:text/javascript;charset=utf-8," + encodeURIComponent(Wt), { name: e?.name });
 	}
 }
 //#endregion
 //#region src/engine/stream/loader.ts
-var Ht = class {
+var qt = class {
 	#e;
 	#t = /* @__PURE__ */ new Map();
 	#n = 0;
 	constructor(e) {
 		let { base: t, cache: n, source: r, workers: i } = e;
 		this.#e = Array.from({ length: i }, (e, a) => {
-			let o = new Vt(), s = { worker: o }, c = typeof r == "function" ? Rt(r, (e, t) => o.postMessage(e, t)) : void 0;
+			let o = new Kt(), s = { worker: o }, c = typeof r == "function" ? Ut(r, (e, t) => o.postMessage(e, t)) : void 0;
 			o.onmessage = ({ data: e }) => {
 				"id" in e ? this.#i(e) : c?.(e);
 			}, o.onerror = () => this.#a(s);
@@ -2395,8 +2449,8 @@ var Ht = class {
 		return this.#r(this.#e[0], t);
 	}
 	batch(e, t, n) {
-		if (t.aborted) return Promise.reject(Wt());
-		let r = this.#e[Ut(`${e.pack}#${e.window}`, this.#e.length)], i = {
+		if (t.aborted) return Promise.reject(Yt());
+		let r = this.#e[Jt(`${e.pack}#${e.window}`, this.#e.length)], i = {
 			type: "batch",
 			id: ++this.#n,
 			batch: e
@@ -2405,7 +2459,7 @@ var Ht = class {
 	}
 	destroy() {
 		for (let { worker: e } of this.#e) e.terminate();
-		for (let e of this.#t.values()) e.reject(Wt());
+		for (let e of this.#t.values()) e.reject(Yt());
 	}
 	#r(e, t, n, r) {
 		if (e.error) return Promise.reject(e.error);
@@ -2417,7 +2471,7 @@ var Ht = class {
 				s(), e.worker.postMessage({
 					type: "abort",
 					id: i
-				}), o(Wt());
+				}), o(Yt());
 			};
 			this.#t.set(i, {
 				slot: e,
@@ -2440,90 +2494,90 @@ var Ht = class {
 		for (let t of this.#t.values()) t.slot === e && t.reject(e.error);
 	}
 };
-function Ut(e, t) {
+function Jt(e, t) {
 	let n = 2166136261;
 	for (let t = 0; t < e.length; t++) n = Math.imul(n ^ e.charCodeAt(t), 16777619);
 	return (n >>> 0) % t;
 }
-function Wt() {
+function Yt() {
 	return new DOMException("The request was aborted.", "AbortError");
 }
 //#endregion
 //#region src/engine/engine.ts
-var Gt = class extends Error {
+var Xt = class extends Error {
 	constructor() {
 		super("This viewer needs WebGPU. Update to the latest Chrome, Edge, Safari or Firefox."), this.name = "NoWebGpu";
 	}
 };
-async function Kt(e, t) {
+async function Zt(e, t) {
 	let n = await g();
-	if (!n) throw new Gt();
+	if (!n) throw new Xt();
 	let r = e.getContext("webgpu");
-	if (!r) throw n.device.destroy(), new Gt();
+	if (!r) throw n.device.destroy(), new Xt();
 	r.configure({
 		device: n.device,
 		format: n.format,
 		alphaMode: "opaque"
 	}), (t.cache ?? "opfs") === "opfs" && navigator.storage?.persist().catch(() => !1);
 	let { source: i = "http" } = t;
-	return new vn(e, n, r, t, i === "synthetic" ? (await import("./synthetic-DO8oIw_x.js")).synthetic() : i === "http" ? u : i);
+	return new Cn(e, n, r, t, i === "synthetic" ? (await import("./synthetic-DO8oIw_x.js")).synthetic() : i === "http" ? u : i);
 }
-var W = .2, qt = 25165824, Jt = 3.25, Yt = 2, Xt = 1024, Zt = 2048, Qt = 100, $t = 2, en = 300, tn = 100, nn = 250, rn = 300, an = 1e3, on = 400, sn = 5e3, cn = 60, G = Math.PI / 180, K = "The viewer was closed.", ln = "The layers hold more splats than this device can.", un = [
+var G = .2, Qt = 25165824, $t = 3.25, en = 2, tn = 1024, nn = 2048, rn = 100, an = 2, on = 300, sn = 100, cn = 250, ln = 300, un = 1e3, dn = 400, fn = 5e3, pn = 60, K = Math.PI / 180, q = "The viewer was closed.", mn = "The layers hold more splats than this device can.", hn = [
 	1,
 	1,
 	1,
 	1
-], dn = "Another world was opened.";
-function q(e, t) {
+], gn = "Another world was opened.";
+function J(e, t) {
 	let n = Math.min(t.maxStorageBufferBindingSize, t.maxBufferSize), r = (t, r) => {
 		let i = Math.ceil(e * t / 256) * 256;
 		return Math.min(i, Math.floor(n / r / 256) * 256);
 	};
 	return {
-		pool: r(Jt, 16),
-		frame: r(Yt, 24)
+		pool: r($t, 16),
+		frame: r(en, 24)
 	};
 }
-function fn(e, t) {
+function _n(e, t) {
 	let [n, r, i] = t;
-	if (Math.hypot(n - e[0], r - e[1], i - e[2]) <= Zt) return e;
-	let a = (e) => Math.round(e / Xt) * Xt;
+	if (Math.hypot(n - e[0], r - e[1], i - e[2]) <= nn) return e;
+	let a = (e) => Math.round(e / tn) * tn;
 	return [
 		a(n),
 		a(r),
 		a(i)
 	];
 }
-function pn(e, t, n, r, i, a) {
+function vn(e, t, n, r, i, a) {
 	let o = 2 * e[0] / t[0] - 1, s = 1 - 2 * e[1] / t[1], c = [
 		n * o / r[0],
 		n * s / r[5],
 		-n
-	], [l, u, d] = oe(ae(/* @__PURE__ */ new Float64Array(16), i), c);
+	], [l, u, d] = ce(se(/* @__PURE__ */ new Float64Array(16), i), c);
 	return [
 		l + a[0],
 		u + a[1],
 		d + a[2]
 	];
 }
-function mn(e) {
+function yn(e) {
 	if (!e.length || !e.every((e) => e.length === 3 && e.every(Number.isFinite))) throw Error("Give at least one point, each three finite numbers.");
 	return e;
 }
-function hn(e, t) {
+function bn(e, t) {
 	return [
 		e.e - t[0],
 		e.n - t[1],
 		e.h - t[2]
 	];
 }
-function gn(e, t) {
-	e.push(t), e.length > cn && e.shift();
+function xn(e, t) {
+	e.push(t), e.length > pn && e.shift();
 }
-function _n({ visible: e, opacity: t }) {
+function Sn({ visible: e, opacity: t }) {
 	return e ? Math.round(t * 255) * 16843009 >>> 0 : 0;
 }
-var vn = class {
+var Cn = class {
 	#e;
 	#t;
 	#n;
@@ -2534,8 +2588,8 @@ var vn = class {
 	#s;
 	#c;
 	#l;
-	#u = new ht();
-	#d = new et();
+	#u = new yt();
+	#d = new it();
 	#f = (e) => this.#s.has(e);
 	#p = null;
 	#m = null;
@@ -2617,8 +2671,8 @@ var vn = class {
 			e.height,
 			1
 		], this.#R = [Math.max(1, e.width), Math.max(1, e.height)];
-		let { pool: a, frame: o } = q(this.#me, t.device.limits);
-		this.#s = new ee(t.device, a), this.#c = new Ze(t, n, this.#s, o), this.#l = o, t.device.lost.then((e) => {
+		let { pool: a, frame: o } = J(this.#me, t.device.limits);
+		this.#s = new ne(t.device, a), this.#c = new tt(t, n, this.#s, o), this.#l = o, t.device.lost.then((e) => {
 			if (!this.#fe) {
 				this.#pe = !0, cancelAnimationFrame(this.#z);
 				for (let t of this.#se) t(e.message || e.reason);
@@ -2626,34 +2680,34 @@ var vn = class {
 		});
 	}
 	async open(e) {
-		if (this.#fe) throw Error(K);
+		if (this.#fe) throw Error(q);
 		let t = ++this.#_, r = () => {
-			if (this.#fe) throw Error(K);
-			if (t !== this.#_) throw Error(dn);
+			if (this.#fe) throw Error(q);
+			if (t !== this.#_) throw Error(gn);
 		}, { cache: i = "opfs", source: o = "http" } = this.#r;
 		o === "http" && (e = new URL(e, document.baseURI).href);
 		let s = await this.#i(e, null), c = a(JSON.parse(new TextDecoder().decode(s)));
 		r();
-		let l = new Ht({
+		let l = new qt({
 			base: n(e),
 			workers: Math.min(6, Math.max(2, navigator.hardwareConcurrency - 2)),
 			cache: i,
 			source: o
-		}), u = new ut(c);
+		}), u = new mt(c);
 		try {
 			let e = await Promise.all(c.roots.map((e) => l.idx(e.idx)));
 			r(), e.forEach((e, t) => u.add(e, c.roots[t].idx));
 		} catch (e) {
 			throw l.destroy(), e;
 		}
-		return this.#g?.destroy(), this.#g = null, this.#h?.destroy(), this.#p = e, this.#m = u, this.#h = l, this.#H = null, this.#u = new ht(), this.#d = new et(), this.#s.clear(), this.#g = this.#ve(u, l), this.#G = !0, this.requestFrame(), c;
+		return this.#g?.destroy(), this.#g = null, this.#h?.destroy(), this.#p = e, this.#m = u, this.#h = l, this.#H = null, this.#u = new yt(), this.#d = new it(), this.#s.clear(), this.#g = this.#ve(u, l), this.#G = !0, this.requestFrame(), c;
 	}
 	async addLayer(e, t) {
-		if (this.#fe) throw Error(K);
-		let n = await Qe("bytes" in e ? e.bytes : await this.#i(e.url, null), t);
-		if (this.#fe) throw Error(K);
+		if (this.#fe) throw Error(q);
+		let n = await nt("bytes" in e ? e.bytes : await this.#i(e.url, null), t);
+		if (this.#fe) throw Error(q);
 		let r = n.reduce((e, { page: t }) => e + d(t.count), 0), i = this.#t.device.limits;
-		if (q(this.#me, i).pool + this.#S + r > q(Infinity, i).pool) throw Error(ln);
+		if (J(this.#me, i).pool + this.#S + r > J(Infinity, i).pool) throw Error(mn);
 		this.#S += r, this.#ge();
 		let a = ++this.#b, o = (e) => this.#g?.protects(e) ?? !1, s = () => this.#be(), c = !0, l = 1, u = () => {
 			if (!(this.#fe || !this.#y.delete(a))) {
@@ -2662,7 +2716,7 @@ var vn = class {
 			}
 		}, f = {
 			splats: n.reduce((e, { page: t }) => e + t.count, 0),
-			box: $e(n.map(({ box: e }) => e)),
+			box: rt(n.map(({ box: e }) => e)),
 			get visible() {
 				return c;
 			},
@@ -2683,7 +2737,7 @@ var vn = class {
 		this.#y.set(a, p);
 		for (let { page: e, box: r } of n) {
 			let n = --this.#x;
-			if (!this.#s.add(n, e, t, o, a)) throw u(), Error(ln);
+			if (!this.#s.add(n, e, t, o, a)) throw u(), Error(mn);
 			p.pages.push({
 				id: n,
 				count: e.count,
@@ -2693,7 +2747,7 @@ var vn = class {
 		return s(), this.#C.set(f, a), f;
 	}
 	addMask({ polygon: e, z: t = [-Infinity, Infinity], targets: n }) {
-		if (this.#fe) throw Error(K);
+		if (this.#fe) throw Error(q);
 		if (e.length < 3 || !e.flat().every(Number.isFinite)) throw Error("A mask needs three or more corners, each two finite numbers.");
 		let r = new Set(n.map((e) => e === "world" ? 0 : this.#C.get(e) ?? -1)), i = this.#s, a = {
 			polygon: Float64Array.from(e.flat()),
@@ -2714,8 +2768,8 @@ var vn = class {
 		};
 	}
 	addLine(e, t = {}) {
-		let { colour: n = un, width: r = 2, closed: i = !1, occlude: a = !0 } = t, o = (e) => {
-			mn(e);
+		let { colour: n = hn, width: r = 2, closed: i = !1, occlude: a = !0 } = t, o = (e) => {
+			yn(e);
 			let t = i && e.length > 2 ? [...e, e[0]] : e;
 			return (t.length > 1 ? t.slice(1).map((e, n) => [t[n], e]) : [[t[0], t[0]]]).map(([e, t]) => ({
 				a: e,
@@ -2748,7 +2802,7 @@ var vn = class {
 		};
 	}
 	toScreen([e, t, n]) {
-		let r = this.#O, [i, a] = this.#L, o = this.#j, s = ne(/* @__PURE__ */ new Float64Array(16), hn(r, o), r.yaw * G, r.pitch * G), c = re(/* @__PURE__ */ new Float64Array(16), r.fov * G, i / Math.max(1, a), W, this.#a.viewDistance), [l, u, , d] = oe(N(/* @__PURE__ */ new Float64Array(16), c, s), [
+		let r = this.#O, [i, a] = this.#L, o = this.#j, s = ie(/* @__PURE__ */ new Float64Array(16), bn(r, o), r.yaw * K, r.pitch * K), c = ae(/* @__PURE__ */ new Float64Array(16), r.fov * K, i / Math.max(1, a), G, this.#a.viewDistance), [l, u, , d] = ce(P(/* @__PURE__ */ new Float64Array(16), c, s), [
 			e - o[0],
 			t - o[1],
 			n - o[2]
@@ -2758,9 +2812,9 @@ var vn = class {
 	setCamera(e) {
 		if (this.#fe) return;
 		let t = performance.now(), n = t - this.#k, r = this.#O, i = this.#A;
-		if (n > nn) i.fill(0);
+		if (n > cn) i.fill(0);
 		else if (n > 0) {
-			let t = 1 - Math.exp(-n / tn);
+			let t = 1 - Math.exp(-n / sn);
 			i[0] += t * ((e.e - r.e) / n - i[0]), i[1] += t * ((e.n - r.n) / n - i[1]), i[2] += t * ((e.h - r.h) / n - i[2]);
 		}
 		this.#k = t, this.#O = { ...e }, this.#W = !0, this.#de || this.requestFrame();
@@ -2811,8 +2865,8 @@ var vn = class {
 	stats() {
 		let e = this.#s, t = this.#g, n = this.#c.stats();
 		return {
-			frameMs: kt(this.#$, .5),
-			cpuMs: kt(this.#ee, .5),
+			frameMs: Pt(this.#$, .5),
+			cpuMs: Pt(this.#ee, .5),
 			gpuMs: n.gpuMs,
 			passes: n.passes,
 			drawn: n.drawn,
@@ -2849,7 +2903,7 @@ var vn = class {
 	}
 	warm() {
 		let e = performance.now();
-		e - this.#X < an || (this.#Z = e + on, this.requestFrame());
+		e - this.#X < un || (this.#Z = e + dn, this.requestFrame());
 	}
 	onFrame(e) {
 		return this.#ce.add(e), () => this.#ce.delete(e);
@@ -2891,30 +2945,30 @@ var vn = class {
 		return this.#o.budget;
 	}
 	#he() {
-		let { budget: e, budgetRange: t = [e, e] } = this.#a, n = Math.floor(q(Infinity, this.#t.device.limits).frame / Yt), r = (e) => Math.max(1, Math.min(e, n));
-		return new At(r(e), [r(t[0]), r(t[1])]);
+		let { budget: e, budgetRange: t = [e, e] } = this.#a, n = Math.floor(J(Infinity, this.#t.device.limits).frame / en), r = (e) => Math.max(1, Math.min(e, n));
+		return new Ft(r(e), [r(t[0]), r(t[1])]);
 	}
 	#ge() {
-		let { pool: e, frame: t } = q(this.#me, this.#t.device.limits), n = e + this.#S;
+		let { pool: e, frame: t } = J(this.#me, this.#t.device.limits), n = e + this.#S;
 		(n > this.#s.capacity || t > this.#l) && this.#_e(n, t), this.#G = !0, this.requestFrame();
 	}
 	#_e(e, t) {
 		this.#s.grow(e), this.#c.destroy();
-		let n = new Ze(this.#t, this.#n, this.#s, t);
+		let n = new tt(this.#t, this.#n, this.#s, t);
 		n.resize(...this.#R);
 		for (let e of this.#te) e.off = n.shade(e.hook);
 		for (let e of this.#ne) e.off = n.post(e.hook);
 		this.#c = n, this.#l = t, this.#ie = null, this.#D = !0;
 	}
 	#ve(e, t) {
-		return new Lt(e, t, this.#s, () => {
+		return new Ht(e, t, this.#s, () => {
 			this.#q = !0, this.requestFrame();
 		}, this.#ye);
 	}
 	#ye = () => {
 		let e = this.#p, t = this.#m;
 		this.#v || this.#fe || e === null || (this.#v = !0, this.open(e).then(() => this.#v = !1, () => {
-			this.#v = !1, this.#m === t && setTimeout(this.#ye, sn);
+			this.#v = !1, this.#m === t && setTimeout(this.#ye, fn);
 		}));
 	};
 	#be() {
@@ -2930,16 +2984,16 @@ var vn = class {
 			0,
 			0
 		], r = 0;
-		for (let { layer: i, pages: a } of this.#y.values()) if (_n(i)) for (let { count: i, box: o } of a) {
+		for (let { layer: i, pages: a } of this.#y.values()) if (Sn(i)) for (let { count: i, box: o } of a) {
 			for (let r = 0; r < 3; r++) t[r] = o[r] - e[r], n[r] = o[r + 3] - e[r];
-			je(this.#I, t, n) && (r += i);
+			Ne(this.#I, t, n) && (r += i);
 		}
 		return r;
 	}
 	#Se() {
 		let e = [];
 		for (let { layer: t, pages: n } of this.#y.values()) {
-			let r = _n(t);
+			let r = Sn(t);
 			if (r) for (let { id: t } of n) e.push({
 				id: t,
 				factors: r
@@ -2958,12 +3012,12 @@ var vn = class {
 		};
 	}
 	#we() {
-		let [e, t, n] = this.#L, r = Ot(e, t, n, this.#o.scale), i = Math.max(1, Math.round(e * r)), a = Math.max(1, Math.round(t * r));
+		let [e, t, n] = this.#L, r = Nt(e, t, n, this.#o.scale), i = Math.max(1, Math.round(e * r)), a = Math.max(1, Math.round(t * r));
 		(i !== this.#R[0] || a !== this.#R[1]) && (this.#R = [i, a], this.#e.width = i, this.#e.height = a, this.#c.resize(i, a), this.#G = !0, this.#D = !0, this.requestFrame());
 	}
 	#Te = (e) => {
 		if (this.#z = 0, !(this.#fe || this.#pe)) {
-			if (this.#B >= $t) this.#V = !0;
+			if (this.#B >= an) this.#V = !0;
 			else {
 				this.#de = !0;
 				for (let t of this.#ce) t(e);
@@ -2976,33 +3030,33 @@ var vn = class {
 	#Ee(e) {
 		let t = performance.now(), n = this.#o, r = this.#s, i = this.#O, [a, o] = this.#R, s = this.#a.viewDistance, c = this.#W;
 		this.#W = !1;
-		let l = fn(this.#j, [
+		let l = _n(this.#j, [
 			i.e,
 			i.n,
 			i.h
 		]);
 		l !== this.#j && (this.#j = l, r.setOrigin(l), this.#D = !0);
-		let u = hn(i, l);
-		ne(this.#M, u, i.yaw * G, i.pitch * G), re(this.#N, i.fov * G, a / o, W, s);
+		let u = bn(i, l);
+		ie(this.#M, u, i.yaw * K, i.pitch * K), ae(this.#N, i.fov * K, a / o, G, s);
 		let d = {
 			time: t,
 			width: a,
 			height: o,
 			view: new Float32Array(this.#M),
 			proj: new Float32Array(this.#N),
-			near: W,
+			near: G,
 			far: s,
 			camera: Float32Array.from(u),
 			origin: l
 		};
-		Ae(this.#I, N(this.#F, d.proj, d.view));
+		Me(this.#I, P(this.#F, d.proj, d.view));
 		let f = this.#m, p = this.#g, m = this.#q || this.#G || this.#J, h = this.#H, g = h;
 		if (f && p) {
-			let e = !p.idle && t - this.#U >= Qt, n = this.#G || this.#q || this.#J || this.#K;
+			let e = !p.idle && t - this.#U >= rn, n = this.#G || this.#q || this.#J || this.#K;
 			(!g || c || e || n) && (g = this.#De(f, t, c));
 		}
 		let _ = this.#Y, v = this.#J;
-		if (g && p && (g !== h && (m || !h || g.cut.length !== h.cut.length || g.cut.some((e, t) => e !== h.cut[t])) && ({drawn: _, fading: v} = this.#d.update(g.cut, this.#f, t, this.#me)), p.update(g, new Set(_.map((e) => e.id)), t)), r.upload(qt) > 0 && (this.#q = !0), _ !== this.#Y || this.#q || this.#w) {
+		if (g && p && (g !== h && (m || !h || g.cut.length !== h.cut.length || g.cut.some((e, t) => e !== h.cut[t])) && ({drawn: _, fading: v} = this.#d.update(g.cut, this.#f, t, this.#me)), p.update(g, new Set(_.map((e) => e.id)), t)), r.upload(Qt) > 0 && (this.#q = !0), _ !== this.#Y || this.#q || this.#w) {
 			this.#w = !1;
 			let e = this.#Se();
 			r.draw(e.length ? _.concat(e) : _);
@@ -3034,8 +3088,8 @@ var vn = class {
 			origin: this.#j,
 			width: a / s,
 			height: o / s,
-			tan: Math.tan(r.fov * G / 2),
-			near: W,
+			tan: Math.tan(r.fov * K / 2),
+			near: G,
 			far: this.#a.viewDistance
 		}, u = {
 			...l,
@@ -3052,20 +3106,20 @@ var vn = class {
 		let t = this.#A;
 		if (t.every((e) => e === 0)) return;
 		let n = this.#O, r = [
-			n.e + t[0] * en - e.origin[0],
-			n.n + t[1] * en - e.origin[1],
-			n.h + t[2] * en - e.origin[2]
+			n.e + t[0] * on - e.origin[0],
+			n.n + t[1] * on - e.origin[1],
+			n.h + t[2] * on - e.origin[2]
 		];
 		return {
 			...e,
-			view: ne(this.#P, r, n.yaw * G, n.pitch * G)
+			view: ie(this.#P, r, n.yaw * K, n.pitch * K)
 		};
 	}
 	#ke() {
 		let e = this.#ie, t = this.#M.slice(), [n, r] = this.#L, i = [e.width, e.height];
 		for (let { x: a, y: o, resolve: s } of this.#re.splice(0)) {
 			let c = [a * i[0] / Math.max(1, n), o * i[1] / Math.max(1, r)], l = (n) => n && {
-				point: pn(c, i, n.depth, e.proj, t, e.origin),
+				point: vn(c, i, n.depth, e.proj, t, e.origin),
 				normal: n.normal,
 				layer: this.#y.get(n.layer)?.layer ?? null
 			};
@@ -3099,22 +3153,22 @@ var vn = class {
 		};
 	}
 	#Ne(e, t, n) {
-		let r = this.#o, { gpuMs: i } = this.#c.stats(), a = e - this.#X, o = a <= Math.max(nn, 2 * i, 2 * t);
-		o && gn(this.#$, a), gn(this.#ee, t), this.#X = e;
+		let r = this.#o, { gpuMs: i } = this.#c.stats(), a = e - this.#X, o = a <= Math.max(cn, 2 * i, 2 * t);
+		o && xn(this.#$, a), xn(this.#ee, t), this.#X = e;
 		let s = r.budget;
-		r.sample(a, e, o && n, this.#H?.planned ?? 0) && (this.#we(), r.budget !== s && this.#ge()), n ? this.#Q = e : r.scale < 1 && e - this.#Q > rn && (r.full(), this.#we());
+		r.sample(a, e, o && n, this.#H?.planned ?? 0) && (this.#we(), r.budget !== s && this.#ge()), n ? this.#Q = e : r.scale < 1 && e - this.#Q > ln && (r.full(), this.#we());
 	}
-}, yn = 45, bn = {
+}, wn = 45, Tn = {
 	yaw: 0,
 	pitch: -35,
 	dist: 300
-}, J = {
+}, Y = {
 	pitch: [-90, -20],
 	dist: [1, 2485],
 	clearance: 10,
 	floor: 50
-}, xn = .1, Y = Math.PI / 180, Sn = 1.1, Cn = [600, 2500], wn = 300, Tn = .5, En = (e, [t, n]) => Math.min(n, Math.max(t, e)), Dn = (e) => (e % 360 + 360) % 360, On = (e, t) => (t - e + 540) % 360 - 180;
-function kn({ leaf: e, roots: t, extent: n }) {
+}, En = .1, X = Math.PI / 180, Dn = 1.1, On = [600, 2500], kn = 300, An = .5, jn = (e, [t, n]) => Math.min(n, Math.max(t, e)), Mn = (e) => (e % 360 + 360) % 360, Nn = (e, t) => (t - e + 540) % 360 - 180;
+function Pn({ leaf: e, roots: t, extent: n }) {
 	let r = {
 		e: (n.e[0] + n.e[1]) / 2,
 		n: (n.n[0] + n.n[1]) / 2,
@@ -3131,7 +3185,7 @@ function kn({ leaf: e, roots: t, extent: n }) {
 	}
 	return i;
 }
-function An(e) {
+function Fn(e) {
 	let t = e.split(",");
 	if (t.length !== 6 || t.some((e) => e.trim() === "")) return null;
 	let [n, r, i, a, o, s] = t.map(Number);
@@ -3151,7 +3205,7 @@ function An(e) {
 		dist: s
 	};
 }
-function jn(e) {
+function In(e) {
 	let t = (e, t) => +e.toFixed(t);
 	return [
 		t(e.e, 2),
@@ -3162,19 +3216,19 @@ function jn(e) {
 		t(e.dist, 1)
 	].join(",");
 }
-function X(e, t, n = J) {
+function Z(e, t, n = Y) {
 	let r = {
 		e: e.e,
 		n: e.n,
 		h: e.h,
-		yaw: Dn(e.yaw),
-		pitch: En(e.pitch, n.pitch),
-		dist: En(e.dist, n.dist)
+		yaw: Mn(e.yaw),
+		pitch: jn(e.pitch, n.pitch),
+		dist: jn(e.dist, n.dist)
 	};
 	if (t) {
-		let e = Z(r), i = Math.max(n.floor, t(e.e, e.n) + n.clearance);
+		let e = Q(r), i = Math.max(n.floor, t(e.e, e.n) + n.clearance);
 		if (e.h < i) return {
-			...Fn({
+			...Bn({
 				...e,
 				h: i
 			}, r),
@@ -3183,42 +3237,42 @@ function X(e, t, n = J) {
 	}
 	return r;
 }
-function Mn(e, t) {
-	let n = Math.cos(t * Y);
+function Ln(e, t) {
+	let n = Math.cos(t * X);
 	return {
-		e: Math.sin(e * Y) * n,
-		n: Math.cos(e * Y) * n,
-		h: Math.sin(t * Y)
+		e: Math.sin(e * X) * n,
+		n: Math.cos(e * X) * n,
+		h: Math.sin(t * X)
 	};
 }
-function Z(e) {
-	let t = Mn(e.yaw, e.pitch);
+function Q(e) {
+	let t = Ln(e.yaw, e.pitch);
 	return {
 		e: e.e - t.e * e.dist,
 		n: e.n - t.n * e.dist,
 		h: e.h - t.h * e.dist
 	};
 }
-function Nn(e) {
+function Rn(e) {
 	return {
-		...Z(e),
+		...Q(e),
 		yaw: e.yaw,
 		pitch: e.pitch,
 		fov: 45
 	};
 }
-function Pn(e, t, n) {
-	let r = Z(e), [i, a, o] = [
+function zn(e, t, n) {
+	let r = Q(e), [i, a, o] = [
 		n.e - r.e,
 		n.n - r.n,
 		n.h - r.h
-	], [s, c] = [Math.sin(e.yaw * Y), Math.cos(e.yaw * Y)], [l, u] = [Math.sin(e.pitch * Y), Math.cos(e.pitch * Y)], d = i * s + a * c, f = 2 * Math.tan(t * Y / 2) * (d * u + o * l);
+	], [s, c] = [Math.sin(e.yaw * X), Math.cos(e.yaw * X)], [l, u] = [Math.sin(e.pitch * X), Math.cos(e.pitch * X)], d = i * s + a * c, f = 2 * Math.tan(t * X / 2) * (d * u + o * l);
 	return {
 		x: (i * c - a * s) / f,
 		y: (d * l - o * u) / f
 	};
 }
-function Fn(e, t) {
+function Bn(e, t) {
 	let [n, r, i] = [
 		t.e - e.e,
 		t.n - e.n,
@@ -3228,17 +3282,17 @@ function Fn(e, t) {
 		e: t.e,
 		n: t.n,
 		h: t.h,
-		yaw: Dn(Math.atan2(n, r) / Y),
-		pitch: Math.asin(i / a) / Y,
+		yaw: Mn(Math.atan2(n, r) / X),
+		pitch: Math.asin(i / a) / X,
 		dist: a
 	};
 }
-function In(e, t, n, r = J) {
-	let i = Z(e), a = X({
+function Vn(e, t, n, r = Y) {
+	let i = Q(e), a = Z({
 		...e,
 		yaw: t,
 		pitch: n
-	}, void 0, r), o = Mn(a.yaw, a.pitch);
+	}, void 0, r), o = Ln(a.yaw, a.pitch);
 	return {
 		...a,
 		e: i.e + o.e * a.dist,
@@ -3246,11 +3300,11 @@ function In(e, t, n, r = J) {
 		h: i.h + o.h * a.dist
 	};
 }
-function Ln(e) {
-	return e.dist * Math.max(Math.sin(-e.pitch * Y), xn);
+function Hn(e) {
+	return e.dist * Math.max(Math.sin(-e.pitch * X), En);
 }
-function Rn(e, t, n, r) {
-	let [i, a] = [Math.sin(e.yaw * Y), Math.cos(e.yaw * Y)];
+function Un(e, t, n, r) {
+	let [i, a] = [Math.sin(e.yaw * X), Math.cos(e.yaw * X)];
 	return {
 		...e,
 		e: e.e + t * a + n * i,
@@ -3258,20 +3312,20 @@ function Rn(e, t, n, r) {
 		h: e.h + r
 	};
 }
-function zn(e, t, n) {
-	return Rn(e, t, n * e.dist / Ln(e), 0);
+function Wn(e, t, n) {
+	return Un(e, t, n * e.dist / Hn(e), 0);
 }
-function Q(e, t, n) {
+function Gn(e, t, n) {
 	return {
 		e: e.e + (t.e - e.e) * n,
 		n: e.n + (t.n - e.n) * n,
 		h: e.h + (t.h - e.h) * n,
-		yaw: Dn(e.yaw + On(e.yaw, t.yaw) * n),
+		yaw: Mn(e.yaw + Nn(e.yaw, t.yaw) * n),
 		pitch: e.pitch + (t.pitch - e.pitch) * n,
 		dist: e.dist * (t.dist / e.dist) ** n
 	};
 }
-function Bn(e, t) {
+function Kn(e, t) {
 	let n = ([e, t]) => (e + t) / 2, r = Math.hypot(e.e[1] - e.e[0], e.n[1] - e.n[0], e.h[1] - e.h[0]) / 2;
 	return {
 		e: n(e.e),
@@ -3279,17 +3333,17 @@ function Bn(e, t) {
 		h: n(e.h),
 		yaw: t.yaw,
 		pitch: t.pitch,
-		dist: Sn * r / Math.sin(45 * Y / 2)
+		dist: Dn * r / Math.sin(45 * X / 2)
 	};
 }
-function Vn(e, t) {
-	let n = Math.hypot(t.e - e.e, t.n - e.n), r = Math.log1p(n / Math.min(e.dist, t.dist)) + Math.abs(Math.log(t.dist / e.dist)), i = Math.log1p(Tn * n / Math.max(e.dist, t.dist));
+function qn(e, t) {
+	let n = Math.hypot(t.e - e.e, t.n - e.n), r = Math.log1p(n / Math.min(e.dist, t.dist)) + Math.abs(Math.log(t.dist / e.dist)), i = Math.log1p(An * n / Math.max(e.dist, t.dist));
 	return {
-		ms: En(Cn[0] + wn * r, Cn),
+		ms: jn(On[0] + kn * r, On),
 		at(n) {
 			if (n <= 0) return e;
 			if (n >= 1) return t;
-			let r = n * n * (3 - 2 * n), a = Q(e, t, r);
+			let r = n * n * (3 - 2 * n), a = Gn(e, t, r);
 			return {
 				...a,
 				dist: a.dist * Math.exp(4 * i * r * (1 - r))
@@ -3297,17 +3351,17 @@ function Vn(e, t) {
 		}
 	};
 }
-function Hn(e, t) {
+function Jn(e, t) {
 	let n = e.dist * 1e-5;
-	return Math.abs(e.e - t.e) < n && Math.abs(e.n - t.n) < n && Math.abs(e.h - t.h) < n && Math.abs(e.dist - t.dist) < n && Math.abs(On(e.yaw, t.yaw)) < .001 && Math.abs(e.pitch - t.pitch) < .001;
+	return Math.abs(e.e - t.e) < n && Math.abs(e.n - t.n) < n && Math.abs(e.h - t.h) < n && Math.abs(e.dist - t.dist) < n && Math.abs(Nn(e.yaw, t.yaw)) < .001 && Math.abs(e.pitch - t.pitch) < .001;
 }
 //#endregion
 //#region src/controls/controls.ts
-var Un = .2, Wn = .002, Gn = .005, Kn = .5, qn = .05;
-function Jn(e, t) {
+var Yn = .2, Xn = .002, Zn = .005, Qn = .5, $n = .05;
+function er(e, t) {
 	return 2 * e * Math.tan(45 * Math.PI / 360) / Math.max(1, t);
 }
-function Yn(e) {
+function tr(e) {
 	let t = (t) => +!!e.has(t);
 	return [
 		t("KeyD") - t("KeyA") + t("ArrowRight") - t("ArrowLeft"),
@@ -3315,10 +3369,10 @@ function Yn(e) {
 		t("KeyE") - t("KeyQ")
 	];
 }
-function Xn(e, t, n, r, i = J) {
-	return Hn(e, t) ? t : X(Q(e, t, 1 - Math.exp(-n / qn)), r, i);
+function nr(e, t, n, r, i = Y) {
+	return Jn(e, t) ? t : Z(Gn(e, t, 1 - Math.exp(-n / $n)), r, i);
 }
-var Zn = class {
+var rr = class {
 	enabled = !0;
 	#e;
 	#t;
@@ -3337,7 +3391,7 @@ var Zn = class {
 	#m = /* @__PURE__ */ new Set();
 	#h;
 	#g = null;
-	constructor(e, t, n, r, i = J) {
+	constructor(e, t, n, r, i = Y) {
 		this.#e = e, this.#t = t, this.#n = n, this.#r = i, this.#d = this.#j(r), this.#f = this.#d, this.#h = t.onFrame(this.#D);
 		let a = this.#i.signal;
 		e.addEventListener("pointerdown", this.#_, { signal: a }), e.addEventListener("pointermove", this.#v, { signal: a });
@@ -3358,7 +3412,7 @@ var Zn = class {
 		return this.#m.add(e), () => this.#m.delete(e);
 	}
 	moveTo(e, t) {
-		let n = this.#d, r = Math.min(n.dist, bn.dist);
+		let n = this.#d, r = Math.min(n.dist, Tn.dist);
 		this.#O(this.#j({
 			...n,
 			e,
@@ -3382,7 +3436,7 @@ var Zn = class {
 		let i = () => this.#k(!1);
 		return new Promise((t) => {
 			this.#p = {
-				path: Vn(r, this.#j({
+				path: qn(r, this.#j({
 					...r,
 					...e
 				})),
@@ -3412,7 +3466,7 @@ var Zn = class {
 			e.buttons & 6 || t && e.shiftKey ? $(this.#c, r, i) : t && $(this.#s, r, i);
 		} else if (n) {
 			let e = this.#T();
-			$(this.#c, e.x - n.x, e.y - n.y), this.#l += (n.d - e.d) * Gn;
+			$(this.#c, e.x - n.x, e.y - n.y), this.#l += (n.d - e.d) * Zn;
 		} else $(this.#s, r, i);
 		this.#E();
 	};
@@ -3420,7 +3474,7 @@ var Zn = class {
 		this.#a.delete(e.pointerId);
 	};
 	#b = (e) => {
-		this.#w(e) && (e.preventDefault(), this.#l += e.deltaY * Wn, this.#E());
+		this.#w(e) && (e.preventDefault(), this.#l += e.deltaY * Xn, this.#E());
 	};
 	#x = (e) => {
 		this.#w(e) && (e.code === "KeyF" && !e.repeat && (this.#u = !this.#u), this.#o.add(e.code), this.#u && this.#E());
@@ -3432,12 +3486,12 @@ var Zn = class {
 		if (!this.#w(e)) return;
 		let t = await this.#t.pick(e.offsetX, e.offsetY);
 		if (!t || this.#i.signal.aborted) return;
-		let [n, r, i] = t.point, a = Fn(Z(this.#f), {
+		let [n, r, i] = t.point, a = Bn(Q(this.#f), {
 			e: n,
 			n: r,
 			h: i
 		});
-		this.#O(X(a, void 0, this.#r));
+		this.#O(Z(a, void 0, this.#r));
 	};
 	#w(e) {
 		return this.enabled && !e.defaultPrevented;
@@ -3459,26 +3513,26 @@ var Zn = class {
 		this.#g = e;
 		let n = this.#d, [r, i] = this.#c;
 		if (r || i) {
-			let e = Jn(n.dist, this.#e.clientHeight);
-			n = zn(n, -r * e, i * e);
+			let e = er(n.dist, this.#e.clientHeight);
+			n = Wn(n, -r * e, i * e);
 		}
 		let [a, o] = this.#s;
 		if (a || o) {
-			let [e, t] = [n.yaw + a * Un, n.pitch - o * Un];
-			n = this.#u ? In(n, e, t, this.#r) : X({
+			let [e, t] = [n.yaw + a * Yn, n.pitch - o * Yn];
+			n = this.#u ? Vn(n, e, t, this.#r) : Z({
 				...n,
 				yaw: e,
 				pitch: t
 			}, void 0, this.#r);
 		}
-		this.#l && (n = X({
+		this.#l && (n = Z({
 			...n,
 			dist: n.dist * Math.exp(this.#l)
 		}, void 0, this.#r)), this.#c = [0, 0], this.#s = [0, 0], this.#l = 0;
-		let [s, c, l] = Yn(this.#o), u = this.enabled && this.#u && (s !== 0 || l !== 0 || c !== 0);
+		let [s, c, l] = tr(this.#o), u = this.enabled && this.#u && (s !== 0 || l !== 0 || c !== 0);
 		if (u) {
-			let e = Kn * Ln(n) * t;
-			n = Rn(n, s * e, c * e, l * e);
+			let e = Qn * Hn(n) * t;
+			n = Un(n, s * e, c * e, l * e);
 		}
 		let d = this.#f;
 		n !== this.#d && this.#k(!1);
@@ -3487,7 +3541,7 @@ var Zn = class {
 			f.start ??= e;
 			let t = Math.min(1, (e - f.start) / f.path.ms);
 			this.#d = this.#f = this.#j(f.path.at(t)), t === 1 && this.#k(!0);
-		} else d !== n && (this.#d = n = this.#j(n), this.#f = Xn(d, n, t, this.#n, this.#r));
+		} else d !== n && (this.#d = n = this.#j(n), this.#f = nr(d, n, t, this.#n, this.#r));
 		this.#f !== d && this.#A(), u || this.#p || this.#f !== this.#d ? this.#E() : this.#g = null;
 	};
 	#O(e) {
@@ -3503,14 +3557,14 @@ var Zn = class {
 		for (let t of this.#m) t(e);
 	}
 	#j(e) {
-		return X(e, this.#n, this.#r);
+		return Z(e, this.#n, this.#r);
 	}
 	#M() {
-		this.#t.setCamera(Nn(this.#f));
+		this.#t.setCamera(Rn(this.#f));
 	}
 };
 function $(e, t, n) {
 	e[0] += t, e[1] += n;
 }
 //#endregion
-export { yt as C, Kt as S, An as _, Z as a, Nn as b, Bn as c, jn as d, Ln as f, zn as g, kn as h, Q as i, Vn as l, Fn as m, yn as n, X as o, In as p, J as r, bn as s, Zn as t, Rn as u, Pn as v, ve as w, Gt as x, Hn as y };
+export { wt as C, Zt as S, Fn as _, Q as a, Rn as b, Kn as c, In as d, Hn as f, Wn as g, Pn as h, Gn as i, qn as l, Bn as m, wn as n, Z as o, Vn as p, Y as r, Tn as s, rr as t, Un as u, zn as v, be as w, Xt as x, Jn as y };