@kalyptos/narcissus 0.1.0 → 0.1.2

package/dist/{controls-5FaXzanr.js → controls-mxyJLzqv.js}

@@ -1,4 +1,4 @@
-import { F as e, I as t, c as n, l as r, m as i, u as a } from "./format-CxKTIugr.js";
+import { F as e, I as t, c as n, l as r, m as i, u as a } from "./format-C3Vn0c2b.js";
 import { t as o } from "./ports-DZRKjdYD.js";
 import { t as s } from "./http-DL7R39Nc.js";
 //#region src/engine/gpu/layout.ts
@@ -56,42 +56,36 @@ var m = 19, h = 1024, g = class {
 	capacity;
 	#e;
 	#t = /* @__PURE__ */ new Map();
-	#n = /* @__PURE__ */ new Set();
-	#r;
-	#i;
+	#n = null;
+	#r = null;
+	#i = /* @__PURE__ */ new Set();
 	#a;
-	#o = [
+	#o;
+	#s = 0;
+	#c;
+	#l = [
 		0,
 		0,
 		0
 	];
-	#s;
-	#c;
-	#l = new g();
 	#u;
 	#d;
 	#f = new g();
 	#p;
+	#m;
+	#h = new g();
+	#g;
+	#_ = [];
 	constructor(e, t) {
 		this.capacity = t, this.#e = e;
-		let n = this.slots, r = GPUBufferUsage.STORAGE | GPUBufferUsage.COPY_DST | GPUBufferUsage.COPY_SRC, i = (t, n) => e.createBuffer({
-			label: t,
-			size: n,
-			usage: r
-		});
-		this.geometry = i("pool geometry", t * 4 * 4), this.colour = i("pool colour", t * 3 * 4), this.pages = i("pool pages", n * 36 * 4), this.clusters = i("pool clusters", n * 12 * 4), this.list = i("pool list", n * 4), this.#r = new Uint8Array(n), this.#i = n, this.#a = Array.from({ length: n }, (e, t) => n - 1 - t), this.#s = new Uint32Array(n * 36), this.#c = new Float32Array(this.#s.buffer), this.#u = new Uint32Array(n * 12), this.#d = new Float32Array(this.#u.buffer), this.#p = new Uint32Array(n);
+		let n = this.slots;
+		this.#y(), 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);
 	}
 	get slots() {
 		return this.capacity / 256;
 	}
 	get bytes() {
-		return [
-			this.geometry,
-			this.colour,
-			this.pages,
-			this.clusters,
-			this.list
-		].reduce((e, t) => e + t.size, 0);
+		return this.#v().reduce((e, t) => e + t.size, 0);
 	}
 	has(e) {
 		let t = this.#t.get(e);
@@ -101,120 +95,181 @@ var m = 19, h = 1024, g = class {
 		return this.#t.has(e);
 	}
 	*ids() {
-		for (let [e, t] of this.#t) t.page === null && (yield e);
+		for (let e = this.#n; e; e = e.next) e.page === null && (yield e.id);
 	}
 	add(e, n, r, i) {
 		if (this.#t.has(e)) return !0;
 		let a = c(n.count) / 256;
-		if (!this.#m(a, i)) return !1;
-		let o = t.origin;
-		return this.#t.set(e, {
+		if (!this.#S(a, i)) return !1;
+		let o = t.origin, s = {
+			id: e,
+			previous: null,
+			next: null,
 			page: n,
-			slots: this.#v(a),
-			table: this.#a.pop(),
+			slots: this.#E(a),
+			active: [],
+			mask: 0,
+			table: this.#c.pop(),
 			base: [
 				n.params[o] + r[0],
 				n.params[o + 1] + r[1],
 				n.params[o + 2]
 			],
 			factors: 0
-		}), this.#n.add(e), !0;
+		};
+		return this.#t.set(e, s), this.#x(s), this.#i.add(e), !0;
 	}
 	remove(e) {
 		let t = this.#t.get(e);
 		if (t) {
-			this.#t.delete(e), this.#n.delete(e);
-			for (let e of t.slots) this.#r[e] = 0;
-			this.#i += t.slots.length, this.#a.push(t.table), t.page === null && t.factors !== 0 && this.#_(t, 0);
+			this.#b(t), this.#t.delete(e), this.#i.delete(e);
+			for (let e of t.slots) this.#a[e] = 0;
+			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.#T(t, 0);
 		}
 	}
 	clear() {
 		for (let e of this.#t.keys()) this.remove(e);
 	}
 	get queued() {
-		return this.#n.size;
+		return this.#i.size;
 	}
 	upload(e) {
 		let t = 0;
-		for (let n of this.#n) {
+		for (let n of this.#i) {
 			if (t >= e) break;
-			t += this.#h(this.#t.get(n)), this.#n.delete(n);
+			t += this.#C(this.#t.get(n)), this.#i.delete(n);
 		}
 		return t;
 	}
 	draw(e) {
-		let t = 0;
-		for (let { id: n, factors: r } of e) {
-			let e = this.#t.get(n);
-			e && e.page === null && (e.factors !== r && this.#_(e, r), this.#t.delete(n), this.#t.set(n, e), this.#p.set(e.slots, t), t += e.slots.length);
+		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 && this.#T(e, a), r ||= o !== e.active, this.#x(e), r ||= this.#_[n] !== e, this.#_[n++] = e, r && this.#g.set(e.active, t), t += e.active.length;
 		}
-		this.listed = t;
-		let n = this.#e.queue;
-		this.#l.flush(n, this.pages, this.#s), this.#f.flush(n, this.clusters, this.#u), n.writeBuffer(this.list, 0, this.#p, 0, t);
+		r ||= this.#_.length !== n, this.#_.length = n, this.listed = t;
+		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);
 	}
 	setOrigin(e) {
-		this.#o = [
+		this.#l = [
 			e[0],
 			e[1],
 			e[2]
 		];
-		for (let e of this.#t.values()) e.page === null && this.#g(e);
-		this.#e.queue.writeBuffer(this.pages, 0, this.#s), this.#l.clear();
+		for (let e of this.#t.values()) e.page === null && this.#w(e);
+		this.#e.queue.writeBuffer(this.pages, 0, this.#u), this.#f.clear();
+	}
+	grow(e) {
+		if (e <= this.capacity) return;
+		let t = this.slots, n = this.#v();
+		this.capacity = e, this.#y();
+		let r = this.#e.createCommandEncoder({ label: "pool grow" });
+		this.#v().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;
+		for (let e = i - 1; e >= t; e--) this.#c.push(e);
+		let o = new Uint32Array(i * 36);
+		o.set(this.#u), this.#u = o, this.#d = new Float32Array(o.buffer);
+		let s = new Uint32Array(i * 12);
+		s.set(this.#p), this.#p = s, this.#m = new Float32Array(s.buffer);
+		let c = new Uint32Array(i);
+		c.set(this.#g), this.#g = c;
 	}
 	destroy() {
-		let e = [
+		for (let e of this.#v()) e.destroy();
+	}
+	#v() {
+		return [
 			this.geometry,
 			this.colour,
 			this.pages,
 			this.clusters,
 			this.list
 		];
-		for (let t of e) t.destroy();
 	}
-	#m(e, t) {
-		let n = this.#i;
+	#y() {
+		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,
+			usage: n
+		});
+		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);
+	}
+	#b(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;
+	}
+	#x(e) {
+		this.#r !== e && (this.#b(e), e.previous = this.#r, this.#r ? this.#r.next = e : this.#n = e, this.#r = e);
+	}
+	#S(e, t) {
+		let n = this.#o;
 		if (n >= e) return !0;
 		let r = [];
-		for (let [i, a] of this.#t) if (!(a.page !== null || t(i)) && (r.push(i), n += a.slots.length, n >= e)) break;
+		for (let i = this.#n; i && !(!(i.page !== null || t(i.id)) && (r.push(i.id), n += i.slots.length, n >= e)); i = i.next);
 		if (n < e) return !1;
 		for (let e of r) this.remove(e);
 		return !0;
 	}
-	#h(e) {
-		let n = e.page, { slots: r } = e, i = this.#e.queue, a = r.length, o = this.#u, s = this.#d;
+	#C(e) {
+		let n = e.page, { slots: r } = e, i = this.#e.queue, a = r.length, o = this.#p, s = this.#m;
 		for (let t = 0; t < a; t++) {
 			let i = r[t] * 12;
-			o.fill(0, i, i + 12), o[i] = e.table, o[i + 1] = r[t] * 256, o[i + 2] = t * 256, o[i + 3] = Math.max(0, Math.min(256, n.count - t * 256)), s.set(n.clusters.subarray(t * 6, t * 6 + 3), i + 4), s.set(n.clusters.subarray(t * 6 + 3, t * 6 + 6), i + 8);
+			o.fill(0, i, i + 12), o[i] = e.table, o[i + 1] = r[t] * 256, o[i + 2] = t * 256, o[i + 3] = Math.max(0, Math.min(256, n.count - t * 256));
+			for (let e = 0; e < 3; e++) s[i + 4 + e] = n.clusters[t * 6 + e], s[i + 8 + e] = n.clusters[t * 6 + 3 + e];
 		}
 		for (let e = 0; e < a;) {
 			let t = 1;
 			for (; e + t < a && r[e + t] === r[e] + t;) t++;
 			let o = e * 256, s = Math.min((e + t) * 256, n.count) - o, c = r[e] * 256;
-			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.#f.mark(r[e] * 12, (r[e] + t) * 12), e += t;
+			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 = e.table * 36, l = this.#s, u = this.#c, d = n.params, [f, p, m] = n.quadrants;
-		return l.fill(0, c, c + 36), this.#g(e), l[c + 3] = n.count, u.set(d.subarray(t.step, t.step + 3), c + 4), l[c + 7] = f, u.set(d.subarray(t.scaleMin, t.scaleMin + 3), c + 8), l[c + 11] = p, u.set(d.subarray(t.scaleMax, t.scaleMax + 3), c + 12), l[c + 15] = m, u.set(d.subarray(t.dcMin, t.dcMin + 3), c + 16), u.set(d.subarray(t.dcMax, t.dcMax + 3), c + 20), u.set(d.subarray(t.shScale, t.shScale + 9), c + 24), this.#l.mark(c, c + 36), e.page = null, n.count * 7 * 4 + a * 12 * 4 + 144;
+		let c = e.table * 36, l = this.#u, u = this.#d, d = n.params, [f, p, m] = n.quadrants;
+		return l.fill(0, c, c + 36), this.#w(e), l[c + 3] = n.count, u.set(d.subarray(t.step, t.step + 3), c + 4), l[c + 7] = f, u.set(d.subarray(t.scaleMin, t.scaleMin + 3), c + 8), l[c + 11] = p, u.set(d.subarray(t.scaleMax, t.scaleMax + 3), c + 12), l[c + 15] = m, u.set(d.subarray(t.dcMin, t.dcMin + 3), c + 16), u.set(d.subarray(t.dcMax, t.dcMax + 3), c + 20), u.set(d.subarray(t.shScale, t.shScale + 9), c + 24), this.#f.mark(c, c + 36), e.page = null, n.count * 7 * 4 + a * 12 * 4 + 144;
 	}
-	#g(e) {
+	#w(e) {
 		let t = e.table * 36;
-		for (let n = 0; n < 3; n++) this.#c[t + n] = e.base[n] - this.#o[n];
+		for (let n = 0; n < 3; n++) this.#d[t + n] = e.base[n] - this.#l[n];
 	}
-	#_(e, t) {
+	#T(e, t) {
+		let n = 0;
+		for (let e = 0; e < 4; e++) t >>> 8 * e & 255 && (n |= 1 << e);
+		if (n !== e.mask) {
+			if (e.mask = n, n === 15 && this.#u[e.table * 36 + 3] > 0) e.active = e.slots;
+			else {
+				let t = [], r = e.table * 36, i = 0, a = -1;
+				for (let o = 0; o < 4; o++) {
+					let s = this.#u[r + (o === 3 ? 3 : 7 + 4 * o)];
+					if (n & 1 << o && s > i) for (let n = Math.max(a + 1, Math.floor(i / 256)); n < Math.ceil(s / 256); n++) t.push(e.slots[n]), a = n;
+					i = s;
+				}
+				e.active = t;
+			}
+		}
 		e.factors = t;
-		let n = e.table * 36 + m;
-		this.#s[n] = t, this.#l.mark(n, n + 1);
-	}
-	#v(e) {
-		let t = this.#r, n = -1;
-		for (let r = 0, i = 0; r < t.length; r++) if (i = t[r] ? 0 : i + 1, i === e) {
-			n = r - e + 1;
-			break;
+		let r = e.table * 36 + m;
+		this.#u[r] = t, this.#f.mark(r, r + 1);
+	}
+	#E(e) {
+		let t = this.#a, n = -1;
+		for (let r = this.#s; r <= t.length - e;) {
+			let i = r;
+			for (; i < r + e && !t[i];) i++;
+			if (i === r + e) {
+				n = r;
+				break;
+			}
+			if (r = t.indexOf(0, i + 1), r < 0) break;
 		}
 		let r = [];
 		if (n >= 0) for (let t = n; t < n + e; t++) r.push(t);
-		else for (let n = 0; r.length < e; n++) t[n] || r.push(n);
+		else for (let n = this.#s; r.length < e; n = t.indexOf(0, n + 1)) r.push(n);
 		for (let e of r) t[e] = 1;
-		return this.#i -= e, r;
+		let i = t.indexOf(0, this.#s);
+		return this.#s = i < 0 ? t.length : i, this.#o -= e, r;
 	}
 };
 //#endregion
@@ -271,12 +326,14 @@ function T(e, t, n) {
 		r("work", (l.list + n) * 4, i | GPUBufferUsage.INDIRECT),
 		r("projected", t * 6 * 4, i),
 		r("sort", t * 16, i),
-		r("plugins", 256, GPUBufferUsage.UNIFORM | GPUBufferUsage.COPY_DST)
-	], [o, s, c, u, d] = a;
+		r("plugins", 256, GPUBufferUsage.UNIFORM | GPUBufferUsage.COPY_DST),
+		r("visible clusters", 4, GPUBufferUsage.UNIFORM | GPUBufferUsage.COPY_DST)
+	], [o, s, c, u, d, f] = a;
 	return {
 		capacity: t,
 		uniforms: o,
 		work: s,
+		visible: f,
 		projected: c,
 		sort: u,
 		plugins: d,
@@ -306,7 +363,7 @@ function D(e, t, n, r) {
 }
 //#endregion
 //#region src/engine/gpu/common.wgsl?raw
-var O = "// 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	pad: 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	pad0: u32,\n	boxMax: vec3f,\n	pad1: 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", k = "// 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// some quadrant the cluster's splats overlap has a nonzero factor\nfn lit(page: Page, cluster: Cluster) -> bool {\n	var starts = array<u32, 5>(0u, page.q1, page.q2, page.q3, page.count);\n	let end = cluster.first + cluster.count;\n	for (var k = 0u; k < 4u; k++) {\n		let overlaps = max(starts[k], cluster.first) < min(starts[k + 1u], end);\n		if (overlaps && extractBits(page.factors, 8u * k, 8u) != 0u) {\n			return true;\n		}\n	}\n	return false;\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) || !lit(page, cluster)) {\n		return;\n	}\n	atomicStore(&work[WORK_LIST + atomicAdd(&work[WORK_VISIBLE], 1u)], slot);\n}\n", A = 64, j = class {
+var O = "// 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	pad: 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	pad0: u32,\n	boxMax: vec3f,\n	pad1: 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", k = "// 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", A = 64, j = class {
 	#e;
 	#t;
 	#n;
@@ -344,10 +401,10 @@ var O = "// 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), n.dispatchWorkgroups(Math.ceil(this.#e.listed / A)), n.end();
+		n.setBindGroup(0, this.#n), n.setPipeline(this.#t), this.#e.listed && n.dispatchWorkgroups(Math.ceil(this.#e.listed / A)), n.end();
 	}
-}, M = "// 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		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", ee = 32, te = .5, ne = 1;
-function re(e) {
+}, M = "// 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		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", N = 32, ee = .5, te = 1;
+function ne(e) {
 	let t = new Uint32Array(e.length);
 	for (let n = 0; n < e.length; n++) {
 		let r = e[n];
@@ -355,7 +412,7 @@ function re(e) {
 	}
 	return new Float32Array(t.buffer);
 }
-var ie = class {
+var re = class {
 	#e;
 	#t;
 	#n;
@@ -385,7 +442,7 @@ var ie = 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: ee,
+			size: N,
 			usage: GPUBufferUsage.UNIFORM | GPUBufferUsage.COPY_DST
 		}), u = a.createBuffer({
 			label: "heights",
@@ -395,14 +452,14 @@ var ie = class {
 			label: "heights readback",
 			size: c,
 			usage: GPUBufferUsage.COPY_DST | GPUBufferUsage.MAP_READ
-		}), p = /* @__PURE__ */ new ArrayBuffer(ee);
+		}), p = /* @__PURE__ */ new ArrayBuffer(N);
 		new Float32Array(p).set([
 			t,
 			n,
 			0,
 			0,
-			te,
-			ne
+			ee,
+			te
 		]), new Uint32Array(p).set([r, s], 2), a.queue.writeBuffer(l, 0, p);
 		let m = [
 			l,
@@ -415,11 +472,11 @@ var ie = class {
 			label: "heights",
 			timestampWrites: i
 		});
-		return g.setPipeline(this.#r), g.setBindGroup(0, h), s > 0 && g.dispatchWorkgroups(...d(s)), g.end(), e.copyBufferToBuffer(u, 0, f, 0, c), () => f.mapAsync(GPUMapMode.READ).then(() => re(new Uint32Array(f.getMappedRange())), () => null).finally(() => {
+		return g.setPipeline(this.#r), g.setBindGroup(0, h), s > 0 && g.dispatchWorkgroups(...d(s)), g.end(), e.copyBufferToBuffer(u, 0, f, 0, c), () => f.mapAsync(GPUMapMode.READ).then(() => ne(new Uint32Array(f.getMappedRange())), () => null).finally(() => {
 			l.destroy(), u.destroy(), f.destroy();
 		});
 	}
-}, ae = "@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", oe = class {
+}, ie = "@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", ae = class {
 	#e;
 	#t;
 	#n;
@@ -428,7 +485,7 @@ var ie = class {
 	constructor(e, t, n, r) {
 		let i = e.createShaderModule({
 			label: t,
-			code: ae + n
+			code: ie + n
 		});
 		this.#e = e, this.#t = t, this.#n = e.createRenderPipeline({
 			label: t,
@@ -463,15 +520,17 @@ var ie = class {
 		});
 		r.setPipeline(this.#n), r.setBindGroup(0, this.#i), r.draw(3), r.end();
 	}
-}, se = "// 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", ce = (e, t) => new oe(e, "present", se, t), le = "// one workgroup per visible cluster, one thread per splat; shade() follows, generated with the hooks\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\nvar<workgroup> visible: u32;\nvar<workgroup> kept: atomic<u32>;\nvar<workgroup> base: u32;\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// 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	let page = pages[cluster.page];\n	let rec = cluster.slot + t;\n	let 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	// decode\n	var s: Splat;\n	let q = vec3f(f32(g.x & 0xffffu), f32(g.x >> 16u), f32(g.y & 0xffffu));\n	s.position = page.origin + q * page.step;\n	s.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	s.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 d = normalize(s.position - uniforms.camera);\n	s.colour = max(0.5 + C0 * dc + C1 * (-d.y * m0 + d.z * m1 - d.x * m2), vec3f(0.0));\n	s.depth = -(uniforms.view * vec4f(s.position, 1.0)).z;\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	// ewa: view-space covariance wm wm^T through the jacobian of the pixel projection\n	let r = rotate(rotation(g));\n	let m = mat3x3f(r[0] * s.scale.x, r[1] * s.scale.y, r[2] * s.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	let a = dot(u, u) + uniforms.lowPass;\n	let b = dot(u, v);\n	let c = dot(v, v) + uniforms.lowPass;\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(@builtin(workgroup_id) wid: vec3u, @builtin(local_invocation_index) t: u32) {\n	if (t == 0u) {\n		visible = atomicLoad(&work[WORK_VISIBLE]);\n	}\n	let index = wid.y * GROUPS_X + wid.x;\n	if (index >= workgroupUniformLoad(&visible)) {\n		return;\n	}\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 workgroup\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], atomicLoad(&kept));\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", ue = class {
+}, oe = "// 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 ae(e, "present", oe, t), ce = "// 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// 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// 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	let page = pages[cluster.page];\n	let rec = cluster.slot + t;\n	let 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	// decode\n	var s: Splat;\n	let q = vec3f(f32(g.x & 0xffffu), f32(g.x >> 16u), f32(g.y & 0xffffu));\n	s.position = page.origin + q * page.step;\n	s.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	s.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 d = normalize(s.position - uniforms.camera);\n	s.colour = max(0.5 + C0 * dc + C1 * (-d.y * m0 + d.z * m1 - d.x * m2), vec3f(0.0));\n	s.depth = -(uniforms.view * vec4f(s.position, 1.0)).z;\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	// ewa: view-space covariance wm wm^T through the jacobian of the pixel projection\n	let r = rotate(rotation(g));\n	let m = mat3x3f(r[0] * s.scale.x, r[1] * s.scale.y, r[2] * s.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	let a = dot(u, u) + uniforms.lowPass;\n	let b = dot(u, v);\n	let c = dot(v, v) + uniforms.lowPass;\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", le = class {
 	#e;
 	#t;
 	#n;
 	#r = [];
 	#i;
 	#a;
+	#o;
+	#s;
 	constructor(e, t, n) {
-		this.#e = e, this.#a = t;
+		this.#e = e, this.#a = t, this.#o = n.work, this.#s = n.visible;
 		let r = E(e, "project", GPUShaderStage.COMPUTE, [
 			"uniform",
 			"uniform",
@@ -481,7 +540,8 @@ var ie = class {
 			"read-only-storage",
 			"storage",
 			"storage",
-			"storage"
+			"storage",
+			"uniform"
 		]);
 		this.#t = e.createPipelineLayout({ bindGroupLayouts: [r] });
 		let i = [
@@ -493,27 +553,29 @@ var ie = class {
 			t.clusters,
 			n.work,
 			n.projected,
-			n.sort
+			n.sort,
+			n.visible
 		];
 		this.#i = D(e, "project", r, i);
 	}
 	hooks(e) {
 		this.#r = e, this.#n = void 0;
 	}
-	encode(e, t) {
-		let n = Math.max(1, this.#a.listed), r = e.beginComputePass({
+	encode(e, t, n) {
+		e.copyBufferToBuffer(this.#o, l.visible * 4, this.#s, 0, 4);
+		let r = Math.max(1, Math.min(128, this.#a.listed, t ? Math.max(32, Math.ceil(t / 16)) : 128)), i = e.beginComputePass({
 			label: "project",
-			timestampWrites: t
+			timestampWrites: n
 		});
-		r.setPipeline(this.#n ??= this.#o()), r.setBindGroup(0, this.#i), r.dispatchWorkgroups(...d(n)), r.end();
+		i.setPipeline(this.#n ??= this.#c()), i.setBindGroup(0, this.#i), i.dispatchWorkgroups(r), i.end();
 	}
-	#o() {
+	#c() {
 		let e = this.#r, t = e.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(", ")}));`;
 		}), n = [
 			O,
-			le,
+			ce,
 			...e.map(({ shade: e }) => e.wgsl),
 			"fn shade(s: ptr<function, Splat>) {",
 			...t,
@@ -531,10 +593,10 @@ var ie = class {
 			}
 		});
 	}
-}, de = "// 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", fe = "rgb10a2unorm", pe = "depth16unorm", me = {
+}, ue = "// 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", de = "rgb10a2unorm", fe = "depth16unorm", pe = {
 	srcFactor: "one",
 	dstFactor: "one-minus-src-alpha"
-}, he = class {
+}, me = class {
 	#e;
 	#t;
 	#n;
@@ -567,7 +629,7 @@ var ie = class {
 		]);
 		let a = e.createShaderModule({
 			label: "raster",
-			code: O + de
+			code: O + ue
 		}), o = e.createPipelineLayout({ bindGroupLayouts: [i] }), s = (t, n) => e.createRenderPipeline({
 			label: `raster ${t}`,
 			layout: o,
@@ -579,10 +641,10 @@ var ie = class {
 				module: a,
 				entryPoint: "fs",
 				targets: [{
-					format: fe,
+					format: de,
 					blend: {
-						color: me,
-						alpha: me
+						color: pe,
+						alpha: pe
 					}
 				}]
 			},
@@ -590,7 +652,7 @@ var ie = class {
 			depthStencil: n
 		});
 		this.#n = s("Colour"), this.#r = s("Depth", {
-			format: pe,
+			format: fe,
 			depthWriteEnabled: !0,
 			depthCompare: "always"
 		});
@@ -618,7 +680,7 @@ var ie = class {
 		this.#t.destroy();
 	}
 };
-function ge(e, t, n, r, i, a, o) {
+function he(e, t, n, r, i, a, o) {
 	let { width: s, height: c } = n, l = Math.ceil(s * 2 / 256) * 256, u = e.createBuffer({
 		label: "pick",
 		size: l * c,
@@ -636,7 +698,7 @@ function ge(e, t, n, r, i, a, o) {
 }
 //#endregion
 //#region src/engine/gpu/sort.wgsl?raw
-var _e = "// lsd radix sort, 8 bits a pass: block digit counts, a two-level scan, a stable scatter; no spin-waits\n\nconst THREADS: u32 = 256u;\nconst ITEMS: u32 = 4u;\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> sk: array<u32, BLOCK>;\nvar<workgroup> sv: array<u32, BLOCK>;\nvar<workgroup> counts: array<vec4u, THREADS>;\nvar<workgroup> starts: array<u32, DIGITS>;\nvar<workgroup> offsets: array<u32, DIGITS>;\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	let block = wid.y * groups.x + wid.x;\n	if (block >= state.blocks) {\n		return;\n	}\n	atomicStore(&bins[t], 0u);\n	workgroupBarrier();\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	hist[block * DIGITS + t] = atomicLoad(&bins[t]);\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	workgroupBarrier();\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 block = wid.y * groups.x + wid.x;\n	if (block >= state.blocks) {\n		return;\n	}\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	offsets[t] = hist[block * DIGITS + t];\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		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;\n		workgroupBarrier();\n		for (var o = 1u; o < THREADS; o *= 2u) {\n			var x = vec4u(0u);\n			if (t >= o) {\n				x = counts[t - o];\n			}\n			workgroupBarrier();\n			counts[t] += x;\n			workgroupBarrier();\n		}\n		let total = counts[THREADS - 1u];\n		let prior = counts[t] - mine;\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}\n", ve = 1024, ye = 64, be = 256, N = 3, P = 256, xe = 32, Se = class {
+var ge = "// 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", P = 1024, _e = 64, ve = 256, F = 3, I = 256, ye = 32, be = class {
 	keys;
 	values;
 	bytes;
@@ -646,25 +708,24 @@ var _e = "// lsd radix sort, 8 bits a pass: block digit counts, a two-level scan
 	#r;
 	#i;
 	#a;
-	#o;
 	constructor(e, t) {
 		let { capacity: n } = t;
 		this.keys = n * 8, this.values = n * 12;
-		let r = Math.max(1, Math.ceil(n / ve));
-		this.#a = d(r), this.#o = Math.ceil(r / ye);
-		let i = (t, n, r) => e.createBuffer({
+		let r = Math.max(1, Math.ceil(n / P));
+		this.#a = r;
+		let i = Math.ceil(r / _e), a = (t, n, r) => e.createBuffer({
 			label: t,
 			size: n,
 			usage: r
-		}), a = GPUBufferUsage.STORAGE, o = i("sort params", N * P, GPUBufferUsage.UNIFORM | GPUBufferUsage.COPY_DST), s = i("sort histograms", r * be * 4, a), c = i("sort chunk sums", this.#o * be * 4, a), u = i("sort state", 12, a);
+		}), o = GPUBufferUsage.STORAGE, s = a("sort params", F * I, GPUBufferUsage.UNIFORM | GPUBufferUsage.COPY_DST), c = a("sort histograms", r * ve * 4, o), u = a("sort chunk sums", (i * ve + 1) * 4, o), d = a("sort state", 12, o);
 		this.#e = [
-			o,
 			s,
 			c,
-			u
+			u,
+			d
 		], this.bytes = this.#e.reduce((e, t) => e + t.size, 0);
-		let f = new Uint32Array(N * P / 4);
-		for (let e = 0; e < N; e++) {
+		let f = new Uint32Array(F * I / 4);
+		for (let e = 0; e < F; e++) {
 			let [t, r] = e % 2 ? [2 * n, 0] : [0, 2 * n];
 			f.set([
 				8 * e,
@@ -673,9 +734,9 @@ var _e = "// lsd radix sort, 8 bits a pass: block digit counts, a two-level scan
 				n,
 				l.projected,
 				l.drawArgs
-			], e * P / 4);
+			], e * I / 4);
 		}
-		e.queue.writeBuffer(o, 0, f);
+		e.queue.writeBuffer(s, 0, f);
 		let p = (e, t) => ({
 			binding: e,
 			visibility: GPUShaderStage.COMPUTE,
@@ -695,7 +756,7 @@ var _e = "// lsd radix sort, 8 bits a pass: block digit counts, a two-level scan
 			]
 		}), g = e.createShaderModule({
 			label: "sort",
-			code: O + _e
+			code: O + ge
 		}), _ = (t, n) => e.createComputePipeline({
 			label: `sort ${t}`,
 			layout: e.createPipelineLayout({ bindGroupLayouts: [n] }),
@@ -712,9 +773,9 @@ var _e = "// lsd radix sort, 8 bits a pass: block digit counts, a two-level scan
 			"scatter"
 		].map((e) => _(e, m));
 		let v = (e) => ({
-			buffer: o,
-			offset: e * P,
-			size: xe
+			buffer: s,
+			offset: e * I,
+			size: ye
 		});
 		this.#r = e.createBindGroup({
 			label: "sort prepare",
@@ -726,14 +787,14 @@ var _e = "// lsd radix sort, 8 bits a pass: block digit counts, a two-level scan
 				},
 				{
 					binding: 5,
-					resource: { buffer: u }
+					resource: { buffer: d }
 				},
 				{
 					binding: 6,
 					resource: { buffer: t.work }
 				}
 			]
-		}), this.#i = Array.from({ length: N }, (n, r) => e.createBindGroup({
+		}), this.#i = Array.from({ length: F }, (n, r) => e.createBindGroup({
 			label: `sort pass ${r}`,
 			layout: m,
 			entries: [
@@ -747,32 +808,32 @@ var _e = "// lsd radix sort, 8 bits a pass: block digit counts, a two-level scan
 				},
 				{
 					binding: 2,
-					resource: { buffer: s }
+					resource: { buffer: c }
 				},
 				{
 					binding: 3,
-					resource: { buffer: c }
+					resource: { buffer: u }
 				},
 				{
 					binding: 4,
-					resource: { buffer: u }
+					resource: { buffer: d }
 				}
 			]
 		}));
 	}
-	encode(e, t) {
-		let [n, r, i, a, o] = this.#n, s = this.#a, c = e.beginComputePass({
+	encode(e, t, n, r) {
+		let [i, a, o, s, c] = this.#n, l = Math.max(1, Math.min(this.#a, Math.ceil(t / P))), u = Math.max(l / 16, (n || t) / P), f = d(Math.min(Math.ceil(l / 4), Math.ceil(u))), p = Math.ceil(l / _e), m = e.beginComputePass({
 			label: "sort",
-			timestampWrites: t
+			timestampWrites: r
 		});
-		c.setPipeline(this.#t), c.setBindGroup(0, this.#r), c.dispatchWorkgroups(1);
-		for (let e of this.#i) c.setBindGroup(0, e), c.setPipeline(n), c.dispatchWorkgroups(...s), c.setPipeline(r), c.dispatchWorkgroups(this.#o), c.setPipeline(i), c.dispatchWorkgroups(1), c.setPipeline(a), c.dispatchWorkgroups(this.#o), c.setPipeline(o), c.dispatchWorkgroups(...s);
-		c.end();
+		m.setPipeline(this.#t), m.setBindGroup(0, this.#r), m.dispatchWorkgroups(1);
+		for (let e of this.#i) m.setBindGroup(0, e), m.setPipeline(i), m.dispatchWorkgroups(...f), m.setPipeline(a), m.dispatchWorkgroups(p), m.setPipeline(o), m.dispatchWorkgroups(1), m.setPipeline(s), m.dispatchWorkgroups(p), m.setPipeline(c), m.dispatchWorkgroups(...f);
+		m.end();
 	}
 	destroy() {
 		for (let e of this.#e) e.destroy();
 	}
-}, Ce = class {
+}, xe = class {
 	ms = {};
 	#e;
 	#t;
@@ -799,7 +860,7 @@ var _e = "// lsd radix sort, 8 bits a pass: block digit counts, a two-level scan
 	}
 	writes(e) {
 		let t = this.#t;
-		if (!t) return;
+		if (!t || this.#i) return;
 		let n = this.#e.indexOf(e);
 		return {
 			querySet: t,
@@ -823,14 +884,14 @@ var _e = "// lsd radix sort, 8 bits a pass: block digit counts, a two-level scan
 	destroy() {
 		this.#t?.destroy(), this.#n?.destroy(), this.#r?.destroy();
 	}
-}, we = [
+}, Se = [
 	"cull",
 	"project",
 	"sort",
 	"raster",
 	"heights",
 	"post"
-], F = {
+], L = {
 	view: 0,
 	proj: 16,
 	viewProj: 32,
@@ -843,7 +904,7 @@ var _e = "// lsd radix sort, 8 bits a pass: block digit counts, a two-level scan
 	far: 81,
 	lowPass: 82,
 	clusters: 83
-}, Te = class {
+}, Ce = class {
 	#e;
 	#t;
 	#n;
@@ -869,11 +930,12 @@ var _e = "// lsd radix sort, 8 bits a pass: block digit counts, a two-level scan
 	#S;
 	#C = !1;
 	#w = 0;
+	#T = 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 = T(i, r, n.slots), this.#a = new j(i, n, this.#i), this.#o = new ue(i, n, this.#i), this.#s = new Se(i, this.#i), this.#c = new he(i, this.#i, this.#s), this.#u = new ie(i, n), this.#d = new Ce(i, e.timestamps, we), this.#S = i.createBuffer({
-			label: "drawn readback",
-			size: 4,
+		this.#e = i, this.#t = t, this.#n = e.format, this.#r = n, this.#i = T(i, r, n.slots), this.#a = new j(i, n, this.#i), this.#o = new le(i, n, this.#i), this.#s = new be(i, this.#i), this.#c = new me(i, this.#i, this.#s), this.#u = new re(i, n), this.#d = new xe(i, e.timestamps, Se), this.#S = i.createBuffer({
+			label: "counts readback",
+			size: (l.projected + 1) * 4,
 			usage: GPUBufferUsage.COPY_DST | GPUBufferUsage.MAP_READ
 		}), this.#b = Math.max(1, t.canvas.width), this.#x = Math.max(1, t.canvas.height);
 	}
@@ -883,9 +945,9 @@ var _e = "// lsd radix sort, 8 bits a pass: block digit counts, a two-level scan
 			shade: e,
 			slot: 0
 		};
-		return this.#g.push(t), this.#T(), () => {
+		return this.#g.push(t), this.#E(), () => {
 			let e = this.#g.indexOf(t);
-			e < 0 || (this.#g.splice(e, 1), this.#T());
+			e < 0 || (this.#g.splice(e, 1), this.#E());
 		};
 	}
 	post(e) {
@@ -899,16 +961,16 @@ var _e = "// lsd radix sort, 8 bits a pass: block digit counts, a two-level scan
 		};
 	}
 	resize(e, t) {
-		(e !== this.#b || t !== this.#x) && (this.#b = e, this.#x = t, this.#A());
+		(e !== this.#b || t !== this.#x) && (this.#b = e, this.#x = t, this.#j());
 	}
 	render(e, t, n, r, i) {
-		let a = this.#e, o = this.#d, s = this.#_, c = this.#O(this.#D("colour", fe)), u = r.length > 0 || s.some(({ post: e }) => e.depth), d = this.#k("depth", pe, u), f = d ? this.#O(d) : null, p = [this.#k("ping", this.#n, s.length > 1), this.#k("pong", this.#n, s.length > 2)];
-		this.#E(e, t);
+		let a = this.#e, o = this.#d, s = this.#_, c = this.#k(this.#O("colour", de)), u = r.length > 0 || s.some(({ post: e }) => e.depth), d = this.#A("depth", fe, u), f = d ? this.#k(d) : null, p = [this.#A("ping", this.#n, s.length > 1), this.#A("pong", this.#n, s.length > 2)];
+		this.#D(e, t);
 		let m = a.createCommandEncoder({ label: "frame" });
-		m.clearBuffer(this.#i.work, 0, l.list * 4), this.#a.encode(m, o.writes("cull")), this.#o.encode(m, o.writes("project")), this.#s.encode(m, o.writes("sort")), this.#c.encode(m, c, f, n, o.writes("raster"));
+		m.clearBuffer(this.#i.work, 0, l.list * 4), this.#a.encode(m, o.writes("cull")), this.#o.encode(m, this.#T, o.writes("project")), this.#s.encode(m, this.#r.listed * 256, this.#w, o.writes("sort")), this.#c.encode(m, c, f, n, o.writes("raster"));
 		let h = d ? r.map(({ x: t, y: n, resolve: r }) => ({
 			resolve: r,
-			read: ge(a, m, d, t, n, e.near, e.far)
+			read: he(a, m, d, t, n, e.near, e.far)
 		})) : [], g = i.map(({ x: e, y: t, cells: n, resolve: r }, i) => ({
 			resolve: r,
 			read: this.#u.encode(m, e, t, n, i ? void 0 : o.writes("heights"))
@@ -921,11 +983,11 @@ var _e = "// lsd radix sort, 8 bits a pass: block digit counts, a two-level scan
 			} }).end();
 		}
 		let v = this.#t.getCurrentTexture().createView();
-		if (!s.length) this.#l ??= ce(a, this.#n), this.#l.encode(m, [c], v);
+		if (!s.length) this.#l ??= se(a, this.#n), this.#l.encode(m, [c], v);
 		else {
 			let t = c;
 			s.forEach(({ post: n, pass: r }, i) => {
-				let a = i === s.length - 1 ? v : this.#O(p[i % 2]);
+				let a = i === s.length - 1 ? v : this.#k(p[i % 2]);
 				r.run(m, e, t, n.depth ? f : null, a), t = a;
 			});
 		}
@@ -938,7 +1000,7 @@ var _e = "// lsd radix sort, 8 bits a pass: block digit counts, a two-level scan
 		}
 		o.resolve(m);
 		let y = !this.#C;
-		y && m.copyBufferToBuffer(this.#i.work, l.projected * 4, this.#S, 0, 4), a.queue.submit([m.finish()]), o.read(), y && this.#j();
+		y && m.copyBufferToBuffer(this.#i.work, 0, this.#S, 0, this.#S.size), a.queue.submit([m.finish()]), o.read(), y && this.#M();
 		for (let { resolve: e, read: t } of h) t().then(e);
 		for (let { resolve: e, read: t } of g) t().then(e);
 		return a.queue.onSubmittedWorkDone();
@@ -955,20 +1017,20 @@ var _e = "// lsd radix sort, 8 bits a pass: block digit counts, a two-level scan
 	}
 	destroy() {
 		for (let { pass: e } of this.#_.splice(0)) e.destroy();
-		this.#A(), this.#i.destroy(), this.#s.destroy(), this.#c.destroy(), this.#d.destroy(), this.#S.destroy();
+		this.#j(), this.#i.destroy(), this.#s.destroy(), this.#c.destroy(), this.#d.destroy(), this.#S.destroy();
 	}
-	#T() {
+	#E() {
 		let e = 0;
 		for (let t of this.#g) t.slot = e, e += t.shade.uniforms;
 		this.#o.hooks(this.#g);
 	}
-	#E(e, t) {
+	#D(e, t) {
 		let n = this.#f, [r, i] = [this.#b, this.#x];
-		n.set(e.view, F.view), n.set(e.proj, F.proj), n.set(S(this.#m, e.proj, e.view), F.viewProj), n.set(t, F.planes), n.set(e.camera.subarray(0, 3), F.camera), n[F.time] = e.time, n.set([r, i], F.viewport), n.set([e.proj[0] * r / 2, e.proj[5] * i / 2], F.focal), n[F.near] = e.near, n[F.far] = e.far, n[F.lowPass] = f, this.#p[F.clusters] = this.#r.listed, this.#e.queue.writeBuffer(this.#i.uniforms, 0, n);
+		n.set(e.view, L.view), n.set(e.proj, L.proj), n.set(S(this.#m, 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] = f, this.#p[L.clusters] = this.#r.listed, this.#e.queue.writeBuffer(this.#i.uniforms, 0, n);
 		for (let { shade: t, slot: n } of this.#g) t.update(e, this.#h.subarray(n * 4, (n + t.uniforms) * 4));
-		this.#e.queue.writeBuffer(this.#i.plugins, 0, this.#h);
+		this.#g.length && this.#e.queue.writeBuffer(this.#i.plugins, 0, this.#h);
 	}
-	#D(e, t) {
+	#O(e, t) {
 		let n = this.#v[e];
 		return n || (n = this.#e.createTexture({
 			label: e,
@@ -977,27 +1039,27 @@ var _e = "// lsd radix sort, 8 bits a pass: block digit counts, a two-level scan
 			usage: GPUTextureUsage.RENDER_ATTACHMENT | GPUTextureUsage.TEXTURE_BINDING | GPUTextureUsage.COPY_SRC
 		}), this.#v[e] = n), n;
 	}
-	#O(e) {
+	#k(e) {
 		let t = this.#y.get(e);
 		return t || this.#y.set(e, t = e.createView()), t;
 	}
-	#k(e, t, n) {
-		if (n) return this.#D(e, t);
+	#A(e, t, n) {
+		if (n) return this.#O(e, t);
 		this.#v[e]?.destroy(), delete this.#v[e];
 	}
-	#A() {
+	#j() {
 		for (let e of Object.values(this.#v)) e?.destroy();
 		this.#v = {};
 	}
-	#j() {
+	#M() {
 		this.#C = !0;
 		let e = this.#S;
 		e.mapAsync(GPUMapMode.READ).then(() => {
-			let t = new Uint32Array(e.getMappedRange())[0];
-			this.#w = Math.min(t, this.#i.capacity), e.unmap();
+			let t = new Uint32Array(e.getMappedRange());
+			this.#T = t[l.visible], this.#w = Math.min(t[l.projected], this.#i.capacity), e.unmap();
 		}).catch(() => {}).finally(() => this.#C = !1);
 	}
-}, Ee = [
+}, we = [
 	[0, 1],
 	[0, -1],
 	[1, 1],
@@ -1005,199 +1067,52 @@ var _e = "// lsd radix sort, 8 bits a pass: block digit counts, a two-level scan
 	[2, 0],
 	[2, -1]
 ];
-function De(e, t) {
+function Te(e, t) {
 	let n = (e, n) => t[n * 4 + e];
-	return Ee.forEach(([t, r], i) => {
+	return we.forEach(([t, r], i) => {
 		for (let a = 0; a < 4; a++) e[i * 4 + a] = r ? n(3, a) + r * n(t, a) : n(t, a);
 		let a = Math.hypot(e[i * 4], e[i * 4 + 1], e[i * 4 + 2]) || 1;
 		for (let t = 0; t < 4; t++) e[i * 4 + t] /= a;
 	}), e;
 }
-//#endregion
-//#region src/engine/plan/footprint.ts
-function Oe(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 ke(e, t, n, r, i, a, o, s = 1, c = {
-	pixels: 0,
-	weight: 1
-}) {
-	let l = (e[0] + e[3]) / 2, u = (e[1] + e[4]) / 2, d = (e[2] + e[5]) / 2, f = (e[3] - e[0]) / 2, p = (e[4] - e[1]) / 2, m = (e[5] - e[2]) / 2, h = t[0] * l + t[4] * u + t[8] * d + t[12], g = t[1] * l + t[5] * u + t[9] * d + t[13], _ = -(t[2] * l + t[6] * u + t[10] * d + t[14]), v = Math.abs(t[0]) * f + Math.abs(t[4]) * p + Math.abs(t[8]) * m, y = Math.abs(t[1]) * f + Math.abs(t[5]) * p + Math.abs(t[9]) * m, b = Math.abs(t[2]) * f + Math.abs(t[6]) * p + Math.abs(t[10]) * m;
-	if (c.pixels = 0, c.weight = 1, _ + b < a || _ - b > o) return c;
-	let x = Math.max(a, _ - b), S = Math.max(a, _ + b), C = i * n / r, w = Math.min((h - v) / x, (h - v) / S) / C, T = Math.max((h + v) / x, (h + v) / S) / C, E = Math.min((g - y) / x, (g - y) / S) / i, D = Math.max((g + y) / x, (g + y) / S) / i;
-	if (T < -s || w > s || D < -s || E > s) return c;
-	let O = Math.max(-s, w), k = Math.min(s, T), A = Math.max(-s, E), j = Math.min(s, D), M = (T - w) * (D - E), ee = (k - O) * (j - A);
-	return M <= 0 || ee <= 0 || (c.pixels = M * n * r / 4, c.weight = Oe(O, k, A, j)), c;
-}
-//#endregion
-//#region src/engine/plan/cut.ts
-var Ae = 1 / .8 ** 2, je = 1500, Me = 1.1, Ne = class {
-	#e = /* @__PURE__ */ new Map();
-	#t = /* @__PURE__ */ new Map();
-	#n = /* @__PURE__ */ new Float64Array(6);
-	#r = {
-		pixels: 0,
-		weight: 1
-	};
-	plan(e, t, n, r) {
-		let { budget: i, capacity: a, now: o, predicted: s } = r, l = [], u = /* @__PURE__ */ new Map(), d = /* @__PURE__ */ new Map(), f = /* @__PURE__ */ new Map(), p = new Fe(), m = 0, h = 0, g = /* @__PURE__ */ new Set(), _ = /* @__PURE__ */ new Set(), v = (e, t) => {
-			let r = e.row.count;
-			l.push(e), h += c(r), t.shown && (m += r, _.add(e.id)), t.near && g.add(e.id);
-			let i = this.#e.get(e.id), a = i !== void 0, s = t.pixels * t.weight, u = s / Math.max(1, r);
-			t.pixels > 0 && f.set(e.id, u);
-			let d = o - (this.#t.get(e.id) ?? -Infinity) <= je, v = a && !t.shown && d ? i : null;
-			(r < s * (a ? Ae : 1) || v !== null) && Pe(e, n) && p.push({
-				page: e,
-				shown: t.shown,
-				held: v,
-				ratio: u
-			});
-		};
-		for (let n of e.roots) v(n, this.#i(n, t, s));
-		let y = !1;
-		for (; p.size;) {
-			let { page: e, shown: n, held: r } = p.pop(), l = [], f = 0;
-			if (e.children.forEach((e, n) => {
-				if (!e) return;
-				let i = this.#i(e, t, s);
-				i.pixels <= 0 && !((r ?? 0) & 1 << n) || (l.push({
-					child: e,
-					m: i
-				}), f |= 1 << n);
-			}), !l.length) continue;
-			let g = 0, _ = n ? -e.row.count : 0;
-			for (let { child: e, m: t } of l) g += c(e.row.count), t.shown && (_ += e.row.count);
-			if (h + g > a) break;
-			if (_ > 0 && (y || m + _ > i)) {
-				y = !0;
-				continue;
-			}
-			u.set(e.id, f);
-			let b = n ? o : this.#t.get(e.id);
-			b !== void 0 && d.set(e.id, b), n && (m -= e.row.count);
-			for (let { child: e, m: t } of l) v(e, t);
-		}
-		this.#e = u, this.#t = d;
-		let b = l.filter((e) => !u.has(e.id)), x = new Set(u.keys());
-		for (let e of b) x.add(e.id);
-		let S = [];
-		for (let t of e.wanted()) {
-			let e = -1;
-			for (let n of t.over) e = Math.max(e, f.get(n.id) ?? -1);
-			e >= 0 && S.push({
-				wanted: t,
-				rank: e
-			});
-		}
-		S.sort((e, t) => t.rank - e.rank);
-		let C = 0;
-		for (let e of b) _.has(e.id) && !n(e.id) && (C += e.row.count);
-		return {
-			cut: b,
-			load: b.filter((e) => !n(e.id) && (g.has(e.id) || !s && C === 0)),
-			idx: S.map((e) => e.wanted),
-			keep: x,
-			planned: m,
-			missing: C
-		};
-	}
-	#i(e, t, n) {
-		let r = this.#a(e, t, 1).pixels > 0, { pixels: i, weight: a } = this.#a(e, t, Me), o = r;
-		if (n) {
-			let t = this.#a(e, n, Me);
-			t.pixels > i && ({pixels: i, weight: a} = t), o ||= t.pixels > 0 && this.#a(e, n, 1).pixels > 0;
-		}
-		return {
-			shown: r,
-			near: o,
-			pixels: i,
-			weight: a
-		};
-	}
-	#a(e, t, n) {
-		let r = this.#n;
-		for (let n = 0; n < 6; n++) r[n] = e.box[n] - t.origin[n % 3];
-		let { width: i, height: a, tan: o, near: s, far: c } = t;
-		return ke(r, t.view, i, a, o, s, c, n, this.#r);
-	}
-};
-function Pe(e, t) {
-	let { children: n } = e;
-	return t(e.id) && !n.includes(void 0) && n.some((e) => e !== null);
-}
-var Fe = class {
-	#e = [];
-	get size() {
-		return this.#e.length;
-	}
-	push(e) {
-		let t = this.#e;
-		t.push(e);
-		let n = t.length - 1;
-		for (; n > 0;) {
-			let e = n - 1 >> 1;
-			if (!I(t[n], t[e])) break;
-			[t[n], t[e]] = [t[e], t[n]], n = e;
-		}
-	}
-	pop() {
-		let e = this.#e, t = e[0], n = e.pop();
-		if (e.length) {
-			e[0] = n;
-			let t = 0;
-			for (;;) {
-				let n = 2 * t + 1, r = t;
-				if (n < e.length && I(e[n], e[r]) && (r = n), n + 1 < e.length && I(e[n + 1], e[r]) && (r = n + 1), r === t) break;
-				[e[t], e[r]] = [e[r], e[t]], t = r;
-			}
-		}
-		return t;
-	}
-};
-function I(e, t) {
-	return e.shown === t.shown ? e.ratio > t.ratio : e.shown;
-}
-var L = .25, Ie = class {
+var R = .25, Ee = class {
 	#e = /* @__PURE__ */ new Map();
 	update(e, t, n, r) {
-		let i = this.#e, a = Le(e, t);
-		for (let [e, r] of i) t(r.page.id) ? r.held || (r.start !== null && n - r.start >= 250 && (r.start = null), a.has(e) || (r.frozen = Be(r, n), r.start = null, r.held = !0)) : i.delete(e);
-		let o = /* @__PURE__ */ new Set();
+		let i = this.#e, a = De(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 = Ae(r, n), r.start = null, r.held = !0))) : i.delete(e);
+		let s = /* @__PURE__ */ new Set();
 		for (let [e, t] of a) {
 			let r = i.get(e);
-			if (r) r.held && (r.held = !1, r.frozen < 255 && (r.start = n - r.frozen / 255 * 250, o.add(r)));
+			if (r) r.held && (r.held = !1, r.frozen < 255 && (r.start = n - r.frozen / 255 * 250, s.add(r)));
 			else {
-				let r = Re(t, e % 4, n);
-				i.set(e, r), o.add(r);
+				let r = Oe(t, e % 4, n);
+				o = Math.max(o, r.level), i.set(e, r), s.add(r);
 			}
 		}
-		let s = -1;
-		for (let e of i.values()) s = Math.max(s, e.level);
 		let l = /* @__PURE__ */ new Map(), u = /* @__PURE__ */ new Map();
 		for (let e of i.values()) if (e.held) {
 			l.set(e.cell, e);
-			for (let t = e.level, n = e.col, r = e.row; t <= s; t++, n >>= 1, r >>= 1) {
-				let i = R(t, n, r), a = u.get(i);
+			for (let t = e.level, n = e.col, r = e.row; t <= o; t++, n >>= 1, r >>= 1) {
+				let i = z(t, n, r), a = u.get(i);
 				a ? a.push(e) : u.set(i, [e]);
 			}
 		}
 		let d = (e) => {
 			let t = [...u.get(e.cell) ?? []];
-			for (let n = e.level + 1, r = e.col >> 1, i = e.row >> 1; n <= s; n++, r >>= 1, i >>= 1) {
-				let e = l.get(R(n, r, i));
+			for (let n = e.level + 1, r = e.col >> 1, i = e.row >> 1; n <= o; n++, r >>= 1, i >>= 1) {
+				let e = l.get(z(n, r, i));
 				e && t.push(e);
 			}
 			return t;
 		}, f = /* @__PURE__ */ new Set(), p = /* @__PURE__ */ new Set(), m = 0, h = 0, g = (e) => {
 			p.has(e) || (p.add(e), h += c(e.row.count));
 		};
-		for (let e of i.values()) if (!(e.held || e.start === null || o.has(e))) {
+		for (let e of i.values()) if (!(e.held || e.start === null || s.has(e))) {
 			m += e.splats;
 			for (let t of d(e)) f.has(t) || (f.add(t), m += t.splats, g(t.page));
 		}
-		let _ = L * r;
-		for (let e of o) {
+		let _ = R * r;
+		for (let e of s) {
 			let t = d(e).filter((e) => !f.has(e)), n = t.reduce((e, t) => e + t.splats, e.splats), r = new Set(t.map((e) => e.page).filter((e) => !p.has(e))), i = [...r].reduce((e, t) => e + c(t.row.count), 0);
 			if (m + n > _ || h + i > _) e.start = null;
 			else {
@@ -1206,16 +1121,19 @@ var L = .25, Ie = class {
 				for (let e of r) g(e);
 			}
 		}
-		for (let [e, t] of i) t.held && !f.has(t) && i.delete(e);
 		let v = /* @__PURE__ */ new Map(), y = !1;
-		for (let e of i.values()) {
-			(e.held || e.start !== null) && (y = !0);
-			let t = Be(e, n);
-			if (!t) continue;
-			let r = v.get(e.page.id);
-			r ? r.factors = (r.factors | t << 8 * e.q) >>> 0 : v.set(e.page.id, {
-				id: e.page.id,
-				factors: t << 8 * e.q >>> 0
+		for (let [e, t] of i) {
+			if (t.held && !f.has(t)) {
+				i.delete(e);
+				continue;
+			}
+			(t.held || t.start !== null) && (y = !0);
+			let r = Ae(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, {
+				id: t.page.id,
+				factors: r << 8 * t.q >>> 0
 			});
 		}
 		return {
@@ -1224,19 +1142,19 @@ var L = .25, Ie = class {
 		};
 	}
 };
-function Le(e, t) {
+function De(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) => {
 		for (let i = 0; i < 4; i++) {
 			let s = e.children[i];
-			s && t(s.id) && r.has(s) ? o(s) : (s !== null || n.has(e)) && a.set(e.id * 4 + i, e);
+			s && r.has(s) && t(s.id) ? o(s) : (s !== null || n.has(e)) && a.set(e.id * 4 + i, e);
 		}
 	};
 	for (let e of i) t(e.id) && o(e);
 	return a;
 }
-function Re(t, n, r) {
+function Oe(t, n, r) {
 	let i = e * 2 ** t.g, a = t.g - 1, o = 2 * (Math.round(t.unit.e / i) + t.row.i) + (n & 1), s = 2 * (Math.round(t.unit.n / i) + t.row.j) + (n >> 1);
 	return {
 		page: t,
@@ -1244,121 +1162,503 @@ function Re(t, n, r) {
 		level: a,
 		col: o,
 		row: s,
-		cell: R(a, o, s),
-		splats: ze(t.row, n),
+		cell: z(a, o, s),
+		splats: ke(t.row, n),
 		start: r,
 		frozen: 0,
 		held: !1
 	};
 }
-var R = (e, t, n) => ((e + 1) * 2 ** 21 + t) * 2 ** 21 + n;
-function ze({ count: e, quadrants: t }, n) {
+var z = (e, t, n) => ((e + 1) * 2 ** 21 + t) * 2 ** 21 + n;
+function ke({ count: e, quadrants: t }, n) {
 	return (n < 3 ? t[n] : e) - (n > 0 ? t[n - 1] : 0);
 }
-function Be(e, t) {
+function Ae(e, t) {
 	return e.held ? e.frozen : e.start === null ? 255 : Math.min(255, Math.round((t - e.start) / 250 * 255));
 }
 //#endregion
-//#region src/engine/quality.ts
-var Ve = 5e5, He = 2073600, Ue = [1, .85];
-function We(e, t, n, r) {
-	return Math.min(n, Math.sqrt(He / Math.max(1, e * t))) * r;
+//#region src/engine/plan/footprint.ts
+var je = [
+	0,
+	0,
+	0
+];
+function Me(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 z(e, t) {
-	if (!e.length) return 0;
-	let n = [...e].sort((e, t) => e - t);
-	return n[Math.ceil(n.length * t) - 1];
+function Ne(e, t, n, r, i, a, o, s = 1, c = {
+	shown: !1,
+	pixels: 0,
+	weight: 1
+}, l = je) {
+	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), 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 = Me(k, A, j, M)), c;
 }
-var Ge = class {
-	#e = 0;
-	#t = [];
-	#n = -Infinity;
-	#r = 0;
-	#i = 0;
-	get scale() {
-		return Ue[this.#e];
-	}
-	full() {
-		this.#e = 0, this.#a();
-	}
-	#a() {
-		this.#t = [], this.#r = 0, this.#i = 0, this.#n = -Infinity;
-	}
-	sample(e, t, n) {
-		if (!n || t - this.#n > 250 || !Number.isFinite(e) || e <= 0) return this.#a(), this.#n = t, !1;
-		let r = Math.max(0, t - this.#n);
-		if (this.#n = t, this.#t.push({
-			time: t,
-			ms: e
-		}), this.#t = this.#t.filter((e) => t - e.time <= 1e3), this.#t.length < 20) return !1;
-		let i = z(this.#t.map((e) => e.ms), .9);
-		if (this.#r = i > 20 ? this.#r + r : 0, this.#i = i < 14 ? this.#i + r : 0, this.#r >= 2e3) {
-			if (this.#e < Ue.length - 1) this.#e++;
-			else return !1;
-		} else if (this.#i >= 5e3) {
-			if (this.#e > 0) this.#e--;
-			else return !1;
-		} else return !1;
-		return this.#a(), !0;
-	}
-}, Ke = class {
+var B = /* @__PURE__ */ new Float64Array(6), Pe = {
+	shown: !1,
+	pixels: 0,
+	weight: 1
+};
+function Fe(e, [t, n, r], i, a, o, s, c, l, u = je) {
+	let d = r / 2, f = Math.max(0, t - e[0], n - e[1], e[3] - t - r, e[4] - n - r);
+	B[2] = e[2], B[5] = e[5];
+	let p = 0;
+	for (let r = 0; r < 4; r++) {
+		let m = t + (r & 1) * d, h = n + (r >> 1) * d;
+		B[0] = Math.max(e[0], m - f), B[1] = Math.max(e[1], h - f), B[3] = Math.min(e[3], m + d + f), B[4] = Math.min(e[4], h + d + f), !(B[0] > B[3] || B[1] > B[4]) && Ne(B, i, a, o, s, c, l, 1, Pe, u).shown && (p |= 1 << r);
+	}
+	return p;
+}
+//#endregion
+//#region src/engine/world/tree.ts
+var V = (e, t, n) => (e * 256 + t) * 256 + n, Ie = class {
+	roots = [];
+	pages = /* @__PURE__ */ new Map();
+	units = /* @__PURE__ */ new Map();
 	#e;
-	#t = [];
-	#n = /* @__PURE__ */ new Set();
-	#r = /* @__PURE__ */ new Set();
-	#i = /* @__PURE__ */ new Set();
-	#a = /* @__PURE__ */ new Map();
+	#t;
+	#n = 0;
+	#r = /* @__PURE__ */ new Map();
+	#i = /* @__PURE__ */ new Map();
 	constructor(e) {
-		this.#e = e;
-	}
-	want(e) {
-		this.#t = e, this.#n = new Set(e.map((e) => e.id));
+		this.#e = new Set(e.roots.map(H)), this.#t = Math.max(...e.roots.map((e) => e.level));
 	}
-	next() {
-		let e = [];
-		for (let t of this.#r) this.#i.has(t) || t.pages.some((e) => this.#n.has(e.id)) || (this.#i.add(t), e.push(t));
-		let t = [];
-		if (this.#r.size >= this.#e.concurrency) return {
-			start: t,
-			abort: e
+	add(e, t) {
+		let n = H(e), r = this.units.get(n);
+		if (r) return r;
+		let o = /* @__PURE__ */ new Map(), s = {
+			level: e.level,
+			e: e.e,
+			n: e.n,
+			idx: e,
+			path: t,
+			parent: null,
+			pages: [],
+			grid: o
 		};
-		let n = /* @__PURE__ */ new Map();
-		for (let e of this.#t) {
-			if (this.#a.has(e.id)) continue;
-			let t = n.get(e.pack);
-			t ? t.push(e) : n.set(e.pack, [e]);
+		for (let t of e.rows) {
+			let n = t.box, r = {
+				id: this.#n++,
+				unit: s,
+				row: t,
+				g: t.g,
+				box: Float64Array.of(e.e + n[0], e.n + n[1], n[2], e.e + n[3], e.n + n[4], n[5]),
+				parent: null,
+				children: [
+					null,
+					null,
+					null,
+					null
+				]
+			};
+			this.pages.set(r.id, r), s.pages.push(r), o.set(V(t.g, t.i, t.j), r);
 		}
-		for (let e of n.values()) e.sort((e, t) => e.offset - t.offset);
-		for (let e of this.#t) {
-			if (this.#r.size >= this.#e.concurrency) break;
-			if (this.#a.has(e.id)) continue;
-			let r = this.#o(e, n.get(e.pack));
-			for (let e of r.pages) this.#a.set(e.id, r);
-			this.#r.add(r), t.push(r);
+		this.units.set(n, s), this.#r.delete(n);
+		for (let t = e.level + 1; t <= this.#t; t++) {
+			let n = H(U(e, t));
+			this.#i.set(n, (this.#i.get(n) ?? 0) + 1);
 		}
-		return {
-			start: t,
-			abort: e
-		};
-	}
-	done(e) {
-		if (this.#r.delete(e)) {
-			this.#i.delete(e);
-			for (let t of e.pages) this.#a.get(t.id) === e && this.#a.delete(t.id);
+		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 s.pages) {
+			let { g: t, i: n, j: r } = e.row;
+			c.has(t + 1) && (e.parent = o.get(V(t + 1, n >> 1, r >> 1)) ?? null);
+			for (let i = 0; i < 4; i++) {
+				let a = 2 * n + (i & 1), s = 2 * r + (i >> 1);
+				c.has(t - 1) ? e.children[i] = o.get(V(t - 1, a, s)) ?? null : t === u && t > 0 && (e.children[i] = d.has((a >> 3) + 2 * (s >> 3)) ? void 0 : null);
+			}
 		}
-	}
-	get queued() {
-		let e = 0;
-		for (let t of this.#n) this.#a.has(t) || e++;
-		return e;
-	}
-	get loading() {
-		return this.#a.size;
-	}
-	#o(e, t) {
-		let { gap: n, span: r } = this.#e, i = Math.floor(e.offset / r), a = t.indexOf(e), o = [e], s = e.offset, c = e.offset + e.length;
-		for (let e = a + 1; e < t.length; e++) {
-			let a = t[e];
+		if (this.#e.has(n)) for (let e of s.pages) e.g === l && this.roots.push(e);
+		else {
+			let t = this.units.get(H(U(e, e.level + 1)));
+			t && this.#o(t, s);
+		}
+		let f = a(s.idx);
+		for (let { key: t } of f) {
+			let n = t.level === e.level - 1 ? this.units.get(H(t)) : void 0;
+			n && this.#o(s, n);
+		}
+		for (let { key: e, hash: t } of f) {
+			let n = H(e);
+			if (this.units.has(n)) continue;
+			let r = this.#r.get(n);
+			if (r && r.from <= s.level) continue;
+			let a = this.#s(s, e), o = {
+				...e,
+				path: i(e, t, "idx"),
+				over: a
+			};
+			this.#r.set(n, {
+				wanted: o,
+				from: s.level
+			});
+		}
+		return s;
+	}
+	wanted() {
+		return Array.from(this.#r.values(), (e) => e.wanted);
+	}
+	ground(e, t) {
+		for (let n of this.roots) {
+			let [r, i, a] = W(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] = W(o);
+			}
+		}
+	}
+	async load(e, t, n) {
+		for (;;) {
+			let r = this.wanted().filter((n) => Le(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));
+		}
+	}
+	prune(e) {
+		let t = [], n = [...this.units.values()].sort((e, t) => e.level - t.level);
+		for (let r of n) {
+			let n = H(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 i = r.parent;
+			if (i) {
+				let e = 250 * 2 ** r.level, t = (r.e - i.e) / e, n = (r.n - i.n) / e, a = i.idx.children.some((e) => e.quadrant === t + 2 * n);
+				for (let e of this.#s(i, r)) e.children.fill(a ? void 0 : null);
+			}
+			this.units.delete(n);
+			for (let e = r.level + 1; e <= this.#t; e++) {
+				let t = H(U(r, e)), n = this.#i.get(t) - 1;
+				n ? this.#i.set(t, n) : this.#i.delete(t);
+			}
+			for (let { key: e } of a(r.idx)) this.#a(e);
+			this.#a(r);
+		}
+		return t;
+	}
+	#a(e) {
+		let t = H(e);
+		this.#r.delete(t);
+		for (let n = e.level + 1; n <= e.level + 3; n++) {
+			let r = this.units.get(H(U(e, n)));
+			if (!r) continue;
+			let o = a(r.idx).find((e) => H(e.key) === t);
+			if (!o) continue;
+			let s = {
+				level: e.level,
+				e: e.e,
+				n: e.n,
+				path: i(o.key, o.hash, "idx"),
+				over: this.#s(r, e)
+			};
+			this.#r.set(t, {
+				wanted: s,
+				from: r.level
+			});
+			return;
+		}
+	}
+	#o(e, t) {
+		t.parent = e;
+		let n = t.level + 1, r = 250 * 2 ** t.level, i = (t.e - e.e) / r, a = (t.n - e.n) / r, o = e.grid;
+		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(V(n + 1, t >> 1, r >> 1)) ?? null;
+			e.parent = s, s && (s.children[(t & 1) + 2 * (r & 1)] = e);
+		}
+	}
+	#s(t, n) {
+		let r = t.level + 1, i = e * 2 ** r, a = (n.e - t.e) / i, o = (n.n - t.n) / i, s = 250 * 2 ** n.level / i, c = [];
+		for (let e = o; e < o + s; e++) for (let n = a; n < a + s; n++) {
+			let i = t.grid.get(V(r, n, e));
+			i && c.push(i);
+		}
+		return c;
+	}
+};
+function H(e) {
+	return `${e.level}/${e.e}/${e.n}`;
+}
+function U(e, t) {
+	let n = 250 * 2 ** t;
+	return {
+		level: t,
+		e: Math.floor(e.e / n) * n,
+		n: Math.floor(e.n / n) * n
+	};
+}
+function Le(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 W(t) {
+	let n = e * 2 ** t.g;
+	return [
+		t.unit.e + t.row.i * n,
+		t.unit.n + t.row.j * n,
+		n
+	];
+}
+//#endregion
+//#region src/engine/plan/cut.ts
+var Re = 1 / .8 ** 2, ze = 1.1, Be = class {
+	#e = /* @__PURE__ */ new Map();
+	#t = /* @__PURE__ */ new Map();
+	#n = {
+		shown: !1,
+		pixels: 0,
+		weight: 1
+	};
+	plan(e, t, n, r) {
+		let { budget: i, capacity: a, now: o, predicted: s } = r, l = [], u = [], d = [], f = /* @__PURE__ */ new Map(), p = /* @__PURE__ */ new Map(), m = e.wanted(), h = /* @__PURE__ */ new Map(), g = new Ue(), _ = 0, v = 0, y = (e) => {
+			let t = e.page, r = t.row.count;
+			l.push(t), u.push(e.visible), d.push(e.near), v += c(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 ? Re : 1) || p !== null) && He(t, n) && g.push({
+				page: t,
+				shown: e.shown,
+				held: p,
+				visible: e.visible,
+				ratio: f
+			});
+		};
+		for (let n of e.roots) y(this.#r(n, t, s));
+		let b = [];
+		for (; g.size;) {
+			let e = g.pop(), { page: n, shown: r, held: l } = e, u = [], d = 0;
+			for (let e = 0; e < n.children.length; e++) {
+				let r = n.children[e];
+				if (!r) continue;
+				let i = this.#r(r, t, s);
+				i.pixels <= 0 && !((l ?? 0) & 1 << e) || (u.push(i), d |= 1 << e);
+			}
+			if (!u.length) continue;
+			let m = 0, h = -e.visible;
+			for (let e of u) m += c(e.page.row.count), h += e.visible;
+			if (v + m > a) break;
+			if (h > 0 && (b.length || _ + h > i)) {
+				b.push(e);
+				continue;
+			}
+			if (h < 0) for (let e of b.splice(0)) g.push(e);
+			f.set(n.id, d);
+			let x = r ? o : this.#t.get(n.id);
+			x !== void 0 && p.set(n.id, x), _ -= e.visible;
+			for (let e of u) y(e);
+		}
+		this.#e = f, this.#t = p;
+		let x = [], S = [], C = new Set(f.keys()), w = 0;
+		for (let e = 0; e < l.length; e++) {
+			let t = l[e];
+			f.has(t.id) || (x.push(t), C.add(t.id), n(t.id) || (w += u[e], S.push({
+				page: t,
+				near: d[e]
+			})));
+		}
+		let T = [];
+		for (let e of m) {
+			let t = -1;
+			for (let n of e.over) t = Math.max(t, h.get(n.id) ?? -1);
+			t >= 0 && T.push({
+				wanted: e,
+				rank: t
+			});
+		}
+		return T.sort((e, t) => t.rank - e.rank), {
+			cut: x,
+			load: S.filter(({ near: e }) => e || !s && w === 0).map(({ page: e }) => e),
+			idx: T.map((e) => e.wanted),
+			keep: C,
+			planned: _,
+			missing: w
+		};
+	}
+	#r(e, t, n) {
+		let r = this.#i(e, t, ze), i = r.shown, { pixels: a, weight: o } = r, s = i;
+		if (n) {
+			let t = this.#i(e, n, ze);
+			t.pixels > a && ({pixels: a, weight: o} = t), s ||= t.shown;
+		}
+		return {
+			page: e,
+			shown: i,
+			near: s,
+			visible: i ? Ve(e, t) : 0,
+			pixels: a,
+			weight: o
+		};
+	}
+	#i(e, t, n) {
+		let { width: r, height: i, tan: a, near: o, far: s } = t;
+		return Ne(e.box, t.view, r, i, a, o, s, n, this.#n, t.origin);
+	}
+};
+function Ve(e, t) {
+	let { width: n, height: r, tan: i, near: a, far: o, origin: s } = t, c = Fe(e.box, W(e), t.view, n, r, i, a, o, s), l = 0;
+	for (let t = 0; t < 4; t++) c & 1 << t && (l += ke(e.row, t));
+	return l;
+}
+function He(e, t) {
+	let { children: n } = e;
+	return e.g > 0 && t(e.id) && !n.includes(void 0) && n.some((e) => e !== null);
+}
+var Ue = class {
+	#e = [];
+	get size() {
+		return this.#e.length;
+	}
+	push(e) {
+		let t = this.#e;
+		t.push(e);
+		let n = t.length - 1;
+		for (; n > 0;) {
+			let r = n - 1 >> 1;
+			if (!G(e, t[r])) break;
+			t[n] = t[r], n = r;
+		}
+		t[n] = e;
+	}
+	pop() {
+		let e = this.#e, t = e[0], n = e.pop();
+		if (e.length) {
+			let t = 0;
+			for (; 2 * t + 1 < e.length;) {
+				let r = 2 * t + 1;
+				if (r + 1 < e.length && G(e[r + 1], e[r]) && r++, !G(e[r], n)) break;
+				e[t] = e[r], t = r;
+			}
+			e[t] = n;
+		}
+		return t;
+	}
+};
+function G(e, t) {
+	return e.shown === t.shown ? e.ratio > t.ratio : e.shown;
+}
+//#endregion
+//#region src/engine/quality.ts
+var We = 5e5, Ge = 2073600, Ke = [1, .85], qe = 30, Je = 55, Ye = 2e3, Xe = 5e3, Ze = 5e5, Qe = .9;
+function $e(e, t, n, r) {
+	return Math.min(n, Math.sqrt(Ge / Math.max(1, e * t))) * r;
+}
+function et(e, t) {
+	if (!e.length) return 0;
+	let n = [...e].sort((e, t) => e - t);
+	return n[Math.ceil(n.length * t) - 1];
+}
+var tt = class {
+	#e = 0;
+	#t;
+	#n;
+	#r;
+	#i = [];
+	#a = -Infinity;
+	#o = 0;
+	#s = 0;
+	constructor(e, [t, n] = [e, e]) {
+		this.#n = t, this.#r = Math.max(t, n), this.#t = Math.min(this.#r, Math.max(this.#n, e));
+	}
+	get scale() {
+		return Ke[this.#e];
+	}
+	get budget() {
+		return this.#t;
+	}
+	full() {
+		this.#e = 0, this.#c();
+	}
+	#c() {
+		this.#i = [], this.#o = 0, this.#s = 0, this.#a = -Infinity;
+	}
+	sample(e, t, n, r) {
+		if (!n || t - this.#a > Math.max(250, 2 * e) || !Number.isFinite(e) || e <= 0) return this.#c(), this.#a = t, !1;
+		let i = Math.max(0, t - this.#a);
+		if (this.#a = t, this.#i.push({
+			time: t,
+			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 / qe ? this.#o + i : 0, this.#s = a <= 1e3 / Je ? this.#s + i : 0, this.#o >= Ye) {
+			let e = Math.floor(Math.min(.9, 1e3 / qe / a) * this.#t);
+			if (this.#t > this.#n) this.#t = Math.max(this.#n, e);
+			else if (this.#e < Ke.length - 1) this.#e++;
+			else return !1;
+		} else if (this.#s >= Xe) {
+			if (this.#e > 0) this.#e--;
+			else if (this.#t < this.#r && r >= Qe * this.#t) this.#t = Math.min(this.#r, this.#t + Ze);
+			else return !1;
+		} else return !1;
+		return this.#c(), !0;
+	}
+}, nt = class {
+	#e;
+	#t = [];
+	#n = /* @__PURE__ */ new Set();
+	#r = /* @__PURE__ */ new Set();
+	#i = /* @__PURE__ */ new Set();
+	#a = /* @__PURE__ */ new Map();
+	constructor(e) {
+		this.#e = e;
+	}
+	want(e) {
+		this.#t = e, this.#n = new Set(e.map((e) => e.id));
+	}
+	next() {
+		let e = [];
+		for (let t of this.#r) this.#i.has(t) || t.pages.some((e) => this.#n.has(e.id)) || (this.#i.add(t), e.push(t));
+		let t = [];
+		if (this.#r.size >= this.#e.concurrency) return {
+			start: t,
+			abort: e
+		};
+		let n = /* @__PURE__ */ new Map();
+		for (let e of this.#t) {
+			if (this.#a.has(e.id)) continue;
+			let t = n.get(e.pack);
+			t ? t.push(e) : n.set(e.pack, [e]);
+		}
+		for (let e of n.values()) e.sort((e, t) => e.offset - t.offset);
+		for (let e of this.#t) {
+			if (this.#r.size >= this.#e.concurrency) break;
+			if (this.#a.has(e.id)) continue;
+			let r = this.#o(e, n.get(e.pack));
+			for (let e of r.pages) this.#a.set(e.id, r);
+			this.#r.add(r), t.push(r);
+		}
+		return {
+			start: t,
+			abort: e
+		};
+	}
+	done(e) {
+		if (this.#r.delete(e)) {
+			this.#i.delete(e);
+			for (let t of e.pages) this.#a.get(t.id) === e && this.#a.delete(t.id);
+		}
+	}
+	get queued() {
+		let e = 0;
+		for (let t of this.#n) this.#a.has(t) || e++;
+		return e;
+	}
+	get loading() {
+		return this.#a.size;
+	}
+	#o(e, t) {
+		let { gap: n, span: r } = this.#e, i = Math.floor(e.offset / r), a = t.indexOf(e), o = [e], s = e.offset, c = e.offset + e.length;
+		for (let e = a + 1; e < t.length; e++) {
+			let a = t[e];
 			if (this.#a.has(a.id)) continue;
 			let l = Math.max(c, a.offset + a.length);
 			if (a.offset - c > n || l - s > r || Math.floor(a.offset / r) !== i) break;
@@ -1380,12 +1680,12 @@ var Ge = class {
 			pages: o
 		};
 	}
-}, qe = {
+}, rt = {
 	idx: 8,
 	concurrency: 8,
 	gap: 65536,
 	span: 2097152
-}, Je = 1e3, Ye = 3e4, Xe = 1e3, Ze = 2e3, Qe = class {
+}, it = 1e3, at = 3e4, ot = 1e3, st = 2e3, ct = class {
 	#e;
 	#t;
 	#n;
@@ -1415,8 +1715,8 @@ var Ge = class {
 	#y = -Infinity;
 	#b = !1;
 	#x = !1;
-	constructor(e, t, n, r, i, a = qe) {
-		this.#e = e, this.#t = t, this.#n = n, this.#r = r, this.#i = i, this.#a = a, this.#o = new Ke(a);
+	constructor(e, t, n, r, i, a = rt) {
+		this.#e = e, this.#t = t, this.#n = n, this.#r = r, this.#i = i, this.#a = a, this.#o = new nt(a);
 	}
 	update(e, t, n) {
 		if (!this.#x) {
@@ -1483,7 +1783,7 @@ var Ge = class {
 		let n = this.#e.pages.get(e);
 		if (!n) return;
 		let { keep: r } = this.#s, i = this.#c;
-		this.#n.add(e, t, [n.unit.e, n.unit.n], (e) => r.has(e) || i.has(e)) ? (this.#g.add(e), this.#m.delete(e) && this.#j(e)) : (this.#m.set(e, this.#u + Xe), this.#A(e, Xe)), this.#r();
+		this.#n.add(e, t, [n.unit.e, n.unit.n], (e) => r.has(e) || i.has(e)) ? (this.#g.add(e), this.#m.delete(e) && this.#j(e)) : (this.#m.set(e, this.#u + ot), this.#A(e, ot)), 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());
@@ -1497,7 +1797,7 @@ var Ge = class {
 			this.#b = !0, this.#i();
 			return;
 		}
-		let n = this.#p.get(e), r = n ? Math.min(2 * n.delay, Ye) : Je;
+		let n = this.#p.get(e), r = n ? Math.min(2 * n.delay, at) : it;
 		this.#p.set(e, {
 			delay: r,
 			until: this.#u + r
@@ -1518,11 +1818,11 @@ var Ge = class {
 	}
 	#M() {
 		let e = this.#u;
-		if (e - this.#y < Ze) return;
+		if (e - this.#y < st) 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 >= Ze && this.#_.delete(t);
+		for (let [t, n] of this.#_) e - n >= st && 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([
@@ -1547,7 +1847,7 @@ var Ge = class {
 };
 //#endregion
 //#region src/engine/stream/remote.ts
-function $e(e, t) {
+function lt(e, t) {
 	let n = /* @__PURE__ */ new Map();
 	return (r) => {
 		if ("unfetch" in r) return void n.get(r.unfetch)?.abort();
@@ -1570,29 +1870,29 @@ function $e(e, t) {
 }
 //#endregion
 //#region src/engine/stream/worker.ts?worker&inline
-var et = "(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}async function O(e,t){return p(await A(e,t))}async function*k(e,t,n,r){let i=t.col===null?null:M(e,t.col,n),a=await j(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 A(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 j(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 M(e,t,n){let r=n.get(t);if(r)n.delete(t);else{let i=A(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 N(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 P(e,t){let n;try{n=await(await I()).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 z(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 L(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 R(n,i,r)&&(o(i,r.length),c())}}}async function F(e){let t=new Set(Array.from({length:e},(e,t)=>String(t)));try{let e=await I(),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 I(){return(await navigator.storage.getDirectory()).getDirectoryHandle(`cache`,{create:!0})}async function L(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 R(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 z(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 B(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 V=(e,t,n)=>Math.min(n,Math.max(t,e));function ee(e,t,n){return n>t?V(Math.round((e-t)/(n-t)*255),0,255):0}function te(e,t){return t>0?V(Math.round(e/t*127),-127,127):0}function H(e){return e&=1023,e=(e|e<<16)&50331903,e=(e|e<<8)&50393103,e=(e|e<<4)&51130563,(e|e<<2)&153391689}function ne(e,t,n){return H(e>>6)|H(t>>6)<<1|H(n>>6)<<2}function re(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 ie(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]=te(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 ae(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]=V(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+ne(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]),O=[0,0,0];for(let e=1;e<4;e++)O[e-1]=T.filter(t=>t<e).length;let k=u?re(u,n):/* @__PURE__ */ new Float32Array(9),{book:A,labels:j}=u?ie(u,n,k):{book:null,labels:null},M=A?A.length/9:0,N=17+(M>0?2:0),P=new Uint8Array(128+N*n+M*9),F=new DataView(P.buffer);F.setUint32(0,n,!0),O.forEach((e,t)=>F.setUint32(4+4*t,e,!0)),F.setUint16(16,M,!0),[...v,...y,...p,...m,...h,...g,...k].forEach((e,t)=>F.setFloat32(20+4*t,e,!0));let I=e=>128+e*n,L=new Float32Array([...d,...f]),R=/* @__PURE__ */ new Float64Array(4),z=/* @__PURE__ */ new Float64Array(3),B=[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]-B[n]<<16>>16,i=r<0?-2*r-1:2*r;B[n]=b[t*3+n],P[I(a.position+2*n)+e]=i&255,P[I(a.position+2*n+1)+e]=i>>8}P[I(a.alpha)+e]=V(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++)R[e]=o[t*4+e]/n;let r=0;for(let e=1;e<4;e++)Math.abs(R[e])>Math.abs(R[r])&&(r=e);let u=R[r]<0?-1:1;P[I(a.rotationIndex)+e]=r;for(let t=0,n=0;t<4;t++){if(t===r)continue;let i=Math.round((u*R[t]/Math.SQRT2+.5)*255);P[I(a.rotation+n++)+e]=V(i,0,255)}for(let n=0;n<3;n++)P[I(a.scale+n)+e]=ee(s[t*3+n],p[n],m[n]),P[I(a.dc+n)+e]=ee(l[t*3+n],h[n],g[n]);j&&(P[I(a.label)+e]=j[t]&255,P[I(a.label+1)+e]=j[t]>>8);let[d,f,_]=[0,1,2].map(e=>Math.exp(s[t*3+e]));x(R,d,f,_,z);for(let e=0;e<3;e++)L[e]=Math.min(L[e],i[t*3+e]-z[e]),L[3+e]=Math.max(L[3+e],i[t*3+e]+z[e])}return A&&P.set(new Uint8Array(A.buffer),I(N)),{payload:P,row:{g:t.g,i:t.i,j:t.j,count:n,quadrants:O,box:L,offset:0,length:0}}}function oe(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 se(e,t,n){for(let r=0;r<4;r++)e[t+r]=n.charCodeAt(r)}function U(e){return Uint8Array.from({length:8},(t,n)=>parseInt(e.slice(2*n,2*n+2),16))}async function ce(e,t){let n=await l(e),r=new Uint8Array(8+n.length);return se(r,0,t),new DataView(r.buffer).setUint16(4,1,!0),r.set(n,8),r}async function le(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(U(e.pack),12),o.setUint32(20,e.packSize,!0),e.col&&a.set(U(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)oe(o,s,e),s+=52;for(let e of n)o.setUint8(s,e.quadrant),a.set(U(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(U(e.idx),s+3),s+=11;return ce(a,i)}function ue(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 de(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}}let W=16384,fe=1408,pe=65535,G=324121,me=.4,he=[[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]],ge=he.reduce((e,[t,n,,r])=>e+t*(n+r),0),_e=Float32Array.from({length:fe*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}),K=new TextEncoder,ve={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,q(e,`idx`),`idx`)})),extent:{e:[44e4,9e5],n:[605e4,641e4],h:[0,80]}},ye=K.encode(JSON.stringify(ve));function be(){return async(t,n)=>{if(t.endsWith(`world.json`))return Se(ye,n);let r=g(t),i=t.slice(t.lastIndexOf(`.`)+1);if(!r||i!==`idx`&&i!==`pack`||!Ce(r)||r.hash!==q(r,i))throw new e(`no file ${t}`);return i===`idx`?Se(await ke(r),n):Ae(r,n,t)}}function xe(e,t){let n=30;for(let[r,i,a,o,s]of he)n+=r*Math.sin(i*e+a)*Math.sin(o*t+s);return n}function Se(e,t){return t?e.slice(t[0],t[1]):e.slice()}function q(e,t){return ue(K.encode(`${e.level}/${e.e}/${e.n}.${t}`))}function J(e,t,n){let{e:r,n:i}=ve.extent;return e<r[1]&&e+n>r[0]&&t<i[1]&&t+n>i[0]}function Ce({level:e,e:t,n}){let r=250*2**e;return e<=12&&t%r===0&&n%r===0&&J(t,n,r)}function we(e){return e===0?[1,0]:e===12?[16,15,14,13]:[e+1]}function Te(e){let t=0;for(let n=0;n<8;n++)t|=(e>>2*n&1)<<n;return t}function Ee(e){let t=[];for(let n of we(e.level)){let i=r*2**n,a=250*2**e.level/i;for(let r=0;r<a*a;r++){let a=Te(r),o=Te(r>>1);J(e.e+a*i,e.n+o*i,i)&&t.push({g:n,i:a,j:o})}}return t}function De(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};J(t.e,t.n,r)&&i.push({column:o,row:a,unit:t})}return i}function Oe(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=xe(e.e+(n+.5)*o,e.n+(i+.5)*o),d=ge*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=W/4;return{g:t,i:n,j:i,count:W,quadrants:[p,2*p,3*p],box:f,offset:a,length:G}}function ke(e){let t=Ee(e),n=[];for(let{column:t,row:r,unit:i}of De(e,1))n.push({quadrant:t+2*r,idx:q(i,`idx`)});let r=[];for(let t of[2,3])for(let{column:n,row:i,unit:a}of De(e,t))r.push({depth:t,column:n,row:i,idx:q(a,`idx`)});return le({level:e.level,e:e.e,n:e.n,pack:q(e,`pack`),packSize:t.length*324173+16,col:null,rows:t.map((t,n)=>Oe(e,t,n*G)),children:n,descendants:r})}function Ae(e,t,n){let r=Ee(e);if(!t||t[0]%G!=0||t[1]%G!=0||t[0]>=t[1]||t[1]>r.length*G)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+=G)je(Ne(e,r[(t[0]+n)/G]),i,n);return i}function je(e,t,n){let r=n;for(let n=0;n<e.length;n+=pe){let i=Math.min(pe,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 Me=e=>de(parseInt(ue(K.encode(e)).slice(8),16));function Ne(e,{g:t,i,j:a}){let o=W,s=r*2**t/128,c=Me(`${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+me*(2*c()-1))*s,o=(a*128+Math.floor(t/128)+.5+me*(2*c()-1))*s,h=xe(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%fe;m.set(_e.subarray(9*b,9*(b+1)),9*t)}return ae({count:o,position:l,rotation:u,scale:d,alpha:f,dc:p,sh:m},{g:t,i,j:a}).payload}let Y=2**20,X=self,Z,Pe=/* @__PURE__ */ new Map,Q=/* @__PURE__ */ new Map,Fe=B(e=>X.postMessage(e,[]));X.onmessage=({data:e})=>{`fetched`in e?Fe.take(e):e.type===`init`?(Z=Ie(e),Z.catch(()=>void 0)):e.type===`abort`?Q.get(e.id)?.abort():Re(e)};async function Ie(e){return e.source===`synthetic`?{fetch:be(),cache:await $({...e,cache:`none`}),base:e.base}:{fetch:e.source===`page`?Fe.fetch:t,cache:await $(e),base:e.base}}async function $({cache:e,shard:t,shards:n}){return e===`memory`?N(256*Y):e===`none`?{get:async()=>void 0,put:async()=>void 0}:(t===0&&F(n),await P(await Le()/n,t)??N(256*Y))}async function Le(){try{let{quota:e}=await navigator.storage.estimate();return Math.min(4096*Y,e===void 0?1/0:e/2)}catch{return 4096*Y}}async function Re(t){let{id:n}=t,r=new AbortController;Q.set(n,r);try{if(!Z)throw Error(`stream worker used before init`);let e=await Z;if(t.type===`idx`)X.postMessage({id:n,value:await O(e,t.path)},[]);else{for await(let i of k(e,t.batch,Pe,r.signal))X.postMessage({id:n,page:i},ze(i));X.postMessage({id:n,done:!0},[])}}catch(t){let r=t instanceof Error?t.message:String(t);X.postMessage({id:n,error:r,missing:t instanceof e},[])}finally{Q.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]}})();", tt = typeof self < "u" && self.Blob && new Blob(["(self.URL || self.webkitURL).revokeObjectURL(self.location.href);", et], { type: "text/javascript;charset=utf-8" });
-function nt(e) {
+var ut = "(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}async function O(e,t){return p(await A(e,t))}async function*k(e,t,n,r){let i=t.col===null?null:M(e,t.col,n),a=await j(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 A(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 j(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 M(e,t,n){let r=n.get(t);if(r)n.delete(t);else{let i=A(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 N(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 P(e,t){let n;try{n=await(await I()).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 z(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 L(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 R(n,i,r)&&(o(i,r.length),c())}}}async function F(e){let t=new Set(Array.from({length:e},(e,t)=>String(t)));try{let e=await I(),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 I(){return(await navigator.storage.getDirectory()).getDirectoryHandle(`cache`,{create:!0})}async function L(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 R(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 z(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 B(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 V=(e,t,n)=>Math.min(n,Math.max(t,e));function ee(e,t,n){return n>t?V(Math.round((e-t)/(n-t)*255),0,255):0}function te(e,t){return t>0?V(Math.round(e/t*127),-127,127):0}function H(e){return e&=1023,e=(e|e<<16)&50331903,e=(e|e<<8)&50393103,e=(e|e<<4)&51130563,(e|e<<2)&153391689}function ne(e,t,n){return H(e>>6)|H(t>>6)<<1|H(n>>6)<<2}function re(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 ie(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]=te(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 ae(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]=V(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+ne(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]),O=[0,0,0];for(let e=1;e<4;e++)O[e-1]=T.filter(t=>t<e).length;let k=u?re(u,n):/* @__PURE__ */ new Float32Array(9),{book:A,labels:j}=u?ie(u,n,k):{book:null,labels:null},M=A?A.length/9:0,N=17+(M>0?2:0),P=new Uint8Array(128+N*n+M*9),F=new DataView(P.buffer);F.setUint32(0,n,!0),O.forEach((e,t)=>F.setUint32(4+4*t,e,!0)),F.setUint16(16,M,!0),[...v,...y,...p,...m,...h,...g,...k].forEach((e,t)=>F.setFloat32(20+4*t,e,!0));let I=e=>128+e*n,L=new Float32Array([...d,...f]),R=/* @__PURE__ */ new Float64Array(4),z=/* @__PURE__ */ new Float64Array(3),B=[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]-B[n]<<16>>16,i=r<0?-2*r-1:2*r;B[n]=b[t*3+n],P[I(a.position+2*n)+e]=i&255,P[I(a.position+2*n+1)+e]=i>>8}P[I(a.alpha)+e]=V(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++)R[e]=o[t*4+e]/n;let r=0;for(let e=1;e<4;e++)Math.abs(R[e])>Math.abs(R[r])&&(r=e);let u=R[r]<0?-1:1;P[I(a.rotationIndex)+e]=r;for(let t=0,n=0;t<4;t++){if(t===r)continue;let i=Math.round((u*R[t]/Math.SQRT2+.5)*255);P[I(a.rotation+n++)+e]=V(i,0,255)}for(let n=0;n<3;n++)P[I(a.scale+n)+e]=ee(s[t*3+n],p[n],m[n]),P[I(a.dc+n)+e]=ee(l[t*3+n],h[n],g[n]);j&&(P[I(a.label)+e]=j[t]&255,P[I(a.label+1)+e]=j[t]>>8);let[d,f,_]=[0,1,2].map(e=>Math.exp(s[t*3+e]));x(R,d,f,_,z);for(let e=0;e<3;e++)L[e]=Math.min(L[e],i[t*3+e]-z[e]),L[3+e]=Math.max(L[3+e],i[t*3+e]+z[e])}return A&&P.set(new Uint8Array(A.buffer),I(N)),{payload:P,row:{g:t.g,i:t.i,j:t.j,count:n,quadrants:O,box:L,offset:0,length:0}}}function oe(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 se(e,t,n){for(let r=0;r<4;r++)e[t+r]=n.charCodeAt(r)}function U(e){return Uint8Array.from({length:8},(t,n)=>parseInt(e.slice(2*n,2*n+2),16))}async function ce(e,t){let n=await l(e),r=new Uint8Array(8+n.length);return se(r,0,t),new DataView(r.buffer).setUint16(4,1,!0),r.set(n,8),r}async function le(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(U(e.pack),12),o.setUint32(20,e.packSize,!0),e.col&&a.set(U(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)oe(o,s,e),s+=52;for(let e of n)o.setUint8(s,e.quadrant),a.set(U(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(U(e.idx),s+3),s+=11;return ce(a,i)}function ue(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 de(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}}let W=16384,fe=1408,pe=65535,G=324121,me=.4,he=[[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]],ge=he.reduce((e,[t,n,,r])=>e+t*(n+r),0),_e=Float32Array.from({length:fe*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}),K=new TextEncoder,ve={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,q(e,`idx`),`idx`)})),extent:{e:[44e4,9e5],n:[605e4,641e4],h:[0,80]}},ye=K.encode(JSON.stringify(ve));function be(){return async(t,n)=>{if(t.endsWith(`world.json`))return Se(ye,n);let r=g(t),i=t.slice(t.lastIndexOf(`.`)+1);if(!r||i!==`idx`&&i!==`pack`||!Ce(r)||r.hash!==q(r,i))throw new e(`no file ${t}`);return i===`idx`?Se(await ke(r),n):Ae(r,n,t)}}function xe(e,t){let n=30;for(let[r,i,a,o,s]of he)n+=r*Math.sin(i*e+a)*Math.sin(o*t+s);return n}function Se(e,t){return t?e.slice(t[0],t[1]):e.slice()}function q(e,t){return ue(K.encode(`${e.level}/${e.e}/${e.n}.${t}`))}function J(e,t,n){let{e:r,n:i}=ve.extent;return e<r[1]&&e+n>r[0]&&t<i[1]&&t+n>i[0]}function Ce({level:e,e:t,n}){let r=250*2**e;return e<=12&&t%r===0&&n%r===0&&J(t,n,r)}function we(e){return e===0?[1,0]:e===12?[16,15,14,13]:[e+1]}function Te(e){let t=0;for(let n=0;n<8;n++)t|=(e>>2*n&1)<<n;return t}function Ee(e){let t=[];for(let n of we(e.level)){let i=r*2**n,a=250*2**e.level/i;for(let r=0;r<a*a;r++){let a=Te(r),o=Te(r>>1);J(e.e+a*i,e.n+o*i,i)&&t.push({g:n,i:a,j:o})}}return t}function De(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};J(t.e,t.n,r)&&i.push({column:o,row:a,unit:t})}return i}function Oe(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=xe(e.e+(n+.5)*o,e.n+(i+.5)*o),d=ge*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=W/4;return{g:t,i:n,j:i,count:W,quadrants:[p,2*p,3*p],box:f,offset:a,length:G}}function ke(e){let t=Ee(e),n=[];for(let{column:t,row:r,unit:i}of De(e,1))n.push({quadrant:t+2*r,idx:q(i,`idx`)});let r=[];for(let t of[2,3])for(let{column:n,row:i,unit:a}of De(e,t))r.push({depth:t,column:n,row:i,idx:q(a,`idx`)});return le({level:e.level,e:e.e,n:e.n,pack:q(e,`pack`),packSize:t.length*324173+16,col:null,rows:t.map((t,n)=>Oe(e,t,n*G)),children:n,descendants:r})}function Ae(e,t,n){let r=Ee(e);if(!t||t[0]%G!=0||t[1]%G!=0||t[0]>=t[1]||t[1]>r.length*G)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+=G)je(Ne(e,r[(t[0]+n)/G]),i,n);return i}function je(e,t,n){let r=n;for(let n=0;n<e.length;n+=pe){let i=Math.min(pe,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 Me=e=>de(parseInt(ue(K.encode(e)).slice(8),16));function Ne(e,{g:t,i,j:a}){let o=W,s=r*2**t/128,c=Me(`${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+me*(2*c()-1))*s,o=(a*128+Math.floor(t/128)+.5+me*(2*c()-1))*s,h=xe(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%fe;m.set(_e.subarray(9*b,9*(b+1)),9*t)}return ae({count:o,position:l,rotation:u,scale:d,alpha:f,dc:p,sh:m},{g:t,i,j:a}).payload}let Y=2**20,X=self,Z,Pe=/* @__PURE__ */ new Map,Q=/* @__PURE__ */ new Map,Fe=B(e=>X.postMessage(e,[]));X.onmessage=({data:e})=>{`fetched`in e?Fe.take(e):e.type===`init`?(Z=Ie(e),Z.catch(()=>void 0)):e.type===`abort`?Q.get(e.id)?.abort():Re(e)};async function Ie(e){return e.source===`synthetic`?{fetch:be(),cache:await $({...e,cache:`none`}),base:e.base}:{fetch:e.source===`page`?Fe.fetch:t,cache:await $(e),base:e.base}}async function $({cache:e,shard:t,shards:n}){return e===`memory`?N(256*Y):e===`none`?{get:async()=>void 0,put:async()=>void 0}:(t===0&&F(n),await P(await Le()/n,t)??N(256*Y))}async function Le(){try{let{quota:e}=await navigator.storage.estimate();return Math.min(4096*Y,e===void 0?1/0:e/2)}catch{return 4096*Y}}async function Re(t){let{id:n}=t,r=new AbortController;Q.set(n,r);try{if(!Z)throw Error(`stream worker used before init`);let e=await Z;if(t.type===`idx`)X.postMessage({id:n,value:await O(e,t.path)},[]);else{for await(let i of k(e,t.batch,Pe,r.signal))X.postMessage({id:n,page:i},ze(i));X.postMessage({id:n,done:!0},[])}}catch(t){let r=t instanceof Error?t.message:String(t);X.postMessage({id:n,error:r,missing:t instanceof e},[])}finally{Q.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]}})();", dt = typeof self < "u" && self.Blob && new Blob(["(self.URL || self.webkitURL).revokeObjectURL(self.location.href);", ut], { type: "text/javascript;charset=utf-8" });
+function ft(e) {
 	let t;
 	try {
-		if (t = tt && (self.URL || self.webkitURL).createObjectURL(tt), !t) throw "";
+		if (t = dt && (self.URL || self.webkitURL).createObjectURL(dt), !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(et), { name: e?.name });
+		return new Worker("data:text/javascript;charset=utf-8," + encodeURIComponent(ut), { name: e?.name });
 	}
 }
 //#endregion
 //#region src/engine/stream/loader.ts
-var rt = class {
+var pt = 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 nt(), s = { worker: o }, c = typeof r == "function" ? $e(r, (e, t) => o.postMessage(e, t)) : void 0;
+			let o = new ft(), s = { worker: o }, c = typeof r == "function" ? lt(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);
@@ -1616,8 +1916,8 @@ var rt = class {
 		return this.#r(this.#e[0], t);
 	}
 	batch(e, t, n) {
-		if (t.aborted) return Promise.reject(B());
-		let r = this.#e[it(`${e.pack}#${e.window}`, this.#e.length)], i = {
+		if (t.aborted) return Promise.reject(K());
+		let r = this.#e[mt(`${e.pack}#${e.window}`, this.#e.length)], i = {
 			type: "batch",
 			id: ++this.#n,
 			batch: e
@@ -1626,7 +1926,7 @@ var rt = class {
 	}
 	destroy() {
 		for (let { worker: e } of this.#e) e.terminate();
-		for (let e of this.#t.values()) e.reject(B());
+		for (let e of this.#t.values()) e.reject(K());
 	}
 	#r(e, t, n, r) {
 		if (e.error) return Promise.reject(e.error);
@@ -1638,7 +1938,7 @@ var rt = class {
 				s(), e.worker.postMessage({
 					type: "abort",
 					id: i
-				}), o(B());
+				}), o(K());
 			};
 			this.#t.set(i, {
 				slot: e,
@@ -1661,237 +1961,56 @@ var rt = class {
 		for (let t of this.#t.values()) t.slot === e && t.reject(e.error);
 	}
 };
-function it(e, t) {
+function mt(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 B() {
+function K() {
 	return new DOMException("The request was aborted.", "AbortError");
 }
 //#endregion
-//#region src/engine/world/tree.ts
-var V = (e, t, n) => (e * 256 + t) * 256 + n, at = class {
-	roots = [];
-	pages = /* @__PURE__ */ new Map();
-	units = /* @__PURE__ */ new Map();
-	#e;
-	#t;
-	#n = 0;
-	#r = /* @__PURE__ */ new Map();
-	#i = /* @__PURE__ */ new Map();
-	constructor(e) {
-		this.#e = new Set(e.roots.map(H)), this.#t = Math.max(...e.roots.map((e) => e.level));
-	}
-	add(e, t) {
-		let n = H(e), r = this.units.get(n);
-		if (r) return r;
-		let o = /* @__PURE__ */ new Map(), s = {
-			level: e.level,
-			e: e.e,
-			n: e.n,
-			idx: e,
-			path: t,
-			parent: null,
-			pages: [],
-			grid: o
-		};
-		for (let t of e.rows) {
-			let n = t.box, r = {
-				id: this.#n++,
-				unit: s,
-				row: t,
-				g: t.g,
-				box: Float64Array.of(e.e + n[0], e.n + n[1], n[2], e.e + n[3], e.n + n[4], n[5]),
-				parent: null,
-				children: [
-					null,
-					null,
-					null,
-					null
-				]
-			};
-			this.pages.set(r.id, r), s.pages.push(r), o.set(V(t.g, t.i, t.j), r);
-		}
-		this.units.set(n, s), this.#r.delete(n);
-		for (let t = e.level + 1; t <= this.#t; t++) {
-			let n = H(U(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 s.pages) {
-			let { g: t, i: n, j: r } = e.row;
-			c.has(t + 1) && (e.parent = o.get(V(t + 1, n >> 1, r >> 1)) ?? null);
-			for (let i = 0; i < 4; i++) {
-				let a = 2 * n + (i & 1), s = 2 * r + (i >> 1);
-				c.has(t - 1) ? e.children[i] = o.get(V(t - 1, a, s)) ?? null : t === u && t > 0 && (e.children[i] = d.has((a >> 3) + 2 * (s >> 3)) ? void 0 : null);
-			}
-		}
-		if (this.#e.has(n)) for (let e of s.pages) e.g === l && this.roots.push(e);
-		else {
-			let t = this.units.get(H(U(e, e.level + 1)));
-			t && this.#o(t, s);
-		}
-		let f = a(s.idx);
-		for (let { key: t } of f) {
-			let n = t.level === e.level - 1 ? this.units.get(H(t)) : void 0;
-			n && this.#o(s, n);
-		}
-		for (let { key: e, hash: t } of f) {
-			let n = H(e);
-			if (this.units.has(n)) continue;
-			let r = this.#r.get(n);
-			if (r && r.from <= s.level) continue;
-			let a = this.#s(s, e), o = {
-				...e,
-				path: i(e, t, "idx"),
-				over: a
-			};
-			this.#r.set(n, {
-				wanted: o,
-				from: s.level
-			});
-		}
-		return s;
-	}
-	wanted() {
-		return Array.from(this.#r.values(), (e) => e.wanted);
-	}
-	ground(e, t) {
-		for (let n of this.roots) {
-			let [r, i, a] = ot(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] = ot(o);
-			}
-		}
-	}
-	prune(e) {
-		let t = [], n = [...this.units.values()].sort((e, t) => e.level - t.level);
-		for (let r of n) {
-			let n = H(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 i = r.parent;
-			if (i) {
-				let e = 250 * 2 ** r.level, t = (r.e - i.e) / e, n = (r.n - i.n) / e, a = i.idx.children.some((e) => e.quadrant === t + 2 * n);
-				for (let e of this.#s(i, r)) e.children.fill(a ? void 0 : null);
-			}
-			this.units.delete(n);
-			for (let e = r.level + 1; e <= this.#t; e++) {
-				let t = H(U(r, e)), n = this.#i.get(t) - 1;
-				n ? this.#i.set(t, n) : this.#i.delete(t);
-			}
-			for (let { key: e } of a(r.idx)) this.#a(e);
-			this.#a(r);
-		}
-		return t;
-	}
-	#a(e) {
-		let t = H(e);
-		this.#r.delete(t);
-		for (let n = e.level + 1; n <= e.level + 3; n++) {
-			let r = this.units.get(H(U(e, n)));
-			if (!r) continue;
-			let o = a(r.idx).find((e) => H(e.key) === t);
-			if (!o) continue;
-			let s = {
-				level: e.level,
-				e: e.e,
-				n: e.n,
-				path: i(o.key, o.hash, "idx"),
-				over: this.#s(r, e)
-			};
-			this.#r.set(t, {
-				wanted: s,
-				from: r.level
-			});
-			return;
-		}
-	}
-	#o(e, t) {
-		t.parent = e;
-		let n = t.level + 1, r = 250 * 2 ** t.level, i = (t.e - e.e) / r, a = (t.n - e.n) / r, o = e.grid;
-		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(V(n + 1, t >> 1, r >> 1)) ?? null;
-			e.parent = s, s && (s.children[(t & 1) + 2 * (r & 1)] = e);
-		}
-	}
-	#s(t, n) {
-		let r = t.level + 1, i = e * 2 ** r, a = (n.e - t.e) / i, o = (n.n - t.n) / i, s = 250 * 2 ** n.level / i, c = [];
-		for (let e = o; e < o + s; e++) for (let n = a; n < a + s; n++) {
-			let i = t.grid.get(V(r, n, e));
-			i && c.push(i);
-		}
-		return c;
-	}
-};
-function H(e) {
-	return `${e.level}/${e.e}/${e.n}`;
-}
-function U(e, t) {
-	let n = 250 * 2 ** t;
-	return {
-		level: t,
-		e: Math.floor(e.e / n) * n,
-		n: Math.floor(e.n / n) * n
-	};
-}
-function ot(t) {
-	let n = e * 2 ** t.g;
-	return [
-		t.unit.e + t.row.i * n,
-		t.unit.n + t.row.j * n,
-		n
-	];
-}
-//#endregion
 //#region src/engine/engine.ts
-var W = class extends Error {
+var ht = class extends Error {
 	constructor() {
 		super("This viewer needs WebGPU. Update to the latest Chrome, Edge, Safari or Firefox."), this.name = "NoWebGpu";
 	}
 };
-async function st(e, t) {
+async function gt(e, t) {
 	let n = await p();
-	if (!n) throw new W();
+	if (!n) throw new ht();
 	let r = e.getContext("webgpu");
-	if (!r) throw n.device.destroy(), new W();
+	if (!r) throw n.device.destroy(), new ht();
 	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 Ot(e, n, r, t, i === "synthetic" ? (await import("./synthetic-BZcHRI1P.js")).synthetic() : i === "http" ? s : i);
+	return new Bt(e, n, r, t, i === "synthetic" ? (await import("./synthetic-BeGCzYIv.js")).synthetic() : i === "http" ? s : i);
 }
-var G = .2, ct = 25165824, lt = 2.5, ut = 1 + L, dt = 1024, ft = 2048, pt = 100, mt = 2, K = 300, ht = 100, gt = 250, _t = 300, vt = 1e3, yt = 400, bt = 5e3, xt = 60, q = Math.PI / 180, St = "The viewer was closed.", Ct = "Another world was opened.";
-function J(e, t) {
+var _t = .2, vt = 25165824, yt = 2.5, bt = 1 + R, xt = 1024, St = 2048, Ct = 100, wt = 2, Tt = 300, Et = 100, Dt = 250, Ot = 300, kt = 1e3, At = 400, jt = 5e3, Mt = 60, q = Math.PI / 180, Nt = "The viewer was closed.", Pt = "Another world was opened.";
+function Ft(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(lt, 16),
-		frame: r(ut, 24)
+		pool: r(yt, 16),
+		frame: r(bt, 24)
 	};
 }
-function wt(e, t) {
+function It(e, t) {
 	let [n, r, i] = t;
-	if (Math.hypot(n - e[0], r - e[1], i - e[2]) <= ft) return e;
-	let a = (e) => Math.round(e / dt) * dt;
+	if (Math.hypot(n - e[0], r - e[1], i - e[2]) <= St) return e;
+	let a = (e) => Math.round(e / xt) * xt;
 	return [
 		a(n),
 		a(r),
 		a(i)
 	];
 }
-function Tt(e, t, n, r, i, a) {
+function Lt(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],
@@ -1903,29 +2022,29 @@ function Tt(e, t, n, r, i, a) {
 		d + a[2]
 	];
 }
-function Et(e, t) {
+function Rt(e, t) {
 	return [
 		e.e - t[0],
 		e.n - t[1],
 		e.h - t[2]
 	];
 }
-function Dt(e, t) {
-	e.push(t), e.length > xt && e.shift();
+function zt(e, t) {
+	e.push(t), e.length > Mt && e.shift();
 }
-var Ot = class {
+var Bt = class {
 	#e;
 	#t;
 	#n;
 	#r;
 	#i;
 	#a;
-	#o = new Ge();
+	#o;
 	#s;
 	#c;
 	#l;
-	#u = new Ne();
-	#d = new Ie();
+	#u = new Be();
+	#d = new Ee();
 	#f = (e) => this.#s.has(e);
 	#p = null;
 	#m = null;
@@ -1969,7 +2088,7 @@ var Ot = class {
 	#L = !1;
 	#R = !1;
 	#z = !1;
-	#B = 0;
+	#B = [];
 	#V = -Infinity;
 	#H = -Infinity;
 	#U = -Infinity;
@@ -1986,13 +2105,13 @@ var Ot = class {
 	#ee = !1;
 	#te = !1;
 	constructor(e, t, n, r, i) {
-		this.#e = e, this.#t = t, this.#n = n, this.#r = r, this.#i = i, this.#a = { ...r.settings }, this.#O = [
+		this.#e = e, this.#t = t, this.#n = n, this.#r = r, this.#i = i, this.#a = { ...r.settings }, this.#o = this.#re(), this.#O = [
 			e.width,
 			e.height,
 			1
 		], this.#k = [Math.max(1, e.width), Math.max(1, e.height)];
-		let { pool: a, frame: o } = J(this.#ne, t.device.limits);
-		this.#s = new _(t.device, a), this.#c = new Te(t, n, this.#s, o), this.#l = o, t.device.lost.then((e) => {
+		let { pool: a, frame: o } = Ft(this.#ne, t.device.limits);
+		this.#s = new _(t.device, a), this.#c = new Ce(t, n, this.#s, o), this.#l = o, t.device.lost.then((e) => {
 			if (!this.#ee) {
 				this.#te = !0, cancelAnimationFrame(this.#A);
 				for (let t of this.#Z) t(e.message || e.reason);
@@ -2000,53 +2119,54 @@ var Ot = class {
 		});
 	}
 	async open(e) {
-		if (this.#ee) throw Error(St);
+		if (this.#ee) throw Error(Nt);
 		let t = ++this.#_, i = () => {
-			if (this.#ee) throw Error(St);
-			if (t !== this.#_) throw Error(Ct);
+			if (this.#ee) throw Error(Nt);
+			if (t !== this.#_) throw Error(Pt);
 		}, { cache: a = "opfs", source: o = "http" } = this.#r;
 		o === "http" && (e = new URL(e, document.baseURI).href);
 		let s = await this.#i(e, null), c = r(JSON.parse(new TextDecoder().decode(s)));
 		i();
-		let l = new rt({
+		let l = new pt({
 			base: n(e),
 			workers: Math.min(6, Math.max(2, navigator.hardwareConcurrency - 2)),
 			cache: a,
 			source: o
-		}), u = new at(c);
+		}), u = new Ie(c);
 		try {
 			let e = await Promise.all(c.roots.map((e) => l.idx(e.idx)));
 			i(), 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.#N = null, this.#u = new Ne(), this.#d = new Ie(), this.#s.clear(), this.#g = this.#ie(u, l), this.#I = !0, this.requestFrame(), c;
+		return this.#g?.destroy(), this.#g = null, this.#h?.destroy(), this.#p = e, this.#m = u, this.#h = l, this.#N = null, this.#u = new Be(), this.#d = new Ee(), this.#s.clear(), this.#g = this.#oe(u, l), this.#I = !0, this.requestFrame(), c;
 	}
 	setCamera(e) {
 		if (this.#ee) return;
 		let t = performance.now(), n = t - this.#b, r = this.#y, i = this.#x;
-		if (n > gt) i.fill(0);
+		if (n > Dt) i.fill(0);
 		else if (n > 0) {
-			let t = 1 - Math.exp(-n / ht);
+			let t = 1 - Math.exp(-n / Et);
 			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.#b = t, this.#y = { ...e }, this.#F = !0, this.#$ || this.requestFrame();
 	}
 	configure(e) {
 		if (this.#ee) return;
+		let { budget: t, budgetRange: n } = this.#a;
 		this.#a = {
 			...this.#a,
 			...e
 		};
-		let { pool: t, frame: n } = J(this.#ne, this.#t.device.limits);
-		(t > this.#s.capacity || n > this.#l) && this.#re(t, n), this.#I = !0, this.requestFrame();
+		let r = this.#a;
+		(r.budget !== t || !((e, t) => e?.join() === t?.join())(r.budgetRange, n)) && (this.#o = this.#re(), this.#le()), this.#ie();
 	}
 	resize(e, t, n) {
 		this.#ee || (this.#O = [
 			e,
 			t,
 			n
-		], this.#se());
+		], this.#le());
 	}
 	pick(e, t) {
 		if (this.#ee || this.#te) return Promise.resolve(null);
@@ -2062,6 +2182,10 @@ var Ot = class {
 	ground(e, t) {
 		return this.#m?.ground(e, t);
 	}
+	async groundAt(e, t) {
+		let n = this.#m, r = this.#h;
+		if (n && r) return await n.load(e, t, (e) => r.idx(e)), this.#R = !0, this.requestFrame(), n.ground(e, t);
+	}
 	heights(e, t, n) {
 		return this.#ee || this.#te ? Promise.resolve(null) : new Promise((r) => {
 			this.#Y.push({
@@ -2075,8 +2199,8 @@ var Ot = class {
 	stats() {
 		let e = this.#s, t = this.#g, n = this.#c.stats();
 		return {
-			frameMs: z(this.#W, .5),
-			cpuMs: z(this.#G, .5),
+			frameMs: et(this.#W, .5),
+			cpuMs: et(this.#G, .5),
 			gpuMs: n.gpuMs,
 			passes: n.passes,
 			drawn: n.drawn,
@@ -2084,7 +2208,7 @@ var Ot = class {
 			missing: this.#N?.missing ?? 0,
 			pages: {
 				resident: Array.from(e.ids()).length,
-				drawn: this.#B,
+				drawn: this.#B.length,
 				loading: t?.loading ?? 0,
 				queued: t?.queued ?? 0
 			},
@@ -2093,6 +2217,7 @@ var Ot = class {
 				buffers: n.bytes
 			},
 			capacity: e.capacity,
+			budget: this.#ne,
 			scale: this.#o.scale,
 			loading: t !== null && !t.idle
 		};
@@ -2105,8 +2230,8 @@ var Ot = class {
 	use(e) {
 		if (this.#ee) return () => {};
 		let t = e({
-			shade: (e) => this.#oe(this.#K, e, this.#c.shade(e)),
-			post: (e) => this.#oe(this.#q, e, this.#c.post(e))
+			shade: (e) => this.#ce(this.#K, e, this.#c.shade(e)),
+			post: (e) => this.#ce(this.#q, e, this.#c.post(e))
 		});
 		return () => {
 			this.#ee || t();
@@ -2114,7 +2239,7 @@ var Ot = class {
 	}
 	warm() {
 		let e = performance.now();
-		e - this.#V < vt || (this.#H = e + yt, this.requestFrame());
+		e - this.#V < kt || (this.#H = e + At, this.requestFrame());
 	}
 	onFrame(e) {
 		return this.#Q.add(e), () => this.#Q.delete(e);
@@ -2123,7 +2248,7 @@ var Ot = class {
 		return this.#Z.add(e), () => this.#Z.delete(e);
 	}
 	requestFrame() {
-		this.#ee || this.#te || this.#r.manual || this.#A || (this.#A = requestAnimationFrame(this.#ce));
+		this.#ee || this.#te || this.#r.manual || this.#A || (this.#A = requestAnimationFrame(this.#ue));
 	}
 	async step() {
 		if (this.#ee || this.#te) return {
@@ -2131,7 +2256,7 @@ var Ot = class {
 			gpuMs: 0,
 			passes: {}
 		};
-		let { done: e, cpuMs: t } = this.#le(!1);
+		let { done: e, cpuMs: t } = this.#de(!1);
 		await e;
 		let { gpuMs: n, passes: r } = this.#c.stats();
 		return {
@@ -2150,29 +2275,36 @@ var Ot = class {
 		}
 	}
 	get #ne() {
-		let e = Math.floor(J(Infinity, this.#t.device.limits).frame / ut);
-		return Math.max(1, Math.min(this.#a.budget, e));
+		return this.#o.budget;
+	}
+	#re() {
+		let { budget: e, budgetRange: t = [e, e] } = this.#a, n = Math.floor(Ft(Infinity, this.#t.device.limits).frame / bt), r = (e) => Math.max(1, Math.min(e, n));
+		return new tt(r(e), [r(t[0]), r(t[1])]);
 	}
-	#re(e, t) {
-		this.#g?.destroy(), this.#g = null, this.#c.destroy(), this.#s.destroy(), this.#s = new _(this.#t.device, e), this.#s.setOrigin(this.#S);
-		let n = new Te(this.#t, this.#n, this.#s, t);
+	#ie() {
+		let { pool: e, frame: t } = Ft(this.#ne, this.#t.device.limits);
+		(e > this.#s.capacity || t > this.#l) && this.#ae(e, t), this.#I = !0, this.requestFrame();
+	}
+	#ae(e, t) {
+		this.#s.grow(e), this.#c.destroy();
+		let n = new Ce(this.#t, this.#n, this.#s, t);
 		n.resize(...this.#k);
 		for (let e of this.#K) e.off = n.shade(e.hook);
 		for (let e of this.#q) e.off = n.post(e.hook);
-		this.#c = n, this.#l = t, this.#m && this.#h && (this.#g = this.#ie(this.#m, this.#h)), this.#N = null, this.#I = !0, this.requestFrame();
+		this.#c = n, this.#l = t;
 	}
-	#ie(e, t) {
-		return new Qe(e, t, this.#s, () => {
+	#oe(e, t) {
+		return new ct(e, t, this.#s, () => {
 			this.#R = !0, this.requestFrame();
-		}, this.#ae);
+		}, this.#se);
 	}
-	#ae = () => {
+	#se = () => {
 		let e = this.#p, t = this.#m;
 		this.#v || this.#ee || e === null || (this.#v = !0, this.open(e).then(() => this.#v = !1, () => {
-			this.#v = !1, this.#m === t && setTimeout(this.#ae, bt);
+			this.#v = !1, this.#m === t && setTimeout(this.#se, jt);
 		}));
 	};
-	#oe(e, t, n) {
+	#ce(e, t, n) {
 		let r = {
 			hook: t,
 			off: n
@@ -2182,105 +2314,105 @@ var Ot = class {
 			this.#ee || t < 0 || (e.splice(t, 1), r.off(), this.requestFrame());
 		};
 	}
-	#se() {
-		let [e, t, n] = this.#O, r = We(e, t, n, this.#o.scale), i = Math.max(1, Math.round(e * r)), a = Math.max(1, Math.round(t * r));
+	#le() {
+		let [e, t, n] = this.#O, r = $e(e, t, n, this.#o.scale), i = Math.max(1, Math.round(e * r)), a = Math.max(1, Math.round(t * r));
 		(i !== this.#k[0] || a !== this.#k[1]) && (this.#k = [i, a], this.#e.width = i, this.#e.height = a, this.#c.resize(i, a), this.#I = !0, this.requestFrame());
 	}
-	#ce = (e) => {
+	#ue = (e) => {
 		if (this.#A = 0, !(this.#ee || this.#te)) {
-			if (this.#j >= mt) this.#M = !0;
+			if (this.#j >= wt) this.#M = !0;
 			else {
 				this.#$ = !0;
 				for (let t of this.#Q) t(e);
-				this.#$ = !1, this.#j++, this.#le(!0).done.finally(() => {
+				this.#$ = !1, this.#j++, this.#de(!0).done.finally(() => {
 					this.#j--, this.#M && (this.#M = !1, this.requestFrame());
 				});
 			}
 		}
 	};
-	#le(e) {
+	#de(e) {
 		let t = performance.now(), n = this.#o, r = this.#s, i = this.#y, [a, o] = this.#k, s = this.#a.viewDistance, c = this.#F;
 		this.#F = !1;
-		let l = wt(this.#S, [
+		let l = It(this.#S, [
 			i.e,
 			i.n,
 			i.h
 		]);
 		l !== this.#S && (this.#S = l, r.setOrigin(l));
-		let u = Et(i, l);
-		y(this.#C, u, i.yaw * q, i.pitch * q), b(this.#w, i.fov * q, a / o, G, s);
+		let u = Rt(i, l);
+		y(this.#C, u, i.yaw * q, i.pitch * q), b(this.#w, i.fov * q, a / o, _t, s);
 		let d = {
 			time: t,
 			width: a,
 			height: o,
 			view: new Float32Array(this.#C),
 			proj: new Float32Array(this.#w),
-			near: G,
+			near: _t,
 			far: s,
 			camera: Float32Array.from(u),
 			origin: l
 		};
-		De(this.#D, S(this.#E, d.proj, d.view));
-		let f = this.#m, p = this.#g, m = this.#N;
+		Te(this.#D, S(this.#E, d.proj, d.view));
+		let f = this.#m, p = this.#g, m = this.#R || this.#I || this.#z, h = this.#N, g = h;
 		if (f && p) {
-			let e = !p.idle && t - this.#P >= pt, n = this.#I || this.#R || this.#z || this.#L;
-			(!m || c || e || n) && (m = this.#ue(f, t, c));
+			let e = !p.idle && t - this.#P >= Ct, n = this.#I || this.#R || this.#z || this.#L;
+			(!g || c || e || n) && (g = this.#fe(f, t, c));
 		}
-		let h = [], g = !1;
-		m && p && ({drawn: h, fading: g} = this.#d.update(m.cut, this.#f, t, this.#ne), p.update(m, new Set(h.map((e) => e.id)), t)), r.upload(ct) > 0 && (this.#R = !0), r.draw(h), this.#z = g, this.#B = h.length;
-		let _ = this.#J.splice(0).map((e) => this.#fe(e, d)), v = this.#Y.splice(0).map((e) => this.#pe(e, l)), x = this.#c.render(d, this.#D, this.#r.sky, _, v), C = performance.now() - t;
-		if (!this.#R && !this.#L && !g && r.queued === 0 && (!p || p.idle) && (!m || m.load.length === 0 && m.idx.length === 0) && this.#X.length) {
+		let _ = this.#B, v = this.#z;
+		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.#ne)), p.update(g, new Set(_.map((e) => e.id)), t)), r.upload(vt) > 0 && (this.#R = !0), (_ !== this.#B || this.#R) && r.draw(_), this.#z = v, this.#B = _;
+		let x = this.#J.splice(0).map((e) => this.#me(e, d)), C = this.#Y.splice(0).map((e) => this.#he(e, l)), w = this.#c.render(d, this.#D, this.#r.sky, x, C), T = performance.now() - t;
+		if (!this.#R && !this.#L && !v && r.queued === 0 && (!p || p.idle) && (!g || g.load.length === 0 && g.idx.length === 0) && this.#X.length) {
 			let e = this.#X.splice(0);
-			x.then(() => e.forEach((e) => e()));
+			w.then(() => e.forEach((e) => e()));
 		}
-		e && this.#me(t, C, c);
-		let w = t < this.#H;
-		return (r.queued > 0 || this.#R || this.#L || g || n.scale < 1 || w) && this.requestFrame(), {
-			done: x,
-			cpuMs: C
+		e && this.#ge(t, T, c);
+		let E = t < this.#H;
+		return (r.queued > 0 || this.#R || this.#L || v || n.scale < 1 || E) && this.requestFrame(), {
+			done: w,
+			cpuMs: T
 		};
 	}
-	#ue(e, t, n) {
+	#fe(e, t, n) {
 		let r = this.#y, i = this.#s, [a, o] = this.#k, s = this.#o.scale, c = this.#ne, l = {
 			origin: this.#S,
 			width: a / s,
 			height: o / s,
 			tan: Math.tan(r.fov * q / 2),
-			near: G,
+			near: _t,
 			far: this.#a.viewDistance
 		}, u = {
 			...l,
 			view: this.#C
 		}, d = {
 			budget: c,
-			capacity: i.capacity - Math.ceil(L * c),
+			capacity: i.capacity - Math.ceil(R * c),
 			now: t,
-			predicted: n ? this.#de(l) : void 0
+			predicted: n ? this.#pe(l) : void 0
 		}, f = this.#u.plan(e, u, this.#f, d);
 		return this.#N = f, this.#P = t, this.#I = !1, this.#L = d.predicted !== void 0, this.#R = !1, f;
 	}
-	#de(e) {
+	#pe(e) {
 		let t = this.#x;
 		if (t.every((e) => e === 0)) return;
 		let n = this.#y, r = [
-			n.e + t[0] * K - e.origin[0],
-			n.n + t[1] * K - e.origin[1],
-			n.h + t[2] * K - e.origin[2]
+			n.e + t[0] * Tt - e.origin[0],
+			n.n + t[1] * Tt - e.origin[1],
+			n.h + t[2] * Tt - e.origin[2]
 		];
 		return {
 			...e,
 			view: y(this.#T, r, n.yaw * q, n.pitch * q)
 		};
 	}
-	#fe({ x: e, y: t, resolve: n }, r) {
-		let i = this.#C.slice(), a = this.#S, o = [r.width, r.height], s = (n) => Tt([e, t], o, n, r.proj, i, a);
+	#me({ x: e, y: t, resolve: n }, r) {
+		let i = this.#C.slice(), a = this.#S, o = [r.width, r.height], s = (n) => Lt([e, t], o, n, r.proj, i, a);
 		return {
 			x: e,
 			y: t,
 			resolve: (e) => n(e === null ? null : s(e))
 		};
 	}
-	#pe({ west: e, south: t, cells: n, resolve: r }, i) {
+	#he({ west: e, south: t, cells: n, resolve: r }, i) {
 		return {
 			x: e - i[0],
 			y: t - i[1],
@@ -2291,21 +2423,23 @@ var Ot = class {
 			}
 		};
 	}
-	#me(e, t, n) {
-		let r = this.#o, i = e - this.#V <= gt;
-		i && Dt(this.#W, e - this.#V), Dt(this.#G, t), this.#V = e, r.sample(this.#c.stats().gpuMs, e, i && n) && this.#se(), n ? this.#U = e : r.scale < 1 && e - this.#U > _t && (r.full(), this.#se());
+	#ge(e, t, n) {
+		let r = this.#o, { gpuMs: i } = this.#c.stats(), a = e - this.#V, o = a <= Math.max(Dt, 2 * i, 2 * t);
+		o && zt(this.#W, a), zt(this.#G, t), this.#V = e;
+		let s = r.budget;
+		r.sample(a, e, o && n, this.#N?.planned ?? 0) && (this.#le(), r.budget !== s && this.#ie()), n ? this.#U = e : r.scale < 1 && e - this.#U > Ot && (r.full(), this.#le());
 	}
-}, kt = 45, At = {
+}, Vt = 45, Ht = {
 	yaw: 0,
 	pitch: -35,
 	dist: 300
-}, Y = {
+}, J = {
 	pitch: [-90, -20],
 	dist: [1, 2485],
 	clearance: 10,
 	floor: 50
-}, jt = .1, X = Math.PI / 180, Mt = (e, [t, n]) => Math.min(n, Math.max(t, e)), Nt = (e) => (e % 360 + 360) % 360, Pt = (e, t) => (t - e + 540) % 360 - 180;
-function Ft({ leaf: e, roots: t, extent: n }) {
+}, Ut = .1, Y = Math.PI / 180, Wt = (e, [t, n]) => Math.min(n, Math.max(t, e)), Gt = (e) => (e % 360 + 360) % 360, Kt = (e, t) => (t - e + 540) % 360 - 180;
+function qt({ leaf: e, roots: t, extent: n }) {
 	let r = {
 		e: (n.e[0] + n.e[1]) / 2,
 		n: (n.n[0] + n.n[1]) / 2,
@@ -2322,7 +2456,7 @@ function Ft({ leaf: e, roots: t, extent: n }) {
 	}
 	return i;
 }
-function It(e) {
+function Jt(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);
@@ -2342,7 +2476,7 @@ function It(e) {
 		dist: s
 	};
 }
-function Lt(e) {
+function Yt(e) {
 	let t = (e, t) => +e.toFixed(t);
 	return [
 		t(e.e, 2),
@@ -2353,19 +2487,19 @@ function Lt(e) {
 		t(e.dist, 1)
 	].join(",");
 }
-function Z(e, t, n = Y) {
+function X(e, t, n = J) {
 	let r = {
 		e: e.e,
 		n: e.n,
 		h: e.h,
-		yaw: Nt(e.yaw),
-		pitch: Mt(e.pitch, n.pitch),
-		dist: Mt(e.dist, n.dist)
+		yaw: Gt(e.yaw),
+		pitch: Wt(e.pitch, n.pitch),
+		dist: Wt(e.dist, n.dist)
 	};
 	if (t) {
-		let e = Q(r), i = Math.max(n.floor, t(e.e, e.n) + n.clearance);
+		let e = Z(r), i = Math.max(n.floor, t(e.e, e.n) + n.clearance);
 		if (e.h < i) return {
-			...Vt({
+			...$t({
 				...e,
 				h: i
 			}, r),
@@ -2374,42 +2508,42 @@ function Z(e, t, n = Y) {
 	}
 	return r;
 }
-function Rt(e, t) {
-	let n = Math.cos(t * X);
+function Xt(e, t) {
+	let n = Math.cos(t * Y);
 	return {
-		e: Math.sin(e * X) * n,
-		n: Math.cos(e * X) * n,
-		h: Math.sin(t * X)
+		e: Math.sin(e * Y) * n,
+		n: Math.cos(e * Y) * n,
+		h: Math.sin(t * Y)
 	};
 }
-function Q(e) {
-	let t = Rt(e.yaw, e.pitch);
+function Z(e) {
+	let t = Xt(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 zt(e) {
+function Zt(e) {
 	return {
-		...Q(e),
+		...Z(e),
 		yaw: e.yaw,
 		pitch: e.pitch,
 		fov: 45
 	};
 }
-function Bt(e, t, n) {
-	let r = Q(e), [i, a, o] = [
+function Qt(e, t, n) {
+	let r = Z(e), [i, a, o] = [
 		n.e - r.e,
 		n.n - r.n,
 		n.h - r.h
-	], [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);
+	], [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);
 	return {
 		x: (i * c - a * s) / f,
 		y: (d * l - o * u) / f
 	};
 }
-function Vt(e, t) {
+function $t(e, t) {
 	let [n, r, i] = [
 		t.e - e.e,
 		t.n - e.n,
@@ -2419,17 +2553,17 @@ function Vt(e, t) {
 		e: t.e,
 		n: t.n,
 		h: t.h,
-		yaw: Nt(Math.atan2(n, r) / X),
-		pitch: Math.asin(i / a) / X,
+		yaw: Gt(Math.atan2(n, r) / Y),
+		pitch: Math.asin(i / a) / Y,
 		dist: a
 	};
 }
-function Ht(e, t, n, r = Y) {
-	let i = Q(e), a = Z({
+function en(e, t, n, r = J) {
+	let i = Z(e), a = X({
 		...e,
 		yaw: t,
 		pitch: n
-	}, void 0, r), o = Rt(a.yaw, a.pitch);
+	}, void 0, r), o = Xt(a.yaw, a.pitch);
 	return {
 		...a,
 		e: i.e + o.e * a.dist,
@@ -2437,11 +2571,11 @@ function Ht(e, t, n, r = Y) {
 		h: i.h + o.h * a.dist
 	};
 }
-function Ut(e) {
-	return e.dist * Math.max(Math.sin(-e.pitch * X), jt);
+function tn(e) {
+	return e.dist * Math.max(Math.sin(-e.pitch * Y), Ut);
 }
-function Wt(e, t, n, r) {
-	let [i, a] = [Math.sin(e.yaw * X), Math.cos(e.yaw * X)];
+function Q(e, t, n, r) {
+	let [i, a] = [Math.sin(e.yaw * Y), Math.cos(e.yaw * Y)];
 	return {
 		...e,
 		e: e.e + t * a + n * i,
@@ -2449,30 +2583,30 @@ function Wt(e, t, n, r) {
 		h: e.h + r
 	};
 }
-function Gt(e, t, n) {
-	return Wt(e, t, n * e.dist / Ut(e), 0);
+function nn(e, t, n) {
+	return Q(e, t, n * e.dist / tn(e), 0);
 }
-function Kt(e, t, n) {
+function rn(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: Nt(e.yaw + Pt(e.yaw, t.yaw) * n),
+		yaw: Gt(e.yaw + Kt(e.yaw, t.yaw) * n),
 		pitch: e.pitch + (t.pitch - e.pitch) * n,
 		dist: e.dist * (t.dist / e.dist) ** n
 	};
 }
-function qt(e, t) {
+function an(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(Pt(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(Kt(e.yaw, t.yaw)) < .001 && Math.abs(e.pitch - t.pitch) < .001;
 }
 //#endregion
 //#region src/controls/controls.ts
-var Jt = .2, Yt = .002, Xt = .005, Zt = .5, Qt = .05;
-function $t(e, t) {
+var on = .2, sn = .002, cn = .005, ln = .5, un = .05;
+function dn(e, t) {
 	return 2 * e * Math.tan(45 * Math.PI / 360) / Math.max(1, t);
 }
-function en(e) {
+function fn(e) {
 	let t = (t) => +!!e.has(t);
 	return [
 		t("KeyD") - t("KeyA") + t("ArrowRight") - t("ArrowLeft"),
@@ -2480,10 +2614,10 @@ function en(e) {
 		t("KeyE") - t("KeyQ")
 	];
 }
-function tn(e, t, n, r, i = Y) {
-	return qt(e, t) ? t : Z(Kt(e, t, 1 - Math.exp(-n / Qt)), r, i);
+function pn(e, t, n, r, i = J) {
+	return an(e, t) ? t : X(rn(e, t, 1 - Math.exp(-n / un)), r, i);
 }
-var nn = class {
+var mn = class {
 	#e;
 	#t;
 	#n;
@@ -2500,7 +2634,7 @@ var nn = class {
 	#p = /* @__PURE__ */ new Set();
 	#m;
 	#h = null;
-	constructor(e, t, n, r, i = Y) {
+	constructor(e, t, n, r, i = J) {
 		this.#e = e, this.#t = t, this.#n = n, this.#r = i, this.#d = this.#E(r), this.#f = this.#d, this.#m = t.onFrame(this.#T);
 		let a = this.#i.signal;
 		e.addEventListener("pointerdown", this.#g, { signal: a }), e.addEventListener("pointermove", this.#_, { signal: a });
@@ -2521,7 +2655,7 @@ var nn = class {
 		return this.#p.add(e), () => this.#p.delete(e);
 	}
 	moveTo(e, t) {
-		let n = this.#d, r = Math.min(n.dist, At.dist);
+		let n = this.#d, r = Math.min(n.dist, Ht.dist);
 		this.#d = this.#E({
 			...n,
 			e,
@@ -2548,7 +2682,7 @@ var nn = class {
 			e.buttons & 6 || t && e.shiftKey ? $(this.#c, r, i) : t && $(this.#s, r, i);
 		} else if (n) {
 			let e = this.#C();
-			$(this.#c, e.x - n.x, e.y - n.y), this.#l += (n.d - e.d) * Xt;
+			$(this.#c, e.x - n.x, e.y - n.y), this.#l += (n.d - e.d) * cn;
 		} else $(this.#s, r, i);
 		this.#w();
 	};
@@ -2556,7 +2690,7 @@ var nn = class {
 		this.#a.delete(e.pointerId);
 	};
 	#y = (e) => {
-		e.preventDefault(), this.#l += e.deltaY * Yt, this.#w();
+		e.preventDefault(), this.#l += e.deltaY * sn, this.#w();
 	};
 	#b = (e) => {
 		e.code === "KeyF" && !e.repeat && (this.#u = !this.#u), this.#o.add(e.code), this.#u && this.#w();
@@ -2568,7 +2702,7 @@ var nn = class {
 		let t = await this.#t.pick(e.offsetX, e.offsetY);
 		if (!t || this.#i.signal.aborted) return;
 		let [n, r, i] = t;
-		this.#d = Z(Vt(Q(this.#f), {
+		this.#d = X($t(Z(this.#f), {
 			e: n,
 			n: r,
 			h: i
@@ -2591,43 +2725,43 @@ var nn = class {
 		this.#h = e;
 		let n = this.#d, [r, i] = this.#c;
 		if (r || i) {
-			let e = $t(n.dist, this.#e.clientHeight);
-			n = Gt(n, -r * e, i * e);
+			let e = dn(n.dist, this.#e.clientHeight);
+			n = nn(n, -r * e, i * e);
 		}
 		let [a, o] = this.#s;
 		if (a || o) {
-			let [e, t] = [n.yaw + a * Jt, n.pitch - o * Jt];
-			n = this.#u ? Ht(n, e, t, this.#r) : Z({
+			let [e, t] = [n.yaw + a * on, n.pitch - o * on];
+			n = this.#u ? en(n, e, t, this.#r) : X({
 				...n,
 				yaw: e,
 				pitch: t
 			}, void 0, this.#r);
 		}
-		this.#l && (n = Z({
+		this.#l && (n = X({
 			...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] = en(this.#o), u = this.#u && (s !== 0 || l !== 0 || c !== 0);
+		let [s, c, l] = fn(this.#o), u = this.#u && (s !== 0 || l !== 0 || c !== 0);
 		if (u) {
-			let e = Zt * Ut(n) * t;
-			n = Wt(n, s * e, c * e, l * e);
+			let e = ln * tn(n) * t;
+			n = Q(n, s * e, c * e, l * e);
 		}
 		let d = this.#f;
 		if (d !== n) {
-			this.#d = n = this.#E(n), this.#f = tn(d, n, t, this.#n, this.#r), this.#D();
+			this.#d = n = this.#E(n), this.#f = pn(d, n, t, this.#n, this.#r), this.#D();
 			for (let e of this.#p) e();
 		}
 		u || this.#f !== this.#d ? this.#w() : this.#h = null;
 	};
 	#E(e) {
-		return Z(e, this.#n, this.#r);
+		return X(e, this.#n, this.#r);
 	}
 	#D() {
-		this.#t.setCamera(zt(this.#f));
+		this.#t.setCamera(Zt(this.#f));
 	}
 };
 function $(e, t, n) {
 	e[0] += t, e[1] += n;
 }
 //#endregion
-export { oe as S, qt as _, Q as a, st as b, Wt as c, Ht as d, Vt as f, Bt as g, It as h, Kt as i, Lt as l, Gt as m, kt as n, Z as o, Ft as p, Y as r, At as s, nn as t, Ut as u, zt as v, Ve as x, W as y };
+export { ae as S, an as _, Z as a, gt as b, Q as c, en as d, $t as f, Qt as g, Jt as h, rn as i, Yt as l, nn as m, Vt as n, X as o, qt as p, J as r, Ht as s, mn as t, tn as u, Zt as v, We as x, ht as y };