lunibee 0.1.7 → 0.1.8

package/dist/collection/index.js

@@ -17,6 +17,7 @@ class Cache {
       if (!Number.isFinite(interval) || interval < 1)
         throw new RangeError("Cache sweepInterval must be positive.");
       this.#timer = setInterval(() => this.sweep(), interval);
+      this.#timer.unref?.();
     }
   }
   get size() {
@@ -315,4 +316,4 @@ export {
   Collection
 };
 
-//# debugId=F7AF9637261DF97664756E2164756E21
+//# debugId=7983082ABFA81D2164756E2164756E21

package/dist/collection/index.js.map

@@ -2,10 +2,10 @@
   "version": 3,
   "sources": ["../../packages/collection/src/cache.ts", "../../packages/collection/src/index.ts"],
   "sourcesContent": [
-    "import { Collection } from \"./index.js\";\r\n\r\n/** Cache policy for bounded resource storage. */\r\nexport interface CacheOptions {\r\n    /** Maximum number of entries retained. */\r\n    maxSize?: number;\r\n    /** Time-to-live in milliseconds. Omit to disable expiration. */\r\n    ttl?: number;\r\n    /** Sweep interval in milliseconds. */\r\n    sweepInterval?: number;\r\n}\r\n\r\ntype Entry<V> = { value: V; expiresAt: number };\r\n\r\n/** Bounded cache with TTL expiration and explicit invalidation support. */\r\nexport class Cache<K, V> {\r\n    readonly #entries = new Collection<K, Entry<V>>();\r\n    readonly #maxSize: number;\r\n    readonly #ttl: number;\r\n    #timer?: ReturnType<typeof setInterval>;\r\n\r\n    /** Creates a cache using the supplied retention policy. */\r\n    public constructor(options: CacheOptions = {}) {\r\n        this.#maxSize = options.maxSize ?? Infinity;\r\n        this.#ttl = options.ttl ?? 0;\r\n        if (\r\n            (!Number.isInteger(this.#maxSize) && this.#maxSize !== Infinity) ||\r\n            this.#maxSize < 1\r\n        )\r\n            throw new RangeError(\"Cache maxSize must be a positive integer.\");\r\n        if (!Number.isFinite(this.#ttl) || this.#ttl < 0)\r\n            throw new RangeError(\r\n                \"Cache ttl must be a non-negative finite number.\",\r\n            );\r\n        if (this.#ttl > 0) {\r\n            const interval =\r\n                options.sweepInterval ?? Math.min(this.#ttl, 60_000);\r\n            if (!Number.isFinite(interval) || interval < 1)\r\n                throw new RangeError(\"Cache sweepInterval must be positive.\");\r\n            this.#timer = setInterval(() => this.sweep(), interval);\r\n        }\r\n    }\r\n\r\n    /** Number of currently live entries. */\r\n    public get size(): number {\r\n        this.#sweepExpired();\r\n        return this.#entries.size;\r\n    }\r\n    /** Reads a live entry. */\r\n    public get(key: K): V | undefined {\r\n        const entry = this.#entries.get(key);\r\n        if (!entry) return undefined;\r\n        if (entry.expiresAt > 0 && entry.expiresAt <= Date.now()) {\r\n            this.#entries.delete(key);\r\n            return undefined;\r\n        }\r\n        // LRU Promotion: move to end of insertion order\r\n        this.#entries.delete(key);\r\n        this.#entries.set(key, entry);\r\n        return entry.value;\r\n    }\r\n    /** Returns whether a live entry exists. */\r\n    public has(key: K): boolean {\r\n        const entry = this.#entries.get(key);\r\n        if (!entry) return false;\r\n        if (entry.expiresAt > 0 && entry.expiresAt <= Date.now()) {\r\n            this.#entries.delete(key);\r\n            return false;\r\n        }\r\n        return true;\r\n    }\r\n    /** Stores an entry and evicts the oldest entries when the bound is exceeded. */\r\n    public set(key: K, value: V): this {\r\n        const expiresAt = this.#ttl > 0 ? Date.now() + this.#ttl : 0;\r\n        this.#entries.delete(key);\r\n        this.#entries.set(key, { value, expiresAt });\r\n        // Skip eviction entirely for unbounded caches (maxSize === Infinity).\r\n        if (this.#maxSize !== Infinity) {\r\n            while (this.#entries.size > this.#maxSize) {\r\n                const oldest = this.#entries.firstKey();\r\n                if (oldest !== undefined) this.#entries.delete(oldest);\r\n                else break;\r\n            }\r\n        }\r\n        return this;\r\n    }\r\n    /** Invalidates one key. */\r\n    public delete(key: K): boolean {\r\n        return this.#entries.delete(key);\r\n    }\r\n    /** Invalidates every cached resource. */\r\n    public clear(): void {\r\n        this.#entries.clear();\r\n    }\r\n    /** Invalidates every entry matching a predicate. */\r\n    public invalidate(predicate: (value: V, key: K) => boolean): number {\r\n        return this.#entries.sweep((entry, key) => predicate(entry.value, key));\r\n    }\r\n    /** Removes expired entries and returns the number removed. */\r\n    public sweep(): number {\r\n        return this.#entries.sweep((entry) => this.#expired(entry));\r\n    }\r\n    /** Stops the background sweeper and releases its timer. */\r\n    public dispose(): void {\r\n        if (this.#timer) clearInterval(this.#timer);\r\n        this.#timer = undefined;\r\n    }\r\n    /** Returns live cached values. */\r\n    public values(): V[] {\r\n        this.#sweepExpired();\r\n        return this.#entries.map((entry) => entry.value);\r\n    }\r\n    /** Returns live cached entries. */\r\n    public entries(): [K, V][] {\r\n        this.#sweepExpired();\r\n        return this.#entries.map((entry, key) => [key, entry.value]);\r\n    }\r\n    #expired(entry: Entry<V>): boolean {\r\n        return entry.expiresAt > 0 && entry.expiresAt <= Date.now();\r\n    }\r\n    #sweepExpired(): void {\r\n        if (this.#ttl > 0) this.sweep();\r\n    }\r\n}\r\n",
-    "/** A lightweight keyed collection for Lunibee resource and application state. */\r\nexport class Collection<K, V> extends Map<K, V> {\r\n    /** Returns the first stored value. */\r\n    public first(): V | undefined {\r\n        for (const value of this.values()) return value;\r\n        return undefined;\r\n    }\r\n    /** Returns the first stored key. */\r\n    public firstKey(): K | undefined {\r\n        for (const key of this.keys()) return key;\r\n        return undefined;\r\n    }\r\n    /** Returns the last stored value. */\r\n    public last(): V | undefined {\r\n        let value: V | undefined;\r\n        for (const item of this.values()) value = item;\r\n        return value;\r\n    }\r\n    /** Returns the last stored key. */\r\n    public lastKey(): K | undefined {\r\n        let key: K | undefined;\r\n        for (const item of this.keys()) key = item;\r\n        return key;\r\n    }\r\n    /** Finds the first value matching a predicate. */\r\n    public find(\r\n        predicate: (value: V, key: K, collection: this) => boolean,\r\n    ): V | undefined {\r\n        for (const [key, value] of this) {\r\n            if (predicate(value, key, this)) return value;\r\n        }\r\n        return undefined;\r\n    }\r\n    /** Returns all values matching a predicate. */\r\n    public filter(\r\n        predicate: (value: V, key: K, collection: this) => boolean,\r\n    ): Collection<K, V> {\r\n        const result = new Collection<K, V>();\r\n        for (const [key, value] of this) {\r\n            if (predicate(value, key, this)) result.set(key, value);\r\n        }\r\n        return result;\r\n    }\r\n    /** Transforms every stored value into an array. */\r\n    public map<T>(transform: (value: V, key: K, collection: this) => T): T[] {\r\n        const result: T[] = [];\r\n        for (const [key, value] of this) {\r\n            result.push(transform(value, key, this));\r\n        }\r\n        return result;\r\n    }\r\n    /** Returns whether at least one stored value satisfies a predicate. */\r\n    public some(\r\n        predicate: (value: V, key: K, collection: this) => boolean,\r\n    ): boolean {\r\n        for (const [key, value] of this) {\r\n            if (predicate(value, key, this)) return true;\r\n        }\r\n        return false;\r\n    }\r\n    /** Returns whether every stored value satisfies a predicate. */\r\n    public every(\r\n        predicate: (value: V, key: K, collection: this) => boolean,\r\n    ): boolean {\r\n        for (const [key, value] of this) {\r\n            if (!predicate(value, key, this)) return false;\r\n        }\r\n        return true;\r\n    }\r\n    /** Runs a callback for each stored value. */\r\n    public each(\r\n        callback: (value: V, key: K, collection: this) => unknown,\r\n    ): this {\r\n        for (const [key, value] of this) {\r\n            callback(value, key, this);\r\n        }\r\n        return this;\r\n    }\r\n    /** Returns an array containing all stored values. */\r\n    public array(): V[] {\r\n        return [...this.values()];\r\n    }\r\n    /** Returns an array containing all stored keys. */\r\n    public keyArray(): K[] {\r\n        return [...this.keys()];\r\n    }\r\n    /** Returns a plain array of entries. */\r\n    public entriesArray(): [K, V][] {\r\n        return [...this.entries()];\r\n    }\r\n    /** Returns a new collection with the same entries. */\r\n    public clone(): Collection<K, V> {\r\n        const copy = new Collection<K, V>();\r\n        for (const [key, value] of this) copy.set(key, value);\r\n        return copy;\r\n    }\r\n    /** Returns whether all supplied keys are present. */\r\n    public hasAll(...keys: K[]): boolean {\r\n        for (let i = 0; i < keys.length; i++) {\r\n            if (!this.has(keys[i]!)) return false;\r\n        }\r\n        return true;\r\n    }\r\n    /** Returns whether at least one supplied key is present. */\r\n    public hasAny(...keys: K[]): boolean {\r\n        for (let i = 0; i < keys.length; i++) {\r\n            if (this.has(keys[i]!)) return true;\r\n        }\r\n        return false;\r\n    }\r\n    /** Returns the first key whose value matches a predicate. */\r\n    public findKey(\r\n        predicate: (value: V, key: K, collection: this) => boolean,\r\n    ): K | undefined {\r\n        for (const [key, value] of this) {\r\n            if (predicate(value, key, this)) return key;\r\n        }\r\n        return undefined;\r\n    }\r\n    /** Returns whether a predicate matches at least one entry. */\r\n    public someEntry(\r\n        predicate: (value: V, key: K, collection: this) => boolean,\r\n    ): boolean {\r\n        return this.some(predicate);\r\n    }\r\n    /** Removes every entry matching a predicate and returns the number removed. */\r\n    public sweep(\r\n        predicate: (value: V, key: K, collection: this) => boolean,\r\n    ): number {\r\n        let removed = 0;\r\n        for (const [key, value] of this) {\r\n            if (predicate(value, key, this) && this.delete(key)) removed++;\r\n        }\r\n        return removed;\r\n    }\r\n    /** Returns the collection's first matching entry as a tuple. */\r\n    public firstEntry(): [K, V] | undefined {\r\n        for (const [key, value] of this) return [key, value];\r\n        return undefined;\r\n    }\r\n    /** Returns the collection's last matching entry as a tuple. */\r\n    public lastEntry(): [K, V] | undefined {\r\n        let entry: [K, V] | undefined;\r\n        for (const item of this) entry = [item[0], item[1]];\r\n        return entry;\r\n    }\r\n    /** Returns a new Collection containing elements from both collections. */\r\n    public union(other: Collection<K, V>): Collection<K, V> {\r\n        const result = this.clone();\r\n        for (const [key, value] of other) result.set(key, value);\r\n        return result;\r\n    }\r\n    /** Returns a new Collection containing only elements present in both collections. */\r\n    public intersection(other: Collection<K, V>): Collection<K, V> {\r\n        const result = new Collection<K, V>();\r\n        for (const [key, value] of this) {\r\n            if (other.has(key)) result.set(key, value);\r\n        }\r\n        return result;\r\n    }\r\n    /** Returns a new Collection containing elements present in this collection but not the other. */\r\n    public difference(other: Collection<K, V>): Collection<K, V> {\r\n        const result = new Collection<K, V>();\r\n        for (const [key, value] of this) {\r\n            if (!other.has(key)) result.set(key, value);\r\n        }\r\n        return result;\r\n    }\r\n    /** Splits the collection into two collections based on a predicate.\r\n     * @returns `[passing, failing]` — entries satisfying the predicate, then those that don't.\r\n     */\r\n    public partition(\r\n        predicate: (value: V, key: K, collection: this) => boolean,\r\n    ): [Collection<K, V>, Collection<K, V>] {\r\n        const pass = new Collection<K, V>();\r\n        const fail = new Collection<K, V>();\r\n        for (const [key, value] of this) {\r\n            if (predicate(value, key, this)) pass.set(key, value);\r\n            else fail.set(key, value);\r\n        }\r\n        return [pass, fail];\r\n    }\r\n    /** Calls `fn` with this collection and returns the collection unchanged.\r\n     * Useful for inserting debug side-effects in a chain without breaking the flow.\r\n     */\r\n    public tap(fn: (collection: this) => unknown): this {\r\n        fn(this);\r\n        return this;\r\n    }\r\n    /** Maps every entry to an array of items and flattens the results. */\r\n    public flatMap<T>(\r\n        transform: (value: V, key: K, collection: this) => T[],\r\n    ): T[] {\r\n        const result: T[] = [];\r\n        for (const [key, value] of this) {\r\n            for (const item of transform(value, key, this)) result.push(item);\r\n        }\r\n        return result;\r\n    }\r\n    /** Reduces the collection to a single value. */\r\n    public reduce<T>(\r\n        fn: (accumulator: T, value: V, key: K, collection: this) => T,\r\n        initialValue: T,\r\n    ): T {\r\n        let acc = initialValue;\r\n        for (const [key, value] of this) acc = fn(acc, value, key, this);\r\n        return acc;\r\n    }\r\n    /** Returns a new Collection with entries sorted by comparator (non-mutating).\r\n     * Defaults to insertion order if no comparator is provided.\r\n     */\r\n    public sorted(\r\n        comparator?: (a: V, b: V, aKey: K, bKey: K) => number,\r\n    ): Collection<K, V> {\r\n        // Decorate with the original insertion index and use it as a tiebreaker so\r\n        // equal elements keep their insertion order (a stable sort independent of\r\n        // the engine's Array.prototype.sort stability guarantees).\r\n        const decorated = [...this.entries()].map((entry, index) => ({\r\n            entry,\r\n            index,\r\n        }));\r\n        if (comparator)\r\n            decorated.sort((x, y) => {\r\n                const comparison = comparator(\r\n                    x.entry[1],\r\n                    y.entry[1],\r\n                    x.entry[0],\r\n                    y.entry[0],\r\n                );\r\n                return comparison !== 0 ? comparison : x.index - y.index;\r\n            });\r\n        const result = new Collection<K, V>();\r\n        for (const { entry } of decorated) result.set(entry[0], entry[1]);\r\n        return result;\r\n    }\r\n    /** Returns a random value from the collection, or `undefined` if empty.\r\n     * Uses `Math.random()` (fast, non-cryptographic) — do not use for security-sensitive\r\n     * selection such as tokens or secrets. */\r\n    public random(): V | undefined {\r\n        const arr = [...this.values()];\r\n        if (!arr.length) return undefined;\r\n        return arr[Math.floor(Math.random() * arr.length)];\r\n    }\r\n    /** Returns a random key from the collection, or `undefined` if empty.\r\n     * Uses `Math.random()` (fast, non-cryptographic) — do not use for security-sensitive\r\n     * selection such as tokens or secrets. */\r\n    public randomKey(): K | undefined {\r\n        const arr = [...this.keys()];\r\n        if (!arr.length) return undefined;\r\n        return arr[Math.floor(Math.random() * arr.length)];\r\n    }\r\n    /** Returns the value at a given insertion-order index (supports negative indices). */\r\n    public at(index: number): V | undefined {\r\n        const arr = [...this.values()];\r\n        const i = index < 0 ? arr.length + index : index;\r\n        return arr[i];\r\n    }\r\n    /** Returns the key at a given insertion-order index (supports negative indices). */\r\n    public keyAt(index: number): K | undefined {\r\n        const arr = [...this.keys()];\r\n        const i = index < 0 ? arr.length + index : index;\r\n        return arr[i];\r\n    }\r\n    /** Serializes the collection to a plain `[key, value]` array. */\r\n    public toJSON(): [K, V][] {\r\n        return [...this.entries()];\r\n    }\r\n}\r\n\r\nexport { Cache } from \"./cache.js\";\r\nexport type { CacheOptions } from \"./cache.js\";\r\n"
+    "import { Collection } from \"./index.js\";\n\n/** Cache policy for bounded resource storage. */\nexport interface CacheOptions {\n    /** Maximum number of entries retained. */\n    maxSize?: number;\n    /** Time-to-live in milliseconds. Omit to disable expiration. */\n    ttl?: number;\n    /** Sweep interval in milliseconds. */\n    sweepInterval?: number;\n}\n\ntype Entry<V> = { value: V; expiresAt: number };\n\n/** Bounded cache with TTL expiration and explicit invalidation support. */\nexport class Cache<K, V> {\n    readonly #entries = new Collection<K, Entry<V>>();\n    readonly #maxSize: number;\n    readonly #ttl: number;\n    #timer?: ReturnType<typeof setInterval>;\n\n    /** Creates a cache using the supplied retention policy. */\n    public constructor(options: CacheOptions = {}) {\n        this.#maxSize = options.maxSize ?? Infinity;\n        this.#ttl = options.ttl ?? 0;\n        if (\n            (!Number.isInteger(this.#maxSize) && this.#maxSize !== Infinity) ||\n            this.#maxSize < 1\n        )\n            throw new RangeError(\"Cache maxSize must be a positive integer.\");\n        if (!Number.isFinite(this.#ttl) || this.#ttl < 0)\n            throw new RangeError(\n                \"Cache ttl must be a non-negative finite number.\",\n            );\n        if (this.#ttl > 0) {\n            const interval =\n                options.sweepInterval ?? Math.min(this.#ttl, 60_000);\n            if (!Number.isFinite(interval) || interval < 1)\n                throw new RangeError(\"Cache sweepInterval must be positive.\");\n            this.#timer = setInterval(() => this.sweep(), interval);\n            // A sweeper is housekeeping, not work: keeping it referenced makes\n            // a TTL cache hold the process open until dispose() is called.\n            (this.#timer as { unref?: () => void }).unref?.();\n        }\n    }\n\n    /** Number of currently live entries. */\n    public get size(): number {\n        this.#sweepExpired();\n        return this.#entries.size;\n    }\n    /** Reads a live entry. */\n    public get(key: K): V | undefined {\n        const entry = this.#entries.get(key);\n        if (!entry) return undefined;\n        if (entry.expiresAt > 0 && entry.expiresAt <= Date.now()) {\n            this.#entries.delete(key);\n            return undefined;\n        }\n        // LRU Promotion: move to end of insertion order\n        this.#entries.delete(key);\n        this.#entries.set(key, entry);\n        return entry.value;\n    }\n    /** Returns whether a live entry exists. */\n    public has(key: K): boolean {\n        const entry = this.#entries.get(key);\n        if (!entry) return false;\n        if (entry.expiresAt > 0 && entry.expiresAt <= Date.now()) {\n            this.#entries.delete(key);\n            return false;\n        }\n        return true;\n    }\n    /** Stores an entry and evicts the oldest entries when the bound is exceeded. */\n    public set(key: K, value: V): this {\n        const expiresAt = this.#ttl > 0 ? Date.now() + this.#ttl : 0;\n        this.#entries.delete(key);\n        this.#entries.set(key, { value, expiresAt });\n        // Skip eviction entirely for unbounded caches (maxSize === Infinity).\n        if (this.#maxSize !== Infinity) {\n            while (this.#entries.size > this.#maxSize) {\n                const oldest = this.#entries.firstKey();\n                if (oldest !== undefined) this.#entries.delete(oldest);\n                else break;\n            }\n        }\n        return this;\n    }\n    /** Invalidates one key. */\n    public delete(key: K): boolean {\n        return this.#entries.delete(key);\n    }\n    /** Invalidates every cached resource. */\n    public clear(): void {\n        this.#entries.clear();\n    }\n    /** Invalidates every entry matching a predicate. */\n    public invalidate(predicate: (value: V, key: K) => boolean): number {\n        return this.#entries.sweep((entry, key) => predicate(entry.value, key));\n    }\n    /** Removes expired entries and returns the number removed. */\n    public sweep(): number {\n        return this.#entries.sweep((entry) => this.#expired(entry));\n    }\n    /** Stops the background sweeper and releases its timer. */\n    public dispose(): void {\n        if (this.#timer) clearInterval(this.#timer);\n        this.#timer = undefined;\n    }\n    /** Returns live cached values. */\n    public values(): V[] {\n        this.#sweepExpired();\n        return this.#entries.map((entry) => entry.value);\n    }\n    /** Returns live cached entries. */\n    public entries(): [K, V][] {\n        this.#sweepExpired();\n        return this.#entries.map((entry, key) => [key, entry.value]);\n    }\n    #expired(entry: Entry<V>): boolean {\n        return entry.expiresAt > 0 && entry.expiresAt <= Date.now();\n    }\n    #sweepExpired(): void {\n        if (this.#ttl > 0) this.sweep();\n    }\n}\n",
+    "/** A lightweight keyed collection for Lunibee resource and application state. */\nexport class Collection<K, V> extends Map<K, V> {\n    /** Returns the first stored value. */\n    public first(): V | undefined {\n        for (const value of this.values()) return value;\n        return undefined;\n    }\n    /** Returns the first stored key. */\n    public firstKey(): K | undefined {\n        for (const key of this.keys()) return key;\n        return undefined;\n    }\n    /** Returns the last stored value. */\n    public last(): V | undefined {\n        let value: V | undefined;\n        for (const item of this.values()) value = item;\n        return value;\n    }\n    /** Returns the last stored key. */\n    public lastKey(): K | undefined {\n        let key: K | undefined;\n        for (const item of this.keys()) key = item;\n        return key;\n    }\n    /** Finds the first value matching a predicate. */\n    public find(\n        predicate: (value: V, key: K, collection: this) => boolean,\n    ): V | undefined {\n        for (const [key, value] of this) {\n            if (predicate(value, key, this)) return value;\n        }\n        return undefined;\n    }\n    /** Returns all values matching a predicate. */\n    public filter(\n        predicate: (value: V, key: K, collection: this) => boolean,\n    ): Collection<K, V> {\n        const result = new Collection<K, V>();\n        for (const [key, value] of this) {\n            if (predicate(value, key, this)) result.set(key, value);\n        }\n        return result;\n    }\n    /** Transforms every stored value into an array. */\n    public map<T>(transform: (value: V, key: K, collection: this) => T): T[] {\n        const result: T[] = [];\n        for (const [key, value] of this) {\n            result.push(transform(value, key, this));\n        }\n        return result;\n    }\n    /** Returns whether at least one stored value satisfies a predicate. */\n    public some(\n        predicate: (value: V, key: K, collection: this) => boolean,\n    ): boolean {\n        for (const [key, value] of this) {\n            if (predicate(value, key, this)) return true;\n        }\n        return false;\n    }\n    /** Returns whether every stored value satisfies a predicate. */\n    public every(\n        predicate: (value: V, key: K, collection: this) => boolean,\n    ): boolean {\n        for (const [key, value] of this) {\n            if (!predicate(value, key, this)) return false;\n        }\n        return true;\n    }\n    /** Runs a callback for each stored value. */\n    public each(\n        callback: (value: V, key: K, collection: this) => unknown,\n    ): this {\n        for (const [key, value] of this) {\n            callback(value, key, this);\n        }\n        return this;\n    }\n    /** Returns an array containing all stored values. */\n    public array(): V[] {\n        return [...this.values()];\n    }\n    /** Returns an array containing all stored keys. */\n    public keyArray(): K[] {\n        return [...this.keys()];\n    }\n    /** Returns a plain array of entries. */\n    public entriesArray(): [K, V][] {\n        return [...this.entries()];\n    }\n    /** Returns a new collection with the same entries. */\n    public clone(): Collection<K, V> {\n        const copy = new Collection<K, V>();\n        for (const [key, value] of this) copy.set(key, value);\n        return copy;\n    }\n    /** Returns whether all supplied keys are present. */\n    public hasAll(...keys: K[]): boolean {\n        for (let i = 0; i < keys.length; i++) {\n            if (!this.has(keys[i]!)) return false;\n        }\n        return true;\n    }\n    /** Returns whether at least one supplied key is present. */\n    public hasAny(...keys: K[]): boolean {\n        for (let i = 0; i < keys.length; i++) {\n            if (this.has(keys[i]!)) return true;\n        }\n        return false;\n    }\n    /** Returns the first key whose value matches a predicate. */\n    public findKey(\n        predicate: (value: V, key: K, collection: this) => boolean,\n    ): K | undefined {\n        for (const [key, value] of this) {\n            if (predicate(value, key, this)) return key;\n        }\n        return undefined;\n    }\n    /** Returns whether a predicate matches at least one entry. */\n    public someEntry(\n        predicate: (value: V, key: K, collection: this) => boolean,\n    ): boolean {\n        return this.some(predicate);\n    }\n    /** Removes every entry matching a predicate and returns the number removed. */\n    public sweep(\n        predicate: (value: V, key: K, collection: this) => boolean,\n    ): number {\n        let removed = 0;\n        for (const [key, value] of this) {\n            if (predicate(value, key, this) && this.delete(key)) removed++;\n        }\n        return removed;\n    }\n    /** Returns the collection's first matching entry as a tuple. */\n    public firstEntry(): [K, V] | undefined {\n        for (const [key, value] of this) return [key, value];\n        return undefined;\n    }\n    /** Returns the collection's last matching entry as a tuple. */\n    public lastEntry(): [K, V] | undefined {\n        let entry: [K, V] | undefined;\n        for (const item of this) entry = [item[0], item[1]];\n        return entry;\n    }\n    /** Returns a new Collection containing elements from both collections. */\n    public union(other: Collection<K, V>): Collection<K, V> {\n        const result = this.clone();\n        for (const [key, value] of other) result.set(key, value);\n        return result;\n    }\n    /** Returns a new Collection containing only elements present in both collections. */\n    public intersection(other: Collection<K, V>): Collection<K, V> {\n        const result = new Collection<K, V>();\n        for (const [key, value] of this) {\n            if (other.has(key)) result.set(key, value);\n        }\n        return result;\n    }\n    /** Returns a new Collection containing elements present in this collection but not the other. */\n    public difference(other: Collection<K, V>): Collection<K, V> {\n        const result = new Collection<K, V>();\n        for (const [key, value] of this) {\n            if (!other.has(key)) result.set(key, value);\n        }\n        return result;\n    }\n    /** Splits the collection into two collections based on a predicate.\n     * @returns `[passing, failing]` — entries satisfying the predicate, then those that don't.\n     */\n    public partition(\n        predicate: (value: V, key: K, collection: this) => boolean,\n    ): [Collection<K, V>, Collection<K, V>] {\n        const pass = new Collection<K, V>();\n        const fail = new Collection<K, V>();\n        for (const [key, value] of this) {\n            if (predicate(value, key, this)) pass.set(key, value);\n            else fail.set(key, value);\n        }\n        return [pass, fail];\n    }\n    /** Calls `fn` with this collection and returns the collection unchanged.\n     * Useful for inserting debug side-effects in a chain without breaking the flow.\n     */\n    public tap(fn: (collection: this) => unknown): this {\n        fn(this);\n        return this;\n    }\n    /** Maps every entry to an array of items and flattens the results. */\n    public flatMap<T>(\n        transform: (value: V, key: K, collection: this) => T[],\n    ): T[] {\n        const result: T[] = [];\n        for (const [key, value] of this) {\n            for (const item of transform(value, key, this)) result.push(item);\n        }\n        return result;\n    }\n    /** Reduces the collection to a single value. */\n    public reduce<T>(\n        fn: (accumulator: T, value: V, key: K, collection: this) => T,\n        initialValue: T,\n    ): T {\n        let acc = initialValue;\n        for (const [key, value] of this) acc = fn(acc, value, key, this);\n        return acc;\n    }\n    /** Returns a new Collection with entries sorted by comparator (non-mutating).\n     * Defaults to insertion order if no comparator is provided.\n     */\n    public sorted(\n        comparator?: (a: V, b: V, aKey: K, bKey: K) => number,\n    ): Collection<K, V> {\n        // Decorate with the original insertion index and use it as a tiebreaker so\n        // equal elements keep their insertion order (a stable sort independent of\n        // the engine's Array.prototype.sort stability guarantees).\n        const decorated = [...this.entries()].map((entry, index) => ({\n            entry,\n            index,\n        }));\n        if (comparator)\n            decorated.sort((x, y) => {\n                const comparison = comparator(\n                    x.entry[1],\n                    y.entry[1],\n                    x.entry[0],\n                    y.entry[0],\n                );\n                return comparison !== 0 ? comparison : x.index - y.index;\n            });\n        const result = new Collection<K, V>();\n        for (const { entry } of decorated) result.set(entry[0], entry[1]);\n        return result;\n    }\n    /** Returns a random value from the collection, or `undefined` if empty.\n     * Uses `Math.random()` (fast, non-cryptographic) — do not use for security-sensitive\n     * selection such as tokens or secrets. */\n    public random(): V | undefined {\n        const arr = [...this.values()];\n        if (!arr.length) return undefined;\n        return arr[Math.floor(Math.random() * arr.length)];\n    }\n    /** Returns a random key from the collection, or `undefined` if empty.\n     * Uses `Math.random()` (fast, non-cryptographic) — do not use for security-sensitive\n     * selection such as tokens or secrets. */\n    public randomKey(): K | undefined {\n        const arr = [...this.keys()];\n        if (!arr.length) return undefined;\n        return arr[Math.floor(Math.random() * arr.length)];\n    }\n    /** Returns the value at a given insertion-order index (supports negative indices). */\n    public at(index: number): V | undefined {\n        const arr = [...this.values()];\n        const i = index < 0 ? arr.length + index : index;\n        return arr[i];\n    }\n    /** Returns the key at a given insertion-order index (supports negative indices). */\n    public keyAt(index: number): K | undefined {\n        const arr = [...this.keys()];\n        const i = index < 0 ? arr.length + index : index;\n        return arr[i];\n    }\n    /** Serializes the collection to a plain `[key, value]` array. */\n    public toJSON(): [K, V][] {\n        return [...this.entries()];\n    }\n}\n\nexport { Cache } from \"./cache.js\";\nexport type { CacheOptions } from \"./cache.js\";\n"
   ],
-  "mappings": ";;AAeO,MAAM,MAAY;AAAA,EACZ,WAAW,IAAI;AAAA,EACf;AAAA,EACA;AAAA,EACT;AAAA,EAGO,WAAW,CAAC,UAAwB,CAAC,GAAG;AAAA,IAC3C,KAAK,WAAW,QAAQ,WAAW;AAAA,IACnC,KAAK,OAAO,QAAQ,OAAO;AAAA,IAC3B,IACK,CAAC,OAAO,UAAU,KAAK,QAAQ,KAAK,KAAK,aAAa,YACvD,KAAK,WAAW;AAAA,MAEhB,MAAM,IAAI,WAAW,2CAA2C;AAAA,IACpE,IAAI,CAAC,OAAO,SAAS,KAAK,IAAI,KAAK,KAAK,OAAO;AAAA,MAC3C,MAAM,IAAI,WACN,iDACJ;AAAA,IACJ,IAAI,KAAK,OAAO,GAAG;AAAA,MACf,MAAM,WACF,QAAQ,iBAAiB,KAAK,IAAI,KAAK,MAAM,KAAM;AAAA,MACvD,IAAI,CAAC,OAAO,SAAS,QAAQ,KAAK,WAAW;AAAA,QACzC,MAAM,IAAI,WAAW,uCAAuC;AAAA,MAChE,KAAK,SAAS,YAAY,MAAM,KAAK,MAAM,GAAG,QAAQ;AAAA,IAC1D;AAAA;AAAA,MAIO,IAAI,GAAW;AAAA,IACtB,KAAK,cAAc;AAAA,IACnB,OAAO,KAAK,SAAS;AAAA;AAAA,EAGlB,GAAG,CAAC,KAAuB;AAAA,IAC9B,MAAM,QAAQ,KAAK,SAAS,IAAI,GAAG;AAAA,IACnC,IAAI,CAAC;AAAA,MAAO;AAAA,IACZ,IAAI,MAAM,YAAY,KAAK,MAAM,aAAa,KAAK,IAAI,GAAG;AAAA,MACtD,KAAK,SAAS,OAAO,GAAG;AAAA,MACxB;AAAA,IACJ;AAAA,IAEA,KAAK,SAAS,OAAO,GAAG;AAAA,IACxB,KAAK,SAAS,IAAI,KAAK,KAAK;AAAA,IAC5B,OAAO,MAAM;AAAA;AAAA,EAGV,GAAG,CAAC,KAAiB;AAAA,IACxB,MAAM,QAAQ,KAAK,SAAS,IAAI,GAAG;AAAA,IACnC,IAAI,CAAC;AAAA,MAAO,OAAO;AAAA,IACnB,IAAI,MAAM,YAAY,KAAK,MAAM,aAAa,KAAK,IAAI,GAAG;AAAA,MACtD,KAAK,SAAS,OAAO,GAAG;AAAA,MACxB,OAAO;AAAA,IACX;AAAA,IACA,OAAO;AAAA;AAAA,EAGJ,GAAG,CAAC,KAAQ,OAAgB;AAAA,IAC/B,MAAM,YAAY,KAAK,OAAO,IAAI,KAAK,IAAI,IAAI,KAAK,OAAO;AAAA,IAC3D,KAAK,SAAS,OAAO,GAAG;AAAA,IACxB,KAAK,SAAS,IAAI,KAAK,EAAE,OAAO,UAAU,CAAC;AAAA,IAE3C,IAAI,KAAK,aAAa,UAAU;AAAA,MAC5B,OAAO,KAAK,SAAS,OAAO,KAAK,UAAU;AAAA,QACvC,MAAM,SAAS,KAAK,SAAS,SAAS;AAAA,QACtC,IAAI,WAAW;AAAA,UAAW,KAAK,SAAS,OAAO,MAAM;AAAA,QAChD;AAAA;AAAA,MACT;AAAA,IACJ;AAAA,IACA,OAAO;AAAA;AAAA,EAGJ,MAAM,CAAC,KAAiB;AAAA,IAC3B,OAAO,KAAK,SAAS,OAAO,GAAG;AAAA;AAAA,EAG5B,KAAK,GAAS;AAAA,IACjB,KAAK,SAAS,MAAM;AAAA;AAAA,EAGjB,UAAU,CAAC,WAAkD;AAAA,IAChE,OAAO,KAAK,SAAS,MAAM,CAAC,OAAO,QAAQ,UAAU,MAAM,OAAO,GAAG,CAAC;AAAA;AAAA,EAGnE,KAAK,GAAW;AAAA,IACnB,OAAO,KAAK,SAAS,MAAM,CAAC,UAAU,KAAK,SAAS,KAAK,CAAC;AAAA;AAAA,EAGvD,OAAO,GAAS;AAAA,IACnB,IAAI,KAAK;AAAA,MAAQ,cAAc,KAAK,MAAM;AAAA,IAC1C,KAAK,SAAS;AAAA;AAAA,EAGX,MAAM,GAAQ;AAAA,IACjB,KAAK,cAAc;AAAA,IACnB,OAAO,KAAK,SAAS,IAAI,CAAC,UAAU,MAAM,KAAK;AAAA;AAAA,EAG5C,OAAO,GAAa;AAAA,IACvB,KAAK,cAAc;AAAA,IACnB,OAAO,KAAK,SAAS,IAAI,CAAC,OAAO,QAAQ,CAAC,KAAK,MAAM,KAAK,CAAC;AAAA;AAAA,EAE/D,QAAQ,CAAC,OAA0B;AAAA,IAC/B,OAAO,MAAM,YAAY,KAAK,MAAM,aAAa,KAAK,IAAI;AAAA;AAAA,EAE9D,aAAa,GAAS;AAAA,IAClB,IAAI,KAAK,OAAO;AAAA,MAAG,KAAK,MAAM;AAAA;AAEtC;;;AC1HO,MAAM,mBAAyB,IAAU;AAAA,EAErC,KAAK,GAAkB;AAAA,IAC1B,WAAW,SAAS,KAAK,OAAO;AAAA,MAAG,OAAO;AAAA,IAC1C;AAAA;AAAA,EAGG,QAAQ,GAAkB;AAAA,IAC7B,WAAW,OAAO,KAAK,KAAK;AAAA,MAAG,OAAO;AAAA,IACtC;AAAA;AAAA,EAGG,IAAI,GAAkB;AAAA,IACzB,IAAI;AAAA,IACJ,WAAW,QAAQ,KAAK,OAAO;AAAA,MAAG,QAAQ;AAAA,IAC1C,OAAO;AAAA;AAAA,EAGJ,OAAO,GAAkB;AAAA,IAC5B,IAAI;AAAA,IACJ,WAAW,QAAQ,KAAK,KAAK;AAAA,MAAG,MAAM;AAAA,IACtC,OAAO;AAAA;AAAA,EAGJ,IAAI,CACP,WACa;AAAA,IACb,YAAY,KAAK,UAAU,MAAM;AAAA,MAC7B,IAAI,UAAU,OAAO,KAAK,IAAI;AAAA,QAAG,OAAO;AAAA,IAC5C;AAAA,IACA;AAAA;AAAA,EAGG,MAAM,CACT,WACgB;AAAA,IAChB,MAAM,SAAS,IAAI;AAAA,IACnB,YAAY,KAAK,UAAU,MAAM;AAAA,MAC7B,IAAI,UAAU,OAAO,KAAK,IAAI;AAAA,QAAG,OAAO,IAAI,KAAK,KAAK;AAAA,IAC1D;AAAA,IACA,OAAO;AAAA;AAAA,EAGJ,GAAM,CAAC,WAA2D;AAAA,IACrE,MAAM,SAAc,CAAC;AAAA,IACrB,YAAY,KAAK,UAAU,MAAM;AAAA,MAC7B,OAAO,KAAK,UAAU,OAAO,KAAK,IAAI,CAAC;AAAA,IAC3C;AAAA,IACA,OAAO;AAAA;AAAA,EAGJ,IAAI,CACP,WACO;AAAA,IACP,YAAY,KAAK,UAAU,MAAM;AAAA,MAC7B,IAAI,UAAU,OAAO,KAAK,IAAI;AAAA,QAAG,OAAO;AAAA,IAC5C;AAAA,IACA,OAAO;AAAA;AAAA,EAGJ,KAAK,CACR,WACO;AAAA,IACP,YAAY,KAAK,UAAU,MAAM;AAAA,MAC7B,IAAI,CAAC,UAAU,OAAO,KAAK,IAAI;AAAA,QAAG,OAAO;AAAA,IAC7C;AAAA,IACA,OAAO;AAAA;AAAA,EAGJ,IAAI,CACP,UACI;AAAA,IACJ,YAAY,KAAK,UAAU,MAAM;AAAA,MAC7B,SAAS,OAAO,KAAK,IAAI;AAAA,IAC7B;AAAA,IACA,OAAO;AAAA;AAAA,EAGJ,KAAK,GAAQ;AAAA,IAChB,OAAO,CAAC,GAAG,KAAK,OAAO,CAAC;AAAA;AAAA,EAGrB,QAAQ,GAAQ;AAAA,IACnB,OAAO,CAAC,GAAG,KAAK,KAAK,CAAC;AAAA;AAAA,EAGnB,YAAY,GAAa;AAAA,IAC5B,OAAO,CAAC,GAAG,KAAK,QAAQ,CAAC;AAAA;AAAA,EAGtB,KAAK,GAAqB;AAAA,IAC7B,MAAM,OAAO,IAAI;AAAA,IACjB,YAAY,KAAK,UAAU;AAAA,MAAM,KAAK,IAAI,KAAK,KAAK;AAAA,IACpD,OAAO;AAAA;AAAA,EAGJ,MAAM,IAAI,MAAoB;AAAA,IACjC,SAAS,IAAI,EAAG,IAAI,KAAK,QAAQ,KAAK;AAAA,MAClC,IAAI,CAAC,KAAK,IAAI,KAAK,EAAG;AAAA,QAAG,OAAO;AAAA,IACpC;AAAA,IACA,OAAO;AAAA;AAAA,EAGJ,MAAM,IAAI,MAAoB;AAAA,IACjC,SAAS,IAAI,EAAG,IAAI,KAAK,QAAQ,KAAK;AAAA,MAClC,IAAI,KAAK,IAAI,KAAK,EAAG;AAAA,QAAG,OAAO;AAAA,IACnC;AAAA,IACA,OAAO;AAAA;AAAA,EAGJ,OAAO,CACV,WACa;AAAA,IACb,YAAY,KAAK,UAAU,MAAM;AAAA,MAC7B,IAAI,UAAU,OAAO,KAAK,IAAI;AAAA,QAAG,OAAO;AAAA,IAC5C;AAAA,IACA;AAAA;AAAA,EAGG,SAAS,CACZ,WACO;AAAA,IACP,OAAO,KAAK,KAAK,SAAS;AAAA;AAAA,EAGvB,KAAK,CACR,WACM;AAAA,IACN,IAAI,UAAU;AAAA,IACd,YAAY,KAAK,UAAU,MAAM;AAAA,MAC7B,IAAI,UAAU,OAAO,KAAK,IAAI,KAAK,KAAK,OAAO,GAAG;AAAA,QAAG;AAAA,IACzD;AAAA,IACA,OAAO;AAAA;AAAA,EAGJ,UAAU,GAAuB;AAAA,IACpC,YAAY,KAAK,UAAU;AAAA,MAAM,OAAO,CAAC,KAAK,KAAK;AAAA,IACnD;AAAA;AAAA,EAGG,SAAS,GAAuB;AAAA,IACnC,IAAI;AAAA,IACJ,WAAW,QAAQ;AAAA,MAAM,QAAQ,CAAC,KAAK,IAAI,KAAK,EAAE;AAAA,IAClD,OAAO;AAAA;AAAA,EAGJ,KAAK,CAAC,OAA2C;AAAA,IACpD,MAAM,SAAS,KAAK,MAAM;AAAA,IAC1B,YAAY,KAAK,UAAU;AAAA,MAAO,OAAO,IAAI,KAAK,KAAK;AAAA,IACvD,OAAO;AAAA;AAAA,EAGJ,YAAY,CAAC,OAA2C;AAAA,IAC3D,MAAM,SAAS,IAAI;AAAA,IACnB,YAAY,KAAK,UAAU,MAAM;AAAA,MAC7B,IAAI,MAAM,IAAI,GAAG;AAAA,QAAG,OAAO,IAAI,KAAK,KAAK;AAAA,IAC7C;AAAA,IACA,OAAO;AAAA;AAAA,EAGJ,UAAU,CAAC,OAA2C;AAAA,IACzD,MAAM,SAAS,IAAI;AAAA,IACnB,YAAY,KAAK,UAAU,MAAM;AAAA,MAC7B,IAAI,CAAC,MAAM,IAAI,GAAG;AAAA,QAAG,OAAO,IAAI,KAAK,KAAK;AAAA,IAC9C;AAAA,IACA,OAAO;AAAA;AAAA,EAKJ,SAAS,CACZ,WACoC;AAAA,IACpC,MAAM,OAAO,IAAI;AAAA,IACjB,MAAM,OAAO,IAAI;AAAA,IACjB,YAAY,KAAK,UAAU,MAAM;AAAA,MAC7B,IAAI,UAAU,OAAO,KAAK,IAAI;AAAA,QAAG,KAAK,IAAI,KAAK,KAAK;AAAA,MAC/C;AAAA,aAAK,IAAI,KAAK,KAAK;AAAA,IAC5B;AAAA,IACA,OAAO,CAAC,MAAM,IAAI;AAAA;AAAA,EAKf,GAAG,CAAC,IAAyC;AAAA,IAChD,GAAG,IAAI;AAAA,IACP,OAAO;AAAA;AAAA,EAGJ,OAAU,CACb,WACG;AAAA,IACH,MAAM,SAAc,CAAC;AAAA,IACrB,YAAY,KAAK,UAAU,MAAM;AAAA,MAC7B,WAAW,QAAQ,UAAU,OAAO,KAAK,IAAI;AAAA,QAAG,OAAO,KAAK,IAAI;AAAA,IACpE;AAAA,IACA,OAAO;AAAA;AAAA,EAGJ,MAAS,CACZ,IACA,cACC;AAAA,IACD,IAAI,MAAM;AAAA,IACV,YAAY,KAAK,UAAU;AAAA,MAAM,MAAM,GAAG,KAAK,OAAO,KAAK,IAAI;AAAA,IAC/D,OAAO;AAAA;AAAA,EAKJ,MAAM,CACT,YACgB;AAAA,IAIhB,MAAM,YAAY,CAAC,GAAG,KAAK,QAAQ,CAAC,EAAE,IAAI,CAAC,OAAO,WAAW;AAAA,MACzD;AAAA,MACA;AAAA,IACJ,EAAE;AAAA,IACF,IAAI;AAAA,MACA,UAAU,KAAK,CAAC,GAAG,MAAM;AAAA,QACrB,MAAM,aAAa,WACf,EAAE,MAAM,IACR,EAAE,MAAM,IACR,EAAE,MAAM,IACR,EAAE,MAAM,EACZ;AAAA,QACA,OAAO,eAAe,IAAI,aAAa,EAAE,QAAQ,EAAE;AAAA,OACtD;AAAA,IACL,MAAM,SAAS,IAAI;AAAA,IACnB,aAAa,WAAW;AAAA,MAAW,OAAO,IAAI,MAAM,IAAI,MAAM,EAAE;AAAA,IAChE,OAAO;AAAA;AAAA,EAKJ,MAAM,GAAkB;AAAA,IAC3B,MAAM,MAAM,CAAC,GAAG,KAAK,OAAO,CAAC;AAAA,IAC7B,IAAI,CAAC,IAAI;AAAA,MAAQ;AAAA,IACjB,OAAO,IAAI,KAAK,MAAM,KAAK,OAAO,IAAI,IAAI,MAAM;AAAA;AAAA,EAK7C,SAAS,GAAkB;AAAA,IAC9B,MAAM,MAAM,CAAC,GAAG,KAAK,KAAK,CAAC;AAAA,IAC3B,IAAI,CAAC,IAAI;AAAA,MAAQ;AAAA,IACjB,OAAO,IAAI,KAAK,MAAM,KAAK,OAAO,IAAI,IAAI,MAAM;AAAA;AAAA,EAG7C,EAAE,CAAC,OAA8B;AAAA,IACpC,MAAM,MAAM,CAAC,GAAG,KAAK,OAAO,CAAC;AAAA,IAC7B,MAAM,IAAI,QAAQ,IAAI,IAAI,SAAS,QAAQ;AAAA,IAC3C,OAAO,IAAI;AAAA;AAAA,EAGR,KAAK,CAAC,OAA8B;AAAA,IACvC,MAAM,MAAM,CAAC,GAAG,KAAK,KAAK,CAAC;AAAA,IAC3B,MAAM,IAAI,QAAQ,IAAI,IAAI,SAAS,QAAQ;AAAA,IAC3C,OAAO,IAAI;AAAA;AAAA,EAGR,MAAM,GAAa;AAAA,IACtB,OAAO,CAAC,GAAG,KAAK,QAAQ,CAAC;AAAA;AAEjC;",
-  "debugId": "F7AF9637261DF97664756E2164756E21",
+  "mappings": ";;AAeO,MAAM,MAAY;AAAA,EACZ,WAAW,IAAI;AAAA,EACf;AAAA,EACA;AAAA,EACT;AAAA,EAGO,WAAW,CAAC,UAAwB,CAAC,GAAG;AAAA,IAC3C,KAAK,WAAW,QAAQ,WAAW;AAAA,IACnC,KAAK,OAAO,QAAQ,OAAO;AAAA,IAC3B,IACK,CAAC,OAAO,UAAU,KAAK,QAAQ,KAAK,KAAK,aAAa,YACvD,KAAK,WAAW;AAAA,MAEhB,MAAM,IAAI,WAAW,2CAA2C;AAAA,IACpE,IAAI,CAAC,OAAO,SAAS,KAAK,IAAI,KAAK,KAAK,OAAO;AAAA,MAC3C,MAAM,IAAI,WACN,iDACJ;AAAA,IACJ,IAAI,KAAK,OAAO,GAAG;AAAA,MACf,MAAM,WACF,QAAQ,iBAAiB,KAAK,IAAI,KAAK,MAAM,KAAM;AAAA,MACvD,IAAI,CAAC,OAAO,SAAS,QAAQ,KAAK,WAAW;AAAA,QACzC,MAAM,IAAI,WAAW,uCAAuC;AAAA,MAChE,KAAK,SAAS,YAAY,MAAM,KAAK,MAAM,GAAG,QAAQ;AAAA,MAGrD,KAAK,OAAkC,QAAQ;AAAA,IACpD;AAAA;AAAA,MAIO,IAAI,GAAW;AAAA,IACtB,KAAK,cAAc;AAAA,IACnB,OAAO,KAAK,SAAS;AAAA;AAAA,EAGlB,GAAG,CAAC,KAAuB;AAAA,IAC9B,MAAM,QAAQ,KAAK,SAAS,IAAI,GAAG;AAAA,IACnC,IAAI,CAAC;AAAA,MAAO;AAAA,IACZ,IAAI,MAAM,YAAY,KAAK,MAAM,aAAa,KAAK,IAAI,GAAG;AAAA,MACtD,KAAK,SAAS,OAAO,GAAG;AAAA,MACxB;AAAA,IACJ;AAAA,IAEA,KAAK,SAAS,OAAO,GAAG;AAAA,IACxB,KAAK,SAAS,IAAI,KAAK,KAAK;AAAA,IAC5B,OAAO,MAAM;AAAA;AAAA,EAGV,GAAG,CAAC,KAAiB;AAAA,IACxB,MAAM,QAAQ,KAAK,SAAS,IAAI,GAAG;AAAA,IACnC,IAAI,CAAC;AAAA,MAAO,OAAO;AAAA,IACnB,IAAI,MAAM,YAAY,KAAK,MAAM,aAAa,KAAK,IAAI,GAAG;AAAA,MACtD,KAAK,SAAS,OAAO,GAAG;AAAA,MACxB,OAAO;AAAA,IACX;AAAA,IACA,OAAO;AAAA;AAAA,EAGJ,GAAG,CAAC,KAAQ,OAAgB;AAAA,IAC/B,MAAM,YAAY,KAAK,OAAO,IAAI,KAAK,IAAI,IAAI,KAAK,OAAO;AAAA,IAC3D,KAAK,SAAS,OAAO,GAAG;AAAA,IACxB,KAAK,SAAS,IAAI,KAAK,EAAE,OAAO,UAAU,CAAC;AAAA,IAE3C,IAAI,KAAK,aAAa,UAAU;AAAA,MAC5B,OAAO,KAAK,SAAS,OAAO,KAAK,UAAU;AAAA,QACvC,MAAM,SAAS,KAAK,SAAS,SAAS;AAAA,QACtC,IAAI,WAAW;AAAA,UAAW,KAAK,SAAS,OAAO,MAAM;AAAA,QAChD;AAAA;AAAA,MACT;AAAA,IACJ;AAAA,IACA,OAAO;AAAA;AAAA,EAGJ,MAAM,CAAC,KAAiB;AAAA,IAC3B,OAAO,KAAK,SAAS,OAAO,GAAG;AAAA;AAAA,EAG5B,KAAK,GAAS;AAAA,IACjB,KAAK,SAAS,MAAM;AAAA;AAAA,EAGjB,UAAU,CAAC,WAAkD;AAAA,IAChE,OAAO,KAAK,SAAS,MAAM,CAAC,OAAO,QAAQ,UAAU,MAAM,OAAO,GAAG,CAAC;AAAA;AAAA,EAGnE,KAAK,GAAW;AAAA,IACnB,OAAO,KAAK,SAAS,MAAM,CAAC,UAAU,KAAK,SAAS,KAAK,CAAC;AAAA;AAAA,EAGvD,OAAO,GAAS;AAAA,IACnB,IAAI,KAAK;AAAA,MAAQ,cAAc,KAAK,MAAM;AAAA,IAC1C,KAAK,SAAS;AAAA;AAAA,EAGX,MAAM,GAAQ;AAAA,IACjB,KAAK,cAAc;AAAA,IACnB,OAAO,KAAK,SAAS,IAAI,CAAC,UAAU,MAAM,KAAK;AAAA;AAAA,EAG5C,OAAO,GAAa;AAAA,IACvB,KAAK,cAAc;AAAA,IACnB,OAAO,KAAK,SAAS,IAAI,CAAC,OAAO,QAAQ,CAAC,KAAK,MAAM,KAAK,CAAC;AAAA;AAAA,EAE/D,QAAQ,CAAC,OAA0B;AAAA,IAC/B,OAAO,MAAM,YAAY,KAAK,MAAM,aAAa,KAAK,IAAI;AAAA;AAAA,EAE9D,aAAa,GAAS;AAAA,IAClB,IAAI,KAAK,OAAO;AAAA,MAAG,KAAK,MAAM;AAAA;AAEtC;;;AC7HO,MAAM,mBAAyB,IAAU;AAAA,EAErC,KAAK,GAAkB;AAAA,IAC1B,WAAW,SAAS,KAAK,OAAO;AAAA,MAAG,OAAO;AAAA,IAC1C;AAAA;AAAA,EAGG,QAAQ,GAAkB;AAAA,IAC7B,WAAW,OAAO,KAAK,KAAK;AAAA,MAAG,OAAO;AAAA,IACtC;AAAA;AAAA,EAGG,IAAI,GAAkB;AAAA,IACzB,IAAI;AAAA,IACJ,WAAW,QAAQ,KAAK,OAAO;AAAA,MAAG,QAAQ;AAAA,IAC1C,OAAO;AAAA;AAAA,EAGJ,OAAO,GAAkB;AAAA,IAC5B,IAAI;AAAA,IACJ,WAAW,QAAQ,KAAK,KAAK;AAAA,MAAG,MAAM;AAAA,IACtC,OAAO;AAAA;AAAA,EAGJ,IAAI,CACP,WACa;AAAA,IACb,YAAY,KAAK,UAAU,MAAM;AAAA,MAC7B,IAAI,UAAU,OAAO,KAAK,IAAI;AAAA,QAAG,OAAO;AAAA,IAC5C;AAAA,IACA;AAAA;AAAA,EAGG,MAAM,CACT,WACgB;AAAA,IAChB,MAAM,SAAS,IAAI;AAAA,IACnB,YAAY,KAAK,UAAU,MAAM;AAAA,MAC7B,IAAI,UAAU,OAAO,KAAK,IAAI;AAAA,QAAG,OAAO,IAAI,KAAK,KAAK;AAAA,IAC1D;AAAA,IACA,OAAO;AAAA;AAAA,EAGJ,GAAM,CAAC,WAA2D;AAAA,IACrE,MAAM,SAAc,CAAC;AAAA,IACrB,YAAY,KAAK,UAAU,MAAM;AAAA,MAC7B,OAAO,KAAK,UAAU,OAAO,KAAK,IAAI,CAAC;AAAA,IAC3C;AAAA,IACA,OAAO;AAAA;AAAA,EAGJ,IAAI,CACP,WACO;AAAA,IACP,YAAY,KAAK,UAAU,MAAM;AAAA,MAC7B,IAAI,UAAU,OAAO,KAAK,IAAI;AAAA,QAAG,OAAO;AAAA,IAC5C;AAAA,IACA,OAAO;AAAA;AAAA,EAGJ,KAAK,CACR,WACO;AAAA,IACP,YAAY,KAAK,UAAU,MAAM;AAAA,MAC7B,IAAI,CAAC,UAAU,OAAO,KAAK,IAAI;AAAA,QAAG,OAAO;AAAA,IAC7C;AAAA,IACA,OAAO;AAAA;AAAA,EAGJ,IAAI,CACP,UACI;AAAA,IACJ,YAAY,KAAK,UAAU,MAAM;AAAA,MAC7B,SAAS,OAAO,KAAK,IAAI;AAAA,IAC7B;AAAA,IACA,OAAO;AAAA;AAAA,EAGJ,KAAK,GAAQ;AAAA,IAChB,OAAO,CAAC,GAAG,KAAK,OAAO,CAAC;AAAA;AAAA,EAGrB,QAAQ,GAAQ;AAAA,IACnB,OAAO,CAAC,GAAG,KAAK,KAAK,CAAC;AAAA;AAAA,EAGnB,YAAY,GAAa;AAAA,IAC5B,OAAO,CAAC,GAAG,KAAK,QAAQ,CAAC;AAAA;AAAA,EAGtB,KAAK,GAAqB;AAAA,IAC7B,MAAM,OAAO,IAAI;AAAA,IACjB,YAAY,KAAK,UAAU;AAAA,MAAM,KAAK,IAAI,KAAK,KAAK;AAAA,IACpD,OAAO;AAAA;AAAA,EAGJ,MAAM,IAAI,MAAoB;AAAA,IACjC,SAAS,IAAI,EAAG,IAAI,KAAK,QAAQ,KAAK;AAAA,MAClC,IAAI,CAAC,KAAK,IAAI,KAAK,EAAG;AAAA,QAAG,OAAO;AAAA,IACpC;AAAA,IACA,OAAO;AAAA;AAAA,EAGJ,MAAM,IAAI,MAAoB;AAAA,IACjC,SAAS,IAAI,EAAG,IAAI,KAAK,QAAQ,KAAK;AAAA,MAClC,IAAI,KAAK,IAAI,KAAK,EAAG;AAAA,QAAG,OAAO;AAAA,IACnC;AAAA,IACA,OAAO;AAAA;AAAA,EAGJ,OAAO,CACV,WACa;AAAA,IACb,YAAY,KAAK,UAAU,MAAM;AAAA,MAC7B,IAAI,UAAU,OAAO,KAAK,IAAI;AAAA,QAAG,OAAO;AAAA,IAC5C;AAAA,IACA;AAAA;AAAA,EAGG,SAAS,CACZ,WACO;AAAA,IACP,OAAO,KAAK,KAAK,SAAS;AAAA;AAAA,EAGvB,KAAK,CACR,WACM;AAAA,IACN,IAAI,UAAU;AAAA,IACd,YAAY,KAAK,UAAU,MAAM;AAAA,MAC7B,IAAI,UAAU,OAAO,KAAK,IAAI,KAAK,KAAK,OAAO,GAAG;AAAA,QAAG;AAAA,IACzD;AAAA,IACA,OAAO;AAAA;AAAA,EAGJ,UAAU,GAAuB;AAAA,IACpC,YAAY,KAAK,UAAU;AAAA,MAAM,OAAO,CAAC,KAAK,KAAK;AAAA,IACnD;AAAA;AAAA,EAGG,SAAS,GAAuB;AAAA,IACnC,IAAI;AAAA,IACJ,WAAW,QAAQ;AAAA,MAAM,QAAQ,CAAC,KAAK,IAAI,KAAK,EAAE;AAAA,IAClD,OAAO;AAAA;AAAA,EAGJ,KAAK,CAAC,OAA2C;AAAA,IACpD,MAAM,SAAS,KAAK,MAAM;AAAA,IAC1B,YAAY,KAAK,UAAU;AAAA,MAAO,OAAO,IAAI,KAAK,KAAK;AAAA,IACvD,OAAO;AAAA;AAAA,EAGJ,YAAY,CAAC,OAA2C;AAAA,IAC3D,MAAM,SAAS,IAAI;AAAA,IACnB,YAAY,KAAK,UAAU,MAAM;AAAA,MAC7B,IAAI,MAAM,IAAI,GAAG;AAAA,QAAG,OAAO,IAAI,KAAK,KAAK;AAAA,IAC7C;AAAA,IACA,OAAO;AAAA;AAAA,EAGJ,UAAU,CAAC,OAA2C;AAAA,IACzD,MAAM,SAAS,IAAI;AAAA,IACnB,YAAY,KAAK,UAAU,MAAM;AAAA,MAC7B,IAAI,CAAC,MAAM,IAAI,GAAG;AAAA,QAAG,OAAO,IAAI,KAAK,KAAK;AAAA,IAC9C;AAAA,IACA,OAAO;AAAA;AAAA,EAKJ,SAAS,CACZ,WACoC;AAAA,IACpC,MAAM,OAAO,IAAI;AAAA,IACjB,MAAM,OAAO,IAAI;AAAA,IACjB,YAAY,KAAK,UAAU,MAAM;AAAA,MAC7B,IAAI,UAAU,OAAO,KAAK,IAAI;AAAA,QAAG,KAAK,IAAI,KAAK,KAAK;AAAA,MAC/C;AAAA,aAAK,IAAI,KAAK,KAAK;AAAA,IAC5B;AAAA,IACA,OAAO,CAAC,MAAM,IAAI;AAAA;AAAA,EAKf,GAAG,CAAC,IAAyC;AAAA,IAChD,GAAG,IAAI;AAAA,IACP,OAAO;AAAA;AAAA,EAGJ,OAAU,CACb,WACG;AAAA,IACH,MAAM,SAAc,CAAC;AAAA,IACrB,YAAY,KAAK,UAAU,MAAM;AAAA,MAC7B,WAAW,QAAQ,UAAU,OAAO,KAAK,IAAI;AAAA,QAAG,OAAO,KAAK,IAAI;AAAA,IACpE;AAAA,IACA,OAAO;AAAA;AAAA,EAGJ,MAAS,CACZ,IACA,cACC;AAAA,IACD,IAAI,MAAM;AAAA,IACV,YAAY,KAAK,UAAU;AAAA,MAAM,MAAM,GAAG,KAAK,OAAO,KAAK,IAAI;AAAA,IAC/D,OAAO;AAAA;AAAA,EAKJ,MAAM,CACT,YACgB;AAAA,IAIhB,MAAM,YAAY,CAAC,GAAG,KAAK,QAAQ,CAAC,EAAE,IAAI,CAAC,OAAO,WAAW;AAAA,MACzD;AAAA,MACA;AAAA,IACJ,EAAE;AAAA,IACF,IAAI;AAAA,MACA,UAAU,KAAK,CAAC,GAAG,MAAM;AAAA,QACrB,MAAM,aAAa,WACf,EAAE,MAAM,IACR,EAAE,MAAM,IACR,EAAE,MAAM,IACR,EAAE,MAAM,EACZ;AAAA,QACA,OAAO,eAAe,IAAI,aAAa,EAAE,QAAQ,EAAE;AAAA,OACtD;AAAA,IACL,MAAM,SAAS,IAAI;AAAA,IACnB,aAAa,WAAW;AAAA,MAAW,OAAO,IAAI,MAAM,IAAI,MAAM,EAAE;AAAA,IAChE,OAAO;AAAA;AAAA,EAKJ,MAAM,GAAkB;AAAA,IAC3B,MAAM,MAAM,CAAC,GAAG,KAAK,OAAO,CAAC;AAAA,IAC7B,IAAI,CAAC,IAAI;AAAA,MAAQ;AAAA,IACjB,OAAO,IAAI,KAAK,MAAM,KAAK,OAAO,IAAI,IAAI,MAAM;AAAA;AAAA,EAK7C,SAAS,GAAkB;AAAA,IAC9B,MAAM,MAAM,CAAC,GAAG,KAAK,KAAK,CAAC;AAAA,IAC3B,IAAI,CAAC,IAAI;AAAA,MAAQ;AAAA,IACjB,OAAO,IAAI,KAAK,MAAM,KAAK,OAAO,IAAI,IAAI,MAAM;AAAA;AAAA,EAG7C,EAAE,CAAC,OAA8B;AAAA,IACpC,MAAM,MAAM,CAAC,GAAG,KAAK,OAAO,CAAC;AAAA,IAC7B,MAAM,IAAI,QAAQ,IAAI,IAAI,SAAS,QAAQ;AAAA,IAC3C,OAAO,IAAI;AAAA;AAAA,EAGR,KAAK,CAAC,OAA8B;AAAA,IACvC,MAAM,MAAM,CAAC,GAAG,KAAK,KAAK,CAAC;AAAA,IAC3B,MAAM,IAAI,QAAQ,IAAI,IAAI,SAAS,QAAQ;AAAA,IAC3C,OAAO,IAAI;AAAA;AAAA,EAGR,MAAM,GAAa;AAAA,IACtB,OAAO,CAAC,GAAG,KAAK,QAAQ,CAAC;AAAA;AAEjC;",
+  "debugId": "7983082ABFA81D2164756E2164756E21",
   "names": []
 }

package/dist/core/events.d.ts

@@ -1,3 +1,5 @@
+import type { APIAutoModerationActionExecution, APIAutoModerationRule, APIChannel, APIChannelPinsUpdate, APIGuild, APIGuildBanEvent, APIGuildEmojisUpdateEvent, APIGuildMember, APIGuildMembersChunk, APIGuildRoleDeleteEvent, APIGuildRoleEvent, APIGuildScheduledEvent, APIGuildScheduledEventUserEvent, APIGuildStickersUpdateEvent, APIInviteCreate, APIInviteDelete, APIMessageDeleteBulkEvent, APIMessageDeleteEvent, APIMessagePollVoteEvent, APIMessageReactionEvent, APIMessageReactionRemoveEmojiEvent, APIPresenceUpdate, APIStageInstance, APIThreadEvent, APIThreadListSync, APIThreadMember, APIThreadMembersUpdate, APITypingStart, APIVoiceServerUpdate, APIVoiceState, APIWebhooksUpdate, ClientUser } from "@lunibee/types";
+import type { Channel, Interaction, Message } from "@lunibee/structures";
 /** Names of events emitted by a Lunibee client. */
 export declare enum ClientEvent {
     Ready = "ready",
@@ -66,6 +68,88 @@ export declare enum ClientEvent {
     InteractionCreate = "interactionCreate"
 }
 /** Names of events emitted by a Lunibee client. */
-export type ClientEventName = keyof import("./index.js").ClientEvents;
+export type ClientEventName = keyof ClientEvents;
 /** Listener signature for a Lunibee client event. */
-export type ClientListener<K extends ClientEventName> = (...args: import("./index.js").ClientEvents[K]) => unknown;
+export type ClientListener<K extends ClientEventName> = (...args: ClientEvents[K]) => unknown;
+export type ClientEvents = {
+    ready: [user: ClientUser];
+    resumed: [];
+    invalidSession: [isRecoverable: boolean];
+    raw: [data: {
+        event: string;
+        data: unknown;
+    }];
+    error: [error: Error];
+    open: [];
+    close: [data: {
+        code: number;
+        action: string;
+    }];
+    messageCreate: [message: Message];
+    messageUpdate: [message: Message];
+    messageDelete: [data: APIMessageDeleteEvent];
+    messageDeleteBulk: [data: APIMessageDeleteBulkEvent];
+    messageReactionAdd: [data: APIMessageReactionEvent];
+    messageReactionRemove: [data: APIMessageReactionEvent];
+    messageReactionRemoveAll: [data: APIMessageDeleteEvent];
+    messageReactionRemoveEmoji: [data: APIMessageReactionRemoveEmojiEvent];
+    messagePollVoteAdd: [data: APIMessagePollVoteEvent];
+    messagePollVoteRemove: [data: APIMessagePollVoteEvent];
+    guildCreate: [data: APIGuild];
+    guildUpdate: [data: APIGuild];
+    guildDelete: [data: {
+        id: string;
+        unavailable?: boolean;
+    }];
+    guildAvailable: [data: APIGuild & {
+        unavailable?: boolean;
+    }];
+    guildUnavailable: [data: {
+        id: string;
+        unavailable?: boolean;
+    }];
+    guildMemberAdd: [member: APIGuildMember];
+    guildMemberUpdate: [member: APIGuildMember];
+    guildMemberRemove: [member: APIGuildMember];
+    guildMembersChunk: [data: APIGuildMembersChunk];
+    guildBanAdd: [data: APIGuildBanEvent];
+    guildBanRemove: [data: APIGuildBanEvent];
+    guildRoleCreate: [data: APIGuildRoleEvent];
+    guildRoleUpdate: [data: APIGuildRoleEvent];
+    guildRoleDelete: [data: APIGuildRoleDeleteEvent];
+    guildEmojisUpdate: [data: APIGuildEmojisUpdateEvent];
+    guildStickersUpdate: [data: APIGuildStickersUpdateEvent];
+    guildIntegrationsUpdate: [data: {
+        guild_id: string;
+    }];
+    guildScheduledEventCreate: [data: APIGuildScheduledEvent];
+    guildScheduledEventUpdate: [data: APIGuildScheduledEvent];
+    guildScheduledEventDelete: [data: APIGuildScheduledEvent];
+    guildScheduledEventUserAdd: [data: APIGuildScheduledEventUserEvent];
+    guildScheduledEventUserRemove: [data: APIGuildScheduledEventUserEvent];
+    autoModerationRuleCreate: [data: APIAutoModerationRule];
+    autoModerationRuleUpdate: [data: APIAutoModerationRule];
+    autoModerationRuleDelete: [data: APIAutoModerationRule];
+    autoModerationActionExecution: [data: APIAutoModerationActionExecution];
+    channelCreate: [channel: Channel];
+    channelUpdate: [channel: Channel];
+    channelDelete: [data: APIChannel];
+    channelPinsUpdate: [data: APIChannelPinsUpdate];
+    threadCreate: [channel: Channel];
+    threadUpdate: [channel: Channel];
+    threadDelete: [data: APIThreadEvent];
+    threadListSync: [data: APIThreadListSync];
+    threadMembersUpdate: [data: APIThreadMembersUpdate];
+    threadMemberUpdate: [data: APIThreadMember];
+    stageInstanceCreate: [data: APIStageInstance];
+    stageInstanceUpdate: [data: APIStageInstance];
+    stageInstanceDelete: [data: APIStageInstance];
+    inviteCreate: [data: APIInviteCreate];
+    inviteDelete: [data: APIInviteDelete];
+    webhooksUpdate: [data: APIWebhooksUpdate];
+    voiceStateUpdate: [data: APIVoiceState];
+    voiceServerUpdate: [data: APIVoiceServerUpdate];
+    presenceUpdate: [data: APIPresenceUpdate];
+    typingStart: [data: APITypingStart];
+    interactionCreate: [interaction: Interaction];
+};

package/dist/core/index.d.ts

@@ -1,12 +1,15 @@
 export { Permission, Permissions, PermissionFlagsBits, PermissionSet, PermissionsBitField, PermissionOverwriteType, type PermissionName, } from "./permissions.js";
-export { ClientEvent, type ClientEventName, type ClientListener, } from "./events.js";
+export { ClientEvent, 
+/** Discord.js-familiar alias for {@link ClientEvent}. */
+ClientEvent as Events, type ClientEventName, type ClientEvents, type ClientListener, } from "./events.js";
 export { Collector, type CollectorOptions } from "./collector.js";
-export { GatewayIntentBits, IntentBits, Intents, resolveGatewayIntents, type GatewayIntentResolvable, } from "@lunibee/types";
-import { ApplicationCommandManager, ChannelManager, GuildManager, UserManager } from "@lunibee/managers";
+export { GatewayIntentBits, IntentBits, Intents, IntentsBitField, resolveGatewayIntents, type GatewayIntentResolvable, } from "@lunibee/types";
+import { ApplicationCommandManager, ChannelManager, GuildManager, StageInstanceManager, UserManager } from "@lunibee/managers";
 import { REST } from "@lunibee/rest";
-import { Channel, Message, Interaction, type InteractionClient } from "@lunibee/structures";
+import { type InteractionClient } from "@lunibee/structures";
 import { Gateway } from "@lunibee/ws";
-import type { APIChannel, APIGuild, APIGuildMember, APIGuildRoleEvent, APIGuildRoleDeleteEvent, APIGuildBanEvent, APIGuildEmojisUpdateEvent, APIGuildStickersUpdateEvent, APIMessageDeleteBulkEvent, APIMessageDeleteEvent, APIMessageReactionEvent, APIMessageReactionRemoveEmojiEvent, APIThreadEvent, APIThreadListSync, APIThreadMembersUpdate, APIVoiceState, APIVoiceServerUpdate, APIPresenceUpdate, APITypingStart, APIInviteCreate, APIInviteDelete, APIWebhooksUpdate, APIAutoModerationRule, APIAutoModerationActionExecution, APIGuildScheduledEvent, APIGuildScheduledEventUserEvent, APIStageInstance, APIChannelPinsUpdate, APIGuildMembersChunk, APIMessagePollVoteEvent, APIThreadMember, ClientOptions, ClientUser } from "@lunibee/types";
+import type { ClientOptions, ClientUser } from "@lunibee/types";
+import { type ClientEvents } from "./events.js";
 /** Lifecycle state of a client. */
 export type ClientState = "idle" | "connecting" | "ready" | "destroyed";
 type Listener<T extends unknown[]> = (...args: T) => unknown;
@@ -31,6 +34,8 @@ export declare class Client extends EventEmitter<ClientEvents> implements Intera
     readonly users: UserManager;
     readonly guilds: GuildManager;
     readonly channels: ChannelManager;
+    /** Stage instances, cached by stage channel ID. */
+    readonly stageInstances: StageInstanceManager;
     readonly application: {
         commands: ApplicationCommandManager;
     };
@@ -95,85 +100,3 @@ export declare class Client extends EventEmitter<ClientEvents> implements Intera
         permissions?: string | bigint;
     }): string;
 }
-export type ClientEvents = {
-    ready: [user: ClientUser];
-    resumed: [];
-    invalidSession: [isRecoverable: boolean];
-    raw: [data: {
-        event: string;
-        data: unknown;
-    }];
-    error: [error: Error];
-    open: [];
-    close: [data: {
-        code: number;
-        action: string;
-    }];
-    messageCreate: [message: Message];
-    messageUpdate: [message: Message];
-    messageDelete: [data: APIMessageDeleteEvent];
-    messageDeleteBulk: [data: APIMessageDeleteBulkEvent];
-    messageReactionAdd: [data: APIMessageReactionEvent];
-    messageReactionRemove: [data: APIMessageReactionEvent];
-    messageReactionRemoveAll: [data: APIMessageDeleteEvent];
-    messageReactionRemoveEmoji: [data: APIMessageReactionRemoveEmojiEvent];
-    messagePollVoteAdd: [data: APIMessagePollVoteEvent];
-    messagePollVoteRemove: [data: APIMessagePollVoteEvent];
-    guildCreate: [data: APIGuild];
-    guildUpdate: [data: APIGuild];
-    guildDelete: [data: {
-        id: string;
-        unavailable?: boolean;
-    }];
-    guildAvailable: [data: APIGuild & {
-        unavailable?: boolean;
-    }];
-    guildUnavailable: [data: {
-        id: string;
-        unavailable?: boolean;
-    }];
-    guildMemberAdd: [member: APIGuildMember];
-    guildMemberUpdate: [member: APIGuildMember];
-    guildMemberRemove: [member: APIGuildMember];
-    guildMembersChunk: [data: APIGuildMembersChunk];
-    guildBanAdd: [data: APIGuildBanEvent];
-    guildBanRemove: [data: APIGuildBanEvent];
-    guildRoleCreate: [data: APIGuildRoleEvent];
-    guildRoleUpdate: [data: APIGuildRoleEvent];
-    guildRoleDelete: [data: APIGuildRoleDeleteEvent];
-    guildEmojisUpdate: [data: APIGuildEmojisUpdateEvent];
-    guildStickersUpdate: [data: APIGuildStickersUpdateEvent];
-    guildIntegrationsUpdate: [data: {
-        guild_id: string;
-    }];
-    guildScheduledEventCreate: [data: APIGuildScheduledEvent];
-    guildScheduledEventUpdate: [data: APIGuildScheduledEvent];
-    guildScheduledEventDelete: [data: APIGuildScheduledEvent];
-    guildScheduledEventUserAdd: [data: APIGuildScheduledEventUserEvent];
-    guildScheduledEventUserRemove: [data: APIGuildScheduledEventUserEvent];
-    autoModerationRuleCreate: [data: APIAutoModerationRule];
-    autoModerationRuleUpdate: [data: APIAutoModerationRule];
-    autoModerationRuleDelete: [data: APIAutoModerationRule];
-    autoModerationActionExecution: [data: APIAutoModerationActionExecution];
-    channelCreate: [channel: Channel];
-    channelUpdate: [channel: Channel];
-    channelDelete: [data: APIChannel];
-    channelPinsUpdate: [data: APIChannelPinsUpdate];
-    threadCreate: [channel: Channel];
-    threadUpdate: [channel: Channel];
-    threadDelete: [data: APIThreadEvent];
-    threadListSync: [data: APIThreadListSync];
-    threadMembersUpdate: [data: APIThreadMembersUpdate];
-    threadMemberUpdate: [data: APIThreadMember];
-    stageInstanceCreate: [data: APIStageInstance];
-    stageInstanceUpdate: [data: APIStageInstance];
-    stageInstanceDelete: [data: APIStageInstance];
-    inviteCreate: [data: APIInviteCreate];
-    inviteDelete: [data: APIInviteDelete];
-    webhooksUpdate: [data: APIWebhooksUpdate];
-    voiceStateUpdate: [data: APIVoiceState];
-    voiceServerUpdate: [data: APIVoiceServerUpdate];
-    presenceUpdate: [data: APIPresenceUpdate];
-    typingStart: [data: APITypingStart];
-    interactionCreate: [interaction: Interaction];
-};