@daneren2005/shared-memory-objects 1.5.0 → 1.5.2

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 { ARRAY_TYPE as i, getArrayTypeCode as a, getByteMultipler as o, makeArrayView as s } from "../utils/array-type.js";
-import { lock as c, unlock as l } from "../lock/simple-lock.js";
-import u from "../shared-map.js";
-import d from "../shared-stack.js";
-import f from "../shared-pool.js";
-import { readLock as p, readUnlock as m, writeLock as h, writeUnlock as g } from "../lock/read-write-lock.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 { 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 = 73856093, se = 19349663, ce = 50, le = 256, Z = 1, Q = 2, ue = 1e6, de = 4, fe = Float32Array, pe = class a {
+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 = 73856093, se = 19349663, ce = 50, le = 256, Z = 1, Q = 2, ue = 1e6, de = 4, fe = Float32Array, pe = class l {
 	static ALLOCATE_COUNT = 11;
 	memory;
 	firstBlock;
@@ -60,46 +60,46 @@ var b = 0, x = 1, S = 2, C = 3, w = 4, T = 5, E = 6, D = 8, ne = 10, O = 0, k =
 	get type() {
 		return this.coordType;
 	}
-	constructor(s, c) {
-		if (this.memory = s, c && "firstBlock" in c) this.firstBlock = new r(s, c.firstBlock), this.coordType = this.firstBlock.data[T], this.bucketPointers = new d(s, { firstBlock: e(t(this.firstBlock.data, b), s.positionBits) }), this.entityPool = new f(s, { firstBlock: e(t(this.firstBlock.data, x), s.positionBits) }), this.slotPool = new f(s, { firstBlock: e(t(this.firstBlock.data, S), s.positionBits) }), this.idMap = new u(s, { firstBlock: e(t(this.firstBlock.data, C), s.positionBits) }), this.bucketCount = Atomics.load(this.firstBlock.data, w), this.maxBucketCount = this.firstBlock.data[ne], this.nullIndex = ge(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 = ge(this.coordType);
 		else {
-			let e = c?.gridSize ?? ce;
-			this.bucketCount = Math.min(1073741824, Math.max(1, Math.floor(c?.buckets ?? le)));
-			let t = c?.maxEntities ?? ue, r = c?.maxSlots ?? t * de;
-			if (this.maxBucketCount = Math.min(1073741824, Math.max(this.bucketCount, Math.floor(c?.maxBuckets ?? _e(r * 2)))), this.coordType = me(c?.type), this.nullIndex = ge(this.coordType), this.coordType === i.float32 && (t > X || r > X)) throw Error(`Float32 SharedSpatialMap supports at most ${X} entities and slots; pass type: Float64Array for more`);
-			let l = {
+			let e = a?.gridSize ?? ce;
+			this.bucketCount = Math.min(1073741824, Math.max(1, Math.floor(a?.buckets ?? le)));
+			let t = a?.maxEntities ?? ue, r = a?.maxSlots ?? t * de;
+			if (this.maxBucketCount = Math.min(1073741824, Math.max(this.bucketCount, Math.floor(a?.maxBuckets ?? _e(r * 2)))), this.coordType = me(a?.type), this.nullIndex = ge(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 = {
 				type: he(this.coordType),
 				dataLength: Y,
 				maxLength: t,
-				maxChunkSize: te(t, Y, o(this.coordType), s.maxAllocationLength)
-			}, p = {
+				maxChunkSize: te(t, Y, u(this.coordType), i.maxAllocationLength)
+			}, s = {
 				type: he(this.coordType),
 				dataLength: B,
 				maxLength: r,
-				maxChunkSize: te(r, B, o(this.coordType), s.maxAllocationLength)
-			}, m = f.getAllocateCount(s, l), h = f.getAllocateCount(s, p), g = u.ALLOCATE_COUNT, _ = a.ALLOCATE_COUNT;
-			this.firstBlock = s.allocUI32(_ + m + h + g), this.firstBlock.data[w] = this.bucketCount, this.firstBlock.data[T] = this.coordType, this.firstBlock.data[ne] = this.maxBucketCount;
+				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;
 			let v = this.getConfigView();
-			v[0] = e, this.bucketPointers = new d(s), n(this.firstBlock.data, b, this.bucketPointers.pointer), this.appendBucketSegments(this.bucketCount);
-			let y = this.firstBlock.getSubAllocation(_, m);
-			this.entityPool = new f(s, {
+			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, {
 				firstBlock: y,
-				...l
+				...o
 			}), n(this.firstBlock.data, x, y.pointer);
-			let E = this.firstBlock.getSubAllocation(_ + m, h);
-			this.slotPool = new f(s, {
+			let E = this.firstBlock.getSubAllocation(_ + d, f);
+			this.slotPool = new g(i, {
 				firstBlock: E,
-				...p
+				...s
 			}), n(this.firstBlock.data, S, E.pointer);
-			let D = this.firstBlock.getSubAllocation(_ + m + h, g);
-			this.idMap = new u(s, {
+			let D = this.firstBlock.getSubAllocation(_ + d + f, p);
+			this.idMap = new m(i, {
 				firstBlock: D,
-				capacity: ee(t, s.maxAllocationLength)
+				capacity: ee(t, i.maxAllocationLength)
 			}), n(this.firstBlock.data, C, D.pointer);
 		}
 		this.bucketMask = $(this.bucketCount), this.tableLock = new Int32Array(this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + D * Uint32Array.BYTES_PER_ELEMENT, 2);
-		let l = this.getConfigView();
-		this.cellSize = l[0];
+		let o = this.getConfigView();
+		this.cellSize = o[0];
 	}
 	get pointer() {
 		return this.firstBlock.pointer;
@@ -109,41 +109,41 @@ var b = 0, x = 1, S = 2, C = 3, w = 4, T = 5, E = 6, D = 8, ne = 10, O = 0, k =
 		for (let n of this.bucketPointers) t += new r(this.memory, e(n, this.memory.positionBits)).usedMemory;
 		return t;
 	}
-	insert(e, t, n, r = 0, i = 0) {
-		p(this.tableLock);
+	insert(e, t, n, r = 0, o = 0) {
+		i(this.tableLock);
 		try {
-			this.syncBucketCount(), this.insertLocked(e, t, n, r, i);
+			this.syncBucketCount(), this.insertLocked(e, t, n, r, o);
 		} finally {
-			m(this.tableLock);
+			a(this.tableLock);
 		}
 		this.growBucketsIfNeeded();
 	}
 	bulkInsert(e) {
 		let t = /* @__PURE__ */ new Map();
 		for (let n of e) t.set(n.id, n);
-		let n = Array.from(t.values()), r = this.idMap.getAll(n.map((e) => e.id)), i = [], a = 0, o = 0;
+		let n = Array.from(t.values()), r = this.idMap.getAll(n.map((e) => e.id)), o = [], s = 0, c = 0;
 		for (let e = 0; e < n.length; e++) if (r[e] === void 0) {
 			let t = n[e];
-			o++, 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);
+			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);
 		}
-		this.ensureBucketCapacity(this.slotPool.length + a);
-		let s = this.entityPool.reserveContiguous(o), c = this.slotPool.reserveContiguous(a);
-		p(this.tableLock);
+		this.ensureBucketCapacity(this.slotPool.length + s);
+		let l = this.entityPool.reserveContiguous(c), u = this.slotPool.reserveContiguous(s);
+		i(this.tableLock);
 		try {
 			this.syncBucketCount();
 			for (let e = 0; e < n.length; e++) {
-				let t = n[e], a = t.width ?? 0, o = t.height ?? 0;
+				let t = n[e], i = t.width ?? 0, a = t.height ?? 0;
 				if (r[e] !== void 0) {
-					this.updateLocked(t.id, t.x, t.y, a, o);
+					this.updateLocked(t.id, t.x, t.y, i, a);
 					continue;
 				}
-				let l = this.colOf(t.x), u = this.rowOf(t.y), d = this.colOf(t.x + a), f = this.rowOf(t.y + o), p = s++, m = this.entityPool.blockFor(p), h = this.entityPool.blockOffset(p);
-				m[h + V] = l, m[h + H] = u, 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 = u; e <= f; e++) for (let n = l; n <= d; n++) this.linkReservedBucket(n, e, c++, t.id, p, l, u);
+				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]);
+				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(i);
+			this.idMap.setAll(o);
 		} finally {
-			m(this.tableLock);
+			a(this.tableLock);
 		}
 		this.growBucketsForBulk();
 	}
@@ -157,20 +157,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, 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;
+	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;
 				return;
 			}
 		}
-		p(this.tableLock);
+		i(this.tableLock);
 		try {
-			this.syncBucketCount(), this.updateLocked(e, t, n, r, i);
+			this.syncBucketCount(), this.updateLocked(e, t, n, r, o);
 		} finally {
-			m(this.tableLock);
+			a(this.tableLock);
 		}
 		this.growBucketsIfNeeded();
 	}
@@ -188,11 +188,11 @@ var b = 0, x = 1, S = 2, C = 3, w = 4, T = 5, E = 6, D = 8, ne = 10, O = 0, k =
 		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) {
-		p(this.tableLock);
+		i(this.tableLock);
 		try {
 			return this.syncBucketCount(), this.removeLocked(e);
 		} finally {
-			m(this.tableLock);
+			a(this.tableLock);
 		}
 	}
 	removeLocked(e) {
@@ -208,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, i, a) {
-		p(this.tableLock);
+	searchInto(e, t, n, r, o, s) {
+		i(this.tableLock);
 		try {
-			return this.syncBucketCount(), this.searchIntoLocked(e, t, n, r, i, a);
+			return this.syncBucketCount(), this.searchIntoLocked(e, t, n, r, o, s);
 		} finally {
-			m(this.tableLock);
+			a(this.tableLock);
 		}
 	}
 	searchIntoLocked(e, t, n, r, i, a) {
@@ -232,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, i) {
-		p(this.tableLock);
+	neighbors(e, t, n, r, o) {
+		i(this.tableLock);
 		try {
-			return this.syncBucketCount(), this.neighborsLocked(e, t, n, r, i);
+			return this.syncBucketCount(), this.neighborsLocked(e, t, n, r, o);
 		} finally {
-			m(this.tableLock);
+			a(this.tableLock);
 		}
 	}
 	neighborsLocked(e, t, n, r, i) {
@@ -282,7 +282,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() {
-		h(this.tableLock);
+		o(this.tableLock);
 		try {
 			this.syncBucketCount();
 			for (let e = 0; e < this.bucketPointers.length; e++) {
@@ -295,7 +295,7 @@ 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 {
-			g(this.tableLock);
+			s(this.tableLock);
 		}
 	}
 	free() {
@@ -306,7 +306,7 @@ var b = 0, x = 1, S = 2, C = 3, w = 4, T = 5, E = 6, D = 8, ne = 10, O = 0, k =
 		return { firstBlock: this.firstBlock.getSharedMemory() };
 	}
 	getConfigView() {
-		return s(this.coordType, this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + E * Uint32Array.BYTES_PER_ELEMENT, 1);
+		return d(this.coordType, this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + E * Uint32Array.BYTES_PER_ELEMENT, 1);
 	}
 	colOf(e) {
 		return Math.floor(e / this.cellSize);
@@ -347,25 +347,25 @@ var b = 0, x = 1, S = 2, C = 3, w = 4, T = 5, E = 6, D = 8, ne = 10, O = 0, k =
 	growBucketsIfNeeded() {
 		let e = Atomics.load(this.firstBlock.data, w);
 		if (!(e >= this.maxBucketCount || this.slotPool.length * Q <= e * Z)) {
-			h(this.tableLock);
+			o(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 {
-				g(this.tableLock);
+				s(this.tableLock);
 			}
 		}
 	}
 	ensureBucketCapacity(e) {
 		let t = Math.ceil(e * Q / Z), n = Math.min(_e(t), this.maxBucketCount);
 		if (!(n <= Atomics.load(this.firstBlock.data, w))) {
-			h(this.tableLock);
+			o(this.tableLock);
 			try {
 				this.syncBucketCount(), n > this.bucketCount && this.resizeBuckets(n);
 			} finally {
-				g(this.tableLock);
+				s(this.tableLock);
 			}
 		}
 	}
@@ -396,18 +396,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], u = this.bucketOffset(a), d = u + O;
-		c(o, d);
-		let f = u + k;
-		r.set(i, R, s[f]), s[f] = i, l(o, d);
+		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, u = s.blockFor(n), d = s.blockOffset(n);
-		u[d + N] = r, u[d + P] = e, u[d + F] = t, u[d + I] = a, u[d + L] = o, u[d + z] = i;
-		let f = this.bucketOf(e, t), p = this.getBucketSegment(f), m = this.bucketHeadSegments[f >>> j], h = this.bucketOffset(f), g = h + O;
-		c(p, g);
+		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 _ = h + k;
-		u[d + R] = m[_], m[_] = n, l(p, g);
+		c[l + R] = m[_], m[_] = n, p(d, 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;
@@ -427,18 +427,18 @@ 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), u = this.bucketOffset(e), d = u + O;
-		c(s, d);
-		let f = this.slotPool, p = this.bucketHeadSegments[e >>> j][u + k];
-		for (; p !== o;) {
-			let e = f.blockFor(p), o = f.blockOffset(p);
+		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;
 				break;
 			}
-			p = e[o + R];
+			d = e[o + R];
 		}
-		l(s, d);
+		p(s, l);
 	}
 	unlinkRange(e, t, n, r, i) {
 		let a = this.nullIndex, o = this.slotPool;
@@ -448,65 +448,65 @@ var b = 0, x = 1, S = 2, C = 3, w = 4, T = 5, E = 6, D = 8, ne = 10, O = 0, k =
 		}
 	}
 	collectBucket(e, t, n, r, i, a, o, s) {
-		let u = this.nullIndex, d = r + k, f = r + O;
-		c(t, f);
-		let p = n[d], m = this.slotPool;
-		for (; p !== u;) {
-			let t = m.blockFor(p), n = m.blockOffset(p);
+		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]);
 			}
-			p = t[n + R];
+			d = t[n + R];
 		}
-		l(t, f);
+		p(t, u);
 	}
 	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 u = o + O;
-		c(i, u);
-		let d = a[s];
-		for (; d !== this.nullIndex;) {
-			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];
+		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];
 		}
-		l(i, u);
+		p(i, c);
 	}
 	collectNearestBucket(e, t, n, r, i) {
-		let a = this.bucketOf(t, n), o = this.getBucketSegment(a), s = this.bucketHeadSegments[a >>> j], u = this.bucketOffset(a), d = u + k;
-		if (s[d] === this.nullIndex) return;
-		let f = u + O;
-		c(o, f);
-		let p = s[d];
-		for (; p !== this.nullIndex;) {
-			let a = this.slotPool.blockFor(p), o = this.slotPool.blockOffset(p);
+		let a = this.bucketOf(t, n), o = this.getBucketSegment(a), s = this.bucketHeadSegments[a >>> j], c = this.bucketOffset(a), l = c + k;
+		if (s[l] === this.nullIndex) return;
+		let u = c + O;
+		f(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);
 				(l < e.distance || l === e.distance && (e.id === void 0 || c < e.id)) && (e.id = c, e.distance = l);
 			}
-			p = a[o + R];
+			d = a[o + R];
 		}
-		l(o, f);
+		p(o, u);
 	}
-	collectNeighborCandidates(e, t, n, r, i, a, o, s, 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;
+	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;
 		let g = m + O;
-		c(f, g);
-		let v = p[h];
+		f(u, g);
+		let v = d[h];
 		for (; v !== this.nullIndex;) {
-			let c = this.slotPool.blockFor(v), l = this.slotPool.blockOffset(v);
-			if (c[l + P] === t && c[l + F] === n) {
-				let d = c[l + 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];
+			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 <= u && _(e, c[l + N], t, s);
+					t <= c && _(e, l[u + N], t, s);
 				}
 			}
-			v = c[l + R];
+			v = l[u + R];
 		}
-		l(f, g);
+		p(u, g);
 	}
 	addEntityCandidate(e, t, n, r, i, a, o) {
 		let s = this.entityDistanceSquared(n, r, i);
@@ -521,27 +521,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), u = s + O;
-		c(a, u);
-		let d = s + k, f = this.slotPool, p = i, m = o[d];
+		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 = f.blockFor(m), s = f.blockOffset(m), c = e[s + R];
-			if (e[s + N] === t && e[s + P] === n && e[s + F] === r) return p === i ? o[d] = c : f.set(p, R, c), l(a, u), m;
-			p = m, m = c;
+			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;
 		}
-		return l(a, u), i;
+		return p(a, c), i;
 	}
 };
 function me(e) {
-	let t = a(e ?? fe);
-	if (t !== i.float32 && t !== i.float64) throw Error("SharedSpatialMap must be Float32Array or Float64Array");
+	let t = l(e ?? fe);
+	if (t !== c.float32 && t !== c.float64) throw Error("SharedSpatialMap must be Float32Array or Float64Array");
 	return t;
 }
 function he(e) {
-	return o(e) === 2 ? Float64Array : Float32Array;
+	return u(e) === 2 ? Float64Array : Float32Array;
 }
 function ge(e) {
-	return e === i.float32 ? ie : ae;
+	return e === c.float32 ? ie : ae;
 }
 function $(e) {
 	return e & e - 1 ? -1 : e - 1;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@daneren2005/shared-memory-objects",
-  "version": "1.5.0",
+  "version": "1.5.2",
   "author": "daneren2005@gmail.com",
   "description": "Creating objects with a SharedArrayBuffer",
   "homepage": "https://github.com/daneren2005/shared-memory-objects#readme",