@daneren2005/shared-memory-objects 0.0.21 → 1.0.0

package/dist/shared-memory-objects.js

@@ -1,33 +1,33 @@
-const he = 20, ce = 12, et = Math.pow(2, 20), rt = Math.pow(2, 12);
-function c(i, t = 0) {
-  return B(Atomics.load(i, t));
+const Qt = 20, te = 12, tt = Math.pow(2, 20), et = Math.pow(2, 12);
+function c(s, t = 0) {
+  return y(Atomics.load(s, t));
 }
-function O(i, t = 0) {
-  return Atomics.load(i, t);
+function O(s, t = 0) {
+  return Atomics.load(s, t);
 }
-function k(i, t = 0, e, r) {
-  Atomics.store(i, t, L(e, r));
+function k(s, t = 0, e, r) {
+  Atomics.store(s, t, L(e, r));
 }
-function x(i, t = 0, e) {
-  Atomics.store(i, t, e);
+function U(s, t = 0, e) {
+  Atomics.store(s, t, e);
 }
-function ue(i, t, e, r, s, o) {
-  let a = L(s, o);
-  return Atomics.compareExchange(i, t, a, L(e, r)) === a;
+function ee(s, t, e, r, i, o) {
+  let a = L(i, o);
+  return Atomics.compareExchange(s, t, a, L(e, r)) === a;
 }
-function V(i, t, e, r) {
-  return Atomics.compareExchange(i, t, r, e) === r;
+function H(s, t, e, r) {
+  return Atomics.compareExchange(s, t, r, e) === r;
 }
-function B(i) {
+function y(s) {
   return {
-    bufferPosition: i & 4095,
-    bufferByteOffset: i >>> 12
+    bufferPosition: s & 4095,
+    bufferByteOffset: s >>> 12
   };
 }
-function L(i, t) {
-  return i + (t << 12);
+function L(s, t) {
+  return s + (t << 12);
 }
-class h {
+class f {
   memory;
   bufferPosition;
   get bufferByteOffset() {
@@ -60,15 +60,15 @@ class h {
     };
   }
 }
-const j = 0, F = 1;
-function z(i, t = 0) {
-  for (; Atomics.compareExchange(i, t, j, F) !== j; )
-    "WorkerGlobalScope" in self && Atomics.wait(i, t, F);
+const W = 0, D = 1;
+function x(s, t = 0) {
+  for (; Atomics.compareExchange(s, t, W, D) !== W; )
+    "WorkerGlobalScope" in self && Atomics.wait(s, t, D);
 }
-function g(i, t = 0) {
-  Atomics.compareExchange(i, t, F, j) !== F && console.warn("We are unlocking when it was not locked!"), Atomics.notify(i, t);
+function b(s, t = 0) {
+  Atomics.compareExchange(s, t, D, W) !== D && console.warn("We are unlocking when it was not locked!"), Atomics.notify(s, t);
 }
-const de = 1, Vt = {
+const re = 1, Rt = {
   5120: "i8",
   5121: "u8",
   5122: "i16",
@@ -76,35 +76,35 @@ const de = 1, Vt = {
   5124: "i32",
   5125: "u32",
   5126: "f32"
-}, Kt = {
+}, $t = {
   f32: Float32Array,
   f64: Float64Array
-}, Gt = {
+}, Ht = {
   i8: Int8Array,
   i16: Int16Array,
   i32: Int32Array
-}, Xt = {
+}, Yt = {
   u8: Uint8Array,
   u8c: Uint8ClampedArray,
   u16: Uint16Array,
   u32: Uint32Array
-}, Zt = {
+}, Vt = {
   i64: BigInt64Array,
   u64: BigUint64Array
-}, Wt = {
-  ...Kt,
-  ...Gt,
-  ...Xt
-}, vt = (i) => {
-  const t = Vt[i];
-  return t !== void 0 ? t : i;
+}, Kt = {
+  ...$t,
+  ...Ht,
+  ...Yt
+}, Xt = (s) => {
+  const t = Rt[s];
+  return t !== void 0 ? t : s;
 };
-function jt(i, ...t) {
-  const e = Zt[i];
-  return new (e || Wt[vt(i)])(...t);
+function Gt(s, ...t) {
+  const e = Vt[s];
+  return new (e || Kt[Xt(s)])(...t);
 }
-const it = 0, st = 1, ot = 2, at = 3, nt = 4, A = 5, lt = 6, K = 1, G = 2, ft = 32, X = 0, Z = 1, y = 8;
-class W {
+const rt = 0, it = 1, st = 2, ot = 3, at = 4, g = 5, nt = 6, Y = 1, V = 2, lt = 32, K = 0, X = 1, d = 8;
+class G {
   buf;
   start;
   u8;
@@ -112,29 +112,29 @@ class W {
   state;
   lock;
   constructor(t = {}) {
-    if (this.buf = t.buf ? t.buf : new ArrayBuffer(t.size || 4096), this.start = t.start != null ? I(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, ft / 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 ? C(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, lt / 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 W {
     };
   }
   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 * qt[t]);
-    return r ? jt(t, this.buf, r, e) : void 0;
+    const r = this.malloc(e * Zt[t]);
+    return r ? Gt(t, this.buf, r, e) : void 0;
   }
   calloc(t, e = 0) {
     const r = this.malloc(t);
@@ -159,68 +159,68 @@ class W {
   malloc(t) {
     if (t <= 0)
       return 0;
-    z(this.lock);
-    const e = I(t + y, this.align), r = this.end;
-    let s = this.top, o = this._free, a = 0;
+    x(this.lock);
+    const e = C(t + d, this.align), r = this.end;
+    let i = this.top, o = this._free, a = 0;
     for (; o; ) {
-      const l = this.blockSize(o), n = o + l >= s;
-      if (n || l >= e) {
-        let f = this.mallocTop(
+      const n = this.blockSize(o), l = o + n >= i;
+      if (l || n >= e) {
+        let h = this.mallocTop(
           o,
           a,
-          l,
+          n,
           e,
-          n
+          l
         );
-        return g(this.lock), f;
+        return b(this.lock), h;
       }
       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;
-      let l = _(o);
-      return g(this.lock), l;
+    if (o = i, i = o + e, i <= r) {
+      this.initBlock(o, e, this._used), this._used = o, this.top = i;
+      let n = T(o);
+      return b(this.lock), n;
     }
-    return g(this.lock), 0;
+    return b(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);
+    return T(t);
   }
   realloc(t, e) {
     if (e <= 0)
       return 0;
-    const r = C(t);
-    let s = 0, o = this._used, a = 0;
+    const r = _(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),
-      _(r),
+    return i && i !== r && this.u8.copyWithin(
+      T(i),
+      T(r),
       a
-    ), _(s);
+    ), T(i);
   }
   reallocBlock(t, e) {
-    const r = this.blockSize(t), s = t + r, o = s >= this.top, a = I(e + y, this.align);
+    const r = this.blockSize(t), i = t + r, o = i >= this.top, a = C(e + d, this.align);
     if (a <= r) {
       if (this.doSplit) {
-        const l = r - a;
-        l >= this.minSplit ? this.splitBlock(t, a, l) : o && (this.top = t + a);
+        const n = r - a;
+        n >= this.minSplit ? this.splitBlock(t, a, n) : 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), [C(this.malloc(e)), s]);
+    return o && t + a < this.end ? (this.top = t + this.setBlockSize(t, a), [t, i]) : (this.free(t), [_(this.malloc(e)), i]);
   }
   reallocArray(t, e) {
     if (t.buffer !== this.buf)
@@ -239,11 +239,11 @@ class W {
       e = t.byteOffset;
     } else
       e = t;
-    e = C(e);
+    e = _(e);
     let r = this._used;
     for (; r; ) {
       if (r === e)
-        return this.blockSize(e) - y;
+        return this.blockSize(e) - d;
       r = this.blockNext(r);
     }
   }
@@ -260,14 +260,14 @@ class W {
       e = t.byteOffset;
     } else
       e = t;
-    z(this.lock), e = C(e);
-    let r = this._used, s = 0;
+    x(this.lock), e = _(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(), g(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(), b(this.lock), !0;
+      i = r, r = this.blockNext(r);
     }
-    return g(this.lock), !1;
+    return b(this.lock), !1;
   }
   freeAll() {
     this._free = 0, this._used = 0, this.top = this.initialTop();
@@ -276,57 +276,57 @@ class W {
     return delete this.u8, delete this.u32, delete this.state, delete this.buf, !0;
   }
   get align() {
-    return this.state[nt];
+    return this.state[at];
   }
   set align(t) {
-    this.state[nt] = t;
+    this.state[at] = t;
   }
   get end() {
-    return this.state[at];
+    return this.state[ot];
   }
   set end(t) {
-    this.state[at] = t;
+    this.state[ot] = t;
   }
   get top() {
-    return Atomics.load(this.state, ot);
+    return Atomics.load(this.state, st);
   }
   set top(t) {
-    Atomics.store(this.state, ot, t);
+    Atomics.store(this.state, st, t);
   }
   get _free() {
-    return Atomics.load(this.state, it);
+    return Atomics.load(this.state, rt);
   }
   set _free(t) {
-    Atomics.store(this.state, it, t);
+    Atomics.store(this.state, rt, t);
   }
   get _used() {
-    return Atomics.load(this.state, st);
+    return Atomics.load(this.state, it);
   }
   set _used(t) {
-    Atomics.store(this.state, st, t);
+    Atomics.store(this.state, it, t);
   }
   get doCompact() {
-    return !!(this.state[A] & K);
+    return !!(this.state[g] & Y);
   }
   set doCompact(t) {
-    t ? this.state[A] |= 1 << K - 1 : this.state[A] &= ~K;
+    t ? this.state[g] |= 1 << Y - 1 : this.state[g] &= ~Y;
   }
   get doSplit() {
-    return !!(this.state[A] & G);
+    return !!(this.state[g] & V);
   }
   set doSplit(t) {
-    t ? this.state[A] |= 1 << G - 1 : this.state[A] &= ~G;
+    t ? this.state[g] |= 1 << V - 1 : this.state[g] &= ~V;
   }
   get minSplit() {
-    return this.state[lt];
+    return this.state[nt];
   }
   set minSplit(t) {
-    if (t <= y)
-      throw new Error(`illegal min split threshold: ${t}, require at least ${y + 1}`);
-    this.state[lt] = t;
+    if (t <= d)
+      throw new Error(`illegal min split threshold: ${t}, require at least ${d + 1}`);
+    this.state[nt] = t;
   }
   blockSize(t) {
-    return Atomics.load(this.u32, (t >> 2) + X);
+    return Atomics.load(this.u32, (t >> 2) + K);
   }
   /**
    * Sets & returns given block size.
@@ -335,10 +335,10 @@ class W {
    * @param size -
    */
   setBlockSize(t, e) {
-    return Atomics.store(this.u32, (t >> 2) + X, 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) + X);
   }
   /**
    * Sets block next pointer to `next`. Use zero to indicate list end.
@@ -346,7 +346,7 @@ class W {
    * @param block -
    */
   setBlockNext(t, e) {
-    Atomics.store(this.u32, (t >> 2) + Z, e);
+    Atomics.store(this.u32, (t >> 2) + X, e);
   }
   /**
    * Initializes block header with given `size` and `next` pointer. Returns `block`.
@@ -356,8 +356,8 @@ class W {
    * @param next -
    */
   initBlock(t, e, r) {
-    const s = t >>> 2;
-    return Atomics.store(this.u32, s + X, 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 + X, r), t;
   }
   unlinkBlock(t, e) {
     this.setBlockNext(t, this.blockNext(e));
@@ -372,7 +372,7 @@ class W {
     ), this.doCompact && this.compact();
   }
   initialTop(t = this.align) {
-    return I(this.start + ft + y, t) - y;
+    return C(this.start + lt + d, t) - d;
   }
   /**
    * Traverses free list and attempts to recursively merge blocks
@@ -380,20 +380,20 @@ class W {
    * 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 l = this.blockNext(s);
-        let n = this.blockNext(t);
-        for (; n && n !== l; ) {
-          const f = this.blockNext(n);
-          this.setBlockNext(n, 0), n = f;
+        const n = this.blockNext(i);
+        let l = this.blockNext(t);
+        for (; l && l !== n; ) {
+          const h = this.blockNext(l);
+          this.setBlockNext(l, 0), l = h;
         }
-        this.setBlockNext(t, l), o = !0;
+        this.setBlockNext(t, n), o = !0;
       }
       t + this.blockSize(t) >= this.top && (this.top = t, e ? this.unlinkBlock(e, t) : this._free = this.blockNext(t)), e = t, t = this.blockNext(t);
     }
@@ -411,7 +411,7 @@ class W {
     r ? this.setBlockNext(r, t) : this._free = t, this.setBlockNext(t, e);
   }
 }
-const _ = (i) => i > 0 ? i + y : 0, C = (i) => i > 0 ? i - y : 0, I = (i, t) => (t--, i + t & ~t), qt = {
+const T = (s) => s > 0 ? s + d : 0, _ = (s) => s > 0 ? s - d : 0, C = (s, t) => (t--, s + t & ~t), Zt = {
   u8: 1,
   u8c: 1,
   i8: 1,
@@ -423,156 +423,55 @@ const _ = (i) => i > 0 ? i + y : 0, C = (i) => i > 0 ? i - y : 0, I = (i, t) =>
   u64: 8,
   f32: 4,
   f64: 8
-}, Jt = [
-  "B",
-  "kB",
-  "MB",
-  "GB",
-  "TB",
-  "PB",
-  "EB",
-  "ZB",
-  "YB"
-], Qt = [
-  "B",
-  "KiB",
-  "MiB",
-  "GiB",
-  "TiB",
-  "PiB",
-  "EiB",
-  "ZiB",
-  "YiB"
-], te = [
-  "b",
-  "kbit",
-  "Mbit",
-  "Gbit",
-  "Tbit",
-  "Pbit",
-  "Ebit",
-  "Zbit",
-  "Ybit"
-], ee = [
-  "b",
-  "kibit",
-  "Mibit",
-  "Gibit",
-  "Tibit",
-  "Pibit",
-  "Eibit",
-  "Zibit",
-  "Yibit"
-], ht = (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;
-}, _t = (i) => {
-  if (typeof i == "number")
-    return Math.log10(i);
-  const t = i.toString(10);
-  return t.length + Math.log10(`0.${t.slice(0, 15)}`);
-}, re = (i) => typeof i == "number" ? Math.log(i) : _t(i) * Math.log(10), ie = (i, t) => {
-  if (typeof i == "number")
-    return i / t;
-  const e = i / BigInt(t), r = i % BigInt(t);
-  return Number(e) + Number(r) / t;
-}, ct = (i, t) => {
-  if (t === void 0)
-    return i;
-  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;
-}, se = (i) => {
-  const { minimumFractionDigits: t, maximumFractionDigits: e } = i;
-  if (!(t === void 0 && e === void 0))
-    return {
-      ...t !== void 0 && { minimumFractionDigits: t },
-      ...e !== void 0 && { maximumFractionDigits: e },
-      roundingMode: "trunc"
-    };
-};
-function oe(i, t) {
-  if (typeof i != "bigint" && !Number.isFinite(i))
-    throw new TypeError(`Expected a finite number, got ${typeof i}: ${i}`);
-  t = {
-    bits: !1,
-    binary: !1,
-    space: !0,
-    nonBreakingSpace: !1,
-    ...t
-  };
-  const e = t.bits ? t.binary ? ee : te : t.binary ? Qt : Jt, r = t.space ? t.nonBreakingSpace ? " " : " " : "", s = typeof i == "number" ? i === 0 : i === 0n;
-  if (t.signed && s) {
-    const f = ` 0${r}${e[0]}`;
-    return ct(f, t.fixedWidth);
-  }
-  const o = i < 0, a = o ? "-" : t.signed ? "+" : "";
-  o && (i = -i);
-  const l = se(t);
-  let n;
-  if (i < 1) {
-    const f = ht(i, t.locale, l);
-    n = a + f + r + e[0];
-  } else {
-    const f = Math.min(Math.floor(t.binary ? re(i) / Math.log(1024) : _t(i) / 3), e.length - 1);
-    if (i = ie(i, (t.binary ? 1024 : 1e3) ** f), !l) {
-      const M = Math.max(3, Math.floor(i).toString().length);
-      i = i.toPrecision(M);
-    }
-    const T = ht(Number(i), t.locale, l), H = e[f];
-    n = a + T + r + H;
-  }
-  return ct(n, t.fixedWidth);
-}
-const ae = 8192, ut = 0, v = 1, N = 2;
-class ye {
+}, Wt = 8192, ft = 0, Z = 1, I = 2;
+class ie {
   buffers;
   onGrowBufferHandlers = [];
   isClone;
   memory;
   get bufferSize() {
-    return this.memory.data[ut];
+    return this.memory.data[ft];
   }
   constructor(t) {
     if (t && "buffers" in t)
-      this.buffers = t.buffers.map((e) => new W({
+      this.buffers = t.buffers.map((e) => new G({
         buf: e,
         skipInitialization: !0
-      })), this.memory = new h(this, {
+      })), this.memory = new f(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 ?? ae;
-      if (e > et)
-        throw new Error(`Buffer size ${e} is greater than max ${et} that we can reference with pointers`);
+      const e = t?.bufferSize ?? Wt;
+      if (e > tt)
+        throw new Error(`Buffer size ${e} is greater than max ${tt} 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 h(this, {
+      const i = r.callocAs("u32", 3);
+      if (i)
+        this.memory = new f(this, {
           bufferPosition: 0,
-          bufferByteOffset: s.byteOffset
+          bufferByteOffset: i.byteOffset
         });
       else
         throw new Error("Failed to initialize first byte from buffer");
-      this.memory.data[ut] = e, this.memory.data[v] = 1, this.memory.data[N] = t?.autoGrowSize ?? 100, this.isClone = !1;
+      this.memory.data[ft] = e, this.memory.data[Z] = 1, this.memory.data[I] = 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 W({
+    this.buffers[t.bufferPosition] = new G({
       buf: t.buffer,
       skipInitialization: !0
     });
   }
   growBuffer() {
     const t = this.createBuffer();
-    let e = Atomics.add(this.memory.data, v, 1);
+    let e = Atomics.add(this.memory.data, Z, 1);
     return this.buffers[e] = t, this.onGrowBufferHandlers.forEach((r) => r({
       bufferPosition: e,
       buffer: t.buf
@@ -581,7 +480,7 @@ class ye {
   createBuffer(t) {
     const e = t ?? this.bufferSize;
     let r;
-    return "SharedArrayBuffer" in globalThis ? r = new SharedArrayBuffer(e) : r = new ArrayBuffer(e), new W({
+    return "SharedArrayBuffer" in globalThis ? r = new SharedArrayBuffer(e) : r = new ArrayBuffer(e), new G({
       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 +494,23 @@ class ye {
   }
   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, v) === 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 h(this, {
+        return i === this.buffers.length - 1 && Atomics.load(this.memory.data, Z) === this.buffers.length && this.memory.data[I] < 100 && this.memory.data[I] > 0 && o.top / o.end > this.memory.data[I] / 100 && this.growBuffer(), new f(this, {
           data: a,
           buffer: o
         });
     }
-    if (this.buffers.length >= rt)
-      throw new Error(`Can't initialize a new buffer since it would have a position greater than the max of ${rt}`);
+    if (this.buffers.length >= et)
+      throw new Error(`Can't initialize a new buffer since it would have a position greater than the max of ${et}`);
     let e = this.growBuffer();
     const r = e.callocAs("u32", t);
     if (r)
-      return new h(this, {
+      return new f(this, {
         data: r,
         buffer: e
       });
@@ -619,7 +518,7 @@ class ye {
   }
   getSharedAlloc(t) {
     if (this.buffers[t.bufferPosition] !== void 0)
-      return new h(this, t);
+      return new f(this, t);
   }
   get currentUsed() {
     return this.totalAllocated - this.buffers.reduce((t, e) => t + e.stats().available, 0);
@@ -627,25 +526,15 @@ class ye {
   get totalAllocated() {
     return this.buffers[0].buf.byteLength * this.buffers.length;
   }
-  prettyMemory() {
-    return `${dt(this.currentUsed)} / ${dt(this.totalAllocated)}`;
-  }
   getSharedMemory() {
     return {
       buffers: this.buffers.map((t) => t.buf)
     };
   }
 }
-function dt(i) {
-  return oe(i, {
-    binary: !0,
-    minimumFractionDigits: 1,
-    maximumFractionDigits: 1
-  });
-}
-const yt = 4, Bt = 1, p = 2;
+const ht = 4, ct = 1, A = 2;
 class u {
-  static ALLOCATE_COUNT = yt;
+  static ALLOCATE_COUNT = ht;
   memory;
   /* First block
   	32 index 0
@@ -670,7 +559,7 @@ class u {
   uint16Array;
   onDelete;
   get length() {
-    return Atomics.load(this.firstBlock.data, p);
+    return Atomics.load(this.firstBlock.data, A);
   }
   get type() {
     return Atomics.load(this.uint16Array, 0);
@@ -686,9 +575,9 @@ class u {
   }
   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 + (p + 1) * Uint32Array.BYTES_PER_ELEMENT, 2);
+      this.firstBlock = new f(t, e.firstBlock), this.uint16Array = new Uint16Array(this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + (A + 1) * Uint32Array.BYTES_PER_ELEMENT, 2);
     else {
-      e && e.initWithBlock ? this.firstBlock = new h(t, e.initWithBlock) : this.firstBlock = t.allocUI32(yt), this.uint16Array = new Uint16Array(this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + (p + 1) * Uint32Array.BYTES_PER_ELEMENT, 2);
+      e && e.initWithBlock ? this.firstBlock = new f(t, e.initWithBlock) : this.firstBlock = t.allocUI32(ht), this.uint16Array = new Uint16Array(this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + (A + 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 +587,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(Bt + e), s = 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];
-    let a, l = !1;
-    for (; !l; )
-      a = O(this.firstBlock.data, 1), l = V(this.firstBlock.data, 1, o, a);
+    let r = this.memory.allocUI32(ct + e), i = this.getDataBlock(r.data), o = r.pointer;
+    for (let l = 0; l < t.length; l++)
+      i instanceof Int32Array || i instanceof Uint32Array ? Atomics.store(i, l, t[l]) : i[l] = t[l];
+    let a, n = !1;
+    for (; !n; )
+      a = O(this.firstBlock.data, 1), n = H(this.firstBlock.data, 1, o, a);
     if (a) {
-      let { bufferPosition: n, bufferByteOffset: f } = B(a), T = new Uint32Array(this.memory.buffers[n].buf, f, 1);
-      x(T, 0, o);
+      let { bufferPosition: l, bufferByteOffset: h } = y(a), $ = new Uint32Array(this.memory.buffers[l].buf, h, 1);
+      U($, 0, o);
     } else
-      x(this.firstBlock.data, 0, o);
-    Atomics.add(this.firstBlock.data, p, 1);
+      U(this.firstBlock.data, 0, o);
+    Atomics.add(this.firstBlock.data, A, 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) {
@@ -735,37 +624,37 @@ class u {
     for (; !r; ) {
       if (t = O(this.firstBlock.data, 0), e = O(this.firstBlock.data, 1), !e)
         return;
-      r = V(this.firstBlock.data, 1, 0, e);
+      r = H(this.firstBlock.data, 1, 0, e);
     }
     if (!t)
       return;
-    V(this.firstBlock.data, 0, 0, t);
-    let s = 0, o = t;
+    H(this.firstBlock.data, 0, 0, t);
+    let i = 0, o = t;
     for (; o; ) {
-      let { bufferPosition: a, bufferByteOffset: l } = B(o), n = this.memory.buffers[a];
-      if (!n)
+      let { bufferPosition: a, bufferByteOffset: n } = y(o), l = this.memory.buffers[a];
+      if (!l)
         break;
-      let f = new Uint32Array(n.buf, l, 2);
-      o = O(f, 0), s++, this.onDelete && this.onDelete(this.getDataBlock(f)), n.free(f.byteOffset);
+      let h = new Uint32Array(l.buf, n, 2);
+      o = O(h, 0), i++, this.onDelete && this.onDelete(this.getDataBlock(h)), l.free(h.byteOffset);
     }
-    Atomics.sub(this.firstBlock.data, p, s);
+    Atomics.sub(this.firstBlock.data, A, i);
   }
   *[Symbol.iterator]() {
-    let t = 0, { bufferPosition: e, bufferByteOffset: r } = c(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 l = this.memory.buffers[e];
-      if (!l)
+      let n = this.memory.buffers[e];
+      if (!n)
         return;
-      let n = new Uint32Array(l.buf, r, 2), f = this.getDataBlock(n), T = e, H = r;
-      ({ bufferPosition: e, bufferByteOffset: r } = c(n, 0));
-      let M = !0;
+      let l = new Uint32Array(n.buf, r, 2), h = this.getDataBlock(l), $ = e, zt = r;
+      ({ bufferPosition: e, bufferByteOffset: r } = c(l, 0));
+      let Q = !0;
       yield {
-        data: f,
+        data: h,
         index: t,
         deleteCurrent: () => {
-          k(s, 0, e, r), r || k(this.firstBlock.data, 1, o, a), this.onDelete && this.onDelete(this.getDataBlock(n)), l.free(n.byteOffset), Atomics.sub(this.firstBlock.data, p, 1), M = !1;
+          k(i, 0, e, r), r || k(this.firstBlock.data, 1, o, a), this.onDelete && this.onDelete(this.getDataBlock(l)), n.free(l.byteOffset), Atomics.sub(this.firstBlock.data, A, 1), Q = !1;
         }
-      }, M && (s = n, o = T, a = H, t++);
+      }, Q && (i = l, o = $, a = zt, t++);
     }
   }
   forEach(t) {
@@ -778,7 +667,7 @@ class u {
     };
   }
   getDataBlock(t) {
-    const e = t.byteOffset + Bt * t.BYTES_PER_ELEMENT;
+    const e = t.byteOffset + ct * t.BYTES_PER_ELEMENT;
     switch (this.type) {
       case 1:
         return new Int32Array(t.buffer, e, this.dataLength);
@@ -793,7 +682,7 @@ class u {
   free() {
     let { bufferPosition: t, bufferByteOffset: e } = c(this.firstBlock.data, 0);
     for (; e; ) {
-      let r = new h(this.memory, {
+      let r = new f(this.memory, {
         bufferPosition: t,
         bufferByteOffset: e
       });
@@ -802,15 +691,15 @@ class u {
     this.firstBlock.free();
   }
 }
-const mt = 10;
-class Ot {
+const ut = 10;
+class wt {
   static ALLOCATE_COUNT = 4;
   memory;
   // Memory order: Pointer, Lock, Length, MaxHash
   pointerMemory;
   lock;
   get hashMemory() {
-    return new h(this.memory, c(this.pointerMemory.data, 0));
+    return new f(this.memory, c(this.pointerMemory.data, 0));
   }
   get length() {
     return Atomics.load(this.pointerMemory.data, 2);
@@ -820,51 +709,51 @@ class Ot {
   }
   constructor(t, e) {
     if (this.memory = t, e)
-      this.pointerMemory = new h(t, e.firstBlock);
+      this.pointerMemory = new f(t, e.firstBlock);
     else {
-      this.pointerMemory = t.allocUI32(Ot.ALLOCATE_COUNT);
-      let r = t.allocUI32(mt);
-      k(this.pointerMemory.data, 0, r.bufferPosition, r.bufferByteOffset), Atomics.store(this.pointerMemory.data, 3, mt);
+      this.pointerMemory = t.allocUI32(wt.ALLOCATE_COUNT);
+      let r = t.allocUI32(ut);
+      k(this.pointerMemory.data, 0, r.bufferPosition, r.bufferByteOffset), Atomics.store(this.pointerMemory.data, 3, ut);
     }
     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 = P(t);
+    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 o = this.hash(r, e), a, l = c(t.data, o);
-    if (l.bufferByteOffset === 0) {
+  setHashKey(t, e, r, i) {
+    let o = this.hash(r, e), a, n = c(t.data, o);
+    if (n.bufferByteOffset === 0) {
       a = new u(this.memory, {
         dataLength: 2
       });
-      let f = a.getSharedMemory();
-      k(t.data, o, f.firstBlock.bufferPosition, f.firstBlock.bufferByteOffset);
+      let h = a.getSharedMemory();
+      k(t.data, o, h.firstBlock.bufferPosition, h.firstBlock.bufferByteOffset);
     } else
       a = new u(this.memory, {
-        firstBlock: l
+        firstBlock: n
       });
-    let n = !0;
-    return a.deleteValue(r) && (n = !1), a.insert([r, s]), n;
+    let l = !0;
+    return a.deleteValue(r) && (l = !1), a.insert([r, i]), l;
   }
   get(t) {
-    let e = P(t), r = this.hash(e, this.maxHash), s = c(this.hashMemory.data, r);
-    if (s.bufferByteOffset === 0)
+    let e = M(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 = P(t), r = this.hash(e, this.maxHash), s = c(this.hashMemory.data, r);
-    if (s.bufferByteOffset === 0)
+    let e = M(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,30 +761,31 @@ class Ot {
     return !1;
   }
   delete(t) {
-    let e = P(t), r = this.hash(e, this.maxHash), s = c(this.hashMemory.data, r);
-    if (s.bufferByteOffset === 0)
+    let e = M(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: l } of o)
+    for (let { data: a, deleteCurrent: n } of o)
       if (a[0] === e)
-        return l(), Atomics.sub(this.pointerMemory.data, 2, 1), !0;
+        return n(), 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;
+    let t = this.maxHash, e = t * 2, r = this.memory.allocUI32(e), i = this.hashMemory;
     for (let o = 0; o < t; o++) {
-      let a = c(s.data, o);
+      let a = c(i.data, o);
       if (a.bufferByteOffset === 0)
         continue;
-      let l = new u(this.memory, {
+      let n = new u(this.memory, {
         firstBlock: a
       });
-      for (let { data: n } of l)
-        this.setHashKey(r, e, n[0], n[1]);
+      for (let { data: l } of n)
+        this.setHashKey(r, e, l[0], l[1]);
+      n.free();
     }
-    k(this.pointerMemory.data, 0, r.bufferPosition, r.bufferByteOffset), Atomics.store(this.pointerMemory.data, 3, e);
+    k(this.pointerMemory.data, 0, r.bufferPosition, r.bufferByteOffset), Atomics.store(this.pointerMemory.data, 3, e), i.free();
   }
   hash(t, e) {
     return t % e;
@@ -917,24 +807,24 @@ class Ot {
     };
   }
 }
-function P(i) {
-  return typeof i == "number" ? i : typeof i == "string" ? ne(i) : i;
+function M(s) {
+  return typeof s == "number" ? s : typeof s == "string" ? vt(s) : s;
 }
-function ne(i) {
-  let t = i.length, e = 17 ^ t, r = 0, s;
+function vt(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 Be {
+class se {
   memory;
   list;
   constructor(t, e) {
@@ -952,9 +842,9 @@ class Be {
   *[Symbol.iterator]() {
     let t = this.list[Symbol.iterator]();
     for (let { data: e } of t) {
-      let { bufferPosition: r, bufferByteOffset: s } = c(e, 0), o = new h(this.memory, {
+      let { bufferPosition: r, bufferByteOffset: i } = c(e, 0), o = new f(this.memory, {
         bufferPosition: r,
-        bufferByteOffset: s
+        bufferByteOffset: i
       });
       yield this.createItem(o);
     }
@@ -977,11 +867,11 @@ class Be {
     this.list.free();
   }
 }
-const bt = {
+const dt = {
   1: Uint8Array,
   2: Uint16Array
-}, U = 0, gt = 1, kt = 2, At = 3;
-class Mt {
+}, N = 0, yt = 1, mt = 2, Bt = 3;
+class Lt {
   static ALLOCATE_COUNT = 4;
   memory;
   allocatedMemory;
@@ -989,11 +879,11 @@ class Mt {
   cachedPointer;
   cachedString;
   constructor(t, e) {
-    this.memory = t, typeof e == "string" ? (this.allocatedMemory = this.memory.allocUI32(Mt.ALLOCATE_COUNT), this.lock = new Int32Array(this.allocatedMemory.data.buffer, this.allocatedMemory.bufferByteOffset + At * 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 + At * 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 f(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);
-    z(this.lock), x(this.allocatedMemory.data, U, e.pointer), Atomics.store(this.allocatedMemory.data, gt, t.length), Atomics.store(this.allocatedMemory.data, kt, e.charType), g(this.lock), this.cachedPointer = e.pointer, this.cachedString = t;
+    x(this.lock), U(this.allocatedMemory.data, N, e.pointer), Atomics.store(this.allocatedMemory.data, yt, t.length), Atomics.store(this.allocatedMemory.data, mt, e.charType), b(this.lock), this.cachedPointer = e.pointer, this.cachedString = t;
   }
   createString(t) {
     if (t === "")
@@ -1002,30 +892,32 @@ class Mt {
         charType: 1
         /* ASCII */
       };
-    let e = [];
-    for (let n = 0; n < t.length; n++)
-      e.push(t.charCodeAt(n));
-    let s = Math.max(...e) > 255 ? 2 : 1, o = bt[s], a = this.memory.allocUI32(Math.ceil(t.length / (4 / o.BYTES_PER_ELEMENT))), l = new o(a.data.buffer, a.data.byteOffset, t.length);
+    let e = 0;
+    for (let n = 0; n < t.length; n++) {
+      let l = t.charCodeAt(n);
+      l > e && (e = l);
+    }
+    let r = e > 255 ? 2 : 1, i = dt[r], o = this.memory.allocUI32(Math.ceil(t.length / (4 / i.BYTES_PER_ELEMENT))), a = new i(o.data.buffer, o.data.byteOffset, t.length);
     for (let n = 0; n < t.length; n++)
-      l[n] = t.charCodeAt(n);
+      a[n] = t.charCodeAt(n);
     return {
-      pointer: a.pointer,
-      charType: s
+      pointer: o.pointer,
+      charType: r
     };
   }
   get value() {
-    let t = O(this.allocatedMemory.data, U);
+    let t = O(this.allocatedMemory.data, N);
     if (this.cachedPointer === t && this.cachedString !== void 0)
       return this.cachedString;
     if (t === 0)
       return "";
-    let { bufferPosition: e, bufferByteOffset: r } = B(t);
-    z(this.lock);
-    let s = Atomics.load(this.allocatedMemory.data, kt), o = bt[s], a = Atomics.load(this.allocatedMemory.data, gt), l = new o(this.memory.buffers[e].buf, r, a), n = String.fromCharCode.apply(null, l);
-    return g(this.lock), this.cachedPointer = t, this.cachedString = n, n;
+    let { bufferPosition: e, bufferByteOffset: r } = y(t);
+    x(this.lock);
+    let i = Atomics.load(this.allocatedMemory.data, mt), o = dt[i], a = Atomics.load(this.allocatedMemory.data, yt), n = new o(this.memory.buffers[e].buf, r, a), l = jt(n);
+    return b(this.lock), this.cachedPointer = t, this.cachedString = l, l;
   }
   set value(t) {
-    let { bufferPosition: e, bufferByteOffset: r } = c(this.allocatedMemory.data, U);
+    let { bufferPosition: e, bufferByteOffset: r } = c(this.allocatedMemory.data, N);
     this.updateString(t), r && this.memory.buffers[e].free(r);
   }
   getSharedMemory() {
@@ -1035,11 +927,19 @@ class Mt {
     return this.allocatedMemory.pointer;
   }
   free() {
-    let { bufferPosition: t, bufferByteOffset: e } = c(this.allocatedMemory.data, U);
+    let { bufferPosition: t, bufferByteOffset: e } = c(this.allocatedMemory.data, N);
     e && this.memory.buffers[t].free(e), this.allocatedMemory.free();
   }
 }
-const E = 0, d = 1, pt = 2, Et = 3, wt = 4;
+function jt(s) {
+  if (s.length <= 8192)
+    return String.fromCharCode.apply(null, s);
+  let e = "";
+  for (let r = 0; r < s.length; r += 8192)
+    e += String.fromCharCode.apply(null, s.subarray(r, r + 8192));
+  return e;
+}
+const p = 0, E = 1, bt = 2, kt = 3, gt = 4;
 class m {
   static ALLOCATE_COUNT = 4;
   memory;
@@ -1047,7 +947,7 @@ class m {
   firstBlock;
   uint16Array;
   get length() {
-    return Atomics.load(this.firstBlock.data, d);
+    return Atomics.load(this.firstBlock.data, E);
   }
   get type() {
     return this.uint16Array[0];
@@ -1062,10 +962,10 @@ class m {
     Atomics.store(this.uint16Array, 1, t);
   }
   get bufferLength() {
-    return Atomics.load(this.firstBlock.data, pt);
+    return Atomics.load(this.firstBlock.data, bt);
   }
   set bufferLength(t) {
-    Atomics.store(this.firstBlock.data, pt, t);
+    Atomics.store(this.firstBlock.data, bt, t);
   }
   get pointer() {
     return this.firstBlock.pointer;
@@ -1074,19 +974,19 @@ class m {
   cachedPointer;
   constructor(t, e) {
     if (this.memory = t, e && "firstBlock" in e) {
-      if (this.firstBlock = new h(t, e.firstBlock), this.uint16Array = new Uint16Array(this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + Et * Uint32Array.BYTES_PER_ELEMENT, 2), "type" in e || "dataLength" in e) {
-        const r = e.bufferLength ?? wt;
-        let s = t.allocUI32(r * (e.dataLength ?? 1));
-        k(this.firstBlock.data, E, s.bufferPosition, s.bufferByteOffset), this.bufferLength = r, this.dataLength = e.dataLength ?? 1;
+      if (this.firstBlock = new f(t, e.firstBlock), this.uint16Array = new Uint16Array(this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + kt * Uint32Array.BYTES_PER_ELEMENT, 2), "type" in e || "dataLength" in e) {
+        const r = e.bufferLength ?? gt;
+        let i = t.allocUI32(r * (e.dataLength ?? 1));
+        k(this.firstBlock.data, p, i.bufferPosition, i.bufferByteOffset), this.bufferLength = r, 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(m.ALLOCATE_COUNT), this.uint16Array = new Uint16Array(this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + Et * Uint32Array.BYTES_PER_ELEMENT, 2);
-      let r = e?.dataLength ?? 1, s = e?.bufferLength ?? wt, o = t.allocUI32(s * r);
-      k(this.firstBlock.data, E, o.bufferPosition, o.bufferByteOffset), this.bufferLength = s;
+      this.firstBlock = t.allocUI32(m.ALLOCATE_COUNT), this.uint16Array = new Uint16Array(this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + kt * Uint32Array.BYTES_PER_ELEMENT, 2);
+      let r = e?.dataLength ?? 1, i = e?.bufferLength ?? gt, o = t.allocUI32(i * r);
+      k(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;
     }
@@ -1111,86 +1011,86 @@ class m {
     const r = typeof t == "number";
     if (!r && t.length > e)
       throw new Error(`Can't insert ${t.length} array into shared list of ${e} dataLength`);
-    let s = this.getFullDataBlock(), o = this.length, a = e * o;
-    return r ? s[a] = t : s.set(t, a), Atomics.add(this.firstBlock.data, d, 1) + 1 >= this.bufferLength && this.growBuffer(), o;
+    let i = this.getFullDataBlock(), o = this.length, a = e * o;
+    return r ? i[a] = t : i.set(t, a), Atomics.add(this.firstBlock.data, E, 1) + 1 >= this.bufferLength && this.growBuffer(), o;
   }
   pop() {
-    let t = Atomics.sub(this.firstBlock.data, d, d), e = this.getFullDataBlock();
+    let t = Atomics.sub(this.firstBlock.data, E, 1), e = this.getFullDataBlock();
     return this.getDataBlock(e, t - 1);
   }
   // Returns the first number irregardless of dataLength - faster way to pop if you don't care about the rest of the data block
   popNumber() {
-    const t = Atomics.sub(this.firstBlock.data, d, d);
+    const t = Atomics.sub(this.firstBlock.data, E, 1);
     return this.getFullDataBlock()[(t - 1) * this.dataLength];
   }
   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, d, d);
+        i[o * r + a] = i[(o + 1) * r + a];
+    Atomics.sub(this.firstBlock.data, E, 1);
   }
   clear() {
-    this.firstBlock.data[d] = 0;
+    this.firstBlock.data[E] = 0;
   }
   *[Symbol.iterator]() {
     let t = this.getFullDataBlock(), e = this.dataLength, r = this.length * e;
-    for (let s = 0; s < r; s += e)
-      yield t.subarray(s, s + e);
+    for (let i = 0; i < r; i += e)
+      yield t.subarray(i, i + e);
   }
   // Significantly faster but won't be thread safe if anything is removing/adding to it during iteration
   getCurrentArray() {
     return this.getFullDataBlock().subarray(0, this.length * this.dataLength);
   }
   getFullDataBlock() {
-    let t = Atomics.load(this.firstBlock.data, E);
+    let t = Atomics.load(this.firstBlock.data, p);
     if (this.cachedPointer === t && this.cachedFullDataBlock)
       return this.cachedFullDataBlock;
-    let e = B(t), r = new h(this.memory, e), s;
+    let e = y(t), r = new f(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 = c(this.firstBlock.data, E), o = new h(this.memory, s), a = this.getFullDataBlock(), l = this.memory.allocUI32(e * r), n;
+    let e = this.bufferLength * 2, r = this.dataLength, i = c(this.firstBlock.data, p), o = new f(this.memory, i), a = this.getFullDataBlock(), n = this.memory.allocUI32(e * r), l;
     switch (this.type) {
       case 1:
-        n = new Int32Array(l.data.buffer, l.bufferByteOffset, r * e);
+        l = new Int32Array(n.data.buffer, n.bufferByteOffset, r * e);
         break;
       case 0:
-        n = new Uint32Array(l.data.buffer, l.bufferByteOffset, r * e);
+        l = new Uint32Array(n.data.buffer, n.bufferByteOffset, r * e);
         break;
       case 2:
-        n = new Float32Array(l.data.buffer, l.bufferByteOffset, r * e);
+        l = new Float32Array(n.data.buffer, n.bufferByteOffset, r * e);
         break;
       default:
         throw new Error(`Unknown data block type ${this.type}`);
     }
-    n.set(a);
-    const f = l.pointer;
-    x(this.firstBlock.data, E, f), this.bufferLength = e, o.free(), this.cachedPointer = f, this.cachedFullDataBlock = n;
+    l.set(a);
+    const h = n.pointer;
+    U(this.firstBlock.data, p, h), this.bufferLength = e, o.free(), this.cachedPointer = h, this.cachedFullDataBlock = l;
   }
   free() {
-    let t = c(this.firstBlock.data, E);
-    new h(this.memory, t).free(), this.firstBlock.free();
+    let t = c(this.firstBlock.data, p);
+    new f(this.memory, t).free(), this.firstBlock.free();
   }
   getSharedMemory() {
     return {
@@ -1198,17 +1098,17 @@ class m {
     };
   }
 }
-class me {
+class oe {
   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));
       }
     };
   }
@@ -1231,11 +1131,11 @@ class me {
   *[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
       });
@@ -1269,8 +1169,8 @@ class me {
     this.list.free(), this.cache.clear();
   }
 }
-const D = 0, Lt = 1, St = 2, q = 3, Tt = q + m.ALLOCATE_COUNT;
-class Ct {
+const P = 0, At = 1, pt = 2, v = 3, Et = v + m.ALLOCATE_COUNT;
+class St {
   static ALLOCATE_COUNT = 3 + m.ALLOCATE_COUNT * 2;
   memory;
   // Current Length, Type/DataLength, MaxChunkLength, Pointer vector, Recycle vector
@@ -1280,13 +1180,13 @@ class Ct {
   recycleVector;
   cachedFullDataBlock = {};
   get length() {
-    return Atomics.load(this.firstBlock.data, D) - this.recycleVector.length;
+    return Atomics.load(this.firstBlock.data, P) - this.recycleVector.length;
   }
   get maxChunkSize() {
-    return this.firstBlock.data[St];
+    return this.firstBlock.data[pt];
   }
   set maxChunkSize(t) {
-    Atomics.store(this.firstBlock.data, St, t);
+    Atomics.store(this.firstBlock.data, pt, t);
   }
   get type() {
     return this.uint16Array[0];
@@ -1311,37 +1211,37 @@ class Ct {
   }
   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 + Lt * Uint32Array.BYTES_PER_ELEMENT, 2), this.pointerVector = new m(t, {
+      this.firstBlock = new f(t, e.firstBlock), this.uint16Array = new Uint16Array(this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + At * Uint32Array.BYTES_PER_ELEMENT, 2), this.pointerVector = new m(t, {
         firstBlock: {
           bufferPosition: this.firstBlock.bufferPosition,
-          bufferByteOffset: this.firstBlock.bufferByteOffset + q * Uint32Array.BYTES_PER_ELEMENT
+          bufferByteOffset: this.firstBlock.bufferByteOffset + v * Uint32Array.BYTES_PER_ELEMENT
         }
       }), this.recycleVector = new m(t, {
         firstBlock: {
           bufferPosition: this.firstBlock.bufferPosition,
-          bufferByteOffset: this.firstBlock.bufferByteOffset + Tt * Uint32Array.BYTES_PER_ELEMENT
+          bufferByteOffset: this.firstBlock.bufferByteOffset + Et * Uint32Array.BYTES_PER_ELEMENT
         }
       });
     else {
-      this.firstBlock = t.allocUI32(Ct.ALLOCATE_COUNT), this.uint16Array = new Uint16Array(this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + Lt * Uint32Array.BYTES_PER_ELEMENT, 2);
-      let r = e?.dataLength ?? 1, s = e?.maxChunkSize ?? 100;
+      this.firstBlock = t.allocUI32(St.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?.maxChunkSize ?? 100;
       this.pointerVector = new m(t, {
         type: Uint32Array,
         firstBlock: {
           bufferPosition: this.firstBlock.bufferPosition,
-          bufferByteOffset: this.firstBlock.bufferByteOffset + q * Uint32Array.BYTES_PER_ELEMENT
+          bufferByteOffset: this.firstBlock.bufferByteOffset + v * Uint32Array.BYTES_PER_ELEMENT
         }
       }), this.recycleVector = new m(t, {
         type: Uint32Array,
         firstBlock: {
           bufferPosition: this.firstBlock.bufferPosition,
-          bufferByteOffset: this.firstBlock.bufferByteOffset + Tt * Uint32Array.BYTES_PER_ELEMENT
+          bufferByteOffset: this.firstBlock.bufferByteOffset + Et * Uint32Array.BYTES_PER_ELEMENT
         },
         bufferLength: e?.recycleBufferLength
       });
       const o = e?.type ?? Uint32Array;
-      o === Uint32Array ? this.type = 0 : o === Int32Array ? this.type = 1 : o === Float32Array ? this.type = 2 : o === Float64Array && (this.type = 3), this.dataLength = r, this.maxChunkSize = s;
-      let a = t.allocUI32(s * r * this.byteMultipler);
+      o === Uint32Array ? this.type = 0 : o === Int32Array ? this.type = 1 : o === Float32Array ? this.type = 2 : o === Float64Array && (this.type = 3), this.dataLength = r, this.maxChunkSize = i;
+      let a = t.allocUI32(i * r * this.byteMultipler);
       this.pointerVector.push(a.pointer);
     }
   }
@@ -1361,25 +1261,25 @@ class Ct {
     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.popNumber() : r = Atomics.add(this.firstBlock.data, D, 1);
-    let s = this.getFullDataBlock(r), o = r % this.maxChunkSize;
-    return s.set(t, e * o), r;
+    this.recycleVector.length ? r = this.recycleVector.popNumber() : r = Atomics.add(this.firstBlock.data, P, 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, this.recycleVector.clear();
+    this.firstBlock.data[P] = 0, this.recycleVector.clear();
   }
   *[Symbol.iterator]() {
     const t = {};
-    for (let s of this.recycleVector)
-      t[s[0]] = !0;
+    for (let i of this.recycleVector)
+      t[i[0]] = !0;
     let e = this.getFullDataBlock(0), r = 0;
-    for (let s = 0; s < Atomics.load(this.firstBlock.data, D); s++)
-      if (!t[s]) {
-        let o = Math.floor(s / this.maxChunkSize);
-        o !== r && (e = this.getFullDataBlock(s), r = o), yield this.getDataBlock(e, s % this.maxChunkSize);
+    for (let i = 0; i < Atomics.load(this.firstBlock.data, P); i++)
+      if (!t[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) {
@@ -1390,19 +1290,19 @@ class Ct {
       let a = this.memory.allocUI32(this.maxChunkSize * this.dataLength * this.byteMultipler);
       this.pointerVector.push(a.pointer);
     }
-    let s = new h(this.memory, B(this.pointerVector.get(e))), o;
+    let i = new f(this.memory, y(this.pointerVector.get(e))), o;
     switch (this.type) {
       case 1:
-        o = new Int32Array(s.data.buffer, s.bufferByteOffset, this.dataLength * this.maxChunkSize);
+        o = new Int32Array(i.data.buffer, i.bufferByteOffset, this.dataLength * this.maxChunkSize);
         break;
       case 0:
-        o = new Uint32Array(s.data.buffer, s.bufferByteOffset, this.dataLength * this.maxChunkSize);
+        o = new Uint32Array(i.data.buffer, i.bufferByteOffset, this.dataLength * this.maxChunkSize);
         break;
       case 2:
-        o = new Float32Array(s.data.buffer, s.bufferByteOffset, this.dataLength * this.maxChunkSize);
+        o = new Float32Array(i.data.buffer, i.bufferByteOffset, this.dataLength * this.maxChunkSize);
         break;
       case 3:
-        o = new Float64Array(s.data.buffer, s.bufferByteOffset, this.dataLength * this.maxChunkSize);
+        o = new Float64Array(i.data.buffer, i.bufferByteOffset, this.dataLength * this.maxChunkSize);
         break;
       default:
         throw new Error(`Unknown data block type ${this.type}`);
@@ -1417,7 +1317,7 @@ class Ct {
     this.recycleVector.free();
     for (let t of this.pointerVector) {
       let e = t[0];
-      new h(this.memory, B(e)).free();
+      new f(this.memory, y(e)).free();
     }
     this.pointerVector.free(), this.firstBlock.free();
   }
@@ -1427,7 +1327,7 @@ class Ct {
     };
   }
 }
-class be {
+class ae {
   memory;
   pointers = [];
   recycledIndexes = [];
@@ -1445,9 +1345,9 @@ class be {
   }
   constructor(t, e) {
     this.memory = t;
-    const r = e?.dataLength ?? 1, s = e?.maxChunkSize ?? 100;
-    this.dataLength = r, this.maxChunkSize = s, this.typeConstructor = e.type, this.typeConstructor === Float64Array && (this.byteMultipler = 2);
-    let o = t.allocUI32(s * r * this.byteMultipler);
+    const r = e?.dataLength ?? 1, i = e?.maxChunkSize ?? 100;
+    this.dataLength = r, this.maxChunkSize = i, this.typeConstructor = e.type, this.typeConstructor === Float64Array && (this.byteMultipler = 2);
+    let o = t.allocUI32(i * r * this.byteMultipler);
     this.pointers.push(o.pointer);
     let a = new this.typeConstructor(o.data.buffer, o.bufferByteOffset, this.dataLength * this.maxChunkSize);
     this.fullDataBlocks[0] = a;
@@ -1468,15 +1368,15 @@ class be {
       throw new Error(`Can't insert ${t.length} array into shared list of ${this.dataLength} dataLength`);
     let r = this.recycledIndexes.pop();
     r === void 0 && (r = this.totalLength++);
-    let s = Math.floor(r / this.maxChunkSize);
-    if (s >= this.pointers.length) {
-      let n = this.memory.allocUI32(this.maxChunkSize * this.dataLength * this.byteMultipler);
-      this.pointers.push(n.pointer);
-      let f = new this.typeConstructor(n.data.buffer, n.bufferByteOffset, this.dataLength * this.maxChunkSize);
-      this.fullDataBlocks[s] = f;
+    let i = Math.floor(r / this.maxChunkSize);
+    if (i >= this.pointers.length) {
+      let l = this.memory.allocUI32(this.maxChunkSize * this.dataLength * this.byteMultipler);
+      this.pointers.push(l.pointer);
+      let h = new this.typeConstructor(l.data.buffer, l.bufferByteOffset, this.dataLength * this.maxChunkSize);
+      this.fullDataBlocks[i] = h;
     }
-    let o = this.fullDataBlocks[s], a = r % this.maxChunkSize, l = this.dataLength * a;
-    return e ? o[l] = t : o.set(t, l), r;
+    let o = this.fullDataBlocks[i], a = r % this.maxChunkSize, n = this.dataLength * a;
+    return e ? o[n] = t : o.set(t, n), r;
   }
   deleteIndex(t) {
     this.recycledIndexes.push(t);
@@ -1486,13 +1386,13 @@ class be {
   }
   *[Symbol.iterator]() {
     const t = {};
-    for (let s of this.recycledIndexes)
-      t[s] = !0;
+    for (let i of this.recycledIndexes)
+      t[i] = !0;
     let e = this.getFullDataBlock(0), r = 0;
-    for (let s = 0; s < this.totalLength; s++)
-      if (!t[s]) {
-        let o = Math.floor(s / this.maxChunkSize);
-        o !== r && (e = this.getFullDataBlock(s), r = o), yield this.getDataBlock(e, s % this.maxChunkSize);
+    for (let i = 0; i < this.totalLength; i++)
+      if (!t[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) {
@@ -1503,7 +1403,7 @@ class be {
       let a = this.memory.allocUI32(this.maxChunkSize * this.dataLength * this.byteMultipler);
       this.pointers.push(a.pointer);
     }
-    let s = new h(this.memory, B(this.pointers[e])), o = new this.typeConstructor(s.data.buffer, s.bufferByteOffset, this.dataLength * this.maxChunkSize);
+    let i = new f(this.memory, y(this.pointers[e])), o = new this.typeConstructor(i.data.buffer, i.bufferByteOffset, this.dataLength * this.maxChunkSize);
     return this.fullDataBlocks[e] = o, o;
   }
   getDataBlock(t, e) {
@@ -1512,163 +1412,167 @@ class be {
   }
   free() {
     for (let t of this.pointers)
-      new h(this.memory, B(t)).free();
+      new f(this.memory, y(t)).free();
     this.pointers = [], this.recycledIndexes = [], this.totalLength = 0, this.fullDataBlocks = {};
   }
 }
-const It = new ArrayBuffer(4), Nt = new Uint32Array(It), R = new Uint16Array(It);
-function ge(i, t) {
-  return le(Atomics.load(i, t));
+const Tt = new ArrayBuffer(4), Ot = new Uint32Array(Tt), F = new Uint16Array(Tt);
+function ne(s, t) {
+  return qt(Atomics.load(s, t));
 }
-function ke(i, t, e, r) {
-  Atomics.store(i, t, fe(e, r));
+function le(s, t, e, r) {
+  Atomics.store(s, t, Jt(e, r));
 }
-function le(i) {
-  return Nt[0] = i, [R[0], R[1]];
+function qt(s) {
+  return Ot[0] = s, [F[0], F[1]];
 }
-function fe(i, t) {
-  return R[0] = i, R[1] = t, Nt[0];
+function Jt(s, t) {
+  return F[0] = s, F[1] = t, Ot[0];
 }
-const Pt = new ArrayBuffer(8), Ut = new BigUint64Array(Pt), b = new Uint16Array(Pt);
-function Ae(i, t) {
-  return Ut[0] = Atomics.load(i, t), [b[0], b[1], b[2], b[3]];
+const _t = new ArrayBuffer(8), Ct = new BigUint64Array(_t), B = new Uint16Array(_t);
+function fe(s, t) {
+  return Ct[0] = Atomics.load(s, t), [B[0], B[1], B[2], B[3]];
 }
-function pe(i, t, e, r, s, o = 0) {
-  b[0] = e, b[1] = r, b[2] = s, b[3] = o, Atomics.store(i, t, Ut[0]);
+function he(s, t, e, r, i, o = 0) {
+  B[0] = e, B[1] = r, B[2] = i, B[3] = o, Atomics.store(s, t, Ct[0]);
 }
-const Dt = new ArrayBuffer(4), xt = new Float32Array(Dt), Ft = new Int32Array(Dt);
-function zt(i, t) {
-  return i instanceof Float32Array && (i = new Int32Array(i.buffer, i.byteOffset, i.length)), Q(Atomics.load(i, t));
+const It = new ArrayBuffer(4), Mt = new Float32Array(It), Nt = new Int32Array(It);
+function Pt(s, t) {
+  return s instanceof Float32Array && (s = new Int32Array(s.buffer, s.byteOffset, s.length)), q(Atomics.load(s, t));
 }
-function Ee(i, t, e) {
-  i instanceof Float32Array && (i = new Int32Array(i.buffer, i.byteOffset, i.length)), Atomics.store(i, t, $(e));
+function ce(s, t, e) {
+  s instanceof Float32Array && (s = new Int32Array(s.buffer, s.byteOffset, s.length)), Atomics.store(s, t, z(e));
 }
-function Q(i) {
-  return Ft[0] = i, xt[0];
+function q(s) {
+  return Nt[0] = s, Mt[0];
 }
-function $(i) {
-  return xt[0] = i, Ft[0];
+function z(s) {
+  return Mt[0] = s, Nt[0];
 }
-function we(i, t, e) {
-  return i instanceof Float32Array && (i = new Int32Array(i.buffer, i.byteOffset, i.length)), Q(Atomics.exchange(i, t, $(e)));
+function ue(s, t, e) {
+  return s instanceof Float32Array && (s = new Int32Array(s.buffer, s.byteOffset, s.length)), q(Atomics.exchange(s, t, z(e)));
 }
-function Rt(i, t, e, r) {
-  return i instanceof Float32Array && (i = new Int32Array(i.buffer, i.byteOffset, i.length)), Q(Atomics.compareExchange(i, t, $(e), $(r)));
+function Ut(s, t, e, r) {
+  return s instanceof Float32Array && (s = new Int32Array(s.buffer, s.byteOffset, s.length)), q(Atomics.compareExchange(s, t, z(e), z(r)));
 }
-function Le(i, t, e, r) {
-  let s, o;
+function de(s, t, e, r) {
+  let i, o;
   do
-    s = Atomics.load(i, t), o = Math.min(s + e, r);
-  while (Atomics.compareExchange(i, t, s, o) !== s);
+    i = Atomics.load(s, t), o = Math.min(i + e, r);
+  while (Atomics.compareExchange(s, t, i, o) !== i);
+  return o;
 }
-function Se(i, t, e, r) {
-  let s, o;
+function ye(s, t, e, r) {
+  let i, o;
   do
-    s = Atomics.load(i, t), o = Math.max(s - e, r);
-  while (Atomics.compareExchange(i, t, s, o) !== s);
+    i = Atomics.load(s, t), o = Math.max(i - e, r);
+  while (Atomics.compareExchange(s, t, i, o) !== i);
+  return o;
 }
-function Te(i, t, e, r) {
-  let s, o;
+function me(s, t, e, r) {
+  let i, o;
   do
-    s = zt(i, t), o = Math.min(s + e, r);
-  while (Rt(i, t, s, o) !== s);
+    i = Pt(s, t), o = Math.min(i + e, r);
+  while (Ut(s, t, i, o) !== i);
+  return o;
 }
-function _e(i, t, e, r) {
-  let s, o;
+function Be(s, t, e, r) {
+  let i, o;
   do
-    s = zt(i, t), o = Math.max(s - e, r);
-  while (Rt(i, t, s, o) !== s);
+    i = Pt(s, t), o = Math.max(i - e, r);
+  while (Ut(s, t, i, o) !== i);
+  return o;
 }
-const $t = new ArrayBuffer(8), Yt = new Float64Array($t), Ht = new BigInt64Array($t);
-function Oe(i, t) {
-  return i instanceof Float64Array && (i = new BigInt64Array(i.buffer, i.byteOffset, i.length)), tt(Atomics.load(i, t));
+const Dt = new ArrayBuffer(8), xt = new Float64Array(Dt), Ft = new BigInt64Array(Dt);
+function be(s, t) {
+  return s instanceof Float64Array && (s = new BigInt64Array(s.buffer, s.byteOffset, s.length)), J(Atomics.load(s, t));
 }
-function Me(i, t, e) {
-  i instanceof Float64Array && (i = new BigInt64Array(i.buffer, i.byteOffset, i.length)), Atomics.store(i, t, Y(e));
+function ke(s, t, e) {
+  s instanceof Float64Array && (s = new BigInt64Array(s.buffer, s.byteOffset, s.length)), Atomics.store(s, t, R(e));
 }
-function tt(i) {
-  return Ht[0] = i, Yt[0];
+function J(s) {
+  return Ft[0] = s, xt[0];
 }
-function Y(i) {
-  return Yt[0] = i, Ht[0];
+function R(s) {
+  return xt[0] = s, Ft[0];
 }
-function Ce(i, t, e) {
-  return i instanceof Float64Array && (i = new BigInt64Array(i.buffer, i.byteOffset, i.length)), tt(Atomics.exchange(i, t, Y(e)));
+function ge(s, t, e) {
+  return s instanceof Float64Array && (s = new BigInt64Array(s.buffer, s.byteOffset, s.length)), J(Atomics.exchange(s, t, R(e)));
 }
-function Ie(i, t, e, r) {
-  return i instanceof Float64Array && (i = new BigInt64Array(i.buffer, i.byteOffset, i.length)), tt(Atomics.compareExchange(i, t, Y(e), Y(r)));
+function Ae(s, t, e, r) {
+  return s instanceof Float64Array && (s = new BigInt64Array(s.buffer, s.byteOffset, s.length)), J(Atomics.compareExchange(s, t, R(e), R(r)));
 }
-const w = 0, J = 1, S = 2;
-function Ne(i, t = 0) {
-  for (; Atomics.compareExchange(i, t, w, J) === S; )
-    Atomics.wait(i, t, S);
-  Atomics.add(i, t + 1, 1);
+const w = 0, j = 1, S = 2;
+function pe(s, t = 0) {
+  for (; Atomics.compareExchange(s, t, w, j) === S; )
+    Atomics.wait(s, t, S);
+  Atomics.add(s, t + 1, 1);
 }
-function Pe(i, t = 0) {
-  let e = Atomics.compareExchange(i, t, w, S);
+function Ee(s, t = 0) {
+  let e = Atomics.compareExchange(s, t, w, S);
   for (; e !== w; )
-    Atomics.wait(i, t, e), e = Atomics.compareExchange(i, t, w, S);
+    Atomics.wait(s, t, e), e = Atomics.compareExchange(s, t, w, S);
 }
-function Ue(i, t = 0) {
-  Atomics.sub(i, t + 1, 1) - 1 <= 0 && (Atomics.compareExchange(i, t, J, w) !== J && console.warn("We are unlocking when it was not read locked!"), Atomics.notify(i, t));
+function we(s, t = 0) {
+  Atomics.sub(s, t + 1, 1) - 1 <= 0 && (Atomics.compareExchange(s, t, j, w) !== j && console.warn("We are unlocking when it was not read locked!"), Atomics.notify(s, t));
 }
-function De(i, t = 0) {
-  Atomics.compareExchange(i, t, S, w) !== S && console.warn("We are unlocking when it was not write locked!"), Atomics.notify(i, t);
+function Le(s, t = 0) {
+  Atomics.compareExchange(s, t, S, w) !== S && console.warn("We are unlocking when it was not write locked!"), Atomics.notify(s, t);
 }
-const xe = 2;
+const Se = 2;
 export {
-  h as AllocatedMemory,
-  he as BYTE_OFFSET_BIT_COUNT,
-  me as CachedItemList,
-  be as LocalPool,
-  et as MAX_BYTE_OFFSET_LENGTH,
-  rt as MAX_POSITION_LENGTH,
-  W as MemoryBuffer,
-  ye as MemoryHeap,
-  ce as POSITION_BIT_COUNT,
-  xe as READ_WRITE_LOCK_ALLOCATE_COUNT,
-  de as SIMPLE_LOCK_ALLOCATE_COUNT,
+  f as AllocatedMemory,
+  Qt as BYTE_OFFSET_BIT_COUNT,
+  oe as CachedItemList,
+  ae as LocalPool,
+  tt as MAX_BYTE_OFFSET_LENGTH,
+  et as MAX_POSITION_LENGTH,
+  G as MemoryBuffer,
+  ie as MemoryHeap,
+  te as POSITION_BIT_COUNT,
+  Se as READ_WRITE_LOCK_ALLOCATE_COUNT,
+  re as SIMPLE_LOCK_ALLOCATE_COUNT,
   u as SharedList,
-  Ot as SharedMap,
-  Be as SharedPointerList,
-  Ct as SharedPool,
-  Mt as SharedString,
+  wt as SharedMap,
+  se as SharedPointerList,
+  St as SharedPool,
+  Lt as SharedString,
   m as SharedVector,
-  Te as addAtomicFloat32,
-  Le as addAtomicInt,
-  Rt as compareExchangeFloat32,
-  Ie as compareExchangeFloat64,
-  fe as convert16To32,
-  le as convert32To16,
-  $ as convertFloat32ToInt32,
-  Y as convertFloat64ToInt64,
-  Q as convertInt32ToFloat32,
-  tt as convertInt64ToFloat64,
+  me as addAtomicFloat32,
+  de as addAtomicInt,
+  Ut as compareExchangeFloat32,
+  Ae as compareExchangeFloat64,
+  Jt as convert16To32,
+  qt as convert32To16,
+  z as convertFloat32ToInt32,
+  R as convertFloat64ToInt64,
+  q as convertInt32ToFloat32,
+  J as convertInt64ToFloat64,
   L as createPointer,
-  we as exchangeFloat32,
-  Ce as exchangeFloat64,
-  B as getPointer,
-  ge as load16From32,
-  Ae as load16From64,
-  zt as loadFloat32,
-  Oe as loadFloat64,
+  ue as exchangeFloat32,
+  ge as exchangeFloat64,
+  y as getPointer,
+  ne as load16From32,
+  fe as load16From64,
+  Pt as loadFloat32,
+  be as loadFloat64,
   c as loadPointer,
   O as loadRawPointer,
-  z as lock,
-  Ne as readLock,
-  Ue as readUnlock,
-  ue as replacePointer,
-  V as replaceRawPointer,
-  ke as store16In32,
-  pe as store16In64,
-  Ee as storeFloat32,
-  Me as storeFloat64,
+  x as lock,
+  pe as readLock,
+  we as readUnlock,
+  ee as replacePointer,
+  H as replaceRawPointer,
+  le as store16In32,
+  he as store16In64,
+  ce as storeFloat32,
+  ke as storeFloat64,
   k as storePointer,
-  x as storeRawPointer,
-  _e as subtractAtomicFloat,
-  Se as subtractAtomicInt,
-  g as unlock,
-  Pe as writeLock,
-  De as writeUnlock
+  U as storeRawPointer,
+  Be as subtractAtomicFloat,
+  ye as subtractAtomicInt,
+  b as unlock,
+  Ee as writeLock,
+  Le as writeUnlock
 };
 //# sourceMappingURL=shared-memory-objects.js.map