@daneren2005/shared-memory-objects 0.0.10 → 0.0.12

package/dist/shared-memory-objects.js

@@ -0,0 +1,1356 @@
+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));
+}
+function S(i, t = 0) {
+  return Atomics.load(i, t);
+}
+function m(i, t = 0, e, r) {
+  Atomics.store(i, t, w(e, r));
+}
+function Z(i, t = 0, e) {
+  Atomics.store(i, 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 R(i, t, e, r) {
+  return Atomics.compareExchange(i, t, r, e) === r;
+}
+function L(i) {
+  return {
+    bufferPosition: i & 4095,
+    bufferByteOffset: i >>> 12
+  };
+}
+function w(i, t) {
+  return i + (t << 12);
+}
+class c {
+  memory;
+  bufferPosition;
+  get bufferByteOffset() {
+    return this.data.byteOffset;
+  }
+  get pointer() {
+    return w(this.bufferPosition, this.bufferByteOffset);
+  }
+  buffer;
+  data;
+  constructor(t, e) {
+    this.memory = t, "buffer" in e ? (this.data = e.data, this.buffer = e.buffer, this.bufferPosition = this.memory.buffers.indexOf(e.buffer)) : (this.bufferPosition = e.bufferPosition, this.buffer = t.buffers[e.bufferPosition], this.data = new Uint32Array(this.buffer.buf, e.bufferByteOffset));
+  }
+  getArray(t, e, r) {
+    return new t(this.data.buffer, this.data.byteOffset + e * t.BYTES_PER_ELEMENT, r);
+  }
+  getArrayMemory(t, e) {
+    return {
+      bufferPosition: this.bufferPosition,
+      bufferByteOffset: this.bufferByteOffset + t * this.data.BYTES_PER_ELEMENT
+    };
+  }
+  free() {
+    this.buffer.free(this.data.byteOffset);
+  }
+  getSharedMemory() {
+    return {
+      bufferPosition: this.bufferPosition,
+      bufferByteOffset: this.bufferByteOffset
+    };
+  }
+}
+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);
+}
+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);
+}
+const te = 1, Pt = {
+  5120: "i8",
+  5121: "u8",
+  5122: "i16",
+  5123: "u16",
+  5124: "i32",
+  5125: "u32",
+  5126: "f32"
+}, Nt = {
+  f32: Float32Array,
+  f64: Float64Array
+}, It = {
+  i8: Int8Array,
+  i16: Int16Array,
+  i32: Int32Array
+}, Ut = {
+  u8: Uint8Array,
+  u8c: Uint8ClampedArray,
+  u16: Uint16Array,
+  u32: Uint32Array
+}, Ct = {
+  i64: BigInt64Array,
+  u64: BigUint64Array
+}, Dt = {
+  ...Nt,
+  ...It,
+  ...Ut
+}, Ft = (i) => {
+  const t = Pt[i];
+  return t !== void 0 ? t : i;
+};
+function xt(i, ...t) {
+  const e = Ct[i];
+  return new (e || Dt[Ft(i)])(...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 {
+  buf;
+  start;
+  u8;
+  u32;
+  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) {
+      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)
+        throw new Error(
+          `insufficient address range (0x${this.start.toString(
+            16
+          )} - 0x${s.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;
+    }
+  }
+  stats() {
+    const t = (r) => {
+      let s = 0, o = 0;
+      for (; r; )
+        if (s++, 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 };
+    }, e = t(this._free);
+    return {
+      free: e,
+      used: t(this._used),
+      top: this.top,
+      available: this.end - this.top + e.size,
+      total: this.buf.byteLength
+    };
+  }
+  callocAs(t, e, r = 0) {
+    const s = this.mallocAs(t, e);
+    return s && s.fill(r), s;
+  }
+  mallocAs(t, e) {
+    const r = this.malloc(e * Rt[t]);
+    return r ? xt(t, this.buf, r, e) : void 0;
+  }
+  calloc(t, e = 0) {
+    const r = this.malloc(t);
+    return r && this.u8.fill(e, r, r + t), r;
+  }
+  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;
+    for (; o; ) {
+      const f = this.blockSize(o), n = o + f >= s;
+      if (n || f >= e) {
+        let l = this.mallocTop(
+          o,
+          a,
+          f,
+          e,
+          n
+        );
+        return b(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;
+      let f = _(o);
+      return b(this.lock), f;
+    }
+    return b(this.lock), 0;
+  }
+  mallocTop(t, e, r, s, o) {
+    if (o && t + s > 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);
+    else if (this.doSplit) {
+      const a = r - s;
+      a >= this.minSplit && this.splitBlock(t, s, a);
+    }
+    return _(t);
+  }
+  realloc(t, e) {
+    if (e <= 0)
+      return 0;
+    const r = M(t);
+    let s = 0, o = this._used, a = 0;
+    for (; o; ) {
+      if (o === r) {
+        [s, a] = this.reallocBlock(o, e);
+        break;
+      }
+      o = this.blockNext(o);
+    }
+    return s && s !== r && this.u8.copyWithin(
+      _(s),
+      _(r),
+      a
+    ), _(s);
+  }
+  reallocBlock(t, e) {
+    const r = this.blockSize(t), s = t + r, o = s >= this.top, a = P(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 o && t + a < this.end ? (this.top = t + this.setBlockSize(t, a), [t, s]) : (this.free(t), [M(this.malloc(e)), s]);
+  }
+  reallocArray(t, e) {
+    if (t.buffer !== this.buf)
+      return;
+    const r = this.realloc(
+      t.byteOffset,
+      e * t.BYTES_PER_ELEMENT
+    );
+    return r ? new t.constructor(this.buf, r, e) : void 0;
+  }
+  bytesFor(t) {
+    let e;
+    if (typeof t != "number") {
+      if (t.buffer !== this.buf)
+        return;
+      e = t.byteOffset;
+    } else
+      e = t;
+    e = M(e);
+    let r = this._used;
+    for (; r; ) {
+      if (r === e)
+        return this.blockSize(e) - d;
+      r = this.blockNext(r);
+    }
+  }
+  lengthOf(t) {
+    let e = this.bytesFor(t);
+    if (e)
+      return e / this.u32.BYTES_PER_ELEMENT;
+  }
+  free(t) {
+    let e;
+    if (typeof t != "number") {
+      if (t.buffer !== this.buf)
+        return !1;
+      e = t.byteOffset;
+    } else
+      e = t;
+    D(this.lock), e = M(e);
+    let r = this._used, s = 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 b(this.lock), !1;
+  }
+  freeAll() {
+    this._free = 0, this._used = 0, this.top = this.initialTop();
+  }
+  release() {
+    return delete this.u8, delete this.u32, delete this.state, delete this.buf, !0;
+  }
+  get align() {
+    return this.state[et];
+  }
+  set align(t) {
+    this.state[et] = t;
+  }
+  get end() {
+    return this.state[tt];
+  }
+  set end(t) {
+    this.state[tt] = t;
+  }
+  get top() {
+    return Atomics.load(this.state, Q);
+  }
+  set top(t) {
+    Atomics.store(this.state, Q, t);
+  }
+  get _free() {
+    return Atomics.load(this.state, q);
+  }
+  set _free(t) {
+    Atomics.store(this.state, q, t);
+  }
+  get _used() {
+    return Atomics.load(this.state, J);
+  }
+  set _used(t) {
+    Atomics.store(this.state, J, t);
+  }
+  get doCompact() {
+    return !!(this.state[A] & $);
+  }
+  set doCompact(t) {
+    t ? this.state[A] |= 1 << $ - 1 : this.state[A] &= ~$;
+  }
+  get doSplit() {
+    return !!(this.state[A] & Y);
+  }
+  set doSplit(t) {
+    t ? this.state[A] |= 1 << Y - 1 : this.state[A] &= ~Y;
+  }
+  get minSplit() {
+    return this.state[rt];
+  }
+  set minSplit(t) {
+    if (t <= d)
+      throw new Error(`illegal min split threshold: ${t}, require at least ${d + 1}`);
+    this.state[rt] = t;
+  }
+  blockSize(t) {
+    return Atomics.load(this.u32, (t >> 2) + H);
+  }
+  /**
+   * Sets & returns given block size.
+   *
+   * @param block -
+   * @param size -
+   */
+  setBlockSize(t, e) {
+    return Atomics.store(this.u32, (t >> 2) + H, e), e;
+  }
+  blockNext(t) {
+    return Atomics.load(this.u32, (t >> 2) + z);
+  }
+  /**
+   * Sets block next pointer to `next`. Use zero to indicate list end.
+   *
+   * @param block -
+   */
+  setBlockNext(t, e) {
+    Atomics.store(this.u32, (t >> 2) + z, e);
+  }
+  /**
+   * Initializes block header with given `size` and `next` pointer. Returns `block`.
+   *
+   * @param block -
+   * @param size -
+   * @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;
+  }
+  unlinkBlock(t, e) {
+    this.setBlockNext(t, this.blockNext(e));
+  }
+  splitBlock(t, e, r) {
+    this.insert(
+      this.initBlock(
+        t + this.setBlockSize(t, e),
+        r,
+        0
+      )
+    ), this.doCompact && this.compact();
+  }
+  initialTop(t = this.align) {
+    return P(this.start + it + d, t) - d;
+  }
+  /**
+   * Traverses free list and attempts to recursively merge blocks
+   * occupying consecutive memory regions. Returns true if any blocks
+   * have been merged. Only called if `compact` option is enabled.
+   */
+  compact() {
+    let t = this._free, e = 0, r = 0, s, 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);
+        this.setBlockSize(t, a);
+        const f = this.blockNext(s);
+        let n = this.blockNext(t);
+        for (; n && n !== f; ) {
+          const l = this.blockNext(n);
+          this.setBlockNext(n, 0), n = l;
+        }
+        this.setBlockNext(t, f), 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);
+    }
+    return o;
+  }
+  /**
+   * Inserts given block into list of free blocks, sorted by address.
+   *
+   * @param block -
+   */
+  insert(t) {
+    let e = this._free, r = 0;
+    for (; e && !(t <= e); )
+      r = e, e = this.blockNext(e);
+    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 = {
+  u8: 1,
+  u8c: 1,
+  i8: 1,
+  u16: 2,
+  i16: 2,
+  u32: 4,
+  i32: 4,
+  i64: 8,
+  u64: 8,
+  f32: 4,
+  f64: 8
+}, $t = [
+  "B",
+  "kB",
+  "MB",
+  "GB",
+  "TB",
+  "PB",
+  "EB",
+  "ZB",
+  "YB"
+], Yt = [
+  "B",
+  "KiB",
+  "MiB",
+  "GiB",
+  "TiB",
+  "PiB",
+  "EiB",
+  "ZiB",
+  "YiB"
+], Ht = [
+  "b",
+  "kbit",
+  "Mbit",
+  "Gbit",
+  "Tbit",
+  "Pbit",
+  "Ebit",
+  "Zbit",
+  "Ybit"
+], zt = [
+  "b",
+  "kibit",
+  "Mibit",
+  "Gibit",
+  "Tibit",
+  "Pibit",
+  "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);
+  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);
+  return Number(e) + Number(r) / t;
+}, ot = (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;
+}, Xt = (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 Zt(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 ? zt : Ht : t.binary ? Yt : $t, r = t.space ? t.nonBreakingSpace ? " " : " " : "", s = typeof i == "number" ? i === 0 : i === 0n;
+  if (t.signed && s) {
+    const l = ` 0${r}${e[0]}`;
+    return ot(l, t.fixedWidth);
+  }
+  const o = i < 0, a = o ? "-" : t.signed ? "+" : "";
+  o && (i = -i);
+  const f = Xt(t);
+  let n;
+  if (i < 1) {
+    const l = st(i, 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 T = st(Number(i), t.locale, f), x = e[l];
+    n = a + T + r + x;
+  }
+  return ot(n, t.fixedWidth);
+}
+const Wt = 8192, at = 0, G = 1, N = 2;
+class ee {
+  buffers;
+  onGrowBufferHandlers = [];
+  isClone;
+  memory;
+  get bufferSize() {
+    return this.memory.data[at];
+  }
+  constructor(t) {
+    if (t && "buffers" in t)
+      this.buffers = t.buffers.map((e) => new K({
+        buf: e,
+        skipInitialization: !0
+      })), this.memory = new c(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`);
+      let r = this.createBuffer(e);
+      this.buffers = [
+        r
+      ];
+      const s = r.callocAs("u32", 3);
+      if (s)
+        this.memory = new c(this, {
+          bufferPosition: 0,
+          bufferByteOffset: s.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;
+      for (let o = 1; o < (t?.initialBuffers ?? 1); o++)
+        this.buffers.push(this.createBuffer(e));
+    }
+  }
+  addSharedBuffer(t) {
+    this.buffers[t.bufferPosition] = new K({
+      buf: t.buffer,
+      skipInitialization: !0
+    });
+  }
+  growBuffer() {
+    const t = this.createBuffer();
+    let e = Atomics.add(this.memory.data, G, 1);
+    return this.buffers[e] = t, this.onGrowBufferHandlers.forEach((r) => r({
+      bufferPosition: e,
+      buffer: t.buf
+    })), t;
+  }
+  createBuffer(t) {
+    const e = t ?? this.bufferSize;
+    let r;
+    return "SharedArrayBuffer" in globalThis ? r = new SharedArrayBuffer(e) : r = new ArrayBuffer(e), new K({
+      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
+      // After the internal state is wrong MemoryBuffer will loose track of which blocks are where and how big they are
+      compact: !1,
+      split: !1
+    });
+  }
+  addOnGrowBufferHandlers(t) {
+    this.onGrowBufferHandlers.push(t);
+  }
+  allocUI32(t) {
+    t = Math.ceil(t);
+    for (let s = 0; s < this.buffers.length; s++) {
+      const o = this.buffers[s];
+      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, {
+          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}`);
+    let e = this.growBuffer();
+    const r = e.callocAs("u32", t);
+    if (r)
+      return new c(this, {
+        data: r,
+        buffer: e
+      });
+    throw new Error(`Unable to allocate ${t} numbers even after adding a new buffer`);
+  }
+  getSharedAlloc(t) {
+    if (this.buffers[t.bufferPosition] !== void 0)
+      return new c(this, t);
+  }
+  get currentUsed() {
+    return this.totalAllocated - this.buffers.reduce((t, e) => t + e.stats().available, 0);
+  }
+  get totalAllocated() {
+    return this.buffers[0].buf.byteLength * this.buffers.length;
+  }
+  prettyMemory() {
+    return `${nt(this.currentUsed)} / ${nt(this.totalAllocated)}`;
+  }
+  getSharedMemory() {
+    return {
+      buffers: this.buffers.map((t) => t.buf)
+    };
+  }
+}
+function nt(i) {
+  return Zt(i, {
+    binary: !0,
+    minimumFractionDigits: 1,
+    maximumFractionDigits: 1
+  });
+}
+const ft = 4, lt = 1, g = 2;
+class u {
+  static ALLOCATE_COUNT = ft;
+  memory;
+  /* First block
+  	32 index 0
+  	uint16 0 - next buffer position
+  	uint16 1 - next buffer index
+  	32 index 1
+  	uint16 2 - last buffer position
+  	uint16 3 - last buffer index
+  	32 index 2
+  	uint32 4 - length
+  	32 index 3
+  	uint16 6 - type
+  	uint16 7 - data length (defaults to 1 number per data)
+  */
+  /* Other blocks
+  	32 index 0
+  	uint16 0 - next buffer position
+  	uint16 1 - next buffer index
+  	32 index 1 => data
+  */
+  firstBlock;
+  uint16Array;
+  onDelete;
+  get length() {
+    return Atomics.load(this.firstBlock.data, g);
+  }
+  get type() {
+    return Atomics.load(this.uint16Array, 0);
+  }
+  set type(t) {
+    Atomics.store(this.uint16Array, 0, t);
+  }
+  get dataLength() {
+    return Math.max(1, Atomics.load(this.uint16Array, 1));
+  }
+  set dataLength(t) {
+    Atomics.store(this.uint16Array, 1, t);
+  }
+  constructor(t, e) {
+    if (this.memory = t, e && "firstBlock" in e)
+      this.firstBlock = new c(t, e.firstBlock), this.uint16Array = new Uint16Array(this.firstBlock.data.buffer, this.firstBlock.bufferByteOffset + (g + 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);
+      const r = e?.type ?? Uint32Array;
+      r === Uint32Array ? this.type = 0 : r === Int32Array ? this.type = 1 : r === Float32Array && (this.type = 2), this.dataLength = e?.dataLength ?? 1;
+    }
+  }
+  insert(t) {
+    typeof t == "number" && (t = [t]);
+    let e = this.dataLength;
+    if (t.length > e)
+      throw new Error(`Can't insert ${t.length} array into shared list of ${e} dataLength`);
+    let r = this.memory.allocUI32(lt + 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, f = !1;
+    for (; !f; )
+      a = S(this.firstBlock.data, 1), f = R(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);
+    } else
+      Z(this.firstBlock.data, 0, o);
+    Atomics.add(this.firstBlock.data, g, 1);
+  }
+  deleteMatch(t) {
+    for (let { data: e, index: r, deleteCurrent: s } of this)
+      if (t(e, r))
+        return s(), !0;
+    return !1;
+  }
+  deleteIndex(t) {
+    return t >= this.length || t < 0 ? !1 : this.deleteMatch((e, r) => r === t);
+  }
+  deleteValue(t) {
+    return typeof t == "number" ? this.deleteMatch((e) => e[0] === t) : this.deleteMatch((e) => {
+      if (e.length !== t.length)
+        return !1;
+      for (let r = 0; r < e.length; r++)
+        if (e[r] !== t[r])
+          return !1;
+      return !0;
+    });
+  }
+  clear() {
+    let t, e, r = !1;
+    for (; !r; ) {
+      if (t = S(this.firstBlock.data, 0), e = S(this.firstBlock.data, 1), !e)
+        return;
+      r = R(this.firstBlock.data, 1, 0, e);
+    }
+    if (!t)
+      return;
+    R(this.firstBlock.data, 0, 0, t);
+    let s = 0, o = t;
+    for (; o; ) {
+      let { bufferPosition: a, bufferByteOffset: f } = L(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);
+    }
+    Atomics.sub(this.firstBlock.data, g, s);
+  }
+  *[Symbol.iterator]() {
+    let t = 0, { bufferPosition: e, bufferByteOffset: r } = h(this.firstBlock.data, 0), s = 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;
+      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;
+        }
+      }, O && (s = n, o = T, a = x, t++);
+    }
+  }
+  forEach(t) {
+    for (let e of this)
+      t(e.data);
+  }
+  getSharedMemory() {
+    return {
+      firstBlock: this.firstBlock.getSharedMemory()
+    };
+  }
+  getDataBlock(t) {
+    const e = t.byteOffset + lt * t.BYTES_PER_ELEMENT;
+    switch (this.type) {
+      case 1:
+        return new Int32Array(t.buffer, e, this.dataLength);
+      case 0:
+        return new Uint32Array(t.buffer, e, this.dataLength);
+      case 2:
+        return new Float32Array(t.buffer, e, this.dataLength);
+      default:
+        throw new Error(`Unknown data block type ${this.type}`);
+    }
+  }
+  free() {
+    let { bufferPosition: t, bufferByteOffset: e } = h(this.firstBlock.data, 0);
+    for (; e; ) {
+      let r = new c(this.memory, {
+        bufferPosition: t,
+        bufferByteOffset: e
+      });
+      ({ bufferPosition: t, bufferByteOffset: e } = h(r.data, 0)), this.onDelete && this.onDelete(this.getDataBlock(r.data)), r.free();
+    }
+    this.firstBlock.free();
+  }
+}
+const ht = 10;
+class At {
+  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));
+  }
+  get length() {
+    return Atomics.load(this.pointerMemory.data, 2);
+  }
+  get maxHash() {
+    return Atomics.load(this.pointerMemory.data, 3);
+  }
+  constructor(t, e) {
+    if (this.memory = t, e)
+      this.pointerMemory = new c(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.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);
+    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);
+    if (f.bufferByteOffset === 0) {
+      a = new u(this.memory, {
+        dataLength: 2
+      });
+      let l = a.getSharedMemory();
+      m(t.data, o, l.firstBlock.bufferPosition, l.firstBlock.bufferByteOffset);
+    } else
+      a = new u(this.memory, {
+        firstBlock: f
+      });
+    let n = !0;
+    return a.deleteValue(r) && (n = !1), a.insert([r, s]), n;
+  }
+  get(t) {
+    let e = I(t), r = this.hash(e, this.maxHash), s = h(this.hashMemory.data, r);
+    if (s.bufferByteOffset === 0)
+      return;
+    let o = new u(this.memory, {
+      firstBlock: s
+    });
+    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)
+      return !1;
+    let o = new u(this.memory, {
+      firstBlock: s
+    });
+    for (let { data: a } of o)
+      if (a[0] === e)
+        return !0;
+    return !1;
+  }
+  delete(t) {
+    let e = I(t), r = this.hash(e, this.maxHash), s = h(this.hashMemory.data, r);
+    if (s.bufferByteOffset === 0)
+      return !1;
+    let o = new u(this.memory, {
+      firstBlock: s
+    });
+    for (let { data: a, deleteCurrent: f } of o)
+      if (a[0] === e)
+        return f(), Atomics.sub(this.pointerMemory.data, 2, 1), !0;
+    return !1;
+  }
+  growHashTable() {
+    let t = this.maxHash, e = t * 2, r = this.memory.allocUI32(e), s = this.hashMemory;
+    for (let o = 0; o < t; o++) {
+      let a = h(s.data, o);
+      if (a.bufferByteOffset === 0)
+        continue;
+      let f = new u(this.memory, {
+        firstBlock: a
+      });
+      for (let { data: n } of f)
+        this.setHashKey(r, e, n[0], n[1]);
+    }
+    m(this.pointerMemory.data, 0, r.bufferPosition, r.bufferByteOffset), Atomics.store(this.pointerMemory.data, 3, e);
+  }
+  hash(t, e) {
+    return t % e;
+  }
+  free() {
+    for (let t = 0; t < this.maxHash; t++) {
+      let e = h(this.hashMemory.data, t);
+      if (e.bufferByteOffset === 0)
+        continue;
+      new u(this.memory, {
+        firstBlock: e
+      }).free();
+    }
+    this.hashMemory.free(), this.pointerMemory.free();
+  }
+  getSharedMemory() {
+    return {
+      firstBlock: this.pointerMemory.getSharedMemory()
+    };
+  }
+}
+function I(i) {
+  return typeof i == "number" ? i : typeof i == "string" ? vt(i) : i;
+}
+function vt(i) {
+  let t = i.length, e = 17 ^ t, r = 0, s;
+  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;
+  switch (t) {
+    case 3:
+      e ^= (i.charCodeAt(r + 2) & 255) << 16;
+    case 2:
+      e ^= (i.charCodeAt(r + 1) & 255) << 8;
+    case 1:
+      e ^= i.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 {
+  memory;
+  list;
+  constructor(t, e) {
+    this.memory = t, e ? this.list = new u(t, e) : this.list = new u(t);
+  }
+  get length() {
+    return this.list.length;
+  }
+  insert(t) {
+    this.list.insert(w(t.memory.bufferPosition, t.memory.bufferByteOffset));
+  }
+  delete(t) {
+    return this.list.deleteValue(w(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, {
+        bufferPosition: r,
+        bufferByteOffset: s
+      });
+      yield this.createItem(o);
+    }
+  }
+  forEach(t) {
+    for (let e of this)
+      t(e);
+  }
+  find(t) {
+    for (let e of this)
+      if (t(e))
+        return e;
+  }
+  getSharedMemory() {
+    return this.list.getSharedMemory();
+  }
+  free() {
+    for (let t of this)
+      "free" in t && typeof t.free == "function" ? t.free() : t.memory.free();
+    this.list.free();
+  }
+}
+const ct = {
+  1: Uint8Array,
+  2: Uint16Array
+}, U = 0, ut = 1, dt = 2, yt = 3;
+class gt {
+  static ALLOCATE_COUNT = 4;
+  memory;
+  allocatedMemory;
+  lock;
+  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));
+  }
+  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;
+  }
+  createString(t) {
+    if (t === "")
+      return {
+        pointer: 0,
+        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 = 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);
+    for (let n = 0; n < t.length; n++)
+      f[n] = t.charCodeAt(n);
+    return {
+      pointer: a.pointer,
+      charType: s
+    };
+  }
+  get value() {
+    let t = S(this.allocatedMemory.data, U);
+    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;
+  }
+  set value(t) {
+    let { bufferPosition: e, bufferByteOffset: r } = h(this.allocatedMemory.data, U);
+    this.updateString(t), r && this.memory.buffers[e].free(r);
+  }
+  getSharedMemory() {
+    return this.allocatedMemory.getSharedMemory();
+  }
+  get pointer() {
+    return this.allocatedMemory.pointer;
+  }
+  free() {
+    let { bufferPosition: t, bufferByteOffset: e } = h(this.allocatedMemory.data, U);
+    e && this.memory.buffers[t].free(e), this.allocatedMemory.free();
+  }
+}
+const k = 0, B = 1, mt = 2, Bt = 3, X = 4;
+class kt {
+  static ALLOCATE_COUNT = 4;
+  memory;
+  // Pointer, List Length, Buffer Length, Type/DataLength
+  firstBlock;
+  uint16Array;
+  get length() {
+    return Atomics.load(this.firstBlock.data, B);
+  }
+  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 Atomics.load(this.firstBlock.data, mt);
+  }
+  set bufferLength(t) {
+    Atomics.store(this.firstBlock.data, mt, t);
+  }
+  get pointer() {
+    return this.firstBlock.pointer;
+  }
+  cachedFullDataBlock;
+  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 ("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;
+      const a = e?.type ?? Uint32Array;
+      a === Uint32Array ? this.type = 0 : a === Int32Array ? this.type = 1 : a === Float32Array && (this.type = 2), this.dataLength = r;
+    }
+    this.cachedPointer = this.firstBlock.data[0], this.cachedFullDataBlock = this.getFullDataBlock();
+  }
+  at(t) {
+    let e = this.length;
+    if (t >= e || t < 0)
+      throw new Error(`${t} is out of bounds ${e}`);
+    let r = this.getFullDataBlock();
+    return this.getDataBlock(r, t);
+  }
+  get(t, e = 0) {
+    if (e >= this.dataLength)
+      throw new Error(`${e} is out of dataLength bounds ${this.dataLength}`);
+    if (t >= this.length || t < 0)
+      throw new Error(`${t} is out of bounds ${this.length}`);
+    return this.getFullDataBlock()[t * this.dataLength + 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.getFullDataBlock(), s = this.length;
+    return r.set(t, e * s), Atomics.add(this.firstBlock.data, B, 1) + 1 >= this.bufferLength && this.growBuffer(), s;
+  }
+  pop() {
+    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();
+    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);
+  }
+  clear() {
+    this.firstBlock.data[B] = 0;
+  }
+  *[Symbol.iterator]() {
+    let t = this.getFullDataBlock();
+    for (let e = 0; e < this.length; e++)
+      yield this.getDataBlock(t, e);
+  }
+  getFullDataBlock() {
+    let t = Atomics.load(this.firstBlock.data, k);
+    if (this.cachedPointer === t && this.cachedFullDataBlock)
+      return this.cachedFullDataBlock;
+    let e = L(t), r = new c(this.memory, e), s;
+    switch (this.type) {
+      case 1:
+        s = 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);
+        break;
+      case 2:
+        s = 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;
+  }
+  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;
+    switch (this.type) {
+      case 1:
+        n = new Int32Array(f.data.buffer, f.bufferByteOffset, r * this.bufferLength);
+        break;
+      case 0:
+        n = new Uint32Array(f.data.buffer, f.bufferByteOffset, r * this.bufferLength);
+        break;
+      case 2:
+        n = new Float32Array(f.data.buffer, f.bufferByteOffset, r * this.bufferLength);
+        break;
+      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();
+  }
+  free() {
+    let t = h(this.firstBlock.data, k);
+    new c(this.memory, t).free(), this.firstBlock.free();
+  }
+  getSharedMemory() {
+    return {
+      firstBlock: this.firstBlock.getSharedMemory()
+    };
+  }
+}
+class ie {
+  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));
+      }
+    };
+  }
+  get length() {
+    return this.list.length;
+  }
+  clear() {
+    this.list.clear(), this.cache.clear();
+  }
+  insert(t) {
+    this.list.insert(t.pointer), this.cache.set(t.pointer, t);
+  }
+  delete(t) {
+    return this.cache.delete(t.pointer), this.list.deleteValue(t.pointer);
+  }
+  getByPointer(t) {
+    let e = this.cache.get(t);
+    return e || (e = this.initItem(t), e && this.cache.set(t, e)), e;
+  }
+  *[Symbol.iterator]() {
+    let t = this.list[Symbol.iterator]();
+    for (let { data: e, deleteCurrent: r } of t) {
+      let s = Atomics.load(e, 0);
+      if (!s)
+        continue;
+      let o = this.cache.get(s);
+      o || (o = this.initItem(s), o && this.cache.set(s, o)), o && (yield {
+        item: o,
+        deleteCurrent: r
+      });
+    }
+  }
+  forEach(t, e) {
+    for (let { item: r } of this)
+      (!e || e(r)) && t(r);
+  }
+  find(t) {
+    for (let { item: e } of this)
+      if (t(e))
+        return e;
+  }
+  filter(t) {
+    let e = [];
+    for (let { item: r } of this)
+      t(r) && e.push(r);
+    return e;
+  }
+  map(t) {
+    const e = [];
+    for (let { item: r } of this)
+      e.push(t(r));
+    return e;
+  }
+  getSharedMemory() {
+    return this.list.getSharedMemory();
+  }
+  free() {
+    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));
+}
+function oe(i, t, e, r) {
+  Atomics.store(i, t, jt(e, r));
+}
+function Vt(i) {
+  return wt[0] = i, [F[0], F[1]];
+}
+function jt(i, t) {
+  return F[0] = i, F[1] = t, wt[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]];
+}
+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]);
+}
+const _t = new ArrayBuffer(4), St = new Float32Array(_t), Lt = new Int32Array(_t);
+function fe(i, t) {
+  return Ot(Atomics.load(i, t));
+}
+function le(i, t, e) {
+  Atomics.store(i, t, Mt(e));
+}
+function Ot(i) {
+  return Lt[0] = i, St[0];
+}
+function Mt(i) {
+  return St[0] = i, Lt[0];
+}
+function he(i, t, e) {
+  return Ot(Atomics.exchange(i, t, Mt(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);
+}
+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 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 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);
+}
+const me = 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,
+  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,
+  m as storePointer,
+  Z as storeRawPointer,
+  b as unlock,
+  ue as writeLock,
+  ye as writeUnlock
+};
+//# sourceMappingURL=shared-memory-objects.js.map