Modules

node_modules/@discordjs/collection/LICENSE

@@ -0,0 +1,190 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   Copyright 2015 - 2019 Amish Shah
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

node_modules/@discordjs/collection/README.md

@@ -0,0 +1,3 @@
+# Collection
+
+Utility data structure used in Discord.js.

node_modules/@discordjs/collection/dist/index.d.ts

@@ -0,0 +1,317 @@
+export interface CollectionConstructor {
+    new (): Collection<unknown, unknown>;
+    new <K, V>(entries?: ReadonlyArray<readonly [K, V]> | null): Collection<K, V>;
+    new <K, V>(iterable: Iterable<readonly [K, V]>): Collection<K, V>;
+    readonly prototype: Collection<unknown, unknown>;
+    readonly [Symbol.species]: CollectionConstructor;
+}
+/**
+ * A Map with additional utility methods. This is used throughout discord.js rather than Arrays for anything that has
+ * an ID, for significantly improved performance and ease-of-use.
+ * @extends {Map}
+ * @property {number} size - The amount of elements in this collection.
+ */
+declare class Collection<K, V> extends Map<K, V> {
+    private _array;
+    private _keyArray;
+    static readonly default: typeof Collection;
+    ['constructor']: typeof Collection;
+    constructor(entries?: ReadonlyArray<readonly [K, V]> | null);
+    /**
+     * Identical to [Map.get()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map/get).
+     * Gets an element with the specified key, and returns its value, or `undefined` if the element does not exist.
+     * @param {*} key - The key to get from this collection
+     * @returns {* | undefined}
+     */
+    get(key: K): V | undefined;
+    /**
+     * Identical to [Map.set()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map/set).
+     * Sets a new element in the collection with the specified key and value.
+     * @param {*} key - The key of the element to add
+     * @param {*} value - The value of the element to add
+     * @returns {Collection}
+     */
+    set(key: K, value: V): this;
+    /**
+     * Identical to [Map.has()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map/has).
+     * Checks if an element exists in the collection.
+     * @param {*} key - The key of the element to check for
+     * @returns {boolean} `true` if the element exists, `false` if it does not exist.
+     */
+    has(key: K): boolean;
+    /**
+     * Identical to [Map.delete()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map/delete).
+     * Deletes an element from the collection.
+     * @param {*} key - The key to delete from the collection
+     * @returns {boolean} `true` if the element was removed, `false` if the element does not exist.
+     */
+    delete(key: K): boolean;
+    /**
+     * Identical to [Map.clear()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map/clear).
+     * Removes all elements from the collection.
+     * @returns {undefined}
+     */
+    clear(): void;
+    /**
+     * Creates an ordered array of the values of this collection, and caches it internally. The array will only be
+     * reconstructed if an item is added to or removed from the collection, or if you change the length of the array
+     * itself. If you don't want this caching behavior, use `[...collection.values()]` or
+     * `Array.from(collection.values())` instead.
+     * @returns {Array}
+     */
+    array(): V[];
+    /**
+     * Creates an ordered array of the keys of this collection, and caches it internally. The array will only be
+     * reconstructed if an item is added to or removed from the collection, or if you change the length of the array
+     * itself. If you don't want this caching behavior, use `[...collection.keys()]` or
+     * `Array.from(collection.keys())` instead.
+     * @returns {Array}
+     */
+    keyArray(): K[];
+    /**
+     * Obtains the first value(s) in this collection.
+     * @param {number} [amount] Amount of values to obtain from the beginning
+     * @returns {*|Array<*>} A single value if no amount is provided or an array of values, starting from the end if
+     * amount is negative
+     */
+    first(): V | undefined;
+    first(amount: number): V[];
+    /**
+     * Obtains the first key(s) in this collection.
+     * @param {number} [amount] Amount of keys to obtain from the beginning
+     * @returns {*|Array<*>} A single key if no amount is provided or an array of keys, starting from the end if
+     * amount is negative
+     */
+    firstKey(): K | undefined;
+    firstKey(amount: number): K[];
+    /**
+     * Obtains the last value(s) in this collection. This relies on {@link Collection#array}, and thus the caching
+     * mechanism applies here as well.
+     * @param {number} [amount] Amount of values to obtain from the end
+     * @returns {*|Array<*>} A single value if no amount is provided or an array of values, starting from the start if
+     * amount is negative
+     */
+    last(): V | undefined;
+    last(amount: number): V[];
+    /**
+     * Obtains the last key(s) in this collection. This relies on {@link Collection#keyArray}, and thus the caching
+     * mechanism applies here as well.
+     * @param {number} [amount] Amount of keys to obtain from the end
+     * @returns {*|Array<*>} A single key if no amount is provided or an array of keys, starting from the start if
+     * amount is negative
+     */
+    lastKey(): K | undefined;
+    lastKey(amount: number): K[];
+    /**
+     * Obtains unique random value(s) from this collection. This relies on {@link Collection#array}, and thus the caching
+     * mechanism applies here as well.
+     * @param {number} [amount] Amount of values to obtain randomly
+     * @returns {*|Array<*>} A single value if no amount is provided or an array of values
+     */
+    random(): V;
+    random(amount: number): V[];
+    /**
+     * Obtains unique random key(s) from this collection. This relies on {@link Collection#keyArray}, and thus the caching
+     * mechanism applies here as well.
+     * @param {number} [amount] Amount of keys to obtain randomly
+     * @returns {*|Array<*>} A single key if no amount is provided or an array
+     */
+    randomKey(): K;
+    randomKey(amount: number): K[];
+    /**
+     * Searches for a single item where the given function returns a truthy value. This behaves like
+     * [Array.find()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/find).
+     * <warn>All collections used in Discord.js are mapped using their `id` property, and if you want to find by id you
+     * should use the `get` method. See
+     * [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map/get) for details.</warn>
+     * @param {Function} fn The function to test with (should return boolean)
+     * @param {*} [thisArg] Value to use as `this` when executing function
+     * @returns {*}
+     * @example collection.find(user => user.username === 'Bob');
+     */
+    find(fn: (value: V, key: K, collection: this) => boolean): V | undefined;
+    find<T>(fn: (this: T, value: V, key: K, collection: this) => boolean, thisArg: T): V | undefined;
+    /**
+     * Searches for the key of a single item where the given function returns a truthy value. This behaves like
+     * [Array.findIndex()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/findIndex),
+     * but returns the key rather than the positional index.
+     * @param {Function} fn The function to test with (should return boolean)
+     * @param {*} [thisArg] Value to use as `this` when executing function
+     * @returns {*}
+     * @example collection.findKey(user => user.username === 'Bob');
+     */
+    findKey(fn: (value: V, key: K, collection: this) => boolean): K | undefined;
+    findKey<T>(fn: (this: T, value: V, key: K, collection: this) => boolean, thisArg: T): K | undefined;
+    /**
+     * Removes items that satisfy the provided filter function.
+     * @param {Function} fn Function used to test (should return a boolean)
+     * @param {*} [thisArg] Value to use as `this` when executing function
+     * @returns {number} The number of removed entries
+     */
+    sweep(fn: (value: V, key: K, collection: this) => boolean): number;
+    sweep<T>(fn: (this: T, value: V, key: K, collection: this) => boolean, thisArg: T): number;
+    /**
+     * Identical to
+     * [Array.filter()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/filter),
+     * but returns a Collection instead of an Array.
+     * @param {Function} fn The function to test with (should return boolean)
+     * @param {*} [thisArg] Value to use as `this` when executing function
+     * @returns {Collection}
+     * @example collection.filter(user => user.username === 'Bob');
+     */
+    filter(fn: (value: V, key: K, collection: this) => boolean): this;
+    filter<T>(fn: (this: T, value: V, key: K, collection: this) => boolean, thisArg: T): this;
+    /**
+     * Partitions the collection into two collections where the first collection
+     * contains the items that passed and the second contains the items that failed.
+     * @param {Function} fn Function used to test (should return a boolean)
+     * @param {*} [thisArg] Value to use as `this` when executing function
+     * @returns {Collection[]}
+     * @example const [big, small] = collection.partition(guild => guild.memberCount > 250);
+     */
+    partition(fn: (value: V, key: K, collection: this) => boolean): [this, this];
+    partition<T>(fn: (this: T, value: V, key: K, collection: this) => boolean, thisArg: T): [this, this];
+    /**
+     * Maps each item into a Collection, then joins the results into a single Collection. Identical in behavior to
+     * [Array.flatMap()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/flatMap).
+     * @param {Function} fn Function that produces a new Collection
+     * @param {*} [thisArg] Value to use as `this` when executing function
+     * @returns {Collection}
+     * @example collection.flatMap(guild => guild.members);
+     */
+    flatMap<T>(fn: (value: V, key: K, collection: this) => Collection<K, T>): Collection<K, T>;
+    flatMap<T, This>(fn: (this: This, value: V, key: K, collection: this) => Collection<K, T>, thisArg: This): Collection<K, T>;
+    /**
+     * Maps each item to another value into an array. Identical in behavior to
+     * [Array.map()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/map).
+     * @param {Function} fn Function that produces an element of the new array, taking three arguments
+     * @param {*} [thisArg] Value to use as `this` when executing function
+     * @returns {Array}
+     * @example collection.map(user => user.tag);
+     */
+    map<T>(fn: (value: V, key: K, collection: this) => T): T[];
+    map<This, T>(fn: (this: This, value: V, key: K, collection: this) => T, thisArg: This): T[];
+    /**
+     * Maps each item to another value into a collection. Identical in behavior to
+     * [Array.map()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/map).
+     * @param {Function} fn Function that produces an element of the new collection, taking three arguments
+     * @param {*} [thisArg] Value to use as `this` when executing function
+     * @returns {Collection}
+     * @example collection.mapValues(user => user.tag);
+     */
+    mapValues<T>(fn: (value: V, key: K, collection: this) => T): Collection<K, T>;
+    mapValues<This, T>(fn: (this: This, value: V, key: K, collection: this) => T, thisArg: This): Collection<K, T>;
+    /**
+     * Checks if there exists an item that passes a test. Identical in behavior to
+     * [Array.some()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/some).
+     * @param {Function} fn Function used to test (should return a boolean)
+     * @param {*} [thisArg] Value to use as `this` when executing function
+     * @returns {boolean}
+     * @example collection.some(user => user.discriminator === '0000');
+     */
+    some(fn: (value: V, key: K, collection: this) => boolean): boolean;
+    some<T>(fn: (this: T, value: V, key: K, collection: this) => boolean, thisArg: T): boolean;
+    /**
+     * Checks if all items passes a test. Identical in behavior to
+     * [Array.every()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/every).
+     * @param {Function} fn Function used to test (should return a boolean)
+     * @param {*} [thisArg] Value to use as `this` when executing function
+     * @returns {boolean}
+     * @example collection.every(user => !user.bot);
+     */
+    every(fn: (value: V, key: K, collection: this) => boolean): boolean;
+    every<T>(fn: (this: T, value: V, key: K, collection: this) => boolean, thisArg: T): boolean;
+    /**
+     * Applies a function to produce a single value. Identical in behavior to
+     * [Array.reduce()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/reduce).
+     * @param {Function} fn Function used to reduce, taking four arguments; `accumulator`, `currentValue`, `currentKey`,
+     * and `collection`
+     * @param {*} [initialValue] Starting value for the accumulator
+     * @returns {*}
+     * @example collection.reduce((acc, guild) => acc + guild.memberCount, 0);
+     */
+    reduce<T>(fn: (accumulator: T, value: V, key: K, collection: this) => T, initialValue?: T): T;
+    /**
+     * Identical to
+     * [Map.forEach()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map/forEach),
+     * but returns the collection instead of undefined.
+     * @param {Function} fn Function to execute for each element
+     * @param {*} [thisArg] Value to use as `this` when executing function
+     * @returns {Collection}
+     * @example
+     * collection
+     *  .each(user => console.log(user.username))
+     *  .filter(user => user.bot)
+     *  .each(user => console.log(user.username));
+     */
+    each(fn: (value: V, key: K, collection: this) => void): this;
+    each<T>(fn: (this: T, value: V, key: K, collection: this) => void, thisArg: T): this;
+    /**
+     * Runs a function on the collection and returns the collection.
+     * @param {Function} fn Function to execute
+     * @param {*} [thisArg] Value to use as `this` when executing function
+     * @returns {Collection}
+     * @example
+     * collection
+     *  .tap(coll => console.log(coll.size))
+     *  .filter(user => user.bot)
+     *  .tap(coll => console.log(coll.size))
+     */
+    tap(fn: (collection: this) => void): this;
+    tap<T>(fn: (this: T, collection: this) => void, thisArg: T): this;
+    /**
+     * Creates an identical shallow copy of this collection.
+     * @returns {Collection}
+     * @example const newColl = someColl.clone();
+     */
+    clone(): this;
+    /**
+     * Combines this collection with others into a new collection. None of the source collections are modified.
+     * @param {...Collection} collections Collections to merge
+     * @returns {Collection}
+     * @example const newColl = someColl.concat(someOtherColl, anotherColl, ohBoyAColl);
+     */
+    concat(...collections: Collection<K, V>[]): this;
+    /**
+     * 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 Collection to compare with
+     * @returns {boolean} Whether the collections have identical contents
+     */
+    equals(collection: Collection<K, V>): boolean;
+    /**
+     * The sort method sorts the items of a collection in place and returns it.
+     * The sort is not necessarily stable. The default sort order is according to string Unicode code points.
+     * @param {Function} [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.
+     * @returns {Collection}
+     * @example collection.sort((userA, userB) => userA.createdTimestamp - userB.createdTimestamp);
+     */
+    sort(compareFunction?: (firstValue: V, secondValue: V, firstKey: K, secondKey: K) => number): this;
+    /**
+     * The intersect method returns a new structure containing items where the keys are present in both original structures.
+     * @param {Collection} other The other Collection to filter against
+     * @returns {Collection}
+     */
+    intersect(other: Collection<K, V>): Collection<K, V>;
+    /**
+     * 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 {Collection} other The other Collection to filter against
+     * @returns {Collection}
+     */
+    difference(other: Collection<K, V>): Collection<K, V>;
+    /**
+     * The sorted method sorts the items of a collection and returns it.
+     * The sort is not necessarily stable. The default sort order is according to string Unicode code points.
+     * @param {Function} [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.
+     * @returns {Collection}
+     * @example collection.sorted((userA, userB) => userA.createdTimestamp - userB.createdTimestamp);
+     */
+    sorted(compareFunction?: (firstValue: V, secondValue: V, firstKey: K, secondKey: K) => number): this;
+}
+export { Collection };
+export default Collection;

node_modules/@discordjs/collection/dist/index.js

@@ -0,0 +1,389 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+/**
+ * A Map with additional utility methods. This is used throughout discord.js rather than Arrays for anything that has
+ * an ID, for significantly improved performance and ease-of-use.
+ * @extends {Map}
+ * @property {number} size - The amount of elements in this collection.
+ */
+class Collection extends Map {
+    constructor(entries) {
+        super(entries);
+        /**
+         * Cached array for the `array()` method - will be reset to `null` whenever `set()` or `delete()` are called
+         * @name Collection#_array
+         * @type {?Array}
+         * @private
+         */
+        Object.defineProperty(this, '_array', { value: null, writable: true, configurable: true });
+        /**
+         * Cached array for the `keyArray()` method - will be reset to `null` whenever `set()` or `delete()` are called
+         * @name Collection#_keyArray
+         * @type {?Array}
+         * @private
+         */
+        Object.defineProperty(this, '_keyArray', { value: null, writable: true, configurable: true });
+    }
+    /**
+     * Identical to [Map.get()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map/get).
+     * Gets an element with the specified key, and returns its value, or `undefined` if the element does not exist.
+     * @param {*} key - The key to get from this collection
+     * @returns {* | undefined}
+     */
+    get(key) {
+        return super.get(key);
+    }
+    /**
+     * Identical to [Map.set()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map/set).
+     * Sets a new element in the collection with the specified key and value.
+     * @param {*} key - The key of the element to add
+     * @param {*} value - The value of the element to add
+     * @returns {Collection}
+     */
+    set(key, value) {
+        this._array = null;
+        this._keyArray = null;
+        return super.set(key, value);
+    }
+    /**
+     * Identical to [Map.has()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map/has).
+     * Checks if an element exists in the collection.
+     * @param {*} key - The key of the element to check for
+     * @returns {boolean} `true` if the element exists, `false` if it does not exist.
+     */
+    has(key) {
+        return super.has(key);
+    }
+    /**
+     * Identical to [Map.delete()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map/delete).
+     * Deletes an element from the collection.
+     * @param {*} key - The key to delete from the collection
+     * @returns {boolean} `true` if the element was removed, `false` if the element does not exist.
+     */
+    delete(key) {
+        this._array = null;
+        this._keyArray = null;
+        return super.delete(key);
+    }
+    /**
+     * Identical to [Map.clear()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map/clear).
+     * Removes all elements from the collection.
+     * @returns {undefined}
+     */
+    clear() {
+        return super.clear();
+    }
+    /**
+     * Creates an ordered array of the values of this collection, and caches it internally. The array will only be
+     * reconstructed if an item is added to or removed from the collection, or if you change the length of the array
+     * itself. If you don't want this caching behavior, use `[...collection.values()]` or
+     * `Array.from(collection.values())` instead.
+     * @returns {Array}
+     */
+    array() {
+        if (!this._array || this._array.length !== this.size)
+            this._array = [...this.values()];
+        return this._array;
+    }
+    /**
+     * Creates an ordered array of the keys of this collection, and caches it internally. The array will only be
+     * reconstructed if an item is added to or removed from the collection, or if you change the length of the array
+     * itself. If you don't want this caching behavior, use `[...collection.keys()]` or
+     * `Array.from(collection.keys())` instead.
+     * @returns {Array}
+     */
+    keyArray() {
+        if (!this._keyArray || this._keyArray.length !== this.size)
+            this._keyArray = [...this.keys()];
+        return this._keyArray;
+    }
+    first(amount) {
+        if (typeof amount === 'undefined')
+            return this.values().next().value;
+        if (amount < 0)
+            return this.last(amount * -1);
+        amount = Math.min(this.size, amount);
+        const iter = this.values();
+        return Array.from({ length: amount }, () => iter.next().value);
+    }
+    firstKey(amount) {
+        if (typeof amount === 'undefined')
+            return this.keys().next().value;
+        if (amount < 0)
+            return this.lastKey(amount * -1);
+        amount = Math.min(this.size, amount);
+        const iter = this.keys();
+        return Array.from({ length: amount }, () => iter.next().value);
+    }
+    last(amount) {
+        const arr = this.array();
+        if (typeof amount === 'undefined')
+            return arr[arr.length - 1];
+        if (amount < 0)
+            return this.first(amount * -1);
+        if (!amount)
+            return [];
+        return arr.slice(-amount);
+    }
+    lastKey(amount) {
+        const arr = this.keyArray();
+        if (typeof amount === 'undefined')
+            return arr[arr.length - 1];
+        if (amount < 0)
+            return this.firstKey(amount * -1);
+        if (!amount)
+            return [];
+        return arr.slice(-amount);
+    }
+    random(amount) {
+        let arr = this.array();
+        if (typeof amount === 'undefined')
+            return arr[Math.floor(Math.random() * arr.length)];
+        if (arr.length === 0 || !amount)
+            return [];
+        arr = arr.slice();
+        return Array.from({ length: amount }, () => arr.splice(Math.floor(Math.random() * arr.length), 1)[0]);
+    }
+    randomKey(amount) {
+        let arr = this.keyArray();
+        if (typeof amount === 'undefined')
+            return arr[Math.floor(Math.random() * arr.length)];
+        if (arr.length === 0 || !amount)
+            return [];
+        arr = arr.slice();
+        return Array.from({ length: amount }, () => arr.splice(Math.floor(Math.random() * arr.length), 1)[0]);
+    }
+    find(fn, thisArg) {
+        if (typeof thisArg !== 'undefined')
+            fn = fn.bind(thisArg);
+        for (const [key, val] of this) {
+            if (fn(val, key, this))
+                return val;
+        }
+        return undefined;
+    }
+    findKey(fn, thisArg) {
+        if (typeof thisArg !== 'undefined')
+            fn = fn.bind(thisArg);
+        for (const [key, val] of this) {
+            if (fn(val, key, this))
+                return key;
+        }
+        return undefined;
+    }
+    sweep(fn, thisArg) {
+        if (typeof thisArg !== 'undefined')
+            fn = fn.bind(thisArg);
+        const previousSize = this.size;
+        for (const [key, val] of this) {
+            if (fn(val, key, this))
+                this.delete(key);
+        }
+        return previousSize - this.size;
+    }
+    filter(fn, thisArg) {
+        if (typeof thisArg !== 'undefined')
+            fn = fn.bind(thisArg);
+        const results = new this.constructor[Symbol.species]();
+        for (const [key, val] of this) {
+            if (fn(val, key, this))
+                results.set(key, val);
+        }
+        return results;
+    }
+    partition(fn, thisArg) {
+        if (typeof thisArg !== 'undefined')
+            fn = fn.bind(thisArg);
+        // TODO: consider removing the <K, V> from the constructors after TS 3.7.0 is released, as it infers it
+        const results = [new this.constructor[Symbol.species](), new this.constructor[Symbol.species]()];
+        for (const [key, val] of this) {
+            if (fn(val, key, this)) {
+                results[0].set(key, val);
+            }
+            else {
+                results[1].set(key, val);
+            }
+        }
+        return results;
+    }
+    flatMap(fn, thisArg) {
+        const collections = this.map(fn, thisArg);
+        return new this.constructor[Symbol.species]().concat(...collections);
+    }
+    map(fn, thisArg) {
+        if (typeof thisArg !== 'undefined')
+            fn = fn.bind(thisArg);
+        const iter = this.entries();
+        return Array.from({ length: this.size }, () => {
+            const [key, value] = iter.next().value;
+            return fn(value, key, this);
+        });
+    }
+    mapValues(fn, thisArg) {
+        if (typeof thisArg !== 'undefined')
+            fn = fn.bind(thisArg);
+        const coll = new this.constructor[Symbol.species]();
+        for (const [key, val] of this)
+            coll.set(key, fn(val, key, this));
+        return coll;
+    }
+    some(fn, thisArg) {
+        if (typeof thisArg !== 'undefined')
+            fn = fn.bind(thisArg);
+        for (const [key, val] of this) {
+            if (fn(val, key, this))
+                return true;
+        }
+        return false;
+    }
+    every(fn, thisArg) {
+        if (typeof thisArg !== 'undefined')
+            fn = fn.bind(thisArg);
+        for (const [key, val] of this) {
+            if (!fn(val, key, this))
+                return false;
+        }
+        return true;
+    }
+    /**
+     * Applies a function to produce a single value. Identical in behavior to
+     * [Array.reduce()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/reduce).
+     * @param {Function} fn Function used to reduce, taking four arguments; `accumulator`, `currentValue`, `currentKey`,
+     * and `collection`
+     * @param {*} [initialValue] Starting value for the accumulator
+     * @returns {*}
+     * @example collection.reduce((acc, guild) => acc + guild.memberCount, 0);
+     */
+    reduce(fn, initialValue) {
+        let accumulator;
+        if (typeof initialValue !== 'undefined') {
+            accumulator = initialValue;
+            for (const [key, val] of this)
+                accumulator = fn(accumulator, val, key, this);
+            return accumulator;
+        }
+        let first = true;
+        for (const [key, val] of this) {
+            if (first) {
+                accumulator = val;
+                first = false;
+                continue;
+            }
+            accumulator = fn(accumulator, val, key, this);
+        }
+        // No items iterated.
+        if (first) {
+            throw new TypeError('Reduce of empty collection with no initial value');
+        }
+        return accumulator;
+    }
+    each(fn, thisArg) {
+        this.forEach(fn, thisArg);
+        return this;
+    }
+    tap(fn, thisArg) {
+        if (typeof thisArg !== 'undefined')
+            fn = fn.bind(thisArg);
+        fn(this);
+        return this;
+    }
+    /**
+     * Creates an identical shallow copy of this collection.
+     * @returns {Collection}
+     * @example 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 {...Collection} collections Collections to merge
+     * @returns {Collection}
+     * @example const newColl = someColl.concat(someOtherColl, anotherColl, ohBoyAColl);
+     */
+    concat(...collections) {
+        const newColl = this.clone();
+        for (const coll of collections) {
+            for (const [key, val] of coll)
+                newColl.set(key, val);
+        }
+        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 Collection to compare with
+     * @returns {boolean} Whether the collections have identical contents
+     */
+    equals(collection) {
+        if (!collection)
+            return false;
+        if (this === collection)
+            return true;
+        if (this.size !== collection.size)
+            return false;
+        for (const [key, value] of this) {
+            if (!collection.has(key) || value !== collection.get(key)) {
+                return false;
+            }
+        }
+        return true;
+    }
+    /**
+     * The sort method sorts the items of a collection in place and returns it.
+     * The sort is not necessarily stable. The default sort order is according to string Unicode code points.
+     * @param {Function} [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.
+     * @returns {Collection}
+     * @example collection.sort((userA, userB) => userA.createdTimestamp - userB.createdTimestamp);
+     */
+    sort(compareFunction = (x, y) => Number(x > y) || Number(x === y) - 1) {
+        const entries = [...this.entries()];
+        entries.sort((a, b) => compareFunction(a[1], b[1], a[0], b[0]));
+        // Perform clean-up
+        super.clear();
+        this._array = null;
+        this._keyArray = null;
+        // Set the new entries
+        for (const [k, v] of entries) {
+            super.set(k, v);
+        }
+        return this;
+    }
+    /**
+     * The intersect method returns a new structure containing items where the keys are present in both original structures.
+     * @param {Collection} other The other Collection to filter against
+     * @returns {Collection}
+     */
+    intersect(other) {
+        return other.filter((_, k) => this.has(k));
+    }
+    /**
+     * 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 {Collection} other The other Collection to filter against
+     * @returns {Collection}
+     */
+    difference(other) {
+        return other.filter((_, k) => !this.has(k)).concat(this.filter((_, k) => !other.has(k)));
+    }
+    /**
+     * The sorted method sorts the items of a collection and returns it.
+     * The sort is not necessarily stable. The default sort order is according to string Unicode code points.
+     * @param {Function} [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.
+     * @returns {Collection}
+     * @example collection.sorted((userA, userB) => userA.createdTimestamp - userB.createdTimestamp);
+     */
+    sorted(compareFunction = (x, y) => Number(x > y) || Number(x === y) - 1) {
+        return new this.constructor[Symbol.species]([...this.entries()])
+            .sort((av, bv, ak, bk) => compareFunction(av, bv, ak, bk));
+    }
+}
+exports.Collection = Collection;
+Collection.default = Collection;
+exports.default = Collection;
+module.exports = Collection;
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiaW5kZXguanMiLCJzb3VyY2VSb290IjoiLyIsInNvdXJjZXMiOlsiaW5kZXgudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6Ijs7QUFRQTs7Ozs7R0FLRztBQUNILE1BQU0sVUFBaUIsU0FBUSxHQUFTO0lBTXZDLFlBQW1CLE9BQStDO1FBQ2pFLEtBQUssQ0FBQyxPQUFPLENBQUMsQ0FBQztRQUVmOzs7OztXQUtHO1FBQ0gsTUFBTSxDQUFDLGNBQWMsQ0FBQyxJQUFJLEVBQUUsUUFBUSxFQUFFLEVBQUUsS0FBSyxFQUFFLElBQUksRUFBRSxRQUFRLEVBQUUsSUFBSSxFQUFFLFlBQVksRUFBRSxJQUFJLEVBQUUsQ0FBQyxDQUFDO1FBRTNGOzs7OztXQUtHO1FBQ0gsTUFBTSxDQUFDLGNBQWMsQ0FBQyxJQUFJLEVBQUUsV0FBVyxFQUFFLEVBQUUsS0FBSyxFQUFFLElBQUksRUFBRSxRQUFRLEVBQUUsSUFBSSxFQUFFLFlBQVksRUFBRSxJQUFJLEVBQUUsQ0FBQyxDQUFDO0lBQy9GLENBQUM7SUFFRDs7Ozs7T0FLRztJQUNJLEdBQUcsQ0FBQyxHQUFNO1FBQ2hCLE9BQU8sS0FBSyxDQUFDLEdBQUcsQ0FBQyxHQUFHLENBQUMsQ0FBQztJQUN2QixDQUFDO0lBRUQ7Ozs7OztPQU1HO0lBQ0ksR0FBRyxDQUFDLEdBQU0sRUFBRSxLQUFRO1FBQzFCLElBQUksQ0FBQyxNQUFNLEdBQUcsSUFBSSxDQUFDO1FBQ25CLElBQUksQ0FBQyxTQUFTLEdBQUcsSUFBSSxDQUFDO1FBQ3RCLE9BQU8sS0FBSyxDQUFDLEdBQUcsQ0FBQyxHQUFHLEVBQUUsS0FBSyxDQUFDLENBQUM7SUFDOUIsQ0FBQztJQUVEOzs7OztPQUtHO0lBQ0ksR0FBRyxDQUFDLEdBQU07UUFDaEIsT0FBTyxLQUFLLENBQUMsR0FBRyxDQUFDLEdBQUcsQ0FBQyxDQUFDO0lBQ3ZCLENBQUM7SUFFRDs7Ozs7T0FLRztJQUNJLE1BQU0sQ0FBQyxHQUFNO1FBQ25CLElBQUksQ0FBQyxNQUFNLEdBQUcsSUFBSSxDQUFDO1FBQ25CLElBQUksQ0FBQyxTQUFTLEdBQUcsSUFBSSxDQUFDO1FBQ3RCLE9BQU8sS0FBSyxDQUFDLE1BQU0sQ0FBQyxHQUFHLENBQUMsQ0FBQztJQUMxQixDQUFDO0lBRUQ7Ozs7T0FJRztJQUNJLEtBQUs7UUFDWCxPQUFPLEtBQUssQ0FBQyxLQUFLLEVBQUUsQ0FBQztJQUN0QixDQUFDO0lBRUQ7Ozs7OztPQU1HO0lBQ0ksS0FBSztRQUNYLElBQUksQ0FBQyxJQUFJLENBQUMsTUFBTSxJQUFJLElBQUksQ0FBQyxNQUFNLENBQUMsTUFBTSxLQUFLLElBQUksQ0FBQyxJQUFJO1lBQUUsSUFBSSxDQUFDLE1BQU0sR0FBRyxDQUFDLEdBQUcsSUFBSSxDQUFDLE1BQU0sRUFBRSxDQUFDLENBQUM7UUFDdkYsT0FBTyxJQUFJLENBQUMsTUFBTSxDQUFDO0lBQ3BCLENBQUM7SUFFRDs7Ozs7O09BTUc7SUFDSSxRQUFRO1FBQ2QsSUFBSSxDQUFDLElBQUksQ0FBQyxTQUFTLElBQUksSUFBSSxDQUFDLFNBQVMsQ0FBQyxNQUFNLEtBQUssSUFBSSxDQUFDLElBQUk7WUFBRSxJQUFJLENBQUMsU0FBUyxHQUFHLENBQUMsR0FBRyxJQUFJLENBQUMsSUFBSSxFQUFFLENBQUMsQ0FBQztRQUM5RixPQUFPLElBQUksQ0FBQyxTQUFTLENBQUM7SUFDdkIsQ0FBQztJQVVNLEtBQUssQ0FBQyxNQUFlO1FBQzNCLElBQUksT0FBTyxNQUFNLEtBQUssV0FBVztZQUFFLE9BQU8sSUFBSSxDQUFDLE1BQU0sRUFBRSxDQUFDLElBQUksRUFBRSxDQUFDLEtBQUssQ0FBQztRQUNyRSxJQUFJLE1BQU0sR0FBRyxDQUFDO1lBQUUsT0FBTyxJQUFJLENBQUMsSUFBSSxDQUFDLE1BQU0sR0FBRyxDQUFDLENBQUMsQ0FBQyxDQUFDO1FBQzlDLE1BQU0sR0FBRyxJQUFJLENBQUMsR0FBRyxDQUFDLElBQUksQ0FBQyxJQUFJLEVBQUUsTUFBTSxDQUFDLENBQUM7UUFDckMsTUFBTSxJQUFJLEdBQUcsSUFBSSxDQUFDLE1BQU0sRUFBRSxDQUFDO1FBQzNCLE9BQU8sS0FBSyxDQUFDLElBQUksQ0FBQyxFQUFFLE1BQU0sRUFBRSxNQUFNLEVBQUUsRUFBRSxHQUFNLEVBQUUsQ0FBQyxJQUFJLENBQUMsSUFBSSxFQUFFLENBQUMsS0FBSyxDQUFDLENBQUM7SUFDbkUsQ0FBQztJQVVNLFFBQVEsQ0FBQyxNQUFlO1FBQzlCLElBQUksT0FBTyxNQUFNLEtBQUssV0FBVztZQUFFLE9BQU8sSUFBSSxDQUFDLElBQUksRUFBRSxDQUFDLElBQUksRUFBRSxDQUFDLEtBQUssQ0FBQztRQUNuRSxJQUFJLE1BQU0sR0FBRyxDQUFDO1lBQUUsT0FBTyxJQUFJLENBQUMsT0FBTyxDQUFDLE1BQU0sR0FBRyxDQUFDLENBQUMsQ0FBQyxDQUFDO1FBQ2pELE1BQU0sR0FBRyxJQUFJLENBQUMsR0FBRyxDQUFDLElBQUksQ0FBQyxJQUFJLEVBQUUsTUFBTSxDQUFDLENBQUM7UUFDckMsTUFBTSxJQUFJLEdBQUcsSUFBSSxDQUFDLElBQUksRUFBRSxDQUFDO1FBQ3pCLE9BQU8sS0FBSyxDQUFDLElBQUksQ0FBQyxFQUFFLE1BQU0sRUFBRSxNQUFNLEVBQUUsRUFBRSxHQUFNLEVBQUUsQ0FBQyxJQUFJLENBQUMsSUFBSSxFQUFFLENBQUMsS0FBSyxDQUFDLENBQUM7SUFDbkUsQ0FBQztJQVdNLElBQUksQ0FBQyxNQUFlO1FBQzFCLE1BQU0sR0FBRyxHQUFHLElBQUksQ0FBQyxLQUFLLEVBQUUsQ0FBQztRQUN6QixJQUFJLE9BQU8sTUFBTSxLQUFLLFdBQVc7WUFBRSxPQUFPLEdBQUcsQ0FBQyxHQUFHLENBQUMsTUFBTSxHQUFHLENBQUMsQ0FBQyxDQUFDO1FBQzlELElBQUksTUFBTSxHQUFHLENBQUM7WUFBRSxPQUFPLElBQUksQ0FBQyxLQUFLLENBQUMsTUFBTSxHQUFHLENBQUMsQ0FBQyxDQUFDLENBQUM7UUFDL0MsSUFBSSxDQUFDLE1BQU07WUFBRSxPQUFPLEVBQUUsQ0FBQztRQUN2QixPQUFPLEdBQUcsQ0FBQyxLQUFLLENBQUMsQ0FBQyxNQUFNLENBQUMsQ0FBQztJQUMzQixDQUFDO0lBV00sT0FBTyxDQUFDLE1BQWU7UUFDN0IsTUFBTSxHQUFHLEdBQUcsSUFBSSxDQUFDLFFBQVEsRUFBRSxDQUFDO1FBQzVCLElBQUksT0FBTyxNQUFNLEtBQUssV0FBVztZQUFFLE9BQU8sR0FBRyxDQUFDLEdBQUcsQ0FBQyxNQUFNLEdBQUcsQ0FBQyxDQUFDLENBQUM7UUFDOUQsSUFBSSxNQUFNLEdBQUcsQ0FBQztZQUFFLE9BQU8sSUFBSSxDQUFDLFFBQVEsQ0FBQyxNQUFNLEdBQUcsQ0FBQyxDQUFDLENBQUMsQ0FBQztRQUNsRCxJQUFJLENBQUMsTUFBTTtZQUFFLE9BQU8sRUFBRSxDQUFDO1FBQ3ZCLE9BQU8sR0FBRyxDQUFDLEtBQUssQ0FBQyxDQUFDLE1BQU0sQ0FBQyxDQUFDO0lBQzNCLENBQUM7SUFVTSxNQUFNLENBQUMsTUFBZTtRQUM1QixJQUFJLEdBQUcsR0FBRyxJQUFJLENBQUMsS0FBSyxFQUFFLENBQUM7UUFDdkIsSUFBSSxPQUFPLE1BQU0sS0FBSyxXQUFXO1lBQUUsT0FBTyxHQUFHLENBQUMsSUFBSSxDQUFDLEtBQUssQ0FBQyxJQUFJLENBQUMsTUFBTSxFQUFFLEdBQUcsR0FBRyxDQUFDLE1BQU0sQ0FBQyxDQUFDLENBQUM7UUFDdEYsSUFBSSxHQUFHLENBQUMsTUFBTSxLQUFLLENBQUMsSUFBSSxDQUFDLE1BQU07WUFBRSxPQUFPLEVBQUUsQ0FBQztRQUMzQyxHQUFHLEdBQUcsR0FBRyxDQUFDLEtBQUssRUFBRSxDQUFDO1FBQ2xCLE9BQU8sS0FBSyxDQUFDLElBQUksQ0FBQyxFQUFFLE1BQU0sRUFBRSxNQUFNLEVBQUUsRUFBRSxHQUFNLEVBQUUsQ0FBQyxHQUFHLENBQUMsTUFBTSxDQUFDLElBQUksQ0FBQyxLQUFLLENBQUMsSUFBSSxDQUFDLE1BQU0sRUFBRSxHQUFHLEdBQUcsQ0FBQyxNQUFNLENBQUMsRUFBRSxDQUFDLENBQUMsQ0FBQyxDQUFDLENBQUMsQ0FBQyxDQUFDO0lBQzFHLENBQUM7SUFVTSxTQUFTLENBQUMsTUFBZTtRQUMvQixJQUFJLEdBQUcsR0FBRyxJQUFJLENBQUMsUUFBUSxFQUFFLENBQUM7UUFDMUIsSUFBSSxPQUFPLE1BQU0sS0FBSyxXQUFXO1lBQUUsT0FBTyxHQUFHLENBQUMsSUFBSSxDQUFDLEtBQUssQ0FBQyxJQUFJLENBQ
Line truncated

node_modules/@discordjs/collection/package.json

@@ -0,0 +1,78 @@
+{
+  "_from": "@discordjs/collection@^0.1.5",
+  "_id": "@discordjs/collection@0.1.5",
+  "_inBundle": false,
+  "_integrity": "sha512-CU1q0UXQUpFNzNB7gufgoisDHP7n+T3tkqTsp3MNUkVJ5+hS3BCvME8uCXAUFlz+6T2FbTCu75A+yQ7HMKqRKw==",
+  "_location": "/@discordjs/collection",
+  "_phantomChildren": {},
+  "_requested": {
+    "type": "range",
+    "registry": true,
+    "raw": "@discordjs/collection@^0.1.5",
+    "name": "@discordjs/collection",
+    "escapedName": "@discordjs%2fcollection",
+    "scope": "@discordjs",
+    "rawSpec": "^0.1.5",
+    "saveSpec": null,
+    "fetchSpec": "^0.1.5"
+  },
+  "_requiredBy": [
+    "/discord.js"
+  ],
+  "_resolved": "https://registry.npmjs.org/@discordjs/collection/-/collection-0.1.5.tgz",
+  "_shasum": "1781c620b4c88d619bd0373a1548e5a6025e3d3a",
+  "_spec": "@discordjs/collection@^0.1.5",
+  "_where": "C:\\Users\\matia\\Documents\\GitHub\\Musix-V3\\node_modules\\discord.js",
+  "author": {
+    "name": "Amish Shah",
+    "email": "amishshah.2k@gmail.com"
+  },
+  "bugs": {
+    "url": "https://github.com/discordjs/collection/issues"
+  },
+  "bundleDependencies": false,
+  "deprecated": false,
+  "description": "Utility data structure used in Discord.js",
+  "devDependencies": {
+    "@babel/cli": "^7.8.4",
+    "@babel/core": "^7.8.4",
+    "@babel/preset-env": "^7.8.4",
+    "@babel/preset-typescript": "^7.8.3",
+    "@types/node": "^13.7.4",
+    "@typescript-eslint/eslint-plugin": "^2.21.0",
+    "@typescript-eslint/parser": "^2.21.0",
+    "discord.js-docgen": "github:discordjs/docgen#ts-patch",
+    "eslint": "^6.8.0",
+    "eslint-config-marine": "^6.0.0",
+    "jsdoc-babel": "^0.5.0",
+    "rimraf": "^3.0.2",
+    "typescript": "^3.8.2"
+  },
+  "eslintConfig": {
+    "extends": "marine/node"
+  },
+  "homepage": "https://github.com/discordjs/collection#readme",
+  "keywords": [
+    "map",
+    "collection",
+    "utility"
+  ],
+  "license": "Apache-2.0",
+  "main": "dist/index.js",
+  "name": "@discordjs/collection",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/discordjs/collection.git"
+  },
+  "scripts": {
+    "build": "rimraf dist/ && tsc",
+    "docs": "docgen --jsdoc jsdoc.json --source src/*.ts src/**/*.ts --custom docs/index.yml --output docs/docs.json",
+    "docs:test": "docgen --jsdoc jsdoc.json --source src/*.ts src/**/*.ts --custom docs/index.yml",
+    "lint": "eslint src --ext .ts",
+    "prebuild": "npm run lint",
+    "pretest": "npm run build",
+    "test": "node test/index.js"
+  },
+  "types": "dist/index.d.ts",
+  "version": "0.1.5"
+}