Value Type 🍨🐚Element⚪️🍆

🖍  🆕 

Creates an empty list.

🖍  🆕▶️🐴  capacity 🔢 

Creates an empty list with the given initial capacity.

Note that this initializer does not place any values in the list. This initializer can be used for better performance if the number of values that will be added is known in advance.

☣️ 🖍  🆕▶️🍪  values 🧠  count 🔢 

🖍  🆕 🎍🥡 repeatedValue Element  count 🔢 

Creates an containing the specified number of a single, repeated value.

🖍 ❗️ 🐻 🎍🥡 item Element 

Appends item to the end of the list in O(1).

❗️ 🐽  index 🔢 ➡️ ✴️Element

Gets the item at index in O(1). index must be greater than or equal to 0 and less than 📏❓ or the program will panic.

🖍 ➡️ 🐽 🎍🥡 value Element  index 🔢 

Sets value at index. index must be greater than or equal to 0 and less than 📏❓ or the program will panic.

🖍 ❗️ 🐨  index 🔢 ➡️ 👌

Removes the item at index and shifts all following items to the left in O(n).

Returns 👍 unless the index is out of range.

🖍 ❗️ 🐵  index 🔢 🎍🥡 item Element ➡️ 👌

Inserts the given values before the element with the given index.

All items beginning from index are shifted to the right and item is then inserted at index. Complexity: O(n).

❓ 📏 ➡️ 🔢

Returns the number of items in the list.

🖍 ❗️ 🐥  list 🍨🐚Element🍆 

Appends the content of list to this list. Complexity: O(n).

🖍 ❗️ 🐼 ➡️ 🍬Element

Removes the last item from the list and returns it in O(1). If the list is empty no value is returned.

🖍 ❗️ 🐗 

Removes all elements from the list but keeps the list’s capacity.

This can be much more efficient than using a new list. Complexity: O(n).

🖍 ❗️ 🐴  capacity 🔢 

Ensures that the list is large enough to store at least capacity elements.

You should use this method if you plan to heavily use 🐷 with large indices in order to avoid automatic, useless allocations.

Complexity: O(n).

❓ 🐴 ➡️ 🔢

Returns the lists current capacity.

🖍 ❗️ 🦁  comparator 🍇ElementElement➡️🔢🍉 

Sorts this array in place using the quick sort algorithm.

comparator must return an integer less than, equal to, or greater than 0, if the first argument is considered respectively less than, equal to, or greater than the second.

🖍 ❗️ 🐹 

Shuffles the list in place using a Fisher–Yates shuffle.

❗️ 🐰🐚A⚪️🍆  callback 🍇Element➡️A🍉 ➡️ 🍨🐚A🍆

Calls callback with each element in the list and appends the returned value to the end of a new list.

❗️ 🐭  callback 🍇Element➡️👌🍉 ➡️ 🍨🐚Element🍆

Returns a new array with all elements that pass the test implemented by callback.

❓ 🐦🐚A😛🐚Element🍆🍆 🎍🥡 value A ➡️ 👌

Returns 👍 if at least one element in the list is equal to value.

❗️ 🐯  callback 🍇Element➡️👌🍉 ➡️ 👌

Tests whether all elements in the array pass the test implemented by callback.

The method immdiately returns 👎 if callback returned 👎 for one element.

❗️ 🐧  callable 🍇ElementElement➡️Element🍉 ➡️ 🍬Element

Combines all elements in this list by using the binary operation described by callable. The first argument is the result of the previous call of the callable, while the first value of the list is used as the initial value and never passed as the second argument.

❗️ 🐤🐚A⚪️🍆 🎍🥡 start A  callable 🍇AElement➡️A🍉 ➡️ A

Combines all elements in this list by using the binary operation described by callable. The first argument is the result of the previous call of the callable, with start used as the initial value passed along with the first element of the list.

🖍 ❗️ 🦔 

Reverses the list in place.

 🙌🐚A😛🐚Element🍆🍆  other 🍨🐚A🍆 ➡️ 👌

Tests whether this array and other are equal.

❗️ 🍡 ➡️ 🌳🐚Element🍆

Returns an iterator to iterate over the elements of this list.