lunibee 0.1.6 → 0.1.7

package/dist/collection/index.js

@@ -49,10 +49,14 @@ class Cache {
     const expiresAt = this.#ttl > 0 ? Date.now() + this.#ttl : 0;
     this.#entries.delete(key);
     this.#entries.set(key, { value, expiresAt });
-    while (this.#entries.size > this.#maxSize) {
-      const oldest = this.#entries.firstKey();
-      if (oldest !== undefined)
-        this.#entries.delete(oldest);
+    if (this.#maxSize !== Infinity) {
+      while (this.#entries.size > this.#maxSize) {
+        const oldest = this.#entries.firstKey();
+        if (oldest !== undefined)
+          this.#entries.delete(oldest);
+        else
+          break;
+      }
     }
     return this;
   }
@@ -236,10 +240,79 @@ class Collection extends Map {
     }
     return result;
   }
+  partition(predicate) {
+    const pass = new Collection;
+    const fail = new Collection;
+    for (const [key, value] of this) {
+      if (predicate(value, key, this))
+        pass.set(key, value);
+      else
+        fail.set(key, value);
+    }
+    return [pass, fail];
+  }
+  tap(fn) {
+    fn(this);
+    return this;
+  }
+  flatMap(transform) {
+    const result = [];
+    for (const [key, value] of this) {
+      for (const item of transform(value, key, this))
+        result.push(item);
+    }
+    return result;
+  }
+  reduce(fn, initialValue) {
+    let acc = initialValue;
+    for (const [key, value] of this)
+      acc = fn(acc, value, key, this);
+    return acc;
+  }
+  sorted(comparator) {
+    const decorated = [...this.entries()].map((entry, index) => ({
+      entry,
+      index
+    }));
+    if (comparator)
+      decorated.sort((x, y) => {
+        const comparison = comparator(x.entry[1], y.entry[1], x.entry[0], y.entry[0]);
+        return comparison !== 0 ? comparison : x.index - y.index;
+      });
+    const result = new Collection;
+    for (const { entry } of decorated)
+      result.set(entry[0], entry[1]);
+    return result;
+  }
+  random() {
+    const arr = [...this.values()];
+    if (!arr.length)
+      return;
+    return arr[Math.floor(Math.random() * arr.length)];
+  }
+  randomKey() {
+    const arr = [...this.keys()];
+    if (!arr.length)
+      return;
+    return arr[Math.floor(Math.random() * arr.length)];
+  }
+  at(index) {
+    const arr = [...this.values()];
+    const i = index < 0 ? arr.length + index : index;
+    return arr[i];
+  }
+  keyAt(index) {
+    const arr = [...this.keys()];
+    const i = index < 0 ? arr.length + index : index;
+    return arr[i];
+  }
+  toJSON() {
+    return [...this.entries()];
+  }
 }
 export {
   Cache,
   Collection
 };
 
-//# debugId=11CC5C678785E5CD64756E2164756E21
+//# debugId=F7AF9637261DF97664756E2164756E21

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(\"Cache ttl must be a non-negative finite number.\");\r\n    if (this.#ttl > 0) {\r\n      const interval = 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    while (this.#entries.size > this.#maxSize) {\r\n      const oldest = this.#entries.firstKey();\r\n      if (oldest !== undefined) this.#entries.delete(oldest);\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(callback: (value: V, key: K, collection: this) => unknown): 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}\r\n\r\nexport { Cache } from \"./cache.js\";\r\nexport type { CacheOptions } from \"./cache.js\";\r\n"
+    "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"
   ],
-  "mappings": ";;AAeO,MAAM,MAAY;AAAA,EACd,WAAW,IAAI;AAAA,EACf;AAAA,EACA;AAAA,EACT;AAAA,EAGO,WAAW,CAAC,UAAwB,CAAC,GAAG;AAAA,IAC7C,KAAK,WAAW,QAAQ,WAAW;AAAA,IACnC,KAAK,OAAO,QAAQ,OAAO;AAAA,IAC3B,IACG,CAAC,OAAO,UAAU,KAAK,QAAQ,KAAK,KAAK,aAAa,YACvD,KAAK,WAAW;AAAA,MAEhB,MAAM,IAAI,WAAW,2CAA2C;AAAA,IAClE,IAAI,CAAC,OAAO,SAAS,KAAK,IAAI,KAAK,KAAK,OAAO;AAAA,MAC7C,MAAM,IAAI,WAAW,iDAAiD;AAAA,IACxE,IAAI,KAAK,OAAO,GAAG;AAAA,MACjB,MAAM,WAAW,QAAQ,iBAAiB,KAAK,IAAI,KAAK,MAAM,KAAM;AAAA,MACpE,IAAI,CAAC,OAAO,SAAS,QAAQ,KAAK,WAAW;AAAA,QAC3C,MAAM,IAAI,WAAW,uCAAuC;AAAA,MAC9D,KAAK,SAAS,YAAY,MAAM,KAAK,MAAM,GAAG,QAAQ;AAAA,IACxD;AAAA;AAAA,MAIS,IAAI,GAAW;AAAA,IACxB,KAAK,cAAc;AAAA,IACnB,OAAO,KAAK,SAAS;AAAA;AAAA,EAGhB,GAAG,CAAC,KAAuB;AAAA,IAChC,MAAM,QAAQ,KAAK,SAAS,IAAI,GAAG;AAAA,IACnC,IAAI,CAAC;AAAA,MAAO;AAAA,IACZ,IAAI,MAAM,YAAY,KAAK,MAAM,aAAa,KAAK,IAAI,GAAG;AAAA,MACxD,KAAK,SAAS,OAAO,GAAG;AAAA,MACxB;AAAA,IACF;AAAA,IAEA,KAAK,SAAS,OAAO,GAAG;AAAA,IACxB,KAAK,SAAS,IAAI,KAAK,KAAK;AAAA,IAC5B,OAAO,MAAM;AAAA;AAAA,EAGR,GAAG,CAAC,KAAiB;AAAA,IAC1B,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,MACxD,KAAK,SAAS,OAAO,GAAG;AAAA,MACxB,OAAO;AAAA,IACT;AAAA,IACA,OAAO;AAAA;AAAA,EAGF,GAAG,CAAC,KAAQ,OAAgB;AAAA,IACjC,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,IAC3C,OAAO,KAAK,SAAS,OAAO,KAAK,UAAU;AAAA,MACzC,MAAM,SAAS,KAAK,SAAS,SAAS;AAAA,MACtC,IAAI,WAAW;AAAA,QAAW,KAAK,SAAS,OAAO,MAAM;AAAA,IACvD;AAAA,IACA,OAAO;AAAA;AAAA,EAGF,MAAM,CAAC,KAAiB;AAAA,IAC7B,OAAO,KAAK,SAAS,OAAO,GAAG;AAAA;AAAA,EAG1B,KAAK,GAAS;AAAA,IACnB,KAAK,SAAS,MAAM;AAAA;AAAA,EAGf,UAAU,CAAC,WAAkD;AAAA,IAClE,OAAO,KAAK,SAAS,MAAM,CAAC,OAAO,QAAQ,UAAU,MAAM,OAAO,GAAG,CAAC;AAAA;AAAA,EAGjE,KAAK,GAAW;AAAA,IACrB,OAAO,KAAK,SAAS,MAAM,CAAC,UAAU,KAAK,SAAS,KAAK,CAAC;AAAA;AAAA,EAGrD,OAAO,GAAS;AAAA,IACrB,IAAI,KAAK;AAAA,MAAQ,cAAc,KAAK,MAAM;AAAA,IAC1C,KAAK,SAAS;AAAA;AAAA,EAGT,MAAM,GAAQ;AAAA,IACnB,KAAK,cAAc;AAAA,IACnB,OAAO,KAAK,SAAS,IAAI,CAAC,UAAU,MAAM,KAAK;AAAA;AAAA,EAG1C,OAAO,GAAa;AAAA,IACzB,KAAK,cAAc;AAAA,IACnB,OAAO,KAAK,SAAS,IAAI,CAAC,OAAO,QAAQ,CAAC,KAAK,MAAM,KAAK,CAAC;AAAA;AAAA,EAE7D,QAAQ,CAAC,OAA0B;AAAA,IACjC,OAAO,MAAM,YAAY,KAAK,MAAM,aAAa,KAAK,IAAI;AAAA;AAAA,EAE5D,aAAa,GAAS;AAAA,IACpB,IAAI,KAAK,OAAO;AAAA,MAAG,KAAK,MAAM;AAAA;AAElC;;;ACnHO,MAAM,mBAAyB,IAAU;AAAA,EAEvC,KAAK,GAAkB;AAAA,IAC5B,WAAW,SAAS,KAAK,OAAO;AAAA,MAAG,OAAO;AAAA,IAC1C;AAAA;AAAA,EAGK,QAAQ,GAAkB;AAAA,IAC/B,WAAW,OAAO,KAAK,KAAK;AAAA,MAAG,OAAO;AAAA,IACtC;AAAA;AAAA,EAGK,IAAI,GAAkB;AAAA,IAC3B,IAAI;AAAA,IACJ,WAAW,QAAQ,KAAK,OAAO;AAAA,MAAG,QAAQ;AAAA,IAC1C,OAAO;AAAA;AAAA,EAGF,OAAO,GAAkB;AAAA,IAC9B,IAAI;AAAA,IACJ,WAAW,QAAQ,KAAK,KAAK;AAAA,MAAG,MAAM;AAAA,IACtC,OAAO;AAAA;AAAA,EAGF,IAAI,CACT,WACe;AAAA,IACf,YAAY,KAAK,UAAU,MAAM;AAAA,MAC/B,IAAI,UAAU,OAAO,KAAK,IAAI;AAAA,QAAG,OAAO;AAAA,IAC1C;AAAA,IACA;AAAA;AAAA,EAGK,MAAM,CACX,WACkB;AAAA,IAClB,MAAM,SAAS,IAAI;AAAA,IACnB,YAAY,KAAK,UAAU,MAAM;AAAA,MAC/B,IAAI,UAAU,OAAO,KAAK,IAAI;AAAA,QAAG,OAAO,IAAI,KAAK,KAAK;AAAA,IACxD;AAAA,IACA,OAAO;AAAA;AAAA,EAGF,GAAM,CAAC,WAA2D;AAAA,IACvE,MAAM,SAAc,CAAC;AAAA,IACrB,YAAY,KAAK,UAAU,MAAM;AAAA,MAC/B,OAAO,KAAK,UAAU,OAAO,KAAK,IAAI,CAAC;AAAA,IACzC;AAAA,IACA,OAAO;AAAA;AAAA,EAGF,IAAI,CACT,WACS;AAAA,IACT,YAAY,KAAK,UAAU,MAAM;AAAA,MAC/B,IAAI,UAAU,OAAO,KAAK,IAAI;AAAA,QAAG,OAAO;AAAA,IAC1C;AAAA,IACA,OAAO;AAAA;AAAA,EAGF,KAAK,CACV,WACS;AAAA,IACT,YAAY,KAAK,UAAU,MAAM;AAAA,MAC/B,IAAI,CAAC,UAAU,OAAO,KAAK,IAAI;AAAA,QAAG,OAAO;AAAA,IAC3C;AAAA,IACA,OAAO;AAAA;AAAA,EAGF,IAAI,CAAC,UAAiE;AAAA,IAC3E,YAAY,KAAK,UAAU,MAAM;AAAA,MAC/B,SAAS,OAAO,KAAK,IAAI;AAAA,IAC3B;AAAA,IACA,OAAO;AAAA;AAAA,EAGF,KAAK,GAAQ;AAAA,IAClB,OAAO,CAAC,GAAG,KAAK,OAAO,CAAC;AAAA;AAAA,EAGnB,QAAQ,GAAQ;AAAA,IACrB,OAAO,CAAC,GAAG,KAAK,KAAK,CAAC;AAAA;AAAA,EAGjB,YAAY,GAAa;AAAA,IAC9B,OAAO,CAAC,GAAG,KAAK,QAAQ,CAAC;AAAA;AAAA,EAGpB,KAAK,GAAqB;AAAA,IAC/B,MAAM,OAAO,IAAI;AAAA,IACjB,YAAY,KAAK,UAAU;AAAA,MAAM,KAAK,IAAI,KAAK,KAAK;AAAA,IACpD,OAAO;AAAA;AAAA,EAGF,MAAM,IAAI,MAAoB;AAAA,IACnC,SAAS,IAAI,EAAG,IAAI,KAAK,QAAQ,KAAK;AAAA,MACpC,IAAI,CAAC,KAAK,IAAI,KAAK,EAAG;AAAA,QAAG,OAAO;AAAA,IAClC;AAAA,IACA,OAAO;AAAA;AAAA,EAGF,MAAM,IAAI,MAAoB;AAAA,IACnC,SAAS,IAAI,EAAG,IAAI,KAAK,QAAQ,KAAK;AAAA,MACpC,IAAI,KAAK,IAAI,KAAK,EAAG;AAAA,QAAG,OAAO;AAAA,IACjC;AAAA,IACA,OAAO;AAAA;AAAA,EAGF,OAAO,CACZ,WACe;AAAA,IACf,YAAY,KAAK,UAAU,MAAM;AAAA,MAC/B,IAAI,UAAU,OAAO,KAAK,IAAI;AAAA,QAAG,OAAO;AAAA,IAC1C;AAAA,IACA;AAAA;AAAA,EAGK,SAAS,CACd,WACS;AAAA,IACT,OAAO,KAAK,KAAK,SAAS;AAAA;AAAA,EAGrB,KAAK,CACV,WACQ;AAAA,IACR,IAAI,UAAU;AAAA,IACd,YAAY,KAAK,UAAU,MAAM;AAAA,MAC/B,IAAI,UAAU,OAAO,KAAK,IAAI,KAAK,KAAK,OAAO,GAAG;AAAA,QAAG;AAAA,IACvD;AAAA,IACA,OAAO;AAAA;AAAA,EAGF,UAAU,GAAuB;AAAA,IACtC,YAAY,KAAK,UAAU;AAAA,MAAM,OAAO,CAAC,KAAK,KAAK;AAAA,IACnD;AAAA;AAAA,EAGK,SAAS,GAAuB;AAAA,IACrC,IAAI;AAAA,IACJ,WAAW,QAAQ;AAAA,MAAM,QAAQ,CAAC,KAAK,IAAI,KAAK,EAAE;AAAA,IAClD,OAAO;AAAA;AAAA,EAGF,KAAK,CAAC,OAA2C;AAAA,IACtD,MAAM,SAAS,KAAK,MAAM;AAAA,IAC1B,YAAY,KAAK,UAAU;AAAA,MAAO,OAAO,IAAI,KAAK,KAAK;AAAA,IACvD,OAAO;AAAA;AAAA,EAGF,YAAY,CAAC,OAA2C;AAAA,IAC7D,MAAM,SAAS,IAAI;AAAA,IACnB,YAAY,KAAK,UAAU,MAAM;AAAA,MAC/B,IAAI,MAAM,IAAI,GAAG;AAAA,QAAG,OAAO,IAAI,KAAK,KAAK;AAAA,IAC3C;AAAA,IACA,OAAO;AAAA;AAAA,EAGF,UAAU,CAAC,OAA2C;AAAA,IAC3D,MAAM,SAAS,IAAI;AAAA,IACnB,YAAY,KAAK,UAAU,MAAM;AAAA,MAC/B,IAAI,CAAC,MAAM,IAAI,GAAG;AAAA,QAAG,OAAO,IAAI,KAAK,KAAK;AAAA,IAC5C;AAAA,IACA,OAAO;AAAA;AAEX;",
-  "debugId": "11CC5C678785E5CD64756E2164756E21",
+  "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",
   "names": []
 }

package/dist/core/events.d.ts

@@ -1,6 +1,8 @@
 /** Names of events emitted by a Lunibee client. */
 export declare enum ClientEvent {
     Ready = "ready",
+    Resumed = "resumed",
+    InvalidSession = "invalidSession",
     Raw = "raw",
     Error = "error",
     Open = "open",

package/dist/core/index.d.ts

@@ -1,5 +1,6 @@
 export { Permission, Permissions, PermissionFlagsBits, PermissionSet, PermissionsBitField, PermissionOverwriteType, type PermissionName, } from "./permissions.js";
 export { ClientEvent, type ClientEventName, 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";
 import { REST } from "@lunibee/rest";
@@ -17,6 +18,8 @@ declare class EventEmitter<Events extends {
     on<K extends keyof Events>(event: K, listener: Listener<Events[K]>): this;
     once<K extends keyof Events>(event: K, listener: Listener<Events[K]>): this;
     off<K extends keyof Events>(event: K, listener: Listener<Events[K]>): this;
+    /** Alias of {@link off}, provided for Node.js/Discord.js familiarity. */
+    removeListener<K extends keyof Events>(event: K, listener: Listener<Events[K]>): this;
     removeAllListeners<K extends keyof Events>(event?: K): this;
     protected emit<K extends keyof Events>(event: K, ...args: Events[K]): boolean;
 }
@@ -36,11 +39,21 @@ export declare class Client extends EventEmitter<ClientEvents> implements Intera
     user?: ClientUser;
     readyAt?: Date;
     state: ClientState;
+    /**
+     * The bot token this client is authenticated with, or `null` once the
+     * client has been destroyed. Mirrors `Client#token` in Discord.js.
+     */
+    get token(): string | null;
     get uptime(): number | null;
+    get ping(): number;
     /** Whether the client is ready and connected. */
     isReady(): boolean;
     /** Sets the bot's presence / status. @param data Presence payload. @returns Whether the payload was sent. */
     setPresence(data: import("@lunibee/types").GatewayPresence): boolean;
+    /** Sends a voice state update. @param data Voice state payload. @returns Whether it was sent. */
+    setVoiceState(data: Record<string, unknown>): boolean;
+    /** Requests guild members. @param data Guild member request payload. @returns Whether it was sent. */
+    requestGuildMembers(data: Record<string, unknown>): boolean;
     constructor(options: ClientOptions);
     /**
      * Convenience method to connect the bot to Discord.
@@ -58,9 +71,34 @@ export declare class Client extends EventEmitter<ClientEvents> implements Intera
     editInteractionReply(token: string, data: Record<string, unknown>): Promise<unknown>;
     deleteInteractionReply(token: string): Promise<void>;
     followUpInteraction(token: string, data: Record<string, unknown>): Promise<unknown>;
+    /** Fetches a webhook from Discord. */
+    fetchWebhook(id: string, token?: string): Promise<Record<string, unknown>>;
+    /** Fetches a guild preview from Discord. */
+    fetchGuildPreview(guildId: string): Promise<Record<string, unknown>>;
+    /** Fetches the voice regions from Discord. */
+    fetchVoiceRegions(): Promise<Record<string, unknown>[]>;
+    /** Fetches an invite from Discord. */
+    fetchInvite(code: string, options?: {
+        withCounts?: boolean;
+        withExpiration?: boolean;
+        guildScheduledEventId?: string;
+    }): Promise<Record<string, unknown>>;
+    /** Fetches a sticker from Discord. */
+    fetchSticker(id: string): Promise<Record<string, unknown>>;
+    /** Fetches premium sticker packs from Discord. */
+    fetchPremiumStickerPacks(): Promise<Record<string, unknown>>;
+    /** Fetches a guild template from Discord. */
+    fetchGuildTemplate(code: string): Promise<Record<string, unknown>>;
+    /** Generates an invite link for this client. */
+    generateInvite(options?: {
+        scopes?: string[];
+        permissions?: string | bigint;
+    }): string;
 }
 export type ClientEvents = {
     ready: [user: ClientUser];
+    resumed: [];
+    invalidSession: [isRecoverable: boolean];
     raw: [data: {
         event: string;
         data: unknown;