@oasys/oecs 0.3.1 → 0.5.0

package/dist/topological_sort-DK6EjpWa.js

@@ -0,0 +1,135 @@
+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/type_primitives/assertions.d.cts

@@ -0,0 +1,32 @@
+/***
+ * Assertions — Dev-only runtime validation and branded casting.
+ *
+ * All checks are guarded by DEV and tree-shaken in production builds.
+ * validateAndCast is the primary tool for creating branded IDs:
+ * it validates the input in dev and returns the value as the branded type.
+ * unsafeCast bypasses all checks (used when the caller guarantees validity).
+ *
+ ***/
+export declare const isNonNegativeInteger: (v: number) => boolean;
+export declare const isNonNull: (v: unknown) => boolean;
+/**
+ * Dev-only assertion that value is not null/undefined.
+ *
+ */
+export declare function assertNonNull<T>(value: T): asserts value is NonNullable<T>;
+export declare function assert<T, Result extends T = T>(value: T, condition: (v: T) => v is Result, errMessage: string): asserts value is Result;
+export declare function validateAndCast<T, Result extends T = T>(value: T, validator: (v: T) => boolean, errMessage: string): Result;
+export declare function unsafeCast<T>(value: unknown): T;
+/**
+ * Exhaustiveness backstop for tagged-union dispatches. Put it in the
+ * `default` arm (or after the final `case`) of a switch over a closed union:
+ * the `never` parameter makes "a union gained a variant but this dispatch
+ * didn't" a COMPILE error at the call site, and the throw catches runtime
+ * values that bypassed the type layer (deserialized/foreign data).
+ *
+ * Deliberately NOT `DEV`-gated, unlike the rest of this file: it marks a
+ * can't-happen branch, so it costs nothing until the day it fires — and that
+ * day it must fire in production too, not silently fall through.
+ */
+export declare function assertNever(value: never, label: string): never;
+//# sourceMappingURL=assertions.d.ts.map

package/dist/type_primitives/assertions.d.ts

@@ -1,16 +1,32 @@
 /***
  * Assertions — Dev-only runtime validation and branded casting.
  *
- * All checks are guarded by __DEV__ and tree-shaken in production builds.
- * validate_and_cast is the primary tool for creating branded IDs:
+ * All checks are guarded by DEV and tree-shaken in production builds.
+ * validateAndCast is the primary tool for creating branded IDs:
  * it validates the input in dev and returns the value as the branded type.
- * unsafe_cast bypasses all checks (used when the caller guarantees validity).
+ * unsafeCast bypasses all checks (used when the caller guarantees validity).
  *
  ***/
-export declare const is_non_negative_integer: (v: number) => boolean;
-export declare const is_non_null: (v: unknown) => boolean;
-export declare function assert_non_null<T>(value: T): asserts value is NonNullable<T>;
-export declare function assert<T, Result extends T = T>(value: T, condition: (v: T) => v is Result, err_message: string): asserts value is Result;
-export declare function validate_and_cast<T, Result extends T = T>(value: T, validator: (v: T) => boolean, err_message: string): Result;
-export declare function unsafe_cast<T>(value: unknown): T;
+export declare const isNonNegativeInteger: (v: number) => boolean;
+export declare const isNonNull: (v: unknown) => boolean;
+/**
+ * Dev-only assertion that value is not null/undefined.
+ *
+ */
+export declare function assertNonNull<T>(value: T): asserts value is NonNullable<T>;
+export declare function assert<T, Result extends T = T>(value: T, condition: (v: T) => v is Result, errMessage: string): asserts value is Result;
+export declare function validateAndCast<T, Result extends T = T>(value: T, validator: (v: T) => boolean, errMessage: string): Result;
+export declare function unsafeCast<T>(value: unknown): T;
+/**
+ * Exhaustiveness backstop for tagged-union dispatches. Put it in the
+ * `default` arm (or after the final `case`) of a switch over a closed union:
+ * the `never` parameter makes "a union gained a variant but this dispatch
+ * didn't" a COMPILE error at the call site, and the throw catches runtime
+ * values that bypassed the type layer (deserialized/foreign data).
+ *
+ * Deliberately NOT `DEV`-gated, unlike the rest of this file: it marks a
+ * can't-happen branch, so it costs nothing until the day it fires — and that
+ * day it must fire in production too, not silently fall through.
+ */
+export declare function assertNever(value: never, label: string): never;
 //# sourceMappingURL=assertions.d.ts.map

package/dist/type_primitives/assertions.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"assertions.d.ts","sourceRoot":"","sources":["../../src/type_primitives/assertions.ts"],"names":[],"mappings":"AAAA;;;;;;;;KAQK;AAIL,eAAO,MAAM,uBAAuB,MAAO,MAAM,KAAG,OAAwC,CAAC;AAE7F,eAAO,MAAM,WAAW,MAAO,OAAO,KAAG,OAAqB,CAAC;AAE/D,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,KAAK,IAAI,WAAW,CAAC,CAAC,CAAC,CAU5E;AAED,wBAAgB,MAAM,CAAC,CAAC,EAAE,MAAM,SAAS,CAAC,GAAG,CAAC,EAC5C,KAAK,EAAE,CAAC,EACR,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,MAAM,EAChC,WAAW,EAAE,MAAM,GAClB,OAAO,CAAC,KAAK,IAAI,MAAM,CAOzB;AAED,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,MAAM,SAAS,CAAC,GAAG,CAAC,EACvD,KAAK,EAAE,CAAC,EACR,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,EAC5B,WAAW,EAAE,MAAM,GAClB,MAAM,CAQR;AAED,wBAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,GAAG,CAAC,CAEhD"}
+{"version":3,"file":"assertions.d.ts","sourceRoot":"","sources":["../../src/type_primitives/assertions.ts"],"names":[],"mappings":"AAAA;;;;;;;;KAQK;AAKL,eAAO,MAAM,oBAAoB,MAAO,MAAM,KAAG,OAAwC,CAAC;AAE1F,eAAO,MAAM,SAAS,MAAO,OAAO,KAAG,OAAqB,CAAC;AAE7D;;;GAGG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,KAAK,IAAI,WAAW,CAAC,CAAC,CAAC,CAU1E;AAED,wBAAgB,MAAM,CAAC,CAAC,EAAE,MAAM,SAAS,CAAC,GAAG,CAAC,EAC7C,KAAK,EAAE,CAAC,EACR,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,MAAM,EAChC,UAAU,EAAE,MAAM,GAChB,OAAO,CAAC,KAAK,IAAI,MAAM,CAOzB;AAED,wBAAgB,eAAe,CAAC,CAAC,EAAE,MAAM,SAAS,CAAC,GAAG,CAAC,EACtD,KAAK,EAAE,CAAC,EACR,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,EAC5B,UAAU,EAAE,MAAM,GAChB,MAAM,CAQR;AAED,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,GAAG,CAAC,CAE/C;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,GAAG,KAAK,CAK9D"}

package/dist/type_primitives/binary_heap/binary_heap.d.cts

@@ -0,0 +1,37 @@
+/***
+ * BinaryHeap — generic array-backed binary heap with configurable ordering.
+ *
+ * Array layout uses implicit indexing: root at index 0, children of node `i`
+ * at `2i + 1` and `2i + 2`, parent of node `i` at `(i - 1) >> 1`.
+ *
+ * The comparator determines ordering: when `compare(a, b) < 0`, `a` has
+ * higher priority and floats toward the root. A standard `(a, b) => a - b`
+ * comparator yields a min-heap; `(a, b) => b - a` yields a max-heap.
+ *
+ * push and pop are O(log n). peek and clear are O(1).
+ *
+ ***/
+export type CompareFn<T> = (a: T, b: T) => number;
+/**
+ * Generic array-backed binary heap with configurable comparator.
+ *
+ */
+export declare class BinaryHeap<T> {
+    private readonly _compare;
+    private readonly _data;
+    constructor(compare: CompareFn<T>);
+    get size(): number;
+    /** Returns the highest-priority element without removing it, or undefined if empty. */
+    peek(): T | undefined;
+    /** Inserts a value and restores heap order by sifting up. O(log n). */
+    push(value: T): void;
+    /** Removes and returns the highest-priority element, or undefined if empty. O(log n). */
+    pop(): T | undefined;
+    /** Removes all elements. O(1). */
+    clear(): void;
+    /** Moves a node up toward the root until heap order is restored. */
+    private _siftUp;
+    /** Moves a node down away from the root until heap order is restored. */
+    private _siftDown;
+}
+//# sourceMappingURL=binary_heap.d.ts.map

package/dist/type_primitives/binary_heap/binary_heap.d.ts

@@ -12,6 +12,10 @@
  *
  ***/
 export type CompareFn<T> = (a: T, b: T) => number;
+/**
+ * Generic array-backed binary heap with configurable comparator.
+ *
+ */
 export declare class BinaryHeap<T> {
     private readonly _compare;
     private readonly _data;
@@ -26,8 +30,8 @@ export declare class BinaryHeap<T> {
     /** Removes all elements. O(1). */
     clear(): void;
     /** Moves a node up toward the root until heap order is restored. */
-    private _sift_up;
+    private _siftUp;
     /** Moves a node down away from the root until heap order is restored. */
-    private _sift_down;
+    private _siftDown;
 }
 //# sourceMappingURL=binary_heap.d.ts.map

package/dist/type_primitives/binary_heap/binary_heap.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"binary_heap.d.ts","sourceRoot":"","sources":["../../../src/type_primitives/binary_heap/binary_heap.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;KAYK;AAEL,MAAM,MAAM,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC;AAElD,qBAAa,UAAU,CAAC,CAAC;IACvB,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAe;IACxC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAW;gBAErB,OAAO,EAAE,SAAS,CAAC,CAAC,CAAC;IAIjC,IAAW,IAAI,IAAI,MAAM,CAExB;IAED,uFAAuF;IAChF,IAAI,IAAI,CAAC,GAAG,SAAS;IAI5B,uEAAuE;IAChE,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI;IAK3B,yFAAyF;IAClF,GAAG,IAAI,CAAC,GAAG,SAAS;IAc3B,kCAAkC;IAC3B,KAAK,IAAI,IAAI;IAIpB,oEAAoE;IACpE,OAAO,CAAC,QAAQ;IAchB,yEAAyE;IACzE,OAAO,CAAC,UAAU;CAsBnB"}
+{"version":3,"file":"binary_heap.d.ts","sourceRoot":"","sources":["../../../src/type_primitives/binary_heap/binary_heap.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;KAYK;AAEL,MAAM,MAAM,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC;AAElD;;;GAGG;AACH,qBAAa,UAAU,CAAC,CAAC;IACxB,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAe;IACxC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAW;gBAErB,OAAO,EAAE,SAAS,CAAC,CAAC,CAAC;IAIjC,IAAW,IAAI,IAAI,MAAM,CAExB;IAED,uFAAuF;IAChF,IAAI,IAAI,CAAC,GAAG,SAAS;IAI5B,uEAAuE;IAChE,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI;IAK3B,yFAAyF;IAClF,GAAG,IAAI,CAAC,GAAG,SAAS;IAc3B,kCAAkC;IAC3B,KAAK,IAAI,IAAI;IAIpB,oEAAoE;IACpE,OAAO,CAAC,OAAO;IAcf,yEAAyE;IACzE,OAAO,CAAC,SAAS;CAsBjB"}

package/dist/type_primitives/bitset/bitset.d.cts

@@ -0,0 +1,54 @@
+/***
+ * BitSet — number[]-backed bit set with auto-grow.
+ *
+ * Used as the archetype component signature. Each bit position corresponds
+ * to a ComponentID. Operations (has/set/clear) are O(1), and mask
+ * comparisons (contains, equals, overlaps) are O(words) where
+ * words = ceil(maxComponentId / 32).
+ *
+ * Bit layout within each 32-bit word:
+ *   wordIndex = bit >>> BITS_PER_WORD_SHIFT   (divide by 32)
+ *   bit_offset = bit & BITS_PER_WORD_MASK      (mod 32)
+ *   test:  word & (1 << offset)
+ *   set:   word |= (1 << offset)
+ *   clear: word &= ~(1 << offset)
+ *
+ ***/
+export declare const BITS_PER_WORD = 32;
+export declare const BITS_PER_WORD_SHIFT = 5;
+export declare const BITS_PER_WORD_MASK = 31;
+export declare const FNV_OFFSET_BASIS = 2166136261;
+export declare const FNV_PRIME = 16777619;
+/**
+ * number[]-backed bit set with auto-grow. Used as the archetype component signature.
+ *
+ */
+export declare class BitSet {
+    _words: number[];
+    constructor(words?: number[]);
+    has(bit: number): boolean;
+    set(bit: number): void;
+    clear(bit: number): void;
+    /** True if no bit is set. */
+    isEmpty(): boolean;
+    /** True if any bit is set in both this and other (non-empty intersection). */
+    overlaps(other: BitSet): boolean;
+    /** True if this is a superset of other (all bits in other are set in this). */
+    contains(other: BitSet): boolean;
+    equals(other: BitSet): boolean;
+    copy(): BitSet;
+    /** 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(target: BitSet): BitSet;
+    copyWithSet(bit: number): BitSet;
+    copyWithClear(bit: number): BitSet;
+    /** FNV-1a hash. Skips trailing zero words so differently-sized arrays with the same bits hash equally. */
+    hash(): number;
+    /** Iterate all set bits via lowest-set-bit extraction. */
+    forEach(fn: (bit: number) => void): void;
+    private grow;
+}
+//# sourceMappingURL=bitset.d.ts.map

package/dist/type_primitives/bitset/bitset.d.ts

@@ -7,7 +7,7 @@
  * words = ceil(maxComponentId / 32).
  *
  * Bit layout within each 32-bit word:
- *   word_index = bit >>> BITS_PER_WORD_SHIFT   (divide by 32)
+ *   wordIndex = bit >>> BITS_PER_WORD_SHIFT   (divide by 32)
  *   bit_offset = bit & BITS_PER_WORD_MASK      (mod 32)
  *   test:  word & (1 << offset)
  *   set:   word |= (1 << offset)
@@ -19,24 +19,36 @@ export declare const BITS_PER_WORD_SHIFT = 5;
 export declare const BITS_PER_WORD_MASK = 31;
 export declare const FNV_OFFSET_BASIS = 2166136261;
 export declare const FNV_PRIME = 16777619;
+/**
+ * number[]-backed bit set with auto-grow. Used as the archetype component signature.
+ *
+ */
 export declare class BitSet {
     _words: number[];
     constructor(words?: number[]);
     has(bit: number): boolean;
     set(bit: number): void;
     clear(bit: number): void;
+    /** True if no bit is set. */
+    isEmpty(): boolean;
     /** True if any bit is set in both this and other (non-empty intersection). */
     overlaps(other: BitSet): boolean;
     /** True if this is a superset of other (all bits in other are set in this). */
     contains(other: BitSet): boolean;
     equals(other: BitSet): boolean;
     copy(): BitSet;
-    copy_with_set(bit: number): BitSet;
-    copy_with_clear(bit: number): BitSet;
+    /** 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(target: BitSet): BitSet;
+    copyWithSet(bit: number): BitSet;
+    copyWithClear(bit: number): BitSet;
     /** FNV-1a hash. Skips trailing zero words so differently-sized arrays with the same bits hash equally. */
     hash(): number;
     /** Iterate all set bits via lowest-set-bit extraction. */
-    for_each(fn: (bit: number) => void): void;
+    forEach(fn: (bit: number) => void): void;
     private grow;
 }
 //# sourceMappingURL=bitset.d.ts.map

package/dist/type_primitives/bitset/bitset.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"bitset.d.ts","sourceRoot":"","sources":["../../../src/type_primitives/bitset/bitset.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;KAeK;AAGL,eAAO,MAAM,aAAa,KAAK,CAAC;AAChC,eAAO,MAAM,mBAAmB,IAAI,CAAC;AACrC,eAAO,MAAM,kBAAkB,KAAK,CAAC;AAGrC,eAAO,MAAM,gBAAgB,aAAa,CAAC;AAC3C,eAAO,MAAM,SAAS,WAAa,CAAC;AAIpC,qBAAa,MAAM;IACV,MAAM,EAAE,MAAM,EAAE,CAAC;gBAEZ,KAAK,CAAC,EAAE,MAAM,EAAE;IAIrB,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAMzB,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI;IAMtB,KAAK,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI;IAM/B,8EAA8E;IACvE,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IAUvC,+EAA+E;IACxE,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IAehC,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IAa9B,IAAI,IAAI,MAAM;IAId,aAAa,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM;IAUlC,eAAe,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM;IAS3C,0GAA0G;IACnG,IAAI,IAAI,MAAM;IAarB,0DAA0D;IACnD,QAAQ,CAAC,EAAE,EAAE,CAAC,GAAG,EAAE,MAAM,KAAK,IAAI,GAAG,IAAI;IAmBhD,OAAO,CAAC,IAAI;CAOb"}
+{"version":3,"file":"bitset.d.ts","sourceRoot":"","sources":["../../../src/type_primitives/bitset/bitset.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;KAeK;AAGL,eAAO,MAAM,aAAa,KAAK,CAAC;AAChC,eAAO,MAAM,mBAAmB,IAAI,CAAC;AACrC,eAAO,MAAM,kBAAkB,KAAK,CAAC;AAGrC,eAAO,MAAM,gBAAgB,aAAa,CAAC;AAC3C,eAAO,MAAM,SAAS,WAAa,CAAC;AAIpC;;;GAGG;AACH,qBAAa,MAAM;IACX,MAAM,EAAE,MAAM,EAAE,CAAC;gBAEZ,KAAK,CAAC,EAAE,MAAM,EAAE;IAIrB,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAMzB,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI;IAMtB,KAAK,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI;IAM/B,6BAA6B;IACtB,OAAO,IAAI,OAAO;IAQzB,8EAA8E;IACvE,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IAUvC,+EAA+E;IACxE,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IAehC,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IAa9B,IAAI,IAAI,MAAM;IAIrB;;;;6DAIyD;IAClD,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM;IAoBhC,WAAW,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM;IAUhC,aAAa,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM;IASzC,0GAA0G;IACnG,IAAI,IAAI,MAAM;IAarB,0DAA0D;IACnD,OAAO,CAAC,EAAE,EAAE,CAAC,GAAG,EAAE,MAAM,KAAK,IAAI,GAAG,IAAI;IAmB/C,OAAO,CAAC,IAAI;CAOZ"}

package/dist/type_primitives/brand.d.cts

@@ -0,0 +1,23 @@
+/***
+ * Brand — Nominal typing for TypeScript.
+ *
+ * Brand<T, Name> intersects T with a phantom readonly symbol property
+ * tagged with Name. The symbol never exists at runtime — it only prevents
+ * accidental assignment between structurally identical types.
+ *
+ * Example: EntityID and ComponentID are both numbers at runtime, but
+ * Brand<number, "entityId"> and Brand<number, "component_id"> are
+ * incompatible at compile time.
+ *
+ ***/
+declare const brand: unique symbol;
+/**
+ * Nominal typing helper — intersects T with a phantom readonly symbol
+ * so structurally identical types become compile-time incompatible.
+ *
+ */
+export type Brand<T, BrandName extends string> = T & {
+    readonly [brand]: BrandName;
+};
+export {};
+//# sourceMappingURL=brand.d.ts.map

package/dist/type_primitives/brand.d.ts

@@ -6,11 +6,16 @@
  * accidental assignment between structurally identical types.
  *
  * Example: EntityID and ComponentID are both numbers at runtime, but
- * Brand<number, "entity_id"> and Brand<number, "component_id"> are
+ * Brand<number, "entityId"> and Brand<number, "component_id"> are
  * incompatible at compile time.
  *
  ***/
 declare const brand: unique symbol;
+/**
+ * Nominal typing helper — intersects T with a phantom readonly symbol
+ * so structurally identical types become compile-time incompatible.
+ *
+ */
 export type Brand<T, BrandName extends string> = T & {
     readonly [brand]: BrandName;
 };

package/dist/type_primitives/brand.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"brand.d.ts","sourceRoot":"","sources":["../../src/type_primitives/brand.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;KAWK;AAEL,OAAO,CAAC,MAAM,KAAK,EAAE,OAAO,MAAM,CAAC;AAEnC,MAAM,MAAM,KAAK,CAAC,CAAC,EAAE,SAAS,SAAS,MAAM,IAAI,CAAC,GAAG;IACnD,QAAQ,CAAC,CAAC,KAAK,CAAC,EAAE,SAAS,CAAC;CAC7B,CAAC"}
+{"version":3,"file":"brand.d.ts","sourceRoot":"","sources":["../../src/type_primitives/brand.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;KAWK;AAEL,OAAO,CAAC,MAAM,KAAK,EAAE,OAAO,MAAM,CAAC;AAEnC;;;;GAIG;AACH,MAAM,MAAM,KAAK,CAAC,CAAC,EAAE,SAAS,SAAS,MAAM,IAAI,CAAC,GAAG;IACpD,QAAQ,CAAC,CAAC,KAAK,CAAC,EAAE,SAAS,CAAC;CAC5B,CAAC"}

package/dist/type_primitives/error.d.cts

@@ -0,0 +1,16 @@
+import { AppError } from '../utils/error.cjs';
+export declare enum TYPE_ERROR {
+    ASSERTION_FAIL_CONDITION = "ASSERTION_FAIL_CONDITION",
+    VALIDATION_FAIL_CONDITION = "VALIDATION_FAIL_CONDITION",
+    ASSERTION_FAIL_NON_NULLABLE = "ASSERTION_FAIL_NON_NULLABLE",
+    ASSERTION_FAIL_UNREACHABLE = "ASSERTION_FAIL_UNREACHABLE"
+}
+/**
+ * Error class thrown by std's runtime assertions. Non-operational.
+ *
+ */
+export declare class AssertionError extends AppError {
+    readonly category: TYPE_ERROR;
+    constructor(category: TYPE_ERROR, message: string, context?: Record<string, unknown>);
+}
+//# sourceMappingURL=error.d.ts.map

package/dist/type_primitives/error.d.ts

@@ -1,10 +1,15 @@
-import { AppError } from '../utils/error';
+import { AppError } from '../utils/error.js';
 export declare enum TYPE_ERROR {
     ASSERTION_FAIL_CONDITION = "ASSERTION_FAIL_CONDITION",
     VALIDATION_FAIL_CONDITION = "VALIDATION_FAIL_CONDITION",
-    ASSERTION_FAIL_NON_NULLABLE = "ASSERTION_FAIL_NON_NULLABLE"
+    ASSERTION_FAIL_NON_NULLABLE = "ASSERTION_FAIL_NON_NULLABLE",
+    ASSERTION_FAIL_UNREACHABLE = "ASSERTION_FAIL_UNREACHABLE"
 }
-export declare class TypeError extends AppError {
+/**
+ * Error class thrown by std's runtime assertions. Non-operational.
+ *
+ */
+export declare class AssertionError extends AppError {
     readonly category: TYPE_ERROR;
     constructor(category: TYPE_ERROR, message: string, context?: Record<string, unknown>);
 }

package/dist/type_primitives/error.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"error.d.ts","sourceRoot":"","sources":["../../src/type_primitives/error.ts"],"names":[],"mappings":"AAAA;;;;;;KAMK;AAEL,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAE1C,oBAAY,UAAU;IACpB,wBAAwB,6BAA6B;IACrD,yBAAyB,8BAA8B;IACvD,2BAA2B,gCAAgC;CAC5D;AAED,qBAAa,SAAU,SAAQ,QAAQ;aAEnB,QAAQ,EAAE,UAAU;gBAApB,QAAQ,EAAE,UAAU,EACpC,OAAO,EAAE,MAAM,EACf,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;CAIpC"}
+{"version":3,"file":"error.d.ts","sourceRoot":"","sources":["../../src/type_primitives/error.ts"],"names":[],"mappings":"AAAA;;;;;;KAMK;AAEL,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAE1C,oBAAY,UAAU;IACrB,wBAAwB,6BAA6B;IACrD,yBAAyB,8BAA8B;IACvD,2BAA2B,gCAAgC;IAC3D,0BAA0B,+BAA+B;CACzD;AAED;;;GAGG;AACH,qBAAa,cAAe,SAAQ,QAAQ;aAE1B,QAAQ,EAAE,UAAU;gBAApB,QAAQ,EAAE,UAAU,EACpC,OAAO,EAAE,MAAM,EACf,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;CAIlC"}

package/dist/type_primitives/index.d.cts

@@ -0,0 +1,13 @@
+/**
+ * Type-primitives barrel — assertions, brands, errors, plus data-structure primitives.
+ */
+export * from './assertions.cjs';
+export * from './brand.cjs';
+export * from './error.cjs';
+export * from './bitset/bitset.cjs';
+export * from './sparse_set/sparse_set.cjs';
+export * from './sparse_map/sparse_map.cjs';
+export * from './typed_arrays/typed_arrays.cjs';
+export * from './binary_heap/binary_heap.cjs';
+export * from './topological_sort/topological_sort.cjs';
+//# sourceMappingURL=index.d.ts.map

package/dist/type_primitives/index.d.ts

@@ -1,10 +1,13 @@
-export * from './assertions';
-export * from './brand';
-export * from './error';
-export * from './bitset/bitset';
-export * from './sparse_set/sparse_set';
-export * from './sparse_map/sparse_map';
-export * from './typed_arrays/typed_arrays';
-export * from './binary_heap/binary_heap';
-export * from './topological_sort/topological_sort';
+/**
+ * Type-primitives barrel — assertions, brands, errors, plus data-structure primitives.
+ */
+export * from './assertions.js';
+export * from './brand.js';
+export * from './error.js';
+export * from './bitset/bitset.js';
+export * from './sparse_set/sparse_set.js';
+export * from './sparse_map/sparse_map.js';
+export * from './typed_arrays/typed_arrays.js';
+export * from './binary_heap/binary_heap.js';
+export * from './topological_sort/topological_sort.js';
 //# sourceMappingURL=index.d.ts.map

package/dist/type_primitives/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/type_primitives/index.ts"],"names":[],"mappings":"AAAA,cAAc,cAAc,CAAC;AAC7B,cAAc,SAAS,CAAC;AACxB,cAAc,SAAS,CAAC;AACxB,cAAc,iBAAiB,CAAC;AAChC,cAAc,yBAAyB,CAAC;AACxC,cAAc,yBAAyB,CAAC;AACxC,cAAc,6BAA6B,CAAC;AAC5C,cAAc,2BAA2B,CAAC;AAC1C,cAAc,qCAAqC,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/type_primitives/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,cAAc,cAAc,CAAC;AAC7B,cAAc,SAAS,CAAC;AACxB,cAAc,SAAS,CAAC;AACxB,cAAc,iBAAiB,CAAC;AAChC,cAAc,yBAAyB,CAAC;AACxC,cAAc,yBAAyB,CAAC;AACxC,cAAc,6BAA6B,CAAC;AAC5C,cAAc,2BAA2B,CAAC;AAC1C,cAAc,qCAAqC,CAAC"}

package/dist/type_primitives/sparse_map/sparse_map.d.cts

@@ -0,0 +1,30 @@
+/***
+ * SparseMap — O(1) integer-keyed map with cache-friendly dense iteration.
+ *
+ * Keys are non-negative integers. Two parallel dense arrays (keys + values)
+ * enable linear iteration. A sparse number[] maps key → dense index for
+ * O(1) get/set/delete.
+ *
+ * Membership is verified by cross-referencing dense_keys[sparse[key]] === key,
+ * so stale sparse entries are harmless. Deletion uses swap-and-pop.
+ *
+ ***/
+/**
+ * O(1) integer-keyed map with cache-friendly dense iteration.
+ *
+ */
+export declare class SparseMap<V> {
+    private _denseKeys;
+    private _denseVals;
+    private _sparse;
+    get size(): number;
+    get keys(): readonly number[];
+    has(key: number): boolean;
+    get(key: number): V | undefined;
+    set(key: number, value: V): void;
+    delete(key: number): boolean;
+    clear(): void;
+    forEach(fn: (key: number, value: V) => void): void;
+    [Symbol.iterator](): Iterator<[number, V]>;
+}
+//# sourceMappingURL=sparse_map.d.ts.map

package/dist/type_primitives/sparse_map/sparse_map.d.ts

@@ -9,9 +9,13 @@
  * so stale sparse entries are harmless. Deletion uses swap-and-pop.
  *
  ***/
+/**
+ * O(1) integer-keyed map with cache-friendly dense iteration.
+ *
+ */
 export declare class SparseMap<V> {
-    private _dense_keys;
-    private _dense_vals;
+    private _denseKeys;
+    private _denseVals;
     private _sparse;
     get size(): number;
     get keys(): readonly number[];
@@ -20,7 +24,7 @@ export declare class SparseMap<V> {
     set(key: number, value: V): void;
     delete(key: number): boolean;
     clear(): void;
-    for_each(fn: (key: number, value: V) => void): void;
+    forEach(fn: (key: number, value: V) => void): void;
     [Symbol.iterator](): Iterator<[number, V]>;
 }
 //# sourceMappingURL=sparse_map.d.ts.map

package/dist/type_primitives/sparse_map/sparse_map.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"sparse_map.d.ts","sourceRoot":"","sources":["../../../src/type_primitives/sparse_map/sparse_map.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;KAUK;AAEL,qBAAa,SAAS,CAAC,CAAC;IACtB,OAAO,CAAC,WAAW,CAAgB;IACnC,OAAO,CAAC,WAAW,CAAW;IAC9B,OAAO,CAAC,OAAO,CAAgB;IAE/B,IAAW,IAAI,IAAI,MAAM,CAExB;IAED,IAAW,IAAI,IAAI,SAAS,MAAM,EAAE,CAEnC;IAEM,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAIzB,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS;IAI/B,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;IAUhC,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAa5B,KAAK,IAAI,IAAI;IAMb,QAAQ,CAAC,EAAE,EAAE,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,KAAK,IAAI,GAAG,IAAI;IAM1D,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;CAa3C"}
+{"version":3,"file":"sparse_map.d.ts","sourceRoot":"","sources":["../../../src/type_primitives/sparse_map/sparse_map.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;KAUK;AAEL;;;GAGG;AACH,qBAAa,SAAS,CAAC,CAAC;IACvB,OAAO,CAAC,UAAU,CAAgB;IAClC,OAAO,CAAC,UAAU,CAAW;IAC7B,OAAO,CAAC,OAAO,CAAgB;IAE/B,IAAW,IAAI,IAAI,MAAM,CAExB;IAED,IAAW,IAAI,IAAI,SAAS,MAAM,EAAE,CAEnC;IAEM,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAIzB,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS;IAI/B,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;IAUhC,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAa5B,KAAK,IAAI,IAAI;IAMb,OAAO,CAAC,EAAE,EAAE,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,KAAK,IAAI,GAAG,IAAI;IAMzD,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;CAe1C"}

package/dist/type_primitives/sparse_set/sparse_set.d.cts

@@ -0,0 +1,28 @@
+/***
+ * SparseSet — O(1) integer-key set with cache-friendly dense iteration.
+ *
+ * Keys are non-negative integers. A dense number[] holds members packed
+ * at 0..size-1 for linear iteration. A sparse number[] maps
+ * key → dense index for O(1) has/add/delete.
+ *
+ * Membership is verified by cross-referencing dense[sparse[key]] === key,
+ * so stale sparse entries are harmless (no clearing needed on delete).
+ * Deletion uses swap-and-pop to keep data contiguous.
+ *
+ ***/
+/**
+ * O(1) integer-key set with cache-friendly dense iteration.
+ *
+ */
+export declare class SparseSet {
+    private _dense;
+    private _sparse;
+    get size(): number;
+    get values(): readonly number[];
+    has(key: number): boolean;
+    add(key: number): void;
+    delete(key: number): boolean;
+    clear(): void;
+    [Symbol.iterator](): Iterator<number>;
+}
+//# sourceMappingURL=sparse_set.d.ts.map

package/dist/type_primitives/sparse_set/sparse_set.d.ts

@@ -10,6 +10,10 @@
  * Deletion uses swap-and-pop to keep data contiguous.
  *
  ***/
+/**
+ * O(1) integer-key set with cache-friendly dense iteration.
+ *
+ */
 export declare class SparseSet {
     private _dense;
     private _sparse;

package/dist/type_primitives/sparse_set/sparse_set.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"sparse_set.d.ts","sourceRoot":"","sources":["../../../src/type_primitives/sparse_set/sparse_set.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;KAWK;AAEL,qBAAa,SAAS;IACpB,OAAO,CAAC,MAAM,CAAgB;IAC9B,OAAO,CAAC,OAAO,CAAgB;IAE/B,IAAW,IAAI,IAAI,MAAM,CAExB;IAED,IAAW,MAAM,IAAI,SAAS,MAAM,EAAE,CAErC;IAEM,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAIzB,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI;IAMtB,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAW5B,KAAK,IAAI,IAAI;IAKpB,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,MAAM,CAAC;CAGtC"}
+{"version":3,"file":"sparse_set.d.ts","sourceRoot":"","sources":["../../../src/type_primitives/sparse_set/sparse_set.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;KAWK;AAEL;;;GAGG;AACH,qBAAa,SAAS;IACrB,OAAO,CAAC,MAAM,CAAgB;IAC9B,OAAO,CAAC,OAAO,CAAgB;IAE/B,IAAW,IAAI,IAAI,MAAM,CAExB;IAED,IAAW,MAAM,IAAI,SAAS,MAAM,EAAE,CAErC;IAEM,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAIzB,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI;IAMtB,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAW5B,KAAK,IAAI,IAAI;IAKpB,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,MAAM,CAAC;CAGrC"}