Adds values to the start.
Array manipulation, ordering, searching, summarizing, etc.
Adds values to the start.
Removes first value.
Removes last value.
Adds values to the end.
Lazy-evaluating list of files, based on globs or regex patterns
Adds values to the end.
Adds values to the start.
Adds values to the start.
Removes last value.
Rotates values in array.
Removes first value.
Copies part of array to another.
Efficient Binary heap (priority queue, binary tree) data structure for JavaScript / TypeScript. Includes JavaScript methods, Python's heapq module methods, and Java's PriorityQueue methods.
Updates values based on map function.
Extremely fast double-ended queue implementation
Exchanges two values.
Sets value at index.
Check if a protocol requires a certain port number to be added to an URL.
Appends values from arrays.
Gets values from the right.
Keeps values which pass a test.
Picks an arbitrary permutation.