@daneren2005/shared-memory-objects 1.1.0 → 1.3.0

package/dist/{src/shared-list.d.ts → shared-list.d.ts}

@@ -1,13 +1,17 @@
-import { SharedAllocatedMemory } from './allocated-memory';
-import { TypedArrayConstructor } from './interfaces/typed-array-constructor';
-import { default as MemoryHeap } from './memory-heap';
+import type { SharedAllocatedMemory } from './allocated-memory';
+import type { TypedArrayConstructor } from './interfaces/typed-array-constructor';
+import type MemoryHeap from './memory-heap';
 export default class SharedList<T extends Uint32Array | Int32Array | Float32Array = Uint32Array> implements Iterable<SharedListIterable<T>> {
     static readonly ALLOCATE_COUNT = 4;
     private memory;
     private firstBlock;
     private uint16Array;
+    private cachedType;
+    private cachedDataLength;
+    private bufferViews;
     onDelete?: (data: T) => void;
     get length(): number;
+    get usedMemory(): number;
     get type(): number;
     private set type(value);
     get dataLength(): number;
@@ -17,14 +21,16 @@ export default class SharedList<T extends Uint32Array | Int32Array | Float32Arra
     deleteMatch(callback: (values: T, index: number) => boolean): boolean;
     deleteIndex(deleteIndex: number): boolean;
     deleteValue(deleteValues: number | Array<number>): boolean;
+    compact(): void;
     clear(): void;
     [Symbol.iterator](): Generator<{
         data: T;
         index: number;
-        deleteCurrent: () => void;
+        deleteCurrent: () => boolean;
     }, void, unknown>;
     forEach(callback: (data: T) => void): void;
     getSharedMemory(): SharedListMemory;
+    private getBufferView;
     private getDataBlock;
     free(): void;
 }
@@ -39,6 +45,6 @@ interface SharedListMemory {
 interface SharedListIterable<T extends Uint32Array | Int32Array | Float32Array> {
     data: T;
     index: number;
-    deleteCurrent: () => void;
+    deleteCurrent: () => boolean;
 }
 export { type SharedListMemory };

package/dist/shared-list.js

@@ -1,165 +1,163 @@
-import d from "./allocated-memory.js";
-import { loadRawPointer as h, replaceRawPointer as k, getPointer as y, storeRawPointer as b, loadPointer as c, storePointer as A } from "./utils/pointer.js";
-const P = 4, w = 1, n = 2;
-class p {
-  static ALLOCATE_COUNT = P;
-  memory;
-  /* First block
-  	32 index 0
-  	uint16 0 - next buffer position
-  	uint16 1 - next buffer index
-  	32 index 1
-  	uint16 2 - last buffer position
-  	uint16 3 - last buffer index
-  	32 index 2
-  	uint32 4 - length
-  	32 index 3
-  	uint16 6 - type
-  	uint16 7 - data length (defaults to 1 number per data)
-  */
-  /* Other blocks
-  	32 index 0
-  	uint16 0 - next buffer position
-  	uint16 1 - next buffer index
-  	32 index 1 => data
-  */
-  firstBlock;
-  uint16Array;
-  onDelete;
-  get length() {
-    return Atomics.load(this.firstBlock.data, n);
-  }
-  get type() {
-    return Atomics.load(this.uint16Array, 0);
-  }
-  set type(t) {
-    Atomics.store(this.uint16Array, 0, t);
-  }
-  get dataLength() {
-    return Math.max(1, Atomics.load(this.uint16Array, 1));
-  }
-  set dataLength(t) {
-    Atomics.store(this.uint16Array, 1, t);
-  }
-  constructor(t, e) {
-    if (this.memory = t, e && "firstBlock" in e)
-      this.firstBlock = new d(t, e.firstBlock), this.uint16Array = new Uint16Array(this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + (n + 1) * Uint32Array.BYTES_PER_ELEMENT, 2);
-    else {
-      e && e.initWithBlock ? this.firstBlock = new d(t, e.initWithBlock) : this.firstBlock = t.allocUI32(P), this.uint16Array = new Uint16Array(this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + (n + 1) * Uint32Array.BYTES_PER_ELEMENT, 2);
-      const r = e?.type ?? Uint32Array;
-      r === Uint32Array ? this.type = 0 : r === Int32Array ? this.type = 1 : r === Float32Array && (this.type = 2), this.dataLength = e?.dataLength ?? 1;
-    }
-  }
-  insert(t) {
-    typeof t == "number" && (t = [t]);
-    let e = this.dataLength;
-    if (t.length > e)
-      throw new Error(`Can't insert ${t.length} array into shared list of ${e} dataLength`);
-    let r = this.memory.allocUI32(w + e), s = this.getDataBlock(r.data), o = r.pointer;
-    for (let i = 0; i < t.length; i++)
-      s instanceof Int32Array || s instanceof Uint32Array ? Atomics.store(s, i, t[i]) : s[i] = t[i];
-    let a, f = !1;
-    for (; !f; )
-      a = h(this.firstBlock.data, 1), f = k(this.firstBlock.data, 1, o, a);
-    if (a) {
-      let { bufferPosition: i, bufferByteOffset: l } = y(a), B = new Uint32Array(this.memory.buffers[i].buf, l, 1);
-      b(B, 0, o);
-    } else
-      b(this.firstBlock.data, 0, o);
-    Atomics.add(this.firstBlock.data, n, 1);
-  }
-  deleteMatch(t) {
-    for (let { data: e, index: r, deleteCurrent: s } of this)
-      if (t(e, r))
-        return s(), !0;
-    return !1;
-  }
-  deleteIndex(t) {
-    return t >= this.length || t < 0 ? !1 : this.deleteMatch((e, r) => r === t);
-  }
-  deleteValue(t) {
-    return typeof t == "number" ? this.deleteMatch((e) => e[0] === t) : this.deleteMatch((e) => {
-      if (e.length !== t.length)
-        return !1;
-      for (let r = 0; r < e.length; r++)
-        if (e[r] !== t[r])
-          return !1;
-      return !0;
-    });
-  }
-  clear() {
-    let t, e, r = !1;
-    for (; !r; ) {
-      if (t = h(this.firstBlock.data, 0), e = h(this.firstBlock.data, 1), !e)
-        return;
-      r = k(this.firstBlock.data, 1, 0, e);
-    }
-    if (!t)
-      return;
-    k(this.firstBlock.data, 0, 0, t);
-    let s = 0, o = t;
-    for (; o; ) {
-      let { bufferPosition: a, bufferByteOffset: f } = y(o), i = this.memory.buffers[a];
-      if (!i)
-        break;
-      let l = new Uint32Array(i.buf, f, 2);
-      o = h(l, 0), s++, this.onDelete && this.onDelete(this.getDataBlock(l)), i.free(l.byteOffset);
-    }
-    Atomics.sub(this.firstBlock.data, n, s);
-  }
-  *[Symbol.iterator]() {
-    let t = 0, { bufferPosition: e, bufferByteOffset: r } = c(this.firstBlock.data, 0), s = this.firstBlock.data, o = 0, a = 0;
-    for (; r; ) {
-      let f = this.memory.buffers[e];
-      if (!f)
-        return;
-      let i = new Uint32Array(f.buf, r, 2), l = this.getDataBlock(i), B = e, E = r;
-      ({ bufferPosition: e, bufferByteOffset: r } = c(i, 0));
-      let u = !0;
-      yield {
-        data: l,
-        index: t,
-        deleteCurrent: () => {
-          A(s, 0, e, r), r || A(this.firstBlock.data, 1, o, a), this.onDelete && this.onDelete(this.getDataBlock(i)), f.free(i.byteOffset), Atomics.sub(this.firstBlock.data, n, 1), u = !1;
-        }
-      }, u && (s = i, o = B, a = E, t++);
-    }
-  }
-  forEach(t) {
-    for (let e of this)
-      t(e.data);
-  }
-  getSharedMemory() {
-    return {
-      firstBlock: this.firstBlock.getSharedMemory()
-    };
-  }
-  getDataBlock(t) {
-    const e = t.byteOffset + w * t.BYTES_PER_ELEMENT;
-    switch (this.type) {
-      case 1:
-        return new Int32Array(t.buffer, e, this.dataLength);
-      case 0:
-        return new Uint32Array(t.buffer, e, this.dataLength);
-      case 2:
-        return new Float32Array(t.buffer, e, this.dataLength);
-      default:
-        throw new Error(`Unknown data block type ${this.type}`);
-    }
-  }
-  free() {
-    let { bufferPosition: t, bufferByteOffset: e } = c(this.firstBlock.data, 0);
-    for (; e; ) {
-      let r = new d(this.memory, {
-        bufferPosition: t,
-        bufferByteOffset: e
-      });
-      ({ bufferPosition: t, bufferByteOffset: e } = c(r.data, 0)), this.onDelete && this.onDelete(this.getDataBlock(r.data)), r.free();
-    }
-    this.firstBlock.free();
-  }
-}
-export {
-  p as default
+import { loadPointer as e, loadRawPointer as t, replaceRawPointer as n, storeRawPointer as r } from "./utils/pointer.js";
+import i from "./allocated-memory.js";
+//#region src/shared-list.ts
+var a = 4, o = 2, s = o * Uint32Array.BYTES_PER_ELEMENT, c = 0, l = 1, u = 2, d = 0, f = 1, p = 4095, m = class {
+	static ALLOCATE_COUNT = a;
+	memory;
+	firstBlock;
+	uint16Array;
+	cachedType;
+	cachedDataLength;
+	bufferViews = [];
+	onDelete;
+	get length() {
+		return Atomics.load(this.firstBlock.data, u);
+	}
+	get usedMemory() {
+		let t = this.firstBlock.usedMemory, { bufferPosition: n, bufferByteOffset: r } = e(this.firstBlock.data, c);
+		for (; r;) {
+			let a = new i(this.memory, {
+				bufferPosition: n,
+				bufferByteOffset: r
+			});
+			t += a.usedMemory, {bufferPosition: n, bufferByteOffset: r} = e(a.data, d);
+		}
+		return t;
+	}
+	get type() {
+		return this.cachedType;
+	}
+	set type(e) {
+		Atomics.store(this.uint16Array, 0, e);
+	}
+	get dataLength() {
+		return this.cachedDataLength;
+	}
+	set dataLength(e) {
+		Atomics.store(this.uint16Array, 1, e);
+	}
+	constructor(e, t) {
+		if (this.memory = e, t && "firstBlock" in t) this.firstBlock = new i(e, t.firstBlock), this.uint16Array = new Uint16Array(this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + 3 * Uint32Array.BYTES_PER_ELEMENT, 2);
+		else {
+			this.firstBlock = t && t.initWithBlock ? new i(e, t.initWithBlock) : e.allocUI32(a), this.uint16Array = new Uint16Array(this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + 3 * Uint32Array.BYTES_PER_ELEMENT, 2), r(this.firstBlock.data, l, this.firstBlock.pointer);
+			let n = t?.type ?? Uint32Array;
+			n === Uint32Array ? this.type = 0 : n === Int32Array ? this.type = 1 : n === Float32Array && (this.type = 2), this.dataLength = t?.dataLength ?? 1;
+		}
+		this.cachedType = Atomics.load(this.uint16Array, 0), this.cachedDataLength = Math.max(1, Atomics.load(this.uint16Array, 1));
+	}
+	insert(e) {
+		typeof e == "number" && (e = [e]);
+		let r = this.cachedDataLength;
+		if (e.length > r) throw Error(`Can't insert ${e.length} array into shared list of ${r} dataLength`);
+		let i = this.memory.allocUI32(o + r), a = this.getDataBlock(i.data.buffer, i.data.byteOffset), s = i.pointer;
+		for (let t = 0; t < e.length; t++) a instanceof Int32Array || a instanceof Uint32Array ? Atomics.store(a, t, e[t]) : a[t] = e[t];
+		for (;;) {
+			let e = t(this.firstBlock.data, l), r = this.getBufferView(e & p);
+			if (!r) continue;
+			let i = (e >>> 12 >>> 2) + d, a = Atomics.load(r, i);
+			if (e === t(this.firstBlock.data, l)) {
+				if (a === 0) {
+					if (Atomics.compareExchange(r, i, 0, s) === 0) {
+						n(this.firstBlock.data, l, s, e);
+						break;
+					}
+				} else n(this.firstBlock.data, l, a, e);
+			}
+		}
+		Atomics.add(this.firstBlock.data, u, 1);
+	}
+	deleteMatch(e) {
+		for (let { data: t, index: n, deleteCurrent: r } of this) if (e(t, n) && r()) return !0;
+		return !1;
+	}
+	deleteIndex(e) {
+		if (e >= this.length || e < 0) return !1;
+		for (let t of this) if (t.index === e && t.deleteCurrent()) return !0;
+		return !1;
+	}
+	deleteValue(e) {
+		return typeof e == "number" ? this.deleteMatch((t) => t[0] === e) : this.deleteMatch((t) => {
+			if (t.length !== e.length) return !1;
+			for (let n = 0; n < t.length; n++) if (t[n] !== e[n]) return !1;
+			return !0;
+		});
+	}
+	compact() {
+		let e = this.firstBlock.pointer, n = this.firstBlock.data, i = d, a = t(n, i);
+		for (; a;) {
+			let t = a & p, o = this.memory.buffers[t];
+			if (!o) break;
+			let s = this.getBufferView(t), c = a >>> 12, l = c >>> 2, u = Atomics.load(s, l + d);
+			Atomics.load(s, l + f) ? (r(n, i, u), o.free(c)) : (e = a, n = s, i = l + d), a = u;
+		}
+		r(this.firstBlock.data, l, e);
+	}
+	clear() {
+		let e, i = !1;
+		for (; !i;) {
+			if (e = t(this.firstBlock.data, c), !e) return;
+			i = n(this.firstBlock.data, c, 0, e);
+		}
+		if (!e) return;
+		r(this.firstBlock.data, l, this.firstBlock.pointer);
+		let a = 0, o = e;
+		for (; o;) {
+			let e = o & p, t = this.memory.buffers[e];
+			if (!t) break;
+			let n = this.getBufferView(e), r = o >>> 12, i = r >>> 2;
+			o = Atomics.load(n, i + d), Atomics.load(n, i + f) || (a++, this.onDelete && this.onDelete(this.getDataBlock(n.buffer, r))), t.free(r);
+		}
+		Atomics.sub(this.firstBlock.data, u, a);
+	}
+	*[Symbol.iterator]() {
+		let e = 0, n = t(this.firstBlock.data, c);
+		for (; n;) {
+			let t = n & p, r = this.getBufferView(t);
+			if (!r) return;
+			let i = n >>> 12, a = i >>> 2;
+			if (n = Atomics.load(r, a + d), Atomics.load(r, a + f)) continue;
+			let o = r.buffer, s = a + f;
+			yield {
+				data: this.getDataBlock(o, i),
+				index: e,
+				deleteCurrent: () => Atomics.compareExchange(r, s, 0, 1) === 0 && (Atomics.sub(this.firstBlock.data, u, 1), this.onDelete && this.onDelete(this.getDataBlock(o, i)), !0)
+			}, e++;
+		}
+	}
+	forEach(e) {
+		for (let t of this) e(t.data);
+	}
+	getSharedMemory() {
+		return { firstBlock: this.firstBlock.getSharedMemory() };
+	}
+	getBufferView(e) {
+		let t = this.bufferViews[e];
+		if (t) return t;
+		let n = this.memory.buffers[e];
+		if (n) return t = new Uint32Array(n.buf), this.bufferViews[e] = t, t;
+	}
+	getDataBlock(e, t) {
+		let n = t + s;
+		switch (this.cachedType) {
+			case 1: return new Int32Array(e, n, this.cachedDataLength);
+			case 0: return new Uint32Array(e, n, this.cachedDataLength);
+			case 2: return new Float32Array(e, n, this.cachedDataLength);
+			default: throw Error(`Unknown data block type ${this.cachedType}`);
+		}
+	}
+	free() {
+		let { bufferPosition: t, bufferByteOffset: n } = e(this.firstBlock.data, c);
+		for (; n;) {
+			let r = new i(this.memory, {
+				bufferPosition: t,
+				bufferByteOffset: n
+			});
+			({bufferPosition: t, bufferByteOffset: n} = e(r.data, d)), this.onDelete && !Atomics.load(r.data, f) && this.onDelete(this.getDataBlock(r.data.buffer, r.data.byteOffset)), r.free();
+		}
+		this.firstBlock.free();
+	}
 };
-//# sourceMappingURL=shared-list.js.map
+//#endregion
+export { m as default };
+
+//# sourceMappingURL=shared-list.js.map

package/dist/shared-list.js.map

@@ -1 +1 @@
-{"version":3,"file":"shared-list.js","sources":["../src/shared-list.ts"],"sourcesContent":["import type { SharedAllocatedMemory } from './allocated-memory';\nimport AllocatedMemory from './allocated-memory';\nimport type { TypedArrayConstructor } from './interfaces/typed-array-constructor';\nimport type MemoryHeap from './memory-heap';\nimport { getPointer, loadPointer, loadRawPointer, replaceRawPointer, storePointer, storeRawPointer } from './utils/pointer';\n\nenum TYPE {\n\tuint32,\n\tint32,\n\tfloat32\n}\n\n// TODO: We need some sort of locking on insert/deletes!\nconst FIRST_BLOCK_RECORD_KEEPING_COUNT = 4;\nconst DATA_BLOCK_RECORD_KEEPING_COUNT = 1;\nconst LENGTH_INDEX = 2;\nexport default class SharedList<T extends Uint32Array | Int32Array | Float32Array = Uint32Array> implements Iterable<SharedListIterable<T>> {\n\tstatic readonly ALLOCATE_COUNT = FIRST_BLOCK_RECORD_KEEPING_COUNT;\n\n\tprivate memory: MemoryHeap;\n\t/* First block\n\t\t32 index 0\n\t\tuint16 0 - next buffer position\n\t\tuint16 1 - next buffer index\n\t\t32 index 1\n\t\tuint16 2 - last buffer position\n\t\tuint16 3 - last buffer index\n\t\t32 index 2\n\t\tuint32 4 - length\n\t\t32 index 3\n\t\tuint16 6 - type\n\t\tuint16 7 - data length (defaults to 1 number per data)\n\t*/\n\t/* Other blocks\n\t\t32 index 0\n\t\tuint16 0 - next buffer position\n\t\tuint16 1 - next buffer index\n\t\t32 index 1 => data\n\t*/\n\tprivate firstBlock: AllocatedMemory;\n\tprivate uint16Array: Uint16Array;\n\tonDelete?: (data: T) => void;\n\n\tget length(): number {\n\t\treturn Atomics.load(this.firstBlock.data, LENGTH_INDEX);\n\t}\n\t\n\tget type(): number {\n\t\treturn Atomics.load(this.uint16Array, 0);\n\t}\n\tprivate set type(value: number) {\n\t\tAtomics.store(this.uint16Array, 0, value);\n\t}\n\tget dataLength(): number {\n\t\t// Can technically be initialized by passing memory without actually every being called - need to make sure dataLength is always at least one\n\t\treturn Math.max(1, Atomics.load(this.uint16Array, 1));\n\t}\n\tprivate set dataLength(value: number) {\n\t\tAtomics.store(this.uint16Array, 1, value);\n\t}\n\n\tconstructor(memory: MemoryHeap, config?: SharedListConfig<T> | SharedListMemory) {\n\t\tthis.memory = memory;\n\n\t\tif(config && 'firstBlock' in config) {\n\t\t\t// TODO: How to handle referencing memory we don't have access to yet because buffer not synced from worker?\n\t\t\tthis.firstBlock = new AllocatedMemory(memory, config.firstBlock);\n\t\t\tthis.uint16Array = new Uint16Array(this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + (LENGTH_INDEX + 1) * Uint32Array.BYTES_PER_ELEMENT, 2);\n\t\t} else {\n\t\t\tif(config && config.initWithBlock) {\n\t\t\t\tthis.firstBlock = new AllocatedMemory(memory, config.initWithBlock);\n\t\t\t} else {\n\t\t\t\tthis.firstBlock = memory.allocUI32(FIRST_BLOCK_RECORD_KEEPING_COUNT);\n\t\t\t}\n\t\t\tthis.uint16Array = new Uint16Array(this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + (LENGTH_INDEX + 1) * Uint32Array.BYTES_PER_ELEMENT, 2);\n\n\t\t\tconst type = config?.type ?? Uint32Array;\n\t\t\tif(type === Uint32Array) {\n\t\t\t\tthis.type = TYPE.uint32;\n\t\t\t}\n\t\t\t// @ts-expect-error\n\t\t\telse if(type === Int32Array) {\n\t\t\t\tthis.type = TYPE.int32;\n\t\t\t}\n\t\t\t// @ts-expect-error\n\t\t\telse if(type === Float32Array) {\n\t\t\t\tthis.type = TYPE.float32;\n\t\t\t}\n\t\t\tthis.dataLength = config?.dataLength ?? 1;\n\t\t}\n\t}\n\n\tinsert(values: number | Array<number>) {\n\t\tif(typeof values === 'number') {\n\t\t\tvalues = [values];\n\t\t}\n\n\t\tlet dataLength = this.dataLength;\n\t\tif(values.length > dataLength) {\n\t\t\tthrow new Error(`Can't insert ${values.length} array into shared list of ${dataLength} dataLength`);\n\t\t}\n\t\tlet newBlock = this.memory.allocUI32(DATA_BLOCK_RECORD_KEEPING_COUNT + dataLength);\n\t\tlet newData = this.getDataBlock(newBlock.data);\n\t\tlet newBlockPointer = newBlock.pointer;\n\t\t\n\t\tfor(let i = 0; i < values.length; i++) {\n\t\t\tif(newData instanceof Int32Array || newData instanceof Uint32Array) {\n\t\t\t\tAtomics.store(newData, i, values[i]);\n\t\t\t} else {\n\t\t\t\t// TODO: Should we replace with pass thru float32 conversion -> store?\n\t\t\t\tnewData[i] = values[i];\n\t\t\t}\n\t\t}\n\n\t\tlet lastBlockPointer;\n\t\tlet updateWorked = false;\n\t\twhile(!updateWorked) {\n\t\t\tlastBlockPointer = loadRawPointer(this.firstBlock.data, 1);\n\t\t\tupdateWorked = replaceRawPointer(this.firstBlock.data, 1, newBlockPointer, lastBlockPointer);\n\t\t}\n\n\t\tif(lastBlockPointer) {\n\t\t\tlet { bufferPosition: lastBlockPosition, bufferByteOffset: lastBlockByteOffset } = getPointer(lastBlockPointer);\n\t\t\t// TODO: How to handle referencing memory we don't have access to yet because buffer not synced from worker?\n\t\t\tlet lastBlock = new Uint32Array(this.memory.buffers[lastBlockPosition].buf, lastBlockByteOffset, 1);\n\t\t\tstoreRawPointer(lastBlock, 0, newBlockPointer);\n\t\t} else {\n\t\t\t// First item - store on first block\n\t\t\tstoreRawPointer(this.firstBlock.data, 0, newBlockPointer);\n\t\t}\n\t\t\n\t\t// Always update new last buffer position and length\n\t\tAtomics.add(this.firstBlock.data, LENGTH_INDEX, 1);\n\t}\n\n\tdeleteMatch(callback: (values: T, index: number) => boolean): boolean {\n\t\tfor(let { data, index, deleteCurrent } of this) {\n\t\t\tif(callback(data, index)) {\n\t\t\t\tdeleteCurrent();\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\n\t\treturn false;\n\t}\n\tdeleteIndex(deleteIndex: number): boolean {\n\t\tif(deleteIndex >= this.length || deleteIndex < 0) {\n\t\t\treturn false;\n\t\t}\n\n\t\treturn this.deleteMatch((values, index) => index === deleteIndex);\n\t}\n\tdeleteValue(deleteValues: number | Array<number>) {\n\t\tif(typeof deleteValues === 'number') {\n\t\t\treturn this.deleteMatch(values => values[0] === deleteValues);\n\t\t} else {\n\t\t\treturn this.deleteMatch(values => {\n\t\t\t\tif(values.length !== deleteValues.length) {\n\t\t\t\t\treturn false;\n\t\t\t\t} else {\n\t\t\t\t\tfor(let i = 0; i < values.length; i++) {\n\t\t\t\t\t\tif(values[i] !== deleteValues[i]) {\n\t\t\t\t\t\t\treturn false;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t});\n\t\t}\n\t}\n\n\tclear() {\n\t\tlet firstBlockPointer, lastBlockPointer;\n\t\tlet updateWorked = false;\n\t\twhile(!updateWorked) {\n\t\t\tfirstBlockPointer = loadRawPointer(this.firstBlock.data, 0);\n\t\t\tlastBlockPointer = loadRawPointer(this.firstBlock.data, 1);\n\t\t\t// Already cleared\n\t\t\tif(!lastBlockPointer) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tupdateWorked = replaceRawPointer(this.firstBlock.data, 1, 0, lastBlockPointer);\n\t\t}\n\t\t\n\t\t// Shouldn't be possible to hit: making Typescript happy\n\t\tif(!firstBlockPointer) {\n\t\t\treturn;\n\t\t}\n\n\t\t// We only want to update the last block if this is ran before something new was inserted\n\t\treplaceRawPointer(this.firstBlock.data, 0, 0, firstBlockPointer);\n\n\t\t// Iterate through  inaccessible nodes and delete them\n\t\tlet deletedItems = 0;\n\t\tlet nextBlockPointer = firstBlockPointer;\n\t\twhile(nextBlockPointer) {\n\t\t\tlet { bufferPosition: nextBlockPosition, bufferByteOffset: nextBlockByteOffset } = getPointer(nextBlockPointer);\n\t\t\tlet memPool = this.memory.buffers[nextBlockPosition];\n\t\t\t// Short circuit iterations if we can't access memory\n\t\t\tif(!memPool) {\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tlet blockRecord = new Uint32Array(memPool.buf, nextBlockByteOffset, 2);\n\t\t\tnextBlockPointer = loadRawPointer(blockRecord, 0);\n\t\t\tdeletedItems++;\n\n\t\t\tif(this.onDelete) {\n\t\t\t\tthis.onDelete(this.getDataBlock(blockRecord));\n\t\t\t}\n\n\t\t\tmemPool.free(blockRecord.byteOffset);\n\t\t}\n\t\t\n\t\t// Subtract by however many we deleted so that a insert during this operation is accurate\n\t\tAtomics.sub(this.firstBlock.data, LENGTH_INDEX, deletedItems);\n\t}\n\n\t*[Symbol.iterator]() {\n\t\tlet currentIndex = 0;\n\t\tlet { bufferPosition: nextBlockPosition, bufferByteOffset: nextBlockByteOffset } = loadPointer(this.firstBlock.data, 0);\n\t\tlet lastBlockData = this.firstBlock.data;\n\t\tlet lastBlockPosition = 0;\n\t\tlet lastBlockByteOffset = 0;\n\t\twhile(nextBlockByteOffset) {\n\t\t\tlet memPool = this.memory.buffers[nextBlockPosition];\n\t\t\t// Short circuit iterations if we can't access memory\n\t\t\tif(!memPool) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tlet blockRecord = new Uint32Array(memPool.buf, nextBlockByteOffset, 2);\n\t\t\tlet blockData = this.getDataBlock(blockRecord);\n\n\t\t\tlet currentBlockPosition = nextBlockPosition;\n\t\t\tlet currentBlockByteOffset = nextBlockByteOffset;\n\t\t\t({ bufferPosition: nextBlockPosition, bufferByteOffset: nextBlockByteOffset } = loadPointer(blockRecord, 0));\n\n\t\t\tlet updateLastBlock = true;\n\t\t\tyield {\n\t\t\t\tdata: blockData,\n\t\t\t\tindex: currentIndex,\n\t\t\t\tdeleteCurrent: () => {\n\t\t\t\t\t// Move previous index to point to one after\n\t\t\t\t\tstorePointer(lastBlockData, 0, nextBlockPosition, nextBlockByteOffset);\n\n\t\t\t\t\t// If this is the last item, update last block to be previous location\n\t\t\t\t\tif(!nextBlockByteOffset) {\n\t\t\t\t\t\tstorePointer(this.firstBlock.data, 1, lastBlockPosition, lastBlockByteOffset);\n\t\t\t\t\t}\n\n\t\t\t\t\tif(this.onDelete) {\n\t\t\t\t\t\tthis.onDelete(this.getDataBlock(blockRecord));\n\t\t\t\t\t}\n\n\t\t\t\t\tmemPool.free(blockRecord.byteOffset);\n\t\t\t\t\tAtomics.sub(this.firstBlock.data, LENGTH_INDEX, 1);\n\t\t\t\t\tupdateLastBlock = false;\n\t\t\t\t}\n\t\t\t};\n\n\t\t\tif(updateLastBlock) {\n\t\t\t\tlastBlockData = blockRecord;\n\t\t\t\tlastBlockPosition = currentBlockPosition;\n\t\t\t\tlastBlockByteOffset = currentBlockByteOffset;\n\t\t\t\tcurrentIndex++;\n\t\t\t}\n\t\t}\n\t}\n\n\tforEach(callback: (data: T) => void) {\n\t\tfor(let value of this) {\n\t\t\tcallback(value.data);\n\t\t}\n\t}\n\n\tgetSharedMemory(): SharedListMemory {\n\t\treturn {\n\t\t\tfirstBlock: this.firstBlock.getSharedMemory()\n\t\t};\n\t}\n\n\tprivate getDataBlock(memory: Uint32Array): T {\n\t\tconst startIndex = memory.byteOffset + DATA_BLOCK_RECORD_KEEPING_COUNT * memory.BYTES_PER_ELEMENT;\n\n\t\tswitch(this.type) {\n\t\t\tcase TYPE.int32:\n\t\t\t\treturn new Int32Array(memory.buffer, startIndex, this.dataLength) as T;\n\t\t\tcase TYPE.uint32:\n\t\t\t\treturn new Uint32Array(memory.buffer, startIndex, this.dataLength) as T;\n\t\t\tcase TYPE.float32:\n\t\t\t\treturn new Float32Array(memory.buffer, startIndex, this.dataLength) as T;\n\t\t\tdefault:\n\t\t\t\tthrow new Error(`Unknown data block type ${this.type}`);\n\t\t}\n\t}\n\n\tfree() {\n\t\tlet { bufferPosition: nextBlockPosition, bufferByteOffset: nextBlockByteOffset } = loadPointer(this.firstBlock.data, 0);\n\t\twhile(nextBlockByteOffset) {\n\t\t\tlet allocatedMemory = new AllocatedMemory(this.memory, {\n\t\t\t\tbufferPosition: nextBlockPosition,\n\t\t\t\tbufferByteOffset: nextBlockByteOffset\n\t\t\t});\n\n\t\t\t({ bufferPosition: nextBlockPosition, bufferByteOffset: nextBlockByteOffset } = loadPointer(allocatedMemory.data, 0));\n\n\t\t\tif(this.onDelete) {\n\t\t\t\tthis.onDelete(this.getDataBlock(allocatedMemory.data));\n\t\t\t}\n\n\t\t\tallocatedMemory.free();\n\t\t}\n\n\t\tthis.firstBlock.free();\n\t}\n}\n\ninterface SharedListConfig<T extends Uint32Array | Int32Array | Float32Array> {\n\tinitWithBlock?: SharedAllocatedMemory\n\ttype?: TypedArrayConstructor<T>\n\tdataLength?: number\n}\ninterface SharedListMemory {\n\tfirstBlock: SharedAllocatedMemory\n}\n\ninterface SharedListIterable<T extends Uint32Array | Int32Array | Float32Array> {\n\tdata: T\n\tindex: number\n\tdeleteCurrent: () => void\n}\n\nexport { type SharedListMemory };"],"names":["FIRST_BLOCK_RECORD_KEEPING_COUNT","DATA_BLOCK_RECORD_KEEPING_COUNT","LENGTH_INDEX","SharedList","value","memory","config","AllocatedMemory","type","values","dataLength","newBlock","newData","newBlockPointer","lastBlockPointer","updateWorked","loadRawPointer","replaceRawPointer","lastBlockPosition","lastBlockByteOffset","getPointer","lastBlock","storeRawPointer","callback","data","index","deleteCurrent","deleteIndex","deleteValues","i","firstBlockPointer","deletedItems","nextBlockPointer","nextBlockPosition","nextBlockByteOffset","memPool","blockRecord","currentIndex","loadPointer","lastBlockData","blockData","currentBlockPosition","currentBlockByteOffset","updateLastBlock","storePointer","startIndex","allocatedMemory"],"mappings":";;AAaA,MAAMA,IAAmC,GACnCC,IAAkC,GAClCC,IAAe;AACrB,MAAqBC,EAAuH;AAAA,EAC3I,OAAgB,iBAAiBH;AAAA,EAEzB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAoBA;AAAA,EACA;AAAA,EACR;AAAA,EAEA,IAAI,SAAiB;AACpB,WAAO,QAAQ,KAAK,KAAK,WAAW,MAAME,CAAY;AAAA,EACvD;AAAA,EAEA,IAAI,OAAe;AAClB,WAAO,QAAQ,KAAK,KAAK,aAAa,CAAC;AAAA,EACxC;AAAA,EACA,IAAY,KAAKE,GAAe;AAC/B,YAAQ,MAAM,KAAK,aAAa,GAAGA,CAAK;AAAA,EACzC;AAAA,EACA,IAAI,aAAqB;AAExB,WAAO,KAAK,IAAI,GAAG,QAAQ,KAAK,KAAK,aAAa,CAAC,CAAC;AAAA,EACrD;AAAA,EACA,IAAY,WAAWA,GAAe;AACrC,YAAQ,MAAM,KAAK,aAAa,GAAGA,CAAK;AAAA,EACzC;AAAA,EAEA,YAAYC,GAAoBC,GAAiD;AAGhF,QAFA,KAAK,SAASD,GAEXC,KAAU,gBAAgBA;AAE5B,WAAK,aAAa,IAAIC,EAAgBF,GAAQC,EAAO,UAAU,GAC/D,KAAK,cAAc,IAAI,YAAY,KAAK,WAAW,KAAK,QAAQ,KAAK,WAAW,oBAAoBJ,IAAe,KAAK,YAAY,mBAAmB,CAAC;AAAA,SAClJ;AACN,MAAGI,KAAUA,EAAO,gBACnB,KAAK,aAAa,IAAIC,EAAgBF,GAAQC,EAAO,aAAa,IAElE,KAAK,aAAaD,EAAO,UAAUL,CAAgC,GAEpE,KAAK,cAAc,IAAI,YAAY,KAAK,WAAW,KAAK,QAAQ,KAAK,WAAW,oBAAoBE,IAAe,KAAK,YAAY,mBAAmB,CAAC;AAExJ,YAAMM,IAAOF,GAAQ,QAAQ;AAC7B,MAAGE,MAAS,cACX,KAAK,OAAO,IAGLA,MAAS,aAChB,KAAK,OAAO,IAGLA,MAAS,iBAChB,KAAK,OAAO,IAEb,KAAK,aAAaF,GAAQ,cAAc;AAAA,IACzC;AAAA,EACD;AAAA,EAEA,OAAOG,GAAgC;AACtC,IAAG,OAAOA,KAAW,aACpBA,IAAS,CAACA,CAAM;AAGjB,QAAIC,IAAa,KAAK;AACtB,QAAGD,EAAO,SAASC;AAClB,YAAM,IAAI,MAAM,gBAAgBD,EAAO,MAAM,8BAA8BC,CAAU,aAAa;AAEnG,QAAIC,IAAW,KAAK,OAAO,UAAUV,IAAkCS,CAAU,GAC7EE,IAAU,KAAK,aAAaD,EAAS,IAAI,GACzCE,IAAkBF,EAAS;AAE/B,aAAQ,IAAI,GAAG,IAAIF,EAAO,QAAQ;AACjC,MAAGG,aAAmB,cAAcA,aAAmB,cACtD,QAAQ,MAAMA,GAAS,GAAGH,EAAO,CAAC,CAAC,IAGnCG,EAAQ,CAAC,IAAIH,EAAO,CAAC;AAIvB,QAAIK,GACAC,IAAe;AACnB,WAAM,CAACA;AACN,MAAAD,IAAmBE,EAAe,KAAK,WAAW,MAAM,CAAC,GACzDD,IAAeE,EAAkB,KAAK,WAAW,MAAM,GAAGJ,GAAiBC,CAAgB;AAG5F,QAAGA,GAAkB;AACpB,UAAI,EAAE,gBAAgBI,GAAmB,kBAAkBC,EAAA,IAAwBC,EAAWN,CAAgB,GAE1GO,IAAY,IAAI,YAAY,KAAK,OAAO,QAAQH,CAAiB,EAAE,KAAKC,GAAqB,CAAC;AAClG,MAAAG,EAAgBD,GAAW,GAAGR,CAAe;AAAA,IAC9C;AAEC,MAAAS,EAAgB,KAAK,WAAW,MAAM,GAAGT,CAAe;AAIzD,YAAQ,IAAI,KAAK,WAAW,MAAMX,GAAc,CAAC;AAAA,EAClD;AAAA,EAEA,YAAYqB,GAA0D;AACrE,aAAQ,EAAE,MAAAC,GAAM,OAAAC,GAAO,eAAAC,EAAA,KAAmB;AACzC,UAAGH,EAASC,GAAMC,CAAK;AACtB,eAAAC,EAAA,GACO;AAIT,WAAO;AAAA,EACR;AAAA,EACA,YAAYC,GAA8B;AACzC,WAAGA,KAAe,KAAK,UAAUA,IAAc,IACvC,KAGD,KAAK,YAAY,CAAClB,GAAQgB,MAAUA,MAAUE,CAAW;AAAA,EACjE;AAAA,EACA,YAAYC,GAAsC;AACjD,WAAG,OAAOA,KAAiB,WACnB,KAAK,YAAY,CAAAnB,MAAUA,EAAO,CAAC,MAAMmB,CAAY,IAErD,KAAK,YAAY,CAAAnB,MAAU;AACjC,UAAGA,EAAO,WAAWmB,EAAa;AACjC,eAAO;AAEP,eAAQC,IAAI,GAAGA,IAAIpB,EAAO,QAAQoB;AACjC,YAAGpB,EAAOoB,CAAC,MAAMD,EAAaC,CAAC;AAC9B,iBAAO;AAIT,aAAO;AAAA,IAET,CAAC;AAAA,EAEH;AAAA,EAEA,QAAQ;AACP,QAAIC,GAAmBhB,GACnBC,IAAe;AACnB,WAAM,CAACA,KAAc;AAIpB,UAHAe,IAAoBd,EAAe,KAAK,WAAW,MAAM,CAAC,GAC1DF,IAAmBE,EAAe,KAAK,WAAW,MAAM,CAAC,GAEtD,CAACF;AACH;AAGD,MAAAC,IAAeE,EAAkB,KAAK,WAAW,MAAM,GAAG,GAAGH,CAAgB;AAAA,IAC9E;AAGA,QAAG,CAACgB;AACH;AAID,IAAAb,EAAkB,KAAK,WAAW,MAAM,GAAG,GAAGa,CAAiB;AAG/D,QAAIC,IAAe,GACfC,IAAmBF;AACvB,WAAME,KAAkB;AACvB,UAAI,EAAE,gBAAgBC,GAAmB,kBAAkBC,EAAA,IAAwBd,EAAWY,CAAgB,GAC1GG,IAAU,KAAK,OAAO,QAAQF,CAAiB;AAEnD,UAAG,CAACE;AACH;AAGD,UAAIC,IAAc,IAAI,YAAYD,EAAQ,KAAKD,GAAqB,CAAC;AACrE,MAAAF,IAAmBhB,EAAeoB,GAAa,CAAC,GAChDL,KAEG,KAAK,YACP,KAAK,SAAS,KAAK,aAAaK,CAAW,CAAC,GAG7CD,EAAQ,KAAKC,EAAY,UAAU;AAAA,IACpC;AAGA,YAAQ,IAAI,KAAK,WAAW,MAAMlC,GAAc6B,CAAY;AAAA,EAC7D;AAAA,EAEA,EAAE,OAAO,QAAQ,IAAI;AACpB,QAAIM,IAAe,GACf,EAAE,gBAAgBJ,GAAmB,kBAAkBC,EAAA,IAAwBI,EAAY,KAAK,WAAW,MAAM,CAAC,GAClHC,IAAgB,KAAK,WAAW,MAChCrB,IAAoB,GACpBC,IAAsB;AAC1B,WAAMe,KAAqB;AAC1B,UAAIC,IAAU,KAAK,OAAO,QAAQF,CAAiB;AAEnD,UAAG,CAACE;AACH;AAGD,UAAIC,IAAc,IAAI,YAAYD,EAAQ,KAAKD,GAAqB,CAAC,GACjEM,IAAY,KAAK,aAAaJ,CAAW,GAEzCK,IAAuBR,GACvBS,IAAyBR;AAC7B,OAAC,EAAE,gBAAgBD,GAAmB,kBAAkBC,MAAwBI,EAAYF,GAAa,CAAC;AAE1G,UAAIO,IAAkB;AACtB,YAAM;AAAA,QACL,MAAMH;AAAA,QACN,OAAOH;AAAA,QACP,eAAe,MAAM;AAEpB,UAAAO,EAAaL,GAAe,GAAGN,GAAmBC,CAAmB,GAGjEA,KACHU,EAAa,KAAK,WAAW,MAAM,GAAG1B,GAAmBC,CAAmB,GAG1E,KAAK,YACP,KAAK,SAAS,KAAK,aAAaiB,CAAW,CAAC,GAG7CD,EAAQ,KAAKC,EAAY,UAAU,GACnC,QAAQ,IAAI,KAAK,WAAW,MAAMlC,GAAc,CAAC,GACjDyC,IAAkB;AAAA,QACnB;AAAA,MAAA,GAGEA,MACFJ,IAAgBH,GAChBlB,IAAoBuB,GACpBtB,IAAsBuB,GACtBL;AAAA,IAEF;AAAA,EACD;AAAA,EAEA,QAAQd,GAA6B;AACpC,aAAQnB,KAAS;AAChB,MAAAmB,EAASnB,EAAM,IAAI;AAAA,EAErB;AAAA,EAEA,kBAAoC;AACnC,WAAO;AAAA,MACN,YAAY,KAAK,WAAW,gBAAA;AAAA,IAAgB;AAAA,EAE9C;AAAA,EAEQ,aAAaC,GAAwB;AAC5C,UAAMwC,IAAaxC,EAAO,aAAaJ,IAAkCI,EAAO;AAEhF,YAAO,KAAK,MAAA;AAAA,MACX,KAAK;AACJ,eAAO,IAAI,WAAWA,EAAO,QAAQwC,GAAY,KAAK,UAAU;AAAA,MACjE,KAAK;AACJ,eAAO,IAAI,YAAYxC,EAAO,QAAQwC,GAAY,KAAK,UAAU;AAAA,MAClE,KAAK;AACJ,eAAO,IAAI,aAAaxC,EAAO,QAAQwC,GAAY,KAAK,UAAU;AAAA,MACnE;AACC,cAAM,IAAI,MAAM,2BAA2B,KAAK,IAAI,EAAE;AAAA,IAAA;AAAA,EAEzD;AAAA,EAEA,OAAO;AACN,QAAI,EAAE,gBAAgBZ,GAAmB,kBAAkBC,EAAA,IAAwBI,EAAY,KAAK,WAAW,MAAM,CAAC;AACtH,WAAMJ,KAAqB;AAC1B,UAAIY,IAAkB,IAAIvC,EAAgB,KAAK,QAAQ;AAAA,QACtD,gBAAgB0B;AAAA,QAChB,kBAAkBC;AAAA,MAAA,CAClB;AAED,OAAC,EAAE,gBAAgBD,GAAmB,kBAAkBC,MAAwBI,EAAYQ,EAAgB,MAAM,CAAC,IAEhH,KAAK,YACP,KAAK,SAAS,KAAK,aAAaA,EAAgB,IAAI,CAAC,GAGtDA,EAAgB,KAAA;AAAA,IACjB;AAEA,SAAK,WAAW,KAAA;AAAA,EACjB;AACD;"}
+{"version":3,"file":"shared-list.js","names":[],"sources":["../src/shared-list.ts"],"sourcesContent":["import type { SharedAllocatedMemory } from './allocated-memory';\nimport AllocatedMemory from './allocated-memory';\nimport type { TypedArrayConstructor } from './interfaces/typed-array-constructor';\nimport type MemoryHeap from './memory-heap';\nimport { loadPointer, loadRawPointer, POSITION_BIT_COUNT, replaceRawPointer, storeRawPointer } from './utils/pointer';\n\nenum TYPE {\n\tuint32,\n\tint32,\n\tfloat32,\n}\n\n// Lock-free singly-linked list. firstBlock doubles as an immortal sentinel node whose next pointer (index 0) is the head.\n// insert appends with a Michael-Scott CAS enqueue; delete only tombstones a node (never unlinks/frees). Memory is\n// reclaimed exclusively by the quiescent compact()/clear()/free() passes. That deferral is what makes the CAS loops\n// safe without hazard pointers: a live node's address is never handed back to the allocator, so no append can ever\n// observe a recycled address (ABA) while another thread is mid-traversal.\nconst FIRST_BLOCK_RECORD_KEEPING_COUNT = 4;\nconst DATA_BLOCK_RECORD_KEEPING_COUNT = 2;\nconst DATA_BLOCK_BYTE_OFFSET = DATA_BLOCK_RECORD_KEEPING_COUNT * Uint32Array.BYTES_PER_ELEMENT;\nconst HEAD_INDEX = 0;\nconst TAIL_INDEX = 1;\nconst LENGTH_INDEX = 2;\nconst NODE_NEXT_INDEX = 0;\nconst NODE_DELETED_INDEX = 1;\n// A pointer packs the buffer position in its low bits and the byte offset in the high bits (see utils/pointer)\nconst POSITION_MASK = (1 << POSITION_BIT_COUNT) - 1;\nexport default class SharedList<T extends Uint32Array | Int32Array | Float32Array = Uint32Array> implements Iterable<SharedListIterable<T>> {\n\tstatic readonly ALLOCATE_COUNT = FIRST_BLOCK_RECORD_KEEPING_COUNT;\n\n\tprivate memory: MemoryHeap;\n\t/* First block (also the sentinel node - index 0 is its next pointer = list head)\n\t\t32 index 0\n\t\tuint16 0 - head buffer position    | sentinel.next\n\t\tuint16 1 - head buffer index\n\t\t32 index 1\n\t\tuint16 2 - tail hint buffer position\n\t\tuint16 3 - tail hint buffer index\n\t\t32 index 2\n\t\tuint32 4 - length\n\t\t32 index 3\n\t\tuint16 6 - type\n\t\tuint16 7 - data length (defaults to 1 number per data)\n\t*/\n\t/* Other blocks\n\t\t32 index 0 - next buffer pointer\n\t\t32 index 1 - deleted flag (0 = live, 1 = tombstoned)\n\t\t32 index 2 => data\n\t*/\n\tprivate firstBlock: AllocatedMemory;\n\tprivate uint16Array: Uint16Array;\n\t// type and dataLength are written once at init and never change, so cache them instead of atomic-loading per node\n\tprivate cachedType: number;\n\tprivate cachedDataLength: number;\n\t// One full-buffer Uint32Array per buffer position, so traversal indexes shared memory directly instead of\n\t// allocating a fresh view (and a getPointer object) for every node it touches\n\tprivate bufferViews: Array<Uint32Array> = [];\n\tonDelete?: (data: T) => void;\n\n\tget length(): number {\n\t\treturn Atomics.load(this.firstBlock.data, LENGTH_INDEX);\n\t}\n\n\t// Own internal memory plus every allocated node still linked in the chain (tombstoned nodes included, since they stay\n\t// allocated until a compact()/clear() reclaims them).\n\tget usedMemory(): number {\n\t\tlet total = this.firstBlock.usedMemory;\n\t\tlet { bufferPosition, bufferByteOffset } = loadPointer(this.firstBlock.data, HEAD_INDEX);\n\t\twhile(bufferByteOffset) {\n\t\t\tlet node = new AllocatedMemory(this.memory, { bufferPosition, bufferByteOffset });\n\t\t\ttotal += node.usedMemory;\n\t\t\t({ bufferPosition, bufferByteOffset } = loadPointer(node.data, NODE_NEXT_INDEX));\n\t\t}\n\t\treturn total;\n\t}\n\n\tget type(): number {\n\t\treturn this.cachedType;\n\t}\n\tprivate set type(value: number) {\n\t\tAtomics.store(this.uint16Array, 0, value);\n\t}\n\tget dataLength(): number {\n\t\treturn this.cachedDataLength;\n\t}\n\tprivate set dataLength(value: number) {\n\t\tAtomics.store(this.uint16Array, 1, value);\n\t}\n\n\tconstructor(memory: MemoryHeap, config?: SharedListConfig<T> | SharedListMemory) {\n\t\tthis.memory = memory;\n\n\t\tif(config && 'firstBlock' in config) {\n\t\t\t// TODO: How to handle referencing memory we don't have access to yet because buffer not synced from worker?\n\t\t\tthis.firstBlock = new AllocatedMemory(memory, config.firstBlock);\n\t\t\tthis.uint16Array = new Uint16Array(this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + (LENGTH_INDEX + 1) * Uint32Array.BYTES_PER_ELEMENT, 2);\n\t\t} else {\n\t\t\tif(config && config.initWithBlock) {\n\t\t\t\tthis.firstBlock = new AllocatedMemory(memory, config.initWithBlock);\n\t\t\t} else {\n\t\t\t\tthis.firstBlock = memory.allocUI32(FIRST_BLOCK_RECORD_KEEPING_COUNT);\n\t\t\t}\n\t\t\tthis.uint16Array = new Uint16Array(this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + (LENGTH_INDEX + 1) * Uint32Array.BYTES_PER_ELEMENT, 2);\n\n\t\t\t// Empty list: the tail hint points at the sentinel (firstBlock) so insert never special-cases the first node\n\t\t\tstoreRawPointer(this.firstBlock.data, TAIL_INDEX, this.firstBlock.pointer);\n\n\t\t\tconst type = config?.type ?? Uint32Array;\n\t\t\tif(type === Uint32Array) {\n\t\t\t\tthis.type = TYPE.uint32;\n\t\t\t// @ts-expect-error\n\t\t\t} else if(type === Int32Array) {\n\t\t\t\tthis.type = TYPE.int32;\n\t\t\t// @ts-expect-error\n\t\t\t} else if(type === Float32Array) {\n\t\t\t\tthis.type = TYPE.float32;\n\t\t\t}\n\t\t\tthis.dataLength = config?.dataLength ?? 1;\n\t\t}\n\n\t\tthis.cachedType = Atomics.load(this.uint16Array, 0);\n\t\t// dataLength defaults to at least one even when initialized from raw memory that was never explicitly set\n\t\tthis.cachedDataLength = Math.max(1, Atomics.load(this.uint16Array, 1));\n\t}\n\n\tinsert(values: number | Array<number>) {\n\t\tif(typeof values === 'number') {\n\t\t\tvalues = [values];\n\t\t}\n\n\t\tlet dataLength = this.cachedDataLength;\n\t\tif(values.length > dataLength) {\n\t\t\tthrow new Error(`Can't insert ${values.length} array into shared list of ${dataLength} dataLength`);\n\t\t}\n\t\tlet newBlock = this.memory.allocUI32(DATA_BLOCK_RECORD_KEEPING_COUNT + dataLength);\n\t\tlet newData = this.getDataBlock(newBlock.data.buffer, newBlock.data.byteOffset);\n\t\tlet newBlockPointer = newBlock.pointer;\n\n\t\tfor(let i = 0; i < values.length; i++) {\n\t\t\tif(newData instanceof Int32Array || newData instanceof Uint32Array) {\n\t\t\t\tAtomics.store(newData, i, values[i]);\n\t\t\t} else {\n\t\t\t\t// TODO: Should we replace with pass thru float32 conversion -> store?\n\t\t\t\tnewData[i] = values[i];\n\t\t\t}\n\t\t}\n\n\t\t// Michael-Scott enqueue: link the node onto tail.next BEFORE swinging the tail hint, so a committed node is never\n\t\t// invisible to a concurrent traversal. The tail hint may lag by one node; enqueuers help advance it.\n\t\t// eslint-disable-next-line no-constant-condition\n\t\twhile(true) {\n\t\t\tlet tailPointer = loadRawPointer(this.firstBlock.data, TAIL_INDEX);\n\t\t\tlet view = this.getBufferView(tailPointer & POSITION_MASK);\n\t\t\t// Tail node lives in a buffer this thread hasn't synced yet - retry until it appears\n\t\t\tif(!view) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tlet tailNextIndex = ((tailPointer >>> POSITION_BIT_COUNT) >>> 2) + NODE_NEXT_INDEX;\n\t\t\tlet nextPointer = Atomics.load(view, tailNextIndex);\n\n\t\t\t// Re-check the hint hasn't moved out from under us before acting on what we read\n\t\t\tif(tailPointer !== loadRawPointer(this.firstBlock.data, TAIL_INDEX)) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif(nextPointer === 0) {\n\t\t\t\tif(Atomics.compareExchange(view, tailNextIndex, 0, newBlockPointer) === 0) {\n\t\t\t\t\t// Linked. Try to swing the hint forward - failure is harmless, the next enqueuer will help.\n\t\t\t\t\treplaceRawPointer(this.firstBlock.data, TAIL_INDEX, newBlockPointer, tailPointer);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t// Tail hint is lagging behind a linked node - help it catch up, then retry\n\t\t\t\treplaceRawPointer(this.firstBlock.data, TAIL_INDEX, nextPointer, tailPointer);\n\t\t\t}\n\t\t}\n\n\t\tAtomics.add(this.firstBlock.data, LENGTH_INDEX, 1);\n\t}\n\n\tdeleteMatch(callback: (values: T, index: number) => boolean): boolean {\n\t\tfor(let { data, index, deleteCurrent } of this) {\n\t\t\tif(callback(data, index)) {\n\t\t\t\tif(deleteCurrent()) {\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn false;\n\t}\n\tdeleteIndex(deleteIndex: number): boolean {\n\t\tif(deleteIndex >= this.length || deleteIndex < 0) {\n\t\t\treturn false;\n\t\t}\n\n\t\t// Compare on index only so the payload view is never materialized for an index-based delete\n\t\tfor(let item of this) {\n\t\t\tif(item.index === deleteIndex) {\n\t\t\t\tif(item.deleteCurrent()) {\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn false;\n\t}\n\tdeleteValue(deleteValues: number | Array<number>) {\n\t\tif(typeof deleteValues === 'number') {\n\t\t\treturn this.deleteMatch(values => values[0] === deleteValues);\n\t\t} else {\n\t\t\treturn this.deleteMatch(values => {\n\t\t\t\tif(values.length !== deleteValues.length) {\n\t\t\t\t\treturn false;\n\t\t\t\t} else {\n\t\t\t\t\tfor(let i = 0; i < values.length; i++) {\n\t\t\t\t\t\tif(values[i] !== deleteValues[i]) {\n\t\t\t\t\t\t\treturn false;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t});\n\t\t}\n\t}\n\n\t// Reclaims tombstoned nodes: physically unlinks and frees them. Not safe to run concurrently with insert/delete.\n\tcompact() {\n\t\tlet prevPointer = this.firstBlock.pointer;\n\t\tlet prevView = this.firstBlock.data;\n\t\tlet prevNextIndex = NODE_NEXT_INDEX;\n\t\tlet nextPointer = loadRawPointer(prevView, prevNextIndex);\n\t\twhile(nextPointer) {\n\t\t\tlet position = nextPointer & POSITION_MASK;\n\t\t\tlet memPool = this.memory.buffers[position];\n\t\t\tif(!memPool) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tlet view = this.getBufferView(position)!;\n\t\t\tlet byteOffset = nextPointer >>> POSITION_BIT_COUNT;\n\t\t\tlet nodeIndex = byteOffset >>> 2;\n\t\t\tlet followingPointer = Atomics.load(view, nodeIndex + NODE_NEXT_INDEX);\n\n\t\t\tif(Atomics.load(view, nodeIndex + NODE_DELETED_INDEX)) {\n\t\t\t\t// Skip over the tombstone and free it. onDelete already fired when the node was logically deleted.\n\t\t\t\tstoreRawPointer(prevView, prevNextIndex, followingPointer);\n\t\t\t\tmemPool.free(byteOffset);\n\t\t\t} else {\n\t\t\t\tprevPointer = nextPointer;\n\t\t\t\tprevView = view;\n\t\t\t\tprevNextIndex = nodeIndex + NODE_NEXT_INDEX;\n\t\t\t}\n\n\t\t\tnextPointer = followingPointer;\n\t\t}\n\n\t\t// The last surviving node (or the sentinel when everything is gone) is the new tail\n\t\tstoreRawPointer(this.firstBlock.data, TAIL_INDEX, prevPointer);\n\t}\n\n\tclear() {\n\t\t// Detach the whole chain, then free it. Not safe to run concurrently with insert/delete.\n\t\tlet firstBlockPointer;\n\t\tlet updateWorked = false;\n\t\twhile(!updateWorked) {\n\t\t\tfirstBlockPointer = loadRawPointer(this.firstBlock.data, HEAD_INDEX);\n\t\t\t// Already cleared\n\t\t\tif(!firstBlockPointer) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tupdateWorked = replaceRawPointer(this.firstBlock.data, HEAD_INDEX, 0, firstBlockPointer);\n\t\t}\n\t\t// Shouldn't be possible to hit: making Typescript happy\n\t\tif(!firstBlockPointer) {\n\t\t\treturn;\n\t\t}\n\n\t\t// Reset the tail hint back to the sentinel\n\t\tstoreRawPointer(this.firstBlock.data, TAIL_INDEX, this.firstBlock.pointer);\n\n\t\tlet liveItems = 0;\n\t\tlet nextBlockPointer = firstBlockPointer;\n\t\twhile(nextBlockPointer) {\n\t\t\tlet position = nextBlockPointer & POSITION_MASK;\n\t\t\tlet memPool = this.memory.buffers[position];\n\t\t\t// Short circuit iterations if we can't access memory\n\t\t\tif(!memPool) {\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tlet view = this.getBufferView(position)!;\n\t\t\tlet byteOffset = nextBlockPointer >>> POSITION_BIT_COUNT;\n\t\t\tlet nodeIndex = byteOffset >>> 2;\n\t\t\tnextBlockPointer = Atomics.load(view, nodeIndex + NODE_NEXT_INDEX);\n\n\t\t\tif(!Atomics.load(view, nodeIndex + NODE_DELETED_INDEX)) {\n\t\t\t\tliveItems++;\n\t\t\t\tif(this.onDelete) {\n\t\t\t\t\tthis.onDelete(this.getDataBlock(view.buffer, byteOffset));\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tmemPool.free(byteOffset);\n\t\t}\n\n\t\t// Only subtract the live nodes we detached so a concurrent insert's increment stays accurate\n\t\tAtomics.sub(this.firstBlock.data, LENGTH_INDEX, liveItems);\n\t}\n\n\t*[Symbol.iterator]() {\n\t\tlet currentIndex = 0;\n\t\tlet nextPointer = loadRawPointer(this.firstBlock.data, HEAD_INDEX);\n\t\twhile(nextPointer) {\n\t\t\tlet position = nextPointer & POSITION_MASK;\n\t\t\tlet view = this.getBufferView(position);\n\t\t\t// Short circuit iterations if we can't access memory\n\t\t\tif(!view) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tlet byteOffset = nextPointer >>> POSITION_BIT_COUNT;\n\t\t\tlet nodeIndex = byteOffset >>> 2;\n\t\t\tnextPointer = Atomics.load(view, nodeIndex + NODE_NEXT_INDEX);\n\n\t\t\t// Skip tombstoned nodes - they stay linked until a quiescent compact()/clear()\n\t\t\tif(Atomics.load(view, nodeIndex + NODE_DELETED_INDEX)) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tlet buffer = view.buffer;\n\t\t\tlet deletedIndex = nodeIndex + NODE_DELETED_INDEX;\n\t\t\t// Plain object with an eager data view: V8 keeps this monomorphic and fast. A lazy `get data()` accessor is far\n\t\t\t// slower to allocate than the payload view it would save, so pay for the view up front.\n\t\t\tyield {\n\t\t\t\tdata: this.getDataBlock(buffer, byteOffset),\n\t\t\t\tindex: currentIndex,\n\t\t\t\t// Logical delete: tombstone the node and drop length. Returns false if another thread beat us to it.\n\t\t\t\tdeleteCurrent: (): boolean => {\n\t\t\t\t\tif(Atomics.compareExchange(view, deletedIndex, 0, 1) === 0) {\n\t\t\t\t\t\tAtomics.sub(this.firstBlock.data, LENGTH_INDEX, 1);\n\t\t\t\t\t\tif(this.onDelete) {\n\t\t\t\t\t\t\tthis.onDelete(this.getDataBlock(buffer, byteOffset));\n\t\t\t\t\t\t}\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\n\t\t\t\t\treturn false;\n\t\t\t\t},\n\t\t\t};\n\n\t\t\tcurrentIndex++;\n\t\t}\n\t}\n\n\tforEach(callback: (data: T) => void) {\n\t\tfor(let value of this) {\n\t\t\tcallback(value.data);\n\t\t}\n\t}\n\n\tgetSharedMemory(): SharedListMemory {\n\t\treturn {\n\t\t\tfirstBlock: this.firstBlock.getSharedMemory(),\n\t\t};\n\t}\n\n\tprivate getBufferView(position: number): Uint32Array | undefined {\n\t\tlet view = this.bufferViews[position];\n\t\tif(view) {\n\t\t\treturn view;\n\t\t}\n\n\t\tlet buffer = this.memory.buffers[position];\n\t\tif(!buffer) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\tview = new Uint32Array(buffer.buf);\n\t\tthis.bufferViews[position] = view;\n\t\treturn view;\n\t}\n\n\tprivate getDataBlock(buffer: ArrayBufferLike, nodeByteOffset: number): T {\n\t\tconst startIndex = nodeByteOffset + DATA_BLOCK_BYTE_OFFSET;\n\n\t\tswitch(this.cachedType) {\n\t\t\tcase TYPE.int32:\n\t\t\t\treturn new Int32Array(buffer, startIndex, this.cachedDataLength) as T;\n\t\t\tcase TYPE.uint32:\n\t\t\t\treturn new Uint32Array(buffer, startIndex, this.cachedDataLength) as T;\n\t\t\tcase TYPE.float32:\n\t\t\t\treturn new Float32Array(buffer, startIndex, this.cachedDataLength) as T;\n\t\t\tdefault:\n\t\t\t\tthrow new Error(`Unknown data block type ${this.cachedType}`);\n\t\t}\n\t}\n\n\tfree() {\n\t\tlet { bufferPosition: nextBlockPosition, bufferByteOffset: nextBlockByteOffset } = loadPointer(this.firstBlock.data, HEAD_INDEX);\n\t\twhile(nextBlockByteOffset) {\n\t\t\tlet allocatedMemory = new AllocatedMemory(this.memory, {\n\t\t\t\tbufferPosition: nextBlockPosition,\n\t\t\t\tbufferByteOffset: nextBlockByteOffset,\n\t\t\t});\n\n\t\t\t({ bufferPosition: nextBlockPosition, bufferByteOffset: nextBlockByteOffset } = loadPointer(allocatedMemory.data, NODE_NEXT_INDEX));\n\n\t\t\tif(this.onDelete && !Atomics.load(allocatedMemory.data, NODE_DELETED_INDEX)) {\n\t\t\t\tthis.onDelete(this.getDataBlock(allocatedMemory.data.buffer, allocatedMemory.data.byteOffset));\n\t\t\t}\n\n\t\t\tallocatedMemory.free();\n\t\t}\n\n\t\tthis.firstBlock.free();\n\t}\n}\n\ninterface SharedListConfig<T extends Uint32Array | Int32Array | Float32Array> {\n\tinitWithBlock?: SharedAllocatedMemory\n\ttype?: TypedArrayConstructor<T>\n\tdataLength?: number\n}\ninterface SharedListMemory {\n\tfirstBlock: SharedAllocatedMemory\n}\n\ninterface SharedListIterable<T extends Uint32Array | Int32Array | Float32Array> {\n\tdata: T\n\tindex: number\n\tdeleteCurrent: () => boolean\n}\n\nexport { type SharedListMemory };\n"],"mappings":";;;AAiBA,IAAM,IAAmC,GACnC,IAAkC,GAClC,IAAyB,IAAkC,YAAY,mBACvE,IAAa,GACb,IAAa,GACb,IAAe,GACf,IAAkB,GAClB,IAAqB,GAErB,IAAA,MACe,IAArB,MAA4I;CAC3I,OAAgB,iBAAiB;CAEjC;CAmBA;CACA;CAEA;CACA;CAGA,cAA0C,CAAC;CAC3C;CAEA,IAAI,SAAiB;EACpB,OAAO,QAAQ,KAAK,KAAK,WAAW,MAAM,CAAY;CACvD;CAIA,IAAI,aAAqB;EACxB,IAAI,IAAQ,KAAK,WAAW,YACxB,EAAE,mBAAgB,wBAAqB,EAAY,KAAK,WAAW,MAAM,CAAU;EACvF,OAAM,IAAkB;GACvB,IAAI,IAAO,IAAI,EAAgB,KAAK,QAAQ;IAAE;IAAgB;GAAiB,CAAC;GAEhF,AADA,KAAS,EAAK,YACb,2CAAuC,EAAY,EAAK,MAAM,CAAe;EAC/E;EACA,OAAO;CACR;CAEA,IAAI,OAAe;EAClB,OAAO,KAAK;CACb;CACA,IAAY,KAAK,GAAe;EAC/B,QAAQ,MAAM,KAAK,aAAa,GAAG,CAAK;CACzC;CACA,IAAI,aAAqB;EACxB,OAAO,KAAK;CACb;CACA,IAAY,WAAW,GAAe;EACrC,QAAQ,MAAM,KAAK,aAAa,GAAG,CAAK;CACzC;CAEA,YAAY,GAAoB,GAAiD;EAGhF,IAFA,KAAK,SAAS,GAEX,KAAU,gBAAgB,GAG5B,AADA,KAAK,aAAa,IAAI,EAAgB,GAAQ,EAAO,UAAU,GAC/D,KAAK,cAAc,IAAI,YAAY,KAAK,WAAW,KAAK,QAAQ,KAAK,WAAW,mBAAoB,IAAoB,YAAY,mBAAmB,CAAC;OAClJ;GASN,AARA,AAGC,KAAK,aAHH,KAAU,EAAO,gBACD,IAAI,EAAgB,GAAQ,EAAO,aAAa,IAEhD,EAAO,UAAU,CAAgC,GAEpE,KAAK,cAAc,IAAI,YAAY,KAAK,WAAW,KAAK,QAAQ,KAAK,WAAW,mBAAoB,IAAoB,YAAY,mBAAmB,CAAC,GAGxJ,EAAgB,KAAK,WAAW,MAAM,GAAY,KAAK,WAAW,OAAO;GAEzE,IAAM,IAAO,GAAQ,QAAQ;GAU7B,AATG,MAAS,cACX,KAAK,OAAA,IAEI,MAAS,aAClB,KAAK,OAAA,IAEI,MAAS,iBAClB,KAAK,OAAA,IAEN,KAAK,aAAa,GAAQ,cAAc;EACzC;EAIA,AAFA,KAAK,aAAa,QAAQ,KAAK,KAAK,aAAa,CAAC,GAElD,KAAK,mBAAmB,KAAK,IAAI,GAAG,QAAQ,KAAK,KAAK,aAAa,CAAC,CAAC;CACtE;CAEA,OAAO,GAAgC;EACtC,AAAG,OAAO,KAAW,aACpB,IAAS,CAAC,CAAM;EAGjB,IAAI,IAAa,KAAK;EACtB,IAAG,EAAO,SAAS,GAClB,MAAU,MAAM,gBAAgB,EAAO,OAAO,6BAA6B,EAAW,YAAY;EAEnG,IAAI,IAAW,KAAK,OAAO,UAAU,IAAkC,CAAU,GAC7E,IAAU,KAAK,aAAa,EAAS,KAAK,QAAQ,EAAS,KAAK,UAAU,GAC1E,IAAkB,EAAS;EAE/B,KAAI,IAAI,IAAI,GAAG,IAAI,EAAO,QAAQ,KACjC,AAAG,aAAmB,cAAc,aAAmB,cACtD,QAAQ,MAAM,GAAS,GAAG,EAAO,EAAE,IAGnC,EAAQ,KAAK,EAAO;EAOtB,SAAY;GACX,IAAI,IAAc,EAAe,KAAK,WAAW,MAAM,CAAU,GAC7D,IAAO,KAAK,cAAc,IAAc,CAAa;GAEzD,IAAG,CAAC,GACH;GAED,IAAI,KAAkB,MAAA,OAAwC,KAAK,GAC/D,IAAc,QAAQ,KAAK,GAAM,CAAa;GAG/C,UAAgB,EAAe,KAAK,WAAW,MAAM,CAAU,GAIlE;QAAG,MAAgB,GACf;SAAA,QAAQ,gBAAgB,GAAM,GAAe,GAAG,CAAe,MAAM,GAAG;MAE1E,EAAkB,KAAK,WAAW,MAAM,GAAY,GAAiB,CAAW;MAChF;KACD;WAGA,EAAkB,KAAK,WAAW,MAAM,GAAY,GAAa,CAAW;GAAA;EAE9E;EAEA,QAAQ,IAAI,KAAK,WAAW,MAAM,GAAc,CAAC;CAClD;CAEA,YAAY,GAA0D;EACrE,KAAI,IAAI,EAAE,SAAM,UAAO,sBAAmB,MACzC,IAAG,EAAS,GAAM,CAAK,KACnB,EAAc,GAChB,OAAO;EAKV,OAAO;CACR;CACA,YAAY,GAA8B;EACzC,IAAG,KAAe,KAAK,UAAU,IAAc,GAC9C,OAAO;EAIR,KAAI,IAAI,KAAQ,MACf,IAAG,EAAK,UAAU,KACd,EAAK,cAAc,GACrB,OAAO;EAKV,OAAO;CACR;CACA,YAAY,GAAsC;EAIhD,OAHE,OAAO,KAAiB,WACnB,KAAK,aAAY,MAAU,EAAO,OAAO,CAAY,IAErD,KAAK,aAAY,MAAU;GACjC,IAAG,EAAO,WAAW,EAAa,QACjC,OAAO;GAEP,KAAI,IAAI,IAAI,GAAG,IAAI,EAAO,QAAQ,KACjC,IAAG,EAAO,OAAO,EAAa,IAC7B,OAAO;GAIT,OAAO;EAET,CAAC;CAEH;CAGA,UAAU;EACT,IAAI,IAAc,KAAK,WAAW,SAC9B,IAAW,KAAK,WAAW,MAC3B,IAAgB,GAChB,IAAc,EAAe,GAAU,CAAa;EACxD,OAAM,IAAa;GAClB,IAAI,IAAW,IAAc,GACzB,IAAU,KAAK,OAAO,QAAQ;GAClC,IAAG,CAAC,GACH;GAED,IAAI,IAAO,KAAK,cAAc,CAAQ,GAClC,IAAa,MAAA,IACb,IAAY,MAAe,GAC3B,IAAmB,QAAQ,KAAK,GAAM,IAAY,CAAe;GAYrE,AAVG,QAAQ,KAAK,GAAM,IAAY,CAAkB,KAEnD,EAAgB,GAAU,GAAe,CAAgB,GACzD,EAAQ,KAAK,CAAU,MAEvB,IAAc,GACd,IAAW,GACX,IAAgB,IAAY,IAG7B,IAAc;EACf;EAGA,EAAgB,KAAK,WAAW,MAAM,GAAY,CAAW;CAC9D;CAEA,QAAQ;EAEP,IAAI,GACA,IAAe;EACnB,OAAM,CAAC,IAAc;GAGpB,IAFA,IAAoB,EAAe,KAAK,WAAW,MAAM,CAAU,GAEhE,CAAC,GACH;GAGD,IAAe,EAAkB,KAAK,WAAW,MAAM,GAAY,GAAG,CAAiB;EACxF;EAEA,IAAG,CAAC,GACH;EAID,EAAgB,KAAK,WAAW,MAAM,GAAY,KAAK,WAAW,OAAO;EAEzE,IAAI,IAAY,GACZ,IAAmB;EACvB,OAAM,IAAkB;GACvB,IAAI,IAAW,IAAmB,GAC9B,IAAU,KAAK,OAAO,QAAQ;GAElC,IAAG,CAAC,GACH;GAGD,IAAI,IAAO,KAAK,cAAc,CAAQ,GAClC,IAAa,MAAA,IACb,IAAY,MAAe;GAU/B,AATA,IAAmB,QAAQ,KAAK,GAAM,IAAY,CAAe,GAE7D,QAAQ,KAAK,GAAM,IAAY,CAAkB,MACpD,KACG,KAAK,YACP,KAAK,SAAS,KAAK,aAAa,EAAK,QAAQ,CAAU,CAAC,IAI1D,EAAQ,KAAK,CAAU;EACxB;EAGA,QAAQ,IAAI,KAAK,WAAW,MAAM,GAAc,CAAS;CAC1D;CAEA,EAAE,OAAO,YAAY;EACpB,IAAI,IAAe,GACf,IAAc,EAAe,KAAK,WAAW,MAAM,CAAU;EACjE,OAAM,IAAa;GAClB,IAAI,IAAW,IAAc,GACzB,IAAO,KAAK,cAAc,CAAQ;GAEtC,IAAG,CAAC,GACH;GAED,IAAI,IAAa,MAAA,IACb,IAAY,MAAe;GAI/B,IAHA,IAAc,QAAQ,KAAK,GAAM,IAAY,CAAe,GAGzD,QAAQ,KAAK,GAAM,IAAY,CAAkB,GACnD;GAGD,IAAI,IAAS,EAAK,QACd,IAAe,IAAY;GAoB/B,AAjBA,MAAM;IACL,MAAM,KAAK,aAAa,GAAQ,CAAU;IAC1C,OAAO;IAEP,qBACI,QAAQ,gBAAgB,GAAM,GAAc,GAAG,CAAC,MAAM,MACxD,QAAQ,IAAI,KAAK,WAAW,MAAM,GAAc,CAAC,GAC9C,KAAK,YACP,KAAK,SAAS,KAAK,aAAa,GAAQ,CAAU,CAAC,GAE7C;GAKV,GAEA;EACD;CACD;CAEA,QAAQ,GAA6B;EACpC,KAAI,IAAI,KAAS,MAChB,EAAS,EAAM,IAAI;CAErB;CAEA,kBAAoC;EACnC,OAAO,EACN,YAAY,KAAK,WAAW,gBAAgB,EAC7C;CACD;CAEA,cAAsB,GAA2C;EAChE,IAAI,IAAO,KAAK,YAAY;EAC5B,IAAG,GACF,OAAO;EAGR,IAAI,IAAS,KAAK,OAAO,QAAQ;EAC7B,OAMJ,OAFA,IAAO,IAAI,YAAY,EAAO,GAAG,GACjC,KAAK,YAAY,KAAY,GACtB;CACR;CAEA,aAAqB,GAAyB,GAA2B;EACxE,IAAM,IAAa,IAAiB;EAEpC,QAAO,KAAK,YAAZ;GACC,KAAA,GACC,OAAO,IAAI,WAAW,GAAQ,GAAY,KAAK,gBAAgB;GAChE,KAAA,GACC,OAAO,IAAI,YAAY,GAAQ,GAAY,KAAK,gBAAgB;GACjE,KAAA,GACC,OAAO,IAAI,aAAa,GAAQ,GAAY,KAAK,gBAAgB;GAClE,SACC,MAAU,MAAM,2BAA2B,KAAK,YAAY;EAC9D;CACD;CAEA,OAAO;EACN,IAAI,EAAE,gBAAgB,GAAmB,kBAAkB,MAAwB,EAAY,KAAK,WAAW,MAAM,CAAU;EAC/H,OAAM,IAAqB;GAC1B,IAAI,IAAkB,IAAI,EAAgB,KAAK,QAAQ;IACtD,gBAAgB;IAChB,kBAAkB;GACnB,CAAC;GAQD,CANC,CAAE,gBAAgB,GAAmB,kBAAkB,KAAwB,EAAY,EAAgB,MAAM,CAAe,IAE9H,KAAK,YAAY,CAAC,QAAQ,KAAK,EAAgB,MAAM,CAAkB,KACzE,KAAK,SAAS,KAAK,aAAa,EAAgB,KAAK,QAAQ,EAAgB,KAAK,UAAU,CAAC,GAG9F,EAAgB,KAAK;EACtB;EAEA,KAAK,WAAW,KAAK;CACtB;AACD"}

package/dist/{src/shared-map.d.ts → shared-map.d.ts}

@@ -1,5 +1,5 @@
-import { SharedAllocatedMemory } from './allocated-memory';
-import { default as MemoryHeap } from './memory-heap';
+import { type SharedAllocatedMemory } from './allocated-memory';
+import type MemoryHeap from './memory-heap';
 export default class SharedMap<K extends string | number> {
     static readonly ALLOCATE_COUNT = 4;
     private memory;