npm - @discordjs/collection - Versions diffs - 1.3.1-dev.1677326645-4e0e125.0 → 1.3.1-dev.1677629527-dc142c4.0 - Mend

@discordjs/collection 1.3.1-dev.1677326645-4e0e125.0 → 1.3.1-dev.1677629527-dc142c4.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (5) hide show

package/dist/index.js CHANGED Viewed

@@ -28,6 +28,16 @@ module.exports = __toCommonJS(src_exports);
 // src/collection.ts
 var Collection = class extends Map {
+  /**
+  * Obtains the value of the given key if it exists, otherwise sets and returns the value provided by the default value generator.
+  *
+  * @param key - The key to get if it exists, or set otherwise
+  * @param defaultValueGenerator - A function that generates the default value
+  * @example
+  * ```ts
+  * collection.ensure(guildId, () => defaultGuildConfig);
+  * ```
+  */
   ensure(key, defaultValueGenerator) {
     if (this.has(key))
       return this.get(key);
@@ -37,9 +47,21 @@ var Collection = class extends Map {
     this.set(key, defaultValue);
     return defaultValue;
   }
+  /**
+  * Checks if all of the elements exist in the collection.
+  *
+  * @param keys - The keys of the elements to check for
+  * @returns `true` if all of the elements exist, `false` if at least one does not exist.
+  */
   hasAll(...keys) {
     return keys.every((k) => super.has(k));
   }
+  /**
+  * Checks if any of the elements exist in the collection.
+  *
+  * @param keys - The keys of the elements to check for
+  * @returns `true` if any of the elements exist, `false` if none exist.
+  */
   hasAny(...keys) {
     return keys.some((k) => super.has(k));
   }
@@ -50,7 +72,9 @@ var Collection = class extends Map {
       return this.last(amount * -1);
     amount = Math.min(this.size, amount);
     const iter = this.values();
-    return Array.from({ length: amount }, () => iter.next().value);
+    return Array.from({
+      length: amount
+    }, () => iter.next().value);
   }
   firstKey(amount) {
     if (typeof amount === "undefined")
@@ -59,10 +83,14 @@ var Collection = class extends Map {
       return this.lastKey(amount * -1);
     amount = Math.min(this.size, amount);
     const iter = this.keys();
-    return Array.from({ length: amount }, () => iter.next().value);
+    return Array.from({
+      length: amount
+    }, () => iter.next().value);
   }
   last(amount) {
-    const arr = [...this.values()];
+    const arr = [
+      ...this.values()
+    ];
     if (typeof amount === "undefined")
       return arr[arr.length - 1];
     if (amount < 0)
@@ -72,7 +100,9 @@ var Collection = class extends Map {
     return arr.slice(-amount);
   }
   lastKey(amount) {
-    const arr = [...this.keys()];
+    const arr = [
+      ...this.keys()
+    ];
     if (typeof amount === "undefined")
       return arr[arr.length - 1];
     if (amount < 0)
@@ -81,40 +111,66 @@ var Collection = class extends Map {
       return [];
     return arr.slice(-amount);
   }
+  /**
+  * Identical to {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/at | Array.at()}.
+  * Returns the item at a given index, allowing for positive and negative integers.
+  * Negative integers count back from the last item in the collection.
+  *
+  * @param index - The index of the element to obtain
+  */
   at(index) {
     index = Math.floor(index);
-    const arr = [...this.values()];
+    const arr = [
+      ...this.values()
+    ];
     return arr.at(index);
   }
+  /**
+  * Identical to {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/at | Array.at()}.
+  * Returns the key at a given index, allowing for positive and negative integers.
+  * Negative integers count back from the last item in the collection.
+  *
+  * @param index - The index of the key to obtain
+  */
   keyAt(index) {
     index = Math.floor(index);
-    const arr = [...this.keys()];
+    const arr = [
+      ...this.keys()
+    ];
     return arr.at(index);
   }
   random(amount) {
-    const arr = [...this.values()];
+    const arr = [
+      ...this.values()
+    ];
     if (typeof amount === "undefined")
       return arr[Math.floor(Math.random() * arr.length)];
     if (!arr.length || !amount)
       return [];
-    return Array.from(
-      { length: Math.min(amount, arr.length) },
-      () => arr.splice(Math.floor(Math.random() * arr.length), 1)[0]
-    );
+    return Array.from({
+      length: Math.min(amount, arr.length)
+    }, () => arr.splice(Math.floor(Math.random() * arr.length), 1)[0]);
   }
   randomKey(amount) {
-    const arr = [...this.keys()];
+    const arr = [
+      ...this.keys()
+    ];
     if (typeof amount === "undefined")
       return arr[Math.floor(Math.random() * arr.length)];
     if (!arr.length || !amount)
       return [];
-    return Array.from(
-      { length: Math.min(amount, arr.length) },
-      () => arr.splice(Math.floor(Math.random() * arr.length), 1)[0]
-    );
-  }
+    return Array.from({
+      length: Math.min(amount, arr.length)
+    }, () => arr.splice(Math.floor(Math.random() * arr.length), 1)[0]);
+  }
+  /**
+  * Identical to {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/reverse | Array.reverse()}
+  * but returns a Collection instead of an Array.
+  */
   reverse() {
-    const entries = [...this.entries()].reverse();
+    const entries = [
+      ...this.entries()
+    ].reverse();
     this.clear();
     for (const [key, value] of entries)
       this.set(key, value);
@@ -194,7 +250,9 @@ var Collection = class extends Map {
     if (typeof thisArg !== "undefined")
       fn = fn.bind(thisArg);
     const iter = this.entries();
-    return Array.from({ length: this.size }, () => {
+    return Array.from({
+      length: this.size
+    }, () => {
       const [key, value] = iter.next().value;
       return fn(value, key, this);
     });
@@ -231,6 +289,18 @@ var Collection = class extends Map {
     }
     return true;
   }
+  /**
+  * Applies a function to produce a single value. Identical in behavior to
+  * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/reduce | Array.reduce()}.
+  *
+  * @param fn - Function used to reduce, taking four arguments; `accumulator`, `currentValue`, `currentKey`,
+  * and `collection`
+  * @param initialValue - Starting value for the accumulator
+  * @example
+  * ```ts
+  * collection.reduce((acc, guild) => acc + guild.memberCount, 0);
+  * ```
+  */
   reduce(fn, initialValue) {
     if (typeof fn !== "function")
       throw new TypeError(`${fn} is not a function`);
@@ -269,9 +339,26 @@ var Collection = class extends Map {
     fn(this);
     return this;
   }
+  /**
+  * Creates an identical shallow copy of this collection.
+  *
+  * @example
+  * ```ts
+  * const newColl = someColl.clone();
+  * ```
+  */
   clone() {
     return new this.constructor[Symbol.species](this);
   }
+  /**
+  * Combines this collection with others into a new collection. None of the source collections are modified.
+  *
+  * @param collections - Collections to merge
+  * @example
+  * ```ts
+  * const newColl = someColl.concat(someOtherColl, anotherColl, ohBoyAColl);
+  * ```
+  */
   concat(...collections) {
     const newColl = this.clone();
     for (const coll of collections) {
@@ -280,6 +367,14 @@ var Collection = class extends Map {
     }
     return newColl;
   }
+  /**
+  * Checks if this collection shares identical items with another.
+  * This is different to checking for equality using equal-signs, because
+  * the collections may be different objects, but contain the same data.
+  *
+  * @param collection - Collection to compare with
+  * @returns Whether the collections have identical contents
+  */
   equals(collection) {
     if (!collection)
       return false;
@@ -294,8 +389,22 @@ var Collection = class extends Map {
     }
     return true;
   }
+  /**
+  * The sort method sorts the items of a collection in place and returns it.
+  * The sort is not necessarily stable in Node 10 or older.
+  * The default sort order is according to string Unicode code points.
+  *
+  * @param compareFunction - Specifies a function that defines the sort order.
+  * If omitted, the collection is sorted according to each character's Unicode code point value, according to the string conversion of each element.
+  * @example
+  * ```ts
+  * collection.sort((userA, userB) => userA.createdTimestamp - userB.createdTimestamp);
+  * ```
+  */
   sort(compareFunction = Collection.defaultSort) {
-    const entries = [...this.entries()];
+    const entries = [
+      ...this.entries()
+    ];
     entries.sort((a, b) => compareFunction(a[1], b[1], a[0], b[0]));
     super.clear();
     for (const [k, v] of entries) {
@@ -303,6 +412,11 @@ var Collection = class extends Map {
     }
     return this;
   }
+  /**
+  * The intersect method returns a new structure containing items where the keys and values are present in both original structures.
+  *
+  * @param other - The other Collection to filter against
+  */
   intersect(other) {
     const coll = new this.constructor[Symbol.species]();
     for (const [k, v] of other) {
@@ -312,6 +426,11 @@ var Collection = class extends Map {
     }
     return coll;
   }
+  /**
+  * The subtract method returns a new structure containing items where the keys and values of the original structure are not present in the other.
+  *
+  * @param other - The other Collection to filter against
+  */
   subtract(other) {
     const coll = new this.constructor[Symbol.species]();
     for (const [k, v] of this) {
@@ -321,6 +440,11 @@ var Collection = class extends Map {
     }
     return coll;
   }
+  /**
+  * The difference method returns a new structure containing items where the key is present in one of the original structures but not the other.
+  *
+  * @param other - The other Collection to filter against
+  */
   difference(other) {
     const coll = new this.constructor[Symbol.species]();
     for (const [k, v] of other) {
@@ -333,9 +457,40 @@ var Collection = class extends Map {
     }
     return coll;
   }
+  /**
+  * Merges two Collections together into a new Collection.
+  *
+  * @param other - The other Collection to merge with
+  * @param whenInSelf - Function getting the result if the entry only exists in this Collection
+  * @param whenInOther - Function getting the result if the entry only exists in the other Collection
+  * @param whenInBoth - Function getting the result if the entry exists in both Collections
+  * @example
+  * ```ts
+  * // Sums up the entries in two collections.
+  * coll.merge(
+  *  other,
+  *  x => ({ keep: true, value: x }),
+  *  y => ({ keep: true, value: y }),
+  *  (x, y) => ({ keep: true, value: x + y }),
+  * );
+  * ```
+  * @example
+  * ```ts
+  * // Intersects two collections in a left-biased manner.
+  * coll.merge(
+  *  other,
+  *  x => ({ keep: false }),
+  *  y => ({ keep: false }),
+  *  (x, _) => ({ keep: true, value: x }),
+  * );
+  * ```
+  */
   merge(other, whenInSelf, whenInOther, whenInBoth) {
     const coll = new this.constructor[Symbol.species]();
-    const keys = /* @__PURE__ */ new Set([...this.keys(), ...other.keys()]);
+    const keys = /* @__PURE__ */ new Set([
+      ...this.keys(),
+      ...other.keys()
+    ]);
     for (const k of keys) {
       const hasInSelf = this.has(k);
       const hasInOther = other.has(k);
@@ -355,15 +510,41 @@ var Collection = class extends Map {
     }
     return coll;
   }
+  /**
+  * The sorted method sorts the items of a collection and returns it.
+  * The sort is not necessarily stable in Node 10 or older.
+  * The default sort order is according to string Unicode code points.
+  *
+  * @param compareFunction - Specifies a function that defines the sort order.
+  * If omitted, the collection is sorted according to each character's Unicode code point value,
+  * according to the string conversion of each element.
+  * @example
+  * ```ts
+  * collection.sorted((userA, userB) => userA.createdTimestamp - userB.createdTimestamp);
+  * ```
+  */
   sorted(compareFunction = Collection.defaultSort) {
     return new this.constructor[Symbol.species](this).sort((av, bv, ak, bk) => compareFunction(av, bv, ak, bk));
   }
   toJSON() {
-    return [...this.values()];
+    return [
+      ...this.values()
+    ];
   }
   static defaultSort(firstValue, secondValue) {
     return Number(firstValue > secondValue) || Number(firstValue === secondValue) - 1;
   }
+  /**
+  * Creates a Collection from a list of entries.
+  *
+  * @param entries - The list of entries
+  * @param combine - Function to combine an existing entry with a new one
+  * @example
+  * ```ts
+  * Collection.combineEntries([["a", 1], ["b", 2], ["a", 2]], (x, y) => x + y);
+  * // returns Collection { "a" => 3, "b" => 2 }
+  * ```
+  */
   static combineEntries(entries, combine) {
     const coll = new Collection();
     for (const [k, v] of entries) {
@@ -379,7 +560,7 @@ var Collection = class extends Map {
 __name(Collection, "Collection");
 // src/index.ts
-var version = "1.3.1-dev.1677326645-4e0e125.0";
+var version = "[VI]{{inject}}[/VI]";
 // Annotate the CommonJS export names for ESM import in node:
 0 && (module.exports = {
   Collection,

package/dist/index.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"sources":["../src/index.ts","../src/collection.ts"],"sourcesContent":["export * from './collection.js';\n\n/*\n The {@link https://github.com/discordjs/discord.js/blob/main/packages/collection/#readme \| @discordjs/collection} version\n * that you are currently using.\n /\n// This needs to explicitly be `string` so it is not typed as a \"const string\" that gets injected by esbuild\nexport const version = '1.3.1-dev.1677326645-4e0e125.0' as string;\n","/ eslint-disable id-length /\n/ eslint-disable no-param-reassign /\n/\n @internal\n /\nexport interface CollectionConstructor {\n\tnew (): Collection<unknown, unknown>;\n\tnew <K, V>(entries?: readonly (readonly [K, V])[] \| null): Collection<K, V>;\n\tnew <K, V>(iterable: Iterable<readonly [K, V]>): Collection<K, V>;\n\treadonly prototype: Collection<unknown, unknown>;\n\treadonly [Symbol.species]: CollectionConstructor;\n}\n\n/\n Represents an immutable version of a collection\n /\nexport type ReadonlyCollection<K, V> = Omit<\n\tCollection<K, V>,\n\t'delete' \| 'ensure' \| 'forEach' \| 'get' \| 'reverse' \| 'set' \| 'sort' \| 'sweep'\n> &\n\tReadonlyMap<K, V>;\n\n/\n Separate interface for the constructor so that emitted js does not have a constructor that overwrites itself\n \n @internal\n /\nexport interface Collection<K, V> extends Map<K, V> {\n\tconstructor: CollectionConstructor;\n}\n\n/\n A Map with additional utility methods. This is used throughout discord.js rather than Arrays for anything that has\n * an ID, for significantly improved performance and ease-of-use.\n \n @typeParam K - The key type this collection holds\n * @typeParam V - The value type this collection holds\n /\nexport class Collection<K, V> extends Map<K, V> {\n\t/\n\t Obtains the value of the given key if it exists, otherwise sets and returns the value provided by the default value generator.\n\t \n\t @param key - The key to get if it exists, or set otherwise\n\t * @param defaultValueGenerator - A function that generates the default value\n\t * @example\n\t * ```ts\n\t * collection.ensure(guildId, () => defaultGuildConfig);\n\t * ```\n\t /\n\tpublic ensure(key: K, defaultValueGenerator: (key: K, collection: this) => V): V {\n\t\tif (this.has(key)) return this.get(key)!;\n\t\tif (typeof defaultValueGenerator !== 'function') throw new TypeError(`${defaultValueGenerator} is not a function`);\n\t\tconst defaultValue = defaultValueGenerator(key, this);\n\t\tthis.set(key, defaultValue);\n\t\treturn defaultValue;\n\t}\n\n\t/\n\t Checks if all of the elements exist in the collection.\n\t \n\t @param keys - The keys of the elements to check for\n\t * @returns `true` if all of the elements exist, `false` if at least one does not exist.\n\t /\n\tpublic hasAll(...keys: K[]) {\n\t\treturn keys.every((k) => super.has(k));\n\t}\n\n\t/\n\t Checks if any of the elements exist in the collection.\n\t \n\t @param keys - The keys of the elements to check for\n\t * @returns `true` if any of the elements exist, `false` if none exist.\n\t /\n\tpublic hasAny(...keys: K[]) {\n\t\treturn keys.some((k) => super.has(k));\n\t}\n\n\t/\n\t Obtains the first value(s) in this collection.\n\t \n\t @param amount - Amount of values to obtain from the beginning\n\t * @returns A single value if no amount is provided or an array of values, starting from the end if amount is negative\n\t /\n\tpublic first(): V \| undefined;\n\tpublic first(amount: number): V[];\n\tpublic first(amount?: number): V \| V[] \| undefined {\n\t\tif (typeof amount === 'undefined') return this.values().next().value;\n\t\tif (amount < 0) return this.last(amount -1);\n\t\tamount = Math.min(this.size, amount);\n\t\tconst iter = this.values();\n\t\treturn Array.from({ length: amount }, (): V => iter.next().value);\n\t}\n\n\t/*\n\t Obtains the first key(s) in this collection.\n\t \n\t @param amount - Amount of keys to obtain from the beginning\n\t * @returns A single key if no amount is provided or an array of keys, starting from the end if\n\t * amount is negative\n\t /\n\tpublic firstKey(): K \| undefined;\n\tpublic firstKey(amount: number): K[];\n\tpublic firstKey(amount?: number): K \| K[] \| undefined {\n\t\tif (typeof amount === 'undefined') return this.keys().next().value;\n\t\tif (amount < 0) return this.lastKey(amount -1);\n\t\tamount = Math.min(this.size, amount);\n\t\tconst iter = this.keys();\n\t\treturn Array.from({ length: amount }, (): K => iter.next().value);\n\t}\n\n\t/*\n\t Obtains the last value(s) in this collection.\n\t \n\t @param amount - Amount of values to obtain from the end\n\t * @returns A single value if no amount is provided or an array of values, starting from the start if\n\t * amount is negative\n\t /\n\tpublic last(): V \| undefined;\n\tpublic last(amount: number): V[];\n\tpublic last(amount?: number): V \| V[] \| undefined {\n\t\tconst arr = [...this.values()];\n\t\tif (typeof amount === 'undefined') return arr[arr.length - 1];\n\t\tif (amount < 0) return this.first(amount -1);\n\t\tif (!amount) return [];\n\t\treturn arr.slice(-amount);\n\t}\n\n\t/*\n\t Obtains the last key(s) in this collection.\n\t \n\t @param amount - Amount of keys to obtain from the end\n\t * @returns A single key if no amount is provided or an array of keys, starting from the start if\n\t * amount is negative\n\t /\n\tpublic lastKey(): K \| undefined;\n\tpublic lastKey(amount: number): K[];\n\tpublic lastKey(amount?: number): K \| K[] \| undefined {\n\t\tconst arr = [...this.keys()];\n\t\tif (typeof amount === 'undefined') return arr[arr.length - 1];\n\t\tif (amount < 0) return this.firstKey(amount -1);\n\t\tif (!amount) return [];\n\t\treturn arr.slice(-amount);\n\t}\n\n\t/*\n\t Identical to {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/at \| Array.at()}.\n\t * Returns the item at a given index, allowing for positive and negative integers.\n\t * Negative integers count back from the last item in the collection.\n\t \n\t @param index - The index of the element to obtain\n\t /\n\tpublic at(index: number) {\n\t\tindex = Math.floor(index);\n\t\tconst arr = [...this.values()];\n\t\treturn arr.at(index);\n\t}\n\n\t/\n\t Identical to {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/at \| Array.at()}.\n\t * Returns the key at a given index, allowing for positive and negative integers.\n\t * Negative integers count back from the last item in the collection.\n\t \n\t @param index - The index of the key to obtain\n\t /\n\tpublic keyAt(index: number) {\n\t\tindex = Math.floor(index);\n\t\tconst arr = [...this.keys()];\n\t\treturn arr.at(index);\n\t}\n\n\t/\n\t Obtains unique random value(s) from this collection.\n\t \n\t @param amount - Amount of values to obtain randomly\n\t * @returns A single value if no amount is provided or an array of values\n\t /\n\tpublic random(): V \| undefined;\n\tpublic random(amount: number): V[];\n\tpublic random(amount?: number): V \| V[] \| undefined {\n\t\tconst arr = [...this.values()];\n\t\tif (typeof amount === 'undefined') return arr[Math.floor(Math.random() arr.length)];\n\t\tif (!arr.length \|\| !amount) return [];\n\t\treturn Array.from(\n\t\t\t{ length: Math.min(amount, arr.length) },\n\t\t\t(): V => arr.splice(Math.floor(Math.random() * arr.length), 1)[0]!,\n\t\t);\n\t}\n\n\t/*\n\t Obtains unique random key(s) from this collection.\n\t \n\t @param amount - Amount of keys to obtain randomly\n\t * @returns A single key if no amount is provided or an array\n\t /\n\tpublic randomKey(): K \| undefined;\n\tpublic randomKey(amount: number): K[];\n\tpublic randomKey(amount?: number): K \| K[] \| undefined {\n\t\tconst arr = [...this.keys()];\n\t\tif (typeof amount === 'undefined') return arr[Math.floor(Math.random() arr.length)];\n\t\tif (!arr.length \|\| !amount) return [];\n\t\treturn Array.from(\n\t\t\t{ length: Math.min(amount, arr.length) },\n\t\t\t(): K => arr.splice(Math.floor(Math.random() * arr.length), 1)[0]!,\n\t\t);\n\t}\n\n\t/*\n\t Identical to {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/reverse \| Array.reverse()}\n\t * but returns a Collection instead of an Array.\n\t /\n\tpublic reverse() {\n\t\tconst entries = [...this.entries()].reverse();\n\t\tthis.clear();\n\t\tfor (const [key, value] of entries) this.set(key, value);\n\t\treturn this;\n\t}\n\n\t/\n\t Searches for a single item where the given function returns a truthy value. This behaves like\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/find \| Array.find()}.\n\t * All collections used in Discord.js are mapped using their `id` property, and if you want to find by id you\n\t * should use the `get` method. See\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map/get \| MDN} for details.\n\t \n\t @param fn - The function to test with (should return boolean)\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection.find(user => user.username === 'Bob');\n\t * ```\n\t /\n\tpublic find<V2 extends V>(fn: (value: V, key: K, collection: this) => value is V2): V2 \| undefined;\n\tpublic find(fn: (value: V, key: K, collection: this) => unknown): V \| undefined;\n\tpublic find<This, V2 extends V>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => value is V2,\n\t\tthisArg: This,\n\t): V2 \| undefined;\n\tpublic find<This>(fn: (this: This, value: V, key: K, collection: this) => unknown, thisArg: This): V \| undefined;\n\tpublic find(fn: (value: V, key: K, collection: this) => unknown, thisArg?: unknown): V \| undefined {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tfor (const [key, val] of this) {\n\t\t\tif (fn(val, key, this)) return val;\n\t\t}\n\n\t\treturn undefined;\n\t}\n\n\t/\n\t Searches for the key of a single item where the given function returns a truthy value. This behaves like\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/findIndex \| Array.findIndex()},\n\t * but returns the key rather than the positional index.\n\t \n\t @param fn - The function to test with (should return boolean)\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection.findKey(user => user.username === 'Bob');\n\t * ```\n\t /\n\tpublic findKey<K2 extends K>(fn: (value: V, key: K, collection: this) => key is K2): K2 \| undefined;\n\tpublic findKey(fn: (value: V, key: K, collection: this) => unknown): K \| undefined;\n\tpublic findKey<This, K2 extends K>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => key is K2,\n\t\tthisArg: This,\n\t): K2 \| undefined;\n\tpublic findKey<This>(fn: (this: This, value: V, key: K, collection: this) => unknown, thisArg: This): K \| undefined;\n\tpublic findKey(fn: (value: V, key: K, collection: this) => unknown, thisArg?: unknown): K \| undefined {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tfor (const [key, val] of this) {\n\t\t\tif (fn(val, key, this)) return key;\n\t\t}\n\n\t\treturn undefined;\n\t}\n\n\t/\n\t Removes items that satisfy the provided filter function.\n\t \n\t @param fn - Function used to test (should return a boolean)\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @returns The number of removed entries\n\t /\n\tpublic sweep(fn: (value: V, key: K, collection: this) => unknown): number;\n\tpublic sweep<T>(fn: (this: T, value: V, key: K, collection: this) => unknown, thisArg: T): number;\n\tpublic sweep(fn: (value: V, key: K, collection: this) => unknown, thisArg?: unknown): number {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tconst previousSize = this.size;\n\t\tfor (const [key, val] of this) {\n\t\t\tif (fn(val, key, this)) this.delete(key);\n\t\t}\n\n\t\treturn previousSize - this.size;\n\t}\n\n\t/\n\t Identical to\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/filter \| Array.filter()},\n\t * but returns a Collection instead of an Array.\n\t \n\t @param fn - The function to test with (should return boolean)\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection.filter(user => user.username === 'Bob');\n\t * ```\n\t /\n\tpublic filter<K2 extends K>(fn: (value: V, key: K, collection: this) => key is K2): Collection<K2, V>;\n\tpublic filter<V2 extends V>(fn: (value: V, key: K, collection: this) => value is V2): Collection<K, V2>;\n\tpublic filter(fn: (value: V, key: K, collection: this) => unknown): Collection<K, V>;\n\tpublic filter<This, K2 extends K>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => key is K2,\n\t\tthisArg: This,\n\t): Collection<K2, V>;\n\tpublic filter<This, V2 extends V>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => value is V2,\n\t\tthisArg: This,\n\t): Collection<K, V2>;\n\tpublic filter<This>(fn: (this: This, value: V, key: K, collection: this) => unknown, thisArg: This): Collection<K, V>;\n\tpublic filter(fn: (value: V, key: K, collection: this) => unknown, thisArg?: unknown): Collection<K, V> {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tconst results = new this.constructor[Symbol.species]<K, V>();\n\t\tfor (const [key, val] of this) {\n\t\t\tif (fn(val, key, this)) results.set(key, val);\n\t\t}\n\n\t\treturn results;\n\t}\n\n\t/\n\t Partitions the collection into two collections where the first collection\n\t * contains the items that passed and the second contains the items that failed.\n\t \n\t @param fn - Function used to test (should return a boolean)\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * const [big, small] = collection.partition(guild => guild.memberCount > 250);\n\t * ```\n\t /\n\tpublic partition<K2 extends K>(\n\t\tfn: (value: V, key: K, collection: this) => key is K2,\n\t): [Collection<K2, V>, Collection<Exclude<K, K2>, V>];\n\tpublic partition<V2 extends V>(\n\t\tfn: (value: V, key: K, collection: this) => value is V2,\n\t): [Collection<K, V2>, Collection<K, Exclude<V, V2>>];\n\tpublic partition(fn: (value: V, key: K, collection: this) => unknown): [Collection<K, V>, Collection<K, V>];\n\tpublic partition<This, K2 extends K>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => key is K2,\n\t\tthisArg: This,\n\t): [Collection<K2, V>, Collection<Exclude<K, K2>, V>];\n\tpublic partition<This, V2 extends V>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => value is V2,\n\t\tthisArg: This,\n\t): [Collection<K, V2>, Collection<K, Exclude<V, V2>>];\n\tpublic partition<This>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => unknown,\n\t\tthisArg: This,\n\t): [Collection<K, V>, Collection<K, V>];\n\tpublic partition(\n\t\tfn: (value: V, key: K, collection: this) => unknown,\n\t\tthisArg?: unknown,\n\t): [Collection<K, V>, Collection<K, V>] {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tconst results: [Collection<K, V>, Collection<K, V>] = [\n\t\t\tnew this.constructor[Symbol.species]<K, V>(),\n\t\t\tnew this.constructor[Symbol.species]<K, V>(),\n\t\t];\n\t\tfor (const [key, val] of this) {\n\t\t\tif (fn(val, key, this)) {\n\t\t\t\tresults[0].set(key, val);\n\t\t\t} else {\n\t\t\t\tresults[1].set(key, val);\n\t\t\t}\n\t\t}\n\n\t\treturn results;\n\t}\n\n\t/\n\t Maps each item into a Collection, then joins the results into a single Collection. Identical in behavior to\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/flatMap \| Array.flatMap()}.\n\t \n\t @param fn - Function that produces a new Collection\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection.flatMap(guild => guild.members.cache);\n\t * ```\n\t /\n\tpublic flatMap<T>(fn: (value: V, key: K, collection: this) => Collection<K, T>): Collection<K, T>;\n\tpublic flatMap<T, This>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => Collection<K, T>,\n\t\tthisArg: This,\n\t): Collection<K, T>;\n\tpublic flatMap<T>(fn: (value: V, key: K, collection: this) => Collection<K, T>, thisArg?: unknown): Collection<K, T> {\n\t\t// eslint-disable-next-line unicorn/no-array-method-this-argument\n\t\tconst collections = this.map(fn, thisArg);\n\t\treturn new this.constructor[Symbol.species]<K, T>().concat(...collections);\n\t}\n\n\t/\n\t Maps each item to another value into an array. Identical in behavior to\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/map \| Array.map()}.\n\t \n\t @param fn - Function that produces an element of the new array, taking three arguments\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection.map(user => user.tag);\n\t * ```\n\t /\n\tpublic map<T>(fn: (value: V, key: K, collection: this) => T): T[];\n\tpublic map<This, T>(fn: (this: This, value: V, key: K, collection: this) => T, thisArg: This): T[];\n\tpublic map<T>(fn: (value: V, key: K, collection: this) => T, thisArg?: unknown): T[] {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tconst iter = this.entries();\n\t\treturn Array.from({ length: this.size }, (): T => {\n\t\t\tconst [key, value] = iter.next().value;\n\t\t\treturn fn(value, key, this);\n\t\t});\n\t}\n\n\t/\n\t Maps each item to another value into a collection. Identical in behavior to\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/map \| Array.map()}.\n\t \n\t @param fn - Function that produces an element of the new collection, taking three arguments\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection.mapValues(user => user.tag);\n\t * ```\n\t /\n\tpublic mapValues<T>(fn: (value: V, key: K, collection: this) => T): Collection<K, T>;\n\tpublic mapValues<This, T>(fn: (this: This, value: V, key: K, collection: this) => T, thisArg: This): Collection<K, T>;\n\tpublic mapValues<T>(fn: (value: V, key: K, collection: this) => T, thisArg?: unknown): Collection<K, T> {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tconst coll = new this.constructor[Symbol.species]<K, T>();\n\t\tfor (const [key, val] of this) coll.set(key, fn(val, key, this));\n\t\treturn coll;\n\t}\n\n\t/\n\t Checks if there exists an item that passes a test. Identical in behavior to\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/some \| Array.some()}.\n\t \n\t @param fn - Function used to test (should return a boolean)\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection.some(user => user.discriminator === '0000');\n\t * ```\n\t /\n\tpublic some(fn: (value: V, key: K, collection: this) => unknown): boolean;\n\tpublic some<T>(fn: (this: T, value: V, key: K, collection: this) => unknown, thisArg: T): boolean;\n\tpublic some(fn: (value: V, key: K, collection: this) => unknown, thisArg?: unknown): boolean {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tfor (const [key, val] of this) {\n\t\t\tif (fn(val, key, this)) return true;\n\t\t}\n\n\t\treturn false;\n\t}\n\n\t/\n\t Checks if all items passes a test. Identical in behavior to\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/every \| Array.every()}.\n\t \n\t @param fn - Function used to test (should return a boolean)\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection.every(user => !user.bot);\n\t * ```\n\t /\n\tpublic every<K2 extends K>(fn: (value: V, key: K, collection: this) => key is K2): this is Collection<K2, V>;\n\tpublic every<V2 extends V>(fn: (value: V, key: K, collection: this) => value is V2): this is Collection<K, V2>;\n\tpublic every(fn: (value: V, key: K, collection: this) => unknown): boolean;\n\tpublic every<This, K2 extends K>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => key is K2,\n\t\tthisArg: This,\n\t): this is Collection<K2, V>;\n\tpublic every<This, V2 extends V>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => value is V2,\n\t\tthisArg: This,\n\t): this is Collection<K, V2>;\n\tpublic every<This>(fn: (this: This, value: V, key: K, collection: this) => unknown, thisArg: This): boolean;\n\tpublic every(fn: (value: V, key: K, collection: this) => unknown, thisArg?: unknown): boolean {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tfor (const [key, val] of this) {\n\t\t\tif (!fn(val, key, this)) return false;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\t/\n\t Applies a function to produce a single value. Identical in behavior to\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/reduce \| Array.reduce()}.\n\t \n\t @param fn - Function used to reduce, taking four arguments; `accumulator`, `currentValue`, `currentKey`,\n\t * and `collection`\n\t * @param initialValue - Starting value for the accumulator\n\t * @example\n\t * ```ts\n\t * collection.reduce((acc, guild) => acc + guild.memberCount, 0);\n\t * ```\n\t /\n\tpublic reduce<T>(fn: (accumulator: T, value: V, key: K, collection: this) => T, initialValue?: T): T {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tlet accumulator!: T;\n\n\t\tif (typeof initialValue !== 'undefined') {\n\t\t\taccumulator = initialValue;\n\t\t\tfor (const [key, val] of this) accumulator = fn(accumulator, val, key, this);\n\t\t\treturn accumulator;\n\t\t}\n\n\t\tlet first = true;\n\t\tfor (const [key, val] of this) {\n\t\t\tif (first) {\n\t\t\t\taccumulator = val as unknown as T;\n\t\t\t\tfirst = false;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\taccumulator = fn(accumulator, val, key, this);\n\t\t}\n\n\t\t// No items iterated.\n\t\tif (first) {\n\t\t\tthrow new TypeError('Reduce of empty collection with no initial value');\n\t\t}\n\n\t\treturn accumulator;\n\t}\n\n\t/\n\t Identical to\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map/forEach \| Map.forEach()},\n\t * but returns the collection instead of undefined.\n\t \n\t @param fn - Function to execute for each element\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection\n\t * .each(user => console.log(user.username))\n\t * .filter(user => user.bot)\n\t * .each(user => console.log(user.username));\n\t * ```\n\t /\n\tpublic each(fn: (value: V, key: K, collection: this) => void): this;\n\tpublic each<T>(fn: (this: T, value: V, key: K, collection: this) => void, thisArg: T): this;\n\tpublic each(fn: (value: V, key: K, collection: this) => void, thisArg?: unknown): this {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\t// eslint-disable-next-line unicorn/no-array-method-this-argument\n\t\tthis.forEach(fn as (value: V, key: K, map: Map<K, V>) => void, thisArg);\n\t\treturn this;\n\t}\n\n\t/\n\t Runs a function on the collection and returns the collection.\n\t \n\t @param fn - Function to execute\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection\n\t * .tap(coll => console.log(coll.size))\n\t * .filter(user => user.bot)\n\t * .tap(coll => console.log(coll.size))\n\t * ```\n\t /\n\tpublic tap(fn: (collection: this) => void): this;\n\tpublic tap<T>(fn: (this: T, collection: this) => void, thisArg: T): this;\n\tpublic tap(fn: (collection: this) => void, thisArg?: unknown): this {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tfn(this);\n\t\treturn this;\n\t}\n\n\t/\n\t Creates an identical shallow copy of this collection.\n\t \n\t @example\n\t * ```ts\n\t * const newColl = someColl.clone();\n\t * ```\n\t /\n\tpublic clone(): Collection<K, V> {\n\t\treturn new this.constructor[Symbol.species](this);\n\t}\n\n\t/\n\t Combines this collection with others into a new collection. None of the source collections are modified.\n\t \n\t @param collections - Collections to merge\n\t * @example\n\t * ```ts\n\t * const newColl = someColl.concat(someOtherColl, anotherColl, ohBoyAColl);\n\t * ```\n\t /\n\tpublic concat(...collections: ReadonlyCollection<K, V>[]) {\n\t\tconst newColl = this.clone();\n\t\tfor (const coll of collections) {\n\t\t\tfor (const [key, val] of coll) newColl.set(key, val);\n\t\t}\n\n\t\treturn newColl;\n\t}\n\n\t/\n\t Checks if this collection shares identical items with another.\n\t * This is different to checking for equality using equal-signs, because\n\t * the collections may be different objects, but contain the same data.\n\t \n\t @param collection - Collection to compare with\n\t * @returns Whether the collections have identical contents\n\t /\n\tpublic equals(collection: ReadonlyCollection<K, V>) {\n\t\tif (!collection) return false; // runtime check\n\t\tif (this === collection) return true;\n\t\tif (this.size !== collection.size) return false;\n\t\tfor (const [key, value] of this) {\n\t\t\tif (!collection.has(key) \|\| value !== collection.get(key)) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\treturn true;\n\t}\n\n\t/\n\t The sort method sorts the items of a collection in place and returns it.\n\t * The sort is not necessarily stable in Node 10 or older.\n\t * The default sort order is according to string Unicode code points.\n\t \n\t @param compareFunction - Specifies a function that defines the sort order.\n\t * If omitted, the collection is sorted according to each character's Unicode code point value, according to the string conversion of each element.\n\t * @example\n\t * ```ts\n\t * collection.sort((userA, userB) => userA.createdTimestamp - userB.createdTimestamp);\n\t * ```\n\t /\n\tpublic sort(compareFunction: Comparator<K, V> = Collection.defaultSort) {\n\t\tconst entries = [...this.entries()];\n\t\tentries.sort((a, b): number => compareFunction(a[1], b[1], a[0], b[0]));\n\n\t\t// Perform clean-up\n\t\tsuper.clear();\n\n\t\t// Set the new entries\n\t\tfor (const [k, v] of entries) {\n\t\t\tsuper.set(k, v);\n\t\t}\n\n\t\treturn this;\n\t}\n\n\t/\n\t The intersect method returns a new structure containing items where the keys and values are present in both original structures.\n\t \n\t @param other - The other Collection to filter against\n\t /\n\tpublic intersect<T>(other: ReadonlyCollection<K, T>): Collection<K, T> {\n\t\tconst coll = new this.constructor[Symbol.species]<K, T>();\n\t\tfor (const [k, v] of other) {\n\t\t\tif (this.has(k) && Object.is(v, this.get(k))) {\n\t\t\t\tcoll.set(k, v);\n\t\t\t}\n\t\t}\n\n\t\treturn coll;\n\t}\n\n\t/\n\t The subtract method returns a new structure containing items where the keys and values of the original structure are not present in the other.\n\t \n\t @param other - The other Collection to filter against\n\t /\n\tpublic subtract<T>(other: ReadonlyCollection<K, T>): Collection<K, V> {\n\t\tconst coll = new this.constructor[Symbol.species]<K, V>();\n\t\tfor (const [k, v] of this) {\n\t\t\tif (!other.has(k) \|\| !Object.is(v, other.get(k))) {\n\t\t\t\tcoll.set(k, v);\n\t\t\t}\n\t\t}\n\n\t\treturn coll;\n\t}\n\n\t/\n\t The difference method returns a new structure containing items where the key is present in one of the original structures but not the other.\n\t \n\t @param other - The other Collection to filter against\n\t /\n\tpublic difference<T>(other: ReadonlyCollection<K, T>): Collection<K, T \| V> {\n\t\tconst coll = new this.constructor[Symbol.species]<K, T \| V>();\n\t\tfor (const [k, v] of other) {\n\t\t\tif (!this.has(k)) coll.set(k, v);\n\t\t}\n\n\t\tfor (const [k, v] of this) {\n\t\t\tif (!other.has(k)) coll.set(k, v);\n\t\t}\n\n\t\treturn coll;\n\t}\n\n\t/\n\t Merges two Collections together into a new Collection.\n\t \n\t @param other - The other Collection to merge with\n\t * @param whenInSelf - Function getting the result if the entry only exists in this Collection\n\t * @param whenInOther - Function getting the result if the entry only exists in the other Collection\n\t * @param whenInBoth - Function getting the result if the entry exists in both Collections\n\t * @example\n\t * ```ts\n\t * // Sums up the entries in two collections.\n\t * coll.merge(\n\t * other,\n\t * x => ({ keep: true, value: x }),\n\t * y => ({ keep: true, value: y }),\n\t * (x, y) => ({ keep: true, value: x + y }),\n\t * );\n\t * ```\n\t * @example\n\t * ```ts\n\t * // Intersects two collections in a left-biased manner.\n\t * coll.merge(\n\t * other,\n\t * x => ({ keep: false }),\n\t * y => ({ keep: false }),\n\t * (x, _) => ({ keep: true, value: x }),\n\t * );\n\t * ```\n\t /\n\tpublic merge<T, R>(\n\t\tother: ReadonlyCollection<K, T>,\n\t\twhenInSelf: (value: V, key: K) => Keep<R>,\n\t\twhenInOther: (valueOther: T, key: K) => Keep<R>,\n\t\twhenInBoth: (value: V, valueOther: T, key: K) => Keep<R>,\n\t): Collection<K, R> {\n\t\tconst coll = new this.constructor[Symbol.species]<K, R>();\n\t\tconst keys = new Set([...this.keys(), ...other.keys()]);\n\t\tfor (const k of keys) {\n\t\t\tconst hasInSelf = this.has(k);\n\t\t\tconst hasInOther = other.has(k);\n\n\t\t\tif (hasInSelf && hasInOther) {\n\t\t\t\tconst r = whenInBoth(this.get(k)!, other.get(k)!, k);\n\t\t\t\tif (r.keep) coll.set(k, r.value);\n\t\t\t} else if (hasInSelf) {\n\t\t\t\tconst r = whenInSelf(this.get(k)!, k);\n\t\t\t\tif (r.keep) coll.set(k, r.value);\n\t\t\t} else if (hasInOther) {\n\t\t\t\tconst r = whenInOther(other.get(k)!, k);\n\t\t\t\tif (r.keep) coll.set(k, r.value);\n\t\t\t}\n\t\t}\n\n\t\treturn coll;\n\t}\n\n\t/\n\t The sorted method sorts the items of a collection and returns it.\n\t * The sort is not necessarily stable in Node 10 or older.\n\t * The default sort order is according to string Unicode code points.\n\t \n\t @param compareFunction - Specifies a function that defines the sort order.\n\t * If omitted, the collection is sorted according to each character's Unicode code point value,\n\t * according to the string conversion of each element.\n\t * @example\n\t * ```ts\n\t * collection.sorted((userA, userB) => userA.createdTimestamp - userB.createdTimestamp);\n\t * ```\n\t /\n\tpublic sorted(compareFunction: Comparator<K, V> = Collection.defaultSort) {\n\t\treturn new this.constructor[Symbol.species](this).sort((av, bv, ak, bk) => compareFunction(av, bv, ak, bk));\n\t}\n\n\tpublic toJSON() {\n\t\t// toJSON is called recursively by JSON.stringify.\n\t\treturn [...this.values()];\n\t}\n\n\tprivate static defaultSort<V>(firstValue: V, secondValue: V): number {\n\t\treturn Number(firstValue > secondValue) \|\| Number(firstValue === secondValue) - 1;\n\t}\n\n\t/\n\t Creates a Collection from a list of entries.\n\t \n\t @param entries - The list of entries\n\t * @param combine - Function to combine an existing entry with a new one\n\t * @example\n\t * ```ts\n\t * Collection.combineEntries([[\"a\", 1], [\"b\", 2], [\"a\", 2]], (x, y) => x + y);\n\t * // returns Collection { \"a\" => 3, \"b\" => 2 }\n\t * ```\n\t /\n\tpublic static combineEntries<K, V>(\n\t\tentries: Iterable<[K, V]>,\n\t\tcombine: (firstValue: V, secondValue: V, key: K) => V,\n\t): Collection<K, V> {\n\t\tconst coll = new Collection<K, V>();\n\t\tfor (const [k, v] of entries) {\n\t\t\tif (coll.has(k)) {\n\t\t\t\tcoll.set(k, combine(coll.get(k)!, v, k));\n\t\t\t} else {\n\t\t\t\tcoll.set(k, v);\n\t\t\t}\n\t\t}\n\n\t\treturn coll;\n\t}\n}\n\n/\n @internal\n /\nexport type Keep<V> = { keep: false } \| { keep: true; value: V };\n\n/\n @internal\n */\nexport type Comparator<K, V> = (firstValue: V, secondValue: V, firstKey: K, secondKey: K) => number;\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACsCO,IAAM,aAAN,cAA+B,IAAU;AAAA,EAWxC,OAAO,KAAQ,uBAA2D;AAChF,QAAI,KAAK,IAAI,GAAG;AAAG,aAAO,KAAK,IAAI,GAAG;AACtC,QAAI,OAAO,0BAA0B;AAAY,YAAM,IAAI,UAAU,GAAG,yCAAyC;AACjH,UAAM,eAAe,sBAAsB,KAAK,IAAI;AACpD,SAAK,IAAI,KAAK,YAAY;AAC1B,WAAO;AAAA,EACR;AAAA,EAQO,UAAU,MAAW;AAC3B,WAAO,KAAK,MAAM,CAAC,MAAM,MAAM,IAAI,CAAC,CAAC;AAAA,EACtC;AAAA,EAQO,UAAU,MAAW;AAC3B,WAAO,KAAK,KAAK,CAAC,MAAM,MAAM,IAAI,CAAC,CAAC;AAAA,EACrC;AAAA,EAUO,MAAM,QAAsC;AAClD,QAAI,OAAO,WAAW;AAAa,aAAO,KAAK,OAAO,EAAE,KAAK,EAAE;AAC/D,QAAI,SAAS;AAAG,aAAO,KAAK,KAAK,SAAS,EAAE;AAC5C,aAAS,KAAK,IAAI,KAAK,MAAM,MAAM;AACnC,UAAM,OAAO,KAAK,OAAO;AACzB,WAAO,MAAM,KAAK,EAAE,QAAQ,OAAO,GAAG,MAAS,KAAK,KAAK,EAAE,KAAK;AAAA,EACjE;AAAA,EAWO,SAAS,QAAsC;AACrD,QAAI,OAAO,WAAW;AAAa,aAAO,KAAK,KAAK,EAAE,KAAK,EAAE;AAC7D,QAAI,SAAS;AAAG,aAAO,KAAK,QAAQ,SAAS,EAAE;AAC/C,aAAS,KAAK,IAAI,KAAK,MAAM,MAAM;AACnC,UAAM,OAAO,KAAK,KAAK;AACvB,WAAO,MAAM,KAAK,EAAE,QAAQ,OAAO,GAAG,MAAS,KAAK,KAAK,EAAE,KAAK;AAAA,EACjE;AAAA,EAWO,KAAK,QAAsC;AACjD,UAAM,MAAM,CAAC,GAAG,KAAK,OAAO,CAAC;AAC7B,QAAI,OAAO,WAAW;AAAa,aAAO,IAAI,IAAI,SAAS;AAC3D,QAAI,SAAS;AAAG,aAAO,KAAK,MAAM,SAAS,EAAE;AAC7C,QAAI,CAAC;AAAQ,aAAO,CAAC;AACrB,WAAO,IAAI,MAAM,CAAC,MAAM;AAAA,EACzB;AAAA,EAWO,QAAQ,QAAsC;AACpD,UAAM,MAAM,CAAC,GAAG,KAAK,KAAK,CAAC;AAC3B,QAAI,OAAO,WAAW;AAAa,aAAO,IAAI,IAAI,SAAS;AAC3D,QAAI,SAAS;AAAG,aAAO,KAAK,SAAS,SAAS,EAAE;AAChD,QAAI,CAAC;AAAQ,aAAO,CAAC;AACrB,WAAO,IAAI,MAAM,CAAC,MAAM;AAAA,EACzB;AAAA,EASO,GAAG,OAAe;AACxB,YAAQ,KAAK,MAAM,KAAK;AACxB,UAAM,MAAM,CAAC,GAAG,KAAK,OAAO,CAAC;AAC7B,WAAO,IAAI,GAAG,KAAK;AAAA,EACpB;AAAA,EASO,MAAM,OAAe;AAC3B,YAAQ,KAAK,MAAM,KAAK;AACxB,UAAM,MAAM,CAAC,GAAG,KAAK,KAAK,CAAC;AAC3B,WAAO,IAAI,GAAG,KAAK;AAAA,EACpB;AAAA,EAUO,OAAO,QAAsC;AACnD,UAAM,MAAM,CAAC,GAAG,KAAK,OAAO,CAAC;AAC7B,QAAI,OAAO,WAAW;AAAa,aAAO,IAAI,KAAK,MAAM,KAAK,OAAO,IAAI,IAAI,MAAM;AACnF,QAAI,CAAC,IAAI,UAAU,CAAC;AAAQ,aAAO,CAAC;AACpC,WAAO,MAAM;AAAA,MACZ,EAAE,QAAQ,KAAK,IAAI,QAAQ,IAAI,MAAM,EAAE;AAAA,MACvC,MAAS,IAAI,OAAO,KAAK,MAAM,KAAK,OAAO,IAAI,IAAI,MAAM,GAAG,CAAC,EAAE;AAAA,IAChE;AAAA,EACD;AAAA,EAUO,UAAU,QAAsC;AACtD,UAAM,MAAM,CAAC,GAAG,KAAK,KAAK,CAAC;AAC3B,QAAI,OAAO,WAAW;AAAa,aAAO,IAAI,KAAK,MAAM,KAAK,OAAO,IAAI,IAAI,MAAM;AACnF,QAAI,CAAC,IAAI,UAAU,CAAC;AAAQ,aAAO,CAAC;AACpC,WAAO,MAAM;AAAA,MACZ,EAAE,QAAQ,KAAK,IAAI,QAAQ,IAAI,MAAM,EAAE;AAAA,MACvC,MAAS,IAAI,OAAO,KAAK,MAAM,KAAK,OAAO,IAAI,IAAI,MAAM,GAAG,CAAC,EAAE;AAAA,IAChE;AAAA,EACD;AAAA,EAMO,UAAU;AAChB,UAAM,UAAU,CAAC,GAAG,KAAK,QAAQ,CAAC,EAAE,QAAQ;AAC5C,SAAK,MAAM;AACX,eAAW,CAAC,KAAK,KAAK,KAAK;AAAS,WAAK,IAAI,KAAK,KAAK;AACvD,WAAO;AAAA,EACR;AAAA,EAuBO,KAAK,IAAqD,SAAkC;AAClG,QAAI,OAAO,OAAO;AAAY,YAAM,IAAI,UAAU,GAAG,sBAAsB;AAC3E,QAAI,OAAO,YAAY;AAAa,WAAK,GAAG,KAAK,OAAO;AACxD,eAAW,CAAC,KAAK,GAAG,KAAK,MAAM;AAC9B,UAAI,GAAG,KAAK,KAAK,IAAI;AAAG,eAAO;AAAA,IAChC;AAEA,WAAO;AAAA,EACR;AAAA,EAqBO,QAAQ,IAAqD,SAAkC;AACrG,QAAI,OAAO,OAAO;AAAY,YAAM,IAAI,UAAU,GAAG,sBAAsB;AAC3E,QAAI,OAAO,YAAY;AAAa,WAAK,GAAG,KAAK,OAAO;AACxD,eAAW,CAAC,KAAK,GAAG,KAAK,MAAM;AAC9B,UAAI,GAAG,KAAK,KAAK,IAAI;AAAG,eAAO;AAAA,IAChC;AAEA,WAAO;AAAA,EACR;AAAA,EAWO,MAAM,IAAqD,SAA2B;AAC5F,QAAI,OAAO,OAAO;AAAY,YAAM,IAAI,UAAU,GAAG,sBAAsB;AAC3E,QAAI,OAAO,YAAY;AAAa,WAAK,GAAG,KAAK,OAAO;AACxD,UAAM,eAAe,KAAK;AAC1B,eAAW,CAAC,KAAK,GAAG,KAAK,MAAM;AAC9B,UAAI,GAAG,KAAK,KAAK,IAAI;AAAG,aAAK,OAAO,GAAG;AAAA,IACxC;AAEA,WAAO,eAAe,KAAK;AAAA,EAC5B;AAAA,EA0BO,OAAO,IAAqD,SAAqC;AACvG,QAAI,OAAO,OAAO;AAAY,YAAM,IAAI,UAAU,GAAG,sBAAsB;AAC3E,QAAI,OAAO,YAAY;AAAa,WAAK,GAAG,KAAK,OAAO;AACxD,UAAM,UAAU,IAAI,KAAK,YAAY,OAAO,SAAe;AAC3D,eAAW,CAAC,KAAK,GAAG,KAAK,MAAM;AAC9B,UAAI,GAAG,KAAK,KAAK,IAAI;AAAG,gBAAQ,IAAI,KAAK,GAAG;AAAA,IAC7C;AAEA,WAAO;AAAA,EACR;AAAA,EAgCO,UACN,IACA,SACuC;AACvC,QAAI,OAAO,OAAO;AAAY,YAAM,IAAI,UAAU,GAAG,sBAAsB;AAC3E,QAAI,OAAO,YAAY;AAAa,WAAK,GAAG,KAAK,OAAO;AACxD,UAAM,UAAgD;AAAA,MACrD,IAAI,KAAK,YAAY,OAAO,SAAe;AAAA,MAC3C,IAAI,KAAK,YAAY,OAAO,SAAe;AAAA,IAC5C;AACA,eAAW,CAAC,KAAK,GAAG,KAAK,MAAM;AAC9B,UAAI,GAAG,KAAK,KAAK,IAAI,GAAG;AACvB,gBAAQ,GAAG,IAAI,KAAK,GAAG;AAAA,MACxB,OAAO;AACN,gBAAQ,GAAG,IAAI,KAAK,GAAG;AAAA,MACxB;AAAA,IACD;AAEA,WAAO;AAAA,EACR;AAAA,EAkBO,QAAW,IAA8D,SAAqC;AAEpH,UAAM,cAAc,KAAK,IAAI,IAAI,OAAO;AACxC,WAAO,IAAI,KAAK,YAAY,OAAO,SAAe,EAAE,OAAO,GAAG,WAAW;AAAA,EAC1E;AAAA,EAeO,IAAO,IAA+C,SAAwB;AACpF,QAAI,OAAO,OAAO;AAAY,YAAM,IAAI,UAAU,GAAG,sBAAsB;AAC3E,QAAI,OAAO,YAAY;AAAa,WAAK,GAAG,KAAK,OAAO;AACxD,UAAM,OAAO,KAAK,QAAQ;AAC1B,WAAO,MAAM,KAAK,EAAE,QAAQ,KAAK,KAAK,GAAG,MAAS;AACjD,YAAM,CAAC,KAAK,KAAK,IAAI,KAAK,KAAK,EAAE;AACjC,aAAO,GAAG,OAAO,KAAK,IAAI;AAAA,IAC3B,CAAC;AAAA,EACF;AAAA,EAeO,UAAa,IAA+C,SAAqC;AACvG,QAAI,OAAO,OAAO;AAAY,YAAM,IAAI,UAAU,GAAG,sBAAsB;AAC3E,QAAI,OAAO,YAAY;AAAa,WAAK,GAAG,KAAK,OAAO;AACxD,UAAM,OAAO,IAAI,KAAK,YAAY,OAAO,SAAe;AACxD,eAAW,CAAC,KAAK,GAAG,KAAK;AAAM,WAAK,IAAI,KAAK,GAAG,KAAK,KAAK,IAAI,CAAC;AAC/D,WAAO;AAAA,EACR;AAAA,EAeO,KAAK,IAAqD,SAA4B;AAC5F,QAAI,OAAO,OAAO;AAAY,YAAM,IAAI,UAAU,GAAG,sBAAsB;AAC3E,QAAI,OAAO,YAAY;AAAa,WAAK,GAAG,KAAK,OAAO;AACxD,eAAW,CAAC,KAAK,GAAG,KAAK,MAAM;AAC9B,UAAI,GAAG,KAAK,KAAK,IAAI;AAAG,eAAO;AAAA,IAChC;AAEA,WAAO;AAAA,EACR;AAAA,EAyBO,MAAM,IAAqD,SAA4B;AAC7F,QAAI,OAAO,OAAO;AAAY,YAAM,IAAI,UAAU,GAAG,sBAAsB;AAC3E,QAAI,OAAO,YAAY;AAAa,WAAK,GAAG,KAAK,OAAO;AACxD,eAAW,CAAC,KAAK,GAAG,KAAK,MAAM;AAC9B,UAAI,CAAC,GAAG,KAAK,KAAK,IAAI;AAAG,eAAO;AAAA,IACjC;AAEA,WAAO;AAAA,EACR;AAAA,EAcO,OAAU,IAA+D,cAAqB;AACpG,QAAI,OAAO,OAAO;AAAY,YAAM,IAAI,UAAU,GAAG,sBAAsB;AAC3E,QAAI;AAEJ,QAAI,OAAO,iBAAiB,aAAa;AACxC,oBAAc;AACd,iBAAW,CAAC,KAAK,GAAG,KAAK;AAAM,sBAAc,GAAG,aAAa,KAAK,KAAK,IAAI;AAC3E,aAAO;AAAA,IACR;AAEA,QAAI,QAAQ;AACZ,eAAW,CAAC,KAAK,GAAG,KAAK,MAAM;AAC9B,UAAI,OAAO;AACV,sBAAc;AACd,gBAAQ;AACR;AAAA,MACD;AAEA,oBAAc,GAAG,aAAa,KAAK,KAAK,IAAI;AAAA,IAC7C;AAGA,QAAI,OAAO;AACV,YAAM,IAAI,UAAU,kDAAkD;AAAA,IACvE;AAEA,WAAO;AAAA,EACR;AAAA,EAmBO,KAAK,IAAkD,SAAyB;AACtF,QAAI,OAAO,OAAO;AAAY,YAAM,IAAI,UAAU,GAAG,sBAAsB;AAE3E,SAAK,QAAQ,IAAkD,OAAO;AACtE,WAAO;AAAA,EACR;AAAA,EAiBO,IAAI,IAAgC,SAAyB;AACnE,QAAI,OAAO,OAAO;AAAY,YAAM,IAAI,UAAU,GAAG,sBAAsB;AAC3E,QAAI,OAAO,YAAY;AAAa,WAAK,GAAG,KAAK,OAAO;AACxD,OAAG,IAAI;AACP,WAAO;AAAA,EACR;AAAA,EAUO,QAA0B;AAChC,WAAO,IAAI,KAAK,YAAY,OAAO,SAAS,IAAI;AAAA,EACjD;AAAA,EAWO,UAAU,aAAyC;AACzD,UAAM,UAAU,KAAK,MAAM;AAC3B,eAAW,QAAQ,aAAa;AAC/B,iBAAW,CAAC,KAAK,GAAG,KAAK;AAAM,gBAAQ,IAAI,KAAK,GAAG;AAAA,IACpD;AAEA,WAAO;AAAA,EACR;AAAA,EAUO,OAAO,YAAsC;AACnD,QAAI,CAAC;AAAY,aAAO;AACxB,QAAI,SAAS;AAAY,aAAO;AAChC,QAAI,KAAK,SAAS,WAAW;AAAM,aAAO;AAC1C,eAAW,CAAC,KAAK,KAAK,KAAK,MAAM;AAChC,UAAI,CAAC,WAAW,IAAI,GAAG,KAAK,UAAU,WAAW,IAAI,GAAG,GAAG;AAC1D,eAAO;AAAA,MACR;AAAA,IACD;AAEA,WAAO;AAAA,EACR;AAAA,EAcO,KAAK,kBAAoC,WAAW,aAAa;AACvE,UAAM,UAAU,CAAC,GAAG,KAAK,QAAQ,CAAC;AAClC,YAAQ,KAAK,CAAC,GAAG,MAAc,gBAAgB,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC;AAGtE,UAAM,MAAM;AAGZ,eAAW,CAAC,GAAG,CAAC,KAAK,SAAS;AAC7B,YAAM,IAAI,GAAG,CAAC;AAAA,IACf;AAEA,WAAO;AAAA,EACR;AAAA,EAOO,UAAa,OAAmD;AACtE,UAAM,OAAO,IAAI,KAAK,YAAY,OAAO,SAAe;AACxD,eAAW,CAAC,GAAG,CAAC,KAAK,OAAO;AAC3B,UAAI,KAAK,IAAI,CAAC,KAAK,OAAO,GAAG,GAAG,KAAK,IAAI,CAAC,CAAC,GAAG;AAC7C,aAAK,IAAI,GAAG,CAAC;AAAA,MACd;AAAA,IACD;AAEA,WAAO;AAAA,EACR;AAAA,EAOO,SAAY,OAAmD;AACrE,UAAM,OAAO,IAAI,KAAK,YAAY,OAAO,SAAe;AACxD,eAAW,CAAC,GAAG,CAAC,KAAK,MAAM;AAC1B,UAAI,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,GAAG,MAAM,IAAI,CAAC,CAAC,GAAG;AACjD,aAAK,IAAI,GAAG,CAAC;AAAA,MACd;AAAA,IACD;AAEA,WAAO;AAAA,EACR;AAAA,EAOO,WAAc,OAAuD;AAC3E,UAAM,OAAO,IAAI,KAAK,YAAY,OAAO,SAAmB;AAC5D,eAAW,CAAC,GAAG,CAAC,KAAK,OAAO;AAC3B,UAAI,CAAC,KAAK,IAAI,CAAC;AAAG,aAAK,IAAI,GAAG,CAAC;AAAA,IAChC;AAEA,eAAW,CAAC,GAAG,CAAC,KAAK,MAAM;AAC1B,UAAI,CAAC,MAAM,IAAI,CAAC;AAAG,aAAK,IAAI,GAAG,CAAC;AAAA,IACjC;AAEA,WAAO;AAAA,EACR;AAAA,EA8BO,MACN,OACA,YACA,aACA,YACmB;AACnB,UAAM,OAAO,IAAI,KAAK,YAAY,OAAO,SAAe;AACxD,UAAM,OAAO,oBAAI,IAAI,CAAC,GAAG,KAAK,KAAK,GAAG,GAAG,MAAM,KAAK,CAAC,CAAC;AACtD,eAAW,KAAK,MAAM;AACrB,YAAM,YAAY,KAAK,IAAI,CAAC;AAC5B,YAAM,aAAa,MAAM,IAAI,CAAC;AAE9B,UAAI,aAAa,YAAY;AAC5B,cAAM,IAAI,WAAW,KAAK,IAAI,CAAC,GAAI,MAAM,IAAI,CAAC,GAAI,CAAC;AACnD,YAAI,EAAE;AAAM,eAAK,IAAI,GAAG,EAAE,KAAK;AAAA,MAChC,WAAW,WAAW;AACrB,cAAM,IAAI,WAAW,KAAK,IAAI,CAAC,GAAI,CAAC;AACpC,YAAI,EAAE;AAAM,eAAK,IAAI,GAAG,EAAE,KAAK;AAAA,MAChC,WAAW,YAAY;AACtB,cAAM,IAAI,YAAY,MAAM,IAAI,CAAC,GAAI,CAAC;AACtC,YAAI,EAAE;AAAM,eAAK,IAAI,GAAG,EAAE,KAAK;AAAA,MAChC;AAAA,IACD;AAEA,WAAO;AAAA,EACR;AAAA,EAeO,OAAO,kBAAoC,WAAW,aAAa;AACzE,WAAO,IAAI,KAAK,YAAY,OAAO,SAAS,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,IAAI,OAAO,gBAAgB,IAAI,IAAI,IAAI,EAAE,CAAC;AAAA,EAC3G;AAAA,EAEO,SAAS;AAEf,WAAO,CAAC,GAAG,KAAK,OAAO,CAAC;AAAA,EACzB;AAAA,EAEA,OAAe,YAAe,YAAe,aAAwB;AACpE,WAAO,OAAO,aAAa,WAAW,KAAK,OAAO,eAAe,WAAW,IAAI;AAAA,EACjF;AAAA,EAaA,OAAc,eACb,SACA,SACmB;AACnB,UAAM,OAAO,IAAI,WAAiB;AAClC,eAAW,CAAC,GAAG,CAAC,KAAK,SAAS;AAC7B,UAAI,KAAK,IAAI,CAAC,GAAG;AAChB,aAAK,IAAI,GAAG,QAAQ,KAAK,IAAI,CAAC,GAAI,GAAG,CAAC,CAAC;AAAA,MACxC,OAAO;AACN,aAAK,IAAI,GAAG,CAAC;AAAA,MACd;AAAA,IACD;AAEA,WAAO;AAAA,EACR;AACD;AArxBa;;;AD/BN,IAAM,UAAU;","names":[]}
1	+ {"version":3,"sources":["../src/index.ts","../src/collection.ts"],"sourcesContent":["export * from './collection.js';\n\n/*\n The {@link https://github.com/discordjs/discord.js/blob/main/packages/collection/#readme \| @discordjs/collection} version\n * that you are currently using.\n /\n// This needs to explicitly be `string` so it is not typed as a \"const string\" that gets injected by esbuild\nexport const version = '[VI]{{inject}}[/VI]' as string;\n","/ eslint-disable id-length /\n/ eslint-disable no-param-reassign /\n/\n @internal\n /\nexport interface CollectionConstructor {\n\tnew (): Collection<unknown, unknown>;\n\tnew <K, V>(entries?: readonly (readonly [K, V])[] \| null): Collection<K, V>;\n\tnew <K, V>(iterable: Iterable<readonly [K, V]>): Collection<K, V>;\n\treadonly prototype: Collection<unknown, unknown>;\n\treadonly [Symbol.species]: CollectionConstructor;\n}\n\n/\n Represents an immutable version of a collection\n /\nexport type ReadonlyCollection<K, V> = Omit<\n\tCollection<K, V>,\n\t'delete' \| 'ensure' \| 'forEach' \| 'get' \| 'reverse' \| 'set' \| 'sort' \| 'sweep'\n> &\n\tReadonlyMap<K, V>;\n\n/\n Separate interface for the constructor so that emitted js does not have a constructor that overwrites itself\n \n @internal\n /\nexport interface Collection<K, V> extends Map<K, V> {\n\tconstructor: CollectionConstructor;\n}\n\n/\n A Map with additional utility methods. This is used throughout discord.js rather than Arrays for anything that has\n * an ID, for significantly improved performance and ease-of-use.\n \n @typeParam K - The key type this collection holds\n * @typeParam V - The value type this collection holds\n /\nexport class Collection<K, V> extends Map<K, V> {\n\t/\n\t Obtains the value of the given key if it exists, otherwise sets and returns the value provided by the default value generator.\n\t \n\t @param key - The key to get if it exists, or set otherwise\n\t * @param defaultValueGenerator - A function that generates the default value\n\t * @example\n\t * ```ts\n\t * collection.ensure(guildId, () => defaultGuildConfig);\n\t * ```\n\t /\n\tpublic ensure(key: K, defaultValueGenerator: (key: K, collection: this) => V): V {\n\t\tif (this.has(key)) return this.get(key)!;\n\t\tif (typeof defaultValueGenerator !== 'function') throw new TypeError(`${defaultValueGenerator} is not a function`);\n\t\tconst defaultValue = defaultValueGenerator(key, this);\n\t\tthis.set(key, defaultValue);\n\t\treturn defaultValue;\n\t}\n\n\t/\n\t Checks if all of the elements exist in the collection.\n\t \n\t @param keys - The keys of the elements to check for\n\t * @returns `true` if all of the elements exist, `false` if at least one does not exist.\n\t /\n\tpublic hasAll(...keys: K[]) {\n\t\treturn keys.every((k) => super.has(k));\n\t}\n\n\t/\n\t Checks if any of the elements exist in the collection.\n\t \n\t @param keys - The keys of the elements to check for\n\t * @returns `true` if any of the elements exist, `false` if none exist.\n\t /\n\tpublic hasAny(...keys: K[]) {\n\t\treturn keys.some((k) => super.has(k));\n\t}\n\n\t/\n\t Obtains the first value(s) in this collection.\n\t \n\t @param amount - Amount of values to obtain from the beginning\n\t * @returns A single value if no amount is provided or an array of values, starting from the end if amount is negative\n\t /\n\tpublic first(): V \| undefined;\n\tpublic first(amount: number): V[];\n\tpublic first(amount?: number): V \| V[] \| undefined {\n\t\tif (typeof amount === 'undefined') return this.values().next().value;\n\t\tif (amount < 0) return this.last(amount -1);\n\t\tamount = Math.min(this.size, amount);\n\t\tconst iter = this.values();\n\t\treturn Array.from({ length: amount }, (): V => iter.next().value);\n\t}\n\n\t/*\n\t Obtains the first key(s) in this collection.\n\t \n\t @param amount - Amount of keys to obtain from the beginning\n\t * @returns A single key if no amount is provided or an array of keys, starting from the end if\n\t * amount is negative\n\t /\n\tpublic firstKey(): K \| undefined;\n\tpublic firstKey(amount: number): K[];\n\tpublic firstKey(amount?: number): K \| K[] \| undefined {\n\t\tif (typeof amount === 'undefined') return this.keys().next().value;\n\t\tif (amount < 0) return this.lastKey(amount -1);\n\t\tamount = Math.min(this.size, amount);\n\t\tconst iter = this.keys();\n\t\treturn Array.from({ length: amount }, (): K => iter.next().value);\n\t}\n\n\t/*\n\t Obtains the last value(s) in this collection.\n\t \n\t @param amount - Amount of values to obtain from the end\n\t * @returns A single value if no amount is provided or an array of values, starting from the start if\n\t * amount is negative\n\t /\n\tpublic last(): V \| undefined;\n\tpublic last(amount: number): V[];\n\tpublic last(amount?: number): V \| V[] \| undefined {\n\t\tconst arr = [...this.values()];\n\t\tif (typeof amount === 'undefined') return arr[arr.length - 1];\n\t\tif (amount < 0) return this.first(amount -1);\n\t\tif (!amount) return [];\n\t\treturn arr.slice(-amount);\n\t}\n\n\t/*\n\t Obtains the last key(s) in this collection.\n\t \n\t @param amount - Amount of keys to obtain from the end\n\t * @returns A single key if no amount is provided or an array of keys, starting from the start if\n\t * amount is negative\n\t /\n\tpublic lastKey(): K \| undefined;\n\tpublic lastKey(amount: number): K[];\n\tpublic lastKey(amount?: number): K \| K[] \| undefined {\n\t\tconst arr = [...this.keys()];\n\t\tif (typeof amount === 'undefined') return arr[arr.length - 1];\n\t\tif (amount < 0) return this.firstKey(amount -1);\n\t\tif (!amount) return [];\n\t\treturn arr.slice(-amount);\n\t}\n\n\t/*\n\t Identical to {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/at \| Array.at()}.\n\t * Returns the item at a given index, allowing for positive and negative integers.\n\t * Negative integers count back from the last item in the collection.\n\t \n\t @param index - The index of the element to obtain\n\t /\n\tpublic at(index: number) {\n\t\tindex = Math.floor(index);\n\t\tconst arr = [...this.values()];\n\t\treturn arr.at(index);\n\t}\n\n\t/\n\t Identical to {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/at \| Array.at()}.\n\t * Returns the key at a given index, allowing for positive and negative integers.\n\t * Negative integers count back from the last item in the collection.\n\t \n\t @param index - The index of the key to obtain\n\t /\n\tpublic keyAt(index: number) {\n\t\tindex = Math.floor(index);\n\t\tconst arr = [...this.keys()];\n\t\treturn arr.at(index);\n\t}\n\n\t/\n\t Obtains unique random value(s) from this collection.\n\t \n\t @param amount - Amount of values to obtain randomly\n\t * @returns A single value if no amount is provided or an array of values\n\t /\n\tpublic random(): V \| undefined;\n\tpublic random(amount: number): V[];\n\tpublic random(amount?: number): V \| V[] \| undefined {\n\t\tconst arr = [...this.values()];\n\t\tif (typeof amount === 'undefined') return arr[Math.floor(Math.random() arr.length)];\n\t\tif (!arr.length \|\| !amount) return [];\n\t\treturn Array.from(\n\t\t\t{ length: Math.min(amount, arr.length) },\n\t\t\t(): V => arr.splice(Math.floor(Math.random() * arr.length), 1)[0]!,\n\t\t);\n\t}\n\n\t/*\n\t Obtains unique random key(s) from this collection.\n\t \n\t @param amount - Amount of keys to obtain randomly\n\t * @returns A single key if no amount is provided or an array\n\t /\n\tpublic randomKey(): K \| undefined;\n\tpublic randomKey(amount: number): K[];\n\tpublic randomKey(amount?: number): K \| K[] \| undefined {\n\t\tconst arr = [...this.keys()];\n\t\tif (typeof amount === 'undefined') return arr[Math.floor(Math.random() arr.length)];\n\t\tif (!arr.length \|\| !amount) return [];\n\t\treturn Array.from(\n\t\t\t{ length: Math.min(amount, arr.length) },\n\t\t\t(): K => arr.splice(Math.floor(Math.random() * arr.length), 1)[0]!,\n\t\t);\n\t}\n\n\t/*\n\t Identical to {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/reverse \| Array.reverse()}\n\t * but returns a Collection instead of an Array.\n\t /\n\tpublic reverse() {\n\t\tconst entries = [...this.entries()].reverse();\n\t\tthis.clear();\n\t\tfor (const [key, value] of entries) this.set(key, value);\n\t\treturn this;\n\t}\n\n\t/\n\t Searches for a single item where the given function returns a truthy value. This behaves like\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/find \| Array.find()}.\n\t * All collections used in Discord.js are mapped using their `id` property, and if you want to find by id you\n\t * should use the `get` method. See\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map/get \| MDN} for details.\n\t \n\t @param fn - The function to test with (should return boolean)\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection.find(user => user.username === 'Bob');\n\t * ```\n\t /\n\tpublic find<V2 extends V>(fn: (value: V, key: K, collection: this) => value is V2): V2 \| undefined;\n\tpublic find(fn: (value: V, key: K, collection: this) => unknown): V \| undefined;\n\tpublic find<This, V2 extends V>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => value is V2,\n\t\tthisArg: This,\n\t): V2 \| undefined;\n\tpublic find<This>(fn: (this: This, value: V, key: K, collection: this) => unknown, thisArg: This): V \| undefined;\n\tpublic find(fn: (value: V, key: K, collection: this) => unknown, thisArg?: unknown): V \| undefined {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tfor (const [key, val] of this) {\n\t\t\tif (fn(val, key, this)) return val;\n\t\t}\n\n\t\treturn undefined;\n\t}\n\n\t/\n\t Searches for the key of a single item where the given function returns a truthy value. This behaves like\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/findIndex \| Array.findIndex()},\n\t * but returns the key rather than the positional index.\n\t \n\t @param fn - The function to test with (should return boolean)\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection.findKey(user => user.username === 'Bob');\n\t * ```\n\t /\n\tpublic findKey<K2 extends K>(fn: (value: V, key: K, collection: this) => key is K2): K2 \| undefined;\n\tpublic findKey(fn: (value: V, key: K, collection: this) => unknown): K \| undefined;\n\tpublic findKey<This, K2 extends K>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => key is K2,\n\t\tthisArg: This,\n\t): K2 \| undefined;\n\tpublic findKey<This>(fn: (this: This, value: V, key: K, collection: this) => unknown, thisArg: This): K \| undefined;\n\tpublic findKey(fn: (value: V, key: K, collection: this) => unknown, thisArg?: unknown): K \| undefined {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tfor (const [key, val] of this) {\n\t\t\tif (fn(val, key, this)) return key;\n\t\t}\n\n\t\treturn undefined;\n\t}\n\n\t/\n\t Removes items that satisfy the provided filter function.\n\t \n\t @param fn - Function used to test (should return a boolean)\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @returns The number of removed entries\n\t /\n\tpublic sweep(fn: (value: V, key: K, collection: this) => unknown): number;\n\tpublic sweep<T>(fn: (this: T, value: V, key: K, collection: this) => unknown, thisArg: T): number;\n\tpublic sweep(fn: (value: V, key: K, collection: this) => unknown, thisArg?: unknown): number {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tconst previousSize = this.size;\n\t\tfor (const [key, val] of this) {\n\t\t\tif (fn(val, key, this)) this.delete(key);\n\t\t}\n\n\t\treturn previousSize - this.size;\n\t}\n\n\t/\n\t Identical to\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/filter \| Array.filter()},\n\t * but returns a Collection instead of an Array.\n\t \n\t @param fn - The function to test with (should return boolean)\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection.filter(user => user.username === 'Bob');\n\t * ```\n\t /\n\tpublic filter<K2 extends K>(fn: (value: V, key: K, collection: this) => key is K2): Collection<K2, V>;\n\tpublic filter<V2 extends V>(fn: (value: V, key: K, collection: this) => value is V2): Collection<K, V2>;\n\tpublic filter(fn: (value: V, key: K, collection: this) => unknown): Collection<K, V>;\n\tpublic filter<This, K2 extends K>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => key is K2,\n\t\tthisArg: This,\n\t): Collection<K2, V>;\n\tpublic filter<This, V2 extends V>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => value is V2,\n\t\tthisArg: This,\n\t): Collection<K, V2>;\n\tpublic filter<This>(fn: (this: This, value: V, key: K, collection: this) => unknown, thisArg: This): Collection<K, V>;\n\tpublic filter(fn: (value: V, key: K, collection: this) => unknown, thisArg?: unknown): Collection<K, V> {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tconst results = new this.constructor[Symbol.species]<K, V>();\n\t\tfor (const [key, val] of this) {\n\t\t\tif (fn(val, key, this)) results.set(key, val);\n\t\t}\n\n\t\treturn results;\n\t}\n\n\t/\n\t Partitions the collection into two collections where the first collection\n\t * contains the items that passed and the second contains the items that failed.\n\t \n\t @param fn - Function used to test (should return a boolean)\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * const [big, small] = collection.partition(guild => guild.memberCount > 250);\n\t * ```\n\t /\n\tpublic partition<K2 extends K>(\n\t\tfn: (value: V, key: K, collection: this) => key is K2,\n\t): [Collection<K2, V>, Collection<Exclude<K, K2>, V>];\n\tpublic partition<V2 extends V>(\n\t\tfn: (value: V, key: K, collection: this) => value is V2,\n\t): [Collection<K, V2>, Collection<K, Exclude<V, V2>>];\n\tpublic partition(fn: (value: V, key: K, collection: this) => unknown): [Collection<K, V>, Collection<K, V>];\n\tpublic partition<This, K2 extends K>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => key is K2,\n\t\tthisArg: This,\n\t): [Collection<K2, V>, Collection<Exclude<K, K2>, V>];\n\tpublic partition<This, V2 extends V>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => value is V2,\n\t\tthisArg: This,\n\t): [Collection<K, V2>, Collection<K, Exclude<V, V2>>];\n\tpublic partition<This>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => unknown,\n\t\tthisArg: This,\n\t): [Collection<K, V>, Collection<K, V>];\n\tpublic partition(\n\t\tfn: (value: V, key: K, collection: this) => unknown,\n\t\tthisArg?: unknown,\n\t): [Collection<K, V>, Collection<K, V>] {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tconst results: [Collection<K, V>, Collection<K, V>] = [\n\t\t\tnew this.constructor[Symbol.species]<K, V>(),\n\t\t\tnew this.constructor[Symbol.species]<K, V>(),\n\t\t];\n\t\tfor (const [key, val] of this) {\n\t\t\tif (fn(val, key, this)) {\n\t\t\t\tresults[0].set(key, val);\n\t\t\t} else {\n\t\t\t\tresults[1].set(key, val);\n\t\t\t}\n\t\t}\n\n\t\treturn results;\n\t}\n\n\t/\n\t Maps each item into a Collection, then joins the results into a single Collection. Identical in behavior to\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/flatMap \| Array.flatMap()}.\n\t \n\t @param fn - Function that produces a new Collection\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection.flatMap(guild => guild.members.cache);\n\t * ```\n\t /\n\tpublic flatMap<T>(fn: (value: V, key: K, collection: this) => Collection<K, T>): Collection<K, T>;\n\tpublic flatMap<T, This>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => Collection<K, T>,\n\t\tthisArg: This,\n\t): Collection<K, T>;\n\tpublic flatMap<T>(fn: (value: V, key: K, collection: this) => Collection<K, T>, thisArg?: unknown): Collection<K, T> {\n\t\t// eslint-disable-next-line unicorn/no-array-method-this-argument\n\t\tconst collections = this.map(fn, thisArg);\n\t\treturn new this.constructor[Symbol.species]<K, T>().concat(...collections);\n\t}\n\n\t/\n\t Maps each item to another value into an array. Identical in behavior to\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/map \| Array.map()}.\n\t \n\t @param fn - Function that produces an element of the new array, taking three arguments\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection.map(user => user.tag);\n\t * ```\n\t /\n\tpublic map<T>(fn: (value: V, key: K, collection: this) => T): T[];\n\tpublic map<This, T>(fn: (this: This, value: V, key: K, collection: this) => T, thisArg: This): T[];\n\tpublic map<T>(fn: (value: V, key: K, collection: this) => T, thisArg?: unknown): T[] {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tconst iter = this.entries();\n\t\treturn Array.from({ length: this.size }, (): T => {\n\t\t\tconst [key, value] = iter.next().value;\n\t\t\treturn fn(value, key, this);\n\t\t});\n\t}\n\n\t/\n\t Maps each item to another value into a collection. Identical in behavior to\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/map \| Array.map()}.\n\t \n\t @param fn - Function that produces an element of the new collection, taking three arguments\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection.mapValues(user => user.tag);\n\t * ```\n\t /\n\tpublic mapValues<T>(fn: (value: V, key: K, collection: this) => T): Collection<K, T>;\n\tpublic mapValues<This, T>(fn: (this: This, value: V, key: K, collection: this) => T, thisArg: This): Collection<K, T>;\n\tpublic mapValues<T>(fn: (value: V, key: K, collection: this) => T, thisArg?: unknown): Collection<K, T> {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tconst coll = new this.constructor[Symbol.species]<K, T>();\n\t\tfor (const [key, val] of this) coll.set(key, fn(val, key, this));\n\t\treturn coll;\n\t}\n\n\t/\n\t Checks if there exists an item that passes a test. Identical in behavior to\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/some \| Array.some()}.\n\t \n\t @param fn - Function used to test (should return a boolean)\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection.some(user => user.discriminator === '0000');\n\t * ```\n\t /\n\tpublic some(fn: (value: V, key: K, collection: this) => unknown): boolean;\n\tpublic some<T>(fn: (this: T, value: V, key: K, collection: this) => unknown, thisArg: T): boolean;\n\tpublic some(fn: (value: V, key: K, collection: this) => unknown, thisArg?: unknown): boolean {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tfor (const [key, val] of this) {\n\t\t\tif (fn(val, key, this)) return true;\n\t\t}\n\n\t\treturn false;\n\t}\n\n\t/\n\t Checks if all items passes a test. Identical in behavior to\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/every \| Array.every()}.\n\t \n\t @param fn - Function used to test (should return a boolean)\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection.every(user => !user.bot);\n\t * ```\n\t /\n\tpublic every<K2 extends K>(fn: (value: V, key: K, collection: this) => key is K2): this is Collection<K2, V>;\n\tpublic every<V2 extends V>(fn: (value: V, key: K, collection: this) => value is V2): this is Collection<K, V2>;\n\tpublic every(fn: (value: V, key: K, collection: this) => unknown): boolean;\n\tpublic every<This, K2 extends K>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => key is K2,\n\t\tthisArg: This,\n\t): this is Collection<K2, V>;\n\tpublic every<This, V2 extends V>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => value is V2,\n\t\tthisArg: This,\n\t): this is Collection<K, V2>;\n\tpublic every<This>(fn: (this: This, value: V, key: K, collection: this) => unknown, thisArg: This): boolean;\n\tpublic every(fn: (value: V, key: K, collection: this) => unknown, thisArg?: unknown): boolean {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tfor (const [key, val] of this) {\n\t\t\tif (!fn(val, key, this)) return false;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\t/\n\t Applies a function to produce a single value. Identical in behavior to\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/reduce \| Array.reduce()}.\n\t \n\t @param fn - Function used to reduce, taking four arguments; `accumulator`, `currentValue`, `currentKey`,\n\t * and `collection`\n\t * @param initialValue - Starting value for the accumulator\n\t * @example\n\t * ```ts\n\t * collection.reduce((acc, guild) => acc + guild.memberCount, 0);\n\t * ```\n\t /\n\tpublic reduce<T>(fn: (accumulator: T, value: V, key: K, collection: this) => T, initialValue?: T): T {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tlet accumulator!: T;\n\n\t\tif (typeof initialValue !== 'undefined') {\n\t\t\taccumulator = initialValue;\n\t\t\tfor (const [key, val] of this) accumulator = fn(accumulator, val, key, this);\n\t\t\treturn accumulator;\n\t\t}\n\n\t\tlet first = true;\n\t\tfor (const [key, val] of this) {\n\t\t\tif (first) {\n\t\t\t\taccumulator = val as unknown as T;\n\t\t\t\tfirst = false;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\taccumulator = fn(accumulator, val, key, this);\n\t\t}\n\n\t\t// No items iterated.\n\t\tif (first) {\n\t\t\tthrow new TypeError('Reduce of empty collection with no initial value');\n\t\t}\n\n\t\treturn accumulator;\n\t}\n\n\t/\n\t Identical to\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map/forEach \| Map.forEach()},\n\t * but returns the collection instead of undefined.\n\t \n\t @param fn - Function to execute for each element\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection\n\t * .each(user => console.log(user.username))\n\t * .filter(user => user.bot)\n\t * .each(user => console.log(user.username));\n\t * ```\n\t /\n\tpublic each(fn: (value: V, key: K, collection: this) => void): this;\n\tpublic each<T>(fn: (this: T, value: V, key: K, collection: this) => void, thisArg: T): this;\n\tpublic each(fn: (value: V, key: K, collection: this) => void, thisArg?: unknown): this {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\t// eslint-disable-next-line unicorn/no-array-method-this-argument\n\t\tthis.forEach(fn as (value: V, key: K, map: Map<K, V>) => void, thisArg);\n\t\treturn this;\n\t}\n\n\t/\n\t Runs a function on the collection and returns the collection.\n\t \n\t @param fn - Function to execute\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection\n\t * .tap(coll => console.log(coll.size))\n\t * .filter(user => user.bot)\n\t * .tap(coll => console.log(coll.size))\n\t * ```\n\t /\n\tpublic tap(fn: (collection: this) => void): this;\n\tpublic tap<T>(fn: (this: T, collection: this) => void, thisArg: T): this;\n\tpublic tap(fn: (collection: this) => void, thisArg?: unknown): this {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tfn(this);\n\t\treturn this;\n\t}\n\n\t/\n\t Creates an identical shallow copy of this collection.\n\t \n\t @example\n\t * ```ts\n\t * const newColl = someColl.clone();\n\t * ```\n\t /\n\tpublic clone(): Collection<K, V> {\n\t\treturn new this.constructor[Symbol.species](this);\n\t}\n\n\t/\n\t Combines this collection with others into a new collection. None of the source collections are modified.\n\t \n\t @param collections - Collections to merge\n\t * @example\n\t * ```ts\n\t * const newColl = someColl.concat(someOtherColl, anotherColl, ohBoyAColl);\n\t * ```\n\t /\n\tpublic concat(...collections: ReadonlyCollection<K, V>[]) {\n\t\tconst newColl = this.clone();\n\t\tfor (const coll of collections) {\n\t\t\tfor (const [key, val] of coll) newColl.set(key, val);\n\t\t}\n\n\t\treturn newColl;\n\t}\n\n\t/\n\t Checks if this collection shares identical items with another.\n\t * This is different to checking for equality using equal-signs, because\n\t * the collections may be different objects, but contain the same data.\n\t \n\t @param collection - Collection to compare with\n\t * @returns Whether the collections have identical contents\n\t /\n\tpublic equals(collection: ReadonlyCollection<K, V>) {\n\t\tif (!collection) return false; // runtime check\n\t\tif (this === collection) return true;\n\t\tif (this.size !== collection.size) return false;\n\t\tfor (const [key, value] of this) {\n\t\t\tif (!collection.has(key) \|\| value !== collection.get(key)) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\treturn true;\n\t}\n\n\t/\n\t The sort method sorts the items of a collection in place and returns it.\n\t * The sort is not necessarily stable in Node 10 or older.\n\t * The default sort order is according to string Unicode code points.\n\t \n\t @param compareFunction - Specifies a function that defines the sort order.\n\t * If omitted, the collection is sorted according to each character's Unicode code point value, according to the string conversion of each element.\n\t * @example\n\t * ```ts\n\t * collection.sort((userA, userB) => userA.createdTimestamp - userB.createdTimestamp);\n\t * ```\n\t /\n\tpublic sort(compareFunction: Comparator<K, V> = Collection.defaultSort) {\n\t\tconst entries = [...this.entries()];\n\t\tentries.sort((a, b): number => compareFunction(a[1], b[1], a[0], b[0]));\n\n\t\t// Perform clean-up\n\t\tsuper.clear();\n\n\t\t// Set the new entries\n\t\tfor (const [k, v] of entries) {\n\t\t\tsuper.set(k, v);\n\t\t}\n\n\t\treturn this;\n\t}\n\n\t/\n\t The intersect method returns a new structure containing items where the keys and values are present in both original structures.\n\t \n\t @param other - The other Collection to filter against\n\t /\n\tpublic intersect<T>(other: ReadonlyCollection<K, T>): Collection<K, T> {\n\t\tconst coll = new this.constructor[Symbol.species]<K, T>();\n\t\tfor (const [k, v] of other) {\n\t\t\tif (this.has(k) && Object.is(v, this.get(k))) {\n\t\t\t\tcoll.set(k, v);\n\t\t\t}\n\t\t}\n\n\t\treturn coll;\n\t}\n\n\t/\n\t The subtract method returns a new structure containing items where the keys and values of the original structure are not present in the other.\n\t \n\t @param other - The other Collection to filter against\n\t /\n\tpublic subtract<T>(other: ReadonlyCollection<K, T>): Collection<K, V> {\n\t\tconst coll = new this.constructor[Symbol.species]<K, V>();\n\t\tfor (const [k, v] of this) {\n\t\t\tif (!other.has(k) \|\| !Object.is(v, other.get(k))) {\n\t\t\t\tcoll.set(k, v);\n\t\t\t}\n\t\t}\n\n\t\treturn coll;\n\t}\n\n\t/\n\t The difference method returns a new structure containing items where the key is present in one of the original structures but not the other.\n\t \n\t @param other - The other Collection to filter against\n\t /\n\tpublic difference<T>(other: ReadonlyCollection<K, T>): Collection<K, T \| V> {\n\t\tconst coll = new this.constructor[Symbol.species]<K, T \| V>();\n\t\tfor (const [k, v] of other) {\n\t\t\tif (!this.has(k)) coll.set(k, v);\n\t\t}\n\n\t\tfor (const [k, v] of this) {\n\t\t\tif (!other.has(k)) coll.set(k, v);\n\t\t}\n\n\t\treturn coll;\n\t}\n\n\t/\n\t Merges two Collections together into a new Collection.\n\t \n\t @param other - The other Collection to merge with\n\t * @param whenInSelf - Function getting the result if the entry only exists in this Collection\n\t * @param whenInOther - Function getting the result if the entry only exists in the other Collection\n\t * @param whenInBoth - Function getting the result if the entry exists in both Collections\n\t * @example\n\t * ```ts\n\t * // Sums up the entries in two collections.\n\t * coll.merge(\n\t * other,\n\t * x => ({ keep: true, value: x }),\n\t * y => ({ keep: true, value: y }),\n\t * (x, y) => ({ keep: true, value: x + y }),\n\t * );\n\t * ```\n\t * @example\n\t * ```ts\n\t * // Intersects two collections in a left-biased manner.\n\t * coll.merge(\n\t * other,\n\t * x => ({ keep: false }),\n\t * y => ({ keep: false }),\n\t * (x, _) => ({ keep: true, value: x }),\n\t * );\n\t * ```\n\t /\n\tpublic merge<T, R>(\n\t\tother: ReadonlyCollection<K, T>,\n\t\twhenInSelf: (value: V, key: K) => Keep<R>,\n\t\twhenInOther: (valueOther: T, key: K) => Keep<R>,\n\t\twhenInBoth: (value: V, valueOther: T, key: K) => Keep<R>,\n\t): Collection<K, R> {\n\t\tconst coll = new this.constructor[Symbol.species]<K, R>();\n\t\tconst keys = new Set([...this.keys(), ...other.keys()]);\n\t\tfor (const k of keys) {\n\t\t\tconst hasInSelf = this.has(k);\n\t\t\tconst hasInOther = other.has(k);\n\n\t\t\tif (hasInSelf && hasInOther) {\n\t\t\t\tconst r = whenInBoth(this.get(k)!, other.get(k)!, k);\n\t\t\t\tif (r.keep) coll.set(k, r.value);\n\t\t\t} else if (hasInSelf) {\n\t\t\t\tconst r = whenInSelf(this.get(k)!, k);\n\t\t\t\tif (r.keep) coll.set(k, r.value);\n\t\t\t} else if (hasInOther) {\n\t\t\t\tconst r = whenInOther(other.get(k)!, k);\n\t\t\t\tif (r.keep) coll.set(k, r.value);\n\t\t\t}\n\t\t}\n\n\t\treturn coll;\n\t}\n\n\t/\n\t The sorted method sorts the items of a collection and returns it.\n\t * The sort is not necessarily stable in Node 10 or older.\n\t * The default sort order is according to string Unicode code points.\n\t \n\t @param compareFunction - Specifies a function that defines the sort order.\n\t * If omitted, the collection is sorted according to each character's Unicode code point value,\n\t * according to the string conversion of each element.\n\t * @example\n\t * ```ts\n\t * collection.sorted((userA, userB) => userA.createdTimestamp - userB.createdTimestamp);\n\t * ```\n\t /\n\tpublic sorted(compareFunction: Comparator<K, V> = Collection.defaultSort) {\n\t\treturn new this.constructor[Symbol.species](this).sort((av, bv, ak, bk) => compareFunction(av, bv, ak, bk));\n\t}\n\n\tpublic toJSON() {\n\t\t// toJSON is called recursively by JSON.stringify.\n\t\treturn [...this.values()];\n\t}\n\n\tprivate static defaultSort<V>(firstValue: V, secondValue: V): number {\n\t\treturn Number(firstValue > secondValue) \|\| Number(firstValue === secondValue) - 1;\n\t}\n\n\t/\n\t Creates a Collection from a list of entries.\n\t \n\t @param entries - The list of entries\n\t * @param combine - Function to combine an existing entry with a new one\n\t * @example\n\t * ```ts\n\t * Collection.combineEntries([[\"a\", 1], [\"b\", 2], [\"a\", 2]], (x, y) => x + y);\n\t * // returns Collection { \"a\" => 3, \"b\" => 2 }\n\t * ```\n\t /\n\tpublic static combineEntries<K, V>(\n\t\tentries: Iterable<[K, V]>,\n\t\tcombine: (firstValue: V, secondValue: V, key: K) => V,\n\t): Collection<K, V> {\n\t\tconst coll = new Collection<K, V>();\n\t\tfor (const [k, v] of entries) {\n\t\t\tif (coll.has(k)) {\n\t\t\t\tcoll.set(k, combine(coll.get(k)!, v, k));\n\t\t\t} else {\n\t\t\t\tcoll.set(k, v);\n\t\t\t}\n\t\t}\n\n\t\treturn coll;\n\t}\n}\n\n/\n @internal\n /\nexport type Keep<V> = { keep: false } \| { keep: true; value: V };\n\n/\n @internal\n */\nexport type Comparator<K, V> = (firstValue: V, secondValue: V, firstKey: K, secondKey: K) => number;\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAAA;;;;;;;;ACsCO,IAAMA,aAAN,cAA+BC,IAAAA;;;;;;;;;;;EAW9BC,OAAOC,KAAQC,uBAA2D;AAChF,QAAI,KAAKC,IAAIF,GAAAA;AAAM,aAAO,KAAKG,IAAIH,GAAAA;AACnC,QAAI,OAAOC,0BAA0B;AAAY,YAAM,IAAIG,UAAU,GAAGH,yCAAyC;AACjH,UAAMI,eAAeJ,sBAAsBD,KAAK,IAAI;AACpD,SAAKM,IAAIN,KAAKK,YAAAA;AACd,WAAOA;EACR;;;;;;;EAQOE,UAAUC,MAAW;AAC3B,WAAOA,KAAKC,MAAM,CAACC,MAAM,MAAMR,IAAIQ,CAAAA,CAAAA;EACpC;;;;;;;EAQOC,UAAUH,MAAW;AAC3B,WAAOA,KAAKI,KAAK,CAACF,MAAM,MAAMR,IAAIQ,CAAAA,CAAAA;EACnC;EAUOG,MAAMC,QAAsC;AAClD,QAAI,OAAOA,WAAW;AAAa,aAAO,KAAKC,OAAM,EAAGC,KAAI,EAAGC;AAC/D,QAAIH,SAAS;AAAG,aAAO,KAAKI,KAAKJ,SAAS,EAAC;AAC3CA,aAASK,KAAKC,IAAI,KAAKC,MAAMP,MAAAA;AAC7B,UAAMQ,OAAO,KAAKP,OAAM;AACxB,WAAOQ,MAAMC,KAAK;MAAEC,QAAQX;IAAO,GAAG,MAASQ,KAAKN,KAAI,EAAGC,KAAK;EACjE;EAWOS,SAASZ,QAAsC;AACrD,QAAI,OAAOA,WAAW;AAAa,aAAO,KAAKN,KAAI,EAAGQ,KAAI,EAAGC;AAC7D,QAAIH,SAAS;AAAG,aAAO,KAAKa,QAAQb,SAAS,EAAC;AAC9CA,aAASK,KAAKC,IAAI,KAAKC,MAAMP,MAAAA;AAC7B,UAAMQ,OAAO,KAAKd,KAAI;AACtB,WAAOe,MAAMC,KAAK;MAAEC,QAAQX;IAAO,GAAG,MAASQ,KAAKN,KAAI,EAAGC,KAAK;EACjE;EAWOC,KAAKJ,QAAsC;AACjD,UAAMc,MAAM;SAAI,KAAKb,OAAM;;AAC3B,QAAI,OAAOD,WAAW;AAAa,aAAOc,IAAIA,IAAIH,SAAS,CAAA;AAC3D,QAAIX,SAAS;AAAG,aAAO,KAAKD,MAAMC,SAAS,EAAC;AAC5C,QAAI,CAACA;AAAQ,aAAO,CAAA;AACpB,WAAOc,IAAIC,MAAM,CAACf,MAAAA;EACnB;EAWOa,QAAQb,QAAsC;AACpD,UAAMc,MAAM;SAAI,KAAKpB,KAAI;;AACzB,QAAI,OAAOM,WAAW;AAAa,aAAOc,IAAIA,IAAIH,SAAS,CAAA;AAC3D,QAAIX,SAAS;AAAG,aAAO,KAAKY,SAASZ,SAAS,EAAC;AAC/C,QAAI,CAACA;AAAQ,aAAO,CAAA;AACpB,WAAOc,IAAIC,MAAM,CAACf,MAAAA;EACnB;;;;;;;;EASOgB,GAAGC,OAAe;AACxBA,YAAQZ,KAAKa,MAAMD,KAAAA;AACnB,UAAMH,MAAM;SAAI,KAAKb,OAAM;;AAC3B,WAAOa,IAAIE,GAAGC,KAAAA;EACf;;;;;;;;EASOE,MAAMF,OAAe;AAC3BA,YAAQZ,KAAKa,MAAMD,KAAAA;AACnB,UAAMH,MAAM;SAAI,KAAKpB,KAAI;;AACzB,WAAOoB,IAAIE,GAAGC,KAAAA;EACf;EAUOG,OAAOpB,QAAsC;AACnD,UAAMc,MAAM;SAAI,KAAKb,OAAM;;AAC3B,QAAI,OAAOD,WAAW;AAAa,aAAOc,IAAIT,KAAKa,MAAMb,KAAKe,OAAM,IAAKN,IAAIH,MAAM,CAAA;AACnF,QAAI,CAACG,IAAIH,UAAU,CAACX;AAAQ,aAAO,CAAA;AACnC,WAAOS,MAAMC,KACZ;MAAEC,QAAQN,KAAKC,IAAIN,QAAQc,IAAIH,MAAM;IAAE,GACvC,MAASG,IAAIO,OAAOhB,KAAKa,MAAMb,KAAKe,OAAM,IAAKN,IAAIH,MAAM,GAAG,CAAA,EAAG,CAAA,CAAE;EAEnE;EAUOW,UAAUtB,QAAsC;AACtD,UAAMc,MAAM;SAAI,KAAKpB,KAAI;;AACzB,QAAI,OAAOM,WAAW;AAAa,aAAOc,IAAIT,KAAKa,MAAMb,KAAKe,OAAM,IAAKN,IAAIH,MAAM,CAAA;AACnF,QAAI,CAACG,IAAIH,UAAU,CAACX;AAAQ,aAAO,CAAA;AACnC,WAAOS,MAAMC,KACZ;MAAEC,QAAQN,KAAKC,IAAIN,QAAQc,IAAIH,MAAM;IAAE,GACvC,MAASG,IAAIO,OAAOhB,KAAKa,MAAMb,KAAKe,OAAM,IAAKN,IAAIH,MAAM,GAAG,CAAA,EAAG,CAAA,CAAE;EAEnE;;;;;EAMOY,UAAU;AAChB,UAAMC,UAAU;SAAI,KAAKA,QAAO;MAAID,QAAO;AAC3C,SAAKE,MAAK;AACV,eAAW,CAACvC,KAAKiB,KAAAA,KAAUqB;AAAS,WAAKhC,IAAIN,KAAKiB,KAAAA;AAClD,WAAO;EACR;EAuBOuB,KAAKC,IAAqDC,SAAkC;AAClG,QAAI,OAAOD,OAAO;AAAY,YAAM,IAAIrC,UAAU,GAAGqC,sBAAsB;AAC3E,QAAI,OAAOC,YAAY;AAAaD,WAAKA,GAAGE,KAAKD,OAAAA;AACjD,eAAW,CAAC1C,KAAK4C,GAAAA,KAAQ,MAAM;AAC9B,UAAIH,GAAGG,KAAK5C,KAAK,IAAI;AAAG,eAAO4C;IAChC;AAEA,WAAOC;EACR;EAqBOC,QAAQL,IAAqDC,SAAkC;AACrG,QAAI,OAAOD,OAAO;AAAY,YAAM,IAAIrC,UAAU,GAAGqC,sBAAsB;AAC3E,QAAI,OAAOC,YAAY;AAAaD,WAAKA,GAAGE,KAAKD,OAAAA;AACjD,eAAW,CAAC1C,KAAK4C,GAAAA,KAAQ,MAAM;AAC9B,UAAIH,GAAGG,KAAK5C,KAAK,IAAI;AAAG,eAAOA;IAChC;AAEA,WAAO6C;EACR;EAWOE,MAAMN,IAAqDC,SAA2B;AAC5F,QAAI,OAAOD,OAAO;AAAY,YAAM,IAAIrC,UAAU,GAAGqC,sBAAsB;AAC3E,QAAI,OAAOC,YAAY;AAAaD,WAAKA,GAAGE,KAAKD,OAAAA;AACjD,UAAMM,eAAe,KAAK3B;AAC1B,eAAW,CAACrB,KAAK4C,GAAAA,KAAQ,MAAM;AAC9B,UAAIH,GAAGG,KAAK5C,KAAK,IAAI;AAAG,aAAKiD,OAAOjD,GAAAA;IACrC;AAEA,WAAOgD,eAAe,KAAK3B;EAC5B;EA0BO6B,OAAOT,IAAqDC,SAAqC;AACvG,QAAI,OAAOD,OAAO;AAAY,YAAM,IAAIrC,UAAU,GAAGqC,sBAAsB;AAC3E,QAAI,OAAOC,YAAY;AAAaD,WAAKA,GAAGE,KAAKD,OAAAA;AACjD,UAAMS,UAAU,IAAI,KAAKC,YAAYC,OAAOC,OAAO,EAAC;AACpD,eAAW,CAACtD,KAAK4C,GAAAA,KAAQ,MAAM;AAC9B,UAAIH,GAAGG,KAAK5C,KAAK,IAAI;AAAGmD,gBAAQ7C,IAAIN,KAAK4C,GAAAA;IAC1C;AAEA,WAAOO;EACR;EAgCOI,UACNd,IACAC,SACuC;AACvC,QAAI,OAAOD,OAAO;AAAY,YAAM,IAAIrC,UAAU,GAAGqC,sBAAsB;AAC3E,QAAI,OAAOC,YAAY;AAAaD,WAAKA,GAAGE,KAAKD,OAAAA;AACjD,UAAMS,UAAgD;MACrD,IAAI,KAAKC,YAAYC,OAAOC,OAAO,EAAC;MACpC,IAAI,KAAKF,YAAYC,OAAOC,OAAO,EAAC;;AAErC,eAAW,CAACtD,KAAK4C,GAAAA,KAAQ,MAAM;AAC9B,UAAIH,GAAGG,KAAK5C,KAAK,IAAI,GAAG;AACvBmD,gBAAQ,CAAA,EAAG7C,IAAIN,KAAK4C,GAAAA;MACrB,OAAO;AACNO,gBAAQ,CAAA,EAAG7C,IAAIN,KAAK4C,GAAAA;MACrB;IACD;AAEA,WAAOO;EACR;EAkBOK,QAAWf,IAA8DC,SAAqC;AAEpH,UAAMe,cAAc,KAAKC,IAAIjB,IAAIC,OAAAA;AACjC,WAAO,IAAI,KAAKU,YAAYC,OAAOC,OAAO,EAAC,EAASK,OAAM,GAAIF,WAAAA;EAC/D;EAeOC,IAAOjB,IAA+CC,SAAwB;AACpF,QAAI,OAAOD,OAAO;AAAY,YAAM,IAAIrC,UAAU,GAAGqC,sBAAsB;AAC3E,QAAI,OAAOC,YAAY;AAAaD,WAAKA,GAAGE,KAAKD,OAAAA;AACjD,UAAMpB,OAAO,KAAKgB,QAAO;AACzB,WAAOf,MAAMC,KAAK;MAAEC,QAAQ,KAAKJ;IAAK,GAAG,MAAS;AACjD,YAAM,CAACrB,KAAKiB,KAAAA,IAASK,KAAKN,KAAI,EAAGC;AACjC,aAAOwB,GAAGxB,OAAOjB,KAAK,IAAI;IAC3B,CAAA;EACD;EAeO4D,UAAanB,IAA+CC,SAAqC;AACvG,QAAI,OAAOD,OAAO;AAAY,YAAM,IAAIrC,UAAU,GAAGqC,sBAAsB;AAC3E,QAAI,OAAOC,YAAY;AAAaD,WAAKA,GAAGE,KAAKD,OAAAA;AACjD,UAAMmB,OAAO,IAAI,KAAKT,YAAYC,OAAOC,OAAO,EAAC;AACjD,eAAW,CAACtD,KAAK4C,GAAAA,KAAQ;AAAMiB,WAAKvD,IAAIN,KAAKyC,GAAGG,KAAK5C,KAAK,IAAI,CAAA;AAC9D,WAAO6D;EACR;EAeOjD,KAAK6B,IAAqDC,SAA4B;AAC5F,QAAI,OAAOD,OAAO;AAAY,YAAM,IAAIrC,UAAU,GAAGqC,sBAAsB;AAC3E,QAAI,OAAOC,YAAY;AAAaD,WAAKA,GAAGE,KAAKD,OAAAA;AACjD,eAAW,CAAC1C,KAAK4C,GAAAA,KAAQ,MAAM;AAC9B,UAAIH,GAAGG,KAAK5C,KAAK,IAAI;AAAG,eAAO;IAChC;AAEA,WAAO;EACR;EAyBOS,MAAMgC,IAAqDC,SAA4B;AAC7F,QAAI,OAAOD,OAAO;AAAY,YAAM,IAAIrC,UAAU,GAAGqC,sBAAsB;AAC3E,QAAI,OAAOC,YAAY;AAAaD,WAAKA,GAAGE,KAAKD,OAAAA;AACjD,eAAW,CAAC1C,KAAK4C,GAAAA,KAAQ,MAAM;AAC9B,UAAI,CAACH,GAAGG,KAAK5C,KAAK,IAAI;AAAG,eAAO;IACjC;AAEA,WAAO;EACR;;;;;;;;;;;;;EAcO8D,OAAUrB,IAA+DsB,cAAqB;AACpG,QAAI,OAAOtB,OAAO;AAAY,YAAM,IAAIrC,UAAU,GAAGqC,sBAAsB;AAC3E,QAAIuB;AAEJ,QAAI,OAAOD,iBAAiB,aAAa;AACxCC,oBAAcD;AACd,iBAAW,CAAC/D,KAAK4C,GAAAA,KAAQ;AAAMoB,sBAAcvB,GAAGuB,aAAapB,KAAK5C,KAAK,IAAI;AAC3E,aAAOgE;IACR;AAEA,QAAInD,QAAQ;AACZ,eAAW,CAACb,KAAK4C,GAAAA,KAAQ,MAAM;AAC9B,UAAI/B,OAAO;AACVmD,sBAAcpB;AACd/B,gBAAQ;AACR;MACD;AAEAmD,oBAAcvB,GAAGuB,aAAapB,KAAK5C,KAAK,IAAI;IAC7C;AAGA,QAAIa,OAAO;AACV,YAAM,IAAIT,UAAU,kDAAA;IACrB;AAEA,WAAO4D;EACR;EAmBOC,KAAKxB,IAAkDC,SAAyB;AACtF,QAAI,OAAOD,OAAO;AAAY,YAAM,IAAIrC,UAAU,GAAGqC,sBAAsB;AAE3E,SAAKyB,QAAQzB,IAAkDC,OAAAA;AAC/D,WAAO;EACR;EAiBOyB,IAAI1B,IAAgCC,SAAyB;AACnE,QAAI,OAAOD,OAAO;AAAY,YAAM,IAAIrC,UAAU,GAAGqC,sBAAsB;AAC3E,QAAI,OAAOC,YAAY;AAAaD,WAAKA,GAAGE,KAAKD,OAAAA;AACjDD,OAAG,IAAI;AACP,WAAO;EACR;;;;;;;;;EAUO2B,QAA0B;AAChC,WAAO,IAAI,KAAKhB,YAAYC,OAAOC,OAAO,EAAE,IAAI;EACjD;;;;;;;;;;EAWOK,UAAUF,aAAyC;AACzD,UAAMY,UAAU,KAAKD,MAAK;AAC1B,eAAWP,QAAQJ,aAAa;AAC/B,iBAAW,CAACzD,KAAK4C,GAAAA,KAAQiB;AAAMQ,gBAAQ/D,IAAIN,KAAK4C,GAAAA;IACjD;AAEA,WAAOyB;EACR;;;;;;;;;EAUOC,OAAOC,YAAsC;AACnD,QAAI,CAACA;AAAY,aAAO;AACxB,QAAI,SAASA;AAAY,aAAO;AAChC,QAAI,KAAKlD,SAASkD,WAAWlD;AAAM,aAAO;AAC1C,eAAW,CAACrB,KAAKiB,KAAAA,KAAU,MAAM;AAChC,UAAI,CAACsD,WAAWrE,IAAIF,GAAAA,KAAQiB,UAAUsD,WAAWpE,IAAIH,GAAAA,GAAM;AAC1D,eAAO;MACR;IACD;AAEA,WAAO;EACR;;;;;;;;;;;;;EAcOwE,KAAKC,kBAAoC5E,WAAW6E,aAAa;AACvE,UAAMpC,UAAU;SAAI,KAAKA,QAAO;;AAChCA,YAAQkC,KAAK,CAACG,GAAGC,MAAcH,gBAAgBE,EAAE,CAAA,GAAIC,EAAE,CAAA,GAAID,EAAE,CAAA,GAAIC,EAAE,CAAA,CAAE,CAAA;AAGrE,UAAMrC,MAAK;AAGX,eAAW,CAAC7B,GAAGmE,CAAAA,KAAMvC,SAAS;AAC7B,YAAMhC,IAAII,GAAGmE,CAAAA;IACd;AAEA,WAAO;EACR;;;;;;EAOOC,UAAaC,OAAmD;AACtE,UAAMlB,OAAO,IAAI,KAAKT,YAAYC,OAAOC,OAAO,EAAC;AACjD,eAAW,CAAC5C,GAAGmE,CAAAA,KAAME,OAAO;AAC3B,UAAI,KAAK7E,IAAIQ,CAAAA,KAAMsE,OAAOC,GAAGJ,GAAG,KAAK1E,IAAIO,CAAAA,CAAAA,GAAK;AAC7CmD,aAAKvD,IAAII,GAAGmE,CAAAA;MACb;IACD;AAEA,WAAOhB;EACR;;;;;;EAOOqB,SAAYH,OAAmD;AACrE,UAAMlB,OAAO,IAAI,KAAKT,YAAYC,OAAOC,OAAO,EAAC;AACjD,eAAW,CAAC5C,GAAGmE,CAAAA,KAAM,MAAM;AAC1B,UAAI,CAACE,MAAM7E,IAAIQ,CAAAA,KAAM,CAACsE,OAAOC,GAAGJ,GAAGE,MAAM5E,IAAIO,CAAAA,CAAAA,GAAK;AACjDmD,aAAKvD,IAAII,GAAGmE,CAAAA;MACb;IACD;AAEA,WAAOhB;EACR;;;;;;EAOOsB,WAAcJ,OAAuD;AAC3E,UAAMlB,OAAO,IAAI,KAAKT,YAAYC,OAAOC,OAAO,EAAC;AACjD,eAAW,CAAC5C,GAAGmE,CAAAA,KAAME,OAAO;AAC3B,UAAI,CAAC,KAAK7E,IAAIQ,CAAAA;AAAImD,aAAKvD,IAAII,GAAGmE,CAAAA;IAC/B;AAEA,eAAW,CAACnE,GAAGmE,CAAAA,KAAM,MAAM;AAC1B,UAAI,CAACE,MAAM7E,IAAIQ,CAAAA;AAAImD,aAAKvD,IAAII,GAAGmE,CAAAA;IAChC;AAEA,WAAOhB;EACR;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EA8BOuB,MACNL,OACAM,YACAC,aACAC,YACmB;AACnB,UAAM1B,OAAO,IAAI,KAAKT,YAAYC,OAAOC,OAAO,EAAC;AACjD,UAAM9C,OAAO,oBAAIgF,IAAI;SAAI,KAAKhF,KAAI;SAAOuE,MAAMvE,KAAI;KAAG;AACtD,eAAWE,KAAKF,MAAM;AACrB,YAAMiF,YAAY,KAAKvF,IAAIQ,CAAAA;AAC3B,YAAMgF,aAAaX,MAAM7E,IAAIQ,CAAAA;AAE7B,UAAI+E,aAAaC,YAAY;AAC5B,cAAMC,IAAIJ,WAAW,KAAKpF,IAAIO,CAAAA,GAAKqE,MAAM5E,IAAIO,CAAAA,GAAKA,CAAAA;AAClD,YAAIiF,EAAEC;AAAM/B,eAAKvD,IAAII,GAAGiF,EAAE1E,KAAK;MAChC,WAAWwE,WAAW;AACrB,cAAME,IAAIN,WAAW,KAAKlF,IAAIO,CAAAA,GAAKA,CAAAA;AACnC,YAAIiF,EAAEC;AAAM/B,eAAKvD,IAAII,GAAGiF,EAAE1E,KAAK;MAChC,WAAWyE,YAAY;AACtB,cAAMC,IAAIL,YAAYP,MAAM5E,IAAIO,CAAAA,GAAKA,CAAAA;AACrC,YAAIiF,EAAEC;AAAM/B,eAAKvD,IAAII,GAAGiF,EAAE1E,KAAK;MAChC;IACD;AAEA,WAAO4C;EACR;;;;;;;;;;;;;;EAeOgC,OAAOpB,kBAAoC5E,WAAW6E,aAAa;AACzE,WAAO,IAAI,KAAKtB,YAAYC,OAAOC,OAAO,EAAE,IAAI,EAAEkB,KAAK,CAACsB,IAAIC,IAAIC,IAAIC,OAAOxB,gBAAgBqB,IAAIC,IAAIC,IAAIC,EAAAA,CAAAA;EACxG;EAEOC,SAAS;AAEf,WAAO;SAAI,KAAKnF,OAAM;;EACvB;EAEA,OAAe2D,YAAeyB,YAAeC,aAAwB;AACpE,WAAOC,OAAOF,aAAaC,WAAAA,KAAgBC,OAAOF,eAAeC,WAAAA,IAAe;EACjF;;;;;;;;;;;;EAaA,OAAcE,eACbhE,SACAiE,SACmB;AACnB,UAAM1C,OAAO,IAAIhE,WAAAA;AACjB,eAAW,CAACa,GAAGmE,CAAAA,KAAMvC,SAAS;AAC7B,UAAIuB,KAAK3D,IAAIQ,CAAAA,GAAI;AAChBmD,aAAKvD,IAAII,GAAG6F,QAAQ1C,KAAK1D,IAAIO,CAAAA,GAAKmE,GAAGnE,CAAAA,CAAAA;MACtC,OAAO;AACNmD,aAAKvD,IAAII,GAAGmE,CAAAA;MACb;IACD;AAEA,WAAOhB;EACR;AACD;AArxBahE;;;AD/BN,IAAM2G,UAAU;","names":["Collection","Map","ensure","key","defaultValueGenerator","has","get","TypeError","defaultValue","set","hasAll","keys","every","k","hasAny","some","first","amount","values","next","value","last","Math","min","size","iter","Array","from","length","firstKey","lastKey","arr","slice","at","index","floor","keyAt","random","splice","randomKey","reverse","entries","clear","find","fn","thisArg","bind","val","undefined","findKey","sweep","previousSize","delete","filter","results","constructor","Symbol","species","partition","flatMap","collections","map","concat","mapValues","coll","reduce","initialValue","accumulator","each","forEach","tap","clone","newColl","equals","collection","sort","compareFunction","defaultSort","a","b","v","intersect","other","Object","is","subtract","difference","merge","whenInSelf","whenInOther","whenInBoth","Set","hasInSelf","hasInOther","r","keep","sorted","av","bv","ak","bk","toJSON","firstValue","secondValue","Number","combineEntries","combine","version"]}

package/dist/index.mjs CHANGED Viewed

@@ -3,6 +3,16 @@ var __name = (target, value) => __defProp(target, "name", { value, configurable:
 // src/collection.ts
 var Collection = class extends Map {
+  /**
+  * Obtains the value of the given key if it exists, otherwise sets and returns the value provided by the default value generator.
+  *
+  * @param key - The key to get if it exists, or set otherwise
+  * @param defaultValueGenerator - A function that generates the default value
+  * @example
+  * ```ts
+  * collection.ensure(guildId, () => defaultGuildConfig);
+  * ```
+  */
   ensure(key, defaultValueGenerator) {
     if (this.has(key))
       return this.get(key);
@@ -12,9 +22,21 @@ var Collection = class extends Map {
     this.set(key, defaultValue);
     return defaultValue;
   }
+  /**
+  * Checks if all of the elements exist in the collection.
+  *
+  * @param keys - The keys of the elements to check for
+  * @returns `true` if all of the elements exist, `false` if at least one does not exist.
+  */
   hasAll(...keys) {
     return keys.every((k) => super.has(k));
   }
+  /**
+  * Checks if any of the elements exist in the collection.
+  *
+  * @param keys - The keys of the elements to check for
+  * @returns `true` if any of the elements exist, `false` if none exist.
+  */
   hasAny(...keys) {
     return keys.some((k) => super.has(k));
   }
@@ -25,7 +47,9 @@ var Collection = class extends Map {
       return this.last(amount * -1);
     amount = Math.min(this.size, amount);
     const iter = this.values();
-    return Array.from({ length: amount }, () => iter.next().value);
+    return Array.from({
+      length: amount
+    }, () => iter.next().value);
   }
   firstKey(amount) {
     if (typeof amount === "undefined")
@@ -34,10 +58,14 @@ var Collection = class extends Map {
       return this.lastKey(amount * -1);
     amount = Math.min(this.size, amount);
     const iter = this.keys();
-    return Array.from({ length: amount }, () => iter.next().value);
+    return Array.from({
+      length: amount
+    }, () => iter.next().value);
   }
   last(amount) {
-    const arr = [...this.values()];
+    const arr = [
+      ...this.values()
+    ];
     if (typeof amount === "undefined")
       return arr[arr.length - 1];
     if (amount < 0)
@@ -47,7 +75,9 @@ var Collection = class extends Map {
     return arr.slice(-amount);
   }
   lastKey(amount) {
-    const arr = [...this.keys()];
+    const arr = [
+      ...this.keys()
+    ];
     if (typeof amount === "undefined")
       return arr[arr.length - 1];
     if (amount < 0)
@@ -56,40 +86,66 @@ var Collection = class extends Map {
       return [];
     return arr.slice(-amount);
   }
+  /**
+  * Identical to {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/at | Array.at()}.
+  * Returns the item at a given index, allowing for positive and negative integers.
+  * Negative integers count back from the last item in the collection.
+  *
+  * @param index - The index of the element to obtain
+  */
   at(index) {
     index = Math.floor(index);
-    const arr = [...this.values()];
+    const arr = [
+      ...this.values()
+    ];
     return arr.at(index);
   }
+  /**
+  * Identical to {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/at | Array.at()}.
+  * Returns the key at a given index, allowing for positive and negative integers.
+  * Negative integers count back from the last item in the collection.
+  *
+  * @param index - The index of the key to obtain
+  */
   keyAt(index) {
     index = Math.floor(index);
-    const arr = [...this.keys()];
+    const arr = [
+      ...this.keys()
+    ];
     return arr.at(index);
   }
   random(amount) {
-    const arr = [...this.values()];
+    const arr = [
+      ...this.values()
+    ];
     if (typeof amount === "undefined")
       return arr[Math.floor(Math.random() * arr.length)];
     if (!arr.length || !amount)
       return [];
-    return Array.from(
-      { length: Math.min(amount, arr.length) },
-      () => arr.splice(Math.floor(Math.random() * arr.length), 1)[0]
-    );
+    return Array.from({
+      length: Math.min(amount, arr.length)
+    }, () => arr.splice(Math.floor(Math.random() * arr.length), 1)[0]);
   }
   randomKey(amount) {
-    const arr = [...this.keys()];
+    const arr = [
+      ...this.keys()
+    ];
     if (typeof amount === "undefined")
       return arr[Math.floor(Math.random() * arr.length)];
     if (!arr.length || !amount)
       return [];
-    return Array.from(
-      { length: Math.min(amount, arr.length) },
-      () => arr.splice(Math.floor(Math.random() * arr.length), 1)[0]
-    );
-  }
+    return Array.from({
+      length: Math.min(amount, arr.length)
+    }, () => arr.splice(Math.floor(Math.random() * arr.length), 1)[0]);
+  }
+  /**
+  * Identical to {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/reverse | Array.reverse()}
+  * but returns a Collection instead of an Array.
+  */
   reverse() {
-    const entries = [...this.entries()].reverse();
+    const entries = [
+      ...this.entries()
+    ].reverse();
     this.clear();
     for (const [key, value] of entries)
       this.set(key, value);
@@ -169,7 +225,9 @@ var Collection = class extends Map {
     if (typeof thisArg !== "undefined")
       fn = fn.bind(thisArg);
     const iter = this.entries();
-    return Array.from({ length: this.size }, () => {
+    return Array.from({
+      length: this.size
+    }, () => {
       const [key, value] = iter.next().value;
       return fn(value, key, this);
     });
@@ -206,6 +264,18 @@ var Collection = class extends Map {
     }
     return true;
   }
+  /**
+  * Applies a function to produce a single value. Identical in behavior to
+  * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/reduce | Array.reduce()}.
+  *
+  * @param fn - Function used to reduce, taking four arguments; `accumulator`, `currentValue`, `currentKey`,
+  * and `collection`
+  * @param initialValue - Starting value for the accumulator
+  * @example
+  * ```ts
+  * collection.reduce((acc, guild) => acc + guild.memberCount, 0);
+  * ```
+  */
   reduce(fn, initialValue) {
     if (typeof fn !== "function")
       throw new TypeError(`${fn} is not a function`);
@@ -244,9 +314,26 @@ var Collection = class extends Map {
     fn(this);
     return this;
   }
+  /**
+  * Creates an identical shallow copy of this collection.
+  *
+  * @example
+  * ```ts
+  * const newColl = someColl.clone();
+  * ```
+  */
   clone() {
     return new this.constructor[Symbol.species](this);
   }
+  /**
+  * Combines this collection with others into a new collection. None of the source collections are modified.
+  *
+  * @param collections - Collections to merge
+  * @example
+  * ```ts
+  * const newColl = someColl.concat(someOtherColl, anotherColl, ohBoyAColl);
+  * ```
+  */
   concat(...collections) {
     const newColl = this.clone();
     for (const coll of collections) {
@@ -255,6 +342,14 @@ var Collection = class extends Map {
     }
     return newColl;
   }
+  /**
+  * Checks if this collection shares identical items with another.
+  * This is different to checking for equality using equal-signs, because
+  * the collections may be different objects, but contain the same data.
+  *
+  * @param collection - Collection to compare with
+  * @returns Whether the collections have identical contents
+  */
   equals(collection) {
     if (!collection)
       return false;
@@ -269,8 +364,22 @@ var Collection = class extends Map {
     }
     return true;
   }
+  /**
+  * The sort method sorts the items of a collection in place and returns it.
+  * The sort is not necessarily stable in Node 10 or older.
+  * The default sort order is according to string Unicode code points.
+  *
+  * @param compareFunction - Specifies a function that defines the sort order.
+  * If omitted, the collection is sorted according to each character's Unicode code point value, according to the string conversion of each element.
+  * @example
+  * ```ts
+  * collection.sort((userA, userB) => userA.createdTimestamp - userB.createdTimestamp);
+  * ```
+  */
   sort(compareFunction = Collection.defaultSort) {
-    const entries = [...this.entries()];
+    const entries = [
+      ...this.entries()
+    ];
     entries.sort((a, b) => compareFunction(a[1], b[1], a[0], b[0]));
     super.clear();
     for (const [k, v] of entries) {
@@ -278,6 +387,11 @@ var Collection = class extends Map {
     }
     return this;
   }
+  /**
+  * The intersect method returns a new structure containing items where the keys and values are present in both original structures.
+  *
+  * @param other - The other Collection to filter against
+  */
   intersect(other) {
     const coll = new this.constructor[Symbol.species]();
     for (const [k, v] of other) {
@@ -287,6 +401,11 @@ var Collection = class extends Map {
     }
     return coll;
   }
+  /**
+  * The subtract method returns a new structure containing items where the keys and values of the original structure are not present in the other.
+  *
+  * @param other - The other Collection to filter against
+  */
   subtract(other) {
     const coll = new this.constructor[Symbol.species]();
     for (const [k, v] of this) {
@@ -296,6 +415,11 @@ var Collection = class extends Map {
     }
     return coll;
   }
+  /**
+  * The difference method returns a new structure containing items where the key is present in one of the original structures but not the other.
+  *
+  * @param other - The other Collection to filter against
+  */
   difference(other) {
     const coll = new this.constructor[Symbol.species]();
     for (const [k, v] of other) {
@@ -308,9 +432,40 @@ var Collection = class extends Map {
     }
     return coll;
   }
+  /**
+  * Merges two Collections together into a new Collection.
+  *
+  * @param other - The other Collection to merge with
+  * @param whenInSelf - Function getting the result if the entry only exists in this Collection
+  * @param whenInOther - Function getting the result if the entry only exists in the other Collection
+  * @param whenInBoth - Function getting the result if the entry exists in both Collections
+  * @example
+  * ```ts
+  * // Sums up the entries in two collections.
+  * coll.merge(
+  *  other,
+  *  x => ({ keep: true, value: x }),
+  *  y => ({ keep: true, value: y }),
+  *  (x, y) => ({ keep: true, value: x + y }),
+  * );
+  * ```
+  * @example
+  * ```ts
+  * // Intersects two collections in a left-biased manner.
+  * coll.merge(
+  *  other,
+  *  x => ({ keep: false }),
+  *  y => ({ keep: false }),
+  *  (x, _) => ({ keep: true, value: x }),
+  * );
+  * ```
+  */
   merge(other, whenInSelf, whenInOther, whenInBoth) {
     const coll = new this.constructor[Symbol.species]();
-    const keys = /* @__PURE__ */ new Set([...this.keys(), ...other.keys()]);
+    const keys = /* @__PURE__ */ new Set([
+      ...this.keys(),
+      ...other.keys()
+    ]);
     for (const k of keys) {
       const hasInSelf = this.has(k);
       const hasInOther = other.has(k);
@@ -330,15 +485,41 @@ var Collection = class extends Map {
     }
     return coll;
   }
+  /**
+  * The sorted method sorts the items of a collection and returns it.
+  * The sort is not necessarily stable in Node 10 or older.
+  * The default sort order is according to string Unicode code points.
+  *
+  * @param compareFunction - Specifies a function that defines the sort order.
+  * If omitted, the collection is sorted according to each character's Unicode code point value,
+  * according to the string conversion of each element.
+  * @example
+  * ```ts
+  * collection.sorted((userA, userB) => userA.createdTimestamp - userB.createdTimestamp);
+  * ```
+  */
   sorted(compareFunction = Collection.defaultSort) {
     return new this.constructor[Symbol.species](this).sort((av, bv, ak, bk) => compareFunction(av, bv, ak, bk));
   }
   toJSON() {
-    return [...this.values()];
+    return [
+      ...this.values()
+    ];
   }
   static defaultSort(firstValue, secondValue) {
     return Number(firstValue > secondValue) || Number(firstValue === secondValue) - 1;
   }
+  /**
+  * Creates a Collection from a list of entries.
+  *
+  * @param entries - The list of entries
+  * @param combine - Function to combine an existing entry with a new one
+  * @example
+  * ```ts
+  * Collection.combineEntries([["a", 1], ["b", 2], ["a", 2]], (x, y) => x + y);
+  * // returns Collection { "a" => 3, "b" => 2 }
+  * ```
+  */
   static combineEntries(entries, combine) {
     const coll = new Collection();
     for (const [k, v] of entries) {
@@ -354,7 +535,7 @@ var Collection = class extends Map {
 __name(Collection, "Collection");
 // src/index.ts
-var version = "1.3.1-dev.1677326645-4e0e125.0";
+var version = "[VI]{{inject}}[/VI]";
 export {
   Collection,
   version

package/dist/index.mjs.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"sources":["../src/collection.ts","../src/index.ts"],"sourcesContent":["/* eslint-disable id-length /\n/ eslint-disable no-param-reassign /\n/\n @internal\n /\nexport interface CollectionConstructor {\n\tnew (): Collection<unknown, unknown>;\n\tnew <K, V>(entries?: readonly (readonly [K, V])[] \| null): Collection<K, V>;\n\tnew <K, V>(iterable: Iterable<readonly [K, V]>): Collection<K, V>;\n\treadonly prototype: Collection<unknown, unknown>;\n\treadonly [Symbol.species]: CollectionConstructor;\n}\n\n/\n Represents an immutable version of a collection\n /\nexport type ReadonlyCollection<K, V> = Omit<\n\tCollection<K, V>,\n\t'delete' \| 'ensure' \| 'forEach' \| 'get' \| 'reverse' \| 'set' \| 'sort' \| 'sweep'\n> &\n\tReadonlyMap<K, V>;\n\n/\n Separate interface for the constructor so that emitted js does not have a constructor that overwrites itself\n \n @internal\n /\nexport interface Collection<K, V> extends Map<K, V> {\n\tconstructor: CollectionConstructor;\n}\n\n/\n A Map with additional utility methods. This is used throughout discord.js rather than Arrays for anything that has\n * an ID, for significantly improved performance and ease-of-use.\n \n @typeParam K - The key type this collection holds\n * @typeParam V - The value type this collection holds\n /\nexport class Collection<K, V> extends Map<K, V> {\n\t/\n\t Obtains the value of the given key if it exists, otherwise sets and returns the value provided by the default value generator.\n\t \n\t @param key - The key to get if it exists, or set otherwise\n\t * @param defaultValueGenerator - A function that generates the default value\n\t * @example\n\t * ```ts\n\t * collection.ensure(guildId, () => defaultGuildConfig);\n\t * ```\n\t /\n\tpublic ensure(key: K, defaultValueGenerator: (key: K, collection: this) => V): V {\n\t\tif (this.has(key)) return this.get(key)!;\n\t\tif (typeof defaultValueGenerator !== 'function') throw new TypeError(`${defaultValueGenerator} is not a function`);\n\t\tconst defaultValue = defaultValueGenerator(key, this);\n\t\tthis.set(key, defaultValue);\n\t\treturn defaultValue;\n\t}\n\n\t/\n\t Checks if all of the elements exist in the collection.\n\t \n\t @param keys - The keys of the elements to check for\n\t * @returns `true` if all of the elements exist, `false` if at least one does not exist.\n\t /\n\tpublic hasAll(...keys: K[]) {\n\t\treturn keys.every((k) => super.has(k));\n\t}\n\n\t/\n\t Checks if any of the elements exist in the collection.\n\t \n\t @param keys - The keys of the elements to check for\n\t * @returns `true` if any of the elements exist, `false` if none exist.\n\t /\n\tpublic hasAny(...keys: K[]) {\n\t\treturn keys.some((k) => super.has(k));\n\t}\n\n\t/\n\t Obtains the first value(s) in this collection.\n\t \n\t @param amount - Amount of values to obtain from the beginning\n\t * @returns A single value if no amount is provided or an array of values, starting from the end if amount is negative\n\t /\n\tpublic first(): V \| undefined;\n\tpublic first(amount: number): V[];\n\tpublic first(amount?: number): V \| V[] \| undefined {\n\t\tif (typeof amount === 'undefined') return this.values().next().value;\n\t\tif (amount < 0) return this.last(amount -1);\n\t\tamount = Math.min(this.size, amount);\n\t\tconst iter = this.values();\n\t\treturn Array.from({ length: amount }, (): V => iter.next().value);\n\t}\n\n\t/*\n\t Obtains the first key(s) in this collection.\n\t \n\t @param amount - Amount of keys to obtain from the beginning\n\t * @returns A single key if no amount is provided or an array of keys, starting from the end if\n\t * amount is negative\n\t /\n\tpublic firstKey(): K \| undefined;\n\tpublic firstKey(amount: number): K[];\n\tpublic firstKey(amount?: number): K \| K[] \| undefined {\n\t\tif (typeof amount === 'undefined') return this.keys().next().value;\n\t\tif (amount < 0) return this.lastKey(amount -1);\n\t\tamount = Math.min(this.size, amount);\n\t\tconst iter = this.keys();\n\t\treturn Array.from({ length: amount }, (): K => iter.next().value);\n\t}\n\n\t/*\n\t Obtains the last value(s) in this collection.\n\t \n\t @param amount - Amount of values to obtain from the end\n\t * @returns A single value if no amount is provided or an array of values, starting from the start if\n\t * amount is negative\n\t /\n\tpublic last(): V \| undefined;\n\tpublic last(amount: number): V[];\n\tpublic last(amount?: number): V \| V[] \| undefined {\n\t\tconst arr = [...this.values()];\n\t\tif (typeof amount === 'undefined') return arr[arr.length - 1];\n\t\tif (amount < 0) return this.first(amount -1);\n\t\tif (!amount) return [];\n\t\treturn arr.slice(-amount);\n\t}\n\n\t/*\n\t Obtains the last key(s) in this collection.\n\t \n\t @param amount - Amount of keys to obtain from the end\n\t * @returns A single key if no amount is provided or an array of keys, starting from the start if\n\t * amount is negative\n\t /\n\tpublic lastKey(): K \| undefined;\n\tpublic lastKey(amount: number): K[];\n\tpublic lastKey(amount?: number): K \| K[] \| undefined {\n\t\tconst arr = [...this.keys()];\n\t\tif (typeof amount === 'undefined') return arr[arr.length - 1];\n\t\tif (amount < 0) return this.firstKey(amount -1);\n\t\tif (!amount) return [];\n\t\treturn arr.slice(-amount);\n\t}\n\n\t/*\n\t Identical to {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/at \| Array.at()}.\n\t * Returns the item at a given index, allowing for positive and negative integers.\n\t * Negative integers count back from the last item in the collection.\n\t \n\t @param index - The index of the element to obtain\n\t /\n\tpublic at(index: number) {\n\t\tindex = Math.floor(index);\n\t\tconst arr = [...this.values()];\n\t\treturn arr.at(index);\n\t}\n\n\t/\n\t Identical to {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/at \| Array.at()}.\n\t * Returns the key at a given index, allowing for positive and negative integers.\n\t * Negative integers count back from the last item in the collection.\n\t \n\t @param index - The index of the key to obtain\n\t /\n\tpublic keyAt(index: number) {\n\t\tindex = Math.floor(index);\n\t\tconst arr = [...this.keys()];\n\t\treturn arr.at(index);\n\t}\n\n\t/\n\t Obtains unique random value(s) from this collection.\n\t \n\t @param amount - Amount of values to obtain randomly\n\t * @returns A single value if no amount is provided or an array of values\n\t /\n\tpublic random(): V \| undefined;\n\tpublic random(amount: number): V[];\n\tpublic random(amount?: number): V \| V[] \| undefined {\n\t\tconst arr = [...this.values()];\n\t\tif (typeof amount === 'undefined') return arr[Math.floor(Math.random() arr.length)];\n\t\tif (!arr.length \|\| !amount) return [];\n\t\treturn Array.from(\n\t\t\t{ length: Math.min(amount, arr.length) },\n\t\t\t(): V => arr.splice(Math.floor(Math.random() * arr.length), 1)[0]!,\n\t\t);\n\t}\n\n\t/*\n\t Obtains unique random key(s) from this collection.\n\t \n\t @param amount - Amount of keys to obtain randomly\n\t * @returns A single key if no amount is provided or an array\n\t /\n\tpublic randomKey(): K \| undefined;\n\tpublic randomKey(amount: number): K[];\n\tpublic randomKey(amount?: number): K \| K[] \| undefined {\n\t\tconst arr = [...this.keys()];\n\t\tif (typeof amount === 'undefined') return arr[Math.floor(Math.random() arr.length)];\n\t\tif (!arr.length \|\| !amount) return [];\n\t\treturn Array.from(\n\t\t\t{ length: Math.min(amount, arr.length) },\n\t\t\t(): K => arr.splice(Math.floor(Math.random() * arr.length), 1)[0]!,\n\t\t);\n\t}\n\n\t/*\n\t Identical to {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/reverse \| Array.reverse()}\n\t * but returns a Collection instead of an Array.\n\t /\n\tpublic reverse() {\n\t\tconst entries = [...this.entries()].reverse();\n\t\tthis.clear();\n\t\tfor (const [key, value] of entries) this.set(key, value);\n\t\treturn this;\n\t}\n\n\t/\n\t Searches for a single item where the given function returns a truthy value. This behaves like\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/find \| Array.find()}.\n\t * All collections used in Discord.js are mapped using their `id` property, and if you want to find by id you\n\t * should use the `get` method. See\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map/get \| MDN} for details.\n\t \n\t @param fn - The function to test with (should return boolean)\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection.find(user => user.username === 'Bob');\n\t * ```\n\t /\n\tpublic find<V2 extends V>(fn: (value: V, key: K, collection: this) => value is V2): V2 \| undefined;\n\tpublic find(fn: (value: V, key: K, collection: this) => unknown): V \| undefined;\n\tpublic find<This, V2 extends V>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => value is V2,\n\t\tthisArg: This,\n\t): V2 \| undefined;\n\tpublic find<This>(fn: (this: This, value: V, key: K, collection: this) => unknown, thisArg: This): V \| undefined;\n\tpublic find(fn: (value: V, key: K, collection: this) => unknown, thisArg?: unknown): V \| undefined {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tfor (const [key, val] of this) {\n\t\t\tif (fn(val, key, this)) return val;\n\t\t}\n\n\t\treturn undefined;\n\t}\n\n\t/\n\t Searches for the key of a single item where the given function returns a truthy value. This behaves like\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/findIndex \| Array.findIndex()},\n\t * but returns the key rather than the positional index.\n\t \n\t @param fn - The function to test with (should return boolean)\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection.findKey(user => user.username === 'Bob');\n\t * ```\n\t /\n\tpublic findKey<K2 extends K>(fn: (value: V, key: K, collection: this) => key is K2): K2 \| undefined;\n\tpublic findKey(fn: (value: V, key: K, collection: this) => unknown): K \| undefined;\n\tpublic findKey<This, K2 extends K>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => key is K2,\n\t\tthisArg: This,\n\t): K2 \| undefined;\n\tpublic findKey<This>(fn: (this: This, value: V, key: K, collection: this) => unknown, thisArg: This): K \| undefined;\n\tpublic findKey(fn: (value: V, key: K, collection: this) => unknown, thisArg?: unknown): K \| undefined {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tfor (const [key, val] of this) {\n\t\t\tif (fn(val, key, this)) return key;\n\t\t}\n\n\t\treturn undefined;\n\t}\n\n\t/\n\t Removes items that satisfy the provided filter function.\n\t \n\t @param fn - Function used to test (should return a boolean)\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @returns The number of removed entries\n\t /\n\tpublic sweep(fn: (value: V, key: K, collection: this) => unknown): number;\n\tpublic sweep<T>(fn: (this: T, value: V, key: K, collection: this) => unknown, thisArg: T): number;\n\tpublic sweep(fn: (value: V, key: K, collection: this) => unknown, thisArg?: unknown): number {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tconst previousSize = this.size;\n\t\tfor (const [key, val] of this) {\n\t\t\tif (fn(val, key, this)) this.delete(key);\n\t\t}\n\n\t\treturn previousSize - this.size;\n\t}\n\n\t/\n\t Identical to\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/filter \| Array.filter()},\n\t * but returns a Collection instead of an Array.\n\t \n\t @param fn - The function to test with (should return boolean)\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection.filter(user => user.username === 'Bob');\n\t * ```\n\t /\n\tpublic filter<K2 extends K>(fn: (value: V, key: K, collection: this) => key is K2): Collection<K2, V>;\n\tpublic filter<V2 extends V>(fn: (value: V, key: K, collection: this) => value is V2): Collection<K, V2>;\n\tpublic filter(fn: (value: V, key: K, collection: this) => unknown): Collection<K, V>;\n\tpublic filter<This, K2 extends K>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => key is K2,\n\t\tthisArg: This,\n\t): Collection<K2, V>;\n\tpublic filter<This, V2 extends V>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => value is V2,\n\t\tthisArg: This,\n\t): Collection<K, V2>;\n\tpublic filter<This>(fn: (this: This, value: V, key: K, collection: this) => unknown, thisArg: This): Collection<K, V>;\n\tpublic filter(fn: (value: V, key: K, collection: this) => unknown, thisArg?: unknown): Collection<K, V> {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tconst results = new this.constructor[Symbol.species]<K, V>();\n\t\tfor (const [key, val] of this) {\n\t\t\tif (fn(val, key, this)) results.set(key, val);\n\t\t}\n\n\t\treturn results;\n\t}\n\n\t/\n\t Partitions the collection into two collections where the first collection\n\t * contains the items that passed and the second contains the items that failed.\n\t \n\t @param fn - Function used to test (should return a boolean)\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * const [big, small] = collection.partition(guild => guild.memberCount > 250);\n\t * ```\n\t /\n\tpublic partition<K2 extends K>(\n\t\tfn: (value: V, key: K, collection: this) => key is K2,\n\t): [Collection<K2, V>, Collection<Exclude<K, K2>, V>];\n\tpublic partition<V2 extends V>(\n\t\tfn: (value: V, key: K, collection: this) => value is V2,\n\t): [Collection<K, V2>, Collection<K, Exclude<V, V2>>];\n\tpublic partition(fn: (value: V, key: K, collection: this) => unknown): [Collection<K, V>, Collection<K, V>];\n\tpublic partition<This, K2 extends K>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => key is K2,\n\t\tthisArg: This,\n\t): [Collection<K2, V>, Collection<Exclude<K, K2>, V>];\n\tpublic partition<This, V2 extends V>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => value is V2,\n\t\tthisArg: This,\n\t): [Collection<K, V2>, Collection<K, Exclude<V, V2>>];\n\tpublic partition<This>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => unknown,\n\t\tthisArg: This,\n\t): [Collection<K, V>, Collection<K, V>];\n\tpublic partition(\n\t\tfn: (value: V, key: K, collection: this) => unknown,\n\t\tthisArg?: unknown,\n\t): [Collection<K, V>, Collection<K, V>] {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tconst results: [Collection<K, V>, Collection<K, V>] = [\n\t\t\tnew this.constructor[Symbol.species]<K, V>(),\n\t\t\tnew this.constructor[Symbol.species]<K, V>(),\n\t\t];\n\t\tfor (const [key, val] of this) {\n\t\t\tif (fn(val, key, this)) {\n\t\t\t\tresults[0].set(key, val);\n\t\t\t} else {\n\t\t\t\tresults[1].set(key, val);\n\t\t\t}\n\t\t}\n\n\t\treturn results;\n\t}\n\n\t/\n\t Maps each item into a Collection, then joins the results into a single Collection. Identical in behavior to\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/flatMap \| Array.flatMap()}.\n\t \n\t @param fn - Function that produces a new Collection\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection.flatMap(guild => guild.members.cache);\n\t * ```\n\t /\n\tpublic flatMap<T>(fn: (value: V, key: K, collection: this) => Collection<K, T>): Collection<K, T>;\n\tpublic flatMap<T, This>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => Collection<K, T>,\n\t\tthisArg: This,\n\t): Collection<K, T>;\n\tpublic flatMap<T>(fn: (value: V, key: K, collection: this) => Collection<K, T>, thisArg?: unknown): Collection<K, T> {\n\t\t// eslint-disable-next-line unicorn/no-array-method-this-argument\n\t\tconst collections = this.map(fn, thisArg);\n\t\treturn new this.constructor[Symbol.species]<K, T>().concat(...collections);\n\t}\n\n\t/\n\t Maps each item to another value into an array. Identical in behavior to\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/map \| Array.map()}.\n\t \n\t @param fn - Function that produces an element of the new array, taking three arguments\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection.map(user => user.tag);\n\t * ```\n\t /\n\tpublic map<T>(fn: (value: V, key: K, collection: this) => T): T[];\n\tpublic map<This, T>(fn: (this: This, value: V, key: K, collection: this) => T, thisArg: This): T[];\n\tpublic map<T>(fn: (value: V, key: K, collection: this) => T, thisArg?: unknown): T[] {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tconst iter = this.entries();\n\t\treturn Array.from({ length: this.size }, (): T => {\n\t\t\tconst [key, value] = iter.next().value;\n\t\t\treturn fn(value, key, this);\n\t\t});\n\t}\n\n\t/\n\t Maps each item to another value into a collection. Identical in behavior to\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/map \| Array.map()}.\n\t \n\t @param fn - Function that produces an element of the new collection, taking three arguments\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection.mapValues(user => user.tag);\n\t * ```\n\t /\n\tpublic mapValues<T>(fn: (value: V, key: K, collection: this) => T): Collection<K, T>;\n\tpublic mapValues<This, T>(fn: (this: This, value: V, key: K, collection: this) => T, thisArg: This): Collection<K, T>;\n\tpublic mapValues<T>(fn: (value: V, key: K, collection: this) => T, thisArg?: unknown): Collection<K, T> {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tconst coll = new this.constructor[Symbol.species]<K, T>();\n\t\tfor (const [key, val] of this) coll.set(key, fn(val, key, this));\n\t\treturn coll;\n\t}\n\n\t/\n\t Checks if there exists an item that passes a test. Identical in behavior to\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/some \| Array.some()}.\n\t \n\t @param fn - Function used to test (should return a boolean)\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection.some(user => user.discriminator === '0000');\n\t * ```\n\t /\n\tpublic some(fn: (value: V, key: K, collection: this) => unknown): boolean;\n\tpublic some<T>(fn: (this: T, value: V, key: K, collection: this) => unknown, thisArg: T): boolean;\n\tpublic some(fn: (value: V, key: K, collection: this) => unknown, thisArg?: unknown): boolean {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tfor (const [key, val] of this) {\n\t\t\tif (fn(val, key, this)) return true;\n\t\t}\n\n\t\treturn false;\n\t}\n\n\t/\n\t Checks if all items passes a test. Identical in behavior to\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/every \| Array.every()}.\n\t \n\t @param fn - Function used to test (should return a boolean)\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection.every(user => !user.bot);\n\t * ```\n\t /\n\tpublic every<K2 extends K>(fn: (value: V, key: K, collection: this) => key is K2): this is Collection<K2, V>;\n\tpublic every<V2 extends V>(fn: (value: V, key: K, collection: this) => value is V2): this is Collection<K, V2>;\n\tpublic every(fn: (value: V, key: K, collection: this) => unknown): boolean;\n\tpublic every<This, K2 extends K>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => key is K2,\n\t\tthisArg: This,\n\t): this is Collection<K2, V>;\n\tpublic every<This, V2 extends V>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => value is V2,\n\t\tthisArg: This,\n\t): this is Collection<K, V2>;\n\tpublic every<This>(fn: (this: This, value: V, key: K, collection: this) => unknown, thisArg: This): boolean;\n\tpublic every(fn: (value: V, key: K, collection: this) => unknown, thisArg?: unknown): boolean {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tfor (const [key, val] of this) {\n\t\t\tif (!fn(val, key, this)) return false;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\t/\n\t Applies a function to produce a single value. Identical in behavior to\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/reduce \| Array.reduce()}.\n\t \n\t @param fn - Function used to reduce, taking four arguments; `accumulator`, `currentValue`, `currentKey`,\n\t * and `collection`\n\t * @param initialValue - Starting value for the accumulator\n\t * @example\n\t * ```ts\n\t * collection.reduce((acc, guild) => acc + guild.memberCount, 0);\n\t * ```\n\t /\n\tpublic reduce<T>(fn: (accumulator: T, value: V, key: K, collection: this) => T, initialValue?: T): T {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tlet accumulator!: T;\n\n\t\tif (typeof initialValue !== 'undefined') {\n\t\t\taccumulator = initialValue;\n\t\t\tfor (const [key, val] of this) accumulator = fn(accumulator, val, key, this);\n\t\t\treturn accumulator;\n\t\t}\n\n\t\tlet first = true;\n\t\tfor (const [key, val] of this) {\n\t\t\tif (first) {\n\t\t\t\taccumulator = val as unknown as T;\n\t\t\t\tfirst = false;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\taccumulator = fn(accumulator, val, key, this);\n\t\t}\n\n\t\t// No items iterated.\n\t\tif (first) {\n\t\t\tthrow new TypeError('Reduce of empty collection with no initial value');\n\t\t}\n\n\t\treturn accumulator;\n\t}\n\n\t/\n\t Identical to\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map/forEach \| Map.forEach()},\n\t * but returns the collection instead of undefined.\n\t \n\t @param fn - Function to execute for each element\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection\n\t * .each(user => console.log(user.username))\n\t * .filter(user => user.bot)\n\t * .each(user => console.log(user.username));\n\t * ```\n\t /\n\tpublic each(fn: (value: V, key: K, collection: this) => void): this;\n\tpublic each<T>(fn: (this: T, value: V, key: K, collection: this) => void, thisArg: T): this;\n\tpublic each(fn: (value: V, key: K, collection: this) => void, thisArg?: unknown): this {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\t// eslint-disable-next-line unicorn/no-array-method-this-argument\n\t\tthis.forEach(fn as (value: V, key: K, map: Map<K, V>) => void, thisArg);\n\t\treturn this;\n\t}\n\n\t/\n\t Runs a function on the collection and returns the collection.\n\t \n\t @param fn - Function to execute\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection\n\t * .tap(coll => console.log(coll.size))\n\t * .filter(user => user.bot)\n\t * .tap(coll => console.log(coll.size))\n\t * ```\n\t /\n\tpublic tap(fn: (collection: this) => void): this;\n\tpublic tap<T>(fn: (this: T, collection: this) => void, thisArg: T): this;\n\tpublic tap(fn: (collection: this) => void, thisArg?: unknown): this {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tfn(this);\n\t\treturn this;\n\t}\n\n\t/\n\t Creates an identical shallow copy of this collection.\n\t \n\t @example\n\t * ```ts\n\t * const newColl = someColl.clone();\n\t * ```\n\t /\n\tpublic clone(): Collection<K, V> {\n\t\treturn new this.constructor[Symbol.species](this);\n\t}\n\n\t/\n\t Combines this collection with others into a new collection. None of the source collections are modified.\n\t \n\t @param collections - Collections to merge\n\t * @example\n\t * ```ts\n\t * const newColl = someColl.concat(someOtherColl, anotherColl, ohBoyAColl);\n\t * ```\n\t /\n\tpublic concat(...collections: ReadonlyCollection<K, V>[]) {\n\t\tconst newColl = this.clone();\n\t\tfor (const coll of collections) {\n\t\t\tfor (const [key, val] of coll) newColl.set(key, val);\n\t\t}\n\n\t\treturn newColl;\n\t}\n\n\t/\n\t Checks if this collection shares identical items with another.\n\t * This is different to checking for equality using equal-signs, because\n\t * the collections may be different objects, but contain the same data.\n\t \n\t @param collection - Collection to compare with\n\t * @returns Whether the collections have identical contents\n\t /\n\tpublic equals(collection: ReadonlyCollection<K, V>) {\n\t\tif (!collection) return false; // runtime check\n\t\tif (this === collection) return true;\n\t\tif (this.size !== collection.size) return false;\n\t\tfor (const [key, value] of this) {\n\t\t\tif (!collection.has(key) \|\| value !== collection.get(key)) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\treturn true;\n\t}\n\n\t/\n\t The sort method sorts the items of a collection in place and returns it.\n\t * The sort is not necessarily stable in Node 10 or older.\n\t * The default sort order is according to string Unicode code points.\n\t \n\t @param compareFunction - Specifies a function that defines the sort order.\n\t * If omitted, the collection is sorted according to each character's Unicode code point value, according to the string conversion of each element.\n\t * @example\n\t * ```ts\n\t * collection.sort((userA, userB) => userA.createdTimestamp - userB.createdTimestamp);\n\t * ```\n\t /\n\tpublic sort(compareFunction: Comparator<K, V> = Collection.defaultSort) {\n\t\tconst entries = [...this.entries()];\n\t\tentries.sort((a, b): number => compareFunction(a[1], b[1], a[0], b[0]));\n\n\t\t// Perform clean-up\n\t\tsuper.clear();\n\n\t\t// Set the new entries\n\t\tfor (const [k, v] of entries) {\n\t\t\tsuper.set(k, v);\n\t\t}\n\n\t\treturn this;\n\t}\n\n\t/\n\t The intersect method returns a new structure containing items where the keys and values are present in both original structures.\n\t \n\t @param other - The other Collection to filter against\n\t /\n\tpublic intersect<T>(other: ReadonlyCollection<K, T>): Collection<K, T> {\n\t\tconst coll = new this.constructor[Symbol.species]<K, T>();\n\t\tfor (const [k, v] of other) {\n\t\t\tif (this.has(k) && Object.is(v, this.get(k))) {\n\t\t\t\tcoll.set(k, v);\n\t\t\t}\n\t\t}\n\n\t\treturn coll;\n\t}\n\n\t/\n\t The subtract method returns a new structure containing items where the keys and values of the original structure are not present in the other.\n\t \n\t @param other - The other Collection to filter against\n\t /\n\tpublic subtract<T>(other: ReadonlyCollection<K, T>): Collection<K, V> {\n\t\tconst coll = new this.constructor[Symbol.species]<K, V>();\n\t\tfor (const [k, v] of this) {\n\t\t\tif (!other.has(k) \|\| !Object.is(v, other.get(k))) {\n\t\t\t\tcoll.set(k, v);\n\t\t\t}\n\t\t}\n\n\t\treturn coll;\n\t}\n\n\t/\n\t The difference method returns a new structure containing items where the key is present in one of the original structures but not the other.\n\t \n\t @param other - The other Collection to filter against\n\t /\n\tpublic difference<T>(other: ReadonlyCollection<K, T>): Collection<K, T \| V> {\n\t\tconst coll = new this.constructor[Symbol.species]<K, T \| V>();\n\t\tfor (const [k, v] of other) {\n\t\t\tif (!this.has(k)) coll.set(k, v);\n\t\t}\n\n\t\tfor (const [k, v] of this) {\n\t\t\tif (!other.has(k)) coll.set(k, v);\n\t\t}\n\n\t\treturn coll;\n\t}\n\n\t/\n\t Merges two Collections together into a new Collection.\n\t \n\t @param other - The other Collection to merge with\n\t * @param whenInSelf - Function getting the result if the entry only exists in this Collection\n\t * @param whenInOther - Function getting the result if the entry only exists in the other Collection\n\t * @param whenInBoth - Function getting the result if the entry exists in both Collections\n\t * @example\n\t * ```ts\n\t * // Sums up the entries in two collections.\n\t * coll.merge(\n\t * other,\n\t * x => ({ keep: true, value: x }),\n\t * y => ({ keep: true, value: y }),\n\t * (x, y) => ({ keep: true, value: x + y }),\n\t * );\n\t * ```\n\t * @example\n\t * ```ts\n\t * // Intersects two collections in a left-biased manner.\n\t * coll.merge(\n\t * other,\n\t * x => ({ keep: false }),\n\t * y => ({ keep: false }),\n\t * (x, _) => ({ keep: true, value: x }),\n\t * );\n\t * ```\n\t /\n\tpublic merge<T, R>(\n\t\tother: ReadonlyCollection<K, T>,\n\t\twhenInSelf: (value: V, key: K) => Keep<R>,\n\t\twhenInOther: (valueOther: T, key: K) => Keep<R>,\n\t\twhenInBoth: (value: V, valueOther: T, key: K) => Keep<R>,\n\t): Collection<K, R> {\n\t\tconst coll = new this.constructor[Symbol.species]<K, R>();\n\t\tconst keys = new Set([...this.keys(), ...other.keys()]);\n\t\tfor (const k of keys) {\n\t\t\tconst hasInSelf = this.has(k);\n\t\t\tconst hasInOther = other.has(k);\n\n\t\t\tif (hasInSelf && hasInOther) {\n\t\t\t\tconst r = whenInBoth(this.get(k)!, other.get(k)!, k);\n\t\t\t\tif (r.keep) coll.set(k, r.value);\n\t\t\t} else if (hasInSelf) {\n\t\t\t\tconst r = whenInSelf(this.get(k)!, k);\n\t\t\t\tif (r.keep) coll.set(k, r.value);\n\t\t\t} else if (hasInOther) {\n\t\t\t\tconst r = whenInOther(other.get(k)!, k);\n\t\t\t\tif (r.keep) coll.set(k, r.value);\n\t\t\t}\n\t\t}\n\n\t\treturn coll;\n\t}\n\n\t/\n\t The sorted method sorts the items of a collection and returns it.\n\t * The sort is not necessarily stable in Node 10 or older.\n\t * The default sort order is according to string Unicode code points.\n\t \n\t @param compareFunction - Specifies a function that defines the sort order.\n\t * If omitted, the collection is sorted according to each character's Unicode code point value,\n\t * according to the string conversion of each element.\n\t * @example\n\t * ```ts\n\t * collection.sorted((userA, userB) => userA.createdTimestamp - userB.createdTimestamp);\n\t * ```\n\t /\n\tpublic sorted(compareFunction: Comparator<K, V> = Collection.defaultSort) {\n\t\treturn new this.constructor[Symbol.species](this).sort((av, bv, ak, bk) => compareFunction(av, bv, ak, bk));\n\t}\n\n\tpublic toJSON() {\n\t\t// toJSON is called recursively by JSON.stringify.\n\t\treturn [...this.values()];\n\t}\n\n\tprivate static defaultSort<V>(firstValue: V, secondValue: V): number {\n\t\treturn Number(firstValue > secondValue) \|\| Number(firstValue === secondValue) - 1;\n\t}\n\n\t/\n\t Creates a Collection from a list of entries.\n\t \n\t @param entries - The list of entries\n\t * @param combine - Function to combine an existing entry with a new one\n\t * @example\n\t * ```ts\n\t * Collection.combineEntries([[\"a\", 1], [\"b\", 2], [\"a\", 2]], (x, y) => x + y);\n\t * // returns Collection { \"a\" => 3, \"b\" => 2 }\n\t * ```\n\t /\n\tpublic static combineEntries<K, V>(\n\t\tentries: Iterable<[K, V]>,\n\t\tcombine: (firstValue: V, secondValue: V, key: K) => V,\n\t): Collection<K, V> {\n\t\tconst coll = new Collection<K, V>();\n\t\tfor (const [k, v] of entries) {\n\t\t\tif (coll.has(k)) {\n\t\t\t\tcoll.set(k, combine(coll.get(k)!, v, k));\n\t\t\t} else {\n\t\t\t\tcoll.set(k, v);\n\t\t\t}\n\t\t}\n\n\t\treturn coll;\n\t}\n}\n\n/\n @internal\n /\nexport type Keep<V> = { keep: false } \| { keep: true; value: V };\n\n/\n @internal\n /\nexport type Comparator<K, V> = (firstValue: V, secondValue: V, firstKey: K, secondKey: K) => number;\n","export from './collection.js';\n\n/*\n The {@link https://github.com/discordjs/discord.js/blob/main/packages/collection/#readme \| @discordjs/collection} version\n * that you are currently using.\n */\n// This needs to explicitly be `string` so it is not typed as a \"const string\" that gets injected by esbuild\nexport const version = '1.3.1-dev.1677326645-4e0e125.0' as string;\n"],"mappings":";;;;AAsCO,IAAM,aAAN,cAA+B,IAAU;AAAA,EAWxC,OAAO,KAAQ,uBAA2D;AAChF,QAAI,KAAK,IAAI,GAAG;AAAG,aAAO,KAAK,IAAI,GAAG;AACtC,QAAI,OAAO,0BAA0B;AAAY,YAAM,IAAI,UAAU,GAAG,yCAAyC;AACjH,UAAM,eAAe,sBAAsB,KAAK,IAAI;AACpD,SAAK,IAAI,KAAK,YAAY;AAC1B,WAAO;AAAA,EACR;AAAA,EAQO,UAAU,MAAW;AAC3B,WAAO,KAAK,MAAM,CAAC,MAAM,MAAM,IAAI,CAAC,CAAC;AAAA,EACtC;AAAA,EAQO,UAAU,MAAW;AAC3B,WAAO,KAAK,KAAK,CAAC,MAAM,MAAM,IAAI,CAAC,CAAC;AAAA,EACrC;AAAA,EAUO,MAAM,QAAsC;AAClD,QAAI,OAAO,WAAW;AAAa,aAAO,KAAK,OAAO,EAAE,KAAK,EAAE;AAC/D,QAAI,SAAS;AAAG,aAAO,KAAK,KAAK,SAAS,EAAE;AAC5C,aAAS,KAAK,IAAI,KAAK,MAAM,MAAM;AACnC,UAAM,OAAO,KAAK,OAAO;AACzB,WAAO,MAAM,KAAK,EAAE,QAAQ,OAAO,GAAG,MAAS,KAAK,KAAK,EAAE,KAAK;AAAA,EACjE;AAAA,EAWO,SAAS,QAAsC;AACrD,QAAI,OAAO,WAAW;AAAa,aAAO,KAAK,KAAK,EAAE,KAAK,EAAE;AAC7D,QAAI,SAAS;AAAG,aAAO,KAAK,QAAQ,SAAS,EAAE;AAC/C,aAAS,KAAK,IAAI,KAAK,MAAM,MAAM;AACnC,UAAM,OAAO,KAAK,KAAK;AACvB,WAAO,MAAM,KAAK,EAAE,QAAQ,OAAO,GAAG,MAAS,KAAK,KAAK,EAAE,KAAK;AAAA,EACjE;AAAA,EAWO,KAAK,QAAsC;AACjD,UAAM,MAAM,CAAC,GAAG,KAAK,OAAO,CAAC;AAC7B,QAAI,OAAO,WAAW;AAAa,aAAO,IAAI,IAAI,SAAS;AAC3D,QAAI,SAAS;AAAG,aAAO,KAAK,MAAM,SAAS,EAAE;AAC7C,QAAI,CAAC;AAAQ,aAAO,CAAC;AACrB,WAAO,IAAI,MAAM,CAAC,MAAM;AAAA,EACzB;AAAA,EAWO,QAAQ,QAAsC;AACpD,UAAM,MAAM,CAAC,GAAG,KAAK,KAAK,CAAC;AAC3B,QAAI,OAAO,WAAW;AAAa,aAAO,IAAI,IAAI,SAAS;AAC3D,QAAI,SAAS;AAAG,aAAO,KAAK,SAAS,SAAS,EAAE;AAChD,QAAI,CAAC;AAAQ,aAAO,CAAC;AACrB,WAAO,IAAI,MAAM,CAAC,MAAM;AAAA,EACzB;AAAA,EASO,GAAG,OAAe;AACxB,YAAQ,KAAK,MAAM,KAAK;AACxB,UAAM,MAAM,CAAC,GAAG,KAAK,OAAO,CAAC;AAC7B,WAAO,IAAI,GAAG,KAAK;AAAA,EACpB;AAAA,EASO,MAAM,OAAe;AAC3B,YAAQ,KAAK,MAAM,KAAK;AACxB,UAAM,MAAM,CAAC,GAAG,KAAK,KAAK,CAAC;AAC3B,WAAO,IAAI,GAAG,KAAK;AAAA,EACpB;AAAA,EAUO,OAAO,QAAsC;AACnD,UAAM,MAAM,CAAC,GAAG,KAAK,OAAO,CAAC;AAC7B,QAAI,OAAO,WAAW;AAAa,aAAO,IAAI,KAAK,MAAM,KAAK,OAAO,IAAI,IAAI,MAAM;AACnF,QAAI,CAAC,IAAI,UAAU,CAAC;AAAQ,aAAO,CAAC;AACpC,WAAO,MAAM;AAAA,MACZ,EAAE,QAAQ,KAAK,IAAI,QAAQ,IAAI,MAAM,EAAE;AAAA,MACvC,MAAS,IAAI,OAAO,KAAK,MAAM,KAAK,OAAO,IAAI,IAAI,MAAM,GAAG,CAAC,EAAE;AAAA,IAChE;AAAA,EACD;AAAA,EAUO,UAAU,QAAsC;AACtD,UAAM,MAAM,CAAC,GAAG,KAAK,KAAK,CAAC;AAC3B,QAAI,OAAO,WAAW;AAAa,aAAO,IAAI,KAAK,MAAM,KAAK,OAAO,IAAI,IAAI,MAAM;AACnF,QAAI,CAAC,IAAI,UAAU,CAAC;AAAQ,aAAO,CAAC;AACpC,WAAO,MAAM;AAAA,MACZ,EAAE,QAAQ,KAAK,IAAI,QAAQ,IAAI,MAAM,EAAE;AAAA,MACvC,MAAS,IAAI,OAAO,KAAK,MAAM,KAAK,OAAO,IAAI,IAAI,MAAM,GAAG,CAAC,EAAE;AAAA,IAChE;AAAA,EACD;AAAA,EAMO,UAAU;AAChB,UAAM,UAAU,CAAC,GAAG,KAAK,QAAQ,CAAC,EAAE,QAAQ;AAC5C,SAAK,MAAM;AACX,eAAW,CAAC,KAAK,KAAK,KAAK;AAAS,WAAK,IAAI,KAAK,KAAK;AACvD,WAAO;AAAA,EACR;AAAA,EAuBO,KAAK,IAAqD,SAAkC;AAClG,QAAI,OAAO,OAAO;AAAY,YAAM,IAAI,UAAU,GAAG,sBAAsB;AAC3E,QAAI,OAAO,YAAY;AAAa,WAAK,GAAG,KAAK,OAAO;AACxD,eAAW,CAAC,KAAK,GAAG,KAAK,MAAM;AAC9B,UAAI,GAAG,KAAK,KAAK,IAAI;AAAG,eAAO;AAAA,IAChC;AAEA,WAAO;AAAA,EACR;AAAA,EAqBO,QAAQ,IAAqD,SAAkC;AACrG,QAAI,OAAO,OAAO;AAAY,YAAM,IAAI,UAAU,GAAG,sBAAsB;AAC3E,QAAI,OAAO,YAAY;AAAa,WAAK,GAAG,KAAK,OAAO;AACxD,eAAW,CAAC,KAAK,GAAG,KAAK,MAAM;AAC9B,UAAI,GAAG,KAAK,KAAK,IAAI;AAAG,eAAO;AAAA,IAChC;AAEA,WAAO;AAAA,EACR;AAAA,EAWO,MAAM,IAAqD,SAA2B;AAC5F,QAAI,OAAO,OAAO;AAAY,YAAM,IAAI,UAAU,GAAG,sBAAsB;AAC3E,QAAI,OAAO,YAAY;AAAa,WAAK,GAAG,KAAK,OAAO;AACxD,UAAM,eAAe,KAAK;AAC1B,eAAW,CAAC,KAAK,GAAG,KAAK,MAAM;AAC9B,UAAI,GAAG,KAAK,KAAK,IAAI;AAAG,aAAK,OAAO,GAAG;AAAA,IACxC;AAEA,WAAO,eAAe,KAAK;AAAA,EAC5B;AAAA,EA0BO,OAAO,IAAqD,SAAqC;AACvG,QAAI,OAAO,OAAO;AAAY,YAAM,IAAI,UAAU,GAAG,sBAAsB;AAC3E,QAAI,OAAO,YAAY;AAAa,WAAK,GAAG,KAAK,OAAO;AACxD,UAAM,UAAU,IAAI,KAAK,YAAY,OAAO,SAAe;AAC3D,eAAW,CAAC,KAAK,GAAG,KAAK,MAAM;AAC9B,UAAI,GAAG,KAAK,KAAK,IAAI;AAAG,gBAAQ,IAAI,KAAK,GAAG;AAAA,IAC7C;AAEA,WAAO;AAAA,EACR;AAAA,EAgCO,UACN,IACA,SACuC;AACvC,QAAI,OAAO,OAAO;AAAY,YAAM,IAAI,UAAU,GAAG,sBAAsB;AAC3E,QAAI,OAAO,YAAY;AAAa,WAAK,GAAG,KAAK,OAAO;AACxD,UAAM,UAAgD;AAAA,MACrD,IAAI,KAAK,YAAY,OAAO,SAAe;AAAA,MAC3C,IAAI,KAAK,YAAY,OAAO,SAAe;AAAA,IAC5C;AACA,eAAW,CAAC,KAAK,GAAG,KAAK,MAAM;AAC9B,UAAI,GAAG,KAAK,KAAK,IAAI,GAAG;AACvB,gBAAQ,GAAG,IAAI,KAAK,GAAG;AAAA,MACxB,OAAO;AACN,gBAAQ,GAAG,IAAI,KAAK,GAAG;AAAA,MACxB;AAAA,IACD;AAEA,WAAO;AAAA,EACR;AAAA,EAkBO,QAAW,IAA8D,SAAqC;AAEpH,UAAM,cAAc,KAAK,IAAI,IAAI,OAAO;AACxC,WAAO,IAAI,KAAK,YAAY,OAAO,SAAe,EAAE,OAAO,GAAG,WAAW;AAAA,EAC1E;AAAA,EAeO,IAAO,IAA+C,SAAwB;AACpF,QAAI,OAAO,OAAO;AAAY,YAAM,IAAI,UAAU,GAAG,sBAAsB;AAC3E,QAAI,OAAO,YAAY;AAAa,WAAK,GAAG,KAAK,OAAO;AACxD,UAAM,OAAO,KAAK,QAAQ;AAC1B,WAAO,MAAM,KAAK,EAAE,QAAQ,KAAK,KAAK,GAAG,MAAS;AACjD,YAAM,CAAC,KAAK,KAAK,IAAI,KAAK,KAAK,EAAE;AACjC,aAAO,GAAG,OAAO,KAAK,IAAI;AAAA,IAC3B,CAAC;AAAA,EACF;AAAA,EAeO,UAAa,IAA+C,SAAqC;AACvG,QAAI,OAAO,OAAO;AAAY,YAAM,IAAI,UAAU,GAAG,sBAAsB;AAC3E,QAAI,OAAO,YAAY;AAAa,WAAK,GAAG,KAAK,OAAO;AACxD,UAAM,OAAO,IAAI,KAAK,YAAY,OAAO,SAAe;AACxD,eAAW,CAAC,KAAK,GAAG,KAAK;AAAM,WAAK,IAAI,KAAK,GAAG,KAAK,KAAK,IAAI,CAAC;AAC/D,WAAO;AAAA,EACR;AAAA,EAeO,KAAK,IAAqD,SAA4B;AAC5F,QAAI,OAAO,OAAO;AAAY,YAAM,IAAI,UAAU,GAAG,sBAAsB;AAC3E,QAAI,OAAO,YAAY;AAAa,WAAK,GAAG,KAAK,OAAO;AACxD,eAAW,CAAC,KAAK,GAAG,KAAK,MAAM;AAC9B,UAAI,GAAG,KAAK,KAAK,IAAI;AAAG,eAAO;AAAA,IAChC;AAEA,WAAO;AAAA,EACR;AAAA,EAyBO,MAAM,IAAqD,SAA4B;AAC7F,QAAI,OAAO,OAAO;AAAY,YAAM,IAAI,UAAU,GAAG,sBAAsB;AAC3E,QAAI,OAAO,YAAY;AAAa,WAAK,GAAG,KAAK,OAAO;AACxD,eAAW,CAAC,KAAK,GAAG,KAAK,MAAM;AAC9B,UAAI,CAAC,GAAG,KAAK,KAAK,IAAI;AAAG,eAAO;AAAA,IACjC;AAEA,WAAO;AAAA,EACR;AAAA,EAcO,OAAU,IAA+D,cAAqB;AACpG,QAAI,OAAO,OAAO;AAAY,YAAM,IAAI,UAAU,GAAG,sBAAsB;AAC3E,QAAI;AAEJ,QAAI,OAAO,iBAAiB,aAAa;AACxC,oBAAc;AACd,iBAAW,CAAC,KAAK,GAAG,KAAK;AAAM,sBAAc,GAAG,aAAa,KAAK,KAAK,IAAI;AAC3E,aAAO;AAAA,IACR;AAEA,QAAI,QAAQ;AACZ,eAAW,CAAC,KAAK,GAAG,KAAK,MAAM;AAC9B,UAAI,OAAO;AACV,sBAAc;AACd,gBAAQ;AACR;AAAA,MACD;AAEA,oBAAc,GAAG,aAAa,KAAK,KAAK,IAAI;AAAA,IAC7C;AAGA,QAAI,OAAO;AACV,YAAM,IAAI,UAAU,kDAAkD;AAAA,IACvE;AAEA,WAAO;AAAA,EACR;AAAA,EAmBO,KAAK,IAAkD,SAAyB;AACtF,QAAI,OAAO,OAAO;AAAY,YAAM,IAAI,UAAU,GAAG,sBAAsB;AAE3E,SAAK,QAAQ,IAAkD,OAAO;AACtE,WAAO;AAAA,EACR;AAAA,EAiBO,IAAI,IAAgC,SAAyB;AACnE,QAAI,OAAO,OAAO;AAAY,YAAM,IAAI,UAAU,GAAG,sBAAsB;AAC3E,QAAI,OAAO,YAAY;AAAa,WAAK,GAAG,KAAK,OAAO;AACxD,OAAG,IAAI;AACP,WAAO;AAAA,EACR;AAAA,EAUO,QAA0B;AAChC,WAAO,IAAI,KAAK,YAAY,OAAO,SAAS,IAAI;AAAA,EACjD;AAAA,EAWO,UAAU,aAAyC;AACzD,UAAM,UAAU,KAAK,MAAM;AAC3B,eAAW,QAAQ,aAAa;AAC/B,iBAAW,CAAC,KAAK,GAAG,KAAK;AAAM,gBAAQ,IAAI,KAAK,GAAG;AAAA,IACpD;AAEA,WAAO;AAAA,EACR;AAAA,EAUO,OAAO,YAAsC;AACnD,QAAI,CAAC;AAAY,aAAO;AACxB,QAAI,SAAS;AAAY,aAAO;AAChC,QAAI,KAAK,SAAS,WAAW;AAAM,aAAO;AAC1C,eAAW,CAAC,KAAK,KAAK,KAAK,MAAM;AAChC,UAAI,CAAC,WAAW,IAAI,GAAG,KAAK,UAAU,WAAW,IAAI,GAAG,GAAG;AAC1D,eAAO;AAAA,MACR;AAAA,IACD;AAEA,WAAO;AAAA,EACR;AAAA,EAcO,KAAK,kBAAoC,WAAW,aAAa;AACvE,UAAM,UAAU,CAAC,GAAG,KAAK,QAAQ,CAAC;AAClC,YAAQ,KAAK,CAAC,GAAG,MAAc,gBAAgB,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC;AAGtE,UAAM,MAAM;AAGZ,eAAW,CAAC,GAAG,CAAC,KAAK,SAAS;AAC7B,YAAM,IAAI,GAAG,CAAC;AAAA,IACf;AAEA,WAAO;AAAA,EACR;AAAA,EAOO,UAAa,OAAmD;AACtE,UAAM,OAAO,IAAI,KAAK,YAAY,OAAO,SAAe;AACxD,eAAW,CAAC,GAAG,CAAC,KAAK,OAAO;AAC3B,UAAI,KAAK,IAAI,CAAC,KAAK,OAAO,GAAG,GAAG,KAAK,IAAI,CAAC,CAAC,GAAG;AAC7C,aAAK,IAAI,GAAG,CAAC;AAAA,MACd;AAAA,IACD;AAEA,WAAO;AAAA,EACR;AAAA,EAOO,SAAY,OAAmD;AACrE,UAAM,OAAO,IAAI,KAAK,YAAY,OAAO,SAAe;AACxD,eAAW,CAAC,GAAG,CAAC,KAAK,MAAM;AAC1B,UAAI,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,GAAG,MAAM,IAAI,CAAC,CAAC,GAAG;AACjD,aAAK,IAAI,GAAG,CAAC;AAAA,MACd;AAAA,IACD;AAEA,WAAO;AAAA,EACR;AAAA,EAOO,WAAc,OAAuD;AAC3E,UAAM,OAAO,IAAI,KAAK,YAAY,OAAO,SAAmB;AAC5D,eAAW,CAAC,GAAG,CAAC,KAAK,OAAO;AAC3B,UAAI,CAAC,KAAK,IAAI,CAAC;AAAG,aAAK,IAAI,GAAG,CAAC;AAAA,IAChC;AAEA,eAAW,CAAC,GAAG,CAAC,KAAK,MAAM;AAC1B,UAAI,CAAC,MAAM,IAAI,CAAC;AAAG,aAAK,IAAI,GAAG,CAAC;AAAA,IACjC;AAEA,WAAO;AAAA,EACR;AAAA,EA8BO,MACN,OACA,YACA,aACA,YACmB;AACnB,UAAM,OAAO,IAAI,KAAK,YAAY,OAAO,SAAe;AACxD,UAAM,OAAO,oBAAI,IAAI,CAAC,GAAG,KAAK,KAAK,GAAG,GAAG,MAAM,KAAK,CAAC,CAAC;AACtD,eAAW,KAAK,MAAM;AACrB,YAAM,YAAY,KAAK,IAAI,CAAC;AAC5B,YAAM,aAAa,MAAM,IAAI,CAAC;AAE9B,UAAI,aAAa,YAAY;AAC5B,cAAM,IAAI,WAAW,KAAK,IAAI,CAAC,GAAI,MAAM,IAAI,CAAC,GAAI,CAAC;AACnD,YAAI,EAAE;AAAM,eAAK,IAAI,GAAG,EAAE,KAAK;AAAA,MAChC,WAAW,WAAW;AACrB,cAAM,IAAI,WAAW,KAAK,IAAI,CAAC,GAAI,CAAC;AACpC,YAAI,EAAE;AAAM,eAAK,IAAI,GAAG,EAAE,KAAK;AAAA,MAChC,WAAW,YAAY;AACtB,cAAM,IAAI,YAAY,MAAM,IAAI,CAAC,GAAI,CAAC;AACtC,YAAI,EAAE;AAAM,eAAK,IAAI,GAAG,EAAE,KAAK;AAAA,MAChC;AAAA,IACD;AAEA,WAAO;AAAA,EACR;AAAA,EAeO,OAAO,kBAAoC,WAAW,aAAa;AACzE,WAAO,IAAI,KAAK,YAAY,OAAO,SAAS,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,IAAI,OAAO,gBAAgB,IAAI,IAAI,IAAI,EAAE,CAAC;AAAA,EAC3G;AAAA,EAEO,SAAS;AAEf,WAAO,CAAC,GAAG,KAAK,OAAO,CAAC;AAAA,EACzB;AAAA,EAEA,OAAe,YAAe,YAAe,aAAwB;AACpE,WAAO,OAAO,aAAa,WAAW,KAAK,OAAO,eAAe,WAAW,IAAI;AAAA,EACjF;AAAA,EAaA,OAAc,eACb,SACA,SACmB;AACnB,UAAM,OAAO,IAAI,WAAiB;AAClC,eAAW,CAAC,GAAG,CAAC,KAAK,SAAS;AAC7B,UAAI,KAAK,IAAI,CAAC,GAAG;AAChB,aAAK,IAAI,GAAG,QAAQ,KAAK,IAAI,CAAC,GAAI,GAAG,CAAC,CAAC;AAAA,MACxC,OAAO;AACN,aAAK,IAAI,GAAG,CAAC;AAAA,MACd;AAAA,IACD;AAEA,WAAO;AAAA,EACR;AACD;AArxBa;;;AC/BN,IAAM,UAAU;","names":[]}
1	+ {"version":3,"sources":["../src/collection.ts","../src/index.ts"],"sourcesContent":["/* eslint-disable id-length /\n/ eslint-disable no-param-reassign /\n/\n @internal\n /\nexport interface CollectionConstructor {\n\tnew (): Collection<unknown, unknown>;\n\tnew <K, V>(entries?: readonly (readonly [K, V])[] \| null): Collection<K, V>;\n\tnew <K, V>(iterable: Iterable<readonly [K, V]>): Collection<K, V>;\n\treadonly prototype: Collection<unknown, unknown>;\n\treadonly [Symbol.species]: CollectionConstructor;\n}\n\n/\n Represents an immutable version of a collection\n /\nexport type ReadonlyCollection<K, V> = Omit<\n\tCollection<K, V>,\n\t'delete' \| 'ensure' \| 'forEach' \| 'get' \| 'reverse' \| 'set' \| 'sort' \| 'sweep'\n> &\n\tReadonlyMap<K, V>;\n\n/\n Separate interface for the constructor so that emitted js does not have a constructor that overwrites itself\n \n @internal\n /\nexport interface Collection<K, V> extends Map<K, V> {\n\tconstructor: CollectionConstructor;\n}\n\n/\n A Map with additional utility methods. This is used throughout discord.js rather than Arrays for anything that has\n * an ID, for significantly improved performance and ease-of-use.\n \n @typeParam K - The key type this collection holds\n * @typeParam V - The value type this collection holds\n /\nexport class Collection<K, V> extends Map<K, V> {\n\t/\n\t Obtains the value of the given key if it exists, otherwise sets and returns the value provided by the default value generator.\n\t \n\t @param key - The key to get if it exists, or set otherwise\n\t * @param defaultValueGenerator - A function that generates the default value\n\t * @example\n\t * ```ts\n\t * collection.ensure(guildId, () => defaultGuildConfig);\n\t * ```\n\t /\n\tpublic ensure(key: K, defaultValueGenerator: (key: K, collection: this) => V): V {\n\t\tif (this.has(key)) return this.get(key)!;\n\t\tif (typeof defaultValueGenerator !== 'function') throw new TypeError(`${defaultValueGenerator} is not a function`);\n\t\tconst defaultValue = defaultValueGenerator(key, this);\n\t\tthis.set(key, defaultValue);\n\t\treturn defaultValue;\n\t}\n\n\t/\n\t Checks if all of the elements exist in the collection.\n\t \n\t @param keys - The keys of the elements to check for\n\t * @returns `true` if all of the elements exist, `false` if at least one does not exist.\n\t /\n\tpublic hasAll(...keys: K[]) {\n\t\treturn keys.every((k) => super.has(k));\n\t}\n\n\t/\n\t Checks if any of the elements exist in the collection.\n\t \n\t @param keys - The keys of the elements to check for\n\t * @returns `true` if any of the elements exist, `false` if none exist.\n\t /\n\tpublic hasAny(...keys: K[]) {\n\t\treturn keys.some((k) => super.has(k));\n\t}\n\n\t/\n\t Obtains the first value(s) in this collection.\n\t \n\t @param amount - Amount of values to obtain from the beginning\n\t * @returns A single value if no amount is provided or an array of values, starting from the end if amount is negative\n\t /\n\tpublic first(): V \| undefined;\n\tpublic first(amount: number): V[];\n\tpublic first(amount?: number): V \| V[] \| undefined {\n\t\tif (typeof amount === 'undefined') return this.values().next().value;\n\t\tif (amount < 0) return this.last(amount -1);\n\t\tamount = Math.min(this.size, amount);\n\t\tconst iter = this.values();\n\t\treturn Array.from({ length: amount }, (): V => iter.next().value);\n\t}\n\n\t/*\n\t Obtains the first key(s) in this collection.\n\t \n\t @param amount - Amount of keys to obtain from the beginning\n\t * @returns A single key if no amount is provided or an array of keys, starting from the end if\n\t * amount is negative\n\t /\n\tpublic firstKey(): K \| undefined;\n\tpublic firstKey(amount: number): K[];\n\tpublic firstKey(amount?: number): K \| K[] \| undefined {\n\t\tif (typeof amount === 'undefined') return this.keys().next().value;\n\t\tif (amount < 0) return this.lastKey(amount -1);\n\t\tamount = Math.min(this.size, amount);\n\t\tconst iter = this.keys();\n\t\treturn Array.from({ length: amount }, (): K => iter.next().value);\n\t}\n\n\t/*\n\t Obtains the last value(s) in this collection.\n\t \n\t @param amount - Amount of values to obtain from the end\n\t * @returns A single value if no amount is provided or an array of values, starting from the start if\n\t * amount is negative\n\t /\n\tpublic last(): V \| undefined;\n\tpublic last(amount: number): V[];\n\tpublic last(amount?: number): V \| V[] \| undefined {\n\t\tconst arr = [...this.values()];\n\t\tif (typeof amount === 'undefined') return arr[arr.length - 1];\n\t\tif (amount < 0) return this.first(amount -1);\n\t\tif (!amount) return [];\n\t\treturn arr.slice(-amount);\n\t}\n\n\t/*\n\t Obtains the last key(s) in this collection.\n\t \n\t @param amount - Amount of keys to obtain from the end\n\t * @returns A single key if no amount is provided or an array of keys, starting from the start if\n\t * amount is negative\n\t /\n\tpublic lastKey(): K \| undefined;\n\tpublic lastKey(amount: number): K[];\n\tpublic lastKey(amount?: number): K \| K[] \| undefined {\n\t\tconst arr = [...this.keys()];\n\t\tif (typeof amount === 'undefined') return arr[arr.length - 1];\n\t\tif (amount < 0) return this.firstKey(amount -1);\n\t\tif (!amount) return [];\n\t\treturn arr.slice(-amount);\n\t}\n\n\t/*\n\t Identical to {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/at \| Array.at()}.\n\t * Returns the item at a given index, allowing for positive and negative integers.\n\t * Negative integers count back from the last item in the collection.\n\t \n\t @param index - The index of the element to obtain\n\t /\n\tpublic at(index: number) {\n\t\tindex = Math.floor(index);\n\t\tconst arr = [...this.values()];\n\t\treturn arr.at(index);\n\t}\n\n\t/\n\t Identical to {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/at \| Array.at()}.\n\t * Returns the key at a given index, allowing for positive and negative integers.\n\t * Negative integers count back from the last item in the collection.\n\t \n\t @param index - The index of the key to obtain\n\t /\n\tpublic keyAt(index: number) {\n\t\tindex = Math.floor(index);\n\t\tconst arr = [...this.keys()];\n\t\treturn arr.at(index);\n\t}\n\n\t/\n\t Obtains unique random value(s) from this collection.\n\t \n\t @param amount - Amount of values to obtain randomly\n\t * @returns A single value if no amount is provided or an array of values\n\t /\n\tpublic random(): V \| undefined;\n\tpublic random(amount: number): V[];\n\tpublic random(amount?: number): V \| V[] \| undefined {\n\t\tconst arr = [...this.values()];\n\t\tif (typeof amount === 'undefined') return arr[Math.floor(Math.random() arr.length)];\n\t\tif (!arr.length \|\| !amount) return [];\n\t\treturn Array.from(\n\t\t\t{ length: Math.min(amount, arr.length) },\n\t\t\t(): V => arr.splice(Math.floor(Math.random() * arr.length), 1)[0]!,\n\t\t);\n\t}\n\n\t/*\n\t Obtains unique random key(s) from this collection.\n\t \n\t @param amount - Amount of keys to obtain randomly\n\t * @returns A single key if no amount is provided or an array\n\t /\n\tpublic randomKey(): K \| undefined;\n\tpublic randomKey(amount: number): K[];\n\tpublic randomKey(amount?: number): K \| K[] \| undefined {\n\t\tconst arr = [...this.keys()];\n\t\tif (typeof amount === 'undefined') return arr[Math.floor(Math.random() arr.length)];\n\t\tif (!arr.length \|\| !amount) return [];\n\t\treturn Array.from(\n\t\t\t{ length: Math.min(amount, arr.length) },\n\t\t\t(): K => arr.splice(Math.floor(Math.random() * arr.length), 1)[0]!,\n\t\t);\n\t}\n\n\t/*\n\t Identical to {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/reverse \| Array.reverse()}\n\t * but returns a Collection instead of an Array.\n\t /\n\tpublic reverse() {\n\t\tconst entries = [...this.entries()].reverse();\n\t\tthis.clear();\n\t\tfor (const [key, value] of entries) this.set(key, value);\n\t\treturn this;\n\t}\n\n\t/\n\t Searches for a single item where the given function returns a truthy value. This behaves like\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/find \| Array.find()}.\n\t * All collections used in Discord.js are mapped using their `id` property, and if you want to find by id you\n\t * should use the `get` method. See\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map/get \| MDN} for details.\n\t \n\t @param fn - The function to test with (should return boolean)\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection.find(user => user.username === 'Bob');\n\t * ```\n\t /\n\tpublic find<V2 extends V>(fn: (value: V, key: K, collection: this) => value is V2): V2 \| undefined;\n\tpublic find(fn: (value: V, key: K, collection: this) => unknown): V \| undefined;\n\tpublic find<This, V2 extends V>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => value is V2,\n\t\tthisArg: This,\n\t): V2 \| undefined;\n\tpublic find<This>(fn: (this: This, value: V, key: K, collection: this) => unknown, thisArg: This): V \| undefined;\n\tpublic find(fn: (value: V, key: K, collection: this) => unknown, thisArg?: unknown): V \| undefined {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tfor (const [key, val] of this) {\n\t\t\tif (fn(val, key, this)) return val;\n\t\t}\n\n\t\treturn undefined;\n\t}\n\n\t/\n\t Searches for the key of a single item where the given function returns a truthy value. This behaves like\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/findIndex \| Array.findIndex()},\n\t * but returns the key rather than the positional index.\n\t \n\t @param fn - The function to test with (should return boolean)\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection.findKey(user => user.username === 'Bob');\n\t * ```\n\t /\n\tpublic findKey<K2 extends K>(fn: (value: V, key: K, collection: this) => key is K2): K2 \| undefined;\n\tpublic findKey(fn: (value: V, key: K, collection: this) => unknown): K \| undefined;\n\tpublic findKey<This, K2 extends K>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => key is K2,\n\t\tthisArg: This,\n\t): K2 \| undefined;\n\tpublic findKey<This>(fn: (this: This, value: V, key: K, collection: this) => unknown, thisArg: This): K \| undefined;\n\tpublic findKey(fn: (value: V, key: K, collection: this) => unknown, thisArg?: unknown): K \| undefined {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tfor (const [key, val] of this) {\n\t\t\tif (fn(val, key, this)) return key;\n\t\t}\n\n\t\treturn undefined;\n\t}\n\n\t/\n\t Removes items that satisfy the provided filter function.\n\t \n\t @param fn - Function used to test (should return a boolean)\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @returns The number of removed entries\n\t /\n\tpublic sweep(fn: (value: V, key: K, collection: this) => unknown): number;\n\tpublic sweep<T>(fn: (this: T, value: V, key: K, collection: this) => unknown, thisArg: T): number;\n\tpublic sweep(fn: (value: V, key: K, collection: this) => unknown, thisArg?: unknown): number {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tconst previousSize = this.size;\n\t\tfor (const [key, val] of this) {\n\t\t\tif (fn(val, key, this)) this.delete(key);\n\t\t}\n\n\t\treturn previousSize - this.size;\n\t}\n\n\t/\n\t Identical to\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/filter \| Array.filter()},\n\t * but returns a Collection instead of an Array.\n\t \n\t @param fn - The function to test with (should return boolean)\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection.filter(user => user.username === 'Bob');\n\t * ```\n\t /\n\tpublic filter<K2 extends K>(fn: (value: V, key: K, collection: this) => key is K2): Collection<K2, V>;\n\tpublic filter<V2 extends V>(fn: (value: V, key: K, collection: this) => value is V2): Collection<K, V2>;\n\tpublic filter(fn: (value: V, key: K, collection: this) => unknown): Collection<K, V>;\n\tpublic filter<This, K2 extends K>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => key is K2,\n\t\tthisArg: This,\n\t): Collection<K2, V>;\n\tpublic filter<This, V2 extends V>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => value is V2,\n\t\tthisArg: This,\n\t): Collection<K, V2>;\n\tpublic filter<This>(fn: (this: This, value: V, key: K, collection: this) => unknown, thisArg: This): Collection<K, V>;\n\tpublic filter(fn: (value: V, key: K, collection: this) => unknown, thisArg?: unknown): Collection<K, V> {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tconst results = new this.constructor[Symbol.species]<K, V>();\n\t\tfor (const [key, val] of this) {\n\t\t\tif (fn(val, key, this)) results.set(key, val);\n\t\t}\n\n\t\treturn results;\n\t}\n\n\t/\n\t Partitions the collection into two collections where the first collection\n\t * contains the items that passed and the second contains the items that failed.\n\t \n\t @param fn - Function used to test (should return a boolean)\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * const [big, small] = collection.partition(guild => guild.memberCount > 250);\n\t * ```\n\t /\n\tpublic partition<K2 extends K>(\n\t\tfn: (value: V, key: K, collection: this) => key is K2,\n\t): [Collection<K2, V>, Collection<Exclude<K, K2>, V>];\n\tpublic partition<V2 extends V>(\n\t\tfn: (value: V, key: K, collection: this) => value is V2,\n\t): [Collection<K, V2>, Collection<K, Exclude<V, V2>>];\n\tpublic partition(fn: (value: V, key: K, collection: this) => unknown): [Collection<K, V>, Collection<K, V>];\n\tpublic partition<This, K2 extends K>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => key is K2,\n\t\tthisArg: This,\n\t): [Collection<K2, V>, Collection<Exclude<K, K2>, V>];\n\tpublic partition<This, V2 extends V>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => value is V2,\n\t\tthisArg: This,\n\t): [Collection<K, V2>, Collection<K, Exclude<V, V2>>];\n\tpublic partition<This>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => unknown,\n\t\tthisArg: This,\n\t): [Collection<K, V>, Collection<K, V>];\n\tpublic partition(\n\t\tfn: (value: V, key: K, collection: this) => unknown,\n\t\tthisArg?: unknown,\n\t): [Collection<K, V>, Collection<K, V>] {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tconst results: [Collection<K, V>, Collection<K, V>] = [\n\t\t\tnew this.constructor[Symbol.species]<K, V>(),\n\t\t\tnew this.constructor[Symbol.species]<K, V>(),\n\t\t];\n\t\tfor (const [key, val] of this) {\n\t\t\tif (fn(val, key, this)) {\n\t\t\t\tresults[0].set(key, val);\n\t\t\t} else {\n\t\t\t\tresults[1].set(key, val);\n\t\t\t}\n\t\t}\n\n\t\treturn results;\n\t}\n\n\t/\n\t Maps each item into a Collection, then joins the results into a single Collection. Identical in behavior to\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/flatMap \| Array.flatMap()}.\n\t \n\t @param fn - Function that produces a new Collection\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection.flatMap(guild => guild.members.cache);\n\t * ```\n\t /\n\tpublic flatMap<T>(fn: (value: V, key: K, collection: this) => Collection<K, T>): Collection<K, T>;\n\tpublic flatMap<T, This>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => Collection<K, T>,\n\t\tthisArg: This,\n\t): Collection<K, T>;\n\tpublic flatMap<T>(fn: (value: V, key: K, collection: this) => Collection<K, T>, thisArg?: unknown): Collection<K, T> {\n\t\t// eslint-disable-next-line unicorn/no-array-method-this-argument\n\t\tconst collections = this.map(fn, thisArg);\n\t\treturn new this.constructor[Symbol.species]<K, T>().concat(...collections);\n\t}\n\n\t/\n\t Maps each item to another value into an array. Identical in behavior to\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/map \| Array.map()}.\n\t \n\t @param fn - Function that produces an element of the new array, taking three arguments\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection.map(user => user.tag);\n\t * ```\n\t /\n\tpublic map<T>(fn: (value: V, key: K, collection: this) => T): T[];\n\tpublic map<This, T>(fn: (this: This, value: V, key: K, collection: this) => T, thisArg: This): T[];\n\tpublic map<T>(fn: (value: V, key: K, collection: this) => T, thisArg?: unknown): T[] {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tconst iter = this.entries();\n\t\treturn Array.from({ length: this.size }, (): T => {\n\t\t\tconst [key, value] = iter.next().value;\n\t\t\treturn fn(value, key, this);\n\t\t});\n\t}\n\n\t/\n\t Maps each item to another value into a collection. Identical in behavior to\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/map \| Array.map()}.\n\t \n\t @param fn - Function that produces an element of the new collection, taking three arguments\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection.mapValues(user => user.tag);\n\t * ```\n\t /\n\tpublic mapValues<T>(fn: (value: V, key: K, collection: this) => T): Collection<K, T>;\n\tpublic mapValues<This, T>(fn: (this: This, value: V, key: K, collection: this) => T, thisArg: This): Collection<K, T>;\n\tpublic mapValues<T>(fn: (value: V, key: K, collection: this) => T, thisArg?: unknown): Collection<K, T> {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tconst coll = new this.constructor[Symbol.species]<K, T>();\n\t\tfor (const [key, val] of this) coll.set(key, fn(val, key, this));\n\t\treturn coll;\n\t}\n\n\t/\n\t Checks if there exists an item that passes a test. Identical in behavior to\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/some \| Array.some()}.\n\t \n\t @param fn - Function used to test (should return a boolean)\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection.some(user => user.discriminator === '0000');\n\t * ```\n\t /\n\tpublic some(fn: (value: V, key: K, collection: this) => unknown): boolean;\n\tpublic some<T>(fn: (this: T, value: V, key: K, collection: this) => unknown, thisArg: T): boolean;\n\tpublic some(fn: (value: V, key: K, collection: this) => unknown, thisArg?: unknown): boolean {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tfor (const [key, val] of this) {\n\t\t\tif (fn(val, key, this)) return true;\n\t\t}\n\n\t\treturn false;\n\t}\n\n\t/\n\t Checks if all items passes a test. Identical in behavior to\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/every \| Array.every()}.\n\t \n\t @param fn - Function used to test (should return a boolean)\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection.every(user => !user.bot);\n\t * ```\n\t /\n\tpublic every<K2 extends K>(fn: (value: V, key: K, collection: this) => key is K2): this is Collection<K2, V>;\n\tpublic every<V2 extends V>(fn: (value: V, key: K, collection: this) => value is V2): this is Collection<K, V2>;\n\tpublic every(fn: (value: V, key: K, collection: this) => unknown): boolean;\n\tpublic every<This, K2 extends K>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => key is K2,\n\t\tthisArg: This,\n\t): this is Collection<K2, V>;\n\tpublic every<This, V2 extends V>(\n\t\tfn: (this: This, value: V, key: K, collection: this) => value is V2,\n\t\tthisArg: This,\n\t): this is Collection<K, V2>;\n\tpublic every<This>(fn: (this: This, value: V, key: K, collection: this) => unknown, thisArg: This): boolean;\n\tpublic every(fn: (value: V, key: K, collection: this) => unknown, thisArg?: unknown): boolean {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tfor (const [key, val] of this) {\n\t\t\tif (!fn(val, key, this)) return false;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\t/\n\t Applies a function to produce a single value. Identical in behavior to\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/reduce \| Array.reduce()}.\n\t \n\t @param fn - Function used to reduce, taking four arguments; `accumulator`, `currentValue`, `currentKey`,\n\t * and `collection`\n\t * @param initialValue - Starting value for the accumulator\n\t * @example\n\t * ```ts\n\t * collection.reduce((acc, guild) => acc + guild.memberCount, 0);\n\t * ```\n\t /\n\tpublic reduce<T>(fn: (accumulator: T, value: V, key: K, collection: this) => T, initialValue?: T): T {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tlet accumulator!: T;\n\n\t\tif (typeof initialValue !== 'undefined') {\n\t\t\taccumulator = initialValue;\n\t\t\tfor (const [key, val] of this) accumulator = fn(accumulator, val, key, this);\n\t\t\treturn accumulator;\n\t\t}\n\n\t\tlet first = true;\n\t\tfor (const [key, val] of this) {\n\t\t\tif (first) {\n\t\t\t\taccumulator = val as unknown as T;\n\t\t\t\tfirst = false;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\taccumulator = fn(accumulator, val, key, this);\n\t\t}\n\n\t\t// No items iterated.\n\t\tif (first) {\n\t\t\tthrow new TypeError('Reduce of empty collection with no initial value');\n\t\t}\n\n\t\treturn accumulator;\n\t}\n\n\t/\n\t Identical to\n\t * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map/forEach \| Map.forEach()},\n\t * but returns the collection instead of undefined.\n\t \n\t @param fn - Function to execute for each element\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection\n\t * .each(user => console.log(user.username))\n\t * .filter(user => user.bot)\n\t * .each(user => console.log(user.username));\n\t * ```\n\t /\n\tpublic each(fn: (value: V, key: K, collection: this) => void): this;\n\tpublic each<T>(fn: (this: T, value: V, key: K, collection: this) => void, thisArg: T): this;\n\tpublic each(fn: (value: V, key: K, collection: this) => void, thisArg?: unknown): this {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\t// eslint-disable-next-line unicorn/no-array-method-this-argument\n\t\tthis.forEach(fn as (value: V, key: K, map: Map<K, V>) => void, thisArg);\n\t\treturn this;\n\t}\n\n\t/\n\t Runs a function on the collection and returns the collection.\n\t \n\t @param fn - Function to execute\n\t * @param thisArg - Value to use as `this` when executing function\n\t * @example\n\t * ```ts\n\t * collection\n\t * .tap(coll => console.log(coll.size))\n\t * .filter(user => user.bot)\n\t * .tap(coll => console.log(coll.size))\n\t * ```\n\t /\n\tpublic tap(fn: (collection: this) => void): this;\n\tpublic tap<T>(fn: (this: T, collection: this) => void, thisArg: T): this;\n\tpublic tap(fn: (collection: this) => void, thisArg?: unknown): this {\n\t\tif (typeof fn !== 'function') throw new TypeError(`${fn} is not a function`);\n\t\tif (typeof thisArg !== 'undefined') fn = fn.bind(thisArg);\n\t\tfn(this);\n\t\treturn this;\n\t}\n\n\t/\n\t Creates an identical shallow copy of this collection.\n\t \n\t @example\n\t * ```ts\n\t * const newColl = someColl.clone();\n\t * ```\n\t /\n\tpublic clone(): Collection<K, V> {\n\t\treturn new this.constructor[Symbol.species](this);\n\t}\n\n\t/\n\t Combines this collection with others into a new collection. None of the source collections are modified.\n\t \n\t @param collections - Collections to merge\n\t * @example\n\t * ```ts\n\t * const newColl = someColl.concat(someOtherColl, anotherColl, ohBoyAColl);\n\t * ```\n\t /\n\tpublic concat(...collections: ReadonlyCollection<K, V>[]) {\n\t\tconst newColl = this.clone();\n\t\tfor (const coll of collections) {\n\t\t\tfor (const [key, val] of coll) newColl.set(key, val);\n\t\t}\n\n\t\treturn newColl;\n\t}\n\n\t/\n\t Checks if this collection shares identical items with another.\n\t * This is different to checking for equality using equal-signs, because\n\t * the collections may be different objects, but contain the same data.\n\t \n\t @param collection - Collection to compare with\n\t * @returns Whether the collections have identical contents\n\t /\n\tpublic equals(collection: ReadonlyCollection<K, V>) {\n\t\tif (!collection) return false; // runtime check\n\t\tif (this === collection) return true;\n\t\tif (this.size !== collection.size) return false;\n\t\tfor (const [key, value] of this) {\n\t\t\tif (!collection.has(key) \|\| value !== collection.get(key)) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\treturn true;\n\t}\n\n\t/\n\t The sort method sorts the items of a collection in place and returns it.\n\t * The sort is not necessarily stable in Node 10 or older.\n\t * The default sort order is according to string Unicode code points.\n\t \n\t @param compareFunction - Specifies a function that defines the sort order.\n\t * If omitted, the collection is sorted according to each character's Unicode code point value, according to the string conversion of each element.\n\t * @example\n\t * ```ts\n\t * collection.sort((userA, userB) => userA.createdTimestamp - userB.createdTimestamp);\n\t * ```\n\t /\n\tpublic sort(compareFunction: Comparator<K, V> = Collection.defaultSort) {\n\t\tconst entries = [...this.entries()];\n\t\tentries.sort((a, b): number => compareFunction(a[1], b[1], a[0], b[0]));\n\n\t\t// Perform clean-up\n\t\tsuper.clear();\n\n\t\t// Set the new entries\n\t\tfor (const [k, v] of entries) {\n\t\t\tsuper.set(k, v);\n\t\t}\n\n\t\treturn this;\n\t}\n\n\t/\n\t The intersect method returns a new structure containing items where the keys and values are present in both original structures.\n\t \n\t @param other - The other Collection to filter against\n\t /\n\tpublic intersect<T>(other: ReadonlyCollection<K, T>): Collection<K, T> {\n\t\tconst coll = new this.constructor[Symbol.species]<K, T>();\n\t\tfor (const [k, v] of other) {\n\t\t\tif (this.has(k) && Object.is(v, this.get(k))) {\n\t\t\t\tcoll.set(k, v);\n\t\t\t}\n\t\t}\n\n\t\treturn coll;\n\t}\n\n\t/\n\t The subtract method returns a new structure containing items where the keys and values of the original structure are not present in the other.\n\t \n\t @param other - The other Collection to filter against\n\t /\n\tpublic subtract<T>(other: ReadonlyCollection<K, T>): Collection<K, V> {\n\t\tconst coll = new this.constructor[Symbol.species]<K, V>();\n\t\tfor (const [k, v] of this) {\n\t\t\tif (!other.has(k) \|\| !Object.is(v, other.get(k))) {\n\t\t\t\tcoll.set(k, v);\n\t\t\t}\n\t\t}\n\n\t\treturn coll;\n\t}\n\n\t/\n\t The difference method returns a new structure containing items where the key is present in one of the original structures but not the other.\n\t \n\t @param other - The other Collection to filter against\n\t /\n\tpublic difference<T>(other: ReadonlyCollection<K, T>): Collection<K, T \| V> {\n\t\tconst coll = new this.constructor[Symbol.species]<K, T \| V>();\n\t\tfor (const [k, v] of other) {\n\t\t\tif (!this.has(k)) coll.set(k, v);\n\t\t}\n\n\t\tfor (const [k, v] of this) {\n\t\t\tif (!other.has(k)) coll.set(k, v);\n\t\t}\n\n\t\treturn coll;\n\t}\n\n\t/\n\t Merges two Collections together into a new Collection.\n\t \n\t @param other - The other Collection to merge with\n\t * @param whenInSelf - Function getting the result if the entry only exists in this Collection\n\t * @param whenInOther - Function getting the result if the entry only exists in the other Collection\n\t * @param whenInBoth - Function getting the result if the entry exists in both Collections\n\t * @example\n\t * ```ts\n\t * // Sums up the entries in two collections.\n\t * coll.merge(\n\t * other,\n\t * x => ({ keep: true, value: x }),\n\t * y => ({ keep: true, value: y }),\n\t * (x, y) => ({ keep: true, value: x + y }),\n\t * );\n\t * ```\n\t * @example\n\t * ```ts\n\t * // Intersects two collections in a left-biased manner.\n\t * coll.merge(\n\t * other,\n\t * x => ({ keep: false }),\n\t * y => ({ keep: false }),\n\t * (x, _) => ({ keep: true, value: x }),\n\t * );\n\t * ```\n\t /\n\tpublic merge<T, R>(\n\t\tother: ReadonlyCollection<K, T>,\n\t\twhenInSelf: (value: V, key: K) => Keep<R>,\n\t\twhenInOther: (valueOther: T, key: K) => Keep<R>,\n\t\twhenInBoth: (value: V, valueOther: T, key: K) => Keep<R>,\n\t): Collection<K, R> {\n\t\tconst coll = new this.constructor[Symbol.species]<K, R>();\n\t\tconst keys = new Set([...this.keys(), ...other.keys()]);\n\t\tfor (const k of keys) {\n\t\t\tconst hasInSelf = this.has(k);\n\t\t\tconst hasInOther = other.has(k);\n\n\t\t\tif (hasInSelf && hasInOther) {\n\t\t\t\tconst r = whenInBoth(this.get(k)!, other.get(k)!, k);\n\t\t\t\tif (r.keep) coll.set(k, r.value);\n\t\t\t} else if (hasInSelf) {\n\t\t\t\tconst r = whenInSelf(this.get(k)!, k);\n\t\t\t\tif (r.keep) coll.set(k, r.value);\n\t\t\t} else if (hasInOther) {\n\t\t\t\tconst r = whenInOther(other.get(k)!, k);\n\t\t\t\tif (r.keep) coll.set(k, r.value);\n\t\t\t}\n\t\t}\n\n\t\treturn coll;\n\t}\n\n\t/\n\t The sorted method sorts the items of a collection and returns it.\n\t * The sort is not necessarily stable in Node 10 or older.\n\t * The default sort order is according to string Unicode code points.\n\t \n\t @param compareFunction - Specifies a function that defines the sort order.\n\t * If omitted, the collection is sorted according to each character's Unicode code point value,\n\t * according to the string conversion of each element.\n\t * @example\n\t * ```ts\n\t * collection.sorted((userA, userB) => userA.createdTimestamp - userB.createdTimestamp);\n\t * ```\n\t /\n\tpublic sorted(compareFunction: Comparator<K, V> = Collection.defaultSort) {\n\t\treturn new this.constructor[Symbol.species](this).sort((av, bv, ak, bk) => compareFunction(av, bv, ak, bk));\n\t}\n\n\tpublic toJSON() {\n\t\t// toJSON is called recursively by JSON.stringify.\n\t\treturn [...this.values()];\n\t}\n\n\tprivate static defaultSort<V>(firstValue: V, secondValue: V): number {\n\t\treturn Number(firstValue > secondValue) \|\| Number(firstValue === secondValue) - 1;\n\t}\n\n\t/\n\t Creates a Collection from a list of entries.\n\t \n\t @param entries - The list of entries\n\t * @param combine - Function to combine an existing entry with a new one\n\t * @example\n\t * ```ts\n\t * Collection.combineEntries([[\"a\", 1], [\"b\", 2], [\"a\", 2]], (x, y) => x + y);\n\t * // returns Collection { \"a\" => 3, \"b\" => 2 }\n\t * ```\n\t /\n\tpublic static combineEntries<K, V>(\n\t\tentries: Iterable<[K, V]>,\n\t\tcombine: (firstValue: V, secondValue: V, key: K) => V,\n\t): Collection<K, V> {\n\t\tconst coll = new Collection<K, V>();\n\t\tfor (const [k, v] of entries) {\n\t\t\tif (coll.has(k)) {\n\t\t\t\tcoll.set(k, combine(coll.get(k)!, v, k));\n\t\t\t} else {\n\t\t\t\tcoll.set(k, v);\n\t\t\t}\n\t\t}\n\n\t\treturn coll;\n\t}\n}\n\n/\n @internal\n /\nexport type Keep<V> = { keep: false } \| { keep: true; value: V };\n\n/\n @internal\n /\nexport type Comparator<K, V> = (firstValue: V, secondValue: V, firstKey: K, secondKey: K) => number;\n","export from './collection.js';\n\n/*\n The {@link https://github.com/discordjs/discord.js/blob/main/packages/collection/#readme \| @discordjs/collection} version\n * that you are currently using.\n */\n// This needs to explicitly be `string` so it is not typed as a \"const string\" that gets injected by esbuild\nexport const version = '[VI]{{inject}}[/VI]' as string;\n"],"mappings":";;;;AAsCO,IAAMA,aAAN,cAA+BC,IAAAA;;;;;;;;;;;EAW9BC,OAAOC,KAAQC,uBAA2D;AAChF,QAAI,KAAKC,IAAIF,GAAAA;AAAM,aAAO,KAAKG,IAAIH,GAAAA;AACnC,QAAI,OAAOC,0BAA0B;AAAY,YAAM,IAAIG,UAAU,GAAGH,yCAAyC;AACjH,UAAMI,eAAeJ,sBAAsBD,KAAK,IAAI;AACpD,SAAKM,IAAIN,KAAKK,YAAAA;AACd,WAAOA;EACR;;;;;;;EAQOE,UAAUC,MAAW;AAC3B,WAAOA,KAAKC,MAAM,CAACC,MAAM,MAAMR,IAAIQ,CAAAA,CAAAA;EACpC;;;;;;;EAQOC,UAAUH,MAAW;AAC3B,WAAOA,KAAKI,KAAK,CAACF,MAAM,MAAMR,IAAIQ,CAAAA,CAAAA;EACnC;EAUOG,MAAMC,QAAsC;AAClD,QAAI,OAAOA,WAAW;AAAa,aAAO,KAAKC,OAAM,EAAGC,KAAI,EAAGC;AAC/D,QAAIH,SAAS;AAAG,aAAO,KAAKI,KAAKJ,SAAS,EAAC;AAC3CA,aAASK,KAAKC,IAAI,KAAKC,MAAMP,MAAAA;AAC7B,UAAMQ,OAAO,KAAKP,OAAM;AACxB,WAAOQ,MAAMC,KAAK;MAAEC,QAAQX;IAAO,GAAG,MAASQ,KAAKN,KAAI,EAAGC,KAAK;EACjE;EAWOS,SAASZ,QAAsC;AACrD,QAAI,OAAOA,WAAW;AAAa,aAAO,KAAKN,KAAI,EAAGQ,KAAI,EAAGC;AAC7D,QAAIH,SAAS;AAAG,aAAO,KAAKa,QAAQb,SAAS,EAAC;AAC9CA,aAASK,KAAKC,IAAI,KAAKC,MAAMP,MAAAA;AAC7B,UAAMQ,OAAO,KAAKd,KAAI;AACtB,WAAOe,MAAMC,KAAK;MAAEC,QAAQX;IAAO,GAAG,MAASQ,KAAKN,KAAI,EAAGC,KAAK;EACjE;EAWOC,KAAKJ,QAAsC;AACjD,UAAMc,MAAM;SAAI,KAAKb,OAAM;;AAC3B,QAAI,OAAOD,WAAW;AAAa,aAAOc,IAAIA,IAAIH,SAAS,CAAA;AAC3D,QAAIX,SAAS;AAAG,aAAO,KAAKD,MAAMC,SAAS,EAAC;AAC5C,QAAI,CAACA;AAAQ,aAAO,CAAA;AACpB,WAAOc,IAAIC,MAAM,CAACf,MAAAA;EACnB;EAWOa,QAAQb,QAAsC;AACpD,UAAMc,MAAM;SAAI,KAAKpB,KAAI;;AACzB,QAAI,OAAOM,WAAW;AAAa,aAAOc,IAAIA,IAAIH,SAAS,CAAA;AAC3D,QAAIX,SAAS;AAAG,aAAO,KAAKY,SAASZ,SAAS,EAAC;AAC/C,QAAI,CAACA;AAAQ,aAAO,CAAA;AACpB,WAAOc,IAAIC,MAAM,CAACf,MAAAA;EACnB;;;;;;;;EASOgB,GAAGC,OAAe;AACxBA,YAAQZ,KAAKa,MAAMD,KAAAA;AACnB,UAAMH,MAAM;SAAI,KAAKb,OAAM;;AAC3B,WAAOa,IAAIE,GAAGC,KAAAA;EACf;;;;;;;;EASOE,MAAMF,OAAe;AAC3BA,YAAQZ,KAAKa,MAAMD,KAAAA;AACnB,UAAMH,MAAM;SAAI,KAAKpB,KAAI;;AACzB,WAAOoB,IAAIE,GAAGC,KAAAA;EACf;EAUOG,OAAOpB,QAAsC;AACnD,UAAMc,MAAM;SAAI,KAAKb,OAAM;;AAC3B,QAAI,OAAOD,WAAW;AAAa,aAAOc,IAAIT,KAAKa,MAAMb,KAAKe,OAAM,IAAKN,IAAIH,MAAM,CAAA;AACnF,QAAI,CAACG,IAAIH,UAAU,CAACX;AAAQ,aAAO,CAAA;AACnC,WAAOS,MAAMC,KACZ;MAAEC,QAAQN,KAAKC,IAAIN,QAAQc,IAAIH,MAAM;IAAE,GACvC,MAASG,IAAIO,OAAOhB,KAAKa,MAAMb,KAAKe,OAAM,IAAKN,IAAIH,MAAM,GAAG,CAAA,EAAG,CAAA,CAAE;EAEnE;EAUOW,UAAUtB,QAAsC;AACtD,UAAMc,MAAM;SAAI,KAAKpB,KAAI;;AACzB,QAAI,OAAOM,WAAW;AAAa,aAAOc,IAAIT,KAAKa,MAAMb,KAAKe,OAAM,IAAKN,IAAIH,MAAM,CAAA;AACnF,QAAI,CAACG,IAAIH,UAAU,CAACX;AAAQ,aAAO,CAAA;AACnC,WAAOS,MAAMC,KACZ;MAAEC,QAAQN,KAAKC,IAAIN,QAAQc,IAAIH,MAAM;IAAE,GACvC,MAASG,IAAIO,OAAOhB,KAAKa,MAAMb,KAAKe,OAAM,IAAKN,IAAIH,MAAM,GAAG,CAAA,EAAG,CAAA,CAAE;EAEnE;;;;;EAMOY,UAAU;AAChB,UAAMC,UAAU;SAAI,KAAKA,QAAO;MAAID,QAAO;AAC3C,SAAKE,MAAK;AACV,eAAW,CAACvC,KAAKiB,KAAAA,KAAUqB;AAAS,WAAKhC,IAAIN,KAAKiB,KAAAA;AAClD,WAAO;EACR;EAuBOuB,KAAKC,IAAqDC,SAAkC;AAClG,QAAI,OAAOD,OAAO;AAAY,YAAM,IAAIrC,UAAU,GAAGqC,sBAAsB;AAC3E,QAAI,OAAOC,YAAY;AAAaD,WAAKA,GAAGE,KAAKD,OAAAA;AACjD,eAAW,CAAC1C,KAAK4C,GAAAA,KAAQ,MAAM;AAC9B,UAAIH,GAAGG,KAAK5C,KAAK,IAAI;AAAG,eAAO4C;IAChC;AAEA,WAAOC;EACR;EAqBOC,QAAQL,IAAqDC,SAAkC;AACrG,QAAI,OAAOD,OAAO;AAAY,YAAM,IAAIrC,UAAU,GAAGqC,sBAAsB;AAC3E,QAAI,OAAOC,YAAY;AAAaD,WAAKA,GAAGE,KAAKD,OAAAA;AACjD,eAAW,CAAC1C,KAAK4C,GAAAA,KAAQ,MAAM;AAC9B,UAAIH,GAAGG,KAAK5C,KAAK,IAAI;AAAG,eAAOA;IAChC;AAEA,WAAO6C;EACR;EAWOE,MAAMN,IAAqDC,SAA2B;AAC5F,QAAI,OAAOD,OAAO;AAAY,YAAM,IAAIrC,UAAU,GAAGqC,sBAAsB;AAC3E,QAAI,OAAOC,YAAY;AAAaD,WAAKA,GAAGE,KAAKD,OAAAA;AACjD,UAAMM,eAAe,KAAK3B;AAC1B,eAAW,CAACrB,KAAK4C,GAAAA,KAAQ,MAAM;AAC9B,UAAIH,GAAGG,KAAK5C,KAAK,IAAI;AAAG,aAAKiD,OAAOjD,GAAAA;IACrC;AAEA,WAAOgD,eAAe,KAAK3B;EAC5B;EA0BO6B,OAAOT,IAAqDC,SAAqC;AACvG,QAAI,OAAOD,OAAO;AAAY,YAAM,IAAIrC,UAAU,GAAGqC,sBAAsB;AAC3E,QAAI,OAAOC,YAAY;AAAaD,WAAKA,GAAGE,KAAKD,OAAAA;AACjD,UAAMS,UAAU,IAAI,KAAKC,YAAYC,OAAOC,OAAO,EAAC;AACpD,eAAW,CAACtD,KAAK4C,GAAAA,KAAQ,MAAM;AAC9B,UAAIH,GAAGG,KAAK5C,KAAK,IAAI;AAAGmD,gBAAQ7C,IAAIN,KAAK4C,GAAAA;IAC1C;AAEA,WAAOO;EACR;EAgCOI,UACNd,IACAC,SACuC;AACvC,QAAI,OAAOD,OAAO;AAAY,YAAM,IAAIrC,UAAU,GAAGqC,sBAAsB;AAC3E,QAAI,OAAOC,YAAY;AAAaD,WAAKA,GAAGE,KAAKD,OAAAA;AACjD,UAAMS,UAAgD;MACrD,IAAI,KAAKC,YAAYC,OAAOC,OAAO,EAAC;MACpC,IAAI,KAAKF,YAAYC,OAAOC,OAAO,EAAC;;AAErC,eAAW,CAACtD,KAAK4C,GAAAA,KAAQ,MAAM;AAC9B,UAAIH,GAAGG,KAAK5C,KAAK,IAAI,GAAG;AACvBmD,gBAAQ,CAAA,EAAG7C,IAAIN,KAAK4C,GAAAA;MACrB,OAAO;AACNO,gBAAQ,CAAA,EAAG7C,IAAIN,KAAK4C,GAAAA;MACrB;IACD;AAEA,WAAOO;EACR;EAkBOK,QAAWf,IAA8DC,SAAqC;AAEpH,UAAMe,cAAc,KAAKC,IAAIjB,IAAIC,OAAAA;AACjC,WAAO,IAAI,KAAKU,YAAYC,OAAOC,OAAO,EAAC,EAASK,OAAM,GAAIF,WAAAA;EAC/D;EAeOC,IAAOjB,IAA+CC,SAAwB;AACpF,QAAI,OAAOD,OAAO;AAAY,YAAM,IAAIrC,UAAU,GAAGqC,sBAAsB;AAC3E,QAAI,OAAOC,YAAY;AAAaD,WAAKA,GAAGE,KAAKD,OAAAA;AACjD,UAAMpB,OAAO,KAAKgB,QAAO;AACzB,WAAOf,MAAMC,KAAK;MAAEC,QAAQ,KAAKJ;IAAK,GAAG,MAAS;AACjD,YAAM,CAACrB,KAAKiB,KAAAA,IAASK,KAAKN,KAAI,EAAGC;AACjC,aAAOwB,GAAGxB,OAAOjB,KAAK,IAAI;IAC3B,CAAA;EACD;EAeO4D,UAAanB,IAA+CC,SAAqC;AACvG,QAAI,OAAOD,OAAO;AAAY,YAAM,IAAIrC,UAAU,GAAGqC,sBAAsB;AAC3E,QAAI,OAAOC,YAAY;AAAaD,WAAKA,GAAGE,KAAKD,OAAAA;AACjD,UAAMmB,OAAO,IAAI,KAAKT,YAAYC,OAAOC,OAAO,EAAC;AACjD,eAAW,CAACtD,KAAK4C,GAAAA,KAAQ;AAAMiB,WAAKvD,IAAIN,KAAKyC,GAAGG,KAAK5C,KAAK,IAAI,CAAA;AAC9D,WAAO6D;EACR;EAeOjD,KAAK6B,IAAqDC,SAA4B;AAC5F,QAAI,OAAOD,OAAO;AAAY,YAAM,IAAIrC,UAAU,GAAGqC,sBAAsB;AAC3E,QAAI,OAAOC,YAAY;AAAaD,WAAKA,GAAGE,KAAKD,OAAAA;AACjD,eAAW,CAAC1C,KAAK4C,GAAAA,KAAQ,MAAM;AAC9B,UAAIH,GAAGG,KAAK5C,KAAK,IAAI;AAAG,eAAO;IAChC;AAEA,WAAO;EACR;EAyBOS,MAAMgC,IAAqDC,SAA4B;AAC7F,QAAI,OAAOD,OAAO;AAAY,YAAM,IAAIrC,UAAU,GAAGqC,sBAAsB;AAC3E,QAAI,OAAOC,YAAY;AAAaD,WAAKA,GAAGE,KAAKD,OAAAA;AACjD,eAAW,CAAC1C,KAAK4C,GAAAA,KAAQ,MAAM;AAC9B,UAAI,CAACH,GAAGG,KAAK5C,KAAK,IAAI;AAAG,eAAO;IACjC;AAEA,WAAO;EACR;;;;;;;;;;;;;EAcO8D,OAAUrB,IAA+DsB,cAAqB;AACpG,QAAI,OAAOtB,OAAO;AAAY,YAAM,IAAIrC,UAAU,GAAGqC,sBAAsB;AAC3E,QAAIuB;AAEJ,QAAI,OAAOD,iBAAiB,aAAa;AACxCC,oBAAcD;AACd,iBAAW,CAAC/D,KAAK4C,GAAAA,KAAQ;AAAMoB,sBAAcvB,GAAGuB,aAAapB,KAAK5C,KAAK,IAAI;AAC3E,aAAOgE;IACR;AAEA,QAAInD,QAAQ;AACZ,eAAW,CAACb,KAAK4C,GAAAA,KAAQ,MAAM;AAC9B,UAAI/B,OAAO;AACVmD,sBAAcpB;AACd/B,gBAAQ;AACR;MACD;AAEAmD,oBAAcvB,GAAGuB,aAAapB,KAAK5C,KAAK,IAAI;IAC7C;AAGA,QAAIa,OAAO;AACV,YAAM,IAAIT,UAAU,kDAAA;IACrB;AAEA,WAAO4D;EACR;EAmBOC,KAAKxB,IAAkDC,SAAyB;AACtF,QAAI,OAAOD,OAAO;AAAY,YAAM,IAAIrC,UAAU,GAAGqC,sBAAsB;AAE3E,SAAKyB,QAAQzB,IAAkDC,OAAAA;AAC/D,WAAO;EACR;EAiBOyB,IAAI1B,IAAgCC,SAAyB;AACnE,QAAI,OAAOD,OAAO;AAAY,YAAM,IAAIrC,UAAU,GAAGqC,sBAAsB;AAC3E,QAAI,OAAOC,YAAY;AAAaD,WAAKA,GAAGE,KAAKD,OAAAA;AACjDD,OAAG,IAAI;AACP,WAAO;EACR;;;;;;;;;EAUO2B,QAA0B;AAChC,WAAO,IAAI,KAAKhB,YAAYC,OAAOC,OAAO,EAAE,IAAI;EACjD;;;;;;;;;;EAWOK,UAAUF,aAAyC;AACzD,UAAMY,UAAU,KAAKD,MAAK;AAC1B,eAAWP,QAAQJ,aAAa;AAC/B,iBAAW,CAACzD,KAAK4C,GAAAA,KAAQiB;AAAMQ,gBAAQ/D,IAAIN,KAAK4C,GAAAA;IACjD;AAEA,WAAOyB;EACR;;;;;;;;;EAUOC,OAAOC,YAAsC;AACnD,QAAI,CAACA;AAAY,aAAO;AACxB,QAAI,SAASA;AAAY,aAAO;AAChC,QAAI,KAAKlD,SAASkD,WAAWlD;AAAM,aAAO;AAC1C,eAAW,CAACrB,KAAKiB,KAAAA,KAAU,MAAM;AAChC,UAAI,CAACsD,WAAWrE,IAAIF,GAAAA,KAAQiB,UAAUsD,WAAWpE,IAAIH,GAAAA,GAAM;AAC1D,eAAO;MACR;IACD;AAEA,WAAO;EACR;;;;;;;;;;;;;EAcOwE,KAAKC,kBAAoC5E,WAAW6E,aAAa;AACvE,UAAMpC,UAAU;SAAI,KAAKA,QAAO;;AAChCA,YAAQkC,KAAK,CAACG,GAAGC,MAAcH,gBAAgBE,EAAE,CAAA,GAAIC,EAAE,CAAA,GAAID,EAAE,CAAA,GAAIC,EAAE,CAAA,CAAE,CAAA;AAGrE,UAAMrC,MAAK;AAGX,eAAW,CAAC7B,GAAGmE,CAAAA,KAAMvC,SAAS;AAC7B,YAAMhC,IAAII,GAAGmE,CAAAA;IACd;AAEA,WAAO;EACR;;;;;;EAOOC,UAAaC,OAAmD;AACtE,UAAMlB,OAAO,IAAI,KAAKT,YAAYC,OAAOC,OAAO,EAAC;AACjD,eAAW,CAAC5C,GAAGmE,CAAAA,KAAME,OAAO;AAC3B,UAAI,KAAK7E,IAAIQ,CAAAA,KAAMsE,OAAOC,GAAGJ,GAAG,KAAK1E,IAAIO,CAAAA,CAAAA,GAAK;AAC7CmD,aAAKvD,IAAII,GAAGmE,CAAAA;MACb;IACD;AAEA,WAAOhB;EACR;;;;;;EAOOqB,SAAYH,OAAmD;AACrE,UAAMlB,OAAO,IAAI,KAAKT,YAAYC,OAAOC,OAAO,EAAC;AACjD,eAAW,CAAC5C,GAAGmE,CAAAA,KAAM,MAAM;AAC1B,UAAI,CAACE,MAAM7E,IAAIQ,CAAAA,KAAM,CAACsE,OAAOC,GAAGJ,GAAGE,MAAM5E,IAAIO,CAAAA,CAAAA,GAAK;AACjDmD,aAAKvD,IAAII,GAAGmE,CAAAA;MACb;IACD;AAEA,WAAOhB;EACR;;;;;;EAOOsB,WAAcJ,OAAuD;AAC3E,UAAMlB,OAAO,IAAI,KAAKT,YAAYC,OAAOC,OAAO,EAAC;AACjD,eAAW,CAAC5C,GAAGmE,CAAAA,KAAME,OAAO;AAC3B,UAAI,CAAC,KAAK7E,IAAIQ,CAAAA;AAAImD,aAAKvD,IAAII,GAAGmE,CAAAA;IAC/B;AAEA,eAAW,CAACnE,GAAGmE,CAAAA,KAAM,MAAM;AAC1B,UAAI,CAACE,MAAM7E,IAAIQ,CAAAA;AAAImD,aAAKvD,IAAII,GAAGmE,CAAAA;IAChC;AAEA,WAAOhB;EACR;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EA8BOuB,MACNL,OACAM,YACAC,aACAC,YACmB;AACnB,UAAM1B,OAAO,IAAI,KAAKT,YAAYC,OAAOC,OAAO,EAAC;AACjD,UAAM9C,OAAO,oBAAIgF,IAAI;SAAI,KAAKhF,KAAI;SAAOuE,MAAMvE,KAAI;KAAG;AACtD,eAAWE,KAAKF,MAAM;AACrB,YAAMiF,YAAY,KAAKvF,IAAIQ,CAAAA;AAC3B,YAAMgF,aAAaX,MAAM7E,IAAIQ,CAAAA;AAE7B,UAAI+E,aAAaC,YAAY;AAC5B,cAAMC,IAAIJ,WAAW,KAAKpF,IAAIO,CAAAA,GAAKqE,MAAM5E,IAAIO,CAAAA,GAAKA,CAAAA;AAClD,YAAIiF,EAAEC;AAAM/B,eAAKvD,IAAII,GAAGiF,EAAE1E,KAAK;MAChC,WAAWwE,WAAW;AACrB,cAAME,IAAIN,WAAW,KAAKlF,IAAIO,CAAAA,GAAKA,CAAAA;AACnC,YAAIiF,EAAEC;AAAM/B,eAAKvD,IAAII,GAAGiF,EAAE1E,KAAK;MAChC,WAAWyE,YAAY;AACtB,cAAMC,IAAIL,YAAYP,MAAM5E,IAAIO,CAAAA,GAAKA,CAAAA;AACrC,YAAIiF,EAAEC;AAAM/B,eAAKvD,IAAII,GAAGiF,EAAE1E,KAAK;MAChC;IACD;AAEA,WAAO4C;EACR;;;;;;;;;;;;;;EAeOgC,OAAOpB,kBAAoC5E,WAAW6E,aAAa;AACzE,WAAO,IAAI,KAAKtB,YAAYC,OAAOC,OAAO,EAAE,IAAI,EAAEkB,KAAK,CAACsB,IAAIC,IAAIC,IAAIC,OAAOxB,gBAAgBqB,IAAIC,IAAIC,IAAIC,EAAAA,CAAAA;EACxG;EAEOC,SAAS;AAEf,WAAO;SAAI,KAAKnF,OAAM;;EACvB;EAEA,OAAe2D,YAAeyB,YAAeC,aAAwB;AACpE,WAAOC,OAAOF,aAAaC,WAAAA,KAAgBC,OAAOF,eAAeC,WAAAA,IAAe;EACjF;;;;;;;;;;;;EAaA,OAAcE,eACbhE,SACAiE,SACmB;AACnB,UAAM1C,OAAO,IAAIhE,WAAAA;AACjB,eAAW,CAACa,GAAGmE,CAAAA,KAAMvC,SAAS;AAC7B,UAAIuB,KAAK3D,IAAIQ,CAAAA,GAAI;AAChBmD,aAAKvD,IAAII,GAAG6F,QAAQ1C,KAAK1D,IAAIO,CAAAA,GAAKmE,GAAGnE,CAAAA,CAAAA;MACtC,OAAO;AACNmD,aAAKvD,IAAII,GAAGmE,CAAAA;MACb;IACD;AAEA,WAAOhB;EACR;AACD;AArxBahE;;;AC/BN,IAAM2G,UAAU;","names":["Collection","Map","ensure","key","defaultValueGenerator","has","get","TypeError","defaultValue","set","hasAll","keys","every","k","hasAny","some","first","amount","values","next","value","last","Math","min","size","iter","Array","from","length","firstKey","lastKey","arr","slice","at","index","floor","keyAt","random","splice","randomKey","reverse","entries","clear","find","fn","thisArg","bind","val","undefined","findKey","sweep","previousSize","delete","filter","results","constructor","Symbol","species","partition","flatMap","collections","map","concat","mapValues","coll","reduce","initialValue","accumulator","each","forEach","tap","clone","newColl","equals","collection","sort","compareFunction","defaultSort","a","b","v","intersect","other","Object","is","subtract","difference","merge","whenInSelf","whenInOther","whenInBoth","Set","hasInSelf","hasInOther","r","keep","sorted","av","bv","ak","bk","toJSON","firstValue","secondValue","Number","combineEntries","combine","version"]}

package/package.json CHANGED Viewed

@@ -1,6 +1,6 @@
 {
   "name": "@discordjs/collection",
-  "version": "1.3.1-dev.1677326645-4e0e125.0",
+  "version": "1.3.1-dev.1677629527-dc142c4.0",
   "description": "Utility data structure used in discord.js",
   "scripts": {
     "test": "vitest run",
@@ -52,18 +52,18 @@
   "homepage": "https://discord.js.org",
   "devDependencies": {
     "@favware/cliff-jumper": "^1.10.0",
-    "@microsoft/api-extractor": "^7.33.7",
-    "@types/node": "16.18.11",
-    "@vitest/coverage-c8": "^0.27.1",
+    "@microsoft/api-extractor": "^7.34.4",
+    "@types/node": "16.18.13",
+    "@vitest/coverage-c8": "^0.29.1",
     "cross-env": "^7.0.3",
-    "esbuild-plugin-version-injector": "^1.0.2",
-    "eslint": "^8.31.0",
+    "esbuild-plugin-version-injector": "^1.0.3",
+    "eslint": "^8.35.0",
     "eslint-config-neon": "^0.1.40",
     "eslint-formatter-pretty": "^4.1.0",
-    "prettier": "^2.8.2",
-    "tsup": "^6.5.0",
-    "typescript": "^4.9.4",
-    "vitest": "^0.27.1"
+    "prettier": "^2.8.4",
+    "tsup": "^6.6.3",
+    "typescript": "^4.9.5",
+    "vitest": "^0.29.1"
   },
   "engines": {
     "node": ">=16.9.0"