@vworlds/vecs 1.0.10 → 1.0.11

package/dist/util/array_map.d.ts

@@ -1,58 +1,7 @@
 /**
- * A `Map<number, T>` backed by a sparse JavaScript array.
+ * Read-only view of an {@link ArrayMap}: the mutating methods `set`, `delete`,
+ * and `clear` are omitted.
  *
- * For small, dense integer key spaces this is significantly faster than
- * `Map` because array index access avoids the hash-table overhead. Used
- * internally to store per-entity component instances and per-type component
- * metadata.
- *
- * Keys must be non-negative integers. Gaps in the key space are represented
- * as `undefined` slots and do not count toward `size`.
- *
- * @typeParam T - The value type stored in the map.
+ * @typeParam T - Value type stored in the map.
  */
-export declare class ArrayMap<T> {
-    private backend;
-    private _size;
-    constructor();
-    /**
-     * Store `value` at `key`, replacing any existing value.
-     *
-     * @param key - Non-negative integer key.
-     * @param value - Value to store.
-     */
-    set(key: number, value: T): void;
-    /**
-     * Return the value stored at `key`, or `undefined` if not present.
-     *
-     * @param key - Non-negative integer key.
-     */
-    get(key: number): T | undefined;
-    /**
-     * Remove the entry at `key`. Does nothing if `key` is not present.
-     *
-     * @param key - Non-negative integer key.
-     */
-    delete(key: number): void;
-    /**
-     * Return `true` if an entry exists at `key`.
-     *
-     * @param key - Non-negative integer key.
-     */
-    has(key: number): boolean;
-    /**
-     * Iterate over all present entries.
-     *
-     * Undefined slots are skipped; the callback is only called for keys that
-     * have an associated value.
-     *
-     * @param callback - Called with `(value, key, map)` for each entry.
-     */
-    forEach(callback: (value: T, key: number, map: ArrayMap<T>) => void): void;
-    /**
-     * Remove all entries and reset the size to zero.
-     */
-    clear(): void;
-    /** The number of entries currently in the map. */
-    get size(): number;
-}
+export type ReadonlyArrayMap<T> = Omit<ArrayMap<T>, "set" | "delete" | "clear">;

package/dist/util/array_map.js

@@ -1,84 +1,82 @@
 /**
- * A `Map<number, T>` backed by a sparse JavaScript array.
+ * A `Map<number, T>` substitute backed by a sparse JavaScript array.
  *
- * For small, dense integer key spaces this is significantly faster than
- * `Map` because array index access avoids the hash-table overhead. Used
- * internally to store per-entity component instances and per-type component
- * metadata.
+ * For small, dense, non-negative integer key spaces, indexing into a regular
+ * array is faster than the hash-table lookups performed by the built-in
+ * `Map`. `ArrayMap` is used inside the ECS to store per-entity component
+ * instances and per-type metadata.
  *
- * Keys must be non-negative integers. Gaps in the key space are represented
- * as `undefined` slots and do not count toward `size`.
+ * Empty slots are represented as `undefined` and do not count toward
+ * {@link size}.
  *
- * @typeParam T - The value type stored in the map.
+ * @internal Used only inside the package.
+ *
+ * @typeParam T - Value type stored in the map.
  */
 export class ArrayMap {
     constructor() {
-        this.backend = [];
+        this._backend = [];
         this._size = 0;
     }
+    /** The number of entries currently in the map. */
+    get size() {
+        return this._size;
+    }
     /**
-     * Store `value` at `key`, replacing any existing value.
+     * Insert or replace the value at `key`.
      *
      * @param key - Non-negative integer key.
      * @param value - Value to store.
      */
     set(key, value) {
-        if (this.backend[key] === undefined) {
+        if (this._backend[key] === undefined) {
             this._size++;
         }
-        this.backend[key] = value;
+        this._backend[key] = value;
     }
     /**
-     * Return the value stored at `key`, or `undefined` if not present.
+     * Retrieve the value stored at `key`, or `undefined` if no entry exists.
      *
      * @param key - Non-negative integer key.
      */
     get(key) {
-        return this.backend[key];
+        return this._backend[key];
     }
     /**
-     * Remove the entry at `key`. Does nothing if `key` is not present.
+     * Return `true` when an entry exists at `key`.
      *
      * @param key - Non-negative integer key.
      */
-    delete(key) {
-        if (this.backend[key] !== undefined) {
-            this.backend[key] = undefined;
-            this._size--;
-        }
+    has(key) {
+        return this._backend[key] !== undefined;
     }
     /**
-     * Return `true` if an entry exists at `key`.
+     * Remove the entry at `key`. Does nothing if no entry exists there.
      *
      * @param key - Non-negative integer key.
      */
-    has(key) {
-        return this.backend[key] !== undefined;
+    delete(key) {
+        if (this._backend[key] !== undefined) {
+            this._backend[key] = undefined;
+            this._size--;
+        }
     }
     /**
-     * Iterate over all present entries.
-     *
-     * Undefined slots are skipped; the callback is only called for keys that
-     * have an associated value.
+     * Visit every present entry in ascending key order. Empty slots are skipped.
      *
-     * @param callback - Called with `(value, key, map)` for each entry.
+     * @param callback - Invoked with `(value, key, map)` for each entry.
      */
     forEach(callback) {
-        this.backend.forEach((value, index) => {
+        this._backend.forEach((value, index) => {
             if (value !== undefined) {
                 callback(value, index, this);
             }
         });
     }
-    /**
-     * Remove all entries and reset the size to zero.
-     */
+    /** Remove all entries and reset {@link size} to zero. */
     clear() {
-        this.backend.length = 0;
-    }
-    /** The number of entries currently in the map. */
-    get size() {
-        return this._size;
+        this._backend.length = 0;
+        this._size = 0;
     }
 }
 //# sourceMappingURL=array_map.js.map

package/dist/util/array_map.js.map

@@ -1 +1 @@
-{"version":3,"file":"array_map.js","sourceRoot":"","sources":["../../src/util/array_map.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AACH,MAAM,OAAO,QAAQ;IAInB;QACE,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,CAAC;IAED;;;;;OAKG;IACH,GAAG,CAAC,GAAW,EAAE,KAAQ;QACvB,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE;YACnC,IAAI,CAAC,KAAK,EAAE,CAAC;SACd;QACD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;IAC5B,CAAC;IAED;;;;OAIG;IACH,GAAG,CAAC,GAAW;QACb,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC3B,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,GAAW;QAChB,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE;YACnC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;YAC9B,IAAI,CAAC,KAAK,EAAE,CAAC;SACd;IACH,CAAC;IAED;;;;OAIG;IACH,GAAG,CAAC,GAAW;QACb,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC;IACzC,CAAC;IAED;;;;;;;OAOG;IACH,OAAO,CAAC,QAA2D;QACjE,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;YACpC,IAAI,KAAK,KAAK,SAAS,EAAE;gBACvB,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;aAC9B;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;IAC1B,CAAC;IAED,kDAAkD;IAClD,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;CACF"}
+{"version":3,"file":"array_map.js","sourceRoot":"","sources":["../../src/util/array_map.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AACH,MAAM,OAAO,QAAQ;IAArB;QACU,aAAQ,GAAsB,EAAE,CAAC;QACjC,UAAK,GAAW,CAAC,CAAC;IAoE5B,CAAC;IAlEC,kDAAkD;IAClD,IAAW,IAAI;QACb,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED;;;;;OAKG;IACI,GAAG,CAAC,GAAW,EAAE,KAAQ;QAC9B,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE;YACpC,IAAI,CAAC,KAAK,EAAE,CAAC;SACd;QACD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;IAC7B,CAAC;IAED;;;;OAIG;IACI,GAAG,CAAC,GAAW;QACpB,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;IAC5B,CAAC;IAED;;;;OAIG;IACI,GAAG,CAAC,GAAW;QACpB,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC;IAC1C,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,GAAW;QACvB,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE;YACpC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;YAC/B,IAAI,CAAC,KAAK,EAAE,CAAC;SACd;IACH,CAAC;IAED;;;;OAIG;IACI,OAAO,CAAC,QAA2D;QACxE,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;YACrC,IAAI,KAAK,KAAK,SAAS,EAAE;gBACvB,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;aAC9B;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAED,yDAAyD;IAClD,KAAK;QACV,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,CAAC;CACF"}

package/dist/util/bitset.d.ts

@@ -2,93 +2,79 @@
  * A compact, growable set of non-negative integers backed by an array of
  * 32-bit words.
  *
- * Used internally to represent entity archetypes (the set of component type
- * ids attached to an entity) and system watchlists. Exposed in the public API
- * so that component data can use it for bit-flag fields:
+ * `Bitset` is the data structure the ECS uses to represent entity archetypes
+ * (the set of component type ids attached to an entity) and watchlists
+ * (the set of component types a query reacts to).
+ *
+ * It is exported in the public API so component data can use it for
+ * compact bit-flag fields:
  *
  * ```ts
  * class Tags extends Component {
- *   tags    = new Bitset();
- *   oldTags = new Bitset();
+ *   tags = new Bitset();
  * }
  *
- * // Check a specific tag bit:
+ * tags.tags.add(TAG_VISIBLE);
  * if (tags.tags.has(TAG_VISIBLE)) { ... }
  * ```
  */
 export declare class Bitset {
-    /** @internal */
-    _bits: number[];
-    constructor();
-    /**
-     * Return `true` if this bitset and `other` have exactly the same bits set.
-     */
-    equal(other: Bitset): boolean;
     /**
-     * OR the given `bitmask` word into the word at position `arrayIndex`.
-     *
-     * @internal Low-level bulk operation; prefer {@link add} for single bits.
-     */
-    addIndexBitmask(arrayIndex: number, bitmask: number): void;
-    /**
-     * Replace the word at position `arrayIndex` with `bitmask`.
+     * Set bit `n`.
      *
-     * @internal Used by network deserialization to set a whole word at once.
+     * @param n - Non-negative integer bit index.
      */
-    setIndexBitmask(arrayIndex: number, bitmask: number): void;
+    add(n: number): void;
     /**
      * Set the bit described by `bptr` (fast path using a pre-computed
      * {@link BitPtr}).
+     *
+     * @param bptr - Pre-computed pointer to a bit position.
      */
     addBit(bptr: BitPtr): void;
     /**
-     * Set bit `n`.
+     * Clear bit `n`. Trailing zero words are trimmed so the internal storage
+     * stays compact.
      *
      * @param n - Non-negative integer bit index.
      */
-    add(n: number): void;
+    delete(n: number): void;
     /**
-     * Clear bit `n`.
-     *
-     * Trailing zero words are trimmed so that the internal array stays compact.
+     * Return `true` when bit `n` is set.
      *
      * @param n - Non-negative integer bit index.
      */
-    delete(n: number): void;
-    /**
-     * Return `true` if the bit described by `bptr` is set (fast path).
-     */
-    hasBit(bptr: BitPtr): boolean;
+    has(n: number): boolean;
     /**
-     * Return `true` if bit `n` is set.
+     * Return `true` when the bit described by `bptr` is set (fast path).
      *
-     * @param n - Non-negative integer bit index.
+     * @param bptr - Pre-computed pointer to a bit position.
      */
-    has(n: number): boolean;
+    hasBit(bptr: BitPtr): boolean;
     /**
-     * Return `true` if the given word-level bitmask is fully set at `arrayIndex`.
+     * Return `true` when this bitset and `other` have exactly the same bits set.
      *
-     * @internal
+     * @param other - Bitset to compare against.
      */
-    hasIndexBitmask(arrayIndex: number, bitmask: number): boolean;
+    equal(other: Bitset): boolean;
     /**
-     * Return `true` if every bit set in `other` is also set in `this` (i.e.
-     * `other` is a subset of `this`).
+     * Return `true` when every bit set in `other` is also set in this bitset
+     * (i.e. `other` is a subset of `this`).
      *
      * Used by the world to test whether an entity's archetype satisfies a
-     * system's `HAS` query.
+     * `HAS` query.
+     *
+     * @param other - Bitset whose set bits must all appear in this bitset.
      */
     hasBitset(other: Bitset): boolean;
     /**
-     * Iterate over every set bit index in ascending order.
+     * Visit each set bit index in ascending order.
      *
-     * @param callback - Called with each set bit index.
+     * @param callback - Invoked once per set bit.
      */
     forEach(callback: (n: number) => void): void;
     /**
-     * Return an array of all set bit indices in ascending order.
-     *
-     * @returns `number[]` of set bit positions.
+     * Return an array of every set bit index in ascending order.
      */
     indices(): number[];
 }
@@ -96,12 +82,12 @@ export declare class Bitset {
  * A pre-computed pointer into a {@link Bitset}'s internal word array.
  *
  * Computing `arrayIndex` and `bitmask` from a raw bit index requires a floor
- * division and a bitshift. `BitPtr` caches those values so that hot-path
+ * division and a bit shift. `BitPtr` caches both values so that hot-path
  * archetype checks ({@link Bitset.hasBit}, {@link Bitset.addBit}) avoid
  * repeating the arithmetic on every entity update.
  *
- * A `BitPtr` is created once per component type and stored on
- * {@link ComponentMeta.bitPtr}.
+ * One `BitPtr` is created per registered component type and stored on
+ * `ComponentMeta.bitPtr`.
  */
 export declare class BitPtr {
     /** The raw bit index this pointer refers to. */
@@ -113,6 +99,10 @@ export declare class BitPtr {
     constructor(
     /** The raw bit index this pointer refers to. */
     value: number);
-    /** Return `true` if both pointers refer to the same bit position. */
+    /**
+     * Return `true` when both pointers refer to the same bit position.
+     *
+     * @param other - Pointer to compare against.
+     */
     equals(other: BitPtr): boolean;
 }

package/dist/util/bitset.js

@@ -2,53 +2,27 @@
  * A compact, growable set of non-negative integers backed by an array of
  * 32-bit words.
  *
- * Used internally to represent entity archetypes (the set of component type
- * ids attached to an entity) and system watchlists. Exposed in the public API
- * so that component data can use it for bit-flag fields:
+ * `Bitset` is the data structure the ECS uses to represent entity archetypes
+ * (the set of component type ids attached to an entity) and watchlists
+ * (the set of component types a query reacts to).
+ *
+ * It is exported in the public API so component data can use it for
+ * compact bit-flag fields:
  *
  * ```ts
  * class Tags extends Component {
- *   tags    = new Bitset();
- *   oldTags = new Bitset();
+ *   tags = new Bitset();
  * }
  *
- * // Check a specific tag bit:
+ * tags.tags.add(TAG_VISIBLE);
  * if (tags.tags.has(TAG_VISIBLE)) { ... }
  * ```
  */
 export class Bitset {
     constructor() {
+        /** @internal Underlying word storage; exposed for tests. */
         this._bits = [];
     }
-    /**
-     * Return `true` if this bitset and `other` have exactly the same bits set.
-     */
-    equal(other) {
-        return (this._bits.length === other._bits.length && this._bits.every((v, i) => other._bits[i] === v));
-    }
-    /**
-     * OR the given `bitmask` word into the word at position `arrayIndex`.
-     *
-     * @internal Low-level bulk operation; prefer {@link add} for single bits.
-     */
-    addIndexBitmask(arrayIndex, bitmask) {
-        this._bits[arrayIndex] |= bitmask;
-    }
-    /**
-     * Replace the word at position `arrayIndex` with `bitmask`.
-     *
-     * @internal Used by network deserialization to set a whole word at once.
-     */
-    setIndexBitmask(arrayIndex, bitmask) {
-        this._bits[arrayIndex] = bitmask;
-    }
-    /**
-     * Set the bit described by `bptr` (fast path using a pre-computed
-     * {@link BitPtr}).
-     */
-    addBit(bptr) {
-        this.addIndexBitmask(bptr.arrayIndex, bptr.bitmask);
-    }
     /**
      * Set bit `n`.
      *
@@ -57,12 +31,20 @@ export class Bitset {
     add(n) {
         const arrayIndex = Math.floor(n / 32);
         const bitmask = 1 << (n % 32);
-        this.addIndexBitmask(arrayIndex, bitmask);
+        this._addIndexBitmask(arrayIndex, bitmask);
     }
     /**
-     * Clear bit `n`.
+     * Set the bit described by `bptr` (fast path using a pre-computed
+     * {@link BitPtr}).
      *
-     * Trailing zero words are trimmed so that the internal array stays compact.
+     * @param bptr - Pre-computed pointer to a bit position.
+     */
+    addBit(bptr) {
+        this._addIndexBitmask(bptr.arrayIndex, bptr.bitmask);
+    }
+    /**
+     * Clear bit `n`. Trailing zero words are trimmed so the internal storage
+     * stays compact.
      *
      * @param n - Non-negative integer bit index.
      */
@@ -80,13 +62,7 @@ export class Bitset {
         }
     }
     /**
-     * Return `true` if the bit described by `bptr` is set (fast path).
-     */
-    hasBit(bptr) {
-        return this.hasIndexBitmask(bptr.arrayIndex, bptr.bitmask);
-    }
-    /**
-     * Return `true` if bit `n` is set.
+     * Return `true` when bit `n` is set.
      *
      * @param n - Non-negative integer bit index.
      */
@@ -97,22 +73,32 @@ export class Bitset {
         }
         const bitIndex = n % 32;
         const bitmask = 1 << bitIndex;
-        return this.hasIndexBitmask(arrayIndex, bitmask);
+        return this._hasIndexBitmask(arrayIndex, bitmask);
     }
     /**
-     * Return `true` if the given word-level bitmask is fully set at `arrayIndex`.
+     * Return `true` when the bit described by `bptr` is set (fast path).
      *
-     * @internal
+     * @param bptr - Pre-computed pointer to a bit position.
      */
-    hasIndexBitmask(arrayIndex, bitmask) {
-        return (this._bits[arrayIndex] & bitmask) !== 0;
+    hasBit(bptr) {
+        return this._hasIndexBitmask(bptr.arrayIndex, bptr.bitmask);
+    }
+    /**
+     * Return `true` when this bitset and `other` have exactly the same bits set.
+     *
+     * @param other - Bitset to compare against.
+     */
+    equal(other) {
+        return (this._bits.length === other._bits.length && this._bits.every((v, i) => other._bits[i] === v));
     }
     /**
-     * Return `true` if every bit set in `other` is also set in `this` (i.e.
-     * `other` is a subset of `this`).
+     * Return `true` when every bit set in `other` is also set in this bitset
+     * (i.e. `other` is a subset of `this`).
      *
      * Used by the world to test whether an entity's archetype satisfies a
-     * system's `HAS` query.
+     * `HAS` query.
+     *
+     * @param other - Bitset whose set bits must all appear in this bitset.
      */
     hasBitset(other) {
         if (this._bits.length < other._bits.length) {
@@ -126,9 +112,9 @@ export class Bitset {
         return true;
     }
     /**
-     * Iterate over every set bit index in ascending order.
+     * Visit each set bit index in ascending order.
      *
-     * @param callback - Called with each set bit index.
+     * @param callback - Invoked once per set bit.
      */
     forEach(callback) {
         this._bits.forEach((b, j) => {
@@ -141,26 +127,50 @@ export class Bitset {
         });
     }
     /**
-     * Return an array of all set bit indices in ascending order.
-     *
-     * @returns `number[]` of set bit positions.
+     * Return an array of every set bit index in ascending order.
      */
     indices() {
         const idx = [];
         this.forEach((i) => idx.push(i));
         return idx;
     }
+    /**
+     * OR `bitmask` into the word at position `arrayIndex`.
+     *
+     * @internal Low-level bulk operation; prefer {@link add} or {@link addBit}
+     * for single bits.
+     */
+    _addIndexBitmask(arrayIndex, bitmask) {
+        this._bits[arrayIndex] |= bitmask;
+    }
+    /**
+     * Replace the word at position `arrayIndex` with `bitmask`.
+     *
+     * @internal Used by network deserialization to write a whole word at once.
+     */
+    _setIndexBitmask(arrayIndex, bitmask) {
+        this._bits[arrayIndex] = bitmask;
+    }
+    /**
+     * Return `true` when every bit in `bitmask` is set in the word at
+     * `arrayIndex`.
+     *
+     * @internal
+     */
+    _hasIndexBitmask(arrayIndex, bitmask) {
+        return (this._bits[arrayIndex] & bitmask) !== 0;
+    }
 }
 /**
  * A pre-computed pointer into a {@link Bitset}'s internal word array.
  *
  * Computing `arrayIndex` and `bitmask` from a raw bit index requires a floor
- * division and a bitshift. `BitPtr` caches those values so that hot-path
+ * division and a bit shift. `BitPtr` caches both values so that hot-path
  * archetype checks ({@link Bitset.hasBit}, {@link Bitset.addBit}) avoid
  * repeating the arithmetic on every entity update.
  *
- * A `BitPtr` is created once per component type and stored on
- * {@link ComponentMeta.bitPtr}.
+ * One `BitPtr` is created per registered component type and stored on
+ * `ComponentMeta.bitPtr`.
  */
 export class BitPtr {
     constructor(
@@ -170,7 +180,11 @@ export class BitPtr {
         this.arrayIndex = Math.floor(value / 32);
         this.bitmask = 1 << (value % 32);
     }
-    /** Return `true` if both pointers refer to the same bit position. */
+    /**
+     * Return `true` when both pointers refer to the same bit position.
+     *
+     * @param other - Pointer to compare against.
+     */
     equals(other) {
         return this.arrayIndex == other.arrayIndex && this.bitmask == other.bitmask;
     }

package/dist/util/bitset.js.map

@@ -1 +1 @@
-{"version":3,"file":"bitset.js","sourceRoot":"","sources":["../../src/util/bitset.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,OAAO,MAAM;IAIjB;QACE,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAa;QACjB,OAAO,CACL,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,KAAK,CAAC,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAC7F,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACH,eAAe,CAAC,UAAkB,EAAE,OAAe;QACjD,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,OAAO,CAAC;IACpC,CAAC;IAED;;;;OAIG;IACH,eAAe,CAAC,UAAkB,EAAE,OAAe;QACjD,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,OAAO,CAAC;IACnC,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,IAAY;QACjB,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IACtD,CAAC;IAED;;;;OAIG;IACH,GAAG,CAAC,CAAS;QACX,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QACtC,MAAM,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QAC9B,IAAI,CAAC,eAAe,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IAC5C,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CAAC,CAAS;QACd,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QACtC,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QACvC,IAAI,OAAO,KAAK,SAAS,EAAE;YACzB,OAAO;SACR;aAAM;YACL,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,OAAO,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;SACrD;QACD,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE;YACnE,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;SAClB;IACH,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,IAAY;QACjB,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IAC7D,CAAC;IAED;;;;OAIG;IACH,GAAG,CAAC,CAAS;QACX,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QACtC,IAAI,UAAU,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE;YACnC,OAAO,KAAK,CAAC;SACd;QACD,MAAM,QAAQ,GAAG,CAAC,GAAG,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,CAAC,IAAI,QAAQ,CAAC;QAC9B,OAAO,IAAI,CAAC,eAAe,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IACnD,CAAC;IAED;;;;OAIG;IACH,eAAe,CAAC,UAAkB,EAAE,OAAe;QACjD,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;IAClD,CAAC;IAED;;;;;;OAMG;IACH,SAAS,CAAC,KAAa;QACrB,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE;YAC1C,OAAO,KAAK,CAAC;SACd;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC3C,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE;gBAC9D,OAAO,KAAK,CAAC;aACd;SACF;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACH,OAAO,CAAC,QAA6B;QACnC,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;gBAC3B,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE;oBACjB,QAAQ,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;iBACtB;gBACD,CAAC,KAAK,CAAC,CAAC;aACT;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;OAIG;IACH,OAAO;QACL,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;CACF;AAED;;;;;;;;;;GAUG;AACH,MAAM,OAAO,MAAM;IAMjB;IACE,gDAAgD;IAChC,KAAa;QAAb,UAAK,GAAL,KAAK,CAAQ;QAE7B,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC;QACzC,IAAI,CAAC,OAAO,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC;IACnC,CAAC;IAED,qEAAqE;IAC9D,MAAM,CAAC,KAAa;QACzB,OAAO,IAAI,CAAC,UAAU,IAAI,KAAK,CAAC,UAAU,IAAI,IAAI,CAAC,OAAO,IAAI,KAAK,CAAC,OAAO,CAAC;IAC9E,CAAC;CACF"}
+{"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;IAuJ9B,CAAC;IArJC;;;;OAIG;IACI,GAAG,CAAC,CAAS;QAClB,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QACtC,MAAM,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QAC9B,IAAI,CAAC,gBAAgB,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IAC7C,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,IAAY;QACxB,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IACvD,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,CAAS;QACrB,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QACtC,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QACvC,IAAI,OAAO,KAAK,SAAS,EAAE;YACzB,OAAO;SACR;aAAM;YACL,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,OAAO,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;SACrD;QACD,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE;YACnE,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;SAClB;IACH,CAAC;IAED;;;;OAIG;IACI,GAAG,CAAC,CAAS;QAClB,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QACtC,IAAI,UAAU,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE;YACnC,OAAO,KAAK,CAAC;SACd;QACD,MAAM,QAAQ,GAAG,CAAC,GAAG,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,CAAC,IAAI,QAAQ,CAAC;QAC9B,OAAO,IAAI,CAAC,gBAAgB,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IACpD,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,IAAY;QACxB,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IAC9D,CAAC;IAED;;;;OAIG;IACI,KAAK,CAAC,KAAa;QACxB,OAAO,CACL,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,KAAK,CAAC,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAC7F,CAAC;IACJ,CAAC;IAED;;;;;;;;OAQG;IACI,SAAS,CAAC,KAAa;QAC5B,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE;YAC1C,OAAO,KAAK,CAAC;SACd;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC3C,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE;gBAC9D,OAAO,KAAK,CAAC;aACd;SACF;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;gBAC3B,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE;oBACjB,QAAQ,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;iBACtB;gBACD,CAAC,KAAK,CAAC,CAAC;aACT;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,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC;QACzC,IAAI,CAAC,OAAO,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC;IACnC,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,KAAa;QACzB,OAAO,IAAI,CAAC,UAAU,IAAI,KAAK,CAAC,UAAU,IAAI,IAAI,CAAC,OAAO,IAAI,KAAK,CAAC,OAAO,CAAC;IAC9E,CAAC;CACF"}

package/dist/util/events.d.ts

@@ -1,27 +1,23 @@
 /**
- * The following type declarations define an alternative typings interface for eventemitter3
- * Inspired by typings in @yandeu/events https://github.com/yandeu/events
- * Turns out those typings pretty much can be used directly on eventemitter3
+ * Strongly-typed wrapper around `eventemitter3`.
+ *
+ * The class declared in this file is purely a typings shim — at module load
+ * its prototype is swapped out for `EventEmitter` from `eventemitter3` so the
+ * concrete behavior is provided by that library, while consumers see typed
+ * `on` / `emit` / `off` signatures driven by an `EventMap`.
+ *
+ * Inspired by the typings in `@yandeu/events`
+ * (https://github.com/yandeu/events). The original typings turned out to be
+ * usable directly on top of `eventemitter3`.
+ *
+ * @internal Used only inside the package, to expose typed entity-level events.
  */
 declare type ValidEventMap<T = any> = T extends {
     [P in keyof T]: (...args: any[]) => void;
 } ? T : never;
 declare type Handler<T extends any | ((...args: any[]) => R), R = any> = T;
+/** Listener signature inferred from an `EventMap` entry. */
 export declare type EventListener<T extends ValidEventMap, K extends EventNames<T>> = T extends string | symbol ? (...args: any[]) => void : K extends keyof T ? Handler<T[K], void> : never;
-declare type EventArgs<T extends ValidEventMap, K extends EventNames<T>> = Parameters<EventListener<T, K>>;
+/** Names of the events declared on an `EventMap`. */
 export declare type EventNames<T extends ValidEventMap> = T extends string | symbol ? T : keyof T;
-declare class events<EventMap extends ValidEventMap = any> {
-    on<T extends EventNames<EventMap>>(event: T, fn: EventListener<EventMap, T>, context?: any): events<EventMap>;
-    emit<T extends EventNames<EventMap>>(event: T, ...args: EventArgs<EventMap, T>): boolean;
-    once<T extends EventNames<EventMap>>(event: T, fn: EventListener<EventMap, T>, context?: any): events<EventMap>;
-    eventNames(): EventNames<EventMap>[];
-    listeners(event: EventNames<EventMap>): any[];
-    listenerCount(event: EventNames<EventMap>): any;
-    removeListener<T extends EventNames<EventMap>>(event: T, fn?: EventListener<EventMap, T>, context?: any, once?: boolean): this;
-    removeAllListeners(event?: EventNames<EventMap>): this;
-    off<T extends EventNames<EventMap>>(event: T, fn?: EventListener<EventMap, T> | undefined, context?: any, once?: boolean | undefined): events<EventMap>;
-    addListener<T extends EventNames<EventMap>>(event: T, fn: EventListener<EventMap, T>, context?: any): events<EventMap>;
-}
-export declare class Events<EventMap extends ValidEventMap = any> extends events<EventMap> {
-}
 export {};