@oasys/oecs 0.5.3 → 0.6.0

package/dist/shallow-DfnAm9vG.js

@@ -1,150 +0,0 @@
-import { s as y, b as O, u as j } from "./kernel-DgyrLFjW.js";
-function S(p = Object.is) {
-  const l = /* @__PURE__ */ new Map(), [e, f] = y(0);
-  let i = 0;
-  const a = (s, r) => s !== void 0 && r !== void 0 ? p(s, r) : s === r;
-  return {
-    get(s) {
-      const r = l.get(s);
-      if (r !== void 0) return r[0]();
-      e();
-    },
-    set(s, r) {
-      const o = l.get(s);
-      o !== void 0 ? o[1](r) : (l.set(s, y(r, a)), f(++i));
-    },
-    delete(s) {
-      const r = l.get(s);
-      return r === void 0 ? !1 : (l.delete(s), O(() => {
-        r[1](void 0), f(++i);
-      }), !0);
-    },
-    has(s) {
-      return e(), l.has(s);
-    },
-    size() {
-      return e(), l.size;
-    },
-    keys() {
-      return e(), [...l.keys()];
-    }
-  };
-}
-function M(p, l = {}) {
-  const e = {}, f = {}, i = Object.keys(p), a = new Set(i);
-  for (const r of i) {
-    const [o, m] = y(
-      p[r],
-      l[r]
-    );
-    e[r] = o, f[r] = m;
-  }
-  return [new Proxy({}, {
-    // A field read subscribes; a NON-field key must not throw. `JSON.stringify`
-    // (`toJSON`), `await proxy` (`then`), `String(proxy)` (`Symbol.toPrimitive`)
-    // and `for..of` (`Symbol.iterator`) all probe keys that aren't fields — fall
-    // through to the (empty) target so they see the ordinary undefined/inherited
-    // value instead of calling `undefined()`. `fieldSet` (not `k in reads`) so
-    // inherited `toString`/`constructor` aren't mistaken for fields.
-    get: (r, o) => a.has(o) ? e[o]() : Reflect.get(r, o),
-    has: (r, o) => a.has(o),
-    // Enumerable without subscribing: enumeration calls `ownKeys` +
-    // `getOwnPropertyDescriptor`, never `get`, so `Object.keys(proxy)` returns
-    // the field set and tracks nothing. The descriptor is an ACCESSOR whose `get`
-    // reads the live signal, so `{...proxy}` / `Object.values(proxy)` /
-    // `Object.getOwnPropertyDescriptor(proxy, f).value` see the current value
-    // (a value-less descriptor would normalize to `value: undefined`). Non-field
-    // keys report no own descriptor. The target is the empty (extensible) object,
-    // so these configurable own keys satisfy the Proxy invariants.
-    ownKeys: () => i,
-    getOwnPropertyDescriptor: (r, o) => a.has(o) ? { get: () => e[o](), enumerable: !0, configurable: !0 } : void 0,
-    // Writes go through `set.field(v)` — the proxy is a READ surface, and its
-    // public type says so (`Readonly<T>`, POLISH_AUDIT #8). The trap backs the
-    // type for JS callers / policed casts: without it, a field assignment threw
-    // an opaque "Cannot redefine property" (the accessor descriptor above has no
-    // setter) and a TYPO'D field silently stuck on the hidden target as a
-    // non-reactive value.
-    set: (r, o) => !1
-  }), f];
-}
-const v = Symbol("reactiveArray.absent");
-function x(p = [], l = Object.is) {
-  const e = [], [f, i] = y(0);
-  let a = 0;
-  const s = (t, n) => t !== v && n !== v ? l(t, n) : t === n, r = (t) => y(t, s), o = (t) => j(e[t][0]);
-  for (const t of p) e.push(r(t));
-  function m(t) {
-    O(() => {
-      const n = e.length, h = t.length, g = h < n ? h : n;
-      for (let c = 0; c < g; c++) e[c][1](t[c]);
-      if (h > n) {
-        for (let c = n; c < h; c++) e.push(r(t[c]));
-        i(++a);
-      } else if (h < n) {
-        const c = e.splice(h);
-        for (let d = 0; d < c.length; d++) c[d][1](v);
-        i(++a);
-      }
-    });
-  }
-  return {
-    get(t) {
-      if (t >= 0 && t < e.length) {
-        const n = e[t][0]();
-        if (n !== v) return n;
-      }
-      f();
-    },
-    length() {
-      return f(), e.length;
-    },
-    snapshot() {
-      f();
-      const t = new Array(e.length);
-      for (let n = 0; n < e.length; n++) t[n] = e[n][0]();
-      return t;
-    },
-    set(t, n) {
-      t >= 0 && t < e.length && e[t][1](n);
-    },
-    push(t) {
-      e.push(r(t)), i(++a);
-    },
-    pop() {
-      const t = e.length;
-      if (t === 0) return;
-      const n = o(t - 1), [h] = e.splice(t - 1);
-      return O(() => {
-        h[1](v), i(++a);
-      }), n;
-    },
-    splice(t, n, ...h) {
-      const g = e.length, c = t < 0 ? Math.max(g + t, 0) : Math.min(t, g), d = n === void 0 ? g - c : Math.max(0, Math.min(n, g - c)), w = [];
-      for (let u = 0; u < d; u++) w.push(o(c + u));
-      const b = [];
-      for (let u = 0; u < c; u++) b.push(o(u));
-      for (let u = 0; u < h.length; u++) b.push(h[u]);
-      for (let u = c + d; u < g; u++) b.push(o(u));
-      return m(b), w;
-    },
-    reconcile(t) {
-      m(t);
-    }
-  };
-}
-function A(p, l) {
-  if (Object.is(p, l)) return !0;
-  const e = p, f = l, i = Object.keys(e);
-  if (i.length !== Object.keys(f).length) return !1;
-  for (let a = 0; a < i.length; a++) {
-    const s = i[a];
-    if (!Object.prototype.hasOwnProperty.call(f, s) || !Object.is(e[s], f[s])) return !1;
-  }
-  return !0;
-}
-export {
-  M as a,
-  x as b,
-  S as r,
-  A as s
-};

package/dist/shared-BMXh9hxm.cjs

@@ -1 +0,0 @@
-"use strict";class s extends Error{constructor(t,e,a,n){super(t,n),this.requestedBytes=e,this.capBytes=a,this.name="StoreCapExceededError"}}class l extends Error{constructor(){super("SharedArrayBuffer is not available in this runtime. The chosen world backing is SAB-based and cannot start without it. In browsers this requires cross-origin isolation: serve the page with `Cross-Origin-Opener-Policy: same-origin` and `Cross-Origin-Embedder-Policy: require-corp` (or `credentialless`). Alternatively choose the pure-TS heap profile (`memory: { heap: {} }`), which is backed by a plain ArrayBuffer and needs no SAB / no COOP+COEP. In Bun/Node SAB is available unconditionally — if you see this there, the runtime is older than expected or the global was shadowed."),this.name="SabUnavailableError"}}const h=r=>{if(typeof SharedArrayBuffer>"u")throw new l;return new SharedArrayBuffer(r)},d=64*1024;function f(r,t,e){if(e<=0||!Number.isInteger(e))throw new Error(`${r}: maxBytes must be a positive integer (got ${e})`);let a=null;const n=o=>{if(o>e)throw new s(`${r}: requested ${o} bytes exceeds the by-design maxBytes cap of ${e}. This is a hard ceiling with no grow-beyond-cap fallback (#380); a real workload stays ~16 MiB. Reaching it signals runaway entity/column growth upstream — diagnose that rather than raising the cap blindly.`,o,e);return a===null?(a=t.create(o,e),a):(o>a.byteLength&&t.growTo(a,o),a)};return Object.defineProperty(n,"isInPlace",{value:!0,enumerable:!0}),n}function w(r=256*1024*1024){if(typeof SharedArrayBuffer>"u")throw new l;return f("growable_sab_allocator",{create:(t,e)=>{const a=SharedArrayBuffer;return new a(t,{maxByteLength:e})},growTo:(t,e)=>t.grow(e)},r)}function b(r=256*1024*1024){return f("heap_arraybuffer_allocator",{create:(t,e)=>new ArrayBuffer(e),growTo:()=>{throw new Error("heap_arraybuffer_allocator: the heap buffer is fixed at maxBytes and must never grow — growth relocates columns within the buffer, not the buffer itself")}},r)}function A(r){if(!(r.buffer instanceof SharedArrayBuffer))throw new Error("wasm_memory_allocator: WebAssembly.Memory must be constructed with `shared: true` so its buffer is a SharedArrayBuffer");const t=()=>r.buffer,e=a=>{const n=r.buffer.byteLength;if(a<=n)return t();const o=Math.ceil((a-n)/d),u=i=>new s(`wasm_memory_allocator: memory.grow(${o}) failed (current=${n} bytes, requested=${a} bytes, maximum may be reached)`,a,null,{cause:i});let c;try{c=r.grow(o)}catch(i){throw u(i)}if(c===-1)throw u();return t()};return Object.defineProperty(e,"isInPlace",{value:!0,enumerable:!0}),e}exports.DEFAULT_SAB_ALLOCATOR=h;exports.SabUnavailableError=l;exports.StoreCapExceededError=s;exports.growableSabAllocator=w;exports.heapArraybufferAllocator=b;exports.wasmMemoryAllocator=A;

package/dist/shared-DQKK0i-E.js

@@ -1,109 +0,0 @@
-class u extends Error {
-  constructor(t, e, a, n) {
-    super(t, n), this.requestedBytes = e, this.capBytes = a, this.name = "StoreCapExceededError";
-  }
-}
-class c extends Error {
-  constructor() {
-    super(
-      "SharedArrayBuffer is not available in this runtime. The chosen world backing is SAB-based and cannot start without it. In browsers this requires cross-origin isolation: serve the page with `Cross-Origin-Opener-Policy: same-origin` and `Cross-Origin-Embedder-Policy: require-corp` (or `credentialless`). Alternatively choose the pure-TS heap profile (`memory: { heap: {} }`), which is backed by a plain ArrayBuffer and needs no SAB / no COOP+COEP. In Bun/Node SAB is available unconditionally — if you see this there, the runtime is older than expected or the global was shadowed."
-    ), this.name = "SabUnavailableError";
-  }
-}
-const d = (r) => {
-  if (typeof SharedArrayBuffer > "u") throw new c();
-  return new SharedArrayBuffer(r);
-}, h = 64 * 1024;
-function f(r, t, e) {
-  if (e <= 0 || !Number.isInteger(e))
-    throw new Error(`${r}: maxBytes must be a positive integer (got ${e})`);
-  let a = null;
-  const n = (o) => {
-    if (o > e)
-      throw new u(
-        `${r}: requested ${o} bytes exceeds the by-design maxBytes cap of ${e}. This is a hard ceiling with no grow-beyond-cap fallback (#380); a real workload stays ~16 MiB. Reaching it signals runaway entity/column growth upstream — diagnose that rather than raising the cap blindly.`,
-        o,
-        e
-      );
-    return a === null ? (a = t.create(o, e), a) : (o > a.byteLength && t.growTo(a, o), a);
-  };
-  return Object.defineProperty(n, "isInPlace", { value: !0, enumerable: !0 }), n;
-}
-function w(r = 256 * 1024 * 1024) {
-  if (typeof SharedArrayBuffer > "u") throw new c();
-  return f(
-    "growable_sab_allocator",
-    {
-      create: (t, e) => {
-        const a = SharedArrayBuffer;
-        return new a(t, { maxByteLength: e });
-      },
-      // boundary: SharedArrayBuffer.grow is in the spec but not in all
-      // lib types; widen here so the rest of the layer doesn't need to.
-      growTo: (t, e) => t.grow(e)
-    },
-    r
-  );
-}
-function b(r = 256 * 1024 * 1024) {
-  return f(
-    "heap_arraybuffer_allocator",
-    {
-      // Reserve the whole cap as ONE fixed buffer. `byteLength` (the current
-      // need) is ignored: the buffer never resizes, so it must be born at the
-      // ceiling. Lazy page-faulting keeps RSS proportional to real use.
-      create: (t, e) => new ArrayBuffer(e),
-      // Unreachable: the buffer is created at `maxByteLength`, so
-      // `makeGrowableAllocator`'s `bytes > buffer.byteLength` guard never fires
-      // (a byte count past the cap throws first). A fixed `ArrayBuffer` has no
-      // `.resize()`; assert loudly rather than attempt one, in case the guard
-      // logic ever changes.
-      growTo: () => {
-        throw new Error(
-          "heap_arraybuffer_allocator: the heap buffer is fixed at maxBytes and must never grow — growth relocates columns within the buffer, not the buffer itself"
-        );
-      }
-    },
-    r
-  );
-}
-function g(r) {
-  if (!(r.buffer instanceof SharedArrayBuffer))
-    throw new Error(
-      "wasm_memory_allocator: WebAssembly.Memory must be constructed with `shared: true` so its buffer is a SharedArrayBuffer"
-    );
-  const t = () => r.buffer, e = (a) => {
-    const n = r.buffer.byteLength;
-    if (a <= n)
-      return t();
-    const o = Math.ceil((a - n) / h), s = (i) => (
-      // The JS API doesn't expose the Memory's `maximum`, so the cap is
-      // reported as unknowable (`null`) — the caller declared it at
-      // `new WebAssembly.Memory({ maximum })` time.
-      new u(
-        `wasm_memory_allocator: memory.grow(${o}) failed (current=${n} bytes, requested=${a} bytes, maximum may be reached)`,
-        a,
-        null,
-        { cause: i }
-      )
-    );
-    let l;
-    try {
-      l = r.grow(o);
-    } catch (i) {
-      throw s(i);
-    }
-    if (l === -1)
-      throw s();
-    return t();
-  };
-  return Object.defineProperty(e, "isInPlace", { value: !0, enumerable: !0 }), e;
-}
-export {
-  d as D,
-  u as S,
-  c as a,
-  w as g,
-  b as h,
-  g as w
-};

package/dist/topological_sort-BDvEyb9W.cjs

@@ -1 +0,0 @@
-"use strict";class d{_denseKeys=[];_denseVals=[];_sparse=[];get size(){return this._denseKeys.length}get keys(){return this._denseKeys}has(s){return this._denseKeys[this._sparse[s]]===s}get(s){return this.has(s)?this._denseVals[this._sparse[s]]:void 0}set(s,t){if(this.has(s)){this._denseVals[this._sparse[s]]=t;return}this._sparse[s]=this._denseKeys.length,this._denseKeys.push(s),this._denseVals.push(t)}delete(s){if(!this.has(s))return!1;const t=this._sparse[s],i=this._denseKeys[this._denseKeys.length-1];return this._denseKeys[t]=i,this._denseVals[t]=this._denseVals[this._denseVals.length-1],this._sparse[i]=t,this._denseKeys.pop(),this._denseVals.pop(),!0}clear(){this._denseKeys.length=0,this._denseVals.length=0,this._sparse.length=0}forEach(s){for(let t=0;t<this._denseKeys.length;t++)s(this._denseKeys[t],this._denseVals[t])}[Symbol.iterator](){let s=0;const t=this._denseKeys,i=this._denseVals;return{next(){return s<t.length?{value:[t[s],i[s++]],done:!1}:{value:void 0,done:!0}}}}}class g{_compare;_data=[];constructor(s){this._compare=s}get size(){return this._data.length}peek(){return this._data[0]}push(s){this._data.push(s),this._siftUp(this._data.length-1)}pop(){const s=this._data;if(s.length===0)return;const i=s[0],h=s.pop();return s.length>0&&(s[0]=h,this._siftDown(0)),i}clear(){this._data.length=0}_siftUp(s){const t=this._data,i=this._compare,h=t[s];for(;s>0;){const n=s-1>>1;if(i(h,t[n])>=0)break;t[s]=t[n],s=n}t[s]=h}_siftDown(s){const t=this._data,i=this._compare,h=t.length,n=h>>1,c=t[s];for(;s<n;){let a=(s<<1)+1;const e=a+1;if(e<h&&i(t[e],t[a])<0&&(a=e),i(t[a],c)>=0)break;t[s]=t[a],s=a}t[s]=c}}function u(l,s,t,i){const h=i??(e=>String(e)),n=new Map;for(let e=0;e<l.length;e++)n.set(l[e],0);for(const[,e]of s)for(let r=0;r<e.length;r++){const o=e[r];n.has(o)&&n.set(o,n.get(o)+1)}const c=new g(t);for(let e=0;e<l.length;e++)n.get(l[e])===0&&c.push(l[e]);const a=[];for(;c.size>0;){const e=c.pop();a.push(e);const r=s.get(e);if(r!==void 0)for(let o=0;o<r.length;o++){const _=r[o];if(!n.has(_))continue;const p=n.get(_)-1;n.set(_,p),p===0&&c.push(_)}}if(a.length!==l.length){const e=[];for(const[r,o]of n)o>0&&e.push(h(r));throw new TypeError(`Cycle detected in topological sort. Nodes still pending: ${e.join(", ")}`)}return a}exports.BinaryHeap=g;exports.SparseMap=d;exports.topologicalSort=u;

package/dist/topological_sort-DK6EjpWa.js

@@ -1,135 +0,0 @@
-class g {
-  _denseKeys = [];
-  _denseVals = [];
-  _sparse = [];
-  get size() {
-    return this._denseKeys.length;
-  }
-  get keys() {
-    return this._denseKeys;
-  }
-  has(s) {
-    return this._denseKeys[this._sparse[s]] === s;
-  }
-  get(s) {
-    return this.has(s) ? this._denseVals[this._sparse[s]] : void 0;
-  }
-  set(s, t) {
-    if (this.has(s)) {
-      this._denseVals[this._sparse[s]] = t;
-      return;
-    }
-    this._sparse[s] = this._denseKeys.length, this._denseKeys.push(s), this._denseVals.push(t);
-  }
-  delete(s) {
-    if (!this.has(s)) return !1;
-    const t = this._sparse[s], h = this._denseKeys[this._denseKeys.length - 1];
-    return this._denseKeys[t] = h, this._denseVals[t] = this._denseVals[this._denseVals.length - 1], this._sparse[h] = t, this._denseKeys.pop(), this._denseVals.pop(), !0;
-  }
-  clear() {
-    this._denseKeys.length = 0, this._denseVals.length = 0, this._sparse.length = 0;
-  }
-  forEach(s) {
-    for (let t = 0; t < this._denseKeys.length; t++)
-      s(this._denseKeys[t], this._denseVals[t]);
-  }
-  [Symbol.iterator]() {
-    let s = 0;
-    const t = this._denseKeys, h = this._denseVals;
-    return {
-      next() {
-        return s < t.length ? { value: [t[s], h[s++]], done: !1 } : { value: void 0, done: !0 };
-      }
-    };
-  }
-}
-class d {
-  _compare;
-  _data = [];
-  constructor(s) {
-    this._compare = s;
-  }
-  get size() {
-    return this._data.length;
-  }
-  /** Returns the highest-priority element without removing it, or undefined if empty. */
-  peek() {
-    return this._data[0];
-  }
-  /** Inserts a value and restores heap order by sifting up. O(log n). */
-  push(s) {
-    this._data.push(s), this._siftUp(this._data.length - 1);
-  }
-  /** Removes and returns the highest-priority element, or undefined if empty. O(log n). */
-  pop() {
-    const s = this._data;
-    if (s.length === 0) return;
-    const h = s[0], i = s.pop();
-    return s.length > 0 && (s[0] = i, this._siftDown(0)), h;
-  }
-  /** Removes all elements. O(1). */
-  clear() {
-    this._data.length = 0;
-  }
-  /** Moves a node up toward the root until heap order is restored. */
-  _siftUp(s) {
-    const t = this._data, h = this._compare, i = t[s];
-    for (; s > 0; ) {
-      const n = s - 1 >> 1;
-      if (h(i, t[n]) >= 0) break;
-      t[s] = t[n], s = n;
-    }
-    t[s] = i;
-  }
-  /** Moves a node down away from the root until heap order is restored. */
-  _siftDown(s) {
-    const t = this._data, h = this._compare, i = t.length, n = i >> 1, c = t[s];
-    for (; s < n; ) {
-      let a = (s << 1) + 1;
-      const e = a + 1;
-      if (e < i && h(t[e], t[a]) < 0 && (a = e), h(t[a], c) >= 0) break;
-      t[s] = t[a], s = a;
-    }
-    t[s] = c;
-  }
-}
-function u(l, s, t, h) {
-  const i = h ?? ((e) => String(e)), n = /* @__PURE__ */ new Map();
-  for (let e = 0; e < l.length; e++)
-    n.set(l[e], 0);
-  for (const [, e] of s)
-    for (let r = 0; r < e.length; r++) {
-      const o = e[r];
-      n.has(o) && n.set(o, n.get(o) + 1);
-    }
-  const c = new d(t);
-  for (let e = 0; e < l.length; e++)
-    n.get(l[e]) === 0 && c.push(l[e]);
-  const a = [];
-  for (; c.size > 0; ) {
-    const e = c.pop();
-    a.push(e);
-    const r = s.get(e);
-    if (r !== void 0)
-      for (let o = 0; o < r.length; o++) {
-        const _ = r[o];
-        if (!n.has(_)) continue;
-        const p = n.get(_) - 1;
-        n.set(_, p), p === 0 && c.push(_);
-      }
-  }
-  if (a.length !== l.length) {
-    const e = [];
-    for (const [r, o] of n)
-      o > 0 && e.push(i(r));
-    throw new TypeError(
-      `Cycle detected in topological sort. Nodes still pending: ${e.join(", ")}`
-    );
-  }
-  return a;
-}
-export {
-  d as B,
-  g as S,
-  u as t
-};

package/dist/typed_arrays-BcXcnzB4.js

@@ -1,258 +0,0 @@
-const w = 5, d = 31;
-class c {
-  _words;
-  constructor(t) {
-    this._words = t ?? new Array(4).fill(0);
-  }
-  has(t) {
-    const s = t >>> 5;
-    return s >= this._words.length ? !1 : (this._words[s] & 1 << (t & 31)) !== 0;
-  }
-  set(t) {
-    const s = t >>> 5;
-    s >= this._words.length && this.grow(s + 1), this._words[s] |= 1 << (t & 31);
-  }
-  clear(t) {
-    const s = t >>> 5;
-    s >= this._words.length || (this._words[s] &= ~(1 << (t & 31)));
-  }
-  /** True if no bit is set. */
-  isEmpty() {
-    const t = this._words;
-    for (let s = 0; s < t.length; s++)
-      if (t[s] !== 0) return !1;
-    return !0;
-  }
-  /** True if any bit is set in both this and other (non-empty intersection). */
-  overlaps(t) {
-    const s = this._words, e = t._words, r = s.length < e.length ? s.length : e.length;
-    for (let n = 0; n < r; n++)
-      if ((s[n] & e[n]) !== 0) return !0;
-    return !1;
-  }
-  /** True if this is a superset of other (all bits in other are set in this). */
-  contains(t) {
-    const s = t._words, e = this._words, r = e.length;
-    for (let n = 0; n < s.length; n++) {
-      const o = s[n];
-      if (o !== 0 && (n >= r || (e[n] & o) !== o))
-        return !1;
-    }
-    return !0;
-  }
-  equals(t) {
-    const s = this._words, e = t._words, r = s.length > e.length ? s.length : e.length;
-    for (let n = 0; n < r; n++) {
-      const o = n < s.length ? s[n] : 0, h = n < e.length ? e[n] : 0;
-      if (o !== h) return !1;
-    }
-    return !0;
-  }
-  copy() {
-    return new c(this._words.slice());
-  }
-  /** Mutate `target` so it has the same set bits as `this`. Reuses
-   * `target._words` storage when capacity allows (no allocation) and
-   * grows it only when `this` is wider. Designed for hot-path scratch
-   * BitSets where callers want `.copy()` semantics without the
-   * per-call allocation. Returns `target` for chaining. */
-  copyInto(t) {
-    const s = this._words, e = t._words, r = s.length, n = e.length;
-    if (n >= r) {
-      for (let o = 0; o < r; o++) e[o] = s[o];
-      for (let o = r; o < n; o++) e[o] = 0;
-    } else {
-      let o = n > 0 ? n : 1;
-      for (; o < r; ) o *= 2;
-      const h = new Array(o).fill(0);
-      for (let a = 0; a < r; a++) h[a] = s[a];
-      t._words = h;
-    }
-    return t;
-  }
-  copyWithSet(t) {
-    const s = t >>> 5, e = s + 1, r = this._words.length > e ? this._words.length : e, n = new Array(r).fill(0);
-    for (let o = 0; o < this._words.length; o++) n[o] = this._words[o];
-    return n[s] |= 1 << (t & 31), new c(n);
-  }
-  copyWithClear(t) {
-    const s = this._words.slice(), e = t >>> 5;
-    return e < s.length && (s[e] &= ~(1 << (t & 31))), new c(s);
-  }
-  /** FNV-1a hash. Skips trailing zero words so differently-sized arrays with the same bits hash equally. */
-  hash() {
-    let t = 2166136261;
-    const s = this._words;
-    let e = s.length - 1;
-    for (; e >= 0 && s[e] === 0; ) e--;
-    for (let r = 0; r <= e; r++)
-      t ^= s[r], t = Math.imul(t, 16777619);
-    return t;
-  }
-  /** Iterate all set bits via lowest-set-bit extraction. */
-  forEach(t) {
-    const s = this._words;
-    for (let e = 0; e < s.length; e++) {
-      let r = s[e];
-      if (r === 0) continue;
-      const n = e << 5;
-      for (; r !== 0; ) {
-        const o = r & -r >>> 0, h = 31 - Math.clz32(o);
-        t(n + h), r ^= o;
-      }
-    }
-  }
-  grow(t) {
-    let s = this._words.length;
-    for (; s < t; ) s *= 2;
-    const e = new Array(s).fill(0);
-    for (let r = 0; r < this._words.length; r++) e[r] = this._words[r];
-    this._words = e;
-  }
-}
-const i = 16, u = 2;
-class _ {
-  constructor(t, s = 16) {
-    this._ctor = t, this._buf = new t(s);
-  }
-  _buf;
-  _len = 0;
-  get length() {
-    return this._len;
-  }
-  push(t) {
-    this._len >= this._buf.length && this._grow(), this._buf[this._len++] = t;
-  }
-  pop() {
-    return this._buf[--this._len];
-  }
-  get(t) {
-    return this._buf[t];
-  }
-  setAt(t, s) {
-    this._buf[t] = s;
-  }
-  /**
-   * Move the last element into slot i, decrement length.
-   * Returns the value that was removed from slot i.
-   */
-  swapRemove(t) {
-    const s = this._buf[t];
-    return this._buf[t] = this._buf[--this._len], s;
-  }
-  clear() {
-    this._len = 0;
-  }
-  /** Set the logical length directly (snapshot-mount reconstruction, #789). The
-   * caller guarantees `[0, len)` already holds valid data. Grows the backing if
-   * needed so the length is always representable. */
-  setLength(t) {
-    this.ensureCapacity(t), this._len = t;
-  }
-  /**
-   * Raw backing buffer. Valid data: indices 0..length-1.
-   * This reference is stable until the next push() that triggers a grow —
-   * do not cache across entity additions.
-   */
-  get buf() {
-    return this._buf;
-  }
-  /**
-   * Zero-copy subarray view of valid data (0..length-1).
-   * Shares the backing buffer — invalidated if a subsequent push() grows.
-   */
-  view() {
-    return this._buf.subarray(0, this._len);
-  }
-  [Symbol.iterator]() {
-    let t = 0;
-    const s = this._buf, e = this._len;
-    return {
-      next() {
-        return t < e ? { value: s[t++], done: !1 } : { value: 0, done: !0 };
-      }
-    };
-  }
-  /** Ensure the backing buffer can hold at least `capacity` elements without growing. */
-  ensureCapacity(t) {
-    if (t <= this._buf.length) return;
-    let s = this._buf.length || 1;
-    for (; s < t; ) s *= u;
-    const e = new this._ctor(s);
-    e.set(this._buf.subarray(0, this._len)), this._buf = e;
-  }
-  /**
-   * Append `count` elements from `src` starting at `srcOffset`.
-   * Grows if needed. Equivalent to push() in a loop but uses TypedArray.set().
-   */
-  bulkAppend(t, s, e) {
-    this.ensureCapacity(this._len + e), this._buf.set(t.subarray(s, s + e), this._len), this._len += e;
-  }
-  /** Append `count` zeroes. Grows if needed. */
-  bulkAppendZeroes(t) {
-    this.ensureCapacity(this._len + t), this._buf.fill(0, this._len, this._len + t), this._len += t;
-  }
-  /** Append `count` copies of `value`. Grows if needed. Single-pass
-   * analogue of `bulkAppendZeroes` for a non-zero default. */
-  bulkAppendValue(t, s) {
-    this.ensureCapacity(this._len + s), this._buf.fill(t, this._len, this._len + s), this._len += s;
-  }
-  _grow() {
-    const t = new this._ctor(this._buf.length * u);
-    t.set(this._buf), this._buf = t;
-  }
-}
-class f extends _ {
-  constructor(t = i) {
-    super(Float32Array, t);
-  }
-}
-class I extends _ {
-  constructor(t = i) {
-    super(Float64Array, t);
-  }
-}
-class b extends _ {
-  constructor(t = i) {
-    super(Int8Array, t);
-  }
-}
-class A extends _ {
-  constructor(t = i) {
-    super(Int16Array, t);
-  }
-}
-class g extends _ {
-  constructor(t = i) {
-    super(Int32Array, t);
-  }
-}
-class y extends _ {
-  constructor(t = i) {
-    super(Uint8Array, t);
-  }
-}
-class R extends _ {
-  constructor(t = i) {
-    super(Uint16Array, t);
-  }
-}
-class S extends _ {
-  constructor(t = i) {
-    super(Uint32Array, t);
-  }
-}
-export {
-  c as B,
-  _ as G,
-  f as a,
-  I as b,
-  b as c,
-  A as d,
-  g as e,
-  y as f,
-  R as g,
-  S as h,
-  d as i,
-  w as j
-};

package/dist/typed_arrays-D3NmwtCG.cjs

@@ -1 +0,0 @@
-"use strict";class a{_words;constructor(t){this._words=t??new Array(4).fill(0)}has(t){const r=t>>>5;return r>=this._words.length?!1:(this._words[r]&1<<(t&31))!==0}set(t){const r=t>>>5;r>=this._words.length&&this.grow(r+1),this._words[r]|=1<<(t&31)}clear(t){const r=t>>>5;r>=this._words.length||(this._words[r]&=~(1<<(t&31)))}isEmpty(){const t=this._words;for(let r=0;r<t.length;r++)if(t[r]!==0)return!1;return!0}overlaps(t){const r=this._words,s=t._words,e=r.length<s.length?r.length:s.length;for(let n=0;n<e;n++)if((r[n]&s[n])!==0)return!0;return!1}contains(t){const r=t._words,s=this._words,e=s.length;for(let n=0;n<r.length;n++){const o=r[n];if(o!==0&&(n>=e||(s[n]&o)!==o))return!1}return!0}equals(t){const r=this._words,s=t._words,e=r.length>s.length?r.length:s.length;for(let n=0;n<e;n++){const o=n<r.length?r[n]:0,h=n<s.length?s[n]:0;if(o!==h)return!1}return!0}copy(){return new a(this._words.slice())}copyInto(t){const r=this._words,s=t._words,e=r.length,n=s.length;if(n>=e){for(let o=0;o<e;o++)s[o]=r[o];for(let o=e;o<n;o++)s[o]=0}else{let o=n>0?n:1;for(;o<e;)o*=2;const h=new Array(o).fill(0);for(let c=0;c<e;c++)h[c]=r[c];t._words=h}return t}copyWithSet(t){const r=t>>>5,s=r+1,e=this._words.length>s?this._words.length:s,n=new Array(e).fill(0);for(let o=0;o<this._words.length;o++)n[o]=this._words[o];return n[r]|=1<<(t&31),new a(n)}copyWithClear(t){const r=this._words.slice(),s=t>>>5;return s<r.length&&(r[s]&=~(1<<(t&31))),new a(r)}hash(){let t=2166136261;const r=this._words;let s=r.length-1;for(;s>=0&&r[s]===0;)s--;for(let e=0;e<=s;e++)t^=r[e],t=Math.imul(t,16777619);return t}forEach(t){const r=this._words;for(let s=0;s<r.length;s++){let e=r[s];if(e===0)continue;const n=s<<5;for(;e!==0;){const o=e&-e>>>0,h=31-Math.clz32(o);t(n+h),e^=o}}}grow(t){let r=this._words.length;for(;r<t;)r*=2;const s=new Array(r).fill(0);for(let e=0;e<this._words.length;e++)s[e]=this._words[e];this._words=s}}const i=16,u=2;class l{constructor(t,r=16){this._ctor=t,this._buf=new t(r)}_buf;_len=0;get length(){return this._len}push(t){this._len>=this._buf.length&&this._grow(),this._buf[this._len++]=t}pop(){return this._buf[--this._len]}get(t){return this._buf[t]}setAt(t,r){this._buf[t]=r}swapRemove(t){const r=this._buf[t];return this._buf[t]=this._buf[--this._len],r}clear(){this._len=0}setLength(t){this.ensureCapacity(t),this._len=t}get buf(){return this._buf}view(){return this._buf.subarray(0,this._len)}[Symbol.iterator](){let t=0;const r=this._buf,s=this._len;return{next(){return t<s?{value:r[t++],done:!1}:{value:0,done:!0}}}}ensureCapacity(t){if(t<=this._buf.length)return;let r=this._buf.length||1;for(;r<t;)r*=u;const s=new this._ctor(r);s.set(this._buf.subarray(0,this._len)),this._buf=s}bulkAppend(t,r,s){this.ensureCapacity(this._len+s),this._buf.set(t.subarray(r,r+s),this._len),this._len+=s}bulkAppendZeroes(t){this.ensureCapacity(this._len+t),this._buf.fill(0,this._len,this._len+t),this._len+=t}bulkAppendValue(t,r){this.ensureCapacity(this._len+r),this._buf.fill(t,this._len,this._len+r),this._len+=r}_grow(){const t=new this._ctor(this._buf.length*u);t.set(this._buf),this._buf=t}}class w extends l{constructor(t=i){super(Float32Array,t)}}class d extends l{constructor(t=i){super(Float64Array,t)}}class f extends l{constructor(t=i){super(Int8Array,t)}}class I extends l{constructor(t=i){super(Int16Array,t)}}class A extends l{constructor(t=i){super(Int32Array,t)}}class b extends l{constructor(t=i){super(Uint8Array,t)}}class y extends l{constructor(t=i){super(Uint16Array,t)}}class R extends l{constructor(t=i){super(Uint32Array,t)}}exports.BITS_PER_WORD_MASK=31;exports.BITS_PER_WORD_SHIFT=5;exports.BitSet=a;exports.GrowableFloat32Array=w;exports.GrowableFloat64Array=d;exports.GrowableInt16Array=I;exports.GrowableInt32Array=A;exports.GrowableInt8Array=f;exports.GrowableTypedArray=l;exports.GrowableUint16Array=y;exports.GrowableUint32Array=R;exports.GrowableUint8Array=b;