@oasys/oecs 0.4.0 → 0.5.0

package/dist/topological_sort-DlRpSrxu.js

@@ -1,391 +0,0 @@
-const y = 5, b = 31;
-class f {
-  _words;
-  constructor(s) {
-    this._words = s ?? new Array(4).fill(0);
-  }
-  has(s) {
-    const t = s >>> 5;
-    return t >= this._words.length ? !1 : (this._words[t] & 1 << (s & 31)) !== 0;
-  }
-  set(s) {
-    const t = s >>> 5;
-    t >= this._words.length && this.grow(t + 1), this._words[t] |= 1 << (s & 31);
-  }
-  clear(s) {
-    const t = s >>> 5;
-    t >= this._words.length || (this._words[t] &= ~(1 << (s & 31)));
-  }
-  /** True if no bit is set. */
-  isEmpty() {
-    const s = this._words;
-    for (let t = 0; t < s.length; t++)
-      if (s[t] !== 0) return !1;
-    return !0;
-  }
-  /** True if any bit is set in both this and other (non-empty intersection). */
-  overlaps(s) {
-    const t = this._words, e = s._words, r = t.length < e.length ? t.length : e.length;
-    for (let n = 0; n < r; n++)
-      if ((t[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(s) {
-    const t = s._words, e = this._words, r = e.length;
-    for (let n = 0; n < t.length; n++) {
-      const o = t[n];
-      if (o !== 0 && (n >= r || (e[n] & o) !== o))
-        return !1;
-    }
-    return !0;
-  }
-  equals(s) {
-    const t = this._words, e = s._words, r = t.length > e.length ? t.length : e.length;
-    for (let n = 0; n < r; n++) {
-      const o = n < t.length ? t[n] : 0, l = n < e.length ? e[n] : 0;
-      if (o !== l) return !1;
-    }
-    return !0;
-  }
-  copy() {
-    return new f(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(s) {
-    const t = this._words, e = s._words, r = t.length, n = e.length;
-    if (n >= r) {
-      for (let o = 0; o < r; o++) e[o] = t[o];
-      for (let o = r; o < n; o++) e[o] = 0;
-    } else {
-      let o = n > 0 ? n : 1;
-      for (; o < r; ) o *= 2;
-      const l = new Array(o).fill(0);
-      for (let i = 0; i < r; i++) l[i] = t[i];
-      s._words = l;
-    }
-    return s;
-  }
-  copyWithSet(s) {
-    const t = s >>> 5, e = t + 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[t] |= 1 << (s & 31), new f(n);
-  }
-  copyWithClear(s) {
-    const t = this._words.slice(), e = s >>> 5;
-    return e < t.length && (t[e] &= ~(1 << (s & 31))), new f(t);
-  }
-  /** FNV-1a hash. Skips trailing zero words so differently-sized arrays with the same bits hash equally. */
-  hash() {
-    let s = 2166136261;
-    const t = this._words;
-    let e = t.length - 1;
-    for (; e >= 0 && t[e] === 0; ) e--;
-    for (let r = 0; r <= e; r++)
-      s ^= t[r], s = Math.imul(s, 16777619);
-    return s;
-  }
-  /** Iterate all set bits via lowest-set-bit extraction. */
-  forEach(s) {
-    const t = this._words;
-    for (let e = 0; e < t.length; e++) {
-      let r = t[e];
-      if (r === 0) continue;
-      const n = e << 5;
-      for (; r !== 0; ) {
-        const o = r & -r >>> 0, l = 31 - Math.clz32(o);
-        s(n + l), r ^= o;
-      }
-    }
-  }
-  grow(s) {
-    let t = this._words.length;
-    for (; t < s; ) t *= 2;
-    const e = new Array(t).fill(0);
-    for (let r = 0; r < this._words.length; r++) e[r] = this._words[r];
-    this._words = e;
-  }
-}
-class I {
-  _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], e = this._denseKeys[this._denseKeys.length - 1];
-    return this._denseKeys[t] = e, this._denseVals[t] = this._denseVals[this._denseVals.length - 1], this._sparse[e] = 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, e = this._denseVals;
-    return {
-      next() {
-        return s < t.length ? { value: [t[s], e[s++]], done: !1 } : { value: void 0, done: !0 };
-      }
-    };
-  }
-}
-const c = 16, p = 2;
-class u {
-  constructor(s, t = 16) {
-    this._ctor = s, this._buf = new s(t);
-  }
-  _buf;
-  _len = 0;
-  get length() {
-    return this._len;
-  }
-  push(s) {
-    this._len >= this._buf.length && this._grow(), this._buf[this._len++] = s;
-  }
-  pop() {
-    return this._buf[--this._len];
-  }
-  get(s) {
-    return this._buf[s];
-  }
-  setAt(s, t) {
-    this._buf[s] = t;
-  }
-  /**
-   * Move the last element into slot i, decrement length.
-   * Returns the value that was removed from slot i.
-   */
-  swapRemove(s) {
-    const t = this._buf[s];
-    return this._buf[s] = this._buf[--this._len], t;
-  }
-  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(s) {
-    this.ensureCapacity(s), this._len = s;
-  }
-  /**
-   * 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 s = 0;
-    const t = this._buf, e = this._len;
-    return {
-      next() {
-        return s < e ? { value: t[s++], done: !1 } : { value: 0, done: !0 };
-      }
-    };
-  }
-  /** Ensure the backing buffer can hold at least `capacity` elements without growing. */
-  ensureCapacity(s) {
-    if (s <= this._buf.length) return;
-    let t = this._buf.length || 1;
-    for (; t < s; ) t *= p;
-    const e = new this._ctor(t);
-    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(s, t, e) {
-    this.ensureCapacity(this._len + e), this._buf.set(s.subarray(t, t + e), this._len), this._len += e;
-  }
-  /** Append `count` zeroes. Grows if needed. */
-  bulkAppendZeroes(s) {
-    this.ensureCapacity(this._len + s), this._buf.fill(0, this._len, this._len + s), this._len += s;
-  }
-  /** Append `count` copies of `value`. Grows if needed. Single-pass
-   * analogue of `bulkAppendZeroes` for a non-zero default. */
-  bulkAppendValue(s, t) {
-    this.ensureCapacity(this._len + t), this._buf.fill(s, this._len, this._len + t), this._len += t;
-  }
-  _grow() {
-    const s = new this._ctor(this._buf.length * p);
-    s.set(this._buf), this._buf = s;
-  }
-}
-class A extends u {
-  constructor(s = c) {
-    super(Float32Array, s);
-  }
-}
-class S extends u {
-  constructor(s = c) {
-    super(Float64Array, s);
-  }
-}
-class R extends u {
-  constructor(s = c) {
-    super(Int8Array, s);
-  }
-}
-class T extends u {
-  constructor(s = c) {
-    super(Int16Array, s);
-  }
-}
-class E extends u {
-  constructor(s = c) {
-    super(Int32Array, s);
-  }
-}
-class K extends u {
-  constructor(s = c) {
-    super(Uint8Array, s);
-  }
-}
-class F extends u {
-  constructor(s = c) {
-    super(Uint16Array, s);
-  }
-}
-class O extends u {
-  constructor(s = c) {
-    super(Uint32Array, s);
-  }
-}
-class g {
-  _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 e = s[0], r = s.pop();
-    return s.length > 0 && (s[0] = r, this._siftDown(0)), e;
-  }
-  /** 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, e = this._compare, r = t[s];
-    for (; s > 0; ) {
-      const n = s - 1 >> 1;
-      if (e(r, t[n]) >= 0) break;
-      t[s] = t[n], s = n;
-    }
-    t[s] = r;
-  }
-  /** Moves a node down away from the root until heap order is restored. */
-  _siftDown(s) {
-    const t = this._data, e = this._compare, r = t.length, n = r >> 1, o = t[s];
-    for (; s < n; ) {
-      let l = (s << 1) + 1;
-      const i = l + 1;
-      if (i < r && e(t[i], t[l]) < 0 && (l = i), e(t[l], o) >= 0) break;
-      t[s] = t[l], s = l;
-    }
-    t[s] = o;
-  }
-}
-function W(h, s, t, e) {
-  const r = e ?? ((i) => String(i)), n = /* @__PURE__ */ new Map();
-  for (let i = 0; i < h.length; i++)
-    n.set(h[i], 0);
-  for (const [, i] of s)
-    for (let a = 0; a < i.length; a++) {
-      const _ = i[a];
-      n.has(_) && n.set(_, n.get(_) + 1);
-    }
-  const o = new g(t);
-  for (let i = 0; i < h.length; i++)
-    n.get(h[i]) === 0 && o.push(h[i]);
-  const l = [];
-  for (; o.size > 0; ) {
-    const i = o.pop();
-    l.push(i);
-    const a = s.get(i);
-    if (a !== void 0)
-      for (let _ = 0; _ < a.length; _++) {
-        const d = a[_];
-        if (!n.has(d)) continue;
-        const w = n.get(d) - 1;
-        n.set(d, w), w === 0 && o.push(d);
-      }
-  }
-  if (l.length !== h.length) {
-    const i = [];
-    for (const [a, _] of n)
-      _ > 0 && i.push(r(a));
-    throw new globalThis.TypeError(
-      `Cycle detected in topological sort. Nodes still pending: ${i.join(", ")}`
-    );
-  }
-  return l;
-}
-export {
-  f as B,
-  u as G,
-  I as S,
-  A as a,
-  S as b,
-  R as c,
-  T as d,
-  E as e,
-  K as f,
-  F as g,
-  O as h,
-  g as i,
-  b as j,
-  y as k,
-  W as t
-};

package/dist/topological_sort-WAT-VHb-.cjs

@@ -1 +0,0 @@
-"use strict";class d{_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)))}isEmpty(){const t=this._words;for(let s=0;s<t.length;s++)if(t[s]!==0)return!1;return!0}overlaps(t){const s=this._words,e=t._words,n=s.length<e.length?s.length:e.length;for(let r=0;r<n;r++)if((s[r]&e[r])!==0)return!0;return!1}contains(t){const s=t._words,e=this._words,n=e.length;for(let r=0;r<s.length;r++){const o=s[r];if(o!==0&&(r>=n||(e[r]&o)!==o))return!1}return!0}equals(t){const s=this._words,e=t._words,n=s.length>e.length?s.length:e.length;for(let r=0;r<n;r++){const o=r<s.length?s[r]:0,h=r<e.length?e[r]:0;if(o!==h)return!1}return!0}copy(){return new d(this._words.slice())}copyInto(t){const s=this._words,e=t._words,n=s.length,r=e.length;if(r>=n){for(let o=0;o<n;o++)e[o]=s[o];for(let o=n;o<r;o++)e[o]=0}else{let o=r>0?r:1;for(;o<n;)o*=2;const h=new Array(o).fill(0);for(let i=0;i<n;i++)h[i]=s[i];t._words=h}return t}copyWithSet(t){const s=t>>>5,e=s+1,n=this._words.length>e?this._words.length:e,r=new Array(n).fill(0);for(let o=0;o<this._words.length;o++)r[o]=this._words[o];return r[s]|=1<<(t&31),new d(r)}copyWithClear(t){const s=this._words.slice(),e=t>>>5;return e<s.length&&(s[e]&=~(1<<(t&31))),new d(s)}hash(){let t=2166136261;const s=this._words;let e=s.length-1;for(;e>=0&&s[e]===0;)e--;for(let n=0;n<=e;n++)t^=s[n],t=Math.imul(t,16777619);return t}forEach(t){const s=this._words;for(let e=0;e<s.length;e++){let n=s[e];if(n===0)continue;const r=e<<5;for(;n!==0;){const o=n&-n>>>0,h=31-Math.clz32(o);t(r+h),n^=o}}}grow(t){let s=this._words.length;for(;s<t;)s*=2;const e=new Array(s).fill(0);for(let n=0;n<this._words.length;n++)e[n]=this._words[n];this._words=e}}class y{_denseKeys=[];_denseVals=[];_sparse=[];get size(){return this._denseKeys.length}get keys(){return this._denseKeys}has(t){return this._denseKeys[this._sparse[t]]===t}get(t){return this.has(t)?this._denseVals[this._sparse[t]]:void 0}set(t,s){if(this.has(t)){this._denseVals[this._sparse[t]]=s;return}this._sparse[t]=this._denseKeys.length,this._denseKeys.push(t),this._denseVals.push(s)}delete(t){if(!this.has(t))return!1;const s=this._sparse[t],e=this._denseKeys[this._denseKeys.length-1];return this._denseKeys[s]=e,this._denseVals[s]=this._denseVals[this._denseVals.length-1],this._sparse[e]=s,this._denseKeys.pop(),this._denseVals.pop(),!0}clear(){this._denseKeys.length=0,this._denseVals.length=0,this._sparse.length=0}forEach(t){for(let s=0;s<this._denseKeys.length;s++)t(this._denseKeys[s],this._denseVals[s])}[Symbol.iterator](){let t=0;const s=this._denseKeys,e=this._denseVals;return{next(){return t<s.length?{value:[s[t],e[t++]],done:!1}:{value:void 0,done:!0}}}}}const u=16,p=2;class c{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}swapRemove(t){const s=this._buf[t];return this._buf[t]=this._buf[--this._len],s}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 s=this._buf,e=this._len;return{next(){return t<e?{value:s[t++],done:!1}:{value:0,done:!0}}}}ensureCapacity(t){if(t<=this._buf.length)return;let s=this._buf.length||1;for(;s<t;)s*=p;const e=new this._ctor(s);e.set(this._buf.subarray(0,this._len)),this._buf=e}bulkAppend(t,s,e){this.ensureCapacity(this._len+e),this._buf.set(t.subarray(s,s+e),this._len),this._len+=e}bulkAppendZeroes(t){this.ensureCapacity(this._len+t),this._buf.fill(0,this._len,this._len+t),this._len+=t}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*p);t.set(this._buf),this._buf=t}}class I extends c{constructor(t=u){super(Float32Array,t)}}class b extends c{constructor(t=u){super(Float64Array,t)}}class A extends c{constructor(t=u){super(Int8Array,t)}}class S extends c{constructor(t=u){super(Int16Array,t)}}class R extends c{constructor(t=u){super(Int32Array,t)}}class T extends c{constructor(t=u){super(Uint8Array,t)}}class E extends c{constructor(t=u){super(Uint16Array,t)}}class F extends c{constructor(t=u){super(Uint32Array,t)}}class g{_compare;_data=[];constructor(t){this._compare=t}get size(){return this._data.length}peek(){return this._data[0]}push(t){this._data.push(t),this._siftUp(this._data.length-1)}pop(){const t=this._data;if(t.length===0)return;const e=t[0],n=t.pop();return t.length>0&&(t[0]=n,this._siftDown(0)),e}clear(){this._data.length=0}_siftUp(t){const s=this._data,e=this._compare,n=s[t];for(;t>0;){const r=t-1>>1;if(e(n,s[r])>=0)break;s[t]=s[r],t=r}s[t]=n}_siftDown(t){const s=this._data,e=this._compare,n=s.length,r=n>>1,o=s[t];for(;t<r;){let h=(t<<1)+1;const i=h+1;if(i<n&&e(s[i],s[h])<0&&(h=i),e(s[h],o)>=0)break;s[t]=s[h],t=h}s[t]=o}}function O(l,t,s,e){const n=e??(i=>String(i)),r=new Map;for(let i=0;i<l.length;i++)r.set(l[i],0);for(const[,i]of t)for(let a=0;a<i.length;a++){const _=i[a];r.has(_)&&r.set(_,r.get(_)+1)}const o=new g(s);for(let i=0;i<l.length;i++)r.get(l[i])===0&&o.push(l[i]);const h=[];for(;o.size>0;){const i=o.pop();h.push(i);const a=t.get(i);if(a!==void 0)for(let _=0;_<a.length;_++){const f=a[_];if(!r.has(f))continue;const w=r.get(f)-1;r.set(f,w),w===0&&o.push(f)}}if(h.length!==l.length){const i=[];for(const[a,_]of r)_>0&&i.push(n(a));throw new globalThis.TypeError(`Cycle detected in topological sort. Nodes still pending: ${i.join(", ")}`)}return h}exports.BITS_PER_WORD_MASK=31;exports.BITS_PER_WORD_SHIFT=5;exports.BinaryHeap=g;exports.BitSet=d;exports.GrowableFloat32Array=I;exports.GrowableFloat64Array=b;exports.GrowableInt16Array=S;exports.GrowableInt32Array=R;exports.GrowableInt8Array=A;exports.GrowableTypedArray=c;exports.GrowableUint16Array=E;exports.GrowableUint32Array=F;exports.GrowableUint8Array=T;exports.SparseMap=y;exports.topologicalSort=O;

package/dist/utils/arrays.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"arrays.d.ts","sourceRoot":"","sources":["../../src/utils/arrays.ts"],"names":[],"mappings":"AAAA;;KAEK;AAEL,gFAAgF;AAChF,wBAAgB,UAAU,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI,CAOhF"}

package/dist/utils/constants.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"constants.d.ts","sourceRoot":"","sources":["../../src/utils/constants.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,UAAU,KAAK,CAAC;AAC7B,eAAO,MAAM,OAAO,KAAK,CAAC;AAC1B,eAAO,MAAM,YAAY,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAsC,CAAC;AAGvF,eAAO,MAAM,iBAAiB,aAAa,CAAC;AAC5C,eAAO,MAAM,oBAAoB,aAAa,CAAC;AAG/C,eAAO,MAAM,uBAAuB,OAAO,CAAC;AAG5C,eAAO,MAAM,kBAAkB,IAAI,CAAC;AACpC,eAAO,MAAM,iBAAiB,KAAK,CAAC;AAGpC,eAAO,MAAM,sBAAsB,QAAS,CAAC;AAC7C,eAAO,MAAM,uBAAuB,IAAI,CAAC;AAGzC,eAAO,MAAM,kBAAkB,IAAI,CAAC"}