@daneren2005/shared-memory-objects 0.0.12 → 0.0.13

package/dist/shared-memory-objects.js

@@ -1,40 +1,40 @@
-const qt = 20, Jt = 12, V = Math.pow(2, 20), j = Math.pow(2, 12);
-function h(i, t = 0) {
-  return L(Atomics.load(i, t));
+const ie = 20, se = 12, J = Math.pow(2, 20), Q = Math.pow(2, 12);
+function c(s, t = 0) {
+  return A(Atomics.load(s, t));
 }
-function S(i, t = 0) {
-  return Atomics.load(i, t);
+function O(s, t = 0) {
+  return Atomics.load(s, t);
 }
-function m(i, t = 0, e, r) {
-  Atomics.store(i, t, w(e, r));
+function m(s, t = 0, e, r) {
+  Atomics.store(s, t, T(e, r));
 }
-function Z(i, t = 0, e) {
-  Atomics.store(i, t, e);
+function W(s, t = 0, e) {
+  Atomics.store(s, t, e);
 }
-function Qt(i, t, e, r, s, o) {
-  let a = w(s, o);
-  return Atomics.compareExchange(i, t, a, w(e, r)) === a;
+function oe(s, t, e, r, i, o) {
+  let a = T(i, o);
+  return Atomics.compareExchange(s, t, a, T(e, r)) === a;
 }
-function R(i, t, e, r) {
-  return Atomics.compareExchange(i, t, r, e) === r;
+function z(s, t, e, r) {
+  return Atomics.compareExchange(s, t, r, e) === r;
 }
-function L(i) {
+function A(s) {
   return {
-    bufferPosition: i & 4095,
-    bufferByteOffset: i >>> 12
+    bufferPosition: s & 4095,
+    bufferByteOffset: s >>> 12
   };
 }
-function w(i, t) {
-  return i + (t << 12);
+function T(s, t) {
+  return s + (t << 12);
 }
-class c {
+class h {
   memory;
   bufferPosition;
   get bufferByteOffset() {
     return this.data.byteOffset;
   }
   get pointer() {
-    return w(this.bufferPosition, this.bufferByteOffset);
+    return T(this.bufferPosition, this.bufferByteOffset);
   }
   buffer;
   data;
@@ -60,15 +60,15 @@ class c {
     };
   }
 }
-const W = 0, C = 1;
-function D(i, t = 0) {
-  for (; Atomics.compareExchange(i, t, W, C) !== W; )
-    "WorkerGlobalScope" in self && Atomics.wait(i, t, C);
+const v = 0, F = 1;
+function x(s, t = 0) {
+  for (; Atomics.compareExchange(s, t, v, F) !== v; )
+    "WorkerGlobalScope" in self && Atomics.wait(s, t, F);
 }
-function b(i, t = 0) {
-  Atomics.compareExchange(i, t, C, W) !== C && console.warn("We are unlocking when it was not locked!"), Atomics.notify(i, t);
+function k(s, t = 0) {
+  Atomics.compareExchange(s, t, F, v) !== F && console.warn("We are unlocking when it was not locked!"), Atomics.notify(s, t);
 }
-const te = 1, Pt = {
+const ae = 1, Ft = {
   5120: "i8",
   5121: "u8",
   5122: "i16",
@@ -76,35 +76,35 @@ const te = 1, Pt = {
   5124: "i32",
   5125: "u32",
   5126: "f32"
-}, Nt = {
+}, xt = {
   f32: Float32Array,
   f64: Float64Array
-}, It = {
+}, Rt = {
   i8: Int8Array,
   i16: Int16Array,
   i32: Int32Array
-}, Ut = {
+}, $t = {
   u8: Uint8Array,
   u8c: Uint8ClampedArray,
   u16: Uint16Array,
   u32: Uint32Array
-}, Ct = {
+}, zt = {
   i64: BigInt64Array,
   u64: BigUint64Array
-}, Dt = {
-  ...Nt,
-  ...It,
-  ...Ut
-}, Ft = (i) => {
-  const t = Pt[i];
-  return t !== void 0 ? t : i;
+}, Yt = {
+  ...xt,
+  ...Rt,
+  ...$t
+}, Ht = (s) => {
+  const t = Ft[s];
+  return t !== void 0 ? t : s;
 };
-function xt(i, ...t) {
-  const e = Ct[i];
-  return new (e || Dt[Ft(i)])(...t);
+function Kt(s, ...t) {
+  const e = zt[s];
+  return new (e || Yt[Ht(s)])(...t);
 }
-const q = 0, J = 1, Q = 2, tt = 3, et = 4, A = 5, rt = 6, $ = 1, Y = 2, it = 32, H = 0, z = 1, d = 8;
-class K {
+const tt = 0, et = 1, rt = 2, it = 3, st = 4, g = 5, ot = 6, Y = 1, H = 2, at = 32, K = 0, G = 1, d = 8;
+class V {
   buf;
   start;
   u8;
@@ -112,29 +112,29 @@ class K {
   state;
   lock;
   constructor(t = {}) {
-    if (this.buf = t.buf ? t.buf : new ArrayBuffer(t.size || 4096), this.start = t.start != null ? P(Math.max(t.start, 0), 4) : 0, this.u8 = new Uint8Array(this.buf), this.u32 = new Uint32Array(this.buf), this.state = new Uint32Array(this.buf, this.start, it / 4), this.lock = new Int32Array(this.buf, this.start + this.state.byteLength - 4, 1), !t.skipInitialization) {
+    if (this.buf = t.buf ? t.buf : new ArrayBuffer(t.size || 4096), this.start = t.start != null ? N(Math.max(t.start, 0), 4) : 0, this.u8 = new Uint8Array(this.buf), this.u32 = new Uint32Array(this.buf), this.state = new Uint32Array(this.buf, this.start, at / 4), this.lock = new Int32Array(this.buf, this.start + this.state.byteLength - 4, 1), !t.skipInitialization) {
       const e = t.align || 8;
       if (e < 8)
         throw new Error(`invalid alignment: ${e}, must be a pow2 and >= 8`);
-      const r = this.initialTop(e), s = t.end != null ? Math.min(t.end, this.buf.byteLength) : this.buf.byteLength;
-      if (r >= s)
+      const r = this.initialTop(e), i = t.end != null ? Math.min(t.end, this.buf.byteLength) : this.buf.byteLength;
+      if (r >= i)
         throw new Error(
           `insufficient address range (0x${this.start.toString(
             16
-          )} - 0x${s.toString(16)})`
+          )} - 0x${i.toString(16)})`
         );
-      this.align = e, this.doCompact = t.compact !== !1, this.doSplit = t.split !== !1, this.minSplit = t.minSplit || 16, this.end = s, this.top = r, this._free = 0, this._used = 0;
+      this.align = e, this.doCompact = t.compact !== !1, this.doSplit = t.split !== !1, this.minSplit = t.minSplit || 16, this.end = i, this.top = r, this._free = 0, this._used = 0;
     }
   }
   stats() {
     const t = (r) => {
-      let s = 0, o = 0;
+      let i = 0, o = 0;
       for (; r; )
-        if (s++, o += this.blockSize(r), r = this.blockNext(r), r > this.end) {
+        if (i++, o += this.blockSize(r), r = this.blockNext(r), r > this.end) {
           console.error(`Trying to get stats for block past end of buffer: ${r} > ${this.end}`);
           break;
         }
-      return { count: s, size: o };
+      return { count: i, size: o };
     }, e = t(this._free);
     return {
       free: e,
@@ -145,12 +145,12 @@ class K {
     };
   }
   callocAs(t, e, r = 0) {
-    const s = this.mallocAs(t, e);
-    return s && s.fill(r), s;
+    const i = this.mallocAs(t, e);
+    return i && i.fill(r), i;
   }
   mallocAs(t, e) {
-    const r = this.malloc(e * Rt[t]);
-    return r ? xt(t, this.buf, r, e) : void 0;
+    const r = this.malloc(e * Gt[t]);
+    return r ? Kt(t, this.buf, r, e) : void 0;
   }
   calloc(t, e = 0) {
     const r = this.malloc(t);
@@ -159,11 +159,11 @@ class K {
   malloc(t) {
     if (t <= 0)
       return 0;
-    D(this.lock);
-    const e = P(t + d, this.align), r = this.end;
-    let s = this.top, o = this._free, a = 0;
+    x(this.lock);
+    const e = N(t + d, this.align), r = this.end;
+    let i = this.top, o = this._free, a = 0;
     for (; o; ) {
-      const f = this.blockSize(o), n = o + f >= s;
+      const f = this.blockSize(o), n = o + f >= i;
       if (n || f >= e) {
         let l = this.mallocTop(
           o,
@@ -172,55 +172,55 @@ class K {
           e,
           n
         );
-        return b(this.lock), l;
+        return k(this.lock), l;
       }
       a = o, o = this.blockNext(o);
     }
-    if (o = s, s = o + e, s <= r) {
-      this.initBlock(o, e, this._used), this._used = o, this.top = s;
+    if (o = i, i = o + e, i <= r) {
+      this.initBlock(o, e, this._used), this._used = o, this.top = i;
       let f = _(o);
-      return b(this.lock), f;
+      return k(this.lock), f;
     }
-    return b(this.lock), 0;
+    return k(this.lock), 0;
   }
-  mallocTop(t, e, r, s, o) {
-    if (o && t + s > this.end) return 0;
+  mallocTop(t, e, r, i, o) {
+    if (o && t + i > this.end) return 0;
     if (e ? this.unlinkBlock(e, t) : this._free = this.blockNext(t), this.setBlockNext(t, this._used), this._used = t, o)
-      this.top = t + this.setBlockSize(t, s);
+      this.top = t + this.setBlockSize(t, i);
     else if (this.doSplit) {
-      const a = r - s;
-      a >= this.minSplit && this.splitBlock(t, s, a);
+      const a = r - i;
+      a >= this.minSplit && this.splitBlock(t, i, a);
     }
     return _(t);
   }
   realloc(t, e) {
     if (e <= 0)
       return 0;
-    const r = M(t);
-    let s = 0, o = this._used, a = 0;
+    const r = P(t);
+    let i = 0, o = this._used, a = 0;
     for (; o; ) {
       if (o === r) {
-        [s, a] = this.reallocBlock(o, e);
+        [i, a] = this.reallocBlock(o, e);
         break;
       }
       o = this.blockNext(o);
     }
-    return s && s !== r && this.u8.copyWithin(
-      _(s),
+    return i && i !== r && this.u8.copyWithin(
+      _(i),
       _(r),
       a
-    ), _(s);
+    ), _(i);
   }
   reallocBlock(t, e) {
-    const r = this.blockSize(t), s = t + r, o = s >= this.top, a = P(e + d, this.align);
+    const r = this.blockSize(t), i = t + r, o = i >= this.top, a = N(e + d, this.align);
     if (a <= r) {
       if (this.doSplit) {
         const f = r - a;
         f >= this.minSplit ? this.splitBlock(t, a, f) : o && (this.top = t + a);
       } else o && (this.top = t + a);
-      return [t, s];
+      return [t, i];
     }
-    return o && t + a < this.end ? (this.top = t + this.setBlockSize(t, a), [t, s]) : (this.free(t), [M(this.malloc(e)), s]);
+    return o && t + a < this.end ? (this.top = t + this.setBlockSize(t, a), [t, i]) : (this.free(t), [P(this.malloc(e)), i]);
   }
   reallocArray(t, e) {
     if (t.buffer !== this.buf)
@@ -239,7 +239,7 @@ class K {
       e = t.byteOffset;
     } else
       e = t;
-    e = M(e);
+    e = P(e);
     let r = this._used;
     for (; r; ) {
       if (r === e)
@@ -260,14 +260,14 @@ class K {
       e = t.byteOffset;
     } else
       e = t;
-    D(this.lock), e = M(e);
-    let r = this._used, s = 0;
+    x(this.lock), e = P(e);
+    let r = this._used, i = 0;
     for (; r; ) {
       if (r === e)
-        return s ? this.unlinkBlock(s, r) : this._used = this.blockNext(r), this.insert(r), this.doCompact && this.compact(), b(this.lock), !0;
-      s = r, r = this.blockNext(r);
+        return i ? this.unlinkBlock(i, r) : this._used = this.blockNext(r), this.insert(r), this.doCompact && this.compact(), k(this.lock), !0;
+      i = r, r = this.blockNext(r);
     }
-    return b(this.lock), !1;
+    return k(this.lock), !1;
   }
   freeAll() {
     this._free = 0, this._used = 0, this.top = this.initialTop();
@@ -276,57 +276,57 @@ class K {
     return delete this.u8, delete this.u32, delete this.state, delete this.buf, !0;
   }
   get align() {
-    return this.state[et];
+    return this.state[st];
   }
   set align(t) {
-    this.state[et] = t;
+    this.state[st] = t;
   }
   get end() {
-    return this.state[tt];
+    return this.state[it];
   }
   set end(t) {
-    this.state[tt] = t;
+    this.state[it] = t;
   }
   get top() {
-    return Atomics.load(this.state, Q);
+    return Atomics.load(this.state, rt);
   }
   set top(t) {
-    Atomics.store(this.state, Q, t);
+    Atomics.store(this.state, rt, t);
   }
   get _free() {
-    return Atomics.load(this.state, q);
+    return Atomics.load(this.state, tt);
   }
   set _free(t) {
-    Atomics.store(this.state, q, t);
+    Atomics.store(this.state, tt, t);
   }
   get _used() {
-    return Atomics.load(this.state, J);
+    return Atomics.load(this.state, et);
   }
   set _used(t) {
-    Atomics.store(this.state, J, t);
+    Atomics.store(this.state, et, t);
   }
   get doCompact() {
-    return !!(this.state[A] & $);
+    return !!(this.state[g] & Y);
   }
   set doCompact(t) {
-    t ? this.state[A] |= 1 << $ - 1 : this.state[A] &= ~$;
+    t ? this.state[g] |= 1 << Y - 1 : this.state[g] &= ~Y;
   }
   get doSplit() {
-    return !!(this.state[A] & Y);
+    return !!(this.state[g] & H);
   }
   set doSplit(t) {
-    t ? this.state[A] |= 1 << Y - 1 : this.state[A] &= ~Y;
+    t ? this.state[g] |= 1 << H - 1 : this.state[g] &= ~H;
   }
   get minSplit() {
-    return this.state[rt];
+    return this.state[ot];
   }
   set minSplit(t) {
     if (t <= d)
       throw new Error(`illegal min split threshold: ${t}, require at least ${d + 1}`);
-    this.state[rt] = t;
+    this.state[ot] = t;
   }
   blockSize(t) {
-    return Atomics.load(this.u32, (t >> 2) + H);
+    return Atomics.load(this.u32, (t >> 2) + K);
   }
   /**
    * Sets & returns given block size.
@@ -335,10 +335,10 @@ class K {
    * @param size -
    */
   setBlockSize(t, e) {
-    return Atomics.store(this.u32, (t >> 2) + H, e), e;
+    return Atomics.store(this.u32, (t >> 2) + K, e), e;
   }
   blockNext(t) {
-    return Atomics.load(this.u32, (t >> 2) + z);
+    return Atomics.load(this.u32, (t >> 2) + G);
   }
   /**
    * Sets block next pointer to `next`. Use zero to indicate list end.
@@ -346,7 +346,7 @@ class K {
    * @param block -
    */
   setBlockNext(t, e) {
-    Atomics.store(this.u32, (t >> 2) + z, e);
+    Atomics.store(this.u32, (t >> 2) + G, e);
   }
   /**
    * Initializes block header with given `size` and `next` pointer. Returns `block`.
@@ -356,8 +356,8 @@ class K {
    * @param next -
    */
   initBlock(t, e, r) {
-    const s = t >>> 2;
-    return Atomics.store(this.u32, s + H, e), Atomics.store(this.u32, s + z, r), t;
+    const i = t >>> 2;
+    return Atomics.store(this.u32, i + K, e), Atomics.store(this.u32, i + G, r), t;
   }
   unlinkBlock(t, e) {
     this.setBlockNext(t, this.blockNext(e));
@@ -372,7 +372,7 @@ class K {
     ), this.doCompact && this.compact();
   }
   initialTop(t = this.align) {
-    return P(this.start + it + d, t) - d;
+    return N(this.start + at + d, t) - d;
   }
   /**
    * Traverses free list and attempts to recursively merge blocks
@@ -380,14 +380,14 @@ class K {
    * have been merged. Only called if `compact` option is enabled.
    */
   compact() {
-    let t = this._free, e = 0, r = 0, s, o = !1;
+    let t = this._free, e = 0, r = 0, i, o = !1;
     for (; t; ) {
-      for (s = t, r = this.blockNext(t); r && s + this.blockSize(s) === r; )
-        s = r, r = this.blockNext(r);
-      if (s !== t) {
-        const a = s - t + this.blockSize(s);
+      for (i = t, r = this.blockNext(t); r && i + this.blockSize(i) === r; )
+        i = r, r = this.blockNext(r);
+      if (i !== t) {
+        const a = i - t + this.blockSize(i);
         this.setBlockSize(t, a);
-        const f = this.blockNext(s);
+        const f = this.blockNext(i);
         let n = this.blockNext(t);
         for (; n && n !== f; ) {
           const l = this.blockNext(n);
@@ -411,7 +411,7 @@ class K {
     r ? this.setBlockNext(r, t) : this._free = t, this.setBlockNext(t, e);
   }
 }
-const _ = (i) => i > 0 ? i + d : 0, M = (i) => i > 0 ? i - d : 0, P = (i, t) => (t--, i + t & ~t), Rt = {
+const _ = (s) => s > 0 ? s + d : 0, P = (s) => s > 0 ? s - d : 0, N = (s, t) => (t--, s + t & ~t), Gt = {
   u8: 1,
   u8c: 1,
   i8: 1,
@@ -423,7 +423,7 @@ const _ = (i) => i > 0 ? i + d : 0, M = (i) => i > 0 ? i - d : 0, P = (i, t) =>
   u64: 8,
   f32: 4,
   f64: 8
-}, $t = [
+}, Vt = [
   "B",
   "kB",
   "MB",
@@ -433,7 +433,7 @@ const _ = (i) => i > 0 ? i + d : 0, M = (i) => i > 0 ? i - d : 0, P = (i, t) =>
   "EB",
   "ZB",
   "YB"
-], Yt = [
+], Xt = [
   "B",
   "KiB",
   "MiB",
@@ -443,7 +443,7 @@ const _ = (i) => i > 0 ? i + d : 0, M = (i) => i > 0 ? i - d : 0, P = (i, t) =>
   "EiB",
   "ZiB",
   "YiB"
-], Ht = [
+], Zt = [
   "b",
   "kbit",
   "Mbit",
@@ -453,7 +453,7 @@ const _ = (i) => i > 0 ? i + d : 0, M = (i) => i > 0 ? i - d : 0, P = (i, t) =>
   "Ebit",
   "Zbit",
   "Ybit"
-], zt = [
+], Wt = [
   "b",
   "kibit",
   "Mibit",
@@ -463,27 +463,27 @@ const _ = (i) => i > 0 ? i + d : 0, M = (i) => i > 0 ? i - d : 0, P = (i, t) =>
   "Eibit",
   "Zibit",
   "Yibit"
-], st = (i, t, e) => {
-  let r = i;
-  return typeof t == "string" || Array.isArray(t) ? r = i.toLocaleString(t, e) : (t === !0 || e !== void 0) && (r = i.toLocaleString(void 0, e)), r;
-}, bt = (i) => {
-  if (typeof i == "number")
-    return Math.log10(i);
-  const t = i.toString(10);
+], nt = (s, t, e) => {
+  let r = s;
+  return typeof t == "string" || Array.isArray(t) ? r = s.toLocaleString(t, e) : (t === !0 || e !== void 0) && (r = s.toLocaleString(void 0, e)), r;
+}, wt = (s) => {
+  if (typeof s == "number")
+    return Math.log10(s);
+  const t = s.toString(10);
   return t.length + Math.log10(`0.${t.slice(0, 15)}`);
-}, Kt = (i) => typeof i == "number" ? Math.log(i) : bt(i) * Math.log(10), Gt = (i, t) => {
-  if (typeof i == "number")
-    return i / t;
-  const e = i / BigInt(t), r = i % BigInt(t);
+}, vt = (s) => typeof s == "number" ? Math.log(s) : wt(s) * Math.log(10), jt = (s, t) => {
+  if (typeof s == "number")
+    return s / t;
+  const e = s / BigInt(t), r = s % BigInt(t);
   return Number(e) + Number(r) / t;
-}, ot = (i, t) => {
+}, ft = (s, t) => {
   if (t === void 0)
-    return i;
+    return s;
   if (typeof t != "number" || !Number.isSafeInteger(t) || t < 0)
     throw new TypeError(`Expected fixedWidth to be a non-negative integer, got ${typeof t}: ${t}`);
-  return t === 0 ? i : i.length < t ? i.padStart(t, " ") : i;
-}, Xt = (i) => {
-  const { minimumFractionDigits: t, maximumFractionDigits: e } = i;
+  return t === 0 ? s : s.length < t ? s.padStart(t, " ") : s;
+}, qt = (s) => {
+  const { minimumFractionDigits: t, maximumFractionDigits: e } = s;
   if (!(t === void 0 && e === void 0))
     return {
       ...t !== void 0 && { minimumFractionDigits: t },
@@ -491,9 +491,9 @@ const _ = (i) => i > 0 ? i + d : 0, M = (i) => i > 0 ? i - d : 0, P = (i, t) =>
       roundingMode: "trunc"
     };
 };
-function Zt(i, t) {
-  if (typeof i != "bigint" && !Number.isFinite(i))
-    throw new TypeError(`Expected a finite number, got ${typeof i}: ${i}`);
+function Jt(s, t) {
+  if (typeof s != "bigint" && !Number.isFinite(s))
+    throw new TypeError(`Expected a finite number, got ${typeof s}: ${s}`);
   t = {
     bits: !1,
     binary: !1,
@@ -501,78 +501,78 @@ function Zt(i, t) {
     nonBreakingSpace: !1,
     ...t
   };
-  const e = t.bits ? t.binary ? zt : Ht : t.binary ? Yt : $t, r = t.space ? t.nonBreakingSpace ? " " : " " : "", s = typeof i == "number" ? i === 0 : i === 0n;
-  if (t.signed && s) {
+  const e = t.bits ? t.binary ? Wt : Zt : t.binary ? Xt : Vt, r = t.space ? t.nonBreakingSpace ? " " : " " : "", i = typeof s == "number" ? s === 0 : s === 0n;
+  if (t.signed && i) {
     const l = ` 0${r}${e[0]}`;
-    return ot(l, t.fixedWidth);
+    return ft(l, t.fixedWidth);
   }
-  const o = i < 0, a = o ? "-" : t.signed ? "+" : "";
-  o && (i = -i);
-  const f = Xt(t);
+  const o = s < 0, a = o ? "-" : t.signed ? "+" : "";
+  o && (s = -s);
+  const f = qt(t);
   let n;
-  if (i < 1) {
-    const l = st(i, t.locale, f);
+  if (s < 1) {
+    const l = nt(s, t.locale, f);
     n = a + l + r + e[0];
   } else {
-    const l = Math.min(Math.floor(t.binary ? Kt(i) / Math.log(1024) : bt(i) / 3), e.length - 1);
-    if (i = Gt(i, (t.binary ? 1024 : 1e3) ** l), !f) {
-      const O = Math.max(3, Math.floor(i).toString().length);
-      i = i.toPrecision(O);
+    const l = Math.min(Math.floor(t.binary ? vt(s) / Math.log(1024) : wt(s) / 3), e.length - 1);
+    if (s = jt(s, (t.binary ? 1024 : 1e3) ** l), !f) {
+      const M = Math.max(3, Math.floor(s).toString().length);
+      s = s.toPrecision(M);
     }
-    const T = st(Number(i), t.locale, f), x = e[l];
-    n = a + T + r + x;
+    const S = nt(Number(s), t.locale, f), $ = e[l];
+    n = a + S + r + $;
   }
-  return ot(n, t.fixedWidth);
+  return ft(n, t.fixedWidth);
 }
-const Wt = 8192, at = 0, G = 1, N = 2;
-class ee {
+const Qt = 8192, lt = 0, X = 1, U = 2;
+class ne {
   buffers;
   onGrowBufferHandlers = [];
   isClone;
   memory;
   get bufferSize() {
-    return this.memory.data[at];
+    return this.memory.data[lt];
   }
   constructor(t) {
     if (t && "buffers" in t)
-      this.buffers = t.buffers.map((e) => new K({
+      this.buffers = t.buffers.map((e) => new V({
         buf: e,
         skipInitialization: !0
-      })), this.memory = new c(this, {
+      })), this.memory = new h(this, {
         bufferPosition: 0,
         bufferByteOffset: 40
       }), this.isClone = !0;
     else {
       "SharedArrayBuffer" in globalThis || console.warn("SharedArrayBuffer is not working: falling back to ArrayBuffer");
-      const e = t?.bufferSize ?? Wt;
-      if (e > V)
-        throw new Error(`Buffer size ${e} is greater than max ${V} that we can reference with pointers`);
+      const e = t?.bufferSize ?? Qt;
+      if (e > J)
+        throw new Error(`Buffer size ${e} is greater than max ${J} that we can reference with pointers`);
       let r = this.createBuffer(e);
       this.buffers = [
         r
       ];
-      const s = r.callocAs("u32", 3);
-      if (s)
-        this.memory = new c(this, {
+      const i = r.callocAs("u32", 3);
+      if (i)
+        this.memory = new h(this, {
           bufferPosition: 0,
-          bufferByteOffset: s.byteOffset
+          bufferByteOffset: i.byteOffset
         });
       else
         throw new Error("Failed to initialize first byte from buffer");
-      this.memory.data[at] = e, this.memory.data[G] = 1, this.memory.data[N] = t?.autoGrowSize ?? 100, this.isClone = !1;
+      this.memory.data[lt] = e, this.memory.data[X] = 1, this.memory.data[U] = t?.autoGrowSize ?? 100, this.isClone = !1;
       for (let o = 1; o < (t?.initialBuffers ?? 1); o++)
         this.buffers.push(this.createBuffer(e));
     }
   }
   addSharedBuffer(t) {
-    this.buffers[t.bufferPosition] = new K({
+    this.buffers[t.bufferPosition] = new V({
       buf: t.buffer,
       skipInitialization: !0
     });
   }
   growBuffer() {
     const t = this.createBuffer();
-    let e = Atomics.add(this.memory.data, G, 1);
+    let e = Atomics.add(this.memory.data, X, 1);
     return this.buffers[e] = t, this.onGrowBufferHandlers.forEach((r) => r({
       bufferPosition: e,
       buffer: t.buf
@@ -581,7 +581,7 @@ class ee {
   createBuffer(t) {
     const e = t ?? this.bufferSize;
     let r;
-    return "SharedArrayBuffer" in globalThis ? r = new SharedArrayBuffer(e) : r = new ArrayBuffer(e), new K({
+    return "SharedArrayBuffer" in globalThis ? r = new SharedArrayBuffer(e) : r = new ArrayBuffer(e), new V({
       buf: r,
       // We can't use this unless we can 100% guarantee that every thread will stop using memory the instant it is freed
       // ex: Allocate 16 bytes.  Thread A frees that allocation and then allocates 12 bytes and 4 bytes, but Thread B is mid-execution on the old allocation can changes the internal state of the 4-byte allocation breaking everything
@@ -595,23 +595,23 @@ class ee {
   }
   allocUI32(t) {
     t = Math.ceil(t);
-    for (let s = 0; s < this.buffers.length; s++) {
-      const o = this.buffers[s];
+    for (let i = 0; i < this.buffers.length; i++) {
+      const o = this.buffers[i];
       if (!o)
         continue;
       const a = o.callocAs("u32", t);
       if (a)
-        return s === this.buffers.length - 1 && Atomics.load(this.memory.data, G) === this.buffers.length && this.memory.data[N] < 100 && this.memory.data[N] > 0 && o.top / o.end > this.memory.data[N] / 100 && this.growBuffer(), new c(this, {
+        return i === this.buffers.length - 1 && Atomics.load(this.memory.data, X) === this.buffers.length && this.memory.data[U] < 100 && this.memory.data[U] > 0 && o.top / o.end > this.memory.data[U] / 100 && this.growBuffer(), new h(this, {
           data: a,
           buffer: o
         });
     }
-    if (this.buffers.length >= j)
-      throw new Error(`Can't initialize a new buffer since it would have a position greater than the max of ${j}`);
+    if (this.buffers.length >= Q)
+      throw new Error(`Can't initialize a new buffer since it would have a position greater than the max of ${Q}`);
     let e = this.growBuffer();
     const r = e.callocAs("u32", t);
     if (r)
-      return new c(this, {
+      return new h(this, {
         data: r,
         buffer: e
       });
@@ -619,7 +619,7 @@ class ee {
   }
   getSharedAlloc(t) {
     if (this.buffers[t.bufferPosition] !== void 0)
-      return new c(this, t);
+      return new h(this, t);
   }
   get currentUsed() {
     return this.totalAllocated - this.buffers.reduce((t, e) => t + e.stats().available, 0);
@@ -628,7 +628,7 @@ class ee {
     return this.buffers[0].buf.byteLength * this.buffers.length;
   }
   prettyMemory() {
-    return `${nt(this.currentUsed)} / ${nt(this.totalAllocated)}`;
+    return `${ht(this.currentUsed)} / ${ht(this.totalAllocated)}`;
   }
   getSharedMemory() {
     return {
@@ -636,16 +636,16 @@ class ee {
     };
   }
 }
-function nt(i) {
-  return Zt(i, {
+function ht(s) {
+  return Jt(s, {
     binary: !0,
     minimumFractionDigits: 1,
     maximumFractionDigits: 1
   });
 }
-const ft = 4, lt = 1, g = 2;
+const ct = 4, ut = 1, E = 2;
 class u {
-  static ALLOCATE_COUNT = ft;
+  static ALLOCATE_COUNT = ct;
   memory;
   /* First block
   	32 index 0
@@ -670,7 +670,7 @@ class u {
   uint16Array;
   onDelete;
   get length() {
-    return Atomics.load(this.firstBlock.data, g);
+    return Atomics.load(this.firstBlock.data, E);
   }
   get type() {
     return Atomics.load(this.uint16Array, 0);
@@ -686,9 +686,9 @@ class u {
   }
   constructor(t, e) {
     if (this.memory = t, e && "firstBlock" in e)
-      this.firstBlock = new c(t, e.firstBlock), this.uint16Array = new Uint16Array(this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + (g + 1) * Uint32Array.BYTES_PER_ELEMENT, 2);
+      this.firstBlock = new h(t, e.firstBlock), this.uint16Array = new Uint16Array(this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + (E + 1) * Uint32Array.BYTES_PER_ELEMENT, 2);
     else {
-      e && e.initWithBlock ? this.firstBlock = new c(t, e.initWithBlock) : this.firstBlock = t.allocUI32(ft), this.uint16Array = new Uint16Array(this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + (g + 1) * Uint32Array.BYTES_PER_ELEMENT, 2);
+      e && e.initWithBlock ? this.firstBlock = new h(t, e.initWithBlock) : this.firstBlock = t.allocUI32(ct), this.uint16Array = new Uint16Array(this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + (E + 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;
     }
@@ -698,23 +698,23 @@ class u {
     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(lt + e), s = this.getDataBlock(r.data), o = r.pointer;
+    let r = this.memory.allocUI32(ut + e), i = this.getDataBlock(r.data), o = r.pointer;
     for (let n = 0; n < t.length; n++)
-      s instanceof Int32Array || s instanceof Uint32Array ? Atomics.store(s, n, t[n]) : s[n] = t[n];
+      i instanceof Int32Array || i instanceof Uint32Array ? Atomics.store(i, n, t[n]) : i[n] = t[n];
     let a, f = !1;
     for (; !f; )
-      a = S(this.firstBlock.data, 1), f = R(this.firstBlock.data, 1, o, a);
+      a = O(this.firstBlock.data, 1), f = z(this.firstBlock.data, 1, o, a);
     if (a) {
-      let { bufferPosition: n, bufferByteOffset: l } = L(a), T = new Uint32Array(this.memory.buffers[n].buf, l, 1);
-      Z(T, 0, o);
+      let { bufferPosition: n, bufferByteOffset: l } = A(a), S = new Uint32Array(this.memory.buffers[n].buf, l, 1);
+      W(S, 0, o);
     } else
-      Z(this.firstBlock.data, 0, o);
-    Atomics.add(this.firstBlock.data, g, 1);
+      W(this.firstBlock.data, 0, o);
+    Atomics.add(this.firstBlock.data, E, 1);
   }
   deleteMatch(t) {
-    for (let { data: e, index: r, deleteCurrent: s } of this)
+    for (let { data: e, index: r, deleteCurrent: i } of this)
       if (t(e, r))
-        return s(), !0;
+        return i(), !0;
     return !1;
   }
   deleteIndex(t) {
@@ -733,39 +733,39 @@ class u {
   clear() {
     let t, e, r = !1;
     for (; !r; ) {
-      if (t = S(this.firstBlock.data, 0), e = S(this.firstBlock.data, 1), !e)
+      if (t = O(this.firstBlock.data, 0), e = O(this.firstBlock.data, 1), !e)
         return;
-      r = R(this.firstBlock.data, 1, 0, e);
+      r = z(this.firstBlock.data, 1, 0, e);
     }
     if (!t)
       return;
-    R(this.firstBlock.data, 0, 0, t);
-    let s = 0, o = t;
+    z(this.firstBlock.data, 0, 0, t);
+    let i = 0, o = t;
     for (; o; ) {
-      let { bufferPosition: a, bufferByteOffset: f } = L(o), n = this.memory.buffers[a];
+      let { bufferPosition: a, bufferByteOffset: f } = A(o), n = this.memory.buffers[a];
       if (!n)
         break;
       let l = new Uint32Array(n.buf, f, 2);
-      o = S(l, 0), s++, this.onDelete && this.onDelete(this.getDataBlock(l)), n.free(l.byteOffset);
+      o = O(l, 0), i++, this.onDelete && this.onDelete(this.getDataBlock(l)), n.free(l.byteOffset);
     }
-    Atomics.sub(this.firstBlock.data, g, s);
+    Atomics.sub(this.firstBlock.data, E, i);
   }
   *[Symbol.iterator]() {
-    let t = 0, { bufferPosition: e, bufferByteOffset: r } = h(this.firstBlock.data, 0), s = this.firstBlock.data, o = 0, a = 0;
+    let t = 0, { bufferPosition: e, bufferByteOffset: r } = c(this.firstBlock.data, 0), i = this.firstBlock.data, o = 0, a = 0;
     for (; r; ) {
       let f = this.memory.buffers[e];
       if (!f)
         return;
-      let n = new Uint32Array(f.buf, r, 2), l = this.getDataBlock(n), T = e, x = r;
-      ({ bufferPosition: e, bufferByteOffset: r } = h(n, 0));
-      let O = !0;
+      let n = new Uint32Array(f.buf, r, 2), l = this.getDataBlock(n), S = e, $ = r;
+      ({ bufferPosition: e, bufferByteOffset: r } = c(n, 0));
+      let M = !0;
       yield {
         data: l,
         index: t,
         deleteCurrent: () => {
-          m(s, 0, e, r), r || m(this.firstBlock.data, 1, o, a), this.onDelete && this.onDelete(this.getDataBlock(n)), f.free(n.byteOffset), Atomics.sub(this.firstBlock.data, g, 1), O = !1;
+          m(i, 0, e, r), r || m(this.firstBlock.data, 1, o, a), this.onDelete && this.onDelete(this.getDataBlock(n)), f.free(n.byteOffset), Atomics.sub(this.firstBlock.data, E, 1), M = !1;
         }
-      }, O && (s = n, o = T, a = x, t++);
+      }, M && (i = n, o = S, a = $, t++);
     }
   }
   forEach(t) {
@@ -778,7 +778,7 @@ class u {
     };
   }
   getDataBlock(t) {
-    const e = t.byteOffset + lt * t.BYTES_PER_ELEMENT;
+    const e = t.byteOffset + ut * t.BYTES_PER_ELEMENT;
     switch (this.type) {
       case 1:
         return new Int32Array(t.buffer, e, this.dataLength);
@@ -791,26 +791,26 @@ class u {
     }
   }
   free() {
-    let { bufferPosition: t, bufferByteOffset: e } = h(this.firstBlock.data, 0);
+    let { bufferPosition: t, bufferByteOffset: e } = c(this.firstBlock.data, 0);
     for (; e; ) {
-      let r = new c(this.memory, {
+      let r = new h(this.memory, {
         bufferPosition: t,
         bufferByteOffset: e
       });
-      ({ bufferPosition: t, bufferByteOffset: e } = h(r.data, 0)), this.onDelete && this.onDelete(this.getDataBlock(r.data)), r.free();
+      ({ bufferPosition: t, bufferByteOffset: e } = c(r.data, 0)), this.onDelete && this.onDelete(this.getDataBlock(r.data)), r.free();
     }
     this.firstBlock.free();
   }
 }
-const ht = 10;
-class At {
+const dt = 10;
+class Tt {
   static ALLOCATE_COUNT = 4;
   memory;
   // Memory order: Pointer, Lock, Length, MaxHash
   pointerMemory;
   lock;
   get hashMemory() {
-    return new c(this.memory, h(this.pointerMemory.data, 0));
+    return new h(this.memory, c(this.pointerMemory.data, 0));
   }
   get length() {
     return Atomics.load(this.pointerMemory.data, 2);
@@ -820,21 +820,21 @@ class At {
   }
   constructor(t, e) {
     if (this.memory = t, e)
-      this.pointerMemory = new c(t, e.firstBlock);
+      this.pointerMemory = new h(t, e.firstBlock);
     else {
-      this.pointerMemory = t.allocUI32(At.ALLOCATE_COUNT);
-      let r = t.allocUI32(ht);
-      m(this.pointerMemory.data, 0, r.bufferPosition, r.bufferByteOffset), Atomics.store(this.pointerMemory.data, 3, ht);
+      this.pointerMemory = t.allocUI32(Tt.ALLOCATE_COUNT);
+      let r = t.allocUI32(dt);
+      m(this.pointerMemory.data, 0, r.bufferPosition, r.bufferByteOffset), Atomics.store(this.pointerMemory.data, 3, dt);
     }
     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 = I(t);
+    let r = C(t);
     this.setHashKey(this.hashMemory, this.maxHash, r, e) && Atomics.add(this.pointerMemory.data, 2, 1);
   }
-  setHashKey(t, e, r, s) {
-    let o = this.hash(r, e), a, f = h(t.data, o);
+  setHashKey(t, e, r, i) {
+    let o = this.hash(r, e), a, f = c(t.data, o);
     if (f.bufferByteOffset === 0) {
       a = new u(this.memory, {
         dataLength: 2
@@ -846,25 +846,25 @@ class At {
         firstBlock: f
       });
     let n = !0;
-    return a.deleteValue(r) && (n = !1), a.insert([r, s]), n;
+    return a.deleteValue(r) && (n = !1), a.insert([r, i]), n;
   }
   get(t) {
-    let e = I(t), r = this.hash(e, this.maxHash), s = h(this.hashMemory.data, r);
-    if (s.bufferByteOffset === 0)
+    let e = C(t), r = this.hash(e, this.maxHash), i = c(this.hashMemory.data, r);
+    if (i.bufferByteOffset === 0)
       return;
     let o = new u(this.memory, {
-      firstBlock: s
+      firstBlock: i
     });
     for (let { data: a } of o)
       if (a[0] === e)
         return a[1];
   }
   has(t) {
-    let e = I(t), r = this.hash(e, this.maxHash), s = h(this.hashMemory.data, r);
-    if (s.bufferByteOffset === 0)
+    let e = C(t), r = this.hash(e, this.maxHash), i = c(this.hashMemory.data, r);
+    if (i.bufferByteOffset === 0)
       return !1;
     let o = new u(this.memory, {
-      firstBlock: s
+      firstBlock: i
     });
     for (let { data: a } of o)
       if (a[0] === e)
@@ -872,11 +872,11 @@ class At {
     return !1;
   }
   delete(t) {
-    let e = I(t), r = this.hash(e, this.maxHash), s = h(this.hashMemory.data, r);
-    if (s.bufferByteOffset === 0)
+    let e = C(t), r = this.hash(e, this.maxHash), i = c(this.hashMemory.data, r);
+    if (i.bufferByteOffset === 0)
       return !1;
     let o = new u(this.memory, {
-      firstBlock: s
+      firstBlock: i
     });
     for (let { data: a, deleteCurrent: f } of o)
       if (a[0] === e)
@@ -884,9 +884,9 @@ class At {
     return !1;
   }
   growHashTable() {
-    let t = this.maxHash, e = t * 2, r = this.memory.allocUI32(e), s = this.hashMemory;
+    let t = this.maxHash, e = t * 2, r = this.memory.allocUI32(e), i = this.hashMemory;
     for (let o = 0; o < t; o++) {
-      let a = h(s.data, o);
+      let a = c(i.data, o);
       if (a.bufferByteOffset === 0)
         continue;
       let f = new u(this.memory, {
@@ -902,7 +902,7 @@ class At {
   }
   free() {
     for (let t = 0; t < this.maxHash; t++) {
-      let e = h(this.hashMemory.data, t);
+      let e = c(this.hashMemory.data, t);
       if (e.bufferByteOffset === 0)
         continue;
       new u(this.memory, {
@@ -917,24 +917,24 @@ class At {
     };
   }
 }
-function I(i) {
-  return typeof i == "number" ? i : typeof i == "string" ? vt(i) : i;
+function C(s) {
+  return typeof s == "number" ? s : typeof s == "string" ? te(s) : s;
 }
-function vt(i) {
-  let t = i.length, e = 17 ^ t, r = 0, s;
+function te(s) {
+  let t = s.length, e = 17 ^ t, r = 0, i;
   for (; t >= 4; )
-    s = i.charCodeAt(r) & 255 | (i.charCodeAt(++r) & 255) << 8 | (i.charCodeAt(++r) & 255) << 16 | (i.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;
+    i = s.charCodeAt(r) & 255 | (s.charCodeAt(++r) & 255) << 8 | (s.charCodeAt(++r) & 255) << 16 | (s.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), e = (e & 65535) * 1540483477 + (((e >>> 16) * 1540483477 & 65535) << 16) ^ i, t -= 4, ++r;
   switch (t) {
     case 3:
-      e ^= (i.charCodeAt(r + 2) & 255) << 16;
+      e ^= (s.charCodeAt(r + 2) & 255) << 16;
     case 2:
-      e ^= (i.charCodeAt(r + 1) & 255) << 8;
+      e ^= (s.charCodeAt(r + 1) & 255) << 8;
     case 1:
-      e ^= i.charCodeAt(r) & 255, e = (e & 65535) * 1540483477 + (((e >>> 16) * 1540483477 & 65535) << 16);
+      e ^= s.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;
 }
-class re {
+class fe {
   memory;
   list;
   constructor(t, e) {
@@ -944,17 +944,17 @@ class re {
     return this.list.length;
   }
   insert(t) {
-    this.list.insert(w(t.memory.bufferPosition, t.memory.bufferByteOffset));
+    this.list.insert(T(t.memory.bufferPosition, t.memory.bufferByteOffset));
   }
   delete(t) {
-    return this.list.deleteValue(w(t.memory.bufferPosition, t.memory.bufferByteOffset));
+    return this.list.deleteValue(T(t.memory.bufferPosition, t.memory.bufferByteOffset));
   }
   *[Symbol.iterator]() {
     let t = this.list[Symbol.iterator]();
     for (let { data: e } of t) {
-      let { bufferPosition: r, bufferByteOffset: s } = h(e, 0), o = new c(this.memory, {
+      let { bufferPosition: r, bufferByteOffset: i } = c(e, 0), o = new h(this.memory, {
         bufferPosition: r,
-        bufferByteOffset: s
+        bufferByteOffset: i
       });
       yield this.createItem(o);
     }
@@ -977,11 +977,11 @@ class re {
     this.list.free();
   }
 }
-const ct = {
+const yt = {
   1: Uint8Array,
   2: Uint16Array
-}, U = 0, ut = 1, dt = 2, yt = 3;
-class gt {
+}, I = 0, Bt = 1, mt = 2, bt = 3;
+class Lt {
   static ALLOCATE_COUNT = 4;
   memory;
   allocatedMemory;
@@ -989,11 +989,11 @@ class gt {
   cachedPointer;
   cachedString;
   constructor(t, e) {
-    this.memory = t, typeof e == "string" ? (this.allocatedMemory = this.memory.allocUI32(gt.ALLOCATE_COUNT), this.lock = new Int32Array(this.allocatedMemory.data.buffer, this.allocatedMemory.bufferByteOffset + yt * this.allocatedMemory.data.BYTES_PER_ELEMENT), this.updateString(e)) : (this.allocatedMemory = new c(t, e), this.lock = new Int32Array(this.allocatedMemory.data.buffer, this.allocatedMemory.bufferByteOffset + yt * this.allocatedMemory.data.BYTES_PER_ELEMENT), "value" in e && this.updateString(e.value));
+    this.memory = t, typeof e == "string" ? (this.allocatedMemory = this.memory.allocUI32(Lt.ALLOCATE_COUNT), this.lock = new Int32Array(this.allocatedMemory.data.buffer, this.allocatedMemory.bufferByteOffset + bt * this.allocatedMemory.data.BYTES_PER_ELEMENT), this.updateString(e)) : (this.allocatedMemory = new h(t, e), this.lock = new Int32Array(this.allocatedMemory.data.buffer, this.allocatedMemory.bufferByteOffset + bt * this.allocatedMemory.data.BYTES_PER_ELEMENT), "value" in e && this.updateString(e.value));
   }
   updateString(t) {
     let e = this.createString(t);
-    D(this.lock), Z(this.allocatedMemory.data, U, e.pointer), Atomics.store(this.allocatedMemory.data, ut, t.length), Atomics.store(this.allocatedMemory.data, dt, e.charType), b(this.lock), this.cachedPointer = e.pointer, this.cachedString = t;
+    x(this.lock), W(this.allocatedMemory.data, I, e.pointer), Atomics.store(this.allocatedMemory.data, Bt, t.length), Atomics.store(this.allocatedMemory.data, mt, e.charType), k(this.lock), this.cachedPointer = e.pointer, this.cachedString = t;
   }
   createString(t) {
     if (t === "")
@@ -1005,27 +1005,27 @@ class gt {
     let e = [];
     for (let n = 0; n < t.length; n++)
       e.push(t.charCodeAt(n));
-    let s = Math.max(...e) > 255 ? 2 : 1, o = ct[s], a = this.memory.allocUI32(Math.ceil(t.length / (4 / o.BYTES_PER_ELEMENT))), f = new o(a.data.buffer, a.data.byteOffset, t.length);
+    let i = Math.max(...e) > 255 ? 2 : 1, o = yt[i], a = this.memory.allocUI32(Math.ceil(t.length / (4 / o.BYTES_PER_ELEMENT))), f = new o(a.data.buffer, a.data.byteOffset, t.length);
     for (let n = 0; n < t.length; n++)
       f[n] = t.charCodeAt(n);
     return {
       pointer: a.pointer,
-      charType: s
+      charType: i
     };
   }
   get value() {
-    let t = S(this.allocatedMemory.data, U);
+    let t = O(this.allocatedMemory.data, I);
     if (this.cachedPointer === t && this.cachedString !== void 0)
       return this.cachedString;
     if (t === 0)
       return "";
-    let { bufferPosition: e, bufferByteOffset: r } = L(t);
-    D(this.lock);
-    let s = Atomics.load(this.allocatedMemory.data, dt), o = ct[s], a = Atomics.load(this.allocatedMemory.data, ut), f = new o(this.memory.buffers[e].buf, r, a), n = String.fromCharCode.apply(null, f);
-    return b(this.lock), this.cachedPointer = t, this.cachedString = n, n;
+    let { bufferPosition: e, bufferByteOffset: r } = A(t);
+    x(this.lock);
+    let i = Atomics.load(this.allocatedMemory.data, mt), o = yt[i], a = Atomics.load(this.allocatedMemory.data, Bt), f = new o(this.memory.buffers[e].buf, r, a), n = String.fromCharCode.apply(null, f);
+    return k(this.lock), this.cachedPointer = t, this.cachedString = n, n;
   }
   set value(t) {
-    let { bufferPosition: e, bufferByteOffset: r } = h(this.allocatedMemory.data, U);
+    let { bufferPosition: e, bufferByteOffset: r } = c(this.allocatedMemory.data, I);
     this.updateString(t), r && this.memory.buffers[e].free(r);
   }
   getSharedMemory() {
@@ -1035,19 +1035,19 @@ class gt {
     return this.allocatedMemory.pointer;
   }
   free() {
-    let { bufferPosition: t, bufferByteOffset: e } = h(this.allocatedMemory.data, U);
+    let { bufferPosition: t, bufferByteOffset: e } = c(this.allocatedMemory.data, I);
     e && this.memory.buffers[t].free(e), this.allocatedMemory.free();
   }
 }
-const k = 0, B = 1, mt = 2, Bt = 3, X = 4;
-class kt {
+const p = 0, b = 1, kt = 2, At = 3, Z = 4;
+class y {
   static ALLOCATE_COUNT = 4;
   memory;
   // Pointer, List Length, Buffer Length, Type/DataLength
   firstBlock;
   uint16Array;
   get length() {
-    return Atomics.load(this.firstBlock.data, B);
+    return Atomics.load(this.firstBlock.data, b);
   }
   get type() {
     return this.uint16Array[0];
@@ -1062,10 +1062,10 @@ class kt {
     Atomics.store(this.uint16Array, 1, t);
   }
   get bufferLength() {
-    return Atomics.load(this.firstBlock.data, mt);
+    return Atomics.load(this.firstBlock.data, kt);
   }
   set bufferLength(t) {
-    Atomics.store(this.firstBlock.data, mt, t);
+    Atomics.store(this.firstBlock.data, kt, t);
   }
   get pointer() {
     return this.firstBlock.pointer;
@@ -1074,18 +1074,18 @@ class kt {
   cachedPointer;
   constructor(t, e) {
     if (this.memory = t, e && "firstBlock" in e) {
-      if (this.firstBlock = new c(t, e.firstBlock), this.uint16Array = new Uint16Array(this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + Bt * Uint32Array.BYTES_PER_ELEMENT, 2), "type" in e || "dataLength" in e) {
-        let r = t.allocUI32(X * (e.dataLength ?? 1));
-        m(this.firstBlock.data, k, r.bufferPosition, r.bufferByteOffset), this.bufferLength = X, this.dataLength = e.dataLength ?? 1;
+      if (this.firstBlock = new h(t, e.firstBlock), this.uint16Array = new Uint16Array(this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + At * Uint32Array.BYTES_PER_ELEMENT, 2), "type" in e || "dataLength" in e) {
+        let r = t.allocUI32(Z * (e.dataLength ?? 1));
+        m(this.firstBlock.data, p, r.bufferPosition, r.bufferByteOffset), this.bufferLength = Z, this.dataLength = e.dataLength ?? 1;
       }
       if ("type" in e) {
         const r = e?.type ?? Uint32Array;
         r === Uint32Array ? this.type = 0 : r === Int32Array ? this.type = 1 : r === Float32Array && (this.type = 2);
       }
     } else {
-      this.firstBlock = t.allocUI32(kt.ALLOCATE_COUNT), this.uint16Array = new Uint16Array(this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + Bt * Uint32Array.BYTES_PER_ELEMENT, 2);
-      let r = e?.dataLength ?? 1, s = e?.bufferLength ?? X, o = t.allocUI32(s * r);
-      m(this.firstBlock.data, k, o.bufferPosition, o.bufferByteOffset), this.bufferLength = s;
+      this.firstBlock = t.allocUI32(y.ALLOCATE_COUNT), this.uint16Array = new Uint16Array(this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + At * Uint32Array.BYTES_PER_ELEMENT, 2);
+      let r = e?.dataLength ?? 1, i = e?.bufferLength ?? Z, o = t.allocUI32(i * r);
+      m(this.firstBlock.data, p, o.bufferPosition, o.bufferByteOffset), this.bufferLength = i;
       const a = e?.type ?? Uint32Array;
       a === Uint32Array ? this.type = 0 : a === Int32Array ? this.type = 1 : a === Float32Array && (this.type = 2), this.dataLength = r;
     }
@@ -1110,25 +1110,25 @@ class kt {
     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.getFullDataBlock(), s = this.length;
-    return r.set(t, e * s), Atomics.add(this.firstBlock.data, B, 1) + 1 >= this.bufferLength && this.growBuffer(), s;
+    let r = this.getFullDataBlock(), i = this.length;
+    return r.set(t, e * i), Atomics.add(this.firstBlock.data, b, 1) + 1 >= this.bufferLength && this.growBuffer(), i;
   }
   pop() {
-    let t = Atomics.sub(this.firstBlock.data, B, B), e = this.getFullDataBlock();
+    let t = Atomics.sub(this.firstBlock.data, b, b), e = this.getFullDataBlock();
     return this.getDataBlock(e, t - 1);
   }
   deleteIndex(t) {
     let e = this.length;
     if (t >= e || t < 0)
       throw new Error(`${t} is out of bounds ${e}`);
-    let r = this.dataLength, s = this.getFullDataBlock();
+    let r = this.dataLength, i = this.getFullDataBlock();
     for (let o = t; o < e; o++)
       for (let a = 0; a < r; a++)
-        s[o * r + a] = s[(o + 1) * r + a];
-    Atomics.sub(this.firstBlock.data, B, B);
+        i[o * r + a] = i[(o + 1) * r + a];
+    Atomics.sub(this.firstBlock.data, b, b);
   }
   clear() {
-    this.firstBlock.data[B] = 0;
+    this.firstBlock.data[b] = 0;
   }
   *[Symbol.iterator]() {
     let t = this.getFullDataBlock();
@@ -1136,31 +1136,31 @@ class kt {
       yield this.getDataBlock(t, e);
   }
   getFullDataBlock() {
-    let t = Atomics.load(this.firstBlock.data, k);
+    let t = Atomics.load(this.firstBlock.data, p);
     if (this.cachedPointer === t && this.cachedFullDataBlock)
       return this.cachedFullDataBlock;
-    let e = L(t), r = new c(this.memory, e), s;
+    let e = A(t), r = new h(this.memory, e), i;
     switch (this.type) {
       case 1:
-        s = new Int32Array(r.data.buffer, r.bufferByteOffset, this.dataLength * this.bufferLength);
+        i = new Int32Array(r.data.buffer, r.bufferByteOffset, this.dataLength * this.bufferLength);
         break;
       case 0:
-        s = new Uint32Array(r.data.buffer, r.bufferByteOffset, this.dataLength * this.bufferLength);
+        i = new Uint32Array(r.data.buffer, r.bufferByteOffset, this.dataLength * this.bufferLength);
         break;
       case 2:
-        s = new Float32Array(r.data.buffer, r.bufferByteOffset, this.dataLength * this.bufferLength);
+        i = new Float32Array(r.data.buffer, r.bufferByteOffset, this.dataLength * this.bufferLength);
         break;
       default:
         throw new Error(`Unknown data block type ${this.type}`);
     }
-    return this.cachedPointer = t, this.cachedFullDataBlock = s, s;
+    return this.cachedPointer = t, this.cachedFullDataBlock = i, i;
   }
   getDataBlock(t, e) {
     const r = e * this.dataLength;
     return t.subarray(r, r + this.dataLength);
   }
   growBuffer() {
-    let e = this.bufferLength * 2, r = this.dataLength, s = h(this.firstBlock.data, k), o = new c(this.memory, s), a = this.getFullDataBlock(), f = this.memory.allocUI32(e * r), n;
+    let e = this.bufferLength * 2, r = this.dataLength, i = c(this.firstBlock.data, p), o = new h(this.memory, i), a = this.getFullDataBlock(), f = this.memory.allocUI32(e * r), n;
     switch (this.type) {
       case 1:
         n = new Int32Array(f.data.buffer, f.bufferByteOffset, r * this.bufferLength);
@@ -1174,11 +1174,11 @@ class kt {
       default:
         throw new Error(`Unknown data block type ${this.type}`);
     }
-    n.set(a), m(this.firstBlock.data, k, f.bufferPosition, f.bufferByteOffset), this.bufferLength = e, o.free();
+    n.set(a), m(this.firstBlock.data, p, f.bufferPosition, f.bufferByteOffset), this.bufferLength = e, o.free();
   }
   free() {
-    let t = h(this.firstBlock.data, k);
-    new c(this.memory, t).free(), this.firstBlock.free();
+    let t = c(this.firstBlock.data, p);
+    new h(this.memory, t).free(), this.firstBlock.free();
   }
   getSharedMemory() {
     return {
@@ -1186,17 +1186,17 @@ class kt {
     };
   }
 }
-class ie {
+class le {
   static ALLOCATE_COUNT = u.ALLOCATE_COUNT;
   heap;
   list;
   cache = /* @__PURE__ */ new Map();
   constructor(t, e) {
     e ? this.list = new u(t, e) : this.list = new u(t), this.heap = t, this.list.onDelete = (r) => {
-      let s = Atomics.load(r, 0);
-      if (s) {
-        let o = this.cache.get(s);
-        o || (o = this.initItem(s)), o && (o.free(), this.cache.delete(s));
+      let i = Atomics.load(r, 0);
+      if (i) {
+        let o = this.cache.get(i);
+        o || (o = this.initItem(i)), o && (o.free(), this.cache.delete(i));
       }
     };
   }
@@ -1219,11 +1219,11 @@ class ie {
   *[Symbol.iterator]() {
     let t = this.list[Symbol.iterator]();
     for (let { data: e, deleteCurrent: r } of t) {
-      let s = Atomics.load(e, 0);
-      if (!s)
+      let i = Atomics.load(e, 0);
+      if (!i)
         continue;
-      let o = this.cache.get(s);
-      o || (o = this.initItem(s), o && this.cache.set(s, o)), o && (yield {
+      let o = this.cache.get(i);
+      o || (o = this.initItem(i), o && this.cache.set(i, o)), o && (yield {
         item: o,
         deleteCurrent: r
       });
@@ -1257,100 +1257,246 @@ class ie {
     this.list.free(), this.cache.clear();
   }
 }
-const Et = new ArrayBuffer(4), wt = new Uint32Array(Et), F = new Uint16Array(Et);
-function se(i, t) {
-  return Vt(Atomics.load(i, t));
+const D = 0, gt = 1, Et = 2, j = 3, pt = j + y.ALLOCATE_COUNT;
+class St {
+  static ALLOCATE_COUNT = 3 + y.ALLOCATE_COUNT * 2;
+  memory;
+  // Current Length, Type/DataLength, MaxChunkLength, Pointer vector, Recycle vector
+  firstBlock;
+  uint16Array;
+  pointerVector;
+  recycleVector;
+  cachedFullDataBlock = {};
+  get length() {
+    return Atomics.load(this.firstBlock.data, D) - this.recycleVector.length;
+  }
+  get maxChunkSize() {
+    return this.firstBlock.data[Et];
+  }
+  set maxChunkSize(t) {
+    Atomics.store(this.firstBlock.data, Et, t);
+  }
+  get type() {
+    return this.uint16Array[0];
+  }
+  set type(t) {
+    Atomics.store(this.uint16Array, 0, t);
+  }
+  get dataLength() {
+    return Math.max(1, this.uint16Array[1]);
+  }
+  set dataLength(t) {
+    Atomics.store(this.uint16Array, 1, t);
+  }
+  get bufferLength() {
+    return this.maxChunkSize * this.pointerVector.length;
+  }
+  constructor(t, e) {
+    if (this.memory = t, e && "firstBlock" in e)
+      this.firstBlock = new h(t, e.firstBlock), this.uint16Array = new Uint16Array(this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + gt * Uint32Array.BYTES_PER_ELEMENT, 2), this.pointerVector = new y(t, {
+        firstBlock: {
+          bufferPosition: this.firstBlock.bufferPosition,
+          bufferByteOffset: this.firstBlock.bufferByteOffset + j * Uint32Array.BYTES_PER_ELEMENT
+        }
+      }), this.recycleVector = new y(t, {
+        firstBlock: {
+          bufferPosition: this.firstBlock.bufferPosition,
+          bufferByteOffset: this.firstBlock.bufferByteOffset + pt * Uint32Array.BYTES_PER_ELEMENT
+        }
+      });
+    else {
+      this.firstBlock = t.allocUI32(St.ALLOCATE_COUNT), this.uint16Array = new Uint16Array(this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + gt * Uint32Array.BYTES_PER_ELEMENT, 2);
+      let r = e?.dataLength ?? 1, i = e?.maxChunkSize ?? 100;
+      this.pointerVector = new y(t, {
+        type: Uint32Array,
+        firstBlock: {
+          bufferPosition: this.firstBlock.bufferPosition,
+          bufferByteOffset: this.firstBlock.bufferByteOffset + j * Uint32Array.BYTES_PER_ELEMENT
+        }
+      }), this.recycleVector = new y(t, {
+        type: Uint32Array,
+        firstBlock: {
+          bufferPosition: this.firstBlock.bufferPosition,
+          bufferByteOffset: this.firstBlock.bufferByteOffset + pt * Uint32Array.BYTES_PER_ELEMENT
+        }
+      });
+      let o = t.allocUI32(i * r);
+      this.pointerVector.push(o.pointer);
+      const a = e?.type ?? Uint32Array;
+      a === Uint32Array ? this.type = 0 : a === Int32Array ? this.type = 1 : a === Float32Array && (this.type = 2), this.dataLength = r, this.maxChunkSize = i;
+    }
+  }
+  at(t) {
+    let e = this.getFullDataBlock(t);
+    return this.getDataBlock(e, t % this.maxChunkSize);
+  }
+  get(t, e = 0) {
+    const r = this.dataLength;
+    if (e >= r)
+      throw new Error(`${e} is out of dataLength bounds ${r}`);
+    return this.getFullDataBlock(t)[t % this.maxChunkSize * r + e];
+  }
+  push(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.recycleVector.length ? r = this.recycleVector.pop()[0] : r = Atomics.add(this.firstBlock.data, D, 1);
+    let i = this.getFullDataBlock(r), o = r % this.maxChunkSize;
+    return i.set(t, e * o), r;
+  }
+  deleteIndex(t) {
+    this.recycleVector.push(t);
+  }
+  clear() {
+    this.firstBlock.data[D] = 0;
+  }
+  *[Symbol.iterator]() {
+    let t = [...this.recycleVector].reduce((i, o) => (i.push(...o), i), []), e = this.getFullDataBlock(0), r = 0;
+    for (let i = 0; i < Atomics.load(this.firstBlock.data, D); i++)
+      if (!t.includes(i)) {
+        let o = Math.floor(i / this.maxChunkSize);
+        o !== r && (e = this.getFullDataBlock(i), r = o), yield this.getDataBlock(e, i % this.maxChunkSize);
+      }
+  }
+  getFullDataBlock(t) {
+    let e = Math.floor(t / this.maxChunkSize), r = this.cachedFullDataBlock[e];
+    if (r)
+      return r;
+    if (e >= this.pointerVector.length) {
+      let a = this.memory.allocUI32(this.maxChunkSize * this.dataLength);
+      this.pointerVector.push(a.pointer);
+    }
+    let i = new h(this.memory, A(this.pointerVector.get(e))), o;
+    switch (this.type) {
+      case 1:
+        o = new Int32Array(i.data.buffer, i.bufferByteOffset, this.dataLength * this.maxChunkSize);
+        break;
+      case 0:
+        o = new Uint32Array(i.data.buffer, i.bufferByteOffset, this.dataLength * this.maxChunkSize);
+        break;
+      case 2:
+        o = new Float32Array(i.data.buffer, i.bufferByteOffset, this.dataLength * this.maxChunkSize);
+        break;
+      default:
+        throw new Error(`Unknown data block type ${this.type}`);
+    }
+    return this.cachedFullDataBlock[e] = o, o;
+  }
+  getDataBlock(t, e) {
+    const r = e * this.dataLength;
+    return t.subarray(r, r + this.dataLength);
+  }
+  free() {
+    this.recycleVector.free();
+    for (let t of this.pointerVector) {
+      let e = t[0];
+      new h(this.memory, A(e)).free();
+    }
+    this.pointerVector.free(), this.firstBlock.free();
+  }
+  getSharedMemory() {
+    return {
+      firstBlock: this.firstBlock.getSharedMemory()
+    };
+  }
+}
+const _t = new ArrayBuffer(4), Ot = new Uint32Array(_t), R = new Uint16Array(_t);
+function he(s, t) {
+  return ee(Atomics.load(s, t));
 }
-function oe(i, t, e, r) {
-  Atomics.store(i, t, jt(e, r));
+function ce(s, t, e, r) {
+  Atomics.store(s, t, re(e, r));
 }
-function Vt(i) {
-  return wt[0] = i, [F[0], F[1]];
+function ee(s) {
+  return Ot[0] = s, [R[0], R[1]];
 }
-function jt(i, t) {
-  return F[0] = i, F[1] = t, wt[0];
+function re(s, t) {
+  return R[0] = s, R[1] = t, Ot[0];
 }
-const pt = new ArrayBuffer(8), Tt = new BigUint64Array(pt), y = new Uint16Array(pt);
-function ae(i, t) {
-  return Tt[0] = Atomics.load(i, t), [y[0], y[1], y[2], y[3]];
+const Mt = new ArrayBuffer(8), Pt = new BigUint64Array(Mt), B = new Uint16Array(Mt);
+function ue(s, t) {
+  return Pt[0] = Atomics.load(s, t), [B[0], B[1], B[2], B[3]];
 }
-function ne(i, t, e, r, s, o = 0) {
-  y[0] = e, y[1] = r, y[2] = s, y[3] = o, Atomics.store(i, t, Tt[0]);
+function de(s, t, e, r, i, o = 0) {
+  B[0] = e, B[1] = r, B[2] = i, B[3] = o, Atomics.store(s, t, Pt[0]);
 }
-const _t = new ArrayBuffer(4), St = new Float32Array(_t), Lt = new Int32Array(_t);
-function fe(i, t) {
-  return Ot(Atomics.load(i, t));
+const Nt = new ArrayBuffer(4), Ut = new Float32Array(Nt), Ct = new Int32Array(Nt);
+function ye(s, t) {
+  return It(Atomics.load(s, t));
 }
-function le(i, t, e) {
-  Atomics.store(i, t, Mt(e));
+function Be(s, t, e) {
+  Atomics.store(s, t, Dt(e));
 }
-function Ot(i) {
-  return Lt[0] = i, St[0];
+function It(s) {
+  return Ct[0] = s, Ut[0];
 }
-function Mt(i) {
-  return St[0] = i, Lt[0];
+function Dt(s) {
+  return Ut[0] = s, Ct[0];
 }
-function he(i, t, e) {
-  return Ot(Atomics.exchange(i, t, Mt(e)));
+function me(s, t, e) {
+  return It(Atomics.exchange(s, t, Dt(e)));
 }
-const E = 0, v = 1, p = 2;
-function ce(i, t = 0) {
-  for (; Atomics.compareExchange(i, t, E, v) === p; )
-    Atomics.wait(i, t, p);
-  Atomics.add(i, t + 1, 1);
+const w = 0, q = 1, L = 2;
+function be(s, t = 0) {
+  for (; Atomics.compareExchange(s, t, w, q) === L; )
+    Atomics.wait(s, t, L);
+  Atomics.add(s, t + 1, 1);
 }
-function ue(i, t = 0) {
-  let e = Atomics.compareExchange(i, t, E, p);
-  for (; e !== E; )
-    Atomics.wait(i, t, e), e = Atomics.compareExchange(i, t, E, p);
+function ke(s, t = 0) {
+  let e = Atomics.compareExchange(s, t, w, L);
+  for (; e !== w; )
+    Atomics.wait(s, t, e), e = Atomics.compareExchange(s, t, w, L);
 }
-function de(i, t = 0) {
-  Atomics.sub(i, t + 1, 1) - 1 <= 0 && (Atomics.compareExchange(i, t, v, E) !== v && console.warn("We are unlocking when it was not read locked!"), Atomics.notify(i, t));
+function Ae(s, t = 0) {
+  Atomics.sub(s, t + 1, 1) - 1 <= 0 && (Atomics.compareExchange(s, t, q, w) !== q && console.warn("We are unlocking when it was not read locked!"), Atomics.notify(s, t));
 }
-function ye(i, t = 0) {
-  Atomics.compareExchange(i, t, p, E) !== p && console.warn("We are unlocking when it was not write locked!"), Atomics.notify(i, t);
+function ge(s, t = 0) {
+  Atomics.compareExchange(s, t, L, w) !== L && console.warn("We are unlocking when it was not write locked!"), Atomics.notify(s, t);
 }
-const me = 2;
+const Ee = 2;
 export {
-  c as AllocatedMemory,
-  qt as BYTE_OFFSET_BIT_COUNT,
-  ie as CachedItemList,
-  V as MAX_BYTE_OFFSET_LENGTH,
-  j as MAX_POSITION_LENGTH,
-  K as MemoryBuffer,
-  ee as MemoryHeap,
-  Jt as POSITION_BIT_COUNT,
-  me as READ_WRITE_LOCK_ALLOCATE_COUNT,
-  te as SIMPLE_LOCK_ALLOCATE_COUNT,
+  h as AllocatedMemory,
+  ie as BYTE_OFFSET_BIT_COUNT,
+  le as CachedItemList,
+  J as MAX_BYTE_OFFSET_LENGTH,
+  Q as MAX_POSITION_LENGTH,
+  V as MemoryBuffer,
+  ne as MemoryHeap,
+  se as POSITION_BIT_COUNT,
+  Ee as READ_WRITE_LOCK_ALLOCATE_COUNT,
+  ae as SIMPLE_LOCK_ALLOCATE_COUNT,
   u as SharedList,
-  At as SharedMap,
-  re as SharedPointerList,
-  gt as SharedString,
-  kt as SharedVector,
-  jt as convert16To32,
-  Vt as convert32To16,
-  Mt as convertFloat32ToInt32,
-  Ot as convertInt32ToFloat32,
-  w as createPointer,
-  he as exchangeFloat32,
-  L as getPointer,
-  se as load16From32,
-  ae as load16From64,
-  fe as loadFloat32,
-  h as loadPointer,
-  S as loadRawPointer,
-  D as lock,
-  ce as readLock,
-  de as readUnlock,
-  Qt as replacePointer,
-  R as replaceRawPointer,
-  oe as store16In32,
-  ne as store16In64,
-  le as storeFloat32,
+  Tt as SharedMap,
+  fe as SharedPointerList,
+  St as SharedPool,
+  Lt as SharedString,
+  y as SharedVector,
+  re as convert16To32,
+  ee as convert32To16,
+  Dt as convertFloat32ToInt32,
+  It as convertInt32ToFloat32,
+  T as createPointer,
+  me as exchangeFloat32,
+  A as getPointer,
+  he as load16From32,
+  ue as load16From64,
+  ye as loadFloat32,
+  c as loadPointer,
+  O as loadRawPointer,
+  x as lock,
+  be as readLock,
+  Ae as readUnlock,
+  oe as replacePointer,
+  z as replaceRawPointer,
+  ce as store16In32,
+  de as store16In64,
+  Be as storeFloat32,
   m as storePointer,
-  Z as storeRawPointer,
-  b as unlock,
-  ue as writeLock,
-  ye as writeUnlock
+  W as storeRawPointer,
+  k as unlock,
+  ke as writeLock,
+  ge as writeUnlock
 };
 //# sourceMappingURL=shared-memory-objects.js.map