@daneren2005/shared-memory-objects 1.1.0 → 1.3.0

package/dist/shared-map.js

@@ -1,140 +1,107 @@
-import u from "./allocated-memory.js";
-import f from "./shared-list.js";
-import { loadPointer as l, storePointer as y } from "./utils/pointer.js";
-const c = 10;
-class M {
-  static ALLOCATE_COUNT = 4;
-  memory;
-  // Memory order: Pointer, Lock, Length, MaxHash
-  pointerMemory;
-  lock;
-  get hashMemory() {
-    return new u(this.memory, l(this.pointerMemory.data, 0));
-  }
-  get length() {
-    return Atomics.load(this.pointerMemory.data, 2);
-  }
-  get maxHash() {
-    return Atomics.load(this.pointerMemory.data, 3);
-  }
-  constructor(t, e) {
-    if (this.memory = t, e)
-      this.pointerMemory = new u(t, e.firstBlock);
-    else {
-      this.pointerMemory = t.allocUI32(M.ALLOCATE_COUNT);
-      let r = t.allocUI32(c);
-      y(this.pointerMemory.data, 0, r.bufferPosition, r.bufferByteOffset), Atomics.store(this.pointerMemory.data, 3, c);
-    }
-    this.lock = new Int32Array(this.pointerMemory.data.buffer, this.pointerMemory.bufferByteOffset + Uint32Array.BYTES_PER_ELEMENT, 1);
-  }
-  set(t, e) {
-    this.length >= this.maxHash * 2 && this.growHashTable();
-    let r = m(t);
-    this.setHashKey(this.hashMemory, this.maxHash, r, e) && Atomics.add(this.pointerMemory.data, 2, 1);
-  }
-  setHashKey(t, e, r, s) {
-    let a = this.hash(r, e), i, h = l(t.data, a);
-    if (h.bufferByteOffset === 0) {
-      i = new f(this.memory, {
-        dataLength: 2
-      });
-      let d = i.getSharedMemory();
-      y(t.data, a, d.firstBlock.bufferPosition, d.firstBlock.bufferByteOffset);
-    } else
-      i = new f(this.memory, {
-        firstBlock: h
-      });
-    let n = !0;
-    return i.deleteValue(r) && (n = !1), i.insert([r, s]), n;
-  }
-  get(t) {
-    let e = m(t), r = this.hash(e, this.maxHash), s = l(this.hashMemory.data, r);
-    if (s.bufferByteOffset === 0)
-      return;
-    let a = new f(this.memory, {
-      firstBlock: s
-    });
-    for (let { data: i } of a)
-      if (i[0] === e)
-        return i[1];
-  }
-  has(t) {
-    let e = m(t), r = this.hash(e, this.maxHash), s = l(this.hashMemory.data, r);
-    if (s.bufferByteOffset === 0)
-      return !1;
-    let a = new f(this.memory, {
-      firstBlock: s
-    });
-    for (let { data: i } of a)
-      if (i[0] === e)
-        return !0;
-    return !1;
-  }
-  delete(t) {
-    let e = m(t), r = this.hash(e, this.maxHash), s = l(this.hashMemory.data, r);
-    if (s.bufferByteOffset === 0)
-      return !1;
-    let a = new f(this.memory, {
-      firstBlock: s
-    });
-    for (let { data: i, deleteCurrent: h } of a)
-      if (i[0] === e)
-        return h(), Atomics.sub(this.pointerMemory.data, 2, 1), !0;
-    return !1;
-  }
-  growHashTable() {
-    let t = this.maxHash, e = t * 2, r = this.memory.allocUI32(e), s = this.hashMemory;
-    for (let a = 0; a < t; a++) {
-      let i = l(s.data, a);
-      if (i.bufferByteOffset === 0)
-        continue;
-      let h = new f(this.memory, {
-        firstBlock: i
-      });
-      for (let { data: n } of h)
-        this.setHashKey(r, e, n[0], n[1]);
-      h.free();
-    }
-    y(this.pointerMemory.data, 0, r.bufferPosition, r.bufferByteOffset), Atomics.store(this.pointerMemory.data, 3, e), s.free();
-  }
-  hash(t, e) {
-    return t % e;
-  }
-  free() {
-    for (let t = 0; t < this.maxHash; t++) {
-      let e = l(this.hashMemory.data, t);
-      if (e.bufferByteOffset === 0)
-        continue;
-      new f(this.memory, {
-        firstBlock: e
-      }).free();
-    }
-    this.hashMemory.free(), this.pointerMemory.free();
-  }
-  getSharedMemory() {
-    return {
-      firstBlock: this.pointerMemory.getSharedMemory()
-    };
-  }
-}
-function m(o) {
-  return typeof o == "number" ? o : typeof o == "string" ? p(o) : o;
+import { loadPointer as e, storePointer as t } from "./utils/pointer.js";
+import n from "./allocated-memory.js";
+import r from "./shared-list.js";
+//#region src/shared-map.ts
+var i = 10, a = class a {
+	static ALLOCATE_COUNT = 4;
+	memory;
+	pointerMemory;
+	lock;
+	get hashMemory() {
+		return new n(this.memory, e(this.pointerMemory.data, 0));
+	}
+	get length() {
+		return Atomics.load(this.pointerMemory.data, 2);
+	}
+	get maxHash() {
+		return Atomics.load(this.pointerMemory.data, 3);
+	}
+	constructor(e, r) {
+		if (this.memory = e, r) this.pointerMemory = new n(e, r.firstBlock);
+		else {
+			this.pointerMemory = e.allocUI32(a.ALLOCATE_COUNT);
+			let n = e.allocUI32(i);
+			t(this.pointerMemory.data, 0, n.bufferPosition, n.bufferByteOffset), Atomics.store(this.pointerMemory.data, 3, i);
+		}
+		this.lock = new Int32Array(this.pointerMemory.data.buffer, this.pointerMemory.bufferByteOffset + Uint32Array.BYTES_PER_ELEMENT, 1);
+	}
+	set(e, t) {
+		this.length >= this.maxHash * 2 && this.growHashTable();
+		let n = o(e);
+		this.setHashKey(this.hashMemory, this.maxHash, n, t) && Atomics.add(this.pointerMemory.data, 2, 1);
+	}
+	setHashKey(n, i, a, o) {
+		let s = this.hash(a, i), c, l = e(n.data, s);
+		if (l.bufferByteOffset === 0) {
+			c = new r(this.memory, { dataLength: 2 });
+			let e = c.getSharedMemory();
+			t(n.data, s, e.firstBlock.bufferPosition, e.firstBlock.bufferByteOffset);
+		} else c = new r(this.memory, { firstBlock: l });
+		let u = !0;
+		return c.deleteValue(a) && (u = !1), c.insert([a, o]), u || c.compact(), u;
+	}
+	get(t) {
+		let n = o(t), i = this.hash(n, this.maxHash), a = e(this.hashMemory.data, i);
+		if (a.bufferByteOffset === 0) return;
+		let s = new r(this.memory, { firstBlock: a });
+		for (let { data: e } of s) if (e[0] === n) return e[1];
+	}
+	has(t) {
+		let n = o(t), i = this.hash(n, this.maxHash), a = e(this.hashMemory.data, i);
+		if (a.bufferByteOffset === 0) return !1;
+		let s = new r(this.memory, { firstBlock: a });
+		for (let { data: e } of s) if (e[0] === n) return !0;
+		return !1;
+	}
+	delete(t) {
+		let n = o(t), i = this.hash(n, this.maxHash), a = e(this.hashMemory.data, i);
+		if (a.bufferByteOffset === 0) return !1;
+		let s = new r(this.memory, { firstBlock: a }), c = !1;
+		for (let { data: e, deleteCurrent: t } of s) if (e[0] === n) {
+			t(), Atomics.sub(this.pointerMemory.data, 2, 1), c = !0;
+			break;
+		}
+		return c && s.compact(), c;
+	}
+	growHashTable() {
+		let n = this.maxHash, i = n * 2, a = this.memory.allocUI32(i), o = this.hashMemory;
+		for (let t = 0; t < n; t++) {
+			let n = e(o.data, t);
+			if (n.bufferByteOffset === 0) continue;
+			let s = new r(this.memory, { firstBlock: n });
+			for (let { data: e } of s) this.setHashKey(a, i, e[0], e[1]);
+			s.free();
+		}
+		t(this.pointerMemory.data, 0, a.bufferPosition, a.bufferByteOffset), Atomics.store(this.pointerMemory.data, 3, i), o.free();
+	}
+	hash(e, t) {
+		return e % t;
+	}
+	free() {
+		for (let t = 0; t < this.maxHash; t++) {
+			let n = e(this.hashMemory.data, t);
+			n.bufferByteOffset !== 0 && new r(this.memory, { firstBlock: n }).free();
+		}
+		this.hashMemory.free(), this.pointerMemory.free();
+	}
+	getSharedMemory() {
+		return { firstBlock: this.pointerMemory.getSharedMemory() };
+	}
+};
+function o(e) {
+	return typeof e == "number" ? e : typeof e == "string" ? s(e) : e;
 }
-function p(o) {
-  let t = o.length, e = 17 ^ t, r = 0, s;
-  for (; t >= 4; )
-    s = o.charCodeAt(r) & 255 | (o.charCodeAt(++r) & 255) << 8 | (o.charCodeAt(++r) & 255) << 16 | (o.charCodeAt(++r) & 255) << 14, s = (s & 65535) * 1540483477 + (((s >>> 16) * 1540483477 & 65535) << 16), s ^= s >>> 14, s = (s & 65535) * 1540483477 + (((s >>> 16) * 1540483477 & 65535) << 16), e = (e & 65535) * 1540483477 + (((e >>> 16) * 1540483477 & 65535) << 16) ^ s, t -= 4, ++r;
-  switch (t) {
-    case 3:
-      e ^= (o.charCodeAt(r + 2) & 255) << 16;
-    case 2:
-      e ^= (o.charCodeAt(r + 1) & 255) << 8;
-    case 1:
-      e ^= o.charCodeAt(r) & 255, e = (e & 65535) * 1540483477 + (((e >>> 16) * 1540483477 & 65535) << 16);
-  }
-  return e ^= e >>> 13, e = (e & 65535) * 1540483477 + (((e >>> 16) * 1540483477 & 65535) << 16), e ^= e >>> 15, e = e >>> 0, e;
+function s(e) {
+	let t = e.length, n = 17 ^ t, r = 0, i;
+	for (; t >= 4;) i = e.charCodeAt(r) & 255 | (e.charCodeAt(++r) & 255) << 8 | (e.charCodeAt(++r) & 255) << 16 | (e.charCodeAt(++r) & 255) << 14, i = (i & 65535) * 1540483477 + (((i >>> 16) * 1540483477 & 65535) << 16), i ^= i >>> 14, i = (i & 65535) * 1540483477 + (((i >>> 16) * 1540483477 & 65535) << 16), n = (n & 65535) * 1540483477 + (((n >>> 16) * 1540483477 & 65535) << 16) ^ i, t -= 4, ++r;
+	switch (t) {
+		case 3: n ^= (e.charCodeAt(r + 2) & 255) << 16;
+		case 2: n ^= (e.charCodeAt(r + 1) & 255) << 8;
+		case 1: n ^= e.charCodeAt(r) & 255, n = (n & 65535) * 1540483477 + (((n >>> 16) * 1540483477 & 65535) << 16);
+	}
+	return n ^= n >>> 13, n = (n & 65535) * 1540483477 + (((n >>> 16) * 1540483477 & 65535) << 16), n ^= n >>> 15, n >>>= 0, n;
 }
-export {
-  M as default
-};
-//# sourceMappingURL=shared-map.js.map
+//#endregion
+export { a as default };
+
+//# sourceMappingURL=shared-map.js.map

package/dist/shared-map.js.map

@@ -1 +1 @@
-{"version":3,"file":"shared-map.js","sources":["../src/shared-map.ts"],"sourcesContent":["import AllocatedMemory, { type SharedAllocatedMemory } from './allocated-memory';\nimport type MemoryHeap from './memory-heap';\nimport SharedList from './shared-list';\nimport { loadPointer, storePointer } from './utils/pointer';\n\n// TODO: Grow hashMemory\n// TODO: Add iterator\n// TODO: Add read/write locks\nconst DEFAULT_HASH_SIZE = 10;\nexport default class SharedMap<K extends string | number> {\n\tstatic readonly ALLOCATE_COUNT = 4;\n\n\tprivate memory: MemoryHeap;\n\t// Memory order: Pointer, Lock, Length, MaxHash\n\tprivate pointerMemory: AllocatedMemory;\n\tprivate lock: Int32Array;\n\tprivate get hashMemory(): AllocatedMemory {\n\t\treturn new AllocatedMemory(this.memory, loadPointer(this.pointerMemory.data, 0));\n\t}\n\n\tget length(): number {\n\t\treturn Atomics.load(this.pointerMemory.data, 2);\n\t}\n\tget maxHash(): number {\n\t\treturn Atomics.load(this.pointerMemory.data, 3);\n\t}\n\n\tconstructor(memory: MemoryHeap, clone?: SharedMapMemory) {\n\t\tthis.memory = memory;\n\n\t\tif(clone) {\n\t\t\tthis.pointerMemory = new AllocatedMemory(memory, clone.firstBlock);\n\t\t} else {\n\t\t\tthis.pointerMemory = memory.allocUI32(SharedMap.ALLOCATE_COUNT);\n\t\t\tlet hashMemory = memory.allocUI32(DEFAULT_HASH_SIZE);\n\t\t\tstorePointer(this.pointerMemory.data, 0, hashMemory.bufferPosition, hashMemory.bufferByteOffset);\n\t\t\tAtomics.store(this.pointerMemory.data, 3, DEFAULT_HASH_SIZE);\n\t\t}\n\t\tthis.lock = new Int32Array(this.pointerMemory.data.buffer, this.pointerMemory.bufferByteOffset + Uint32Array.BYTES_PER_ELEMENT, 1);\n\t}\n\n\tset(key: K, value: number) {\n\t\tif(this.length >= this.maxHash * 2) {\n\t\t\tthis.growHashTable();\n\t\t}\n\n\t\tlet fullHashKey = get32BitHash(key);\n\t\tif(this.setHashKey(this.hashMemory, this.maxHash, fullHashKey, value)) {\n\t\t\tAtomics.add(this.pointerMemory.data, 2, 1);\n\t\t}\n\t}\n\tprivate setHashKey(hashMemory: AllocatedMemory, maxHash: number, fullHashKey: number, value: number) {\n\t\tlet hashKey = this.hash(fullHashKey, maxHash);\n\t\t\n\t\tlet list: SharedList;\n\t\tlet pointer = loadPointer(hashMemory.data, hashKey);\n\t\tif(pointer.bufferByteOffset === 0) {\n\t\t\t// Initialize a list here\n\t\t\tlist = new SharedList(this.memory, {\n\t\t\t\tdataLength: 2\n\t\t\t});\n\n\t\t\tlet listMemory = list.getSharedMemory();\n\t\t\tstorePointer(hashMemory.data, hashKey, listMemory.firstBlock.bufferPosition, listMemory.firstBlock.bufferByteOffset);\n\t\t} else {\n\t\t\tlist = new SharedList(this.memory, {\n\t\t\t\tfirstBlock: pointer\n\t\t\t});\n\t\t}\n\n\t\t// Check if any other items in list have the same key and delete them\n\t\tlet inserted = true;\n\t\tif(list.deleteValue(fullHashKey)) {\n\t\t\tinserted = false;\n\t\t}\n\t\tlist.insert([fullHashKey, value]);\n\t\t\n\t\treturn inserted;\n\t}\n\n\tget(key: K): number | undefined {\n\t\tlet fullHashKey = get32BitHash(key);\n\t\tlet hashKey = this.hash(fullHashKey, this.maxHash);\n\n\t\tlet pointer = loadPointer(this.hashMemory.data, hashKey);\n\t\tif(pointer.bufferByteOffset === 0) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\tlet list = new SharedList(this.memory, {\n\t\t\tfirstBlock: pointer\n\t\t});\n\n\t\tfor(let { data } of list) {\n\t\t\tif(data[0] === fullHashKey) {\n\t\t\t\treturn data[1];\n\t\t\t}\n\t\t}\n\n\t\treturn undefined;\n\t}\n\thas(key: K): boolean {\n\t\tlet fullHashKey = get32BitHash(key);\n\t\tlet hashKey = this.hash(fullHashKey, this.maxHash);\n\n\t\tlet pointer = loadPointer(this.hashMemory.data, hashKey);\n\t\tif(pointer.bufferByteOffset === 0) {\n\t\t\treturn false;\n\t\t}\n\n\t\tlet list = new SharedList(this.memory, {\n\t\t\tfirstBlock: pointer\n\t\t});\n\n\t\tfor(let { data } of list) {\n\t\t\tif(data[0] === fullHashKey) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\n\t\treturn false;\n\t}\n\n\tdelete(key: K): boolean {\n\t\tlet fullHashKey = get32BitHash(key);\n\t\tlet hashKey = this.hash(fullHashKey, this.maxHash);\n\n\t\tlet pointer = loadPointer(this.hashMemory.data, hashKey);\n\t\tif(pointer.bufferByteOffset === 0) {\n\t\t\treturn false;\n\t\t}\n\n\t\tlet list = new SharedList(this.memory, {\n\t\t\tfirstBlock: pointer\n\t\t});\n\n\t\tfor(let { data, deleteCurrent } of list) {\n\t\t\tif(data[0] === fullHashKey) {\n\t\t\t\tdeleteCurrent();\n\n\t\t\t\tAtomics.sub(this.pointerMemory.data, 2, 1);\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\n\t\treturn false;\n\t}\n\n\tprivate growHashTable() {\n\t\tlet oldMaxHash = this.maxHash;\n\t\tlet newMaxHash = oldMaxHash * 2;\n\t\tlet newHashMemory = this.memory.allocUI32(newMaxHash);\n\t\tlet oldHashMemory = this.hashMemory;\n\n\t\t// Copy each old hash value into new hash memory\n\t\tfor(let i = 0; i < oldMaxHash; i++) {\n\t\t\tlet pointer = loadPointer(oldHashMemory.data, i);\n\t\t\tif(pointer.bufferByteOffset === 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tlet list = new SharedList(this.memory, {\n\t\t\t\tfirstBlock: pointer\n\t\t\t});\n\t\t\tfor(let { data } of list) {\n\t\t\t\tthis.setHashKey(newHashMemory, newMaxHash, data[0], data[1]);\n\t\t\t}\n\n\t\t\t// The entries have been copied into freshly allocated lists in the new hash table so the old list can be freed\n\t\t\tlist.free();\n\t\t}\n\n\t\tstorePointer(this.pointerMemory.data, 0, newHashMemory.bufferPosition, newHashMemory.bufferByteOffset);\n\t\tAtomics.store(this.pointerMemory.data, 3, newMaxHash);\n\n\t\t// pointerMemory now references newHashMemory so the old hash table memory can be freed\n\t\toldHashMemory.free();\n\t}\n\n\tprivate hash(key: number, maxHash: number) {\n\t\treturn key % maxHash;\n\t}\n\n\tfree() {\n\t\t// Loop through and free lists in hash table first\n\t\tfor(let i = 0; i < this.maxHash; i++) {\n\t\t\tlet pointer = loadPointer(this.hashMemory.data, i);\n\t\t\tif(pointer.bufferByteOffset === 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tlet list = new SharedList(this.memory, {\n\t\t\t\tfirstBlock: pointer\n\t\t\t});\n\t\t\tlist.free();\n\t\t}\n\n\t\tthis.hashMemory.free();\n\t\tthis.pointerMemory.free();\n\t}\n\n\tgetSharedMemory(): SharedMapMemory {\n\t\treturn {\n\t\t\tfirstBlock: this.pointerMemory.getSharedMemory()\n\t\t};\n\t}\n}\n\ninterface SharedMapMemory {\n\tfirstBlock: SharedAllocatedMemory\n}\n\nfunction get32BitHash<K extends string | number>(key: K): number {\n\tif(typeof key === 'number') {\n\t\treturn key;\n\t} else if(typeof key === 'string') {\n\t\treturn hashString(key as string);\n\t} else {\n\t\treturn key;\n\t}\n}\n\n// Copied from https://github.com/mmomtchev/SharedMap/blob/master/index.js - MurmurHash2\nfunction hashString(str: string): number {\n\tlet\n\t\tl = str.length,\n\t\th = 17 ^ l,\n\t\ti = 0,\n\t\tk;\n\twhile(l >= 4) {\n\t\tk =\n\t\t\t((str.charCodeAt(i) & 0xff)) |\n\t\t\t((str.charCodeAt(++i) & 0xff) << 8) |\n\t\t\t((str.charCodeAt(++i) & 0xff) << 16) |\n\t\t\t((str.charCodeAt(++i) & 0xff) << 14);\n\t\tk = (((k & 0xffff) * 0x5bd1e995) + ((((k >>> 16) * 0x5bd1e995) & 0xffff) << 16));\n\t\tk ^= k >>> 14;\n\t\tk = (((k & 0xffff) * 0x5bd1e995) + ((((k >>> 16) * 0x5bd1e995) & 0xffff) << 16));\n\t\th = (((h & 0xffff) * 0x5bd1e995) + ((((h >>> 16) * 0x5bd1e995) & 0xffff) << 16)) ^ k;\n\t\tl -= 4;\n\t\t++i;\n\t}\n\t/* eslint-disable no-fallthrough */\n\tswitch(l) {\n\t\tcase 3: h ^= (str.charCodeAt(i + 2) & 0xff) << 16;\n\t\tcase 2: h ^= (str.charCodeAt(i + 1) & 0xff) << 8;\n\t\tcase 1: h ^= (str.charCodeAt(i) & 0xff);\n\t\t\th = (((h & 0xffff) * 0x5bd1e995) + ((((h >>> 16) * 0x5bd1e995) & 0xffff) << 16));\n\t}\n\t/* eslint-enable no-fallthrough */\n\th ^= h >>> 13;\n\th = (((h & 0xffff) * 0x5bd1e995) + ((((h >>> 16) * 0x5bd1e995) & 0xffff) << 16));\n\th ^= h >>> 15;\n\th = h >>> 0;\n\treturn h;\n}\n\nexport type { SharedMapMemory };"],"names":["DEFAULT_HASH_SIZE","SharedMap","AllocatedMemory","loadPointer","memory","clone","hashMemory","storePointer","key","value","fullHashKey","get32BitHash","maxHash","hashKey","list","pointer","SharedList","listMemory","inserted","data","deleteCurrent","oldMaxHash","newMaxHash","newHashMemory","oldHashMemory","i","hashString","str","l","h","k"],"mappings":";;;AAQA,MAAMA,IAAoB;AAC1B,MAAqBC,EAAqC;AAAA,EACzD,OAAgB,iBAAiB;AAAA,EAEzB;AAAA;AAAA,EAEA;AAAA,EACA;AAAA,EACR,IAAY,aAA8B;AACzC,WAAO,IAAIC,EAAgB,KAAK,QAAQC,EAAY,KAAK,cAAc,MAAM,CAAC,CAAC;AAAA,EAChF;AAAA,EAEA,IAAI,SAAiB;AACpB,WAAO,QAAQ,KAAK,KAAK,cAAc,MAAM,CAAC;AAAA,EAC/C;AAAA,EACA,IAAI,UAAkB;AACrB,WAAO,QAAQ,KAAK,KAAK,cAAc,MAAM,CAAC;AAAA,EAC/C;AAAA,EAEA,YAAYC,GAAoBC,GAAyB;AAGxD,QAFA,KAAK,SAASD,GAEXC;AACF,WAAK,gBAAgB,IAAIH,EAAgBE,GAAQC,EAAM,UAAU;AAAA,SAC3D;AACN,WAAK,gBAAgBD,EAAO,UAAUH,EAAU,cAAc;AAC9D,UAAIK,IAAaF,EAAO,UAAUJ,CAAiB;AACnD,MAAAO,EAAa,KAAK,cAAc,MAAM,GAAGD,EAAW,gBAAgBA,EAAW,gBAAgB,GAC/F,QAAQ,MAAM,KAAK,cAAc,MAAM,GAAGN,CAAiB;AAAA,IAC5D;AACA,SAAK,OAAO,IAAI,WAAW,KAAK,cAAc,KAAK,QAAQ,KAAK,cAAc,mBAAmB,YAAY,mBAAmB,CAAC;AAAA,EAClI;AAAA,EAEA,IAAIQ,GAAQC,GAAe;AAC1B,IAAG,KAAK,UAAU,KAAK,UAAU,KAChC,KAAK,cAAA;AAGN,QAAIC,IAAcC,EAAaH,CAAG;AAClC,IAAG,KAAK,WAAW,KAAK,YAAY,KAAK,SAASE,GAAaD,CAAK,KACnE,QAAQ,IAAI,KAAK,cAAc,MAAM,GAAG,CAAC;AAAA,EAE3C;AAAA,EACQ,WAAWH,GAA6BM,GAAiBF,GAAqBD,GAAe;AACpG,QAAII,IAAU,KAAK,KAAKH,GAAaE,CAAO,GAExCE,GACAC,IAAUZ,EAAYG,EAAW,MAAMO,CAAO;AAClD,QAAGE,EAAQ,qBAAqB,GAAG;AAElC,MAAAD,IAAO,IAAIE,EAAW,KAAK,QAAQ;AAAA,QAClC,YAAY;AAAA,MAAA,CACZ;AAED,UAAIC,IAAaH,EAAK,gBAAA;AACtB,MAAAP,EAAaD,EAAW,MAAMO,GAASI,EAAW,WAAW,gBAAgBA,EAAW,WAAW,gBAAgB;AAAA,IACpH;AACC,MAAAH,IAAO,IAAIE,EAAW,KAAK,QAAQ;AAAA,QAClC,YAAYD;AAAA,MAAA,CACZ;AAIF,QAAIG,IAAW;AACf,WAAGJ,EAAK,YAAYJ,CAAW,MAC9BQ,IAAW,KAEZJ,EAAK,OAAO,CAACJ,GAAaD,CAAK,CAAC,GAEzBS;AAAA,EACR;AAAA,EAEA,IAAIV,GAA4B;AAC/B,QAAIE,IAAcC,EAAaH,CAAG,GAC9BK,IAAU,KAAK,KAAKH,GAAa,KAAK,OAAO,GAE7CK,IAAUZ,EAAY,KAAK,WAAW,MAAMU,CAAO;AACvD,QAAGE,EAAQ,qBAAqB;AAC/B;AAGD,QAAID,IAAO,IAAIE,EAAW,KAAK,QAAQ;AAAA,MACtC,YAAYD;AAAA,IAAA,CACZ;AAED,aAAQ,EAAE,MAAAI,EAAA,KAAUL;AACnB,UAAGK,EAAK,CAAC,MAAMT;AACd,eAAOS,EAAK,CAAC;AAAA,EAKhB;AAAA,EACA,IAAIX,GAAiB;AACpB,QAAIE,IAAcC,EAAaH,CAAG,GAC9BK,IAAU,KAAK,KAAKH,GAAa,KAAK,OAAO,GAE7CK,IAAUZ,EAAY,KAAK,WAAW,MAAMU,CAAO;AACvD,QAAGE,EAAQ,qBAAqB;AAC/B,aAAO;AAGR,QAAID,IAAO,IAAIE,EAAW,KAAK,QAAQ;AAAA,MACtC,YAAYD;AAAA,IAAA,CACZ;AAED,aAAQ,EAAE,MAAAI,EAAA,KAAUL;AACnB,UAAGK,EAAK,CAAC,MAAMT;AACd,eAAO;AAIT,WAAO;AAAA,EACR;AAAA,EAEA,OAAOF,GAAiB;AACvB,QAAIE,IAAcC,EAAaH,CAAG,GAC9BK,IAAU,KAAK,KAAKH,GAAa,KAAK,OAAO,GAE7CK,IAAUZ,EAAY,KAAK,WAAW,MAAMU,CAAO;AACvD,QAAGE,EAAQ,qBAAqB;AAC/B,aAAO;AAGR,QAAID,IAAO,IAAIE,EAAW,KAAK,QAAQ;AAAA,MACtC,YAAYD;AAAA,IAAA,CACZ;AAED,aAAQ,EAAE,MAAAI,GAAM,eAAAC,EAAA,KAAmBN;AAClC,UAAGK,EAAK,CAAC,MAAMT;AACd,eAAAU,EAAA,GAEA,QAAQ,IAAI,KAAK,cAAc,MAAM,GAAG,CAAC,GAClC;AAIT,WAAO;AAAA,EACR;AAAA,EAEQ,gBAAgB;AACvB,QAAIC,IAAa,KAAK,SAClBC,IAAaD,IAAa,GAC1BE,IAAgB,KAAK,OAAO,UAAUD,CAAU,GAChDE,IAAgB,KAAK;AAGzB,aAAQC,IAAI,GAAGA,IAAIJ,GAAYI,KAAK;AACnC,UAAIV,IAAUZ,EAAYqB,EAAc,MAAMC,CAAC;AAC/C,UAAGV,EAAQ,qBAAqB;AAC/B;AAGD,UAAID,IAAO,IAAIE,EAAW,KAAK,QAAQ;AAAA,QACtC,YAAYD;AAAA,MAAA,CACZ;AACD,eAAQ,EAAE,MAAAI,EAAA,KAAUL;AACnB,aAAK,WAAWS,GAAeD,GAAYH,EAAK,CAAC,GAAGA,EAAK,CAAC,CAAC;AAI5D,MAAAL,EAAK,KAAA;AAAA,IACN;AAEA,IAAAP,EAAa,KAAK,cAAc,MAAM,GAAGgB,EAAc,gBAAgBA,EAAc,gBAAgB,GACrG,QAAQ,MAAM,KAAK,cAAc,MAAM,GAAGD,CAAU,GAGpDE,EAAc,KAAA;AAAA,EACf;AAAA,EAEQ,KAAKhB,GAAaI,GAAiB;AAC1C,WAAOJ,IAAMI;AAAA,EACd;AAAA,EAEA,OAAO;AAEN,aAAQa,IAAI,GAAGA,IAAI,KAAK,SAASA,KAAK;AACrC,UAAIV,IAAUZ,EAAY,KAAK,WAAW,MAAMsB,CAAC;AACjD,UAAGV,EAAQ,qBAAqB;AAC/B;AAMD,MAHW,IAAIC,EAAW,KAAK,QAAQ;AAAA,QACtC,YAAYD;AAAA,MAAA,CACZ,EACI,KAAA;AAAA,IACN;AAEA,SAAK,WAAW,KAAA,GAChB,KAAK,cAAc,KAAA;AAAA,EACpB;AAAA,EAEA,kBAAmC;AAClC,WAAO;AAAA,MACN,YAAY,KAAK,cAAc,gBAAA;AAAA,IAAgB;AAAA,EAEjD;AACD;AAMA,SAASJ,EAAwCH,GAAgB;AAChE,SAAG,OAAOA,KAAQ,WACVA,IACE,OAAOA,KAAQ,WACjBkB,EAAWlB,CAAa,IAExBA;AAET;AAGA,SAASkB,EAAWC,GAAqB;AACxC,MACCC,IAAID,EAAI,QACRE,IAAI,KAAKD,GACTH,IAAI,GACJK;AACD,SAAMF,KAAK;AACV,IAAAE,IACGH,EAAI,WAAWF,CAAC,IAAI,OACpBE,EAAI,WAAW,EAAEF,CAAC,IAAI,QAAS,KAC/BE,EAAI,WAAW,EAAEF,CAAC,IAAI,QAAS,MAC/BE,EAAI,WAAW,EAAEF,CAAC,IAAI,QAAS,IAClCK,KAAOA,IAAI,SAAU,gBAAkBA,MAAM,MAAM,aAAc,UAAW,KAC5EA,KAAKA,MAAM,IACXA,KAAOA,IAAI,SAAU,gBAAkBA,MAAM,MAAM,aAAc,UAAW,KAC5ED,KAAOA,IAAI,SAAU,gBAAkBA,MAAM,MAAM,aAAc,UAAW,MAAOC,GACnFF,KAAK,GACL,EAAEH;AAGH,UAAOG,GAAA;AAAA,IACN,KAAK;AAAG,MAAAC,MAAMF,EAAI,WAAWF,IAAI,CAAC,IAAI,QAAS;AAAA,IAC/C,KAAK;AAAG,MAAAI,MAAMF,EAAI,WAAWF,IAAI,CAAC,IAAI,QAAS;AAAA,IAC/C,KAAK;AAAG,MAAAI,KAAMF,EAAI,WAAWF,CAAC,IAAI,KACjCI,KAAOA,IAAI,SAAU,gBAAkBA,MAAM,MAAM,aAAc,UAAW;AAAA,EAAA;AAG9E,SAAAA,KAAKA,MAAM,IACXA,KAAOA,IAAI,SAAU,gBAAkBA,MAAM,MAAM,aAAc,UAAW,KAC5EA,KAAKA,MAAM,IACXA,IAAIA,MAAM,GACHA;AACR;"}
+{"version":3,"file":"shared-map.js","names":[],"sources":["../src/shared-map.ts"],"sourcesContent":["import AllocatedMemory, { type SharedAllocatedMemory } from './allocated-memory';\nimport type MemoryHeap from './memory-heap';\nimport SharedList from './shared-list';\nimport { loadPointer, storePointer } from './utils/pointer';\n\n// TODO: Grow hashMemory\n// TODO: Add iterator\n// TODO: Add read/write locks\nconst DEFAULT_HASH_SIZE = 10;\nexport default class SharedMap<K extends string | number> {\n\tstatic readonly ALLOCATE_COUNT = 4;\n\n\tprivate memory: MemoryHeap;\n\t// Memory order: Pointer, Lock, Length, MaxHash\n\tprivate pointerMemory: AllocatedMemory;\n\tprivate lock: Int32Array;\n\tprivate get hashMemory(): AllocatedMemory {\n\t\treturn new AllocatedMemory(this.memory, loadPointer(this.pointerMemory.data, 0));\n\t}\n\n\tget length(): number {\n\t\treturn Atomics.load(this.pointerMemory.data, 2);\n\t}\n\tget maxHash(): number {\n\t\treturn Atomics.load(this.pointerMemory.data, 3);\n\t}\n\n\tconstructor(memory: MemoryHeap, clone?: SharedMapMemory) {\n\t\tthis.memory = memory;\n\n\t\tif(clone) {\n\t\t\tthis.pointerMemory = new AllocatedMemory(memory, clone.firstBlock);\n\t\t} else {\n\t\t\tthis.pointerMemory = memory.allocUI32(SharedMap.ALLOCATE_COUNT);\n\t\t\tlet hashMemory = memory.allocUI32(DEFAULT_HASH_SIZE);\n\t\t\tstorePointer(this.pointerMemory.data, 0, hashMemory.bufferPosition, hashMemory.bufferByteOffset);\n\t\t\tAtomics.store(this.pointerMemory.data, 3, DEFAULT_HASH_SIZE);\n\t\t}\n\t\tthis.lock = new Int32Array(this.pointerMemory.data.buffer, this.pointerMemory.bufferByteOffset + Uint32Array.BYTES_PER_ELEMENT, 1);\n\t}\n\n\tset(key: K, value: number) {\n\t\tif(this.length >= this.maxHash * 2) {\n\t\t\tthis.growHashTable();\n\t\t}\n\n\t\tlet fullHashKey = get32BitHash(key);\n\t\tif(this.setHashKey(this.hashMemory, this.maxHash, fullHashKey, value)) {\n\t\t\tAtomics.add(this.pointerMemory.data, 2, 1);\n\t\t}\n\t}\n\tprivate setHashKey(hashMemory: AllocatedMemory, maxHash: number, fullHashKey: number, value: number) {\n\t\tlet hashKey = this.hash(fullHashKey, maxHash);\n\t\t\n\t\tlet list: SharedList;\n\t\tlet pointer = loadPointer(hashMemory.data, hashKey);\n\t\tif(pointer.bufferByteOffset === 0) {\n\t\t\t// Initialize a list here\n\t\t\tlist = new SharedList(this.memory, {\n\t\t\t\tdataLength: 2,\n\t\t\t});\n\n\t\t\tlet listMemory = list.getSharedMemory();\n\t\t\tstorePointer(hashMemory.data, hashKey, listMemory.firstBlock.bufferPosition, listMemory.firstBlock.bufferByteOffset);\n\t\t} else {\n\t\t\tlist = new SharedList(this.memory, {\n\t\t\t\tfirstBlock: pointer,\n\t\t\t});\n\t\t}\n\n\t\t// Check if any other items in list have the same key and delete them\n\t\tlet inserted = true;\n\t\tif(list.deleteValue(fullHashKey)) {\n\t\t\tinserted = false;\n\t\t}\n\t\tlist.insert([fullHashKey, value]);\n\t\t// An overwrite leaves a tombstone behind - reclaim it so buckets don't grow on repeated updates\n\t\tif(!inserted) {\n\t\t\tlist.compact();\n\t\t}\n\n\t\treturn inserted;\n\t}\n\n\tget(key: K): number | undefined {\n\t\tlet fullHashKey = get32BitHash(key);\n\t\tlet hashKey = this.hash(fullHashKey, this.maxHash);\n\n\t\tlet pointer = loadPointer(this.hashMemory.data, hashKey);\n\t\tif(pointer.bufferByteOffset === 0) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\tlet list = new SharedList(this.memory, {\n\t\t\tfirstBlock: pointer,\n\t\t});\n\n\t\tfor(let { data } of list) {\n\t\t\tif(data[0] === fullHashKey) {\n\t\t\t\treturn data[1];\n\t\t\t}\n\t\t}\n\n\t\treturn undefined;\n\t}\n\thas(key: K): boolean {\n\t\tlet fullHashKey = get32BitHash(key);\n\t\tlet hashKey = this.hash(fullHashKey, this.maxHash);\n\n\t\tlet pointer = loadPointer(this.hashMemory.data, hashKey);\n\t\tif(pointer.bufferByteOffset === 0) {\n\t\t\treturn false;\n\t\t}\n\n\t\tlet list = new SharedList(this.memory, {\n\t\t\tfirstBlock: pointer,\n\t\t});\n\n\t\tfor(let { data } of list) {\n\t\t\tif(data[0] === fullHashKey) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\n\t\treturn false;\n\t}\n\n\tdelete(key: K): boolean {\n\t\tlet fullHashKey = get32BitHash(key);\n\t\tlet hashKey = this.hash(fullHashKey, this.maxHash);\n\n\t\tlet pointer = loadPointer(this.hashMemory.data, hashKey);\n\t\tif(pointer.bufferByteOffset === 0) {\n\t\t\treturn false;\n\t\t}\n\n\t\tlet list = new SharedList(this.memory, {\n\t\t\tfirstBlock: pointer,\n\t\t});\n\n\t\tlet deleted = false;\n\t\tfor(let { data, deleteCurrent } of list) {\n\t\t\tif(data[0] === fullHashKey) {\n\t\t\t\tdeleteCurrent();\n\n\t\t\t\tAtomics.sub(this.pointerMemory.data, 2, 1);\n\t\t\t\tdeleted = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\t// compact only after iteration finishes - unlinking/freeing mid-iteration would corrupt the walk\n\t\tif(deleted) {\n\t\t\tlist.compact();\n\t\t}\n\n\t\treturn deleted;\n\t}\n\n\tprivate growHashTable() {\n\t\tlet oldMaxHash = this.maxHash;\n\t\tlet newMaxHash = oldMaxHash * 2;\n\t\tlet newHashMemory = this.memory.allocUI32(newMaxHash);\n\t\tlet oldHashMemory = this.hashMemory;\n\n\t\t// Copy each old hash value into new hash memory\n\t\tfor(let i = 0; i < oldMaxHash; i++) {\n\t\t\tlet pointer = loadPointer(oldHashMemory.data, i);\n\t\t\tif(pointer.bufferByteOffset === 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tlet list = new SharedList(this.memory, {\n\t\t\t\tfirstBlock: pointer,\n\t\t\t});\n\t\t\tfor(let { data } of list) {\n\t\t\t\tthis.setHashKey(newHashMemory, newMaxHash, data[0], data[1]);\n\t\t\t}\n\n\t\t\t// The entries have been copied into freshly allocated lists in the new hash table so the old list can be freed\n\t\t\tlist.free();\n\t\t}\n\n\t\tstorePointer(this.pointerMemory.data, 0, newHashMemory.bufferPosition, newHashMemory.bufferByteOffset);\n\t\tAtomics.store(this.pointerMemory.data, 3, newMaxHash);\n\n\t\t// pointerMemory now references newHashMemory so the old hash table memory can be freed\n\t\toldHashMemory.free();\n\t}\n\n\tprivate hash(key: number, maxHash: number) {\n\t\treturn key % maxHash;\n\t}\n\n\tfree() {\n\t\t// Loop through and free lists in hash table first\n\t\tfor(let i = 0; i < this.maxHash; i++) {\n\t\t\tlet pointer = loadPointer(this.hashMemory.data, i);\n\t\t\tif(pointer.bufferByteOffset === 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tlet list = new SharedList(this.memory, {\n\t\t\t\tfirstBlock: pointer,\n\t\t\t});\n\t\t\tlist.free();\n\t\t}\n\n\t\tthis.hashMemory.free();\n\t\tthis.pointerMemory.free();\n\t}\n\n\tgetSharedMemory(): SharedMapMemory {\n\t\treturn {\n\t\t\tfirstBlock: this.pointerMemory.getSharedMemory(),\n\t\t};\n\t}\n}\n\ninterface SharedMapMemory {\n\tfirstBlock: SharedAllocatedMemory\n}\n\nfunction get32BitHash<K extends string | number>(key: K): number {\n\tif(typeof key === 'number') {\n\t\treturn key;\n\t} else if(typeof key === 'string') {\n\t\treturn hashString(key);\n\t} else {\n\t\treturn key;\n\t}\n}\n\n// Copied from https://github.com/mmomtchev/SharedMap/blob/master/index.js - MurmurHash2\nfunction hashString(str: string): number {\n\tlet\n\t\tl = str.length,\n\t\th = 17 ^ l,\n\t\ti = 0,\n\t\tk;\n\twhile(l >= 4) {\n\t\tk =\n\t\t\t((str.charCodeAt(i) & 0xff)) |\n\t\t\t((str.charCodeAt(++i) & 0xff) << 8) |\n\t\t\t((str.charCodeAt(++i) & 0xff) << 16) |\n\t\t\t((str.charCodeAt(++i) & 0xff) << 14);\n\t\tk = (((k & 0xffff) * 0x5bd1e995) + ((((k >>> 16) * 0x5bd1e995) & 0xffff) << 16));\n\t\tk ^= k >>> 14;\n\t\tk = (((k & 0xffff) * 0x5bd1e995) + ((((k >>> 16) * 0x5bd1e995) & 0xffff) << 16));\n\t\th = (((h & 0xffff) * 0x5bd1e995) + ((((h >>> 16) * 0x5bd1e995) & 0xffff) << 16)) ^ k;\n\t\tl -= 4;\n\t\t++i;\n\t}\n\t/* eslint-disable no-fallthrough */\n\tswitch(l) {\n\t\tcase 3: h ^= (str.charCodeAt(i + 2) & 0xff) << 16;\n\t\tcase 2: h ^= (str.charCodeAt(i + 1) & 0xff) << 8;\n\t\tcase 1: h ^= (str.charCodeAt(i) & 0xff);\n\t\t\th = (((h & 0xffff) * 0x5bd1e995) + ((((h >>> 16) * 0x5bd1e995) & 0xffff) << 16));\n\t}\n\t/* eslint-enable no-fallthrough */\n\th ^= h >>> 13;\n\th = (((h & 0xffff) * 0x5bd1e995) + ((((h >>> 16) * 0x5bd1e995) & 0xffff) << 16));\n\th ^= h >>> 15;\n\th = h >>> 0;\n\treturn h;\n}\n\nexport type { SharedMapMemory };"],"mappings":";;;;AAQA,IAAM,IAAoB,IACL,IAArB,MAAqB,EAAqC;CACzD,OAAgB,iBAAiB;CAEjC;CAEA;CACA;CACA,IAAY,aAA8B;EACzC,OAAO,IAAI,EAAgB,KAAK,QAAQ,EAAY,KAAK,cAAc,MAAM,CAAC,CAAC;CAChF;CAEA,IAAI,SAAiB;EACpB,OAAO,QAAQ,KAAK,KAAK,cAAc,MAAM,CAAC;CAC/C;CACA,IAAI,UAAkB;EACrB,OAAO,QAAQ,KAAK,KAAK,cAAc,MAAM,CAAC;CAC/C;CAEA,YAAY,GAAoB,GAAyB;EAGxD,IAFA,KAAK,SAAS,GAEX,GACF,KAAK,gBAAgB,IAAI,EAAgB,GAAQ,EAAM,UAAU;OAC3D;GACN,KAAK,gBAAgB,EAAO,UAAU,EAAU,cAAc;GAC9D,IAAI,IAAa,EAAO,UAAU,CAAiB;GAEnD,AADA,EAAa,KAAK,cAAc,MAAM,GAAG,EAAW,gBAAgB,EAAW,gBAAgB,GAC/F,QAAQ,MAAM,KAAK,cAAc,MAAM,GAAG,CAAiB;EAC5D;EACA,KAAK,OAAO,IAAI,WAAW,KAAK,cAAc,KAAK,QAAQ,KAAK,cAAc,mBAAmB,YAAY,mBAAmB,CAAC;CAClI;CAEA,IAAI,GAAQ,GAAe;EAC1B,AAAG,KAAK,UAAU,KAAK,UAAU,KAChC,KAAK,cAAc;EAGpB,IAAI,IAAc,EAAa,CAAG;EAClC,AAAG,KAAK,WAAW,KAAK,YAAY,KAAK,SAAS,GAAa,CAAK,KACnE,QAAQ,IAAI,KAAK,cAAc,MAAM,GAAG,CAAC;CAE3C;CACA,WAAmB,GAA6B,GAAiB,GAAqB,GAAe;EACpG,IAAI,IAAU,KAAK,KAAK,GAAa,CAAO,GAExC,GACA,IAAU,EAAY,EAAW,MAAM,CAAO;EAClD,IAAG,EAAQ,qBAAqB,GAAG;GAElC,IAAO,IAAI,EAAW,KAAK,QAAQ,EAClC,YAAY,EACb,CAAC;GAED,IAAI,IAAa,EAAK,gBAAgB;GACtC,EAAa,EAAW,MAAM,GAAS,EAAW,WAAW,gBAAgB,EAAW,WAAW,gBAAgB;EACpH,OACC,IAAO,IAAI,EAAW,KAAK,QAAQ,EAClC,YAAY,EACb,CAAC;EAIF,IAAI,IAAW;EAUf,OATG,EAAK,YAAY,CAAW,MAC9B,IAAW,KAEZ,EAAK,OAAO,CAAC,GAAa,CAAK,CAAC,GAE5B,KACH,EAAK,QAAQ,GAGP;CACR;CAEA,IAAI,GAA4B;EAC/B,IAAI,IAAc,EAAa,CAAG,GAC9B,IAAU,KAAK,KAAK,GAAa,KAAK,OAAO,GAE7C,IAAU,EAAY,KAAK,WAAW,MAAM,CAAO;EACvD,IAAG,EAAQ,qBAAqB,GAC/B;EAGD,IAAI,IAAO,IAAI,EAAW,KAAK,QAAQ,EACtC,YAAY,EACb,CAAC;EAED,KAAI,IAAI,EAAE,aAAU,GACnB,IAAG,EAAK,OAAO,GACd,OAAO,EAAK;CAKf;CACA,IAAI,GAAiB;EACpB,IAAI,IAAc,EAAa,CAAG,GAC9B,IAAU,KAAK,KAAK,GAAa,KAAK,OAAO,GAE7C,IAAU,EAAY,KAAK,WAAW,MAAM,CAAO;EACvD,IAAG,EAAQ,qBAAqB,GAC/B,OAAO;EAGR,IAAI,IAAO,IAAI,EAAW,KAAK,QAAQ,EACtC,YAAY,EACb,CAAC;EAED,KAAI,IAAI,EAAE,aAAU,GACnB,IAAG,EAAK,OAAO,GACd,OAAO;EAIT,OAAO;CACR;CAEA,OAAO,GAAiB;EACvB,IAAI,IAAc,EAAa,CAAG,GAC9B,IAAU,KAAK,KAAK,GAAa,KAAK,OAAO,GAE7C,IAAU,EAAY,KAAK,WAAW,MAAM,CAAO;EACvD,IAAG,EAAQ,qBAAqB,GAC/B,OAAO;EAGR,IAAI,IAAO,IAAI,EAAW,KAAK,QAAQ,EACtC,YAAY,EACb,CAAC,GAEG,IAAU;EACd,KAAI,IAAI,EAAE,SAAM,sBAAmB,GAClC,IAAG,EAAK,OAAO,GAAa;GAI3B,AAHA,EAAc,GAEd,QAAQ,IAAI,KAAK,cAAc,MAAM,GAAG,CAAC,GACzC,IAAU;GACV;EACD;EAQD,OAJG,KACF,EAAK,QAAQ,GAGP;CACR;CAEA,gBAAwB;EACvB,IAAI,IAAa,KAAK,SAClB,IAAa,IAAa,GAC1B,IAAgB,KAAK,OAAO,UAAU,CAAU,GAChD,IAAgB,KAAK;EAGzB,KAAI,IAAI,IAAI,GAAG,IAAI,GAAY,KAAK;GACnC,IAAI,IAAU,EAAY,EAAc,MAAM,CAAC;GAC/C,IAAG,EAAQ,qBAAqB,GAC/B;GAGD,IAAI,IAAO,IAAI,EAAW,KAAK,QAAQ,EACtC,YAAY,EACb,CAAC;GACD,KAAI,IAAI,EAAE,aAAU,GACnB,KAAK,WAAW,GAAe,GAAY,EAAK,IAAI,EAAK,EAAE;GAI5D,EAAK,KAAK;EACX;EAMA,AAJA,EAAa,KAAK,cAAc,MAAM,GAAG,EAAc,gBAAgB,EAAc,gBAAgB,GACrG,QAAQ,MAAM,KAAK,cAAc,MAAM,GAAG,CAAU,GAGpD,EAAc,KAAK;CACpB;CAEA,KAAa,GAAa,GAAiB;EAC1C,OAAO,IAAM;CACd;CAEA,OAAO;EAEN,KAAI,IAAI,IAAI,GAAG,IAAI,KAAK,SAAS,KAAK;GACrC,IAAI,IAAU,EAAY,KAAK,WAAW,MAAM,CAAC;GAC9C,EAAQ,qBAAqB,KAOhC,IAHe,EAAW,KAAK,QAAQ,EACtC,YAAY,EACb,CACA,CAAA,CAAK,KAAK;EACX;EAGA,AADA,KAAK,WAAW,KAAK,GACrB,KAAK,cAAc,KAAK;CACzB;CAEA,kBAAmC;EAClC,OAAO,EACN,YAAY,KAAK,cAAc,gBAAgB,EAChD;CACD;AACD;AAMA,SAAS,EAAwC,GAAgB;CAM/D,OALE,OAAO,KAAQ,WACV,IACE,OAAO,KAAQ,WACjB,EAAW,CAAG,IAEd;AAET;AAGA,SAAS,EAAW,GAAqB;CACxC,IACC,IAAI,EAAI,QACR,IAAI,KAAK,GACT,IAAI,GACJ;CACD,OAAM,KAAK,IAWV,AAVA,IACG,EAAI,WAAW,CAAC,IAAI,OACpB,EAAI,WAAW,EAAE,CAAC,IAAI,QAAS,KAC/B,EAAI,WAAW,EAAE,CAAC,IAAI,QAAS,MAC/B,EAAI,WAAW,EAAE,CAAC,IAAI,QAAS,IAClC,KAAO,IAAI,SAAU,gBAAkB,MAAM,MAAM,aAAc,UAAW,KAC5E,KAAK,MAAM,IACX,KAAO,IAAI,SAAU,gBAAkB,MAAM,MAAM,aAAc,UAAW,KAC5E,KAAO,IAAI,SAAU,gBAAkB,MAAM,MAAM,aAAc,UAAW,MAAO,GACnF,KAAK,GACL,EAAE;CAGH,QAAO,GAAP;EACC,KAAK,GAAG,MAAM,EAAI,WAAW,IAAI,CAAC,IAAI,QAAS;EAC/C,KAAK,GAAG,MAAM,EAAI,WAAW,IAAI,CAAC,IAAI,QAAS;EAC/C,KAAK,GACJ,AADO,KAAM,EAAI,WAAW,CAAC,IAAI,KACjC,KAAO,IAAI,SAAU,gBAAkB,MAAM,MAAM,aAAc,UAAW;CAC9E;CAMA,OAJA,KAAK,MAAM,IACX,KAAO,IAAI,SAAU,gBAAkB,MAAM,MAAM,aAAc,UAAW,KAC5E,KAAK,MAAM,IACX,OAAU,GACH;AACR"}

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

@@ -1,6 +1,6 @@
-import { default as AllocatedMemory } from './allocated-memory';
-import { default as MemoryHeap } from './memory-heap';
-import { SharedListMemory } from './shared-list';
+import AllocatedMemory from './allocated-memory';
+import type MemoryHeap from './memory-heap';
+import type { SharedListMemory } from './shared-list';
 export default abstract class SharedPointerList<T extends PointerItem> implements Iterable<T> {
     private memory;
     private list;
@@ -8,6 +8,7 @@ export default abstract class SharedPointerList<T extends PointerItem> implement
     get length(): number;
     insert(item: T): void;
     delete(item: T): boolean;
+    compact(): void;
     [Symbol.iterator](): Generator<T, void, unknown>;
     forEach(callback: (item: T) => void): void;
     find(callback: (item: T) => boolean): T | undefined;

package/dist/shared-pointer-list.js

@@ -1,50 +1,51 @@
-import l from "./allocated-memory.js";
+import { createPointer as e, loadPointer as t } from "./utils/pointer.js";
+import n from "./allocated-memory.js";
 import r from "./shared-list.js";
-import { createPointer as i, loadPointer as m } from "./utils/pointer.js";
-class u {
-  memory;
-  list;
-  constructor(e, t) {
-    this.memory = e, t ? this.list = new r(e, t) : this.list = new r(e);
-  }
-  get length() {
-    return this.list.length;
-  }
-  insert(e) {
-    this.list.insert(i(e.memory.bufferPosition, e.memory.bufferByteOffset));
-  }
-  delete(e) {
-    return this.list.deleteValue(i(e.memory.bufferPosition, e.memory.bufferByteOffset));
-  }
-  *[Symbol.iterator]() {
-    let e = this.list[Symbol.iterator]();
-    for (let { data: t } of e) {
-      let { bufferPosition: o, bufferByteOffset: f } = m(t, 0), s = new l(this.memory, {
-        bufferPosition: o,
-        bufferByteOffset: f
-      });
-      yield this.createItem(s);
-    }
-  }
-  forEach(e) {
-    for (let t of this)
-      e(t);
-  }
-  find(e) {
-    for (let t of this)
-      if (e(t))
-        return t;
-  }
-  getSharedMemory() {
-    return this.list.getSharedMemory();
-  }
-  free() {
-    for (let e of this)
-      "free" in e && typeof e.free == "function" ? e.free() : e.memory.free();
-    this.list.free();
-  }
-}
-export {
-  u as default
+//#region src/shared-pointer-list.ts
+var i = class {
+	memory;
+	list;
+	constructor(e, t) {
+		this.memory = e, this.list = t ? new r(e, t) : new r(e);
+	}
+	get length() {
+		return this.list.length;
+	}
+	insert(t) {
+		this.list.insert(e(t.memory.bufferPosition, t.memory.bufferByteOffset));
+	}
+	delete(t) {
+		let n = this.list.deleteValue(e(t.memory.bufferPosition, t.memory.bufferByteOffset));
+		return this.list.compact(), n;
+	}
+	compact() {
+		this.list.compact();
+	}
+	*[Symbol.iterator]() {
+		let e = this.list[Symbol.iterator]();
+		for (let { data: r } of e) {
+			let { bufferPosition: e, bufferByteOffset: i } = t(r, 0), a = new n(this.memory, {
+				bufferPosition: e,
+				bufferByteOffset: i
+			});
+			yield this.createItem(a);
+		}
+	}
+	forEach(e) {
+		for (let t of this) e(t);
+	}
+	find(e) {
+		for (let t of this) if (e(t)) return t;
+	}
+	getSharedMemory() {
+		return this.list.getSharedMemory();
+	}
+	free() {
+		for (let e of this) "free" in e && typeof e.free == "function" ? e.free() : e.memory.free();
+		this.list.free();
+	}
 };
-//# sourceMappingURL=shared-pointer-list.js.map
+//#endregion
+export { i as default };
+
+//# sourceMappingURL=shared-pointer-list.js.map

package/dist/shared-pointer-list.js.map

@@ -1 +1 @@
-{"version":3,"file":"shared-pointer-list.js","sources":["../src/shared-pointer-list.ts"],"sourcesContent":["import AllocatedMemory from './allocated-memory';\nimport type MemoryHeap from './memory-heap';\nimport type { SharedListMemory } from './shared-list';\nimport SharedList from './shared-list';\nimport { createPointer, loadPointer } from './utils/pointer';\n\nexport default abstract class SharedPointerList<T extends PointerItem> implements Iterable<T> {\n\tprivate memory: MemoryHeap;\n\tprivate list: SharedList;\n\n\tconstructor(heap: MemoryHeap, memory?: SharedListMemory) {\n\t\tthis.memory = heap;\n\n\t\tif(memory) {\n\t\t\tthis.list = new SharedList(heap, memory);\n\t\t} else {\n\t\t\tthis.list = new SharedList(heap);\n\t\t}\n\t}\n\n\tget length() {\n\t\treturn this.list.length;\n\t}\n\n\tinsert(item: T) {\n\t\tthis.list.insert(createPointer(item.memory.bufferPosition, item.memory.bufferByteOffset));\n\t}\n\tdelete(item: T) {\n\t\treturn this.list.deleteValue(createPointer(item.memory.bufferPosition, item.memory.bufferByteOffset));\n\t}\n\n\t*[Symbol.iterator]() {\n\t\tlet iterator = this.list[Symbol.iterator]();\n\n\t\tfor(let { data: pointerData } of iterator) {\n\t\t\tlet { bufferPosition, bufferByteOffset } = loadPointer(pointerData, 0);\n\t\t\tlet allocatedMemory = new AllocatedMemory(this.memory, {\n\t\t\t\tbufferPosition,\n\t\t\t\tbufferByteOffset\n\t\t\t});\n\t\t\tyield this.createItem(allocatedMemory);\n\t\t}\n\t}\n\tforEach(callback: (item: T) => void) {\n\t\tfor(let value of this) {\n\t\t\tcallback(value);\n\t\t}\n\t}\n\n\tfind(callback: (item: T) => boolean): T | undefined {\n\t\tfor(let value of this) {\n\t\t\tif(callback(value)) {\n\t\t\t\treturn value;\n\t\t\t}\n\t\t}\n\t}\n\n\tgetSharedMemory() {\n\t\treturn this.list.getSharedMemory();\n\t}\n\n\tprotected abstract createItem(allocatedMemory: AllocatedMemory): T;\n\n\tfree() {\n\t\tfor(let item of this) {\n\t\t\t// NOTE: Anything that allocates it's own memory (ie: type for Item) needs to call free for that class so we can clear all memory recursively\n\t\t\tif('free' in item && typeof item.free === 'function') {\n\t\t\t\titem.free();\n\t\t\t} else {\n\t\t\t\titem.memory.free();\n\t\t\t}\n\t\t}\n\n\t\tthis.list.free();\n\t}\n}\n\ninterface PointerItem {\n\treadonly memory: AllocatedMemory\n}"],"names":["SharedPointerList","heap","memory","SharedList","item","createPointer","iterator","pointerData","bufferPosition","bufferByteOffset","loadPointer","allocatedMemory","AllocatedMemory","callback","value"],"mappings":";;;AAMA,MAA8BA,EAAgE;AAAA,EACrF;AAAA,EACA;AAAA,EAER,YAAYC,GAAkBC,GAA2B;AACxD,SAAK,SAASD,GAEXC,IACF,KAAK,OAAO,IAAIC,EAAWF,GAAMC,CAAM,IAEvC,KAAK,OAAO,IAAIC,EAAWF,CAAI;AAAA,EAEjC;AAAA,EAEA,IAAI,SAAS;AACZ,WAAO,KAAK,KAAK;AAAA,EAClB;AAAA,EAEA,OAAOG,GAAS;AACf,SAAK,KAAK,OAAOC,EAAcD,EAAK,OAAO,gBAAgBA,EAAK,OAAO,gBAAgB,CAAC;AAAA,EACzF;AAAA,EACA,OAAOA,GAAS;AACf,WAAO,KAAK,KAAK,YAAYC,EAAcD,EAAK,OAAO,gBAAgBA,EAAK,OAAO,gBAAgB,CAAC;AAAA,EACrG;AAAA,EAEA,EAAE,OAAO,QAAQ,IAAI;AACpB,QAAIE,IAAW,KAAK,KAAK,OAAO,QAAQ,EAAA;AAExC,aAAQ,EAAE,MAAMC,EAAA,KAAiBD,GAAU;AAC1C,UAAI,EAAE,gBAAAE,GAAgB,kBAAAC,EAAA,IAAqBC,EAAYH,GAAa,CAAC,GACjEI,IAAkB,IAAIC,EAAgB,KAAK,QAAQ;AAAA,QACtD,gBAAAJ;AAAA,QACA,kBAAAC;AAAA,MAAA,CACA;AACD,YAAM,KAAK,WAAWE,CAAe;AAAA,IACtC;AAAA,EACD;AAAA,EACA,QAAQE,GAA6B;AACpC,aAAQC,KAAS;AAChB,MAAAD,EAASC,CAAK;AAAA,EAEhB;AAAA,EAEA,KAAKD,GAA+C;AACnD,aAAQC,KAAS;AAChB,UAAGD,EAASC,CAAK;AAChB,eAAOA;AAAA,EAGV;AAAA,EAEA,kBAAkB;AACjB,WAAO,KAAK,KAAK,gBAAA;AAAA,EAClB;AAAA,EAIA,OAAO;AACN,aAAQV,KAAQ;AAEf,MAAG,UAAUA,KAAQ,OAAOA,EAAK,QAAS,aACzCA,EAAK,KAAA,IAELA,EAAK,OAAO,KAAA;AAId,SAAK,KAAK,KAAA;AAAA,EACX;AACD;"}
+{"version":3,"file":"shared-pointer-list.js","names":[],"sources":["../src/shared-pointer-list.ts"],"sourcesContent":["import AllocatedMemory from './allocated-memory';\nimport type MemoryHeap from './memory-heap';\nimport type { SharedListMemory } from './shared-list';\nimport SharedList from './shared-list';\nimport { createPointer, loadPointer } from './utils/pointer';\n\nexport default abstract class SharedPointerList<T extends PointerItem> implements Iterable<T> {\n\tprivate memory: MemoryHeap;\n\tprivate list: SharedList;\n\n\tconstructor(heap: MemoryHeap, memory?: SharedListMemory) {\n\t\tthis.memory = heap;\n\n\t\tif(memory) {\n\t\t\tthis.list = new SharedList(heap, memory);\n\t\t} else {\n\t\t\tthis.list = new SharedList(heap);\n\t\t}\n\t}\n\n\tget length() {\n\t\treturn this.list.length;\n\t}\n\n\tinsert(item: T) {\n\t\tthis.list.insert(createPointer(item.memory.bufferPosition, item.memory.bufferByteOffset));\n\t}\n\tdelete(item: T) {\n\t\tlet deleted = this.list.deleteValue(createPointer(item.memory.bufferPosition, item.memory.bufferByteOffset));\n\t\t// This wrapper is single-threaded per instance, so reclaim the tombstoned node right away\n\t\tthis.list.compact();\n\t\treturn deleted;\n\t}\n\n\tcompact() {\n\t\tthis.list.compact();\n\t}\n\n\t*[Symbol.iterator]() {\n\t\tlet iterator = this.list[Symbol.iterator]();\n\n\t\tfor(let { data: pointerData } of iterator) {\n\t\t\tlet { bufferPosition, bufferByteOffset } = loadPointer(pointerData, 0);\n\t\t\tlet allocatedMemory = new AllocatedMemory(this.memory, {\n\t\t\t\tbufferPosition,\n\t\t\t\tbufferByteOffset,\n\t\t\t});\n\t\t\tyield this.createItem(allocatedMemory);\n\t\t}\n\t}\n\tforEach(callback: (item: T) => void) {\n\t\tfor(let value of this) {\n\t\t\tcallback(value);\n\t\t}\n\t}\n\n\tfind(callback: (item: T) => boolean): T | undefined {\n\t\tfor(let value of this) {\n\t\t\tif(callback(value)) {\n\t\t\t\treturn value;\n\t\t\t}\n\t\t}\n\n\t\treturn undefined;\n\t}\n\n\tgetSharedMemory() {\n\t\treturn this.list.getSharedMemory();\n\t}\n\n\tprotected abstract createItem(allocatedMemory: AllocatedMemory): T;\n\n\tfree() {\n\t\tfor(let item of this) {\n\t\t\t// NOTE: Anything that allocates it's own memory (ie: type for Item) needs to call free for that class so we can clear all memory recursively\n\t\t\tif('free' in item && typeof item.free === 'function') {\n\t\t\t\titem.free();\n\t\t\t} else {\n\t\t\t\titem.memory.free();\n\t\t\t}\n\t\t}\n\n\t\tthis.list.free();\n\t}\n}\n\ninterface PointerItem {\n\treadonly memory: AllocatedMemory\n}"],"mappings":";;;;AAMA,IAA8B,IAA9B,MAA8F;CAC7F;CACA;CAEA,YAAY,GAAkB,GAA2B;EAGxD,AAFA,KAAK,SAAS,GAEd,AAGC,KAAK,OAHH,IACU,IAAI,EAAW,GAAM,CAAM,IAE3B,IAAI,EAAW,CAAI;CAEjC;CAEA,IAAI,SAAS;EACZ,OAAO,KAAK,KAAK;CAClB;CAEA,OAAO,GAAS;EACf,KAAK,KAAK,OAAO,EAAc,EAAK,OAAO,gBAAgB,EAAK,OAAO,gBAAgB,CAAC;CACzF;CACA,OAAO,GAAS;EACf,IAAI,IAAU,KAAK,KAAK,YAAY,EAAc,EAAK,OAAO,gBAAgB,EAAK,OAAO,gBAAgB,CAAC;EAG3G,OADA,KAAK,KAAK,QAAQ,GACX;CACR;CAEA,UAAU;EACT,KAAK,KAAK,QAAQ;CACnB;CAEA,EAAE,OAAO,YAAY;EACpB,IAAI,IAAW,KAAK,KAAK,OAAO,SAAS,CAAC;EAE1C,KAAI,IAAI,EAAE,MAAM,OAAiB,GAAU;GAC1C,IAAI,EAAE,mBAAgB,wBAAqB,EAAY,GAAa,CAAC,GACjE,IAAkB,IAAI,EAAgB,KAAK,QAAQ;IACtD;IACA;GACD,CAAC;GACD,MAAM,KAAK,WAAW,CAAe;EACtC;CACD;CACA,QAAQ,GAA6B;EACpC,KAAI,IAAI,KAAS,MAChB,EAAS,CAAK;CAEhB;CAEA,KAAK,GAA+C;EACnD,KAAI,IAAI,KAAS,MAChB,IAAG,EAAS,CAAK,GAChB,OAAO;CAKV;CAEA,kBAAkB;EACjB,OAAO,KAAK,KAAK,gBAAgB;CAClC;CAIA,OAAO;EACN,KAAI,IAAI,KAAQ,MAEf,AAAG,UAAU,KAAQ,OAAO,EAAK,QAAS,aACzC,EAAK,KAAK,IAEV,EAAK,OAAO,KAAK;EAInB,KAAK,KAAK,KAAK;CAChB;AACD"}

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

@@ -1,14 +1,20 @@
-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 SharedPool<T extends Uint32Array | Int32Array | Float32Array | Float64Array = Uint32Array> implements Iterable<T> {
-    static readonly ALLOCATE_COUNT: number;
+    static readonly ALLOCATE_COUNT = 6;
     private memory;
     private firstBlock;
     private uint16Array;
-    private pointerVector;
-    private recycleVector;
+    private growLock;
+    private pointerStack;
+    private recycleStack;
+    readonly maxLength: number;
     private cachedFullDataBlock;
+    private readonly cachedMaxChunkSize;
+    private readonly cachedDataLength;
+    private readonly cachedType;
+    private readonly cachedByteMultipler;
     get length(): number;
     get maxChunkSize(): number;
     private set maxChunkSize(value);
@@ -17,8 +23,8 @@ export default class SharedPool<T extends Uint32Array | Int32Array | Float32Arra
     get dataLength(): number;
     private set dataLength(value);
     get bufferLength(): number;
-    get recycleBufferLength(): number;
     get byteMultipler(): number;
+    get usedMemory(): number;
     constructor(memory: MemoryHeap, config?: SharedPoolConfig<T> | SharedPoolMemory);
     at(index: number): T;
     get(index: number, dataIndex?: number): number;
@@ -33,9 +39,10 @@ export default class SharedPool<T extends Uint32Array | Int32Array | Float32Arra
 }
 interface SharedPoolConfig<T extends Uint32Array | Int32Array | Float32Array | Float64Array> {
     maxChunkSize?: number;
+    maxLength?: number;
+    maxRecycledLength?: number;
     type?: TypedArrayConstructor<T>;
     dataLength?: number;
-    recycleBufferLength?: number;
 }
 interface SharedPoolMemory {
     firstBlock: SharedAllocatedMemory;