@idleflowgames/anotherecs 0.1.3 → 0.1.4

package/CHANGELOG.md

@@ -1,5 +1,19 @@
 # Changelog
 
+## 0.1.4
+
+- `SpatialHash`: `clear()` is now O(1). Buckets carry a frame stamp and a live
+  prefix count, so a stamp bump retires the whole grid and a periodic sweep
+  reclaims dead buckets. Queries additionally clamp their cell span to an
+  occupied bounding box and a per-column occupied row range, both supersets of
+  the true occupied set, so they only ever skip cells that are provably empty.
+  Szudzik pairing is inlined at its three call sites with its cx-only half
+  hoisted out of the inner loop.
+  Result arrays are unchanged in membership AND in order, so a consumer that
+  relies on iteration order for determinism is unaffected.
+  A whole broadphase frame is 2.32x faster at 50 bodies, 1.90x at 250 and 1.13x
+  at 1000; a 253k-op trace recorded from a real game run replays 48% faster.
+
 ## 0.1.2
 
 - No source changes. Toolchain/deps only: Node 24, pnpm 11.5.0, lock-file

package/dist/index.js

@@ -1218,17 +1218,18 @@ var T = 65536, E = -1, D = class {
 		for (let e = 0; e < this.count; e++) this.sparse[this.entities[e]] = E;
 		this.entities.length = 0, this.data.length = 0, this.count = 0, this.freeList.length = 0, this._added.length = 0, this._removed.length = 0, this._changed.length = 0, this._addedFired = 0, this._removedFired = 0, this._version++;
 	}
-};
-//#endregion
-//#region src/spatial-hash.ts
-function O(e, t) {
-	e.length === 0 ? this.delete(t) : e.length = 0;
-}
-var k = class {
+}, O = 256, k = O - 1, A = 64, j = -2147483648, M = 2147483647, N = class {
 	invCellSize;
 	cells = /* @__PURE__ */ new Map();
 	generation = 0;
 	seen;
+	occMinCX = 0;
+	occMaxCX = -1;
+	occMinCY = 0;
+	occMaxCY = -1;
+	col = new Int32Array(O * 3);
+	frameGen = 1;
+	sweepIn = A;
 	constructor(e = 64, t = T) {
 		if (!(e > 0)) throw Error(`SpatialHash: cellSize must be > 0 (got ${e})`);
 		this.invCellSize = 1 / e, this.seen = new Int32Array(t);
@@ -1237,85 +1238,126 @@ var k = class {
 		return this.generation = this.generation + 1 | 0, this.generation === 0 && (this.generation = 1), this.generation;
 	}
 	clear() {
-		this.cells.forEach(O, this.cells);
+		this.occMinCX = 0, this.occMaxCX = -1, this.occMinCY = 0, this.occMaxCY = -1;
+		let e = this.frameGen + 1;
+		if (e >= M) {
+			this.cells.clear(), this.col.fill(0), this.frameGen = 1, this.sweepIn = A;
+			return;
+		}
+		this.frameGen = e, --this.sweepIn <= 0 && (this.sweepIn = A, this.cells.forEach(this.pruneStale, this));
+	}
+	pruneStale(e, t) {
+		this.frameGen - e.g >= A && this.cells.delete(t);
 	}
 	insert(e, t, n, r) {
-		if (e >= this.seen.length) throw Error(`SpatialHash.insert(): entity id ${e} exceeds maxEntities (${this.seen.length}). Construct the SpatialHash with a maxEntities that matches the consuming World's capacity.`);
-		let i = Math.floor((t - r) * this.invCellSize), a = Math.floor((t + r) * this.invCellSize), o = Math.floor((n - r) * this.invCellSize), s = Math.floor((n + r) * this.invCellSize);
-		for (let t = i; t <= a; t++) for (let n = o; n <= s; n++) {
-			let r = this.hashKey(t, n), i = this.cells.get(r);
-			i || (i = [], this.cells.set(r, i)), i.push(e);
+		let i = this.seen;
+		if (e >= i.length) throw Error(`SpatialHash.insert(): entity id ${e} exceeds maxEntities (${i.length}). Construct the SpatialHash with a maxEntities that matches the consuming World's capacity.`);
+		let a = this.cells, o = this.invCellSize, s = Math.floor((t - r) * o), c = Math.floor((t + r) * o), l = Math.floor((n - r) * o), u = Math.floor((n + r) * o);
+		this.occMaxCX < this.occMinCX ? (this.occMinCX = s, this.occMaxCX = c, this.occMinCY = l, this.occMaxCY = u) : (s < this.occMinCX && (this.occMinCX = s), c > this.occMaxCX && (this.occMaxCX = c), l < this.occMinCY && (this.occMinCY = l), u > this.occMaxCY && (this.occMaxCY = u));
+		let d = this.col, f = this.frameGen, p = l < j ? j : l, m = u > M ? M : u;
+		for (let t = s; t <= c; t++) {
+			let n = (t & k) * 3;
+			d[n] === f ? (p < d[n + 1] && (d[n + 1] = p), m > d[n + 2] && (d[n + 2] = m)) : (d[n] = f, d[n + 1] = p, d[n + 2] = m);
+			let r = t >= 0 ? 2 * t : -2 * t - 1, i = r * r + r;
+			for (let t = l; t <= u; t++) {
+				let n = t >= 0 ? 2 * t : -2 * t - 1, o = r >= n ? i + n : n * n + r, s = a.get(o);
+				s === void 0 ? (s = {
+					e: [],
+					n: 0,
+					g: f
+				}, a.set(o, s)) : s.g !== f && (s.g = f, s.n = 0);
+				let c = s.n, l = s.e;
+				c < l.length ? l[c] = e : l.push(e), s.n = c + 1;
+			}
 		}
 	}
 	query(e, t, n, r) {
 		r.length = 0;
-		let i = this.nextGen(), a = Math.floor((e - n) * this.invCellSize), o = Math.floor((e + n) * this.invCellSize), s = Math.floor((t - n) * this.invCellSize), c = Math.floor((t + n) * this.invCellSize);
-		for (let e = a; e <= o; e++) for (let t = s; t <= c; t++) {
-			let n = this.hashKey(e, t), a = this.cells.get(n);
-			if (a) for (let e = 0; e < a.length; e++) {
-				let t = a[e];
-				this.seen[t] !== i && (this.seen[t] = i, r.push(t));
+		let i = this.nextGen(), a = this.cells, o = this.seen, s = this.invCellSize, c = Math.floor((e - n) * s), l = Math.floor((e + n) * s), u = Math.floor((t - n) * s), d = Math.floor((t + n) * s);
+		c < this.occMinCX && (c = this.occMinCX), l > this.occMaxCX && (l = this.occMaxCX), u < this.occMinCY && (u = this.occMinCY), d > this.occMaxCY && (d = this.occMaxCY);
+		let f = this.col, p = this.frameGen;
+		for (let e = c; e <= l; e++) {
+			let t = (e & k) * 3;
+			if (f[t] !== p) continue;
+			let n = u, s = d;
+			n < f[t + 1] && (n = f[t + 1]), s > f[t + 2] && (s = f[t + 2]);
+			let c = e >= 0 ? 2 * e : -2 * e - 1, l = c * c + c;
+			for (let e = n; e <= s; e++) {
+				let t = e >= 0 ? 2 * e : -2 * e - 1, n = a.get(c >= t ? l + t : t * t + c);
+				if (n === void 0 || n.g !== p) continue;
+				let s = n.e;
+				for (let e = 0, t = n.n; e < t; e++) {
+					let t = s[e];
+					o[t] !== i && (o[t] = i, r.push(t));
+				}
 			}
 		}
 	}
 	queryRadius(e, t, n, r, i, a) {
 		a.length = 0;
-		let o = this.nextGen(), s = Math.floor((e - n) * this.invCellSize), c = Math.floor((e + n) * this.invCellSize), l = Math.floor((t - n) * this.invCellSize), u = Math.floor((t + n) * this.invCellSize);
-		for (let d = s; d <= c; d++) for (let s = l; s <= u; s++) {
-			let c = this.hashKey(d, s), l = this.cells.get(c);
-			if (l) for (let s = 0; s < l.length; s++) {
-				let c = l[s];
-				if (this.seen[c] === o) continue;
-				this.seen[c] = o;
-				let u = r(c);
-				if (!u) continue;
-				let d = i(c), f = u.x - e, p = u.y - t, m = f * f + p * p, h = n + d;
-				m <= h * h && a.push(c);
+		let o = this.nextGen(), s = this.cells, c = this.seen, l = this.invCellSize, u = Math.floor((e - n) * l), d = Math.floor((e + n) * l), f = Math.floor((t - n) * l), p = Math.floor((t + n) * l);
+		u < this.occMinCX && (u = this.occMinCX), d > this.occMaxCX && (d = this.occMaxCX), f < this.occMinCY && (f = this.occMinCY), p > this.occMaxCY && (p = this.occMaxCY);
+		let m = this.col, h = this.frameGen;
+		for (let l = u; l <= d; l++) {
+			let u = (l & k) * 3;
+			if (m[u] !== h) continue;
+			let d = f, g = p;
+			d < m[u + 1] && (d = m[u + 1]), g > m[u + 2] && (g = m[u + 2]);
+			let _ = l >= 0 ? 2 * l : -2 * l - 1, v = _ * _ + _;
+			for (let l = d; l <= g; l++) {
+				let u = l >= 0 ? 2 * l : -2 * l - 1, d = s.get(_ >= u ? v + u : u * u + _);
+				if (d === void 0 || d.g !== h) continue;
+				let f = d.e;
+				for (let s = 0, l = d.n; s < l; s++) {
+					let l = f[s];
+					if (c[l] === o) continue;
+					c[l] = o;
+					let u = r(l);
+					if (!u) continue;
+					let d = i(l), p = u.x - e, m = u.y - t, h = p * p + m * m, g = n + d;
+					h <= g * g && a.push(l);
+				}
 			}
 		}
 	}
-	hashKey(e, t) {
-		let n = e >= 0 ? 2 * e : -2 * e - 1, r = t >= 0 ? 2 * t : -2 * t - 1;
-		return n >= r ? n * n + n + r : r * r + n;
-	}
-}, A = 0, j = 0, M = 0, N = 0, P = 0, F = !0;
-function I(e, t, n) {
+}, P = 0, F = 0, I = 0, L = 0, R = 0, z = !0;
+function B(e, t, n) {
 	return {
-		id: j++,
+		id: F++,
 		name: e,
 		create: t,
 		reset: n
 	};
 }
-function L(e) {
+function V(e) {
 	return {
-		id: j++,
+		id: F++,
 		name: e,
 		tag: !0
 	};
 }
-function R(e) {
+function H(e) {
 	return {
-		id: M++,
+		id: I++,
 		name: e
 	};
 }
-function z(e) {
+function U(e) {
 	return {
-		id: N++,
+		id: L++,
 		name: e
 	};
 }
-function B(e, t) {
+function W(e, t) {
 	return {
-		id: P++,
+		id: R++,
 		name: e,
 		init: t
 	};
 }
 //#endregion
 //#region src/world.ts
-var V = class {
+var G = class {
 	nextId = 1;
 	maxEntities;
 	alive = /* @__PURE__ */ new Set();
@@ -1527,13 +1569,13 @@ var V = class {
 		t.isTracking() || (t.enableTracking(), this.trackedStores.push(t));
 	}
 	added(e) {
-		return this.stores[e.id]?.iterAdded() ?? U;
+		return this.stores[e.id]?.iterAdded() ?? q;
 	}
 	removed(e) {
-		return this.stores[e.id]?.iterRemoved() ?? U;
+		return this.stores[e.id]?.iterRemoved() ?? q;
 	}
 	changed(e) {
-		return this.stores[e.id]?.iterChanged() ?? U;
+		return this.stores[e.id]?.iterChanged() ?? q;
 	}
 	markChanged(e, t) {
 		this.stores[t.id]?.markChanged(e);
@@ -1649,9 +1691,9 @@ var V = class {
 		return this.backrefsEnabled;
 	}
 	backrefs(e) {
-		if (!this.backrefsEnabled || this.backrefEdges === null) return H;
+		if (!this.backrefsEnabled || this.backrefEdges === null) return K;
 		let t = this.backrefEdges.get(e);
-		if (t === void 0 || t.length === 0) return H;
+		if (t === void 0 || t.length === 0) return K;
 		let n = !0;
 		for (let e = 0; e < t.length; e++) if (!this.alive.has(t[e])) {
 			n = !1;
@@ -1660,7 +1702,7 @@ var V = class {
 		if (n) return t;
 		let r = [];
 		for (let e = 0; e < t.length; e++) this.alive.has(t[e]) && r.push(t[e]);
-		return r.length === 0 ? H : r;
+		return r.length === 0 ? K : r;
 	}
 	unref(e, t) {
 		if (!this.backrefsEnabled || this.backrefEdges === null) return;
@@ -1671,8 +1713,8 @@ var V = class {
 		let a = this.holderToTargets?.get(t);
 		a !== void 0 && (a.delete(n), a.size === 0 && this.holderToTargets?.delete(t));
 	}
-}, H = Object.freeze([]), U = [];
+}, K = Object.freeze([]), q = [];
 //#endregion
-export { e as Bitmask, t as CommandBuffer, D as ComponentStore, T as DEFAULT_MAX_ENTITIES, n as EventBus, i as IncrementalQuery, a as MigrationError, o as MigrationRegistry, A as NULL_REF, d as QueryEngine, f as Schedule, x as Serializer, k as SpatialHash, F as TAG_VALUE, V as World, l as any, I as defineComponent, z as defineEvent, B as defineLocal, R as defineResource, L as defineTag, w as jsonCodec, c as maybe, s as without };
+export { e as Bitmask, t as CommandBuffer, D as ComponentStore, T as DEFAULT_MAX_ENTITIES, n as EventBus, i as IncrementalQuery, a as MigrationError, o as MigrationRegistry, P as NULL_REF, d as QueryEngine, f as Schedule, x as Serializer, N as SpatialHash, z as TAG_VALUE, G as World, l as any, B as defineComponent, U as defineEvent, W as defineLocal, H as defineResource, V as defineTag, w as jsonCodec, c as maybe, s as without };
 
 //# sourceMappingURL=index.js.map