discord.js | LimitedCollection

Search...

LimitedCollection

export class LimitedCollection<K, V> extends Collection<K, V>

export class LimitedCollection<K, V> extends Collection<K, V>

A Collection which holds a max amount of entries.

Extends

Collection<K, V>

Name	Constraints	Optional	Default	Description
K		No		None
V		No		None

constructor(options?, iterable?)

Name	Type	Optional	Description
options	LimitedCollectionOptions<K, V>	Yes	None
iterable	Iterable<readonly [K, V]>	Yes	None

keepOverLimit:((value: V, key: K, collection: this) => boolean) | null

A function called to check if an entry should be kept when the Collection is at max size.

maxSize:number

The max size of the Collection.

at(index):V | undefined

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.

Name	Type	Optional	Description
index	number	No	The index of the element to obtain

Inherited from Collection

clone():Collection<K, V>

Creates an identical shallow copy of this collection.

Example

const newColl = someColl.clone();

const newColl = someColl.clone();

Inherited from Collection

Static

combineEntries(entries, combine):Collection<K, V>

Creates a Collection from a list of entries.

Example

Collection.combineEntries([["a", 1], ["b", 2], ["a", 2]], (x, y) => x + y);
// returns Collection { "a" => 3, "b" => 2 }

Collection.combineEntries([["a", 1], ["b", 2], ["a", 2]], (x, y) => x + y);
// returns Collection { "a" => 3, "b" => 2 }

Name	Type	Optional	Description
entries	Iterable<[K, V]>	No	The list of entries
combine	(firstValue: V, secondValue: V, key: K) => V	No	Function to combine an existing entry with a new one

Inherited from Collection

concat(...collections):Collection<K, V>

Combines this collection with others into a new collection. None of the source collections are modified.

Example

const newColl = someColl.concat(someOtherColl, anotherColl, ohBoyAColl);

const newColl = someColl.concat(someOtherColl, anotherColl, ohBoyAColl);

Name	Type	Optional	Description
...collections	ReadonlyCollection<K, V>[]	No	Collections to merge

Inherited from Collection

difference(other):Collection<K, V>

Returns a new collection containing the items where the key is present in this collection but not the other.

Example

const col1 = new Collection([['a', 1], ['b', 2]]);
const col2 = new Collection([['a', 1], ['c', 3]]);
console.log(col1.difference(col2));
// => Collection { 'b' => 2 }
console.log(col2.difference(col1));
// => Collection { 'c' => 3 }

const col1 = new Collection([['a', 1], ['b', 2]]);
const col2 = new Collection([['a', 1], ['c', 3]]);
console.log(col1.difference(col2));
// => Collection { 'b' => 2 }
console.log(col2.difference(col1));
// => Collection { 'c' => 3 }

Name	Type	Optional	Description
other	ReadonlyCollection<K, T>	No	The other Collection to filter against

Inherited from Collection

each(fn):this

Identical to Map.forEach(), but returns the collection instead of undefined.

Example

collection
 .each(user => console.log(user.username))
 .filter(user => user.bot)
 .each(user => console.log(user.username));

collection
 .each(user => console.log(user.username))
 .filter(user => user.bot)
 .each(user => console.log(user.username));

Name	Type	Optional	Description
fn	(value: V, key: K, collection: this) => void	No	Function to execute for each element

ensure(key, defaultValueGenerator):V

Obtains the value of the given key if it exists, otherwise sets and returns the value provided by the default value generator.

Example

collection.ensure(guildId, () => defaultGuildConfig);

collection.ensure(guildId, () => defaultGuildConfig);

Name	Type	Optional	Description
key	K	No	The key to get if it exists, or set otherwise
defaultValueGenerator	(key: K, collection: this) => V	No	A function that generates the default value

Inherited from Collection

equals(collection):boolean

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.

Returns

Whether the collections have identical contents

Name	Type	Optional	Description
collection	ReadonlyCollection<K, V>	No	Collection to compare with

Inherited from Collection

every(fn):this is Collection<K2, V>

Checks if all items passes a test. Identical in behavior to Array.every().

Example

collection.every(user => !user.bot);

collection.every(user => !user.bot);

Name	Type	Optional	Description
fn	(value: V, key: K, collection: this) => key is K2	No	Function used to test (should return a boolean)

filter(fn):Collection<K2, V>

Identical to Array.filter(), but returns a Collection instead of an Array.

Example

collection.filter(user => user.username === 'Bob');

collection.filter(user => user.username === 'Bob');

Name	Type	Optional	Description
fn	(value: V, key: K, collection: this) => key is K2	No	The function to test with (should return a boolean)

find(fn):V2 | undefined

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.

Example

collection.find(user => user.username === 'Bob');

collection.find(user => user.username === 'Bob');

Name	Type	Optional	Description
fn	(value: V, key: K, collection: this) => value is V2	No	The function to test with (should return a boolean)

findKey(fn):K2 | undefined

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.

Example

collection.findKey(user => user.username === 'Bob');

collection.findKey(user => user.username === 'Bob');

Name	Type	Optional	Description
fn	(value: V, key: K, collection: this) => key is K2	No	The function to test with (should return a boolean)

findLast(fn):V2 | undefined

Searches for a last item where the given function returns a truthy value. This behaves like Array.findLast().

Name	Type	Optional	Description
fn	(value: V, key: K, collection: this) => value is V2	No	The function to test with (should return a boolean)

findLastKey(fn):K2 | undefined

Searches for the key of a last item where the given function returns a truthy value. This behaves like Array.findLastIndex(), but returns the key rather than the positional index.

Name	Type	Optional	Description
fn	(value: V, key: K, collection: this) => key is K2	No	The function to test with (should return a boolean)

first():V | undefined

Obtains the first value(s) in this collection.

Returns

A single value if no amount is provided or an array of values, starting from the end if amount is negative

firstKey():K | undefined

Obtains the first key(s) in this collection.

Returns

A single key if no amount is provided or an array of keys, starting from the end if amount is negative

flatMap(fn):Collection<K, T>

Maps each item into a Collection, then joins the results into a single Collection. Identical in behavior to Array.flatMap().

Example

collection.flatMap(guild => guild.members.cache);

collection.flatMap(guild => guild.members.cache);

Name	Type	Optional	Description
fn	(value: V, key: K, collection: this) => Collection<K, T>	No	Function that produces a new Collection

hasAll(...keys):boolean

Checks if all of the elements exist in the collection.

Returns

true if all of the elements exist, false if at least one does not exist.

Name	Type	Optional	Description
...keys	K[]	No	The keys of the elements to check for

Inherited from Collection

hasAny(...keys):boolean

Checks if any of the elements exist in the collection.

Returns

true if any of the elements exist, false if none exist.

Name	Type	Optional	Description
...keys	K[]	No	The keys of the elements to check for

Inherited from Collection

intersection(other):Collection<K, T | V>

The intersection method returns a new collection containing the items where the key is present in both collections.

Example

const col1 = new Collection([['a', 1], ['b', 2]]);
const col2 = new Collection([['a', 1], ['c', 3]]);
const intersection = col1.intersection(col2);
console.log(col1.intersection(col2));
// => Collection { 'a' => 1 }

const col1 = new Collection([['a', 1], ['b', 2]]);
const col2 = new Collection([['a', 1], ['c', 3]]);
const intersection = col1.intersection(col2);
console.log(col1.intersection(col2));
// => Collection { 'a' => 1 }

Name	Type	Optional	Description
other	ReadonlyCollection<K, T>	No	The other Collection to filter against

Inherited from Collection

keyAt(index):K | undefined

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.

Name	Type	Optional	Description
index	number	No	The index of the key to obtain

Inherited from Collection

last():V | undefined

Obtains the last value(s) in this collection.

Returns

A single value if no amount is provided or an array of values, starting from the start if amount is negative

lastKey():K | undefined

Obtains the last key(s) in this collection.

Returns

A single key if no amount is provided or an array of keys, starting from the start if amount is negative

map(fn):T[]

Maps each item to another value into an array. Identical in behavior to Array.map().

Example

collection.map(user => user.tag);

collection.map(user => user.tag);

Name	Type	Optional	Description
fn	(value: V, key: K, collection: this) => T	No	Function that produces an element of the new array, taking three arguments

mapValues(fn):Collection<K, T>

Maps each item to another value into a collection. Identical in behavior to Array.map().

Example

collection.mapValues(user => user.tag);

collection.mapValues(user => user.tag);

Name	Type	Optional	Description
fn	(value: V, key: K, collection: this) => T	No	Function that produces an element of the new collection, taking three arguments

merge(other, whenInSelf, whenInOther, whenInBoth):Collection<K, R>

Merges two Collections together into a new Collection.

Example

// 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 }),
);

// 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

// Intersects two collections in a left-biased manner.
coll.merge(
 other,
 x => ({ keep: false }),
 y => ({ keep: false }),
 (x, _) => ({ keep: true, value: x }),
);

// Intersects two collections in a left-biased manner.
coll.merge(
 other,
 x => ({ keep: false }),
 y => ({ keep: false }),
 (x, _) => ({ keep: true, value: x }),
);

Name	Type	Optional	Description
other	ReadonlyCollection<K, T>	No	The other Collection to merge with
whenInSelf	(value: V, key: K) => Keep<R>	No	Function getting the result if the entry only exists in this Collection
whenInOther	(valueOther: T, key: K) => Keep<R>	No	Function getting the result if the entry only exists in the other Collection
whenInBoth	(value: V, valueOther: T, key: K) => Keep<R>	No	Function getting the result if the entry exists in both Collections

Inherited from Collection

partition(fn):[Collection<K2, V>, Collection<Exclude<K, K2>, V>]

Partitions the collection into two collections where the first collection contains the items that passed and the second contains the items that failed.

Example

const [big, small] = collection.partition(guild => guild.memberCount > 250);

const [big, small] = collection.partition(guild => guild.memberCount > 250);

Name	Type	Optional	Description
fn	(value: V, key: K, collection: this) => key is K2	No	Function used to test (should return a boolean)

random():V | undefined

Obtains unique random value(s) from this collection.

Returns

A single value if no amount is provided or an array of values

randomKey():K | undefined

Obtains unique random key(s) from this collection.

Returns

A single key if no amount is provided or an array

reduce(fn, initialValue?):T

Applies a function to produce a single value. Identical in behavior to Array.reduce().

Example

collection.reduce((acc, guild) => acc + guild.memberCount, 0);

collection.reduce((acc, guild) => acc + guild.memberCount, 0);

Name	Type	Optional	Description
fn	(accumulator: T, value: V, key: K, collection: this) => T	No	Function used to reduce, taking four arguments; `accumulator`, `currentValue`, `currentKey`, and `collection`
initialValue	T	Yes	Starting value for the accumulator

Inherited from Collection

reduceRight(fn, initialValue?):T

Applies a function to produce a single value. Identical in behavior to Array.reduceRight().

Name	Type	Optional	Description
fn	(accumulator: T, value: V, key: K, collection: this) => T	No	Function used to reduce, taking four arguments; `accumulator`, `value`, `key`, and `collection`
initialValue	T	Yes	Starting value for the accumulator

Inherited from Collection

reverse():this

Identical to Array.reverse() but returns a Collection instead of an Array.

Inherited from Collection

some(fn):boolean

Checks if there exists an item that passes a test. Identical in behavior to Array.some().

Example

collection.some(user => user.discriminator === '0000');

collection.some(user => user.discriminator === '0000');

Name	Type	Optional	Description
fn	(value: V, key: K, collection: this) => unknown	No	Function used to test (should return a boolean)

sort(compareFunction?):this

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.

Example

collection.sort((userA, userB) => userA.createdTimestamp - userB.createdTimestamp);

collection.sort((userA, userB) => userA.createdTimestamp - userB.createdTimestamp);

Name	Type	Optional	Description
compareFunction	Comparator<K, V>	Yes	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.

Inherited from Collection

sweep(fn):number

Removes items that satisfy the provided filter function.

Returns

The number of removed entries

Name	Type	Optional	Description
fn	(value: V, key: K, collection: this) => unknown	No	Function used to test (should return a boolean)

symmetricDifference(other):Collection<K, T | V>

Returns a new collection containing only the items where the keys are present in either collection, but not both.

Example

const col1 = new Collection([['a', 1], ['b', 2]]);
const col2 = new Collection([['a', 1], ['c', 3]]);
const symmetricDifference = col1.symmetricDifference(col2);
console.log(col1.symmetricDifference(col2));
// => Collection { 'b' => 2, 'c' => 3 }

const col1 = new Collection([['a', 1], ['b', 2]]);
const col2 = new Collection([['a', 1], ['c', 3]]);
const symmetricDifference = col1.symmetricDifference(col2);
console.log(col1.symmetricDifference(col2));
// => Collection { 'b' => 2, 'c' => 3 }

Name	Type	Optional	Description
other	ReadonlyCollection<K, T>	No	The other Collection to filter against

Inherited from Collection

tap(fn):this

Runs a function on the collection and returns the collection.

Example

collection
 .tap(coll => console.log(coll.size))
 .filter(user => user.bot)
 .tap(coll => console.log(coll.size))

collection
 .tap(coll => console.log(coll.size))
 .filter(user => user.bot)
 .tap(coll => console.log(coll.size))

Name	Type	Optional	Description
fn	(collection: this) => void	No	Function to execute

toJSON():[K, V][]

toReversed():Collection<K, V>

Identical to Array.toReversed() but returns a Collection instead of an Array.

Inherited from Collection

toSorted(compareFunction?):Collection<K, V>

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.

Example

collection.sorted((userA, userB) => userA.createdTimestamp - userB.createdTimestamp);

collection.sorted((userA, userB) => userA.createdTimestamp - userB.createdTimestamp);

Name	Type	Optional	Description
compareFunction	Comparator<K, V>	Yes	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.

Inherited from Collection

union(other):Collection<K, T | V>

Returns a new collection containing the items where the key is present in either of the collections.

Remarks

If the collections have any items with the same key, the value from the first collection will be used.

Example

const col1 = new Collection([['a', 1], ['b', 2]]);
const col2 = new Collection([['a', 1], ['b', 3], ['c', 3]]);
const union = col1.union(col2);
console.log(union);
// => Collection { 'a' => 1, 'b' => 2, 'c' => 3 }

const col1 = new Collection([['a', 1], ['b', 2]]);
const col2 = new Collection([['a', 1], ['b', 3], ['c', 3]]);
const union = col1.union(col2);
console.log(union);
// => Collection { 'a' => 1, 'b' => 2, 'c' => 3 }

Name	Type	Optional	Description
other	ReadonlyCollection<K, T>	No	The other Collection to filter against

Inherited from Collection