@daneren2005/shared-memory-physics 1.7.3 → 1.9.0

package/dist/index.js

@@ -3,24 +3,24 @@ import { loadFloat32 as i, storeFloat32 as a } from "@daneren2005/shared-memory-
 import o from "@daneren2005/shared-memory-objects/spatial/shared-spatial-map";
 import s from "flatbush";
 import { addAtomicFloat32 as c } from "@daneren2005/shared-memory-objects/utils/atomic-math";
-//#region src/components/polygon-component.ts
-var l = 16, u = 0, d = 1, f = 33, p = class extends t {
+//#region src/constants.ts
+var l = "position-updated", u = "collidable", d = 50, f = 1.5, p = .5, m = 0, h = 1, g = 2, _ = 3, v = 4, y = 5, b = 16, x = 0, S = 1, C = 33, w = class extends t {
 	get vertexCount() {
 		return this.block[0];
 	}
-}, m = {
+}, T = {
 	type: Float32Array,
 	size: 33,
 	loadProperties: ["vertices"],
 	toBlock(e) {
-		let t = h(e.vertices, e.width, e.height);
+		let t = E(e.vertices, e.width, e.height);
 		return [t.vertices.length / 2, ...t.vertices];
 	},
 	attach(e, t, n) {
-		return new p(t.getBlock(n), n);
+		return new w(t.getBlock(n), n);
 	}
 };
-function h(e, t, n) {
+function E(e, t, n) {
 	if (!e || e.length < 3 || e.length > 16) throw Error("A polygon needs between 3 and 16 vertices");
 	let r = Infinity, i = Infinity, a = -Infinity, o = -Infinity;
 	for (let [t, n] of e) {
@@ -42,7 +42,7 @@ function h(e, t, n) {
 		for (let i = t + 1; i < e.length; i++) {
 			if (i === t || i === t + 1 || t === 0 && i === e.length - 1) continue;
 			let a = e[i], o = e[(i + 1) % e.length];
-			if (g(n, r, a, o)) throw Error("Polygon edges cannot cross or share non-adjacent vertices");
+			if (D(n, r, a, o)) throw Error("Polygon edges cannot cross or share non-adjacent vertices");
 		}
 	}
 	if (t === void 0 != (n === void 0)) throw Error("A sized polygon needs both a width and a height");
@@ -51,24 +51,24 @@ function h(e, t, n) {
 		if (!(t > 0) || !(n > 0)) throw Error("A sized polygon needs a positive width and height");
 		if (r < -t / 2 || a > t / 2 || i < -n / 2 || o > n / 2) throw Error("Polygon vertices must fit inside the width and height they are given with");
 	}
-	let d = u ? t : s, f = u ? n : c, p = u ? 0 : (r + a) / 2, m = u ? 0 : (i + o) / 2, h = [], _ = l > 0 ? e : e.toReversed();
-	for (let [e, t] of _) h.push((e - p) / d, (t - m) / f);
+	let d = u ? t : s, f = u ? n : c, p = u ? 0 : (r + a) / 2, m = u ? 0 : (i + o) / 2, h = [], g = l > 0 ? e : e.toReversed();
+	for (let [e, t] of g) h.push((e - p) / d, (t - m) / f);
 	return {
 		width: d,
 		height: f,
 		vertices: h
 	};
 }
-function g(e, t, n, r) {
-	let i = _(e, t, n), a = _(e, t, r), o = _(n, r, e), s = _(n, r, t);
+function D(e, t, n, r) {
+	let i = O(e, t, n), a = O(e, t, r), o = O(n, r, e), s = O(n, r, t);
 	return i * a <= 0 && o * s <= 0;
 }
-function _(e, t, n) {
+function O(e, t, n) {
 	return (t[0] - e[0]) * (n[1] - e[1]) - (t[1] - e[1]) * (n[0] - e[0]);
 }
 //#endregion
 //#region src/components/transform-component.ts
-var v = 0, y = 1, b = 2, x = 3, S = 4, C = 5, w = class extends t {
+var k = class extends t {
 	get x() {
 		return this.block[0];
 	}
@@ -99,7 +99,7 @@ var v = 0, y = 1, b = 2, x = 3, S = 4, C = 5, w = class extends t {
 	set angle(e) {
 		this.block[4] = e;
 	}
-}, T = {
+}, A = {
 	type: Float32Array,
 	size: 5,
 	loadProperties: [
@@ -112,7 +112,7 @@ var v = 0, y = 1, b = 2, x = 3, S = 4, C = 5, w = class extends t {
 		let t = e.radius, n = e.vertices, r = e.width, i = e.height;
 		if (n !== void 0) {
 			if (t !== void 0) throw Error("A transform takes polygon vertices or a radius, not both");
-			let e = h(n, r, i);
+			let e = E(n, r, i);
 			r = e.width, i = e.height;
 		}
 		if (t !== void 0) {
@@ -128,7 +128,7 @@ var v = 0, y = 1, b = 2, x = 3, S = 4, C = 5, w = class extends t {
 		];
 	},
 	attach(e, t, n) {
-		return new w(t.getBlock(n), n);
+		return new k(t.getBlock(n), n);
 	},
 	save(e) {
 		let t = {
@@ -137,7 +137,7 @@ var v = 0, y = 1, b = 2, x = 3, S = 4, C = 5, w = class extends t {
 		}, n = e.angle;
 		return n !== 0 && (t.angle = n), t;
 	}
-}, E = 0, D = 1, O = 2, k = 3, A = class extends t {
+}, j = 0, ee = 1, te = 2, ne = 3, re = class extends t {
 	get velocityX() {
 		return this.block[0];
 	}
@@ -154,9 +154,9 @@ var v = 0, y = 1, b = 2, x = 3, S = 4, C = 5, w = class extends t {
 		return this.block[2];
 	}
 	set damping(e) {
-		M(e), this.block[2] = e;
+		N(e), this.block[2] = e;
 	}
-}, j = {
+}, M = {
 	type: Float32Array,
 	size: 3,
 	loadProperties: [
@@ -166,14 +166,14 @@ var v = 0, y = 1, b = 2, x = 3, S = 4, C = 5, w = class extends t {
 	],
 	toBlock(e) {
 		let t = e.damping ?? 0;
-		return M(t), [
+		return N(t), [
 			e.velocityX ?? 0,
 			e.velocityY ?? 0,
 			t
 		];
 	},
 	attach(e, t, n) {
-		return new A(t.getBlock(n), n);
+		return new re(t.getBlock(n), n);
 	},
 	save(e) {
 		return {
@@ -183,31 +183,31 @@ var v = 0, y = 1, b = 2, x = 3, S = 4, C = 5, w = class extends t {
 		};
 	}
 };
-function M(e) {
+function N(e) {
 	if (!Number.isFinite(e) || e < 0) throw Error("Damping must be a finite number of at least zero");
 }
 //#endregion
-//#region src/components/dynamics-component.ts
-var N = 0, P = 1, ee = 2, F = 3, I = class extends t {
+//#region src/components/dynamics-component-constants.ts
+var ie = 0, ae = 1, oe = 2, se = 3, ce = class extends t {
 	get accelerationX() {
 		return this.block[0];
 	}
 	set accelerationX(e) {
-		re(e, "Acceleration"), this.block[0] = e;
+		de(e, "Acceleration"), this.block[0] = e;
 	}
 	get accelerationY() {
 		return this.block[1];
 	}
 	set accelerationY(e) {
-		re(e, "Acceleration"), this.block[1] = e;
+		de(e, "Acceleration"), this.block[1] = e;
 	}
 	get mass() {
 		return 1 / this.block[2];
 	}
 	set mass(e) {
-		ne(e), this.block[2] = 1 / e;
+		ue(e), this.block[2] = 1 / e;
 	}
-}, te = {
+}, le = {
 	type: Float32Array,
 	size: 3,
 	loadProperties: [
@@ -217,14 +217,14 @@ var N = 0, P = 1, ee = 2, F = 3, I = class extends t {
 	],
 	toBlock(e) {
 		let t = e.accelerationX ?? 0, n = e.accelerationY ?? 0, r = e.mass ?? 1;
-		return re(t, "Acceleration"), re(n, "Acceleration"), ne(r), [
+		return de(t, "Acceleration"), de(n, "Acceleration"), ue(r), [
 			t,
 			n,
 			1 / r
 		];
 	},
 	attach(e, t, n) {
-		return new I(t.getBlock(n), n);
+		return new ce(t.getBlock(n), n);
 	},
 	save(e) {
 		return {
@@ -234,43 +234,42 @@ var N = 0, P = 1, ee = 2, F = 3, I = class extends t {
 		};
 	}
 };
-function ne(e) {
+function ue(e) {
 	if (!Number.isFinite(e) || e <= 0) throw Error("Mass must be a finite number greater than zero");
 }
-function re(e, t) {
+function de(e, t) {
 	if (!Number.isFinite(e)) throw Error(`${t} must be a finite number`);
 }
 //#endregion
-//#region src/components/body-component.ts
-var ie = 1, ae = 2, oe = 3, se = 4, ce = [
+//#region src/components/body-component-constants.ts
+var fe = 1, pe = 2, me = 3, he = 4, ge = 1, _e = 4294967295, ve = 0, ye = 1, be = 2, xe = 3, Se = 7, Ce = 8, we = 16, Te = 32, Ee = 64, De = [
 	1,
 	2,
 	3,
 	4
-], le = 1, ue = 4294967295;
-function de(e, t, n, r) {
+];
+function Oe(e, t, n, r) {
 	return (t & n) !== 0 && (r & e) !== 0;
 }
-var fe = 0, pe = 1, me = 2, he = 3, ge = 7, _e = 8, ve = 16, ye = 32, be = 64;
-function L(e) {
+function P(e) {
 	return e[0] & 7;
 }
-function R(e) {
+function F(e) {
 	return !!(e[0] & 8);
 }
-function xe(e) {
+function ke(e) {
 	return !!(e[0] & 16);
 }
-function Se(e) {
+function Ae(e) {
 	return !!(e[0] & 64);
 }
-function Ce(e) {
+function je(e) {
 	return !!(e[0] & 32);
 }
-function we(e) {
+function Me(e) {
 	e[0] |= 32;
 }
-var Te = class extends t {
+var Ne = class extends t {
 	get shape() {
 		return this.block[0] & 7;
 	}
@@ -307,7 +306,7 @@ var Te = class extends t {
 	set blocksPath(e) {
 		this.block[0] = e ? this.block[0] | 64 : this.block[0] & -65;
 	}
-}, Ee = {
+}, Pe = {
 	type: Uint32Array,
 	size: 3,
 	loadProperties: [
@@ -324,36 +323,36 @@ var Te = class extends t {
 	],
 	toBlock(e) {
 		return [
-			De(e),
+			Fe(e),
 			e.collideCategory ?? 1,
 			e.collideMask ?? 4294967295
 		];
 	},
 	attach(e, t, n) {
-		return new Te(t.getBlock(n), n);
+		return new Ne(t.getBlock(n), n);
 	}
 };
-function De(e) {
-	let t = Oe(e);
+function Fe(e) {
+	let t = Ie(e);
 	return e.sensor && (t |= 8), e.continuousCollisionDetection && (t |= 16), e.blocksPath && (t |= 64), t;
 }
-function Oe(e) {
+function Ie(e) {
 	let t = e.shape;
 	if (t === void 0) return e.vertices === void 0 ? e.radius === void 0 ? 1 : 2 : 4;
-	if (!ce.includes(t)) throw Error(`Unknown body shape: ${t}`);
+	if (!De.includes(t)) throw Error(`Unknown body shape: ${t}`);
 	if (t === 4 && e.vertices === void 0) throw Error("A polygon body requires vertices");
 	return t;
 }
 //#endregion
-//#region src/components/bounciness-component.ts
-var ke = 0, Ae = 1, je = class extends t {
+//#region src/components/bounciness-component-constants.ts
+var Le = 0, Re = 1, ze = class extends t {
 	get bounciness() {
 		return this.block[0];
 	}
 	set bounciness(e) {
 		this.block[0] = e;
 	}
-}, Me = {
+}, Be = {
 	type: Float32Array,
 	size: 1,
 	loadProperties: ["bounciness"],
@@ -361,9 +360,9 @@ var ke = 0, Ae = 1, je = class extends t {
 		return [e.bounciness ?? 0];
 	},
 	attach(e, t, n) {
-		return new je(t.getBlock(n), n);
+		return new ze(t.getBlock(n), n);
 	}
-}, Ne = 0, Pe = 1, Fe = 2, Ie = 3, Le = 4, Re = 5, ze = 6, Be = 7, Ve = 8, He = 9, Ue = 10, We = 11, Ge = 12, Ke = 13, qe = 14, Je = 15, Ye = 16, Xe = 17, Ze = class extends t {
+}, Ve = 0, He = 1, Ue = 2, We = 3, Ge = 4, Ke = 5, qe = 6, Je = 7, Ye = 8, Xe = 9, Ze = 10, Qe = 11, $e = 12, et = 13, tt = 14, nt = 15, rt = 16, it = 17, at = class extends t {
 	get x() {
 		return this.block[0];
 	}
@@ -442,7 +441,7 @@ var ke = 0, Ae = 1, je = class extends t {
 	set remainingDuration(e) {
 		this.block[7] = e;
 	}
-}, Qe = {
+}, ot = {
 	type: Float32Array,
 	size: 17,
 	loadProperties: ["interpolate"],
@@ -469,162 +468,236 @@ var ke = 0, Ae = 1, je = class extends t {
 		];
 	},
 	attach(e, t, n) {
-		return new Ze(t.getBlock(n), n);
+		return new at(t.getBlock(n), n);
+	}
+}, st = 0, ct = 1, lt = 2, ut = 3, dt = 4, ft = 5, pt = 6, mt = 7, ht = 8, gt = 32, _t = 72, I = {
+	Found: 1,
+	Incomplete: 2,
+	Unreachable: 3
+}, vt = class extends t {
+	get active() {
+		return this.block[5] !== 0;
+	}
+	get goalX() {
+		return i(this.block, 6);
+	}
+	get goalY() {
+		return i(this.block, 7);
+	}
+	get pending() {
+		return Tt(this.block);
+	}
+	get outcome() {
+		return this.block[2];
+	}
+	get waypointIndex() {
+		return this.block[3];
+	}
+	get waypoints() {
+		return Array.from({ length: this.block[4] }, (e, t) => Ot(this.block, t));
+	}
+	navigateTo(e, t) {
+		bt(this.block, e, t);
+	}
+	stop() {
+		St(this.block);
+	}
+}, yt = {
+	type: Int32Array,
+	size: 72,
+	loadProperties: ["navigate"],
+	toBlock: () => Array.from({ length: 72 }, () => 0),
+	attach(e, t, n) {
+		return new vt(t.getBlock(n), n);
 	}
 };
-function $e(e) {
-	let { transform: t, interpolation: n } = e.components;
-	t && n && (n.targetX = n.x = t.x, n.targetY = n.y = t.y, n.previousX = t.x, n.previousY = t.y, n.remainingDuration = 0, n.syncedStepDuration = 0, n.syncedDuration = n.totalDuration);
+function bt(e, t, n) {
+	xt(e, t, n), e[5] = 1, wt(e);
 }
-function et(e, t) {
-	let { transform: n, velocity: r, interpolation: i } = e.components;
-	if (!n || !r || !i) return;
-	let a = 1 - (t.stepFraction < 0 ? 0 : t.stepFraction > 1 ? 1 : t.stepFraction), o = t.stepMs / 1e3, s = n.x, c = n.y, l = r.velocityX * o * a, u = r.velocityY * o * a;
-	n.x = s + l, n.y = c + u, i.x = s, i.y = c, i.duration = t.stepMs * a, i.syncedTick = t.tick, i.totalDuration += i.duration, i.syncedDuration = i.totalDuration, i.remainingDuration = i.duration, i.targetX = n.x, i.targetY = n.y, i.syncedStepDuration = i.duration, i.tick = t.tick;
+function xt(e, t, n) {
+	a(e, 6, t), a(e, 7, n);
+}
+function St(e) {
+	e[5] = 0;
+}
+function Ct(e) {
+	return e[5] !== 0;
+}
+function wt(e) {
+	Atomics.add(e, 0, 1);
+}
+function Tt(e) {
+	return Atomics.load(e, 0) !== Atomics.load(e, 1);
+}
+function Et(e) {
+	return !Tt(e) && e[2] === I.Unreachable;
+}
+function Dt(e) {
+	return {
+		x: i(e, 6),
+		y: i(e, 7)
+	};
+}
+function Ot(e, t) {
+	return {
+		x: L(e, t),
+		y: kt(e, t)
+	};
+}
+function L(e, t) {
+	return i(e, 8 + t * 2);
+}
+function kt(e, t) {
+	return i(e, 8 + t * 2 + 1);
+}
+function At(e, t, n) {
+	let r = n.length > 32, i = r ? 32 : n.length;
+	for (let t = 0; t < i; t++) a(e, 8 + t * 2, n[t].x), a(e, 8 + t * 2 + 1, n[t].y);
+	e[4] = i, e[3] = 0, e[2] = r ? I.Incomplete : t;
 }
 //#endregion
 //#region src/components/registry.ts
-var tt = {
-	transform: T,
-	velocity: j,
-	body: Ee,
-	polygon: m,
-	bounciness: Me,
-	dynamics: te,
-	interpolation: Qe
-}, z = {
+var jt = {
+	transform: A,
+	velocity: M,
+	body: Pe,
+	polygon: T,
+	bounciness: Be,
+	dynamics: le,
+	interpolation: ot
+}, Mt = { navigation: yt }, R = {
 	x: 0,
 	y: 0
-}, B = {
+}, z = {
 	x: 0,
 	y: 0
 };
-function V(e, t) {
+function B(e, t) {
 	return Math.abs(e - t) / 2;
 }
-function H(e, t, n) {
+function V(e, t, n) {
 	return t > e ? n + Math.PI / 2 : n;
 }
-function U(e, t, n) {
+function Nt(e, t, n) {
 	return e === 2 ? t / 2 : e === 3 ? Math.min(t, n) / 2 : 0;
 }
-function W(e, t, n) {
+function Pt(e, t, n) {
 	return e === 2 ? t <= 0 : t <= 0 || n <= 0;
 }
-function nt(e, t, n, r) {
-	return e === 2 ? t / 2 : e === 3 ? Math.abs(Math.cos(H(t, n, r))) * V(t, n) + Math.min(t, n) / 2 : pt(t, n, r);
+function H(e, t, n, r) {
+	return e === 2 ? t / 2 : e === 3 ? Math.abs(Math.cos(V(t, n, r))) * B(t, n) + Math.min(t, n) / 2 : Wt(t, n, r);
 }
-function rt(e, t, n, r) {
-	return e === 2 ? t / 2 : e === 3 ? Math.abs(Math.sin(H(t, n, r))) * V(t, n) + Math.min(t, n) / 2 : mt(t, n, r);
+function U(e, t, n, r) {
+	return e === 2 ? t / 2 : e === 3 ? Math.abs(Math.sin(V(t, n, r))) * B(t, n) + Math.min(t, n) / 2 : Gt(t, n, r);
 }
-function it(e, t, n, r, i, a, o, s, c, l, u, d) {
-	if (W(e, r, i) || W(o, l, u)) return !1;
+function Ft(e, t, n, r, i, a, o, s, c, l, u, d) {
+	if (Pt(e, r, i) || Pt(o, l, u)) return !1;
 	let f = e !== 1, p = o !== 1;
-	if (!f && !p) return ht(t, n, r, i, a, s, c, l, u, d);
-	if (f && !p) return it(o, s, c, l, u, d, e, t, n, r, i, a);
-	let m = at(o, l, u), h = H(l, u, d), g = Math.cos(h) * m, _ = Math.sin(h) * m, v = U(o, l, u);
-	if (!f) return _t(s - g, c - _, s + g, c + _, t, n, r, i, a) < v * v;
-	let y = at(e, r, i), b = H(r, i, a), x = Math.cos(b) * y, S = Math.sin(b) * y, C = U(e, r, i) + v;
-	return gt(t - x, n - S, t + x, n + S, s - g, c - _, s + g, c + _) < C * C;
+	if (!f && !p) return Kt(t, n, r, i, a, s, c, l, u, d);
+	if (f && !p) return Ft(o, s, c, l, u, d, e, t, n, r, i, a);
+	let m = It(o, l, u), h = V(l, u, d), g = Math.cos(h) * m, _ = Math.sin(h) * m, v = Nt(o, l, u);
+	if (!f) return Jt(s - g, c - _, s + g, c + _, t, n, r, i, a) < v * v;
+	let y = It(e, r, i), b = V(r, i, a), x = Math.cos(b) * y, S = Math.sin(b) * y, C = Nt(e, r, i) + v;
+	return qt(t - x, n - S, t + x, n + S, s - g, c - _, s + g, c + _) < C * C;
 }
-function at(e, t, n) {
-	return e === 3 ? V(t, n) : 0;
+function It(e, t, n) {
+	return e === 3 ? B(t, n) : 0;
 }
-function ot(e, t, n, r, i, a, o, s, c, l, u, d, f) {
+function Lt(e, t, n, r, i, a, o, s, c, l, u, d, f) {
 	let p = e !== 1, m = o !== 1;
-	return !p && !m ? st(t, n, r, i, a, s, c, l, u, d, f) : p && m ? ct(e, t, n, r, i, a, o, s, c, l, u, d, f) : p ? lt(s, c, l, u, d, e, t, n, r, i, a, f) : lt(t, n, r, i, a, o, s, c, l, u, d, f) ? (f.x = -f.x, f.y = -f.y, !0) : !1;
+	return !p && !m ? Rt(t, n, r, i, a, s, c, l, u, d, f) : p && m ? zt(e, t, n, r, i, a, o, s, c, l, u, d, f) : p ? Bt(s, c, l, u, d, e, t, n, r, i, a, f) : Bt(t, n, r, i, a, o, s, c, l, u, d, f) ? (f.x = -f.x, f.y = -f.y, !0) : !1;
 }
-function st(e, t, n, r, i, a, o, s, c, l, u) {
-	let d = Math.cos(i), f = Math.sin(i), p = Math.cos(l), m = Math.sin(l), h = n / 2, g = r / 2, _ = s / 2, v = c / 2, y = e - a, b = t - o, x = G(d, f, y, b, h, g, d, f, _, v, p, m);
+function Rt(e, t, n, r, i, a, o, s, c, l, u) {
+	let d = Math.cos(i), f = Math.sin(i), p = Math.cos(l), m = Math.sin(l), h = n / 2, g = r / 2, _ = s / 2, v = c / 2, y = e - a, b = t - o, x = W(d, f, y, b, h, g, d, f, _, v, p, m);
 	u.x = d, u.y = f;
-	let S = G(-f, d, y, b, h, g, d, f, _, v, p, m);
-	return S < x && (x = S, u.x = -f, u.y = d), S = G(p, m, y, b, h, g, d, f, _, v, p, m), S < x && (x = S, u.x = p, u.y = m), S = G(-m, p, y, b, h, g, d, f, _, v, p, m), S < x && (u.x = -m, u.y = p), dt(y, b, u), !0;
+	let S = W(-f, d, y, b, h, g, d, f, _, v, p, m);
+	return S < x && (x = S, u.x = -f, u.y = d), S = W(p, m, y, b, h, g, d, f, _, v, p, m), S < x && (x = S, u.x = p, u.y = m), S = W(-m, p, y, b, h, g, d, f, _, v, p, m), S < x && (u.x = -m, u.y = p), Ht(y, b, u), !0;
 }
-function ct(e, t, n, r, i, a, o, s, c, l, u, d, f) {
-	let p = at(e, r, i), m = H(r, i, a), h = Math.cos(m) * p, g = Math.sin(m) * p, _ = at(o, l, u), v = H(l, u, d), y = Math.cos(v) * _, b = Math.sin(v) * _, x = Math.sqrt(gt(t - h, n - g, t + h, n + g, s - y, c - b, s + y, c + b, z));
-	return x > 0 ? (f.x = z.x / x, f.y = z.y / x, !0) : ft(t - s, n - c, f);
+function zt(e, t, n, r, i, a, o, s, c, l, u, d, f) {
+	let p = It(e, r, i), m = V(r, i, a), h = Math.cos(m) * p, g = Math.sin(m) * p, _ = It(o, l, u), v = V(l, u, d), y = Math.cos(v) * _, b = Math.sin(v) * _, x = Math.sqrt(qt(t - h, n - g, t + h, n + g, s - y, c - b, s + y, c + b, R));
+	return x > 0 ? (f.x = R.x / x, f.y = R.y / x, !0) : Ut(t - s, n - c, f);
 }
-function lt(e, t, n, r, i, a, o, s, c, l, u, d) {
-	let f = at(a, c, l), p = H(c, l, u), m = Math.cos(p) * f, h = Math.sin(p) * f, g = Math.sqrt(_t(o - m, s - h, o + m, s + h, e, t, n, r, i, z));
-	if (g > 0) return d.x = z.x / g, d.y = z.y / g, !0;
-	let _ = Math.cos(i), v = Math.sin(i), y = o - e, b = s - t, x = y * _ + b * v, S = -y * v + b * _, C = m * _ + h * v, w = -m * v + h * _, T = U(a, c, l), E = n / 2, D = r / 2, O = ut(1, 0, x, S, C, w, T, E, D);
+function Bt(e, t, n, r, i, a, o, s, c, l, u, d) {
+	let f = It(a, c, l), p = V(c, l, u), m = Math.cos(p) * f, h = Math.sin(p) * f, g = Math.sqrt(Jt(o - m, s - h, o + m, s + h, e, t, n, r, i, R));
+	if (g > 0) return d.x = R.x / g, d.y = R.y / g, !0;
+	let _ = Math.cos(i), v = Math.sin(i), y = o - e, b = s - t, x = y * _ + b * v, S = -y * v + b * _, C = m * _ + h * v, w = -m * v + h * _, T = Nt(a, c, l), E = n / 2, D = r / 2, O = Vt(1, 0, x, S, C, w, T, E, D);
 	d.x = 1, d.y = 0;
-	let k = ut(0, 1, x, S, C, w, T, E, D);
-	k < O && (O = k, d.x = 0, d.y = 1), ft(-w, C, B) && (k = ut(B.x, B.y, x, S, C, w, T, E, D), k < O && (d.x = B.x, d.y = B.y)), dt(x, S, d);
+	let k = Vt(0, 1, x, S, C, w, T, E, D);
+	k < O && (O = k, d.x = 0, d.y = 1), Ut(-w, C, z) && (k = Vt(z.x, z.y, x, S, C, w, T, E, D), k < O && (d.x = z.x, d.y = z.y)), Ht(x, S, d);
 	let A = d.x, j = d.y;
 	return d.x = A * _ - j * v, d.y = A * v + j * _, !0;
 }
-function ut(e, t, n, r, i, a, o, s, c) {
+function Vt(e, t, n, r, i, a, o, s, c) {
 	return s * Math.abs(e) + c * Math.abs(t) + (Math.abs(i * e + a * t) + o) - Math.abs(n * e + r * t);
 }
-function dt(e, t, n) {
+function Ht(e, t, n) {
 	e * n.x + t * n.y < 0 && (n.x = -n.x, n.y = -n.y);
 }
-function ft(e, t, n) {
+function Ut(e, t, n) {
 	let r = Math.sqrt(e * e + t * t);
 	return r !== 0 && (n.x = e / r, n.y = t / r, !0);
 }
-function pt(e, t, n) {
+function Wt(e, t, n) {
 	return (Math.abs(Math.cos(n)) * e + Math.abs(Math.sin(n)) * t) / 2;
 }
-function mt(e, t, n) {
+function Gt(e, t, n) {
 	return (Math.abs(Math.sin(n)) * e + Math.abs(Math.cos(n)) * t) / 2;
 }
-function ht(e, t, n, r, i, a, o, s, c, l) {
+function Kt(e, t, n, r, i, a, o, s, c, l) {
 	if (n <= 0 || r <= 0 || s <= 0 || c <= 0) return !1;
 	let u = Math.cos(i), d = Math.sin(i), f = Math.cos(l), p = Math.sin(l), m = n / 2, h = r / 2, g = s / 2, _ = c / 2, v = a - e, y = o - t;
-	return G(u, d, v, y, m, h, u, d, g, _, f, p) > 0 && G(-d, u, v, y, m, h, u, d, g, _, f, p) > 0 && G(f, p, v, y, m, h, u, d, g, _, f, p) > 0 && G(-p, f, v, y, m, h, u, d, g, _, f, p) > 0;
+	return W(u, d, v, y, m, h, u, d, g, _, f, p) > 0 && W(-d, u, v, y, m, h, u, d, g, _, f, p) > 0 && W(f, p, v, y, m, h, u, d, g, _, f, p) > 0 && W(-p, f, v, y, m, h, u, d, g, _, f, p) > 0;
 }
-function G(e, t, n, r, i, a, o, s, c, l, u, d) {
+function W(e, t, n, r, i, a, o, s, c, l, u, d) {
 	return i * Math.abs(o * e + s * t) + a * Math.abs(-s * e + o * t) + (c * Math.abs(u * e + d * t) + l * Math.abs(-d * e + u * t)) - Math.abs(n * e + r * t);
 }
-function gt(e, t, n, r, i, a, o, s, c) {
+function qt(e, t, n, r, i, a, o, s, c) {
 	let l = n - e, u = r - t, d = o - i, f = s - a, p = e - i, m = t - a, h = l * l + u * u, g = d * d + f * f, _ = d * p + f * m, v = 0, y = 0;
 	if (h <= 0 && g <= 0) return c && (c.x = p, c.y = m), p * p + m * m;
-	if (h <= 0) y = J(_ / g);
+	if (h <= 0) y = q(_ / g);
 	else {
 		let e = l * p + u * m;
-		if (g <= 0) v = J(-e / h);
+		if (g <= 0) v = q(-e / h);
 		else {
 			let t = l * d + u * f, n = h * g - t * t;
-			n !== 0 && (v = J((t * _ - e * g) / n)), y = (t * v + _) / g, y < 0 ? (y = 0, v = J(-e / h)) : y > 1 && (y = 1, v = J((t - e) / h));
+			n !== 0 && (v = q((t * _ - e * g) / n)), y = (t * v + _) / g, y < 0 ? (y = 0, v = q(-e / h)) : y > 1 && (y = 1, v = q((t - e) / h));
 		}
 	}
 	let b = e + l * v - (i + d * y), x = t + u * v - (a + f * y);
 	return c && (c.x = b, c.y = x), b * b + x * x;
 }
-function _t(e, t, n, r, i, a, o, s, c, l) {
+function Jt(e, t, n, r, i, a, o, s, c, l) {
 	let u = Math.cos(c), d = Math.sin(c), f = o / 2, p = s / 2, m = e - i, h = t - a, g = n - i, _ = r - a, v = m * u + h * d, y = -m * d + h * u, b = g * u + _ * d, x = -g * d + _ * u;
-	if (!vt(v, y, b, x, f, p)) return l && (l.x = 0, l.y = 0), 0;
-	if (!l) return Math.min(yt(v, y, f, p), yt(b, x, f, p), q(-f, -p, v, y, b, x), q(f, -p, v, y, b, x), q(f, p, v, y, b, x), q(-f, p, v, y, b, x));
-	let S = yt(v, y, f, p, l);
-	S = K(S, yt(b, x, f, p, B), B, l, !1), S = K(S, q(-f, -p, v, y, b, x, B), B, l, !0), S = K(S, q(f, -p, v, y, b, x, B), B, l, !0), S = K(S, q(f, p, v, y, b, x, B), B, l, !0), S = K(S, q(-f, p, v, y, b, x, B), B, l, !0);
+	if (!Yt(v, y, b, x, f, p)) return l && (l.x = 0, l.y = 0), 0;
+	if (!l) return Math.min(Xt(v, y, f, p), Xt(b, x, f, p), K(-f, -p, v, y, b, x), K(f, -p, v, y, b, x), K(f, p, v, y, b, x), K(-f, p, v, y, b, x));
+	let S = Xt(v, y, f, p, l);
+	S = G(S, Xt(b, x, f, p, z), z, l, !1), S = G(S, K(-f, -p, v, y, b, x, z), z, l, !0), S = G(S, K(f, -p, v, y, b, x, z), z, l, !0), S = G(S, K(f, p, v, y, b, x, z), z, l, !0), S = G(S, K(-f, p, v, y, b, x, z), z, l, !0);
 	let C = l.x, w = l.y;
 	return l.x = C * u - w * d, l.y = C * d + w * u, S;
 }
-function K(e, t, n, r, i) {
+function G(e, t, n, r, i) {
 	return t >= e ? e : (r.x = i ? -n.x : n.x, r.y = i ? -n.y : n.y, t);
 }
-function q(e, t, n, r, i, a, o) {
-	let s = i - n, c = a - r, l = s * s + c * c, u = l > 0 ? J(((e - n) * s + (t - r) * c) / l) : 0, d = e - (n + s * u), f = t - (r + c * u);
+function K(e, t, n, r, i, a, o) {
+	let s = i - n, c = a - r, l = s * s + c * c, u = l > 0 ? q(((e - n) * s + (t - r) * c) / l) : 0, d = e - (n + s * u), f = t - (r + c * u);
 	return o && (o.x = d, o.y = f), d * d + f * f;
 }
-function vt(e, t, n, r, i, a) {
+function Yt(e, t, n, r, i, a) {
 	if (Math.max(e, n) < -i || Math.min(e, n) > i || Math.max(t, r) < -a || Math.min(t, r) > a) return !0;
 	let o = -(r - t), s = n - e;
 	return Math.abs(o * e + s * t) > i * Math.abs(o) + a * Math.abs(s);
 }
-function yt(e, t, n, r, i) {
+function Xt(e, t, n, r, i) {
 	let a = Math.abs(e) - n, o = Math.abs(t) - r, s = a > 0 ? a : 0, c = o > 0 ? o : 0;
 	return i && (i.x = e < 0 ? -s : s, i.y = t < 0 ? -c : c), s * s + c * c;
 }
-function J(e) {
+function q(e) {
 	return e < 0 ? 0 : e > 1 ? 1 : e;
 }
 //#endregion
 //#region src/systems/spatial-bounds.ts
-function Y(e) {
-	let t = e.transform, n = e.body ? L(e.body) : 1, r = t[2], i = t[3], a = t[4], o = nt(n, r, i, a), s = rt(n, r, i, a), c = t[0], l = t[1];
+function J(e) {
+	let t = e.transform, n = e.body ? P(e.body) : 1, r = t[2], i = t[3], a = t[4], o = H(n, r, i, a), s = U(n, r, i, a), c = t[0], l = t[1];
 	return {
 		minX: c - o,
 		minY: l - s,
@@ -632,23 +705,15 @@ function Y(e) {
 		maxY: l + s
 	};
 }
-function bt(e, t, n, r, i) {
+function Zt(e, t, n, r, i) {
 	return e.minX <= r && e.maxX >= t && e.minY <= i && e.maxY >= n;
 }
-function xt(e, t) {
+function Qt(e, t) {
 	return t > e ? t - e : Math.max(1, Math.abs(e)) * 2 ** -52;
 }
 //#endregion
 //#region src/world.ts
-function St(e, t) {
-	t.spatialMapMemory = e.spatialMap.getSharedMemory();
-}
-function Ct(e) {
-	if (e.spatialMap) return e.spatialMap;
-	if (!e.heap || !e.spatialMapMemory) throw Error("Spatial system world is missing its shared MemoryHeap or spatial map");
-	return e.spatialMap = new o(e.heap, e.spatialMapMemory), e.spatialMap;
-}
-var wt = class extends e {
+var $t = class extends e {
 	spatialMap;
 	spatialIds = /* @__PURE__ */ new Set();
 	constructor(e, t = {}) {
@@ -671,7 +736,7 @@ var wt = class extends e {
 			this.spatialIds.delete(t.eid), this.spatialMap.remove(t.eid);
 			return;
 		}
-		let i = Y({
+		let i = J({
 			transform: r,
 			body: n.body?.block
 		});
@@ -679,12 +744,12 @@ var wt = class extends e {
 	}
 	searchSpatial(e, t, n, r, i) {
 		if (n < e || r < t) return [];
-		let a = [], o = Number.isFinite(e) && Number.isFinite(t) && Number.isFinite(n) && Number.isFinite(r) ? this.spatialMap.search(e, t, xt(e, n), xt(t, r)) : this.spatialIds;
+		let a = [], o = Number.isFinite(e) && Number.isFinite(t) && Number.isFinite(n) && Number.isFinite(r) ? this.spatialMap.search(e, t, Qt(e, n), Qt(t, r)) : this.spatialIds;
 		for (let s of o) {
 			let o = this.getEntityByEid(s);
 			if (!o || i && !i(o)) continue;
 			let c = o.components, l = c.transform?.block;
-			l && bt(Y({
+			l && Zt(J({
 				transform: l,
 				body: c.body?.block
 			}), e, t, n, r) && a.push(o);
@@ -706,60 +771,60 @@ var wt = class extends e {
 			return t ? [t] : [];
 		});
 	}
-}, Tt = {
+}, en = {
 	min: 0,
 	max: 0
-}, Et = {
+}, tn = {
 	min: 0,
 	max: 0
-}, X = {
+}, Y = {
 	overlap: !0,
 	depth: Infinity,
 	x: 0,
 	y: 0
 };
-function Dt(e, t, n, r, i, a, o, s, c, l, u, d, f, p) {
-	return kt(e, t, n, r, i, a, o, s, c, l, u, d, f, p, !1);
+function nn(e, t, n, r, i, a, o, s, c, l, u, d, f, p) {
+	return an(e, t, n, r, i, a, o, s, c, l, u, d, f, p, !1);
 }
-function Ot(e, t, n, r, i, a, o, s, c, l, u, d, f, p, m) {
-	return X.depth = Infinity, !kt(e, t, n, r, i, a, o, s, c, l, u, d, f, p, !0) || X.depth === Infinity ? !1 : (m.x = X.x, m.y = X.y, !0);
+function rn(e, t, n, r, i, a, o, s, c, l, u, d, f, p, m) {
+	return Y.depth = Infinity, !an(e, t, n, r, i, a, o, s, c, l, u, d, f, p, !0) || Y.depth === Infinity ? !1 : (m.x = Y.x, m.y = Y.y, !0);
 }
-function kt(e, t, n, r, i, a, o, s, c, l, u, d, f, p, m) {
-	return !(e === 4 && (!t || !At(t, n, r, i, a, o, e, t, n, r, i, a, o, s, c, l, u, d, f, p, m)) || s === 4 && (!c || !At(c, l, u, d, f, p, e, t, n, r, i, a, o, s, c, l, u, d, f, p, m)) || e === 1 && !jt(o, e, t, n, r, i, a, o, s, c, l, u, d, f, p, m) || s === 1 && !jt(p, e, t, n, r, i, a, o, s, c, l, u, d, f, p, m) || Rt(e) && c && !Mt(e, n, r, i, a, o, c, l, u, d, f, p, e, t, n, r, i, a, o, s, c, l, u, d, f, p, m) || Rt(s) && t && !Mt(s, l, u, d, f, p, t, n, r, i, a, o, e, t, n, r, i, a, o, s, c, l, u, d, f, p, m));
+function an(e, t, n, r, i, a, o, s, c, l, u, d, f, p, m) {
+	return !(e === 4 && (!t || !on(t, n, r, i, a, o, e, t, n, r, i, a, o, s, c, l, u, d, f, p, m)) || s === 4 && (!c || !on(c, l, u, d, f, p, e, t, n, r, i, a, o, s, c, l, u, d, f, p, m)) || e === 1 && !sn(o, e, t, n, r, i, a, o, s, c, l, u, d, f, p, m) || s === 1 && !sn(p, e, t, n, r, i, a, o, s, c, l, u, d, f, p, m) || mn(e) && c && !cn(e, n, r, i, a, o, c, l, u, d, f, p, e, t, n, r, i, a, o, s, c, l, u, d, f, p, m) || mn(s) && t && !cn(s, l, u, d, f, p, t, n, r, i, a, o, e, t, n, r, i, a, o, s, c, l, u, d, f, p, m));
 }
-function At(e, t, n, r, i, a, o, s, c, l, u, d, f, p, m, h, g, _, v, y, b) {
+function on(e, t, n, r, i, a, o, s, c, l, u, d, f, p, m, h, g, _, v, y, b) {
 	let x = e[0], S = Math.cos(a), C = Math.sin(a);
 	for (let a = 0; a < x; a++) {
-		let w = (a + 1) % x, T = Ft(e, a, t, r, i, S, C), E = It(e, a, n, r, i, S, C), D = Ft(e, w, t, r, i, S, C);
-		if (!Nt(E - It(e, w, n, r, i, S, C), D - T, o, s, c, l, u, d, f, p, m, h, g, _, v, y, b)) return !1;
+		let w = (a + 1) % x, T = dn(e, a, t, r, i, S, C), E = fn(e, a, n, r, i, S, C), D = dn(e, w, t, r, i, S, C);
+		if (!ln(E - fn(e, w, n, r, i, S, C), D - T, o, s, c, l, u, d, f, p, m, h, g, _, v, y, b)) return !1;
 	}
 	return !0;
 }
-function jt(e, t, n, r, i, a, o, s, c, l, u, d, f, p, m, h) {
+function sn(e, t, n, r, i, a, o, s, c, l, u, d, f, p, m, h) {
 	let g = Math.cos(e), _ = Math.sin(e);
-	return Nt(g, _, t, n, r, i, a, o, s, c, l, u, d, f, p, m, h) && Nt(-_, g, t, n, r, i, a, o, s, c, l, u, d, f, p, m, h);
+	return ln(g, _, t, n, r, i, a, o, s, c, l, u, d, f, p, m, h) && ln(-_, g, t, n, r, i, a, o, s, c, l, u, d, f, p, m, h);
 }
-function Mt(e, t, n, r, i, a, o, s, c, l, u, d, f, p, m, h, g, _, v, y, b, x, S, C, w, T, E) {
-	let D = e === 3 ? V(r, i) : 0, O = H(r, i, a), k = Math.cos(O) * D, A = Math.sin(O) * D, j = t - k, M = n - A, N = t + k, P = n + A, ee = o[0], F = Math.cos(d), I = Math.sin(d);
-	for (let e = 0; e < ee; e++) {
-		let t = Ft(o, e, s, l, u, F, I), n = It(o, e, c, l, u, F, I), r = Lt(j, M, N, P, t, n), i = j + (N - j) * r, a = M + (P - M) * r;
-		if (!Nt(t - i, n - a, f, p, m, h, g, _, v, y, b, x, S, C, w, T, E)) return !1;
+function cn(e, t, n, r, i, a, o, s, c, l, u, d, f, p, m, h, g, _, v, y, b, x, S, C, w, T, E) {
+	let D = e === 3 ? B(r, i) : 0, O = V(r, i, a), k = Math.cos(O) * D, A = Math.sin(O) * D, j = t - k, ee = n - A, te = t + k, ne = n + A, re = o[0], M = Math.cos(d), N = Math.sin(d);
+	for (let e = 0; e < re; e++) {
+		let t = dn(o, e, s, l, u, M, N), n = fn(o, e, c, l, u, M, N), r = pn(j, ee, te, ne, t, n), i = j + (te - j) * r, a = ee + (ne - ee) * r;
+		if (!ln(t - i, n - a, f, p, m, h, g, _, v, y, b, x, S, C, w, T, E)) return !1;
 	}
 	return !0;
 }
-function Nt(e, t, n, r, i, a, o, s, c, l, u, d, f, p, m, h, g) {
+function ln(e, t, n, r, i, a, o, s, c, l, u, d, f, p, m, h, g) {
 	let _ = Math.hypot(e, t);
 	if (_ === 0) return !0;
-	e /= _, t /= _, Pt(n, r, i, a, o, s, c, e, t, Tt), Pt(l, u, d, f, p, m, h, e, t, Et);
-	let v = Tt.max - Et.min, y = Et.max - Tt.min;
+	e /= _, t /= _, un(n, r, i, a, o, s, c, e, t, en), un(l, u, d, f, p, m, h, e, t, tn);
+	let v = en.max - tn.min, y = tn.max - en.min;
 	if (!g && (v <= 0 || y <= 0)) return !1;
 	if (g) {
 		let n, r;
-		v <= 0 ? (n = -v, r = -1) : y <= 0 ? (n = -y, r = 1) : v < y ? (n = v, r = -1) : (n = y, r = 1), n < X.depth && (X.depth = n, X.x = e * r, X.y = t * r);
+		v <= 0 ? (n = -v, r = -1) : y <= 0 ? (n = -y, r = 1) : v < y ? (n = v, r = -1) : (n = y, r = 1), n < Y.depth && (Y.depth = n, Y.x = e * r, Y.y = t * r);
 	}
 	return !0;
 }
-function Pt(e, t, n, r, i, a, o, s, c, l) {
+function un(e, t, n, r, i, a, o, s, c, l) {
 	let u = n * s + r * c;
 	if (e === 2) {
 		let e = i / 2;
@@ -767,7 +832,7 @@ function Pt(e, t, n, r, i, a, o, s, c, l) {
 		return;
 	}
 	if (e === 3) {
-		let e = V(i, a), t = H(i, a, o), n = Math.abs(s * Math.cos(t) + c * Math.sin(t)) * e + Math.min(i, a) / 2;
+		let e = B(i, a), t = V(i, a, o), n = Math.abs(s * Math.cos(t) + c * Math.sin(t)) * e + Math.min(i, a) / 2;
 		l.min = u - n, l.max = u + n;
 		return;
 	}
@@ -783,68 +848,38 @@ function Pt(e, t, n, r, i, a, o, s, c, l) {
 	let d = t[0], f = Math.cos(o), p = Math.sin(o);
 	l.min = Infinity, l.max = -Infinity;
 	for (let e = 0; e < d; e++) {
-		let o = Ft(t, e, n, i, a, f, p), u = It(t, e, r, i, a, f, p), d = o * s + u * c;
+		let o = dn(t, e, n, i, a, f, p), u = fn(t, e, r, i, a, f, p), d = o * s + u * c;
 		l.min = Math.min(l.min, d), l.max = Math.max(l.max, d);
 	}
 }
-function Ft(e, t, n, r, i, a, o) {
+function dn(e, t, n, r, i, a, o) {
 	let s = 1 + t * 2;
 	return n + e[s] * r * a - e[s + 1] * i * o;
 }
-function It(e, t, n, r, i, a, o) {
+function fn(e, t, n, r, i, a, o) {
 	let s = 1 + t * 2;
 	return n + e[s] * r * o + e[s + 1] * i * a;
 }
-function Lt(e, t, n, r, i, a) {
+function pn(e, t, n, r, i, a) {
 	let o = n - e, s = r - t, c = o * o + s * s;
 	return c === 0 ? 0 : Math.min(1, Math.max(0, ((i - e) * o + (a - t) * s) / c));
 }
-function Rt(e) {
+function mn(e) {
 	return e === 2 || e === 3;
 }
-function zt(e, t, n, r, i, a) {
-	if (qt(n, r, "Force"), qt(i, a, "Impulse"), n === 0 && r === 0 && i === 0 && a === 0) return;
-	let o = e.get(t) ?? Kt(), s = {
-		...o,
-		forceX: o.forceX + n,
-		forceY: o.forceY + r,
-		impulseX: o.impulseX + i,
-		impulseY: o.impulseY + a
+//#endregion
+//#region src/actions/dynamics-commands.ts
+function hn() {
+	return {
+		forceX: 0,
+		forceY: 0,
+		impulseX: 0,
+		impulseY: 0
 	};
-	qt(s.forceX, s.forceY, "Accumulated force"), qt(s.impulseX, s.impulseY, "Accumulated impulse"), e.set(t, s);
 }
-function Bt(e, t, n) {
-	Jt(n), (n.velocityX !== void 0 || n.velocityY !== void 0) && e.set(t, {
-		...e.get(t) ?? Kt(),
-		...n
-	});
-}
-function Vt(e, t) {
-	if (e.size === 0) return t;
-	let n = /* @__PURE__ */ new Map();
-	for (let [t, r] of e) n.set(t, { ...r });
-	return Gt(t, (e, t) => {
-		let r = n.get(e) ?? Kt();
-		n.set(e, {
-			forceX: r.forceX + t.forceX,
-			forceY: r.forceY + t.forceY,
-			impulseX: r.impulseX + t.impulseX,
-			impulseY: r.impulseY + t.impulseY,
-			velocityX: t.velocityX ?? r.velocityX,
-			velocityY: t.velocityY ?? r.velocityY
-		});
-	}), Array.from(n, ([e, t]) => ({
-		entityId: e,
-		...t
-	})).sort((e, t) => e.entityId - t.entityId);
-}
-function Ht(e, t, n, r) {
-	let i = e.dynamicsCommands, a = i instanceof Float64Array ? i : void 0, o = Ut(i && !(i instanceof Float64Array) ? i : void 0, t), s = a ? Wt(a, t) : -1, c = n[2];
-	if (!r && !o && s < 0 && c === 0) return;
-	let l = e.elapsedTime / 1e3, u = r?.[2] ?? 1, d = s < 0 ? o?.forceX ?? 0 : a[s + 1], f = s < 0 ? o?.forceY ?? 0 : a[s + 2], p = s < 0 ? o?.impulseX ?? 0 : a[s + 3], m = s < 0 ? o?.impulseY ?? 0 : a[s + 4], h = s < 0 ? 0 : a[s + 5], g = s < 0 ? o?.velocityX : h & 1 ? a[s + 6] : void 0, _ = s < 0 ? o?.velocityY : h & 2 ? a[s + 7] : void 0, v = c > 0 ? 1 / (1 + c * l) : 1, y = (n[0] + (r?.[0] ?? 0) * l + d * u * l + p * u) * v, b = (n[1] + (r?.[1] ?? 0) * l + f * u * l + m * u) * v;
-	n[0] = g ?? y, n[1] = _ ?? b;
-}
-function Ut(e, t) {
+//#endregion
+//#region src/actions/find-dynamics-command.ts
+function gn(e, t) {
 	if (!e) return;
 	let n = 0, r = e.length - 1;
 	for (; n <= r;) {
@@ -853,7 +888,9 @@ function Ut(e, t) {
 		a.entityId < t ? n = i + 1 : r = i - 1;
 	}
 }
-function Wt(e, t) {
+//#endregion
+//#region src/actions/find-dynamics-command-offset.ts
+function _n(e, t) {
 	let n = 0, r = e.length / 8 - 1;
 	for (; n <= r;) {
 		let i = n + r >>> 1, a = i * 8, o = e[a + 0];
@@ -862,45 +899,12 @@ function Wt(e, t) {
 	}
 	return -1;
 }
-function Gt(e, t) {
-	if (e) {
-		if (!(e instanceof Float64Array)) {
-			for (let { entityId: n, ...r } of e) t(n, r);
-			return;
-		}
-		for (let n = 0; n < e.length; n += 8) {
-			let r = e[n + 5];
-			t(e[n + 0], {
-				forceX: e[n + 1],
-				forceY: e[n + 2],
-				impulseX: e[n + 3],
-				impulseY: e[n + 4],
-				velocityX: r & 1 ? e[n + 6] : void 0,
-				velocityY: r & 2 ? e[n + 7] : void 0
-			});
-		}
-	}
-}
-function Kt() {
-	return {
-		forceX: 0,
-		forceY: 0,
-		impulseX: 0,
-		impulseY: 0
-	};
-}
-function qt(e, t, n) {
-	if (!Number.isFinite(e) || !Number.isFinite(t)) throw Error(`${n} must contain finite numbers`);
-}
-function Jt(e) {
-	if (e.velocityX !== void 0 && !Number.isFinite(e.velocityX) || e.velocityY !== void 0 && !Number.isFinite(e.velocityY)) throw Error("Velocity assignment must contain finite numbers");
-}
 //#endregion
 //#region src/systems/collision.ts
-var Yt = 1e-4, Xt = 24, Zt = "collidable", Z = [], Qt = 2 ** 26, $t = {
+var vn = 1e-4, yn = 24, X = [], bn = 2 ** 26, xn = {
 	fraction: 1,
-	blocking: Z
-}, en = class {
+	blocking: X
+}, Sn = class {
 	buckets = [];
 	hasBounciness = !1;
 	resolved = /* @__PURE__ */ new Set();
@@ -911,18 +915,18 @@ var Yt = 1e-4, Xt = 24, Zt = "collidable", Z = [], Qt = 2 ** 26, $t = {
 			if (!o || !s) continue;
 			let c = s[1];
 			if (c === 0) continue;
-			let l = L(s), u = o[2], d = o[3];
-			if (W(l, u, d)) continue;
-			let f = o[4], p = nt(l, u, d, f), m = rt(l, u, d, f);
+			let l = P(s), u = o[2], d = o[3];
+			if (Pt(l, u, d)) continue;
+			let f = o[4], p = H(l, u, d, f), m = U(l, u, d, f);
 			e.bounciness && (this.hasBounciness = !0);
-			let h = e.velocity, g = e.dynamics, _ = Ut(a, n.entityId), v = i ? Wt(i, n.entityId) : -1, y = g?.[2] ?? 1, b = v < 0 ? _?.forceX ?? 0 : i[v + 1], x = v < 0 ? _?.forceY ?? 0 : i[v + 2], S = v < 0 ? _?.impulseX ?? 0 : i[v + 3], C = v < 0 ? _?.impulseY ?? 0 : i[v + 4], w = v < 0 ? 0 : i[v + 5], T = v < 0 ? _?.velocityX : w & 1 ? i[v + 6] : void 0, E = v < 0 ? _?.velocityY : w & 2 ? i[v + 7] : void 0, D = h?.[0] ?? 0, O = h?.[1] ?? 0, k = D + (g?.[0] ?? 0) * t + b * y * t + S * y, A = O + (g?.[1] ?? 0) * t + x * y * t + C * y, j = T ?? k, M = E ?? A, N = Math.max(Math.abs(D), Math.abs(j)) * t, P = Math.max(Math.abs(O), Math.abs(M)) * t, ee = o[0], F = o[1], I = r.get(c);
-			I || (I = {
+			let h = e.velocity, g = e.dynamics, _ = gn(a, n.entityId), v = i ? _n(i, n.entityId) : -1, y = g?.[2] ?? 1, b = v < 0 ? _?.forceX ?? 0 : i[v + 1], x = v < 0 ? _?.forceY ?? 0 : i[v + 2], S = v < 0 ? _?.impulseX ?? 0 : i[v + 3], C = v < 0 ? _?.impulseY ?? 0 : i[v + 4], w = v < 0 ? 0 : i[v + 5], T = v < 0 ? _?.velocityX : w & 1 ? i[v + 6] : void 0, E = v < 0 ? _?.velocityY : w & 2 ? i[v + 7] : void 0, D = h?.[0] ?? 0, O = h?.[1] ?? 0, k = D + (g?.[0] ?? 0) * t + b * y * t + S * y, A = O + (g?.[1] ?? 0) * t + x * y * t + C * y, j = T ?? k, ee = E ?? A, te = Math.max(Math.abs(D), Math.abs(j)) * t, ne = Math.max(Math.abs(O), Math.abs(ee)) * t, re = o[0], M = o[1], N = r.get(c);
+			N || (N = {
 				entries: [],
 				bounds: []
-			}, r.set(c, I)), I.entries.push({
+			}, r.set(c, N)), N.entries.push({
 				entityId: n.entityId,
 				components: e
-			}), I.bounds.push(ee - p - N, F - m - P, ee + p + N, F + m + P);
+			}), N.bounds.push(re - p - te, M - m - ne, re + p + te, M + m + ne);
 		}
 		for (let [e, { entries: t, bounds: n }] of r) {
 			let r = new s(t.length);
@@ -935,26 +939,26 @@ var Yt = 1e-4, Xt = 24, Zt = "collidable", Z = [], Qt = 2 ** 26, $t = {
 		}
 	}
 	claimContact(e, t) {
-		let n = e < t ? e * Qt + t : t * Qt + e;
+		let n = e < t ? e * bn + t : t * bn + e;
 		return !this.resolved.has(n) && (this.resolved.add(n), !0);
 	}
 	forEachOverlapping(e, t, n = 0, r = 0) {
-		let i = Q(e);
+		let i = Tn(e);
 		if (!i) return;
 		let { x: a, y: o, halfWidth: s, halfHeight: c } = i;
 		if (i.ccd && (n !== 0 || r !== 0)) {
 			let e = a - n, l = o - r, u = Math.min(e, a) - s, d = Math.min(l, o) - c, f = Math.max(e, a) + s, p = Math.max(l, o) + c;
 			this.forEachCandidate(i, u, d, f, p, (a) => {
-				rn(i, e, l, n, r, a) && t(a);
+				En(i, e, l, n, r, a) && t(a);
 			});
 			return;
 		}
 		this.forEachCandidate(i, a - s, o - c, a + s, o + c, (e) => {
-			$(i, a, o, e) && t(e);
+			Z(i, a, o, e) && t(e);
 		});
 	}
 	contactPoint(e, t, n, r) {
-		let i = e.components.transform, a = i[0], o = i[1], s = Math.sqrt(n * n + r * r), c = Q(e);
+		let i = e.components.transform, a = i[0], o = i[1], s = Math.sqrt(n * n + r * r), c = Tn(e);
 		if (!c || s === 0) return {
 			x: a,
 			y: o
@@ -967,33 +971,33 @@ var Yt = 1e-4, Xt = 24, Zt = "collidable", Z = [], Qt = 2 ** 26, $t = {
 		};
 	}
 	contactNormal(e, t, n, r, i) {
-		let a = Q(e);
+		let a = Tn(e);
 		if (!a) return !1;
 		let o = n === 0 && r === 0 ? {
 			x: a.x,
 			y: a.y
 		} : this.contactPoint(e, t, n, r);
-		return tn(a, o.x, o.y, t, i);
+		return Cn(a, o.x, o.y, t, i);
 	}
 	sweep(e, t, n) {
-		let r = Math.sqrt(t * t + n * n), i = Q(e);
+		let r = Math.sqrt(t * t + n * n), i = Tn(e);
 		if (!i || r === 0) return {
 			fraction: 1,
-			blocking: Z
+			blocking: X
 		};
 		if (i.ccd) return this.sweepContinuous(i, t, n, r);
 		let a = this.gatherCandidates(i, t, n);
 		return a.length === 0 ? {
 			fraction: 1,
-			blocking: Z
+			blocking: X
 		} : this.refine(i, a, t, n, r);
 	}
 	resolveMove(e, t, n, r) {
-		let i = Math.sqrt(t * t + n * n), a = Q(e);
+		let i = Math.sqrt(t * t + n * n), a = Tn(e);
 		if (!a || i === 0) return {
 			moveX: t,
 			moveY: n,
-			blocking: Z
+			blocking: X
 		};
 		if (a.ccd) {
 			let e = this.sweepContinuous(a, t, n, i);
@@ -1007,20 +1011,20 @@ var Yt = 1e-4, Xt = 24, Zt = "collidable", Z = [], Qt = 2 ** 26, $t = {
 		if (o.length === 0) return {
 			moveX: t,
 			moveY: n,
-			blocking: Z
+			blocking: X
 		};
 		if (r && t !== 0 && n !== 0) {
 			let e = this.gatherCandidates(a, t, 0), r = this.gatherCandidates(a, 0, n);
 			if (e.length === 0 && r.length === 0) return Math.abs(t) >= Math.abs(n) ? {
 				moveX: t,
 				moveY: 0,
-				blocking: Z
+				blocking: X
 			} : {
 				moveX: 0,
 				moveY: n,
-				blocking: Z
+				blocking: X
 			};
-			let i = e.length === 0 ? $t : this.refine(a, e, t, 0, Math.abs(t)), o = r.length === 0 ? $t : this.refine(a, r, 0, n, Math.abs(n)), s = t * i.fraction, c = n * o.fraction;
+			let i = e.length === 0 ? xn : this.refine(a, e, t, 0, Math.abs(t)), o = r.length === 0 ? xn : this.refine(a, r, 0, n, Math.abs(n)), s = t * i.fraction, c = n * o.fraction;
 			if (s !== 0 && c !== 0) {
 				let e = this.gatherCandidates(a, s, c);
 				if (e.length > 0) {
@@ -1035,7 +1039,7 @@ var Yt = 1e-4, Xt = 24, Zt = "collidable", Z = [], Qt = 2 ** 26, $t = {
 			return {
 				moveX: s,
 				moveY: c,
-				blocking: nn(i.blocking, o.blocking)
+				blocking: wn(i.blocking, o.blocking)
 			};
 		}
 		let s = this.refine(a, o, t, n, i);
@@ -1050,19 +1054,19 @@ var Yt = 1e-4, Xt = 24, Zt = "collidable", Z = [], Qt = 2 ** 26, $t = {
 		if (e.sensor) return [];
 		let s = r + t, c = i + n, l = [];
 		return this.forEachCandidate(e, s - a, c - o, s + a, c + o, (t) => {
-			$(e, s, c, t) && (R(t.components.body) || $(e, r, i, t) || l.push(t));
+			Z(e, s, c, t) && (F(t.components.body) || Z(e, r, i, t) || l.push(t));
 		}), l;
 	}
 	refine(e, t, n, r, i) {
-		let { x: a, y: o } = e, s = 0, c = 1, l = Yt / i;
-		for (let i = 0; i < Xt && c - s > l; i++) {
+		let { x: a, y: o } = e, s = 0, c = 1, l = vn / i;
+		for (let i = 0; i < yn && c - s > l; i++) {
 			let i = (s + c) / 2;
 			this.blockedAt(e, t, n, r, i) ? c = i : s = i;
 		}
 		let u = [], d = a + n * c, f = o + r * c;
-		for (let n of t) $(e, d, f, n) && u.push(n);
+		for (let n of t) Z(e, d, f, n) && u.push(n);
 		return {
-			fraction: s * i > Yt ? s : 0,
+			fraction: s * i > vn ? s : 0,
 			blocking: u
 		};
 	}
@@ -1070,22 +1074,22 @@ var Yt = 1e-4, Xt = 24, Zt = "collidable", Z = [], Qt = 2 ** 26, $t = {
 		if (e.sensor) return [];
 		let { x: r, y: i, halfWidth: a, halfHeight: o } = e, s = r + t, c = i + n, l = [];
 		return this.forEachCandidate(e, Math.min(r, s) - a, Math.min(i, c) - o, Math.max(r, s) + a, Math.max(i, c) + o, (a) => {
-			R(a.components.body) || $(e, r, i, a) || rn(e, r, i, t, n, a) && l.push(a);
+			F(a.components.body) || Z(e, r, i, a) || En(e, r, i, t, n, a) && l.push(a);
 		}), l;
 	}
 	sweepContinuous(e, t, n, r) {
 		let i = this.gatherContinuousCandidates(e, t, n);
 		if (i.length === 0) return {
 			fraction: 1,
-			blocking: Z
+			blocking: X
 		};
-		let a = 1, o = [], s = Yt / r;
+		let a = 1, o = [], s = vn / r;
 		for (let c of i) {
 			let i = this.entryFraction(e, c, t, n, r);
 			i < a - s ? (a = i, o = [c]) : i <= a + s && o.push(c);
 		}
 		return {
-			fraction: a * r > Yt ? a : 0,
+			fraction: a * r > vn ? a : 0,
 			blocking: o
 		};
 	}
@@ -1093,50 +1097,50 @@ var Yt = 1e-4, Xt = 24, Zt = "collidable", Z = [], Qt = 2 ** 26, $t = {
 		let a;
 		if (this.blockedAtOne(e, t, n, r, 1)) a = 1;
 		else {
-			let o = t.components.transform, s = o[0] - e.x, c = o[1] - e.y, l = an((s * n + c * r) / (i * i));
+			let o = t.components.transform, s = o[0] - e.x, c = o[1] - e.y, l = Dn((s * n + c * r) / (i * i));
 			if (!this.blockedAtOne(e, t, n, r, l)) return l;
 			a = l;
 		}
-		let o = 0, s = Yt / i;
-		for (let i = 0; i < Xt && a - o > s; i++) {
+		let o = 0, s = vn / i;
+		for (let i = 0; i < yn && a - o > s; i++) {
 			let i = (o + a) / 2;
 			this.blockedAtOne(e, t, n, r, i) ? a = i : o = i;
 		}
 		return o;
 	}
 	blockedAtOne(e, t, n, r, i) {
-		return $(e, Math.fround(e.x + n * i), Math.fround(e.y + r * i), t);
+		return Z(e, Math.fround(e.x + n * i), Math.fround(e.y + r * i), t);
 	}
 	blockedAt(e, t, n, r, i) {
 		let a = Math.fround(e.x + n * i), o = Math.fround(e.y + r * i);
-		for (let n of t) if ($(e, a, o, n)) return !0;
+		for (let n of t) if (Z(e, a, o, n)) return !0;
 		return !1;
 	}
 	forEachCandidate(e, t, r, i, a, o) {
 		for (let s of this.buckets) if ((e.mask & s.category) !== 0) for (let c of s.index.search(t, r, i, a)) {
 			let t = s.entries[c];
-			t.entityId !== e.entityId && (t.components.body[2] & e.category) !== 0 && t.components.entity?.[n] !== 1 && (Ce(t.components.body) || o(t));
+			t.entityId !== e.entityId && (t.components.body[2] & e.category) !== 0 && t.components.entity?.[n] !== 1 && (je(t.components.body) || o(t));
 		}
 	}
 };
-function tn(e, t, n, r, i) {
-	let a = r.components.transform, o = L(r.components.body), s = a[0], c = a[1], l = a[2], u = a[3], d = a[4];
-	return e.shape === 4 || o === 4 ? Ot(e.shape, e.polygon, t, n, e.width, e.height, e.angle, o, r.components.polygon, s, c, l, u, d, i) : ot(e.shape, t, n, e.width, e.height, e.angle, o, s, c, l, u, d, i);
+function Cn(e, t, n, r, i) {
+	let a = r.components.transform, o = P(r.components.body), s = a[0], c = a[1], l = a[2], u = a[3], d = a[4];
+	return e.shape === 4 || o === 4 ? rn(e.shape, e.polygon, t, n, e.width, e.height, e.angle, o, r.components.polygon, s, c, l, u, d, i) : Lt(e.shape, t, n, e.width, e.height, e.angle, o, s, c, l, u, d, i);
 }
-function nn(e, t) {
+function wn(e, t) {
 	if (e.length === 0) return t;
 	if (t.length === 0) return e;
 	let n = [...e];
 	for (let e of t) n.some((t) => t.entityId === e.entityId) || n.push(e);
 	return n;
 }
-function Q(e) {
+function Tn(e) {
 	let t = e.components.body;
 	if (!t) return;
 	let n = t[2];
 	if (n === 0) return;
-	let r = e.components.transform, i = L(t), a = r[2], o = r[3];
-	if (W(i, a, o)) return;
+	let r = e.components.transform, i = P(t), a = r[2], o = r[3];
+	if (Pt(i, a, o)) return;
 	let s = r[4], c = e.components.polygon;
 	if (i !== 4 || c) return {
 		entityId: e.entityId,
@@ -1147,36 +1151,36 @@ function Q(e) {
 		width: a,
 		height: o,
 		angle: s,
-		halfWidth: nt(i, a, o, s),
-		halfHeight: rt(i, a, o, s),
+		halfWidth: H(i, a, o, s),
+		halfHeight: U(i, a, o, s),
 		category: t[1],
 		mask: n,
-		sensor: R(t),
-		ccd: xe(t)
+		sensor: F(t),
+		ccd: ke(t)
 	};
 }
-function rn(e, t, n, r, i, a) {
-	let o = t + r, s = n + i, c = a.components.transform, l = L(a.components.body), u = c[0], d = c[1], f = c[2], p = c[3], m = c[4];
+function En(e, t, n, r, i, a) {
+	let o = t + r, s = n + i, c = a.components.transform, l = P(a.components.body), u = c[0], d = c[1], f = c[2], p = c[3], m = c[4];
 	if (e.shape === 1 || e.shape === 4) {
 		let c = Math.cos(e.angle), h = Math.sin(e.angle), g = r * c + i * h, _ = -r * h + i * c;
-		return on(1, void 0, (t + o) / 2, (n + s) / 2, e.width + Math.abs(g), e.height + Math.abs(_), e.angle, l, a.components.polygon, u, d, f, p, m);
+		return On(1, void 0, (t + o) / 2, (n + s) / 2, e.width + Math.abs(g), e.height + Math.abs(_), e.angle, l, a.components.polygon, u, d, f, p, m);
 	}
-	let h = U(e.shape, e.width, e.height), g = Math.sqrt(r * r + i * i), _ = g > 0 ? Math.atan2(i, r) : e.angle;
-	return on(3, void 0, (t + o) / 2, (n + s) / 2, g + h * 2, h * 2, _, l, a.components.polygon, u, d, f, p, m) ? !0 : on(e.shape, e.polygon, o, s, e.width, e.height, e.angle, l, a.components.polygon, u, d, f, p, m);
+	let h = Nt(e.shape, e.width, e.height), g = Math.sqrt(r * r + i * i), _ = g > 0 ? Math.atan2(i, r) : e.angle;
+	return On(3, void 0, (t + o) / 2, (n + s) / 2, g + h * 2, h * 2, _, l, a.components.polygon, u, d, f, p, m) ? !0 : On(e.shape, e.polygon, o, s, e.width, e.height, e.angle, l, a.components.polygon, u, d, f, p, m);
 }
-function an(e) {
+function Dn(e) {
 	return e < 0 ? 0 : e > 1 ? 1 : e;
 }
-function $(e, t, n, r) {
+function Z(e, t, n, r) {
 	let i = r.components.transform;
-	return on(e.shape, e.polygon, t, n, e.width, e.height, e.angle, L(r.components.body), r.components.polygon, i[0], i[1], i[2], i[3], i[4]);
+	return On(e.shape, e.polygon, t, n, e.width, e.height, e.angle, P(r.components.body), r.components.polygon, i[0], i[1], i[2], i[3], i[4]);
 }
-function on(e, t, n, r, i, a, o, s, c, l, u, d, f, p) {
-	return e !== 4 && s !== 4 ? it(e, n, r, i, a, o, s, l, u, d, f, p) : Dt(e, t, n, r, i, a, o, s, c, l, u, d, f, p);
+function On(e, t, n, r, i, a, o, s, c, l, u, d, f, p) {
+	return e !== 4 && s !== 4 ? Ft(e, n, r, i, a, o, s, l, u, d, f, p) : nn(e, t, n, r, i, a, o, s, c, l, u, d, f, p);
 }
 //#endregion
 //#region src/systems/spatial-index.ts
-var sn = class {
+var kn = class {
 	entries = [];
 	index;
 	constructor(e) {
@@ -1184,7 +1188,7 @@ var sn = class {
 		for (let n of e) {
 			let e = n.components, r = e.transform;
 			if (!r) continue;
-			let i = e.body, a = i ? L(i) : 1, o = r[2], s = r[3], c = r[4], l = r[0], u = r[1], d = nt(a, o, s, c), f = rt(a, o, s, c);
+			let i = e.body, a = i ? P(i) : 1, o = r[2], s = r[3], c = r[4], l = r[0], u = r[1], d = H(a, o, s, c), f = U(a, o, s, c);
 			this.entries.push({
 				entityId: n.entityId,
 				components: e
@@ -1216,14 +1220,70 @@ var sn = class {
 		let o = this.entries;
 		return (i ? a.neighbors(e, t, n, r, (e) => i(o[e])) : a.neighbors(e, t, n, r)).map((e) => o[e]);
 	}
-}, cn = {
+};
+//#endregion
+//#region src/actions/get-spatial-map.ts
+function An(e) {
+	if (e.spatialMap) return e.spatialMap;
+	if (!e.heap || !e.spatialMapMemory) throw Error("Spatial system world is missing its shared MemoryHeap or spatial map");
+	return e.spatialMap = new o(e.heap, e.spatialMapMemory), e.spatialMap;
+}
+//#endregion
+//#region src/actions/update-spatial-map.ts
+function Q(e, t, n) {
+	if (!e.spatialMap && (!e.heap || !e.spatialMapMemory)) return;
+	let r = An(e), i = J(n);
+	r.update(t, i.minX, i.minY, i.maxX - i.minX, i.maxY - i.minY);
+}
+//#endregion
+//#region src/actions/set-entity-position.ts
+function jn(e, t, n) {
+	let r = t.components.transform;
+	if (!(r instanceof Float32Array)) return;
+	a(r, 0, n.x), a(r, 1, n.y);
+	let i = t.components.body;
+	Q(e, t.entityId, {
+		transform: r,
+		...i instanceof Uint32Array ? { body: i } : {}
+	});
+}
+//#endregion
+//#region src/actions/add-physical-world-data.ts
+function Mn(e, t) {
+	t.spatialMapMemory = e.spatialMap.getSharedMemory();
+}
+//#endregion
+//#region src/actions/snap-entity.ts
+function Nn(e) {
+	let { transform: t, interpolation: n } = e.components;
+	t && n && (n.targetX = n.x = t.x, n.targetY = n.y = t.y, n.previousX = t.x, n.previousY = t.y, n.remainingDuration = 0, n.syncedStepDuration = 0, n.syncedDuration = n.totalDuration);
+}
+//#endregion
+//#region src/actions/start-spawn-interpolation.ts
+function Pn(e, t) {
+	let { transform: n, velocity: r, interpolation: i } = e.components;
+	if (!n || !r || !i) return;
+	let a = 1 - (t.stepFraction < 0 ? 0 : t.stepFraction > 1 ? 1 : t.stepFraction), o = t.stepMs / 1e3, s = n.x, c = n.y, l = r.velocityX * o * a, u = r.velocityY * o * a;
+	n.x = s + l, n.y = c + u, i.x = s, i.y = c, i.duration = t.stepMs * a, i.syncedTick = t.tick, i.totalDuration += i.duration, i.syncedDuration = i.totalDuration, i.remainingDuration = i.duration, i.targetX = n.x, i.targetY = n.y, i.syncedStepDuration = i.duration, i.tick = t.tick;
+}
+//#endregion
+//#region src/actions/integrate-dynamics.ts
+function Fn(e, t, n, r) {
+	let i = e.dynamicsCommands, a = i instanceof Float64Array ? i : void 0, o = gn(i && !(i instanceof Float64Array) ? i : void 0, t), s = a ? _n(a, t) : -1, c = n[2];
+	if (!r && !o && s < 0 && c === 0) return;
+	let l = e.elapsedTime / 1e3, u = r?.[2] ?? 1, d = s < 0 ? o?.forceX ?? 0 : a[s + 1], f = s < 0 ? o?.forceY ?? 0 : a[s + 2], p = s < 0 ? o?.impulseX ?? 0 : a[s + 3], m = s < 0 ? o?.impulseY ?? 0 : a[s + 4], h = s < 0 ? 0 : a[s + 5], g = s < 0 ? o?.velocityX : h & 1 ? a[s + 6] : void 0, _ = s < 0 ? o?.velocityY : h & 2 ? a[s + 7] : void 0, v = c > 0 ? 1 / (1 + c * l) : 1, y = (n[0] + (r?.[0] ?? 0) * l + d * u * l + p * u) * v, b = (n[1] + (r?.[1] ?? 0) * l + f * u * l + m * u) * v;
+	n[0] = g ?? y, n[1] = _ ?? b;
+}
+//#endregion
+//#region src/systems/bounce.ts
+var In = {
 	x: 0,
 	y: 0
 };
-function ln(e, t, n = !1) {
-	(fn(e, n) || fn(t, n)) && pn(e, t) && mn(e, t, cn) && (dn(e, cn.x, cn.y, n), dn(t, -cn.x, -cn.y, n));
+function Ln(e, t, n = !1) {
+	(Bn(e, n) || Bn(t, n)) && Vn(e, t) && Hn(e, t, In) && (zn(e, In.x, In.y, n), zn(t, -In.x, -In.y, n));
 }
-function un(e, t, n) {
+function Rn(e, t, n) {
 	let r = e.components.bounciness, i = e.components.velocity;
 	if (!r || !i) return;
 	let a = i[0], o = i[1], s = a * t + o * n;
@@ -1231,9 +1291,9 @@ function un(e, t, n) {
 	let c = (1 + r[0]) * s;
 	i[0] = a - c * t, i[1] = o - c * n;
 }
-function dn(e, t, n, r) {
+function zn(e, t, n, r) {
 	if (e.components.bounciness) {
-		un(e, t, n);
+		Rn(e, t, n);
 		return;
 	}
 	let i = e.components.velocity;
@@ -1241,60 +1301,122 @@ function dn(e, t, n, r) {
 	let a = i[0], o = i[1], s = a * t + o * n;
 	s < 0 && (i[0] = a - s * t, i[1] = o - s * n);
 }
-function fn(e, t) {
+function Bn(e, t) {
 	return e.components.velocity !== void 0 && (t || e.components.bounciness !== void 0);
 }
-function pn(e, t) {
-	return !gn(e.components.body) && !gn(t.components.body);
+function Vn(e, t) {
+	return !Wn(e.components.body) && !Wn(t.components.body);
 }
-function mn(e, t, n) {
-	let r = e.components.transform, i = t.components.transform, a = hn(e.components.body), o = hn(t.components.body);
-	return a === 4 || o === 4 ? Ot(a, e.components.polygon, r[0], r[1], r[2], r[3], r[4], o, t.components.polygon, i[0], i[1], i[2], i[3], i[4], n) : ot(a, r[0], r[1], r[2], r[3], r[4], o, i[0], i[1], i[2], i[3], i[4], n);
+function Hn(e, t, n) {
+	let r = e.components.transform, i = t.components.transform, a = Un(e.components.body), o = Un(t.components.body);
+	return a === 4 || o === 4 ? rn(a, e.components.polygon, r[0], r[1], r[2], r[3], r[4], o, t.components.polygon, i[0], i[1], i[2], i[3], i[4], n) : Lt(a, r[0], r[1], r[2], r[3], r[4], o, i[0], i[1], i[2], i[3], i[4], n);
 }
-function hn(e) {
-	return e ? L(e) : 1;
+function Un(e) {
+	return e ? P(e) : 1;
 }
-function gn(e) {
-	return e !== void 0 && R(e);
+function Wn(e) {
+	return e !== void 0 && F(e);
 }
 //#endregion
-//#region src/systems/physics-update.ts
-function _n(e, t, n) {
-	if (!e.spatialMap && (!e.heap || !e.spatialMapMemory)) return;
-	let r = Ct(e), i = Y(n);
-	r.update(t, i.minX, i.minY, i.maxX - i.minX, i.maxY - i.minY);
+//#region src/actions/combine-dynamics-commands.ts
+function Gn(e, t) {
+	if (e.size === 0) return t;
+	let n = /* @__PURE__ */ new Map();
+	for (let [t, r] of e) n.set(t, { ...r });
+	return Kn(t, (e, t) => {
+		let r = n.get(e) ?? hn();
+		n.set(e, {
+			forceX: r.forceX + t.forceX,
+			forceY: r.forceY + t.forceY,
+			impulseX: r.impulseX + t.impulseX,
+			impulseY: r.impulseY + t.impulseY,
+			velocityX: t.velocityX ?? r.velocityX,
+			velocityY: t.velocityY ?? r.velocityY
+		});
+	}), Array.from(n, ([e, t]) => ({
+		entityId: e,
+		...t
+	})).sort((e, t) => e.entityId - t.entityId);
+}
+function Kn(e, t) {
+	if (e) {
+		if (!(e instanceof Float64Array)) {
+			for (let { entityId: n, ...r } of e) t(n, r);
+			return;
+		}
+		for (let n = 0; n < e.length; n += 8) {
+			let r = e[n + 5];
+			t(e[n + 0], {
+				forceX: e[n + 1],
+				forceY: e[n + 2],
+				impulseX: e[n + 3],
+				impulseY: e[n + 4],
+				velocityX: r & 1 ? e[n + 6] : void 0,
+				velocityY: r & 2 ? e[n + 7] : void 0
+			});
+		}
+	}
+}
+//#endregion
+//#region src/actions/queue-dynamics-vector.ts
+function qn(e, t, n, r, i, a) {
+	if (Jn(n, r, "Force"), Jn(i, a, "Impulse"), n === 0 && r === 0 && i === 0 && a === 0) return;
+	let o = e.get(t) ?? hn(), s = {
+		...o,
+		forceX: o.forceX + n,
+		forceY: o.forceY + r,
+		impulseX: o.impulseX + i,
+		impulseY: o.impulseY + a
+	};
+	Jn(s.forceX, s.forceY, "Accumulated force"), Jn(s.impulseX, s.impulseY, "Accumulated impulse"), e.set(t, s);
+}
+function Jn(e, t, n) {
+	if (!Number.isFinite(e) || !Number.isFinite(t)) throw Error(`${n} must contain finite numbers`);
 }
-var vn = "position-updated", yn = {
+//#endregion
+//#region src/actions/queue-velocity-assignment.ts
+function Yn(e, t, n) {
+	Xn(n), (n.velocityX !== void 0 || n.velocityY !== void 0) && e.set(t, {
+		...e.get(t) ?? hn(),
+		...n
+	});
+}
+function Xn(e) {
+	if (e.velocityX !== void 0 && !Number.isFinite(e.velocityX) || e.velocityY !== void 0 && !Number.isFinite(e.velocityY)) throw Error("Velocity assignment must contain finite numbers");
+}
+//#endregion
+//#region src/systems/physics-update.ts
+var Zn = {
 	x: 0,
 	y: 0
 };
-function bn(e = {}) {
+function Qn(e = {}) {
 	let { onCollision: t, optional: r = [], group: i, stopVelocityOnContact: a = !1 } = e, o, s, c = /* @__PURE__ */ new Map(), l = Object.assign((e, r, c, l, u) => {
 		if (c.entity?.[n] === 1) return;
-		if (c.body !== void 0 && Ce(c.body)) {
+		if (c.body !== void 0 && je(c.body)) {
 			u.entityDied(r);
 			return;
 		}
-		let d = i ? Sn(c, i) : 0;
+		let d = i ? er(c, i) : 0;
 		if (i && e.skipGroup === d) return;
 		let f = {
 			entityId: r,
 			components: c
 		}, p = c.interpolation, m = e.elapsedTime / 1e3;
-		Ht(e, r, c.velocity, c.dynamics);
+		Fn(e, r, c.velocity, c.dynamics);
 		let h = c.velocity[0] * m, g = c.velocity[1] * m;
-		Dn(p, c.transform, e);
+		ar(p, c.transform, e);
 		let _ = i ? s?.get(d) : o;
 		if (!_) {
-			kn(r, c.transform, h, g, u, e.reportMoves), _n(e, r, c), On(p, e.tick);
+			sr(r, c.transform, h, g, u, e.reportMoves), Q(e, r, c), or(p, e.tick);
 			return;
 		}
 		let v = c.bounciness !== void 0, y = _.resolveMove(f, h, g, !v);
-		if (kn(r, c.transform, y.moveX, y.moveY, u, e.reportMoves), _n(e, r, c), On(p, e.tick), _.hasBounciness || a || t) {
+		if (sr(r, c.transform, y.moveX, y.moveY, u, e.reportMoves), Q(e, r, c), or(p, e.tick), _.hasBounciness || a || t) {
 			_.forEachOverlapping(f, (n) => {
-				_.claimContact(r, n.entityId) && Cn(e, _, f, n, l, u, y.moveX, y.moveY, a, t);
+				_.claimContact(r, n.entityId) && tr(e, _, f, n, l, u, y.moveX, y.moveY, a, t);
 			}, y.moveX, y.moveY);
-			for (let n of y.blocking) _.claimContact(r, n.entityId) && Cn(e, _, f, n, l, u, y.moveX, y.moveY, a, t);
+			for (let n of y.blocking) _.claimContact(r, n.entityId) && tr(e, _, f, n, l, u, y.moveX, y.moveY, a, t);
 		}
 	}, { physics: {
 		collision: !0,
@@ -1303,60 +1425,60 @@ function bn(e = {}) {
 		group: i
 	} });
 	return l.preRun = (e, t, n) => {
-		xn(e, c), e.dieAtImpact = (t, n) => {
-			Tn(e, i ? s?.get(Sn(t.components, i)) : o, t, n);
+		$n(e, c), e.dieAtImpact = (t, n) => {
+			rr(e, i ? s?.get(er(t.components, i)) : o, t, n);
 		};
 		let r = e.elapsedTime / 1e3, a = n.collidable ?? [];
 		if (!i) {
-			o = new en(a, r, e.dynamicsCommands);
+			o = new Sn(a, r, e.dynamicsCommands);
 			return;
 		}
 		let l = /* @__PURE__ */ new Map();
 		for (let t of a) {
-			let n = Sn(t.components, i);
+			let n = er(t.components, i);
 			if (e.skipGroup === n) continue;
 			let r = l.get(n);
 			r || (r = [], l.set(n, r)), r.push(t);
 		}
 		s = /* @__PURE__ */ new Map();
-		for (let [t, n] of l) s.set(t, new en(n, r, e.dynamicsCommands));
+		for (let [t, n] of l) s.set(t, new Sn(n, r, e.dynamicsCommands));
 	}, l;
 }
-function xn(e, t) {
+function $n(e, t) {
 	let n = e, r = e.commandQueueId ?? 0, i = t.get(r);
-	i && (e.dynamicsCommands = Vt(i, e.dynamicsCommands), t.delete(r));
+	i && (e.dynamicsCommands = Gn(i, e.dynamicsCommands), t.delete(r));
 	let a = () => {
 		let e = t.get(r);
 		return e || (e = /* @__PURE__ */ new Map(), t.set(r, e)), e;
 	};
 	n.queueForce = (e, t, n) => {
-		zt(a(), e, t, n, 0, 0);
+		qn(a(), e, t, n, 0, 0);
 	}, n.queueImpulse = (e, t, n) => {
-		zt(a(), e, 0, 0, t, n);
+		qn(a(), e, 0, 0, t, n);
 	}, n.queueVelocity = (e, t) => {
-		Bt(a(), e, t);
+		Yn(a(), e, t);
 	};
 }
-function Sn(e, t) {
+function er(e, t) {
 	let n = e[t.component];
 	return n ? n[t.index] : 0;
 }
-function Cn(e, t, n, r, i, a, o, s, c, l) {
-	if (ln(n, r, c), !l) return;
-	let u = Y(n.components), d = Y(r.components);
-	yn.x = 0, yn.y = 0, t.contactNormal(n, r, o, s, yn), l(e, n, r, i, a, {
-		normalX: yn.x,
-		normalY: yn.y
-	}), wn(e, n.entityId, n.components, u), wn(e, r.entityId, r.components, d);
+function tr(e, t, n, r, i, a, o, s, c, l) {
+	if (Ln(n, r, c), !l) return;
+	let u = J(n.components), d = J(r.components);
+	Zn.x = 0, Zn.y = 0, t.contactNormal(n, r, o, s, Zn), l(e, n, r, i, a, {
+		normalX: Zn.x,
+		normalY: Zn.y
+	}), nr(e, n.entityId, n.components, u), nr(e, r.entityId, r.components, d);
 }
-function wn(e, t, n, r) {
-	let i = Y(n);
-	(i.minX !== r.minX || i.minY !== r.minY || i.maxX !== r.maxX || i.maxY !== r.maxY) && _n(e, t, n);
+function nr(e, t, n, r) {
+	let i = J(n);
+	(i.minX !== r.minX || i.minY !== r.minY || i.maxX !== r.maxX || i.maxY !== r.maxY) && Q(e, t, n);
 }
-function Tn(e, t, n, r) {
+function rr(e, t, n, r) {
 	let i = n.components.body;
-	if (!i || Ce(i)) return;
-	we(i);
+	if (!i || je(i)) return;
+	Me(i);
 	let a = n.components.transform, o = n.components.velocity, s = r.components.transform, c = r.components.body;
 	if (!t || !a || !o || !s || !c) return;
 	let l = e.elapsedTime / 1e3, u = o[0] * l, d = o[1] * l;
@@ -1373,50 +1495,50 @@ function Tn(e, t, n, r) {
 	} }, u, d);
 	a[0] = f.x, a[1] = f.y;
 }
-function En(e, t, n, r, i) {
+function ir(e, t, n, r, i) {
 	let a = e.elapsedTime / 1e3, o = n.interpolation;
-	Ht(e, t, n.velocity, n.dynamics), Dn(o, n.transform, e), kn(t, n.transform, n.velocity[0] * a, n.velocity[1] * a, i, e.reportMoves), _n(e, t, n), On(o, e.tick);
+	Fn(e, t, n.velocity, n.dynamics), ar(o, n.transform, e), sr(t, n.transform, n.velocity[0] * a, n.velocity[1] * a, i, e.reportMoves), Q(e, t, n), or(o, e.tick);
 }
-function Dn(e, t, n) {
+function ar(e, t, n) {
 	e && (a(e, 16, NaN), e[12] = t[0], e[13] = t[1], e[14] = e[3], e[15] = e[5], a(e, 16, i(e, 4)), a(e, 4, NaN), e[11] = n.interpolationChannel ?? 0, e[3] = n.elapsedTime, e[5] += n.elapsedTime);
 }
-function On(e, t) {
+function or(e, t) {
 	e && a(e, 4, t);
 }
-function kn(e, t, n, r, i, a) {
-	(n !== 0 || r !== 0) && (n !== 0 && c(t, 0, n, Infinity), r !== 0 && c(t, 1, r, Infinity), a !== !1 && i.emitSystemEvent(vn, e));
+function sr(e, t, n, r, i, a) {
+	(n !== 0 || r !== 0) && (n !== 0 && c(t, 0, n, Infinity), r !== 0 && c(t, 1, r, Infinity), a !== !1 && i.emitSystemEvent(l, e));
 }
 //#endregion
 //#region src/systems/interpolation-channels.ts
-var An = /* @__PURE__ */ new WeakMap();
-function jn(e, t) {
-	let n = An.get(e);
-	return n || (n = [void 0], An.set(e, n)), n.push(t), n.length - 1;
+var cr = /* @__PURE__ */ new WeakMap();
+function lr(e, t) {
+	let n = cr.get(e);
+	return n || (n = [void 0], cr.set(e, n)), n.push(t), n.length - 1;
 }
-function Mn(e, t) {
-	let n = An.get(e);
+function ur(e, t) {
+	let n = cr.get(e);
 	n && t > 0 && t < n.length && (n[t] = void 0);
 }
-function Nn(e) {
-	let t = An.get(e);
+function dr(e) {
+	let t = cr.get(e);
 	if (t) return t.map((e) => e ? e.committedTick : NaN);
 }
 //#endregion
 //#region src/systems/physics-system.ts
-var Pn = 50, Fn = 1, In = class extends r {
+var fr = 1, pr = class extends r {
 	spatialWorld;
 	pendingDynamicsCommands = /* @__PURE__ */ new Map();
-	commandQueueId = Fn++;
+	commandQueueId = fr++;
 	tick = 0;
 	interpolationChannel;
 	reportMoves;
 	skipGroup;
 	constructor(e, t = {}) {
-		let n = t.updateFunction ?? En, r = t.optional ?? n.physics?.optional ?? [], i = t.collision ?? n.physics?.collision ?? !1, a = n === En || n.physics?.dynamics === !0, o = n.physics?.group, s = [];
+		let n = t.updateFunction ?? ir, r = t.optional ?? n.physics?.optional ?? [], i = t.collision ?? n.physics?.collision ?? !1, a = n === ir || n.physics?.dynamics === !0, o = n.physics?.group, s = [];
 		i && !r.includes("body") && s.push("body"), i && !r.includes("bounciness") && s.push("bounciness"), i && !r.includes("polygon") && s.push("polygon"), r.includes("interpolation") || s.push("interpolation"), a && !r.includes("dynamics") && s.push("dynamics"), i && s.push("entity"), o && !r.includes(o.component) && s.push(o.component);
 		let c = s.length ? [...s, ...r] : r, l = r.includes("bounciness") ? [...r] : ["bounciness", ...r];
 		l.includes("polygon") || l.push("polygon"), a && !l.includes("dynamics") && l.push("dynamics"), o && !l.includes(o.component) && l.push(o.component);
-		let u = i ? { [Zt]: {
+		let d = i ? { [u]: {
 			required: ["transform", "body"],
 			optional: [
 				"velocity",
@@ -1424,34 +1546,34 @@ var Pn = 50, Fn = 1, In = class extends r {
 				...l
 			],
 			filter: t.scope
-		} } : void 0, d = u || t.queries ? {
-			...u,
+		} } : void 0, f = d || t.queries ? {
+			...d,
 			...t.queries
-		} : void 0, f = Ln(t.scope, t.filter);
+		} : void 0, p = mr(t.scope, t.filter);
 		super(e, {
 			name: t.name ?? "PhysicsSystem",
 			deltaBetweenRuns: t.deltaBetweenRuns ?? 50,
 			firstRun: t.firstRun,
 			required: ["transform", "velocity"],
 			optional: c,
-			filter: f,
+			filter: p,
 			updateFunction: n,
-			queries: d,
+			queries: f,
 			forceMainThread: t.forceMainThread ?? !t.getWorker,
 			getWorker: t.getWorker ?? (() => {
 				throw Error("PhysicsSystem cannot start a worker: no getWorker was supplied");
 			})
-		}), this.spatialWorld = e, this.reportMoves = t.reportMoves, this.skipGroup = t.skipGroup, this.interpolationChannel = jn(e, this);
+		}), this.spatialWorld = e, this.reportMoves = t.reportMoves, this.skipGroup = t.skipGroup, this.interpolationChannel = lr(e, this);
 	}
 	get committedTick() {
 		return this.isCurrentlyRunning() ? this.tick - 1 : this.tick;
 	}
 	destroy() {
-		Mn(this.world, this.interpolationChannel), super.destroy();
+		ur(this.world, this.interpolationChannel), super.destroy();
 	}
 	startInterpolation(e) {
 		let t = this.deltaBetweenRuns;
-		t <= 0 || et(e, {
+		t <= 0 || Pn(e, {
 			stepMs: t,
 			stepFraction: this.currentDelta / t,
 			tick: this.tick
@@ -1465,14 +1587,14 @@ var Pn = 50, Fn = 1, In = class extends r {
 	}
 	queueVelocity(e, t) {
 		let n = typeof e == "number" ? e : e.eid;
-		Bt(this.pendingDynamicsCommands, n, t);
+		Yn(this.pendingDynamicsCommands, n, t);
 	}
 	addDataToWorld(e) {
-		e.tick = ++this.tick, e.interpolationChannel = this.interpolationChannel, St(this.spatialWorld, e), e.reportMoves = this.reportMoves ?? this.listenerCount("position-updated") > 0, e.skipGroup = this.skipGroup, e.commandQueueId = this.commandQueueId, e.dynamicsCommands = this.snapshotDynamicsCommands();
+		e.tick = ++this.tick, e.interpolationChannel = this.interpolationChannel, Mn(this.spatialWorld, e), e.reportMoves = this.reportMoves ?? this.listenerCount("position-updated") > 0, e.skipGroup = this.skipGroup, e.commandQueueId = this.commandQueueId, e.dynamicsCommands = this.snapshotDynamicsCommands();
 	}
 	queueDynamics(e, t, n, r, i) {
 		let a = typeof e == "number" ? e : e.eid;
-		zt(this.pendingDynamicsCommands, a, t, n, r, i);
+		qn(this.pendingDynamicsCommands, a, t, n, r, i);
 	}
 	snapshotDynamicsCommands() {
 		if (this.pendingDynamicsCommands.size === 0) return;
@@ -1488,18 +1610,632 @@ var Pn = 50, Fn = 1, In = class extends r {
 		return n;
 	}
 };
-function Ln(e, t) {
+function mr(e, t) {
 	return e ? t ? (n) => e(n) && t(n) : e : t;
 }
 //#endregion
-//#region src/systems/interpolation-update.ts
-var Rn = 1.5, zn = .5, Bn = (e, t, n) => {
-	let r = n.interpolation, a = n.transform, o = i(r, 4), s = r[3], c = r[5], l = a[0], u = a[1], d = i(r, 4), f = o === d, p = e.committedTicks?.[r[11]];
-	if (p !== void 0 && !Number.isNaN(p) && !(f && d <= p)) {
+//#region src/pathfinding/nav-grid.ts
+var hr = 0, gr = class e {
+	tilesWide;
+	tilesHigh;
+	cellSize;
+	blockers;
+	speeds;
+	fastestSpeed = 1;
+	regions;
+	regionsDirty = !0;
+	constructor(e, t, n) {
+		if (!Number.isInteger(e) || !Number.isInteger(t) || e <= 0 || t <= 0) throw Error(`NavGrid needs a positive whole number of tiles, got ${e}x${t}`);
+		if (!(n > 0)) throw Error(`NavGrid needs a positive cell size, got ${n}`);
+		this.tilesWide = e, this.tilesHigh = t, this.cellSize = n, this.blockers = new Uint16Array(e * t), this.speeds = new Float32Array(e * t).fill(1), this.regions = new Int32Array(e * t);
+	}
+	clone() {
+		let t = new e(this.tilesWide, this.tilesHigh, this.cellSize);
+		return t.blockers.set(this.blockers), t.speeds.set(this.speeds), t.fastestSpeed = this.fastestSpeed, t;
+	}
+	get tileCount() {
+		return this.tilesWide * this.tilesHigh;
+	}
+	get maxSpeed() {
+		return this.fastestSpeed;
+	}
+	inBounds(e, t) {
+		return e >= 0 && t >= 0 && e < this.tilesWide && t < this.tilesHigh;
+	}
+	index(e, t) {
+		return t * this.tilesWide + e;
+	}
+	tileOf(e) {
+		return Math.floor(e / this.cellSize);
+	}
+	tileCenter(e) {
+		return (e + .5) * this.cellSize;
+	}
+	isBlocked(e, t) {
+		return !this.inBounds(e, t) || this.blockers[this.index(e, t)] > 0;
+	}
+	isAreaClear(e, t, n, r) {
+		if (!this.inBounds(e, t) || !this.inBounds(e + n - 1, t + r - 1)) return !1;
+		for (let i = t; i < t + r; i++) for (let t = e; t < e + n; t++) if (this.blockers[this.index(t, i)] > 0) return !1;
+		return !0;
+	}
+	blockerCount(e, t) {
+		return this.inBounds(e, t) ? this.blockers[this.index(e, t)] : 0;
+	}
+	tilesIn(e) {
+		return !(e.maxX > e.minX) || !(e.maxY > e.minY) ? {
+			fromX: 0,
+			fromY: 0,
+			toX: -1,
+			toY: -1
+		} : {
+			fromX: Math.max(0, Math.floor(e.minX / this.cellSize)),
+			fromY: Math.max(0, Math.floor(e.minY / this.cellSize)),
+			toX: Math.min(this.tilesWide - 1, Math.ceil(e.maxX / this.cellSize) - 1),
+			toY: Math.min(this.tilesHigh - 1, Math.ceil(e.maxY / this.cellSize) - 1)
+		};
+	}
+	addBlocker(e) {
+		let t = this.tilesIn(e);
+		for (let e = t.fromY; e <= t.toY; e++) for (let n = t.fromX; n <= t.toX; n++) {
+			let t = this.index(n, e);
+			this.blockers[t] < 65535 && this.blockers[t]++;
+		}
+		this.regionsDirty = !0;
+	}
+	removeBlocker(e) {
+		let t = this.tilesIn(e);
+		for (let e = t.fromY; e <= t.toY; e++) for (let n = t.fromX; n <= t.toX; n++) {
+			let t = this.index(n, e);
+			this.blockers[t] > 0 && this.blockers[t]--;
+		}
+		this.regionsDirty = !0;
+	}
+	setTerrainSpeed(e, t, n) {
+		if (!(n > 0) || !Number.isFinite(n)) throw Error(`Terrain speed must be a positive finite number, got ${n}`);
+		this.inBounds(e, t) && (this.speeds[this.index(e, t)] = n, this.fastestSpeed = Math.max(this.fastestSpeed, n));
+	}
+	terrainSpeed(e, t) {
+		return this.inBounds(e, t) ? this.speeds[this.index(e, t)] : 1;
+	}
+	cost(e, t) {
+		return this.cellSize / this.speeds[this.index(e, t)];
+	}
+	region(e, t) {
+		return this.inBounds(e, t) ? (this.regionsDirty && this.rebuildRegions(), this.regions[this.index(e, t)]) : hr;
+	}
+	rebuildRegions() {
+		let e = this.regions;
+		e.fill(hr);
+		let t = new Int32Array(this.tileCount), n = hr;
+		for (let r = 0; r < e.length; r++) {
+			if (e[r] !== hr || this.blockers[r] > 0) continue;
+			n++, e[r] = n;
+			let i = 0, a = 0;
+			for (t[a++] = r; i < a;) {
+				let e = t[i++], r = e % this.tilesWide, o = (e - r) / this.tilesWide;
+				a = this.flood(r - 1, o, n, t, a), a = this.flood(r + 1, o, n, t, a), a = this.flood(r, o - 1, n, t, a), a = this.flood(r, o + 1, n, t, a);
+			}
+		}
+		this.regionsDirty = !1;
+	}
+	flood(e, t, n, r, i) {
+		if (!this.inBounds(e, t)) return i;
+		let a = this.index(e, t);
+		return this.regions[a] !== hr || this.blockers[a] > 0 ? i : (this.regions[a] = n, r[i] = a, i + 1);
+	}
+}, _r = class {
+	ids;
+	primary;
+	secondary;
+	count = 0;
+	constructor(e = 64) {
+		this.ids = new Int32Array(e), this.primary = new Float64Array(e), this.secondary = new Float64Array(e);
+	}
+	get size() {
+		return this.count;
+	}
+	clear() {
+		this.count = 0;
+	}
+	push(e, t, n = 0) {
+		this.count === this.ids.length && this.grow();
+		let r = this.count++;
+		for (; r > 0;) {
+			let e = r - 1 >> 1;
+			if (!this.less(t, n, this.primary[e], this.secondary[e])) break;
+			this.set(r, this.ids[e], this.primary[e], this.secondary[e]), r = e;
+		}
+		this.set(r, e, t, n);
+	}
+	pop() {
+		if (this.count === 0) return -1;
+		let e = this.ids[0], t = --this.count;
+		if (t > 0) {
+			let e = this.ids[t], n = this.primary[t], r = this.secondary[t], i = 0;
+			for (;;) {
+				let e = i * 2 + 1;
+				if (e >= t) break;
+				let a = e + 1, o = a < t && this.less(this.primary[a], this.secondary[a], this.primary[e], this.secondary[e]) ? a : e;
+				if (!this.less(this.primary[o], this.secondary[o], n, r)) break;
+				this.set(i, this.ids[o], this.primary[o], this.secondary[o]), i = o;
+			}
+			this.set(i, e, n, r);
+		}
+		return e;
+	}
+	less(e, t, n, r) {
+		return e < n || e === n && t < r;
+	}
+	set(e, t, n, r) {
+		this.ids[e] = t, this.primary[e] = n, this.secondary[e] = r;
+	}
+	grow() {
+		let e = this.ids.length * 2, t = new Int32Array(e), n = new Float64Array(e), r = new Float64Array(e);
+		t.set(this.ids), n.set(this.primary), r.set(this.secondary), this.ids = t, this.primary = n, this.secondary = r;
+	}
+};
+//#endregion
+//#region src/pathfinding/line-of-sight.ts
+function vr(e, t, n, r, i, a, o) {
+	let s = e.cellSize, c = r - t, l = i - n, u = o + s / 2, d = Math.floor((Math.min(n, i) - o) / s), f = Math.ceil((Math.max(n, i) + o) / s) - 1, p = 0;
+	for (let r = d; r <= f; r++) {
+		let i = (r + .5) * s, o, d;
+		if (l === 0) {
+			if (Math.abs(n - i) >= u) continue;
+			o = -Infinity, d = Infinity;
+		} else {
+			let e = (i - u - n) / l, t = (i + u - n) / l;
+			o = Math.min(e, t), d = Math.max(e, t);
+		}
+		let f = Math.max(o, 0), m = Math.min(d, 1);
+		if (f > m || f === m && !(o < f && m < d)) continue;
+		let h = t + c * f, g = t + c * m, _ = Math.floor((Math.min(h, g) - a) / s), v = Math.ceil((Math.max(h, g) + a) / s) - 1;
+		for (let t = _; t <= v; t++) {
+			if (e.isBlocked(t, r)) return Infinity;
+			p = Math.max(p, 1 / e.terrainSpeed(t, r));
+		}
+	}
+	return p;
+}
+//#endregion
+//#region src/pathfinding/smooth-path.ts
+var yr = 24;
+function br(e, t, n, r, i) {
+	let a = Cr(t);
+	if (a.length <= 2) return a;
+	let o = new Float64Array(a.length);
+	for (let t = 1; t < a.length; t++) o[t] = o[t - 1] + xr(e, a[t - 1], a[t], n, r);
+	let s = [0];
+	for (let e = 1; e < a.length - 1; e++) Sr(a[e - 1], a[e], a[e + 1]) || s.push(e);
+	s.push(a.length - 1);
+	let c = [a[0]], l = 0;
+	for (; l < s.length - 1;) {
+		let t = l + 1, u = Math.min(s.length - 1, l + yr);
+		for (let c = l + 2; c <= u; c++) {
+			let u = a[s[l]], d = a[s[c]], f = vr(e, u.x, u.y, d.x, d.y, n + i, r + i), p = Math.hypot(d.x - u.x, d.y - u.y) * f;
+			Number.isFinite(p) && p <= o[s[c]] - o[s[l]] + 1e-6 && (t = c);
+		}
+		c.push(a[s[t]]), l = t;
+	}
+	return c;
+}
+function xr(e, t, n, r, i) {
+	let a = Math.hypot(n.x - t.x, n.y - t.y), o = vr(e, t.x, t.y, n.x, n.y, r, i);
+	return a * (Number.isFinite(o) ? o : 1 / e.terrainSpeed(e.tileOf(n.x), e.tileOf(n.y)));
+}
+function Sr(e, t, n) {
+	return Math.abs((t.x - e.x) * (n.y - t.y) - (t.y - e.y) * (n.x - t.x)) < 1e-9 && (t.x - e.x) * (n.x - t.x) + (t.y - e.y) * (n.y - t.y) > 0;
+}
+function Cr(e) {
+	let t = [];
+	for (let n of e) {
+		let e = t[t.length - 1];
+		(!e || e.x !== n.x || e.y !== n.y) && t.push(n);
+	}
+	return t;
+}
+//#endregion
+//#region src/pathfinding/grid-a-star.ts
+var wr = 5e4, Tr = 0, Er = 16, Dr = [
+	[-1, 0],
+	[1, 0],
+	[0, -1],
+	[0, 1]
+], Or = [
+	[-1, -1],
+	[1, -1],
+	[-1, 1],
+	[1, 1]
+], kr = class {
+	diagonal;
+	maxIterations;
+	smooth;
+	clearance;
+	relocateRadius;
+	heap = new _r(256);
+	cost = /* @__PURE__ */ new Float64Array();
+	parent = /* @__PURE__ */ new Int32Array();
+	seen = /* @__PURE__ */ new Uint32Array();
+	closed = /* @__PURE__ */ new Uint32Array();
+	stamp = 0;
+	constructor(e = {}) {
+		this.diagonal = e.diagonal ?? !1, this.maxIterations = e.maxIterations ?? wr, this.smooth = e.smooth ?? !0, this.clearance = e.clearance ?? Tr, this.relocateRadius = e.relocateRadius ?? Er;
+	}
+	findPath(e, t) {
+		let n = e.cellSize, r = Math.max(1, Math.ceil(t.agentWidth / n - 1e-9)), i = Math.max(1, Math.ceil(t.agentHeight / n - 1e-9));
+		if (r > e.tilesWide || i > e.tilesHigh) return {
+			status: I.Unreachable,
+			points: [],
+			iterations: 0
+		};
+		let a = (e, t) => ({
+			x: Math.round((e - r * n / 2) / n),
+			y: Math.round((t - i * n / 2) / n)
+		}), o = (t) => ({
+			x: jr(t.x, 0, e.tilesWide - r),
+			y: jr(t.y, 0, e.tilesHigh - i)
+		}), s = (e) => ({
+			x: (e.x + r / 2) * n,
+			y: (e.y + i / 2) * n
+		}), c = this.relocate(e, o(a(t.startX, t.startY)), r, i, t.startX, t.startY, t.goalX, t.goalY), l = a(t.goalX, t.goalY), u = this.relocate(e, o(l), r, i, t.goalX, t.goalY, t.startX, t.startY);
+		if (!c || !u || e.region(c.x, c.y) !== e.region(u.x, u.y)) return {
+			status: I.Unreachable,
+			points: [],
+			iterations: 0
+		};
+		let d = u.x !== l.x || u.y !== l.y, f = this.search(e, c, u, r, i), p = [{
+			x: t.startX,
+			y: t.startY
+		}];
+		for (let t of f.tiles) p.push(s({
+			x: t % e.tilesWide,
+			y: Math.floor(t / e.tilesWide)
+		}));
+		let m = f.status;
+		if (m === I.Found) {
+			let n = s(u);
+			d || !Number.isFinite(vr(e, n.x, n.y, t.goalX, t.goalY, t.agentWidth / 2, t.agentHeight / 2)) ? m = I.Unreachable : p.push({
+				x: t.goalX,
+				y: t.goalY
+			});
+		}
+		let h = t.agentWidth / 2, g = t.agentHeight / 2, _ = this.smooth ? br(e, p, h, g, this.clearance) : Mr(p);
+		return {
+			status: m,
+			points: _.slice(1),
+			iterations: f.iterations
+		};
+	}
+	relocate(e, t, n, r, i, a, o, s) {
+		if (e.isAreaClear(t.x, t.y, n, r)) return t;
+		let c = e.cellSize;
+		for (let l = 1; l <= this.relocateRadius; l++) {
+			let u, d = Infinity, f = Infinity;
+			for (let p = t.y - l; p <= t.y + l; p++) {
+				let m = p === t.y - l || p === t.y + l;
+				for (let h = t.x - l; h <= t.x + l; h += m ? 1 : l * 2) {
+					if (!e.isAreaClear(h, p, n, r)) continue;
+					let t = (h + n / 2) * c, l = (p + r / 2) * c, m = Math.hypot(t - i, l - a), g = Math.hypot(t - o, l - s);
+					(m < d || m === d && g < f) && (u = {
+						x: h,
+						y: p
+					}, d = m, f = g);
+				}
+			}
+			if (u) return u;
+		}
+	}
+	search(e, t, n, r, i) {
+		this.prepare(e.tileCount);
+		let a = this.stamp, { cost: o, parent: s, seen: c, closed: l, heap: u } = this, d = e.tilesWide, f = e.index(t.x, t.y), p = e.index(n.x, n.y), m = e.cellSize / e.maxSpeed, h = (e, t) => {
+			let r = Math.abs(e - n.x), i = Math.abs(t - n.y);
+			return (this.diagonal ? Math.max(r, i) + (Math.SQRT2 - 1) * Math.min(r, i) : r + i) * m;
+		};
+		u.clear(), c[f] = a, o[f] = 0, s[f] = -1, u.push(f, h(t.x, t.y), h(t.x, t.y));
+		let g = f, _ = h(t.x, t.y), v = 0;
+		for (; u.size > 0;) {
+			let t = u.pop();
+			if (l[t] === a) continue;
+			if (t === p) return {
+				status: I.Found,
+				tiles: this.trace(t),
+				iterations: v
+			};
+			if (v >= this.maxIterations) return {
+				status: I.Incomplete,
+				tiles: this.trace(g),
+				iterations: v
+			};
+			l[t] = a, v++;
+			let n = t % d, s = (t - n) / d, c = h(n, s);
+			(c < _ || c === _ && o[t] < o[g]) && (g = t, _ = c);
+			for (let [a, o] of Dr) this.relax(e, t, n + a, s + o, 1, r, i, h);
+			if (this.diagonal) for (let [a, o] of Or) e.isAreaClear(n + a, s, r, i) && e.isAreaClear(n, s + o, r, i) && this.relax(e, t, n + a, s + o, Math.SQRT2, r, i, h);
+		}
+		return {
+			status: I.Unreachable,
+			tiles: this.trace(g),
+			iterations: v
+		};
+	}
+	relax(e, t, n, r, i, a, o, s) {
+		if (!e.isAreaClear(n, r, a, o)) return;
+		let c = e.index(n, r);
+		if (this.closed[c] === this.stamp) return;
+		let l = this.cost[t] + i * Ar(e, n, r, a, o);
+		if (this.seen[c] === this.stamp && l >= this.cost[c]) return;
+		this.seen[c] = this.stamp, this.cost[c] = l, this.parent[c] = t;
+		let u = s(n, r);
+		this.heap.push(c, l + u, u);
+	}
+	trace(e) {
+		let t = 0;
+		for (let n = e; n !== -1; n = this.parent[n]) t++;
+		let n = Array.from({ length: t }, () => 0);
+		for (let r = e, i = t - 1; r !== -1; r = this.parent[r], i--) n[i] = r;
+		return n;
+	}
+	prepare(e) {
+		this.cost.length !== e && (this.cost = new Float64Array(e), this.parent = new Int32Array(e), this.seen = new Uint32Array(e), this.closed = new Uint32Array(e), this.stamp = 0), this.stamp++, this.stamp === 4294967295 && (this.seen.fill(0), this.closed.fill(0), this.stamp = 1);
+	}
+};
+function Ar(e, t, n, r, i) {
+	if (r === 1 && i === 1) return e.cost(t, n);
+	let a = 0;
+	for (let o = n; o < n + i; o++) for (let n = t; n < t + r; n++) a += e.cost(n, o);
+	return a / (r * i);
+}
+function jr(e, t, n) {
+	return Math.min(n, Math.max(t, e));
+}
+function Mr(e) {
+	return e.filter((t, n) => n === 0 || t.x !== e[n - 1].x || t.y !== e[n - 1].y);
+}
+//#endregion
+//#region src/pathfinding/follow-path.ts
+var $ = {
+	Waiting: 0,
+	Waypoint: 1,
+	Goal: 2,
+	Stuck: 3
+};
+function Nr(e, t, n, r, a) {
+	if (Tt(e)) return $.Waiting;
+	let o = e[4], s = e[3];
+	for (; s < o && Math.hypot(L(e, s) - t, kt(e, s) - n) <= r;) s++;
+	if (e[3] = s, s < o) return a.x = L(e, s), a.y = kt(e, s), $.Waypoint;
+	let c = e[2];
+	return c === I.Incomplete ? (wt(e), $.Waiting) : c === I.Found ? (a.x = i(e, 6), a.y = i(e, 7), $.Goal) : $.Stuck;
+}
+//#endregion
+//#region src/pathfinding/path-blockers.ts
+var Pr = "pathBlockers", Fr = "pathGates";
+function Ir(e = {}) {
+	let { gateCategories: t = 0, not: n, filter: r } = e, i = {
+		required: ["transform", "body"],
+		not: n,
+		filter: (e) => {
+			let t = e.components.body;
+			return !!t && t.blocksPath && !t.sensor && (!r || r(e));
+		}
+	};
+	if (!t) return { [Pr]: i };
+	let a = {
+		required: ["transform", "body"],
+		not: n,
+		filter: (e) => {
+			let n = e.components.body;
+			return !!n && !n.blocksPath && !n.sensor && (n.collideCategory & t) !== 0 && (!r || r(e));
+		}
+	};
+	return {
+		[Pr]: i,
+		[Fr]: a
+	};
+}
+function Lr(e, t) {
+	let n = t[0] & 7, r = e[2], i = e[3], a = zr(e[4]), o = H(n, r, i, a), s = U(n, r, i, a), c = e[0], l = e[1];
+	return {
+		minX: c - o,
+		minY: l - s,
+		maxX: c + o,
+		maxY: l + s
+	};
+}
+function Rr(e, t, n) {
+	let r = [...t];
+	for (let t of n.removed) {
+		let n = e.get(t);
+		n && (r.forEach((e) => e.removeBlocker(n)), e.delete(t));
+	}
+	for (let { entityId: t, components: i } of n.added) {
+		let n = e.get(t);
+		n && r.forEach((e) => e.removeBlocker(n));
+		let { transform: a, body: o } = i;
+		if (!(a instanceof Float32Array) || !(o instanceof Uint32Array)) {
+			e.delete(t);
+			continue;
+		}
+		let s = Lr(a, o);
+		r.forEach((e) => e.addBlocker(s)), e.set(t, s);
+	}
+	return n.added.length > 0;
+}
+function zr(e) {
+	let t = Math.round(e / (Math.PI / 2)) * Math.PI / 2;
+	return Math.abs(e - t) < 1e-5 ? t : e;
+}
+//#endregion
+//#region src/pathfinding/navigation-state.ts
+function Br(e, t, n, r = 0) {
+	return {
+		grid: new gr(e, t, n),
+		blockers: /* @__PURE__ */ new Map(),
+		gateCategories: r,
+		gates: /* @__PURE__ */ new Map(),
+		gatedGrids: /* @__PURE__ */ new Map()
+	};
+}
+function Vr(e, t) {
+	let n = t & e.gateCategories;
+	if (!n) return e.grid;
+	let r = e.gatedGrids.get(n);
+	if (!r) {
+		r = e.grid.clone();
+		for (let t of e.gates.values()) t.category & n && r.addBlocker(t.rect);
+		e.gatedGrids.set(n, r);
+	}
+	return r;
+}
+function Hr(e, t) {
+	let n = t & e.gateCategories, r = [...e.blockers.values()];
+	if (n) for (let t of e.gates.values()) t.category & n && r.push(t.rect);
+	return r;
+}
+function Ur(e, t, n, r) {
+	e.grid.setTerrainSpeed(t, n, r);
+	for (let i of e.gatedGrids.values()) i.setTerrainSpeed(t, n, r);
+}
+function Wr(e, t) {
+	return Rr(e.blockers, [e.grid, ...e.gatedGrids.values()], t);
+}
+function Gr(e, t) {
+	for (let n of t.removed) {
+		let t = e.gates.get(n);
+		t && (Kr(e, t.category, (e) => e.removeBlocker(t.rect)), e.gates.delete(n));
+	}
+	for (let { entityId: n, components: r } of t.added) {
+		let t = e.gates.get(n);
+		t && Kr(e, t.category, (e) => e.removeBlocker(t.rect));
+		let { transform: i, body: a } = r;
+		if (!(i instanceof Float32Array) || !(a instanceof Uint32Array)) {
+			e.gates.delete(n);
+			continue;
+		}
+		let o = {
+			rect: Lr(i, a),
+			category: a[1] & e.gateCategories
+		};
+		Kr(e, o.category, (e) => e.addBlocker(o.rect)), e.gates.set(n, o);
+	}
+	return t.added.length > 0;
+}
+function Kr(e, t, n) {
+	for (let [r, i] of e.gatedGrids) r & t && n(i);
+}
+//#endregion
+//#region src/pathfinding/pathfinding-update.ts
+var qr = 16e3;
+function Jr(e = {}) {
+	let t = e.search ?? new kr({ diagonal: !0 }), n = e.iterationBudget ?? 16e3, r = e.gateCategories ?? 0, a = (e, r, a) => {
+		let { navigation: o, transform: s, body: c } = a;
+		if (!o[5]) return;
+		let l = c ? c[2] : 0, u = Vr(e.navigation, l), d = Atomics.load(o, 0);
+		if (d === Atomics.load(o, 1)) {
+			if (!e.blockersAdded || Zr(u, o, s)) return;
+			d = Atomics.add(o, 0, 1) + 1;
+		}
+		if ((e.searchIterations ?? 0) >= (e.iterationBudget ?? n)) return;
+		let f = {
+			startX: s[0],
+			startY: s[1],
+			goalX: i(o, 6),
+			goalY: i(o, 7),
+			agentWidth: s[2],
+			agentHeight: s[3]
+		}, p = Xr(e.navigation, u, l, f);
+		p.forEach((e) => u.removeBlocker(e));
+		let m = t.findPath(u, f);
+		p.forEach((e) => u.addBlocker(e)), e.searchIterations = (e.searchIterations ?? 0) + m.iterations;
+		let h = m.status === I.Found ? m.points.slice(0, -1) : m.points;
+		At(o, m.status === I.Incomplete && h.length === 0 ? I.Unreachable : m.status, h), Atomics.store(o, 1, d);
+	};
+	return a.init = (t, n, i, a) => {
+		let o = Br(n?.tilesWide ?? 1, n?.tilesHigh ?? 1, n?.cellSize ?? 1, r);
+		return Wr(o, {
+			added: a.pathBlockers ?? [],
+			removed: []
+		}), Gr(o, {
+			added: a.pathGates ?? [],
+			removed: []
+		}), {
+			...e.init?.(o, n, a),
+			navigation: o
+		};
+	}, a.queryChanged = (t, n, r, i) => {
+		n === "pathBlockers" ? t.blockersAdded = Wr(t.navigation, r) || !!t.blockersAdded : n === "pathGates" && (t.blockersAdded = Gr(t.navigation, r) || !!t.blockersAdded), e.queryChanged?.(t, n, r, i);
+	}, a.preRun = (t, n, r, i) => {
+		t.searchIterations = 0, e.preRun?.(t, n, r, i);
+	}, Object.assign(a, { pathfinding: { gateCategories: r } });
+}
+var Yr = Jr();
+function Xr(e, t, n, r) {
+	let i = r.agentWidth / 2, a = r.agentHeight / 2, o = {
+		minX: r.startX - i,
+		minY: r.startY - a,
+		maxX: r.startX + i,
+		maxY: r.startY + a
+	}, s = t.tilesIn(o), c = !0;
+	for (let e = s.fromY; e <= s.toY && c; e++) for (let n = s.fromX; n <= s.toX && c; n++) c = t.blockerCount(n, e) === 0;
+	return c ? [] : Hr(e, n).filter((e) => e.minX < o.maxX && e.maxX > o.minX && e.minY < o.maxY && e.maxY > o.minY);
+}
+function Zr(e, t, n) {
+	let r = n[2] / 2, a = n[3] / 2, o = n[0], s = n[1], c = t[4];
+	for (let n = t[3]; n <= c; n++) {
+		let l, u;
+		if (n < c) l = L(t, n), u = kt(t, n);
+		else if (t[2] === I.Found) l = i(t, 6), u = i(t, 7);
+		else break;
+		if (!Number.isFinite(vr(e, o, s, l, u, r, a))) return !1;
+		o = l, s = u;
+	}
+	return !0;
+}
+//#endregion
+//#region src/pathfinding/pathfinding-system.ts
+var Qr = class extends r {
+	iterationBudget;
+	constructor(e, t) {
+		let n = t.updateFunction ?? Jr(), r = t.optional ?? [];
+		super(e, {
+			name: t.name ?? "PathfindingSystem",
+			deltaBetweenRuns: t.deltaBetweenRuns ?? 50,
+			firstRun: t.firstRun,
+			required: ["navigation", "transform"],
+			optional: r.includes("body") ? r : ["body", ...r],
+			queries: {
+				...Ir({
+					...t.blockers,
+					gateCategories: n.pathfinding.gateCategories
+				}),
+				...t.queries
+			},
+			updateFunction: n,
+			getInitData: t.getInitData,
+			forceMainThread: t.forceMainThread ?? !t.getWorker,
+			getWorker: t.getWorker ?? (() => {
+				throw Error("PathfindingSystem cannot start a worker: no getWorker was supplied");
+			})
+		}), this.iterationBudget = t.iterationBudget;
+	}
+	addDataToWorld(e) {
+		e.iterationBudget = this.iterationBudget;
+	}
+	loaded = !1;
+	async init() {
+		await super.init(), this.loaded || await this.finishLoading();
+	}
+	finishLoading() {
+		return this.loaded = !0, super.finishLoading();
+	}
+}, $r = (e, t, n) => {
+	let r = n.interpolation, a = n.transform, o = i(r, 4), s = r[3], c = r[5], l = a[0], u = a[1], d = i(r, 4), m = o === d, h = e.committedTicks?.[r[11]];
+	if (h !== void 0 && !Number.isNaN(h) && !(m && d <= h)) {
 		let e = i(r, 16);
-		s = r[14], c = r[15], l = r[12], u = r[13], d = i(r, 16), f = e === d;
+		s = r[14], c = r[15], l = r[12], u = r[13], d = i(r, 16), m = e === d;
 	}
-	if (f) r[8] = l, r[9] = u, r[10] = s;
+	if (m) r[8] = l, r[9] = u, r[10] = s;
 	else {
 		if (s = r[10], s <= 0 || r[7] <= 0) return;
 		l = r[8], u = r[9], c = r[6], d = r[2];
@@ -1508,27 +2244,27 @@ var Rn = 1.5, zn = .5, Bn = (e, t, n) => {
 		r[2] = d, r[6] = c, r[7] = 0, r[0] = l, r[1] = u;
 		return;
 	}
-	let m = r[7];
+	let g = r[7];
 	if (d !== r[2]) {
 		let e = r[6], t = c >= e ? c - e : s;
-		m += t, r[6] = c, r[2] = d;
+		g += t, r[6] = c, r[2] = d;
 	}
-	if (m <= 0) {
+	if (g <= 0) {
 		r[7] = 0, r[0] = l, r[1] = u;
 		return;
 	}
-	let h = Math.min(Math.max(e.elapsedTime, 0), m), g = s * Rn, _ = m - h;
-	_ > g && (h += Math.min(_ - g, h * zn));
-	let v = h / m, y = r[0], b = r[1];
-	r[0] = y + (l - y) * v, r[1] = b + (u - b) * v, r[7] = m - h;
-}, Vn = class extends r {
+	let _ = Math.min(Math.max(e.elapsedTime, 0), g), v = s * f, y = g - _;
+	y > v && (_ += Math.min(y - v, _ * p));
+	let b = _ / g, x = r[0], S = r[1];
+	r[0] = x + (l - x) * b, r[1] = S + (u - S) * b, r[7] = g - _;
+}, ei = class extends r {
 	constructor(e, t = {}) {
 		super(e, {
 			name: t.name ?? "InterpolationSystem",
 			deltaBetweenRuns: 0,
 			firstRun: t.firstRun,
 			required: ["transform", "interpolation"],
-			updateFunction: Bn,
+			updateFunction: $r,
 			forceMainThread: t.forceMainThread ?? !t.getWorker,
 			getWorker: t.getWorker ?? (() => {
 				throw Error("InterpolationSystem cannot start a worker: no getWorker was supplied");
@@ -1536,10 +2272,10 @@ var Rn = 1.5, zn = .5, Bn = (e, t, n) => {
 		});
 	}
 	addDataToWorld(e) {
-		e.committedTicks = Nn(this.world);
+		e.committedTicks = dr(this.world);
 	}
 };
 //#endregion
-export { be as BODY_BLOCKS_PATH_FLAG, pe as BODY_CATEGORY_INDEX, ve as BODY_CCD_FLAG, ye as BODY_DYING_FLAG, fe as BODY_FLAGS_INDEX, me as BODY_MASK_INDEX, _e as BODY_SENSOR_FLAG, ge as BODY_SHAPE_MASK, he as BODY_SIZE, ke as BOUNCINESS_INDEX, Ae as BOUNCINESS_SIZE, Zt as COLLIDABLE_QUERY, en as CollisionBroadphase, le as DEFAULT_COLLIDE_CATEGORY, ue as DEFAULT_COLLIDE_MASK, Pn as DEFAULT_PHYSICS_STEP_MS, N as DYNAMICS_ACCELERATION_X_INDEX, P as DYNAMICS_ACCELERATION_Y_INDEX, ee as DYNAMICS_INVERSE_MASS_INDEX, F as DYNAMICS_SIZE, We as INTERPOLATION_CHANNEL_INDEX, Ie as INTERPOLATION_DURATION_INDEX, qe as INTERPOLATION_PREVIOUS_DURATION_INDEX, Ye as INTERPOLATION_PREVIOUS_TICK_INDEX, Je as INTERPOLATION_PREVIOUS_TOTAL_DURATION_INDEX, Ge as INTERPOLATION_PREVIOUS_X_INDEX, Ke as INTERPOLATION_PREVIOUS_Y_INDEX, Be as INTERPOLATION_REMAINING_DURATION_INDEX, Xe as INTERPOLATION_SIZE, ze as INTERPOLATION_SYNCED_DURATION_INDEX, Ue as INTERPOLATION_SYNCED_STEP_DURATION_INDEX, Fe as INTERPOLATION_SYNCED_TICK_INDEX, Ve as INTERPOLATION_TARGET_X_INDEX, He as INTERPOLATION_TARGET_Y_INDEX, Le as INTERPOLATION_TICK_INDEX, Re as INTERPOLATION_TOTAL_DURATION_INDEX, Ne as INTERPOLATION_X_INDEX, Pe as INTERPOLATION_Y_INDEX, Vn as InterpolationSystem, l as MAX_POLYGON_VERTICES, f as POLYGON_SIZE, u as POLYGON_VERTEX_COUNT_INDEX, d as POLYGON_VERTICES_INDEX, vn as POSITION_UPDATED_EVENT, wt as PhysicalWorld, In as PhysicsSystem, oe as SHAPE_CAPSULE, ae as SHAPE_CIRCLE, se as SHAPE_POLYGON, ie as SHAPE_RECTANGLE, sn as SpatialIndex, S as TRANSFORM_ANGLE_INDEX, x as TRANSFORM_HEIGHT_INDEX, C as TRANSFORM_SIZE, b as TRANSFORM_WIDTH_INDEX, v as TRANSFORM_X_INDEX, y as TRANSFORM_Y_INDEX, O as VELOCITY_DAMPING_INDEX, k as VELOCITY_SIZE, E as VELOCITY_X_INDEX, D as VELOCITY_Y_INDEX, St as addPhysicalWorldData, Se as blocksPath, Ee as bodyDefinition, L as bodyShape, Me as bouncinessDefinition, mt as boundsHalfHeight, pt as boundsHalfWidth, de as canCollide, H as capsuleCoreAngle, V as capsuleHalfLength, ot as contactNormal, bn as createPhysicsUpdate, te as dynamicsDefinition, Ct as getSpatialMap, Ht as integrateDynamics, Qe as interpolationDefinition, Bn as interpolationUpdate, xe as isContinuous, Ce as isDying, R as isSensor, we as markDying, ht as orientedBoxesOverlap, tt as physicsRegistry, En as physicsUpdate, q as pointSegmentDistanceSquared, Ot as polygonContactNormal, m as polygonDefinition, Dt as polygonShapesOverlap, h as preparePolygon, _t as segmentBoxDistanceSquared, gt as segmentSegmentDistanceSquared, rt as shapeHalfHeight, nt as shapeHalfWidth, W as shapeIsEmpty, U as shapeRadius, it as shapesOverlap, $e as snapEntity, et as startSpawnInterpolation, T as transformDefinition, _n as updateSpatialMap, j as velocityDefinition };
+export { Ee as BODY_BLOCKS_PATH_FLAG, ye as BODY_CATEGORY_INDEX, we as BODY_CCD_FLAG, Te as BODY_DYING_FLAG, ve as BODY_FLAGS_INDEX, be as BODY_MASK_INDEX, Ce as BODY_SENSOR_FLAG, Se as BODY_SHAPE_MASK, xe as BODY_SIZE, Le as BOUNCINESS_INDEX, Re as BOUNCINESS_SIZE, u as COLLIDABLE_QUERY, Sn as CollisionBroadphase, ge as DEFAULT_COLLIDE_CATEGORY, _e as DEFAULT_COLLIDE_MASK, qr as DEFAULT_PATH_SEARCH_ITERATION_BUDGET, d as DEFAULT_PHYSICS_STEP_MS, ie as DYNAMICS_ACCELERATION_X_INDEX, ae as DYNAMICS_ACCELERATION_Y_INDEX, oe as DYNAMICS_INVERSE_MASS_INDEX, se as DYNAMICS_SIZE, $ as FollowStep, kr as GridAStar, Qe as INTERPOLATION_CHANNEL_INDEX, We as INTERPOLATION_DURATION_INDEX, tt as INTERPOLATION_PREVIOUS_DURATION_INDEX, rt as INTERPOLATION_PREVIOUS_TICK_INDEX, nt as INTERPOLATION_PREVIOUS_TOTAL_DURATION_INDEX, $e as INTERPOLATION_PREVIOUS_X_INDEX, et as INTERPOLATION_PREVIOUS_Y_INDEX, Je as INTERPOLATION_REMAINING_DURATION_INDEX, it as INTERPOLATION_SIZE, qe as INTERPOLATION_SYNCED_DURATION_INDEX, Ze as INTERPOLATION_SYNCED_STEP_DURATION_INDEX, Ue as INTERPOLATION_SYNCED_TICK_INDEX, Ye as INTERPOLATION_TARGET_X_INDEX, Xe as INTERPOLATION_TARGET_Y_INDEX, Ge as INTERPOLATION_TICK_INDEX, Ke as INTERPOLATION_TOTAL_DURATION_INDEX, Ve as INTERPOLATION_X_INDEX, He as INTERPOLATION_Y_INDEX, ei as InterpolationSystem, b as MAX_POLYGON_VERTICES, _r as MinHeap, ft as NAVIGATION_ACTIVE_INDEX, pt as NAVIGATION_GOAL_X_INDEX, mt as NAVIGATION_GOAL_Y_INDEX, gt as NAVIGATION_MAX_WAYPOINTS, lt as NAVIGATION_OUTCOME_INDEX, st as NAVIGATION_REQUEST_INDEX, ct as NAVIGATION_RESULT_INDEX, _t as NAVIGATION_SIZE, ht as NAVIGATION_WAYPOINTS_INDEX, dt as NAVIGATION_WAYPOINT_COUNT_INDEX, ut as NAVIGATION_WAYPOINT_INDEX, gr as NavGrid, Pr as PATH_BLOCKERS_QUERY, Fr as PATH_GATES_QUERY, C as POLYGON_SIZE, x as POLYGON_VERTEX_COUNT_INDEX, S as POLYGON_VERTICES_INDEX, l as POSITION_UPDATED_EVENT, I as PathStatus, Qr as PathfindingSystem, $t as PhysicalWorld, pr as PhysicsSystem, me as SHAPE_CAPSULE, pe as SHAPE_CIRCLE, he as SHAPE_POLYGON, fe as SHAPE_RECTANGLE, kn as SpatialIndex, v as TRANSFORM_ANGLE_INDEX, _ as TRANSFORM_HEIGHT_INDEX, y as TRANSFORM_SIZE, g as TRANSFORM_WIDTH_INDEX, m as TRANSFORM_X_INDEX, h as TRANSFORM_Y_INDEX, te as VELOCITY_DAMPING_INDEX, ne as VELOCITY_SIZE, j as VELOCITY_X_INDEX, ee as VELOCITY_Y_INDEX, Mn as addPhysicalWorldData, Wr as applyPathBlockerChanges, Gr as applyPathGateChanges, Rr as applyRectChanges, Lr as blockerRect, Hr as blockingRects, Ae as blocksPath, Pe as bodyDefinition, P as bodyShape, Be as bouncinessDefinition, Gt as boundsHalfHeight, Wt as boundsHalfWidth, Oe as canCollide, V as capsuleCoreAngle, B as capsuleHalfLength, Lt as contactNormal, Br as createNavigationState, Jr as createPathfindingUpdate, Qn as createPhysicsUpdate, le as dynamicsDefinition, Nr as followPath, An as getSpatialMap, Fn as integrateDynamics, ot as interpolationDefinition, $r as interpolationUpdate, ke as isContinuous, je as isDying, Ct as isNavigating, Tt as isPathPending, F as isSensor, Et as isUnreachable, Me as markDying, bt as navigateTo, yt as navigationDefinition, Dt as navigationGoal, Vr as navigationGridFor, Mt as navigationRegistry, Kt as orientedBoxesOverlap, Ir as pathBlockerQueries, Yr as pathfindingUpdate, jt as physicsRegistry, ir as physicsUpdate, K as pointSegmentDistanceSquared, rn as polygonContactNormal, T as polygonDefinition, nn as polygonShapesOverlap, E as preparePolygon, wt as requestPath, Jt as segmentBoxDistanceSquared, qt as segmentSegmentDistanceSquared, jn as setEntityPosition, xt as setNavigationGoal, Ur as setNavigationTerrainSpeed, U as shapeHalfHeight, H as shapeHalfWidth, Pt as shapeIsEmpty, Nt as shapeRadius, Ft as shapesOverlap, br as smoothPath, Nn as snapEntity, Pn as startSpawnInterpolation, St as stopNavigating, vr as sweepCost, A as transformDefinition, Q as updateSpatialMap, M as velocityDefinition, Ot as waypoint, L as waypointX, kt as waypointY, At as writePath };
 
 //# sourceMappingURL=index.js.map