@vworlds/vecs 1.0.15 → 1.0.16

package/dist/util/bitset.js

@@ -20,7 +20,11 @@
  */
 export class Bitset {
     constructor() {
-        /** @internal Underlying word storage; exposed for tests. */
+        /**
+         * @internal Underlying word storage; exposed for tests and read directly
+         * from query predicates emitted by {@link _compileSubsetCheck}. Renaming
+         * this field is a breaking change for compiled query code generation.
+         */
         this._bits = [];
     }
     /**
@@ -29,7 +33,12 @@ export class Bitset {
      * @param n - Non-negative integer bit index.
      */
     add(n) {
-        this._bits[n >>> 5] |= 1 << n;
+        const idx = n >>> 5;
+        const bits = this._bits;
+        while (bits.length <= idx) {
+            bits.push(0);
+        }
+        bits[idx] |= 1 << n;
     }
     /**
      * Set the bit described by `bptr` (fast path using a pre-computed
@@ -48,10 +57,7 @@ export class Bitset {
      * @param bptr - Pre-computed pointer to a bit position.
      */
     deleteBit(bptr) {
-        const current = this._bits[bptr.arrayIndex];
-        if (current) {
-            this._bits[bptr.arrayIndex] = current & ~bptr.bitmask;
-        }
+        this._bits[bptr.arrayIndex] &= ~bptr.bitmask;
     }
     /**
      * Clear bit `n`. Storage is not compacted automatically; call
@@ -60,11 +66,7 @@ export class Bitset {
      * @param n - Non-negative integer bit index.
      */
     delete(n) {
-        const arrayIndex = n >>> 5;
-        const current = this._bits[arrayIndex];
-        if (current) {
-            this._bits[arrayIndex] = current & ~(1 << n);
-        }
+        this._bits[n >>> 5] &= ~(1 << n);
     }
     /**
      * Trim trailing zero words from the backing storage.
@@ -120,8 +122,9 @@ export class Bitset {
     hasBitset(other) {
         const bits = this._bits;
         const otherBits = other._bits;
-        for (let i = 0; i < otherBits.length; i++) {
-            const otherWord = otherBits[i] | 0;
+        const len = otherBits.length;
+        for (let i = 0; i < len; i++) {
+            const otherWord = otherBits[i];
             if ((bits[i] & otherWord) !== otherWord) {
                 return false;
             }
@@ -134,14 +137,59 @@ export class Bitset {
      * @param callback - Invoked once per set bit.
      */
     forEach(callback) {
-        this._bits.forEach((b, j) => {
+        const bits = this._bits;
+        const len = bits.length;
+        for (let j = 0; j < len; j++) {
+            let w = bits[j];
+            if (w === 0) {
+                continue;
+            }
+            const base = j << 5;
+            if (w === -1) {
+                callback(base);
+                callback(base + 1);
+                callback(base + 2);
+                callback(base + 3);
+                callback(base + 4);
+                callback(base + 5);
+                callback(base + 6);
+                callback(base + 7);
+                callback(base + 8);
+                callback(base + 9);
+                callback(base + 10);
+                callback(base + 11);
+                callback(base + 12);
+                callback(base + 13);
+                callback(base + 14);
+                callback(base + 15);
+                callback(base + 16);
+                callback(base + 17);
+                callback(base + 18);
+                callback(base + 19);
+                callback(base + 20);
+                callback(base + 21);
+                callback(base + 22);
+                callback(base + 23);
+                callback(base + 24);
+                callback(base + 25);
+                callback(base + 26);
+                callback(base + 27);
+                callback(base + 28);
+                callback(base + 29);
+                callback(base + 30);
+                callback(base + 31);
+                continue;
+            }
             for (let i = 0; i < 32; i++) {
-                if ((b & 1) !== 0) {
-                    callback(i + j * 32);
+                if ((w & 1) !== 0) {
+                    callback(base + i);
+                }
+                w >>>= 1;
+                if (w === 0) {
+                    break;
                 }
-                b >>= 1;
             }
-        });
+        }
     }
     /**
      * Return an array of every set bit index in ascending order.
@@ -169,13 +217,50 @@ export class Bitset {
         this._bits[arrayIndex] = bitmask;
     }
     /**
-     * Return `true` when every bit in `bitmask` is set in the word at
-     * `arrayIndex`.
+     * Emit a JavaScript expression that evaluates to `true` when the bitset
+     * addressed by `targetBitsExpr` (a `number[]` of 32-bit words) contains
+     * every bit set in this bitset.
+     *
+     * The expression is intended to be spliced into source generated through
+     * `new Function(...)` so that a `hasBitset` call against this (immutable)
+     * mask is replaced by straight-line bitwise checks with the mask's word
+     * values baked in as numeric literals. Zero words are skipped at code
+     * generation time, so the runtime expression never iterates them.
+     *
+     * Contract:
+     * - Empty mask -> `"true"`.
+     * - One non-zero word -> a single `(target[i]&W)===W` term (no outer
+     *   parens; `===` binds tighter than `&&` / `||`, so embedding in an
+     *   AND / OR chain is precedence-safe).
+     * - Multiple non-zero words -> terms joined by `&&`, no outer parens.
+     * - A word whose value sets bit 31 emits as a negative int32 literal
+     *   (e.g. `-2147483648`); JS bitwise `&` is defined to coerce both
+     *   operands to int32, so the round-trip comparison is correct.
+     * - When `target.length` is smaller than the mask, the missing slots
+     *   read as `undefined`; `undefined & W` coerces to `0`, and
+     *   `0 === W` (W !== 0) is `false`, matching `hasBitset` semantics.
+     *
+     * The mask's `_bits` are read at the time `_compileSubsetCheck` runs,
+     * so a caller that mutates the mask after compilation will not affect
+     * already-emitted strings.
      *
      * @internal
+     *
+     * @param targetBitsExpr - JS expression that, when evaluated at runtime,
+     *   yields the target's `_bits` array. Embedded verbatim into the
+     *   emitted code; it must be free of side effects (it is evaluated
+     *   once per non-zero word of this mask).
      */
-    _hasIndexBitmask(arrayIndex, bitmask) {
-        return (this._bits[arrayIndex] & bitmask) !== 0;
+    _compileSubsetCheck(targetBitsExpr) {
+        const conjuncts = [];
+        for (let i = 0; i < this._bits.length; i++) {
+            const w = this._bits[i] | 0;
+            if (w === 0) {
+                continue;
+            }
+            conjuncts.push(`(${targetBitsExpr}[${i}]&${w})===${w}`);
+        }
+        return conjuncts.length === 0 ? "true" : conjuncts.join("&&");
     }
 }
 /**

package/dist/util/bitset.js.map

@@ -1 +1 @@
-{"version":3,"file":"bitset.js","sourceRoot":"","sources":["../../src/util/bitset.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,OAAO,MAAM;IAAnB;QACE,4DAA4D;QACrD,UAAK,GAAa,EAAE,CAAC;IA0K9B,CAAC;IAxKC;;;;OAIG;IACI,GAAG,CAAC,CAAS;QAClB,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,IAAY;QACxB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC;IAC9C,CAAC;IAED;;;;;;OAMG;IACI,SAAS,CAAC,IAAY;QAC3B,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC5C,IAAI,OAAO,EAAE,CAAC;YACZ,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,OAAO,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC;QACxD,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,CAAS;QACrB,MAAM,UAAU,GAAG,CAAC,KAAK,CAAC,CAAC;QAC3B,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QACvC,IAAI,OAAO,EAAE,CAAC;YACZ,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,OAAO,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAC/C,CAAC;IACH,CAAC;IAED;;OAEG;IACI,OAAO;QACZ,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YACpE,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;QACnB,CAAC;IACH,CAAC;IAED,4BAA4B;IACrB,KAAK;QACV,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACxB,CAAC;IAED;;;;OAIG;IACI,GAAG,CAAC,CAAS;QAClB,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAChD,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,IAAY;QACxB,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAC5D,CAAC;IAED;;;;OAIG;IACI,KAAK,CAAC,KAAa;QACxB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;gBACnD,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;OAQG;IACI,SAAS,CAAC,KAAa;QAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,SAAS,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACnC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,KAAK,SAAS,EAAE,CAAC;gBACxC,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACI,OAAO,CAAC,QAA6B;QAC1C,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5B,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;oBAClB,QAAQ,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;gBACvB,CAAC;gBACD,CAAC,KAAK,CAAC,CAAC;YACV,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACI,OAAO;QACZ,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACjC,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;;OAKG;IACI,gBAAgB,CAAC,UAAkB,EAAE,OAAe;QACzD,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,OAAO,CAAC;IACpC,CAAC;IAED;;;;OAIG;IACI,gBAAgB,CAAC,UAAkB,EAAE,OAAe;QACzD,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,OAAO,CAAC;IACnC,CAAC;IAED;;;;;OAKG;IACI,gBAAgB,CAAC,UAAkB,EAAE,OAAe;QACzD,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;IAClD,CAAC;CACF;AAED;;;;;;;;;;GAUG;AACH,MAAM,OAAO,MAAM;IAMjB;IACE,gDAAgD;IAChC,KAAa;QAAb,UAAK,GAAL,KAAK,CAAQ;QAE7B,IAAI,CAAC,UAAU,GAAG,KAAK,KAAK,CAAC,CAAC;QAC9B,IAAI,CAAC,OAAO,GAAG,CAAC,IAAI,KAAK,CAAC;IAC5B,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,KAAa;QACzB,OAAO,IAAI,CAAC,UAAU,KAAK,KAAK,CAAC,UAAU,IAAI,IAAI,CAAC,OAAO,KAAK,KAAK,CAAC,OAAO,CAAC;IAChF,CAAC;CACF"}
+{"version":3,"file":"bitset.js","sourceRoot":"","sources":["../../src/util/bitset.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,OAAO,MAAM;IAAnB;QACE;;;;WAIG;QACI,UAAK,GAAa,EAAE,CAAC;IA2P9B,CAAC;IAzPC;;;;OAIG;IACI,GAAG,CAAC,CAAS;QAClB,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;QACpB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,OAAO,IAAI,CAAC,MAAM,IAAI,GAAG,EAAE,CAAC;YAC1B,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACf,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtB,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,IAAY;QACxB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC;IAC9C,CAAC;IAED;;;;;;OAMG;IACI,SAAS,CAAC,IAAY;QAC3B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC;IAC/C,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,CAAS;QACrB,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACnC,CAAC;IAED;;OAEG;IACI,OAAO;QACZ,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YACpE,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;QACnB,CAAC;IACH,CAAC;IAED,4BAA4B;IACrB,KAAK;QACV,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACxB,CAAC;IAED;;;;OAIG;IACI,GAAG,CAAC,CAAS;QAClB,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAChD,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,IAAY;QACxB,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAC5D,CAAC;IAED;;;;OAIG;IACI,KAAK,CAAC,KAAa;QACxB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;gBACnD,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;OAQG;IACI,SAAS,CAAC,KAAa;QAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC;QAC9B,MAAM,GAAG,GAAG,SAAS,CAAC,MAAM,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,MAAM,SAAS,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,KAAK,SAAS,EAAE,CAAC;gBACxC,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACI,OAAO,CAAC,QAA6B;QAC1C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAChB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACZ,SAAS;YACX,CAAC;YACD,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;YACpB,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;gBACb,QAAQ,CAAC,IAAI,CAAC,CAAC;gBACf,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;gBACnB,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;gBACnB,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;gBACnB,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;gBACnB,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;gBACnB,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;gBACnB,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;gBACnB,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;gBACnB,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;gBACnB,QAAQ,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;gBACpB,QAAQ,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;gBACpB,QAAQ,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;gBACpB,QAAQ,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;gBACpB,QAAQ,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;gBACpB,QAAQ,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;gBACpB,QAAQ,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;gBACpB,QAAQ,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;gBACpB,QAAQ,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;gBACpB,QAAQ,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;gBACpB,QAAQ,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;gBACpB,QAAQ,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;gBACpB,QAAQ,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;gBACpB,QAAQ,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;gBACpB,QAAQ,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;gBACpB,QAAQ,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;gBACpB,QAAQ,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;gBACpB,QAAQ,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;gBACpB,QAAQ,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;gBACpB,QAAQ,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;gBACpB,QAAQ,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;gBACpB,QAAQ,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;gBACpB,SAAS;YACX,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5B,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;oBAClB,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;gBACrB,CAAC;gBACD,CAAC,MAAM,CAAC,CAAC;gBACT,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;oBACZ,MAAM;gBACR,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACI,OAAO;QACZ,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACjC,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;;OAKG;IACI,gBAAgB,CAAC,UAAkB,EAAE,OAAe;QACzD,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,OAAO,CAAC;IACpC,CAAC;IAED;;;;OAIG;IACI,gBAAgB,CAAC,UAAkB,EAAE,OAAe;QACzD,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,OAAO,CAAC;IACnC,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAkCG;IACI,mBAAmB,CAAC,cAAsB;QAC/C,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC5B,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACZ,SAAS;YACX,CAAC;YACD,SAAS,CAAC,IAAI,CAAC,IAAI,cAAc,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC1D,CAAC;QACD,OAAO,SAAS,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChE,CAAC;CACF;AAED;;;;;;;;;;GAUG;AACH,MAAM,OAAO,MAAM;IAMjB;IACE,gDAAgD;IAChC,KAAa;QAAb,UAAK,GAAL,KAAK,CAAQ;QAE7B,IAAI,CAAC,UAAU,GAAG,KAAK,KAAK,CAAC,CAAC;QAC9B,IAAI,CAAC,OAAO,GAAG,CAAC,IAAI,KAAK,CAAC;IAC5B,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,KAAa;QACzB,OAAO,IAAI,CAAC,UAAU,KAAK,KAAK,CAAC,UAAU,IAAI,IAAI,CAAC,OAAO,KAAK,KAAK,CAAC,OAAO,CAAC;IAChF,CAAC;CACF"}

package/dist/util/dense_set.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/util/dense_set.js

@@ -0,0 +1,90 @@
+/**
+ * A `Set<T>` whose members are kept in a dense backing array so iteration is a
+ * tight indexed loop rather than a hash-table walk.
+ *
+ * Membership is tracked in a side `Map<T, number>` that records each element's
+ * slot, so `add` is a push and `delete` swaps the last element into the vacated
+ * slot and pops — both O(1) and without the tombstone slots a churned native
+ * `Set` accumulates. The swap means iteration order is **not** insertion order
+ * after a deletion; that is fine for query membership, whose order is
+ * unspecified unless `Query.sort` is used (which keeps an {@link OrderedSet}
+ * instead).
+ *
+ * @internal Used only inside the package.
+ *
+ * @typeParam T - Element type stored in the set.
+ */
+export class DenseSet {
+    constructor() {
+        this._items = [];
+        this._slot = new Map();
+    }
+    /** Number of elements currently stored. */
+    get size() {
+        return this._items.length;
+    }
+    /** Tag used by `Object.prototype.toString` for stringification. */
+    get [Symbol.toStringTag]() {
+        return "DenseSet";
+    }
+    /** Insert `value` if not already present. */
+    add(value) {
+        if (!this._slot.has(value)) {
+            this._slot.set(value, this._items.length);
+            this._items.push(value);
+        }
+        return this;
+    }
+    /** Return `true` when `value` is a member. */
+    has(value) {
+        return this._slot.has(value);
+    }
+    /**
+     * Remove `value`. Returns `true` if it was present. The last element is
+     * swapped into the vacated slot, so surviving order may change.
+     */
+    delete(value) {
+        const i = this._slot.get(value);
+        if (i === undefined) {
+            return false;
+        }
+        const last = this._items.pop();
+        if (last !== value) {
+            this._items[i] = last;
+            this._slot.set(last, i);
+        }
+        this._slot.delete(value);
+        return true;
+    }
+    /** Remove every element. */
+    clear() {
+        this._items.length = 0;
+        this._slot.clear();
+    }
+    /** Visit each element (current order) without allocating an iterator. */
+    forEach(callbackfn, thisArg) {
+        const items = this._items;
+        for (let i = 0; i < items.length; i++) {
+            callbackfn.call(thisArg, items[i], items[i], this);
+        }
+    }
+    /** Iterator over elements in current order. */
+    [Symbol.iterator]() {
+        return this._items[Symbol.iterator]();
+    }
+    /** Iterator yielding `[value, value]` pairs. */
+    *entries() {
+        for (const item of this._items) {
+            yield [item, item];
+        }
+    }
+    /** Iterator over elements in current order. */
+    keys() {
+        return this._items[Symbol.iterator]();
+    }
+    /** Iterator over elements in current order. */
+    values() {
+        return this._items[Symbol.iterator]();
+    }
+}
+//# sourceMappingURL=dense_set.js.map

package/dist/util/dense_set.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dense_set.js","sourceRoot":"","sources":["../../src/util/dense_set.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AACH,MAAM,OAAO,QAAQ;IAArB;QACmB,WAAM,GAAQ,EAAE,CAAC;QACjB,UAAK,GAAG,IAAI,GAAG,EAAa,CAAC;IA+EhD,CAAC;IA7EC,2CAA2C;IAC3C,IAAW,IAAI;QACb,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC5B,CAAC;IAED,mEAAmE;IACnE,IAAW,CAAC,MAAM,CAAC,WAAW,CAAC;QAC7B,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,6CAA6C;IACtC,GAAG,CAAC,KAAQ;QACjB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAC3B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC1C,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC1B,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,8CAA8C;IACvC,GAAG,CAAC,KAAQ;QACjB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC/B,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,KAAQ;QACpB,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACpB,OAAO,KAAK,CAAC;QACf,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,EAAG,CAAC;QAChC,IAAI,IAAI,KAAK,KAAK,EAAE,CAAC;YACnB,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YACtB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC1B,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACzB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,4BAA4B;IACrB,KAAK;QACV,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IACrB,CAAC;IAED,yEAAyE;IAClE,OAAO,CAAC,UAAsD,EAAE,OAAiB;QACtF,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QACrD,CAAC;IACH,CAAC;IAED,+CAA+C;IACxC,CAAC,MAAM,CAAC,QAAQ,CAAC;QACtB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;IACxC,CAAC;IAED,gDAAgD;IACzC,CAAC,OAAO;QACb,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC/B,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IAED,+CAA+C;IACxC,IAAI;QACT,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;IACxC,CAAC;IAED,+CAA+C;IACxC,MAAM;QACX,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;IACxC,CAAC;CACF"}

package/dist/util/id_pool.d.ts

@@ -0,0 +1,23 @@
+export interface IdPoolConfig {
+    name: string;
+    min: number;
+    max?: number;
+}
+export declare class IdPool {
+    readonly name: string;
+    readonly min: number;
+    readonly max: number | undefined;
+    private _bits;
+    private _freeBelowNext;
+    private _lowest;
+    private _minFreeWord;
+    private _next;
+    constructor(name: string, min: number, max: number | undefined);
+    alloc(): number;
+    free(id: number): void;
+    owns(id: number): boolean;
+    peek(): number;
+    reserve(id: number): void;
+    private _growBits;
+}
+export declare function validateIdPoolConfigs(configs: readonly IdPoolConfig[]): void;

package/dist/util/id_pool.js

@@ -0,0 +1,194 @@
+export class IdPool {
+    constructor(name, min, max) {
+        this.name = name;
+        this.min = min;
+        this.max = max;
+        // Occupancy bitmap: bit `(id - min)` is 1 iff `id` is currently reserved.
+        // Stored as a growable plain-number array (V8 keeps these as SMIs / packed
+        // double-tagged words, which gives the fastest random-access read/write).
+        this._bits = [];
+        // Number of reserved ids strictly below `_next`. When zero, alloc can skip
+        // the bitmap scan entirely and just hand out the next never-used id.
+        this._freeBelowNext = 0;
+        // Cached "lowest free id below `_next`", or -1 when not known. The
+        // free/alloc/free/alloc churn pattern hits this on every call and lets
+        // alloc skip the bitmap word walk.
+        this._lowest = -1;
+        // Word cursor: the lowest word index in `_bits` that *might* contain a 0
+        // bit below `_next`. Pure hint - alloc walks forward from here. Bumped
+        // up when alloc fills a word to all-ones and pulled back down by free.
+        this._minFreeWord = 0;
+        this._next = min;
+    }
+    alloc() {
+        const cached = this._lowest;
+        if (cached !== -1) {
+            this._lowest = -1;
+            const offset = cached - this.min;
+            const word = offset >>> 5;
+            this._bits[word] = this._bits[word] | (1 << offset);
+            this._freeBelowNext--;
+            return cached;
+        }
+        if (this._freeBelowNext > 0) {
+            const bits = this._bits;
+            let word = this._minFreeWord;
+            while (bits[word] === -1) {
+                word++;
+            }
+            const w = bits[word];
+            const bit = ctz32(~w);
+            const nw = w | (1 << bit);
+            bits[word] = nw;
+            this._minFreeWord = nw === -1 ? word + 1 : word;
+            this._freeBelowNext--;
+            return this.min + word * 32 + bit;
+        }
+        const max = this.max;
+        let id = this._next;
+        while (max === undefined || id <= max) {
+            const offset = id - this.min;
+            const word = offset >>> 5;
+            const mask = 1 << offset;
+            this._growBits(word + 1);
+            const cur = this._bits[word];
+            if ((cur & mask) === 0) {
+                this._bits[word] = cur | mask;
+                this._next = id + 1;
+                return id;
+            }
+            id++;
+        }
+        throw new Error(`Id pool '${this.name}' is exhausted`);
+    }
+    free(id) {
+        if (!this.owns(id)) {
+            throw new Error(`Id ${id} does not belong to pool '${this.name}'`);
+        }
+        const offset = id - this.min;
+        const word = offset >>> 5;
+        if (word >= this._bits.length) {
+            return;
+        }
+        const mask = 1 << offset;
+        const cur = this._bits[word];
+        if ((cur & mask) === 0) {
+            return;
+        }
+        this._bits[word] = cur & ~mask;
+        if (id < this._next) {
+            this._freeBelowNext++;
+            if (word < this._minFreeWord) {
+                this._minFreeWord = word;
+            }
+            // Cache slot: track the lowest free id we've seen. If a lower id was
+            // already cached, push it back into the "anonymous" bitmap pool and
+            // promote `id`. Otherwise, if no lower-than-id is cached, take the
+            // slot.
+            const lowest = this._lowest;
+            if (lowest === -1 || id < lowest) {
+                this._lowest = id;
+            }
+        }
+    }
+    owns(id) {
+        return id >= this.min && (this.max === undefined || id <= this.max);
+    }
+    peek() {
+        if (this._lowest !== -1) {
+            return this._lowest;
+        }
+        if (this._freeBelowNext > 0) {
+            const bits = this._bits;
+            let word = this._minFreeWord;
+            while (bits[word] === -1) {
+                word++;
+            }
+            return this.min + word * 32 + ctz32(~bits[word]);
+        }
+        const max = this.max;
+        let id = this._next;
+        while (max === undefined || id <= max) {
+            const offset = id - this.min;
+            const word = offset >>> 5;
+            const mask = 1 << offset;
+            if (word >= this._bits.length || (this._bits[word] & mask) === 0) {
+                return id;
+            }
+            id++;
+        }
+        throw new Error(`Id pool '${this.name}' is exhausted`);
+    }
+    reserve(id) {
+        if (!this.owns(id)) {
+            throw new Error(`Id ${id} does not belong to pool '${this.name}'`);
+        }
+        const offset = id - this.min;
+        const word = offset >>> 5;
+        this._growBits(word + 1);
+        const mask = 1 << offset;
+        const cur = this._bits[word];
+        if ((cur & mask) !== 0) {
+            throw new Error(`Id ${id} is already reserved`);
+        }
+        this._bits[word] = cur | mask;
+        if (id < this._next) {
+            this._freeBelowNext--;
+        }
+        if (this._lowest === id) {
+            this._lowest = -1;
+        }
+    }
+    _growBits(length) {
+        const bits = this._bits;
+        while (bits.length < length) {
+            bits.push(0);
+        }
+    }
+}
+function ctz32(x) {
+    // For x with at least one set bit, returns the index of the lowest set bit.
+    // The IdPool callers guarantee the input has at least one set bit.
+    return 31 - Math.clz32(x & -x);
+}
+export function validateIdPoolConfigs(configs) {
+    if (configs.length === 0) {
+        throw new Error("At least one id pool is required");
+    }
+    const names = new Set();
+    let openEndedCount = 0;
+    let expectedMin = 1;
+    configs.forEach((config, index) => {
+        if (names.has(config.name)) {
+            throw new Error(`Duplicate id pool name '${config.name}'`);
+        }
+        names.add(config.name);
+        if (!Number.isSafeInteger(config.min) || config.min <= 0) {
+            throw new Error(`Id pool '${config.name}' must start at a positive integer`);
+        }
+        if (config.min !== expectedMin) {
+            throw new Error(`Id pools must cover 1..Infinity without holes`);
+        }
+        if (config.max === undefined) {
+            openEndedCount++;
+            if (index !== configs.length - 1) {
+                throw new Error("Only the final id pool may be open-ended");
+            }
+            return;
+        }
+        if (!Number.isSafeInteger(config.max) || config.max <= 0) {
+            throw new Error(`Id pool '${config.name}' max must be a positive integer`);
+        }
+        if (config.max < config.min) {
+            throw new Error(`Id pool '${config.name}' max must be >= min`);
+        }
+        expectedMin = config.max + 1;
+    });
+    if (openEndedCount !== 1) {
+        throw new Error("Exactly one id pool must be open-ended");
+    }
+    if (!names.has("component") || !names.has("module") || !names.has("entity")) {
+        throw new Error("Id pools must include 'component', 'module', and 'entity'");
+    }
+}
+//# sourceMappingURL=id_pool.js.map

package/dist/util/id_pool.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"id_pool.js","sourceRoot":"","sources":["../../src/util/id_pool.ts"],"names":[],"mappings":"AAMA,MAAM,OAAO,MAAM;IAoBjB,YACkB,IAAY,EACZ,GAAW,EACX,GAAuB;QAFvB,SAAI,GAAJ,IAAI,CAAQ;QACZ,QAAG,GAAH,GAAG,CAAQ;QACX,QAAG,GAAH,GAAG,CAAoB;QAtBzC,0EAA0E;QAC1E,2EAA2E;QAC3E,0EAA0E;QAClE,UAAK,GAAa,EAAE,CAAC;QAC7B,2EAA2E;QAC3E,qEAAqE;QAC7D,mBAAc,GAAG,CAAC,CAAC;QAC3B,mEAAmE;QACnE,uEAAuE;QACvE,mCAAmC;QAC3B,YAAO,GAAG,CAAC,CAAC,CAAC;QACrB,yEAAyE;QACzE,uEAAuE;QACvE,uEAAuE;QAC/D,iBAAY,GAAG,CAAC,CAAC;QAUvB,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC;IACnB,CAAC;IAEM,KAAK;QACV,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QAC5B,IAAI,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC;YAClB,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;YAClB,MAAM,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC;YACjC,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,CAAC;YAC1B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC;YACpD,IAAI,CAAC,cAAc,EAAE,CAAC;YACtB,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,IAAI,IAAI,CAAC,cAAc,GAAG,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACxB,IAAI,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC;YAC7B,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;gBACzB,IAAI,EAAE,CAAC;YACT,CAAC;YACD,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;YACrB,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACtB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;YAC1B,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;YAChB,IAAI,CAAC,YAAY,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YAChD,IAAI,CAAC,cAAc,EAAE,CAAC;YACtB,OAAO,IAAI,CAAC,GAAG,GAAG,IAAI,GAAG,EAAE,GAAG,GAAG,CAAC;QACpC,CAAC;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;QACrB,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC;QACpB,OAAO,GAAG,KAAK,SAAS,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC;YACtC,MAAM,MAAM,GAAG,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC;YAC7B,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,CAAC;YAC1B,MAAM,IAAI,GAAG,CAAC,IAAI,MAAM,CAAC;YACzB,IAAI,CAAC,SAAS,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;YACzB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC7B,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACvB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC;gBAC9B,IAAI,CAAC,KAAK,GAAG,EAAE,GAAG,CAAC,CAAC;gBACpB,OAAO,EAAE,CAAC;YACZ,CAAC;YACD,EAAE,EAAE,CAAC;QACP,CAAC;QACD,MAAM,IAAI,KAAK,CAAC,YAAY,IAAI,CAAC,IAAI,gBAAgB,CAAC,CAAC;IACzD,CAAC;IAEM,IAAI,CAAC,EAAU;QACpB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACnB,MAAM,IAAI,KAAK,CAAC,MAAM,EAAE,6BAA6B,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QACrE,CAAC;QACD,MAAM,MAAM,GAAG,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC;QAC7B,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,CAAC;QAC1B,IAAI,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YAC9B,OAAO;QACT,CAAC;QACD,MAAM,IAAI,GAAG,CAAC,IAAI,MAAM,CAAC;QACzB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC7B,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO;QACT,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC;QAC/B,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YACpB,IAAI,CAAC,cAAc,EAAE,CAAC;YACtB,IAAI,IAAI,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;gBAC7B,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;YAC3B,CAAC;YACD,qEAAqE;YACrE,oEAAoE;YACpE,mEAAmE;YACnE,QAAQ;YACR,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;YAC5B,IAAI,MAAM,KAAK,CAAC,CAAC,IAAI,EAAE,GAAG,MAAM,EAAE,CAAC;gBACjC,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;YACpB,CAAC;QACH,CAAC;IACH,CAAC;IAEM,IAAI,CAAC,EAAU;QACpB,OAAO,EAAE,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,SAAS,IAAI,EAAE,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC;IACtE,CAAC;IAEM,IAAI;QACT,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC;YACxB,OAAO,IAAI,CAAC,OAAO,CAAC;QACtB,CAAC;QACD,IAAI,IAAI,CAAC,cAAc,GAAG,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACxB,IAAI,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC;YAC7B,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;gBACzB,IAAI,EAAE,CAAC;YACT,CAAC;YACD,OAAO,IAAI,CAAC,GAAG,GAAG,IAAI,GAAG,EAAE,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QACnD,CAAC;QAED,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;QACrB,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC;QACpB,OAAO,GAAG,KAAK,SAAS,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC;YACtC,MAAM,MAAM,GAAG,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC;YAC7B,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,CAAC;YAC1B,MAAM,IAAI,GAAG,CAAC,IAAI,MAAM,CAAC;YACzB,IAAI,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACjE,OAAO,EAAE,CAAC;YACZ,CAAC;YACD,EAAE,EAAE,CAAC;QACP,CAAC;QACD,MAAM,IAAI,KAAK,CAAC,YAAY,IAAI,CAAC,IAAI,gBAAgB,CAAC,CAAC;IACzD,CAAC;IAEM,OAAO,CAAC,EAAU;QACvB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACnB,MAAM,IAAI,KAAK,CAAC,MAAM,EAAE,6BAA6B,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QACrE,CAAC;QACD,MAAM,MAAM,GAAG,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC;QAC7B,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,CAAC;QAC1B,IAAI,CAAC,SAAS,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;QACzB,MAAM,IAAI,GAAG,CAAC,IAAI,MAAM,CAAC;QACzB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC7B,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,MAAM,EAAE,sBAAsB,CAAC,CAAC;QAClD,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC;QAC9B,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YACpB,IAAI,CAAC,cAAc,EAAE,CAAC;QACxB,CAAC;QACD,IAAI,IAAI,CAAC,OAAO,KAAK,EAAE,EAAE,CAAC;YACxB,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAEO,SAAS,CAAC,MAAc;QAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,OAAO,IAAI,CAAC,MAAM,GAAG,MAAM,EAAE,CAAC;YAC5B,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACf,CAAC;IACH,CAAC;CACF;AAED,SAAS,KAAK,CAAC,CAAS;IACtB,4EAA4E;IAC5E,mEAAmE;IACnE,OAAO,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACjC,CAAC;AAED,MAAM,UAAU,qBAAqB,CAAC,OAAgC;IACpE,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;IACtD,CAAC;IAED,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;QAChC,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;YAC3B,MAAM,IAAI,KAAK,CAAC,2BAA2B,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;QAC7D,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAEvB,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;YACzD,MAAM,IAAI,KAAK,CAAC,YAAY,MAAM,CAAC,IAAI,oCAAoC,CAAC,CAAC;QAC/E,CAAC;QACD,IAAI,MAAM,CAAC,GAAG,KAAK,WAAW,EAAE,CAAC;YAC/B,MAAM,IAAI,KAAK,CAAC,+CAA+C,CAAC,CAAC;QACnE,CAAC;QAED,IAAI,MAAM,CAAC,GAAG,KAAK,SAAS,EAAE,CAAC;YAC7B,cAAc,EAAE,CAAC;YACjB,IAAI,KAAK,KAAK,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACjC,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;YAC9D,CAAC;YACD,OAAO;QACT,CAAC;QAED,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;YACzD,MAAM,IAAI,KAAK,CAAC,YAAY,MAAM,CAAC,IAAI,kCAAkC,CAAC,CAAC;QAC7E,CAAC;QACD,IAAI,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,EAAE,CAAC;YAC5B,MAAM,IAAI,KAAK,CAAC,YAAY,MAAM,CAAC,IAAI,sBAAsB,CAAC,CAAC;QACjE,CAAC;QACD,WAAW,GAAG,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAI,cAAc,KAAK,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;IAC5D,CAAC;IACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC5E,MAAM,IAAI,KAAK,CAAC,2DAA2D,CAAC,CAAC;IAC/E,CAAC;AACH,CAAC"}

package/dist/world/index.d.ts

@@ -0,0 +1,3 @@
+export { type WorldOptions } from "./world.base.js";
+export { DEFAULT_POOLS } from "./world.pools.js";
+export { World } from "./world.js";

package/dist/world/index.js

@@ -0,0 +1,3 @@
+export { DEFAULT_POOLS } from "./world.pools.js";
+export { World } from "./world.js";
+//# sourceMappingURL=index.js.map

package/dist/world/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/world/index.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC"}

package/dist/world/world.base.d.ts

@@ -0,0 +1,6 @@
+import { type IdPoolConfig } from "../util/id_pool.js";
+export interface WorldOptions {
+    idPools?: readonly IdPoolConfig[];
+}
+export declare class Base {
+}

package/dist/world/world.base.js

@@ -0,0 +1,21 @@
+export class Base {
+    constructor() {
+        /**
+         * @internal Per-world registry mapping a component class to its
+         * component-entity. The registry is per-world so the lookup stays off the
+         * global component class objects while keeping repeated class lookups fast.
+         */
+        this._classRegistry = new Map();
+        /**
+         * @internal Name -> entity index populated by {@link IdentityModule} hooks.
+         * Duplicate names are last-writer-wins.
+         */
+        this._identityNameIndex = new Map();
+        /**
+         * @internal Tracks the last indexed name per entity so that renames,
+         * removals, and destroy cleanup can delete stale entries safely.
+         */
+        this._identityIndexedNames = new WeakMap();
+    }
+}
+//# sourceMappingURL=world.base.js.map

package/dist/world/world.base.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"world.base.js","sourceRoot":"","sources":["../../src/world/world.base.ts"],"names":[],"mappings":"AAOA,MAAM,OAAO,IAAI;IAAjB;QACE;;;;WAIG;QACa,mBAAc,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE3D;;;WAGG;QACa,uBAAkB,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE/D;;;WAGG;QACa,0BAAqB,GAAG,IAAI,OAAO,EAAkB,CAAC;IAexE,CAAC;CAAA"}

package/dist/world/world.components.d.ts

@@ -0,0 +1,67 @@
+import { Component, type ComponentClass, type ComponentType } from "../component.js";
+import { Entities } from "./world.entities.js";
+import { type World } from "./world.js";
+export declare class Components extends Entities {
+    /**
+     * Register a component class with this world, or look up a previously
+     * registered component entity.
+     *
+     * On the first call with a given class, a new `Component` entity is created
+     * and its id is drawn from the `"component"` id pool (1–899 by default).
+     * Subsequent calls with the same class return the same entity. The same class
+     * may be registered independently in multiple worlds.
+     *
+     * Pass an explicit numeric `eid` to pin the component to a server-assigned
+     * stable id instead of auto-allocating one.
+     *
+     * Passing a **string** resolves an already-registered component entity by
+     * name (set via `world.component(C).name = "..."`). Throws if no entity with
+     * that name exists or if the named entity is not a `Component` entity.
+     *
+     * After {@link start} (or {@link disableComponentRegistration}), registering a
+     * new class throws.
+     *
+     * @param ComponentClass - The component class to register or retrieve.
+     * @param eid - Optional explicit numeric entity id.
+     * @returns The `Component` entity for the given class.
+     *
+     * @example
+     * ```ts
+     * world.component(Position);               // register and auto-assign id
+     * world.component(Position, 42);           // register with explicit id 42
+     * const meta = world.component(Position).ownMeta; // access metadata
+     * world.component(Position).name = "Position";
+     * world.component("Position");             // look up by name
+     * ```
+     */
+    component<T extends ComponentType>(this: World, ComponentClass: T, eid?: number): Component<T>;
+    component(this: World, name: string): Component;
+    /** Prevent any further calls to {@link component}. */
+    disableComponentRegistration(): void;
+    /**
+     * Read the singleton data stored on the component entity for `Class`.
+     *
+     * This is a convenience shorthand for `world.component(Class).get(Class)`.
+     * Use it when you store world-global state as a component on the component
+     * entity itself (the Singleton pattern).
+     *
+     * @param Class - Registered component class.
+     * @returns The component instance stored on the component entity, or
+     *   `undefined` when none has been set.
+     */
+    get<C extends ComponentClass>(this: World, Class: C): Readonly<InstanceType<C>> | undefined;
+    /**
+     * Attach or update the singleton data stored on the component entity for `Class`.
+     *
+     * Shorthand for `world.component(Class).set(Class, props)`. Stores `props`
+     * on the component entity itself so the data can be retrieved globally via
+     * {@link get}.
+     *
+     * @param Class - Registered component class.
+     * @param props - Properties to merge onto the component instance.
+     * @returns The `Component` entity, for chaining.
+     */
+    set<C extends ComponentClass>(this: World, Class: C, props: Partial<InstanceType<C>>): Component<C>;
+    /** Declare a group of mutually exclusive components. */
+    setExclusiveComponents(this: World, ...components: ComponentClass[]): void;
+}