@daneren2005/shared-memory-objects 1.6.2 → 1.6.3

package/dist/spatial/shared-spatial-map.js

@@ -1,15 +1,15 @@
-import { getPointer as e, loadRawPointer as t, storeRawPointer as n } from "../utils/pointer.js";
-import r from "../allocated-memory.js";
-import { readLock as i, readUnlock as a, writeLock as o, writeUnlock as s } from "../lock/read-write-lock.js";
-import { ARRAY_TYPE as c, getArrayTypeCode as l, getByteMultipler as u, makeArrayView as d } from "../utils/array-type.js";
-import { lock as f, unlock as p } from "../lock/simple-lock.js";
-import m from "../shared-map.js";
-import h from "../shared-stack.js";
-import g from "../shared-pool.js";
+import e from "../allocated-memory.js";
+import t from "../shared-pool.js";
+import n from "../shared-map.js";
+import r from "../shared-stack.js";
+import { lock as i, unlock as a } from "../lock/simple-lock.js";
+import { readLock as o, readUnlock as s, writeLock as c, writeUnlock as l } from "../lock/read-write-lock.js";
+import { getPointer as u, loadRawPointer as d, storeRawPointer as f } from "../utils/pointer.js";
+import { ARRAY_TYPE as p, getArrayTypeCode as m, getByteMultipler as h, makeArrayView as g } from "../utils/array-type.js";
 import { addCandidate as _, candidateLimit as v, distanceSquaredToRect as y } from "./spatial-neighbors.js";
 import { getSpatialMapCapacity as ee, getSpatialPoolChunkSize as te } from "./spatial-entity.js";
-//#region src/spatial/shared-spatial-map.ts
-var b = 0, x = 1, S = 2, C = 3, w = 4, T = 5, E = 6, D = 8, ne = 10, O = 0, k = 1, A = 2, j = 8, M = 256, re = 255, N = 0, P = 1, F = 2, I = 3, L = 4, R = 5, z = 6, B = 7, V = 0, H = 1, U = 2, W = 3, G = 4, K = 5, q = 6, J = 7, Y = 8, X = 16777216, ie = X, ae = 4294967295, oe = 4294967296, se = 73856093, ce = 19349663, le = 50, ue = 256, Z = 1, Q = 2, de = 1e6, fe = 4, pe = Float32Array, me = class l {
+// src/spatial/shared-spatial-map.ts
+var ne = 0, b = 1, x = 2, S = 3, C = 4, w = 5, T = 6, E = 8, D = 10, O = 0, k = 1, A = 2, j = 8, M = 256, re = 255, N = 0, P = 1, F = 2, I = 3, L = 4, R = 5, z = 6, B = 7, V = 0, H = 1, U = 2, W = 3, G = 4, K = 5, q = 6, J = 7, Y = 8, X = 16777216, ie = X, ae = 4294967295, oe = 4294967296, se = 73856093, ce = 19349663, le = 50, ue = 256, Z = 1, Q = 2, de = 1e6, fe = 4, pe = Float32Array, me = class m {
 	static ALLOCATE_COUNT = 11;
 	memory;
 	firstBlock;
@@ -53,7 +53,7 @@ var b = 0, x = 1, S = 2, C = 3, w = 4, T = 5, E = 6, D = 8, ne = 10, O = 0, k =
 		return this.cellSize;
 	}
 	get buckets() {
-		return Atomics.load(this.firstBlock.data, w);
+		return Atomics.load(this.firstBlock.data, C);
 	}
 	get maxBuckets() {
 		return this.maxBucketCount;
@@ -62,43 +62,43 @@ var b = 0, x = 1, S = 2, C = 3, w = 4, T = 5, E = 6, D = 8, ne = 10, O = 0, k =
 		return this.coordType;
 	}
 	constructor(i, a) {
-		if (this.memory = i, a && "firstBlock" in a) this.firstBlock = new r(i, a.firstBlock), this.coordType = this.firstBlock.data[T], this.bucketPointers = new h(i, { firstBlock: e(t(this.firstBlock.data, b), i.positionBits) }), this.entityPool = new g(i, { firstBlock: e(t(this.firstBlock.data, x), i.positionBits) }), this.slotPool = new g(i, { firstBlock: e(t(this.firstBlock.data, S), i.positionBits) }), this.idMap = new m(i, { firstBlock: e(t(this.firstBlock.data, C), i.positionBits) }), this.bucketCount = Atomics.load(this.firstBlock.data, w), this.maxBucketCount = this.firstBlock.data[ne], this.nullIndex = _e(this.coordType);
+		if (this.memory = i, a && "firstBlock" in a) this.firstBlock = new e(i, a.firstBlock), this.coordType = this.firstBlock.data[w], this.bucketPointers = new r(i, { firstBlock: u(d(this.firstBlock.data, ne), i.positionBits) }), this.entityPool = new t(i, { firstBlock: u(d(this.firstBlock.data, b), i.positionBits) }), this.slotPool = new t(i, { firstBlock: u(d(this.firstBlock.data, x), i.positionBits) }), this.idMap = new n(i, { firstBlock: u(d(this.firstBlock.data, S), i.positionBits) }), this.bucketCount = Atomics.load(this.firstBlock.data, C), this.maxBucketCount = this.firstBlock.data[D], this.nullIndex = _e(this.coordType);
 		else {
 			let e = a?.gridSize ?? le;
 			this.bucketCount = Math.min(1073741824, Math.max(1, Math.floor(a?.buckets ?? ue)));
-			let t = a?.maxEntities ?? de, r = a?.maxSlots ?? t * fe;
-			if (this.maxBucketCount = Math.min(1073741824, Math.max(this.bucketCount, Math.floor(a?.maxBuckets ?? ve(r * 2)))), this.coordType = he(a?.type), this.nullIndex = _e(this.coordType), this.coordType === c.float32 && (t > X || r > X)) throw Error(`Float32 SharedSpatialMap supports at most ${X} entities and slots; pass type: Float64Array for more`);
-			let o = {
+			let o = a?.maxEntities ?? de, s = a?.maxSlots ?? o * fe;
+			if (this.maxBucketCount = Math.min(1073741824, Math.max(this.bucketCount, Math.floor(a?.maxBuckets ?? ve(s * 2)))), this.coordType = he(a?.type), this.nullIndex = _e(this.coordType), this.coordType === p.float32 && (o > X || s > X)) throw Error(`Float32 SharedSpatialMap supports at most ${X} entities and slots; pass type: Float64Array for more`);
+			let c = {
 				type: ge(this.coordType),
 				dataLength: Y,
-				maxLength: t,
-				maxChunkSize: te(t, Y, u(this.coordType), i.maxAllocationLength)
-			}, s = {
+				maxLength: o,
+				maxChunkSize: te(o, Y, h(this.coordType), i.maxAllocationLength)
+			}, l = {
 				type: ge(this.coordType),
 				dataLength: B,
-				maxLength: r,
-				maxChunkSize: te(r, B, u(this.coordType), i.maxAllocationLength)
-			}, d = g.getAllocateCount(i, o), f = g.getAllocateCount(i, s), p = m.ALLOCATE_COUNT, _ = l.ALLOCATE_COUNT;
-			this.firstBlock = i.allocUI32(_ + d + f + p), this.firstBlock.data[w] = this.bucketCount, this.firstBlock.data[T] = this.coordType, this.firstBlock.data[ne] = this.maxBucketCount;
+				maxLength: s,
+				maxChunkSize: te(s, B, h(this.coordType), i.maxAllocationLength)
+			}, u = t.getAllocateCount(i, c), d = t.getAllocateCount(i, l), g = n.ALLOCATE_COUNT, _ = m.ALLOCATE_COUNT;
+			this.firstBlock = i.allocUI32(_ + u + d + g), this.firstBlock.data[C] = this.bucketCount, this.firstBlock.data[w] = this.coordType, this.firstBlock.data[D] = this.maxBucketCount;
 			let v = this.getConfigView();
-			v[0] = e, this.bucketPointers = new h(i), n(this.firstBlock.data, b, this.bucketPointers.pointer), this.appendBucketSegments(this.bucketCount);
-			let y = this.firstBlock.getSubAllocation(_, d);
-			this.entityPool = new g(i, {
+			v[0] = e, this.bucketPointers = new r(i), f(this.firstBlock.data, ne, this.bucketPointers.pointer), this.appendBucketSegments(this.bucketCount);
+			let y = this.firstBlock.getSubAllocation(_, u);
+			this.entityPool = new t(i, {
 				firstBlock: y,
-				...o
-			}), n(this.firstBlock.data, x, y.pointer);
-			let E = this.firstBlock.getSubAllocation(_ + d, f);
-			this.slotPool = new g(i, {
+				...c
+			}), f(this.firstBlock.data, b, y.pointer);
+			let T = this.firstBlock.getSubAllocation(_ + u, d);
+			this.slotPool = new t(i, {
+				firstBlock: T,
+				...l
+			}), f(this.firstBlock.data, x, T.pointer);
+			let E = this.firstBlock.getSubAllocation(_ + u + d, g);
+			this.idMap = new n(i, {
 				firstBlock: E,
-				...s
-			}), n(this.firstBlock.data, S, E.pointer);
-			let D = this.firstBlock.getSubAllocation(_ + d + f, p);
-			this.idMap = new m(i, {
-				firstBlock: D,
-				capacity: ee(t, i.maxAllocationLength)
-			}), n(this.firstBlock.data, C, D.pointer);
+				capacity: ee(o, i.maxAllocationLength)
+			}), f(this.firstBlock.data, S, E.pointer);
 		}
-		this.idLimit = this.coordType === c.float32 ? X : oe, this.bucketMask = $(this.bucketCount), this.tableLock = new Int32Array(this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + D * Uint32Array.BYTES_PER_ELEMENT, 2);
+		this.idLimit = this.coordType === p.float32 ? X : oe, this.bucketMask = $(this.bucketCount), this.tableLock = new Int32Array(this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + E * Uint32Array.BYTES_PER_ELEMENT, 2);
 		let o = this.getConfigView();
 		this.cellSize = o[0];
 	}
@@ -107,49 +107,49 @@ var b = 0, x = 1, S = 2, C = 3, w = 4, T = 5, E = 6, D = 8, ne = 10, O = 0, k =
 	}
 	get usedMemory() {
 		let t = this.firstBlock.usedMemory + this.bucketPointers.usedMemory + this.entityPool.usedMemory + this.slotPool.usedMemory + this.idMap.usedMemory;
-		for (let n of this.bucketPointers) t += new r(this.memory, e(n, this.memory.positionBits)).usedMemory;
+		for (let n of this.bucketPointers) t += new e(this.memory, u(n, this.memory.positionBits)).usedMemory;
 		return t;
 	}
-	insert(e, t, n, r = 0, o = 0) {
-		i(this.tableLock);
+	insert(e, t, n, r = 0, i = 0) {
+		o(this.tableLock);
 		try {
-			this.syncBucketCount(), this.insertLocked(e, t, n, r, o);
+			this.syncBucketCount(), this.insertLocked(e, t, n, r, i);
 		} finally {
-			a(this.tableLock);
+			s(this.tableLock);
 		}
 		this.growBucketsIfNeeded();
 	}
 	bulkInsert(e) {
 		let t = /* @__PURE__ */ new Map();
 		for (let n of e) this.assertValidId(n.id), t.set(n.id, n);
-		let n = Array.from(t.values()), r = this.idMap.getAll(n.map((e) => e.id)), o = [], s = 0, c = 0;
+		let n = Array.from(t.values()), r = this.idMap.getAll(n.map((e) => e.id)), i = [], a = 0, c = 0;
 		for (let e = 0; e < n.length; e++) if (r[e] === void 0) {
 			let t = n[e];
-			c++, s += (this.colOf(t.x + (t.width ?? 0)) - this.colOf(t.x) + 1) * (this.rowOf(t.y + (t.height ?? 0)) - this.rowOf(t.y) + 1);
+			c++, a += (this.colOf(t.x + (t.width ?? 0)) - this.colOf(t.x) + 1) * (this.rowOf(t.y + (t.height ?? 0)) - this.rowOf(t.y) + 1);
 		}
-		this.ensureBucketCapacity(this.slotPool.length + s);
-		let l = this.entityPool.reserveContiguous(c), u = this.slotPool.reserveContiguous(s);
-		i(this.tableLock);
+		this.ensureBucketCapacity(this.slotPool.length + a);
+		let l = this.entityPool.reserveContiguous(c), u = this.slotPool.reserveContiguous(a);
+		o(this.tableLock);
 		try {
 			this.syncBucketCount();
 			for (let e = 0; e < n.length; e++) {
-				let t = n[e], i = t.width ?? 0, a = t.height ?? 0;
+				let t = n[e], a = t.width ?? 0, o = t.height ?? 0;
 				if (r[e] !== void 0) {
-					this.updateLocked(t.id, t.x, t.y, i, a);
+					this.updateLocked(t.id, t.x, t.y, a, o);
 					continue;
 				}
-				let s = this.colOf(t.x), c = this.rowOf(t.y), d = this.colOf(t.x + i), f = this.rowOf(t.y + a), p = l++, m = this.entityPool.blockFor(p), h = this.entityPool.blockOffset(p);
-				m[h + V] = s, m[h + H] = c, m[h + U] = d, m[h + W] = f, m[h + G] = t.x, m[h + K] = t.y, m[h + q] = i, m[h + J] = a, o.push([t.id, p]);
+				let s = this.colOf(t.x), c = this.rowOf(t.y), d = this.colOf(t.x + a), f = this.rowOf(t.y + o), p = l++, m = this.entityPool.blockFor(p), h = this.entityPool.blockOffset(p);
+				m[h + V] = s, m[h + H] = c, m[h + U] = d, m[h + W] = f, m[h + G] = t.x, m[h + K] = t.y, m[h + q] = a, m[h + J] = o, i.push([t.id, p]);
 				for (let e = c; e <= f; e++) for (let n = s; n <= d; n++) this.linkReservedBucket(n, e, u++, t.id, p, s, c);
 			}
-			this.idMap.setAll(o);
+			this.idMap.setAll(i);
 		} finally {
-			a(this.tableLock);
+			s(this.tableLock);
 		}
 		this.growBucketsForBulk();
 	}
 	assertValidId(e) {
-		if (!Number.isInteger(e) || e < 0 || e >= this.idLimit) throw Error(`SharedSpatialMap id ${e} must be an integer in [0, ${this.idLimit})` + (this.coordType === c.float32 ? "; pass type: Float64Array for ids up to 2^32 - 1" : ""));
+		if (!Number.isInteger(e) || e < 0 || e >= this.idLimit) throw Error(`SharedSpatialMap id ${e} must be an integer in [0, ${this.idLimit})` + (this.coordType === p.float32 ? "; pass type: Float64Array for ids up to 2^32 - 1" : ""));
 	}
 	insertLocked(e, t, n, r, i) {
 		if (this.assertValidId(e), this.idMap.get(e) !== void 0) {
@@ -161,20 +161,20 @@ var b = 0, x = 1, S = 2, C = 3, w = 4, T = 5, E = 6, D = 8, ne = 10, O = 0, k =
 		let u = this.entityPool.push(l);
 		this.idMap.set(e, u), this.linkRange(e, u, a, o, s, c);
 	}
-	update(e, t, n, r = 0, o = 0) {
-		let s = this.idMap.get(e);
-		if (s !== void 0) {
-			let e = this.entityPool.blockFor(s), i = this.entityPool.blockOffset(s), a = this.colOf(t), c = this.rowOf(n), l = this.colOf(t + r), u = this.rowOf(n + o);
-			if (a === e[i + V] && c === e[i + H] && l === e[i + U] && u === e[i + W]) {
-				e[i + G] = t, e[i + K] = n, e[i + q] = r, e[i + J] = o;
+	update(e, t, n, r = 0, i = 0) {
+		let a = this.idMap.get(e);
+		if (a !== void 0) {
+			let e = this.entityPool.blockFor(a), o = this.entityPool.blockOffset(a), s = this.colOf(t), c = this.rowOf(n), l = this.colOf(t + r), u = this.rowOf(n + i);
+			if (s === e[o + V] && c === e[o + H] && l === e[o + U] && u === e[o + W]) {
+				e[o + G] = t, e[o + K] = n, e[o + q] = r, e[o + J] = i;
 				return;
 			}
 		}
-		i(this.tableLock);
+		o(this.tableLock);
 		try {
-			this.syncBucketCount(), this.updateLocked(e, t, n, r, o);
+			this.syncBucketCount(), this.updateLocked(e, t, n, r, i);
 		} finally {
-			a(this.tableLock);
+			s(this.tableLock);
 		}
 		this.growBucketsIfNeeded();
 	}
@@ -185,18 +185,14 @@ var b = 0, x = 1, S = 2, C = 3, w = 4, T = 5, E = 6, D = 8, ne = 10, O = 0, k =
 			return;
 		}
 		let o = this.entityPool.blockFor(a), s = this.entityPool.blockOffset(a), c = o[s + V], l = o[s + H], u = o[s + U], d = o[s + W], f = this.colOf(t), p = this.rowOf(n), m = this.colOf(t + r), h = this.rowOf(n + i);
-		if (f === c && p === l && m === u && h === d) {
-			o[s + G] = t, o[s + K] = n, o[s + q] = r, o[s + J] = i;
-			return;
-		}
-		this.relinkRange(e, a, f, p, m, h, c, l, u, d), o[s + V] = f, o[s + H] = p, o[s + U] = m, o[s + W] = h, o[s + G] = t, o[s + K] = n, o[s + q] = r, o[s + J] = i;
+		f === c && p === l && m === u && h === d ? (o[s + G] = t, o[s + K] = n, o[s + q] = r, o[s + J] = i) : (this.relinkRange(e, a, f, p, m, h, c, l, u, d), o[s + V] = f, o[s + H] = p, o[s + U] = m, o[s + W] = h, o[s + G] = t, o[s + K] = n, o[s + q] = r, o[s + J] = i);
 	}
 	remove(e) {
-		i(this.tableLock);
+		o(this.tableLock);
 		try {
 			return this.syncBucketCount(), this.removeLocked(e);
 		} finally {
-			a(this.tableLock);
+			s(this.tableLock);
 		}
 	}
 	removeLocked(e) {
@@ -212,12 +208,12 @@ var b = 0, x = 1, S = 2, C = 3, w = 4, T = 5, E = 6, D = 8, ne = 10, O = 0, k =
 		let a = [];
 		return this.searchInto(a, e, t, n, r, i), a;
 	}
-	searchInto(e, t, n, r, o, s) {
-		i(this.tableLock);
+	searchInto(e, t, n, r, i, a) {
+		o(this.tableLock);
 		try {
-			return this.syncBucketCount(), this.searchIntoLocked(e, t, n, r, o, s);
+			return this.syncBucketCount(), this.searchIntoLocked(e, t, n, r, i, a);
 		} finally {
-			a(this.tableLock);
+			s(this.tableLock);
 		}
 	}
 	searchIntoLocked(e, t, n, r, i, a) {
@@ -236,12 +232,12 @@ var b = 0, x = 1, S = 2, C = 3, w = 4, T = 5, E = 6, D = 8, ne = 10, O = 0, k =
 		}
 		return e;
 	}
-	neighbors(e, t, n, r, o) {
-		i(this.tableLock);
+	neighbors(e, t, n, r, i) {
+		o(this.tableLock);
 		try {
-			return this.syncBucketCount(), this.neighborsLocked(e, t, n, r, o);
+			return this.syncBucketCount(), this.neighborsLocked(e, t, n, r, i);
 		} finally {
-			a(this.tableLock);
+			s(this.tableLock);
 		}
 	}
 	neighborsLocked(e, t, n, r, i) {
@@ -255,20 +251,19 @@ var b = 0, x = 1, S = 2, C = 3, w = 4, T = 5, E = 6, D = 8, ne = 10, O = 0, k =
 			id: void 0,
 			distance: a
 		}, f = (r, f) => {
-			if (i === void 0) {
-				n === 1 ? this.collectNearestBucket(d, r, f, e, t) : this.collectNeighborCandidates(o, r, f, l, u, e, t, n, a);
-				return;
-			}
-			s.length = 0, this.collectNeighborBucket(s, r, f);
-			for (let r of s) {
-				if (c?.has(r)) continue;
-				c?.add(r);
-				let s = this.idMap.get(r);
-				if (s !== void 0 && (i === void 0 || i(r))) {
-					if (n === 1) {
-						let n = this.entityDistanceSquared(s, e, t);
-						(n < d.distance || n === d.distance && (d.id === void 0 || r < d.id)) && (d.id = r, d.distance = n);
-					} else this.addEntityCandidate(o, r, s, e, t, n, a);
+			if (i === void 0) n === 1 ? this.collectNearestBucket(d, r, f, e, t) : this.collectNeighborCandidates(o, r, f, l, u, e, t, n, a);
+			else {
+				s.length = 0, this.collectNeighborBucket(s, r, f);
+				for (let r of s) {
+					if (c?.has(r)) continue;
+					c?.add(r);
+					let s = this.idMap.get(r);
+					if (s !== void 0 && (i === void 0 || i(r))) {
+						if (n === 1) {
+							let n = this.entityDistanceSquared(s, e, t);
+							(n < d.distance || n === d.distance && (d.id === void 0 || r < d.id)) && (d.id = r, d.distance = n);
+						} else this.addEntityCandidate(o, r, s, e, t, n, a);
+					}
 				}
 			}
 		};
@@ -286,7 +281,7 @@ var b = 0, x = 1, S = 2, C = 3, w = 4, T = 5, E = 6, D = 8, ne = 10, O = 0, k =
 		return n === 1 ? d.id === void 0 ? [] : [d.id] : o.map((e) => e.id);
 	}
 	clear() {
-		o(this.tableLock);
+		c(this.tableLock);
 		try {
 			this.syncBucketCount();
 			for (let e = 0; e < this.bucketPointers.length; e++) {
@@ -299,18 +294,18 @@ var b = 0, x = 1, S = 2, C = 3, w = 4, T = 5, E = 6, D = 8, ne = 10, O = 0, k =
 			for (let [t] of this.idMap) e.push(t);
 			for (let t of e) this.idMap.delete(t);
 		} finally {
-			s(this.tableLock);
+			l(this.tableLock);
 		}
 	}
 	free() {
-		for (let t of this.bucketPointers) new r(this.memory, e(t, this.memory.positionBits)).free();
+		for (let t of this.bucketPointers) new e(this.memory, u(t, this.memory.positionBits)).free();
 		this.bucketPointers.free(), this.entityPool.free(), this.slotPool.free(), this.idMap.free(), this.firstBlock.free();
 	}
 	getSharedMemory() {
 		return { firstBlock: this.firstBlock.getSharedMemory() };
 	}
 	getConfigView() {
-		return d(this.coordType, this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + E * Uint32Array.BYTES_PER_ELEMENT, 1);
+		return g(this.coordType, this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + T * Uint32Array.BYTES_PER_ELEMENT, 1);
 	}
 	colOf(e) {
 		return Math.floor(e / this.cellSize);
@@ -331,10 +326,10 @@ var b = 0, x = 1, S = 2, C = 3, w = 4, T = 5, E = 6, D = 8, ne = 10, O = 0, k =
 		return (e & re) * A;
 	}
 	getBucketSegment(t) {
-		let n = t >>> j, i = this.bucketSegments[n];
-		if (i !== void 0) return i;
-		let a = this.bucketPointers.at(n), o = new r(this.memory, e(a, this.memory.positionBits)), s = new Int32Array(o.data.buffer, o.bufferByteOffset, M * A);
-		return this.bucketHeadSegments[n] = new Uint32Array(o.data.buffer, o.bufferByteOffset, M * A), this.bucketSegments[n] = s, s;
+		let n = t >>> j, r = this.bucketSegments[n];
+		if (r !== void 0) return r;
+		let i = this.bucketPointers.at(n), a = new e(this.memory, u(i, this.memory.positionBits)), o = new Int32Array(a.data.buffer, a.bufferByteOffset, M * A);
+		return this.bucketHeadSegments[n] = new Uint32Array(a.data.buffer, a.bufferByteOffset, M * A), this.bucketSegments[n] = o, o;
 	}
 	appendBucketSegments(e) {
 		let t = Math.ceil(e / M);
@@ -345,31 +340,31 @@ var b = 0, x = 1, S = 2, C = 3, w = 4, T = 5, E = 6, D = 8, ne = 10, O = 0, k =
 		}
 	}
 	syncBucketCount() {
-		let e = Atomics.load(this.firstBlock.data, w);
+		let e = Atomics.load(this.firstBlock.data, C);
 		e !== this.bucketCount && (this.bucketCount = e, this.bucketMask = $(e));
 	}
 	growBucketsIfNeeded() {
-		let e = Atomics.load(this.firstBlock.data, w);
+		let e = Atomics.load(this.firstBlock.data, C);
 		if (!(e >= this.maxBucketCount || this.slotPool.length * Q <= e * Z)) {
-			o(this.tableLock);
+			c(this.tableLock);
 			try {
 				if (this.syncBucketCount(), this.slotPool.length * Q <= this.bucketCount * Z) return;
 				let e = Math.min(this.bucketCount * 2, this.maxBucketCount);
 				if (e === this.bucketCount) return;
 				this.resizeBuckets(e);
 			} finally {
-				s(this.tableLock);
+				l(this.tableLock);
 			}
 		}
 	}
 	ensureBucketCapacity(e) {
 		let t = Math.ceil(e * Q / Z), n = Math.min(ve(t), this.maxBucketCount);
-		if (!(n <= Atomics.load(this.firstBlock.data, w))) {
-			o(this.tableLock);
+		if (!(n <= Atomics.load(this.firstBlock.data, C))) {
+			c(this.tableLock);
 			try {
 				this.syncBucketCount(), n > this.bucketCount && this.resizeBuckets(n);
 			} finally {
-				s(this.tableLock);
+				l(this.tableLock);
 			}
 		}
 	}
@@ -381,16 +376,21 @@ var b = 0, x = 1, S = 2, C = 3, w = 4, T = 5, E = 6, D = 8, ne = 10, O = 0, k =
 			for (let e = k; e < t.length; e += A) t[e] = this.nullIndex;
 		}
 		this.bucketCount = e, this.bucketMask = $(e);
-		for (let [e, t] of this.slotPool.entries()) {
-			let n = this.bucketOf(t[P], t[F]), r = this.bucketHeadSegments[n >>> j], i = this.bucketOffset(n) + k;
-			t[R] = r[i], r[i] = e;
+		let t = this.slotPool, n = t.getRecycledMask(), r = n.length, i = t.maxChunkSize;
+		for (let e = 0; e < r; e += i) {
+			let a = t.blockFor(e), o = Math.min(e + i, r);
+			for (let t = e; t < o; t++) {
+				if (n[t] === 1) continue;
+				let r = (t - e) * B, i = this.bucketOf(a[r + P], a[r + F]), o = this.bucketHeadSegments[i >>> j], s = this.bucketOffset(i) + k;
+				a[r + R] = o[s], o[s] = t;
+			}
 		}
-		Atomics.store(this.firstBlock.data, w, e);
+		Atomics.store(this.firstBlock.data, C, e);
 	}
 	growBucketsForBulk() {
 		for (;;) {
-			let e = Atomics.load(this.firstBlock.data, w);
-			if (this.growBucketsIfNeeded(), Atomics.load(this.firstBlock.data, w) === e) return;
+			let e = Atomics.load(this.firstBlock.data, C);
+			if (this.growBucketsIfNeeded(), Atomics.load(this.firstBlock.data, C) === e) return;
 		}
 	}
 	linkRange(e, t, n, r, i, a) {
@@ -400,18 +400,18 @@ var b = 0, x = 1, S = 2, C = 3, w = 4, T = 5, E = 6, D = 8, ne = 10, O = 0, k =
 	}
 	linkIntoBucket(e, t, n) {
 		n[P] = e, n[F] = t;
-		let r = this.slotPool, i = r.push(n), a = this.bucketOf(e, t), o = this.getBucketSegment(a), s = this.bucketHeadSegments[a >>> j], c = this.bucketOffset(a), l = c + O;
-		f(o, l);
-		let u = c + k;
-		r.set(i, R, s[u]), s[u] = i, p(o, l);
-	}
-	linkReservedBucket(e, t, n, r, i, a, o) {
-		let s = this.slotPool, c = s.blockFor(n), l = s.blockOffset(n);
-		c[l + N] = r, c[l + P] = e, c[l + F] = t, c[l + I] = a, c[l + L] = o, c[l + z] = i;
-		let u = this.bucketOf(e, t), d = this.getBucketSegment(u), m = this.bucketHeadSegments[u >>> j], h = this.bucketOffset(u), g = h + O;
-		f(d, g);
+		let r = this.slotPool, o = r.push(n), s = this.bucketOf(e, t), c = this.getBucketSegment(s), l = this.bucketHeadSegments[s >>> j], u = this.bucketOffset(s), d = u + O;
+		i(c, d);
+		let f = u + k;
+		r.set(o, R, l[f]), l[f] = o, a(c, d);
+	}
+	linkReservedBucket(e, t, n, r, o, s, c) {
+		let l = this.slotPool, u = l.blockFor(n), d = l.blockOffset(n);
+		u[d + N] = r, u[d + P] = e, u[d + F] = t, u[d + I] = s, u[d + L] = c, u[d + z] = o;
+		let f = this.bucketOf(e, t), p = this.getBucketSegment(f), m = this.bucketHeadSegments[f >>> j], h = this.bucketOffset(f), g = h + O;
+		i(p, g);
 		let _ = h + k;
-		c[l + R] = m[_], m[_] = n, p(d, g);
+		u[d + R] = m[_], m[_] = n, a(p, g);
 	}
 	relinkRange(e, t, n, r, i, a, o, s, c, l) {
 		let u = n > o ? n : o, d = i < c ? i : c, f = r > s ? r : s, p = a < l ? a : l, m = u <= d && f <= p, h = this.slotScratch;
@@ -430,19 +430,19 @@ var b = 0, x = 1, S = 2, C = 3, w = 4, T = 5, E = 6, D = 8, ne = 10, O = 0, k =
 			}
 		}
 	}
-	refreshAnchorInBucket(e, t, n, r, i, a) {
-		let o = this.nullIndex, s = this.getBucketSegment(e), c = this.bucketOffset(e), l = c + O;
-		f(s, l);
-		let u = this.slotPool, d = this.bucketHeadSegments[e >>> j][c + k];
-		for (; d !== o;) {
-			let e = u.blockFor(d), o = u.blockOffset(d);
-			if (e[o + N] === t && e[o + P] === n && e[o + F] === r) {
-				e[o + I] = i, e[o + L] = a;
+	refreshAnchorInBucket(e, t, n, r, o, s) {
+		let c = this.nullIndex, l = this.getBucketSegment(e), u = this.bucketOffset(e), d = u + O;
+		i(l, d);
+		let f = this.slotPool, p = this.bucketHeadSegments[e >>> j][u + k];
+		for (; p !== c;) {
+			let e = f.blockFor(p), i = f.blockOffset(p);
+			if (e[i + N] === t && e[i + P] === n && e[i + F] === r) {
+				e[i + I] = o, e[i + L] = s;
 				break;
 			}
-			d = e[o + R];
+			p = e[i + R];
 		}
-		p(s, l);
+		a(l, d);
 	}
 	unlinkRange(e, t, n, r, i) {
 		let a = this.nullIndex, o = this.slotPool;
@@ -451,66 +451,66 @@ var b = 0, x = 1, S = 2, C = 3, w = 4, T = 5, E = 6, D = 8, ne = 10, O = 0, k =
 			t !== a && o.deleteIndex(t);
 		}
 	}
-	collectBucket(e, t, n, r, i, a, o, s) {
-		let c = this.nullIndex, l = r + k, u = r + O;
-		f(t, u);
-		let d = n[l], m = this.slotPool;
-		for (; d !== c;) {
-			let t = m.blockFor(d), n = m.blockOffset(d);
-			if (t[n + P] === i && t[n + F] === a) {
-				let r = t[n + I], c = t[n + L];
-				i === (r > o ? r : o) && a === (c > s ? c : s) && e.push(t[n + N]);
+	collectBucket(e, t, n, r, o, s, c, l) {
+		let u = this.nullIndex, d = r + k, f = r + O;
+		i(t, f);
+		let p = n[d], m = this.slotPool;
+		for (; p !== u;) {
+			let t = m.blockFor(p), n = m.blockOffset(p);
+			if (t[n + P] === o && t[n + F] === s) {
+				let r = t[n + I], i = t[n + L];
+				o === (r > c ? r : c) && s === (i > l ? i : l) && e.push(t[n + N]);
 			}
-			d = t[n + R];
+			p = t[n + R];
 		}
-		p(t, u);
+		a(t, f);
 	}
 	collectNeighborBucket(e, t, n) {
-		let r = this.bucketOf(t, n), i = this.getBucketSegment(r), a = this.bucketHeadSegments[r >>> j], o = this.bucketOffset(r), s = o + k;
-		if (a[s] === this.nullIndex) return;
-		let c = o + O;
-		f(i, c);
-		let l = a[s];
-		for (; l !== this.nullIndex;) {
-			let r = this.slotPool.blockFor(l), i = this.slotPool.blockOffset(l);
-			r[i + P] === t && r[i + F] === n && e.push(r[i + N]), l = r[i + R];
-		}
-		p(i, c);
-	}
-	collectNearestBucket(e, t, n, r, i) {
-		let a = this.bucketOf(t, n), o = this.getBucketSegment(a), s = this.bucketHeadSegments[a >>> j], c = this.bucketOffset(a), l = c + k;
+		let r = this.bucketOf(t, n), o = this.getBucketSegment(r), s = this.bucketHeadSegments[r >>> j], c = this.bucketOffset(r), l = c + k;
 		if (s[l] === this.nullIndex) return;
 		let u = c + O;
-		f(o, u);
+		i(o, u);
 		let d = s[l];
 		for (; d !== this.nullIndex;) {
-			let a = this.slotPool.blockFor(d), o = this.slotPool.blockOffset(d);
-			if (a[o + P] === t && a[o + F] === n) {
-				let t = a[o + z], n = this.entityPool.blockFor(t), s = this.entityPool.blockOffset(t), c = a[o + N], l = this.entityBlockDistanceSquared(n, s, r, i);
+			let r = this.slotPool.blockFor(d), i = this.slotPool.blockOffset(d);
+			r[i + P] === t && r[i + F] === n && e.push(r[i + N]), d = r[i + R];
+		}
+		a(o, u);
+	}
+	collectNearestBucket(e, t, n, r, o) {
+		let s = this.bucketOf(t, n), c = this.getBucketSegment(s), l = this.bucketHeadSegments[s >>> j], u = this.bucketOffset(s), d = u + k;
+		if (l[d] === this.nullIndex) return;
+		let f = u + O;
+		i(c, f);
+		let p = l[d];
+		for (; p !== this.nullIndex;) {
+			let i = this.slotPool.blockFor(p), a = this.slotPool.blockOffset(p);
+			if (i[a + P] === t && i[a + F] === n) {
+				let t = i[a + z], n = this.entityPool.blockFor(t), s = this.entityPool.blockOffset(t), c = i[a + N], l = this.entityBlockDistanceSquared(n, s, r, o);
 				(l < e.distance || l === e.distance && (e.id === void 0 || c < e.id)) && (e.id = c, e.distance = l);
 			}
-			d = a[o + R];
+			p = i[a + R];
 		}
-		p(o, u);
+		a(c, f);
 	}
-	collectNeighborCandidates(e, t, n, r, i, a, o, s, c) {
-		let l = this.bucketOf(t, n), u = this.getBucketSegment(l), d = this.bucketHeadSegments[l >>> j], m = this.bucketOffset(l), h = m + k;
-		if (d[h] === this.nullIndex) return;
+	collectNeighborCandidates(e, t, n, r, o, s, c, l, u) {
+		let d = this.bucketOf(t, n), f = this.getBucketSegment(d), p = this.bucketHeadSegments[d >>> j], m = this.bucketOffset(d), h = m + k;
+		if (p[h] === this.nullIndex) return;
 		let g = m + O;
-		f(u, g);
-		let v = d[h];
+		i(f, g);
+		let v = p[h];
 		for (; v !== this.nullIndex;) {
-			let l = this.slotPool.blockFor(v), u = this.slotPool.blockOffset(v);
-			if (l[u + P] === t && l[u + F] === n) {
-				let d = l[u + z], f = this.entityPool.blockFor(d), p = this.entityPool.blockOffset(d), m = f[p + V], h = f[p + U], g = f[p + H], v = f[p + W];
-				if (t === (r < m ? m : r > h ? h : r) && n === (i < g ? g : i > v ? v : i)) {
-					let t = this.entityBlockDistanceSquared(f, p, a, o);
-					t <= c && _(e, l[u + N], t, s);
+			let i = this.slotPool.blockFor(v), a = this.slotPool.blockOffset(v);
+			if (i[a + P] === t && i[a + F] === n) {
+				let d = i[a + z], f = this.entityPool.blockFor(d), p = this.entityPool.blockOffset(d), m = f[p + V], h = f[p + U], g = f[p + H], v = f[p + W];
+				if (t === (r < m ? m : r > h ? h : r) && n === (o < g ? g : o > v ? v : o)) {
+					let t = this.entityBlockDistanceSquared(f, p, s, c);
+					t <= u && _(e, i[a + N], t, l);
 				}
 			}
-			v = l[u + R];
+			v = i[a + R];
 		}
-		p(u, g);
+		a(f, g);
 	}
 	addEntityCandidate(e, t, n, r, i, a, o) {
 		let s = this.entityDistanceSquared(n, r, i);
@@ -525,27 +525,27 @@ var b = 0, x = 1, S = 2, C = 3, w = 4, T = 5, E = 6, D = 8, ne = 10, O = 0, k =
 		return y(n, r, i, a, i + e[t + q], a + e[t + J]);
 	}
 	unlinkFromBucket(e, t, n, r) {
-		let i = this.nullIndex, a = this.getBucketSegment(e), o = this.bucketHeadSegments[e >>> j], s = this.bucketOffset(e), c = s + O;
-		f(a, c);
-		let l = s + k, u = this.slotPool, d = i, m = o[l];
-		for (; m !== i;) {
-			let e = u.blockFor(m), s = u.blockOffset(m), f = e[s + R];
-			if (e[s + N] === t && e[s + P] === n && e[s + F] === r) return d === i ? o[l] = f : u.set(d, R, f), p(a, c), m;
-			d = m, m = f;
+		let o = this.nullIndex, s = this.getBucketSegment(e), c = this.bucketHeadSegments[e >>> j], l = this.bucketOffset(e), u = l + O;
+		i(s, u);
+		let d = l + k, f = this.slotPool, p = o, m = c[d];
+		for (; m !== o;) {
+			let e = f.blockFor(m), i = f.blockOffset(m), l = e[i + R];
+			if (e[i + N] === t && e[i + P] === n && e[i + F] === r) return p === o ? c[d] = l : f.set(p, R, l), a(s, u), m;
+			p = m, m = l;
 		}
-		return p(a, c), i;
+		return a(s, u), o;
 	}
 };
 function he(e) {
-	let t = l(e ?? pe);
-	if (t !== c.float32 && t !== c.float64) throw Error("SharedSpatialMap must be Float32Array or Float64Array");
+	let t = m(e ?? pe);
+	if (t !== p.float32 && t !== p.float64) throw Error("SharedSpatialMap must be Float32Array or Float64Array");
 	return t;
 }
 function ge(e) {
-	return u(e) === 2 ? Float64Array : Float32Array;
+	return h(e) === 2 ? Float64Array : Float32Array;
 }
 function _e(e) {
-	return e === c.float32 ? ie : ae;
+	return e === p.float32 ? ie : ae;
 }
 function $(e) {
 	return e & e - 1 ? -1 : e - 1;
@@ -553,7 +553,6 @@ function $(e) {
 function ve(e) {
 	return 2 ** Math.ceil(Math.log2(Math.max(1, e)));
 }
-//#endregion
 export { me as default };
 
 //# sourceMappingURL=shared-spatial-map.js.map