Readonly
[toThe initial value of Object.prototype.constructor is the standard built-in Object constructor.
Readonly
sizeStatic
Readonly
[species]Returns an iterable of entries in the map.
Identical to 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.
The index of the element to obtain
Creates an identical shallow copy of this collection.
Combines this collection with others into a new collection. None of the source collections are modified.
Collections to merge
true if an element in the Map existed and has been removed, or false if the element does not exist.
The difference method returns a new structure containing items where the key is present in one of the original structures but not the other.
The other Collection to filter against
Identical to Map.forEach(), but returns the collection instead of undefined.
Obtains the value of the given key if it exists, otherwise sets and returns the value provided by the default value generator.
Returns an iterable of key, value pairs for every entry in the map.
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.
Collection to compare with
Whether the collections have identical contents
Checks if all items passes a test. Identical in behavior to Array.every().
Checks if all items passes a test. Identical in behavior to Array.every().
Checks if all items passes a test. Identical in behavior to Array.every().
Checks if all items passes a test. Identical in behavior to Array.every().
Checks if all items passes a test. Identical in behavior to Array.every().
Checks if all items passes a test. Identical in behavior to Array.every().
Identical to Array.filter(), but returns a Collection instead of an Array.
Identical to Array.filter(), but returns a Collection instead of an Array.
Identical to Array.filter(), but returns a Collection instead of an Array.
Identical to Array.filter(), but returns a Collection instead of an Array.
Identical to Array.filter(), but returns a Collection instead of an Array.
Identical to Array.filter(), but returns a Collection instead of an Array.
Searches for a single item where the given function returns a truthy value. This behaves like
Array.find().
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 for details.
Searches for a single item where the given function returns a truthy value. This behaves like
Array.find().
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 for details.
Searches for a single item where the given function returns a truthy value. This behaves like
Array.find().
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 for details.
Searches for a single item where the given function returns a truthy value. This behaves like
Array.find().
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 for details.
Searches for the key of a single item where the given function returns a truthy value. This behaves like Array.findIndex(), but returns the key rather than the positional index.
Searches for the key of a single item where the given function returns a truthy value. This behaves like Array.findIndex(), but returns the key rather than the positional index.
Searches for the key of a single item where the given function returns a truthy value. This behaves like Array.findIndex(), but returns the key rather than the positional index.
Searches for the key of a single item where the given function returns a truthy value. This behaves like Array.findIndex(), but returns the key rather than the positional index.
Obtains the first value(s) in this collection.
A single value if no amount is provided or an array of values, starting from the end if amount is negative
Obtains the first value(s) in this collection.
Amount of values to obtain from the beginning
A single value if no amount is provided or an array of values, starting from the end if amount is negative
Obtains the first key(s) in this collection.
A single key if no amount is provided or an array of keys, starting from the end if amount is negative
Obtains the first key(s) in this collection.
Amount of keys to obtain from the beginning
A single key if no amount is provided or an array of keys, starting from the end if amount is negative
Maps each item into a Collection, then joins the results into a single Collection. Identical in behavior to Array.flatMap().
Function that produces a new Collection
Maps each item into a Collection, then joins the results into a single Collection. Identical in behavior to Array.flatMap().
Returns a specified element from the Map object. If the value that is associated to the provided key is an object, then you will get a reference to that object and any change made to that object will effectively modify it inside the Map.
Returns the element associated with the specified key. If no element is associated with the specified key, undefined is returned.
boolean indicating whether an element with the specified key exists or not.
Checks if all of the elements exist in the collection.
The keys of the elements to check for
true
if all of the elements exist, false
if at least one does not exist.
Checks if any of the elements exist in the collection.
The keys of the elements to check for
true
if any of the elements exist, false
if none exist.
The intersect method returns a new structure containing items where the keys and values are present in both original structures.
The other Collection to filter against
Identical to 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.
The index of the key to obtain
Returns an iterable of keys in the map
Obtains the last value(s) in this collection.
A single value if no amount is provided or an array of values, starting from the start if amount is negative
Obtains the last value(s) in this collection.
Amount of values to obtain from the end
A single value if no amount is provided or an array of values, starting from the start if amount is negative
Obtains the last key(s) in this collection.
A single key if no amount is provided or an array of keys, starting from the start if amount is negative
Obtains the last key(s) in this collection.
Amount of keys to obtain from the end
A single key if no amount is provided or an array of keys, starting from the start if amount is negative
Maps each item to another value into an array. Identical in behavior to Array.map().
Maps each item to another value into an array. Identical in behavior to Array.map().
Maps each item to another value into a collection. Identical in behavior to Array.map().
Maps each item to another value into a collection. Identical in behavior to Array.map().
Merges two Collections together into a new Collection.
The other Collection to merge with
Function getting the result if the entry only exists in this Collection
Function getting the result if the entry only exists in the other Collection
Function getting the result if the entry exists in both Collections
Partitions the collection into two collections where the first collection contains the items that passed and the second contains the items that failed.
Partitions the collection into two collections where the first collection contains the items that passed and the second contains the items that failed.
Partitions the collection into two collections where the first collection contains the items that passed and the second contains the items that failed.
Partitions the collection into two collections where the first collection contains the items that passed and the second contains the items that failed.
Partitions the collection into two collections where the first collection contains the items that passed and the second contains the items that failed.
Partitions the collection into two collections where the first collection contains the items that passed and the second contains the items that failed.
Obtains unique random value(s) from this collection.
A single value if no amount is provided or an array of values
Obtains unique random value(s) from this collection.
Amount of values to obtain randomly
A single value if no amount is provided or an array of values
Identical to Array.reverse() but returns a Collection instead of an Array.
Checks if there exists an item that passes a test. Identical in behavior to Array.some().
Checks if there exists an item that passes a test. Identical in behavior to Array.some().
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.
Optional
compareFunction: Comparator<Key, Value>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.
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.
Optional
compareFunction: Comparator<Key, Value>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.
The subtract method returns a new structure containing items where the keys and values of the original structure are not present in the other.
The other Collection to filter against
Returns an iterable of values in the map
Static
combineStatic
group
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.