extra-array
Version:
An [array] is a collection of values, stored contiguously.<br>
487 lines (460 loc) ā¢ 24.5 kB
Markdown
An [array] is a collection of values, stored contiguously.<br>
ā
š¦ [JSR](https://jsr.io/@nodef/extra-array),
š¦ [NPM](https://www.npmjs.com/package/extra-array),
š° [Docs](https://jsr.io/@nodef/extra-array/doc).
<br>
This package includes comprehensive set of array functions with which you can
**generate** an array, **clone** it, query **about** it, get non-negative
**indices**, manage its **length**, **get/set** elements, fully or partially
**sort** it, obtain **minimum(s)/maximum(s)**, **compare** it with another
array, get a **part** of it, **search a value**, obtain all possible
**arrangements** or **random arrangements**, **find** an element, **take/drop**
elements or **scan** from its beginning or its end, **search** the index of a
part of it, perform **functional** operations, **flatten** multi-level arrays,
obtain **prefix sum**, **manipulate** it in various ways, **count/partition**
elements, **split** it, **concatenate/join** multiple arrays, **rearrange**
elements within it, or performing **set operations** upon it.
We use a consistent naming scheme that helps you quickly identify the functions
you need. All functions except `from*()` take array as 1st parameter. Some
functions operate on a specified range in the array and are called `ranged*()`,
such as `rangedPartialSort()`. Functions like `swap()` are pure and do not
modify the array itself, while functions like `swap$()` *do modify (update)* the
array itself. Some functions accept a map function for *faster comparison*, such
as `unique()`. Further, functions which return an iterable instead of an array
are prefixed with `i`, such as `isubsequences()`. We borrow some names from
other programming languages such as *Haskell*, *Python*, *Java*, and
*Processing*.
[array]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array
<br>
```javascript
// import * as xarray from "jsr:@nodef/extra-array";
var x = [1, 2, 3];
xarray.get(x, -1);
// ā 3
var x = [1, 2, 3, 4];
xarray.swap(x, 0, 1);
// ā [ 2, 1, 3, 4 ]
var x = [1, 2, 3, 4];
xarray.rotate(x, 1);
// ā [ 2, 3, 4, 1 ]
xarray.permutations([1, 2, 3]);
// ā [
// [], [ 1 ],
// [ 2 ], [ 3 ],
// [ 1, 2 ], [ 1, 3 ],
// [ 2, 1 ], [ 2, 3 ],
// [ 3, 1 ], [ 3, 2 ],
// [ 1, 2, 3 ], [ 1, 3, 2 ],
// [ 2, 1, 3 ], [ 2, 3, 1 ],
// [ 3, 1, 2 ], [ 3, 2, 1 ]
// ]
```
<br>
<br>
## Index
| Property | Description |
| ---- | ---- |
| [fromRange] | Generate array from given number range. |
| [fromInvocation] | Generate array from repeated function invocation. |
| [fromApplication] | Generate array from repeated function application. |
| [fromIterable] | Convert an iterable to array. |
| [fromIterable$] | Convert an iterable to array! |
| | |
| [shallowClone] | Shallow clone an array. |
| [deepClone] | Deep clone an array. |
| | |
| [is] | Check if value is an array. |
| [keys] | Obtain all indices. |
| [values] | Get all values. |
| [entries] | Obtain all index-value pairs. |
| | |
| [index] | Get zero-based index for an element in array. |
| [indexRange] | Get zero-based index range for part of array. |
| | |
| [isEmpty] | Check if an array is empty. |
| [length] | Find the length of an array. |
| [resize$] | Resize an array to given length! |
| [clear$] | Remove all elements from an array! |
| | |
| [get] | Get value at index. |
| [getAll] | Get values at indices. |
| [getPath] | Get value at path in a nested array. |
| [hasPath] | Check if nested array has a path. |
| [set] | Set value at index. |
| [set$] | Set value at index! |
| [setPath$] | Set value at path in a nested array! |
| [swap] | Exchange two values. |
| [swap$] | Exchange two values! |
| [swapRanges] | Exchange two ranges of values. |
| [swapRanges$] | Exchange two ranges of values! |
| [remove] | Remove value at index. |
| [remove$] | Remove value at index! |
| [removePath$] | Remove value at path in a nested array! |
| | |
| [isSorted] | Examine if array is sorted. |
| [hasUnsortedValue] | Examine if array has an unsorted value. |
| [searchUnsortedValue] | Find first index of an unsorted value. |
| [sort] | Arrange values in order. |
| [sort$] | Arrange values in order! |
| [partialSort] | Partially arrange values in order. |
| [partialSort$] | Partially arrange values in order! |
| | |
| [minimum] | Find first smallest value. |
| [minimumEntry] | Find first smallest entry. |
| [maximum] | Find first largest value. |
| [maximumEntry] | Find first largest entry. |
| [range] | Find smallest and largest values. |
| [rangeEntries] | Find smallest and largest entries. |
| [minimums] | Find smallest values. |
| [minimumEntries] | Find smallest entries. |
| [maximums] | Find largest values. |
| [maximumEntries] | Find largest entries. |
| [searchMinimumValue] | Find first index of minimum value. |
| [searchMaximumValue] | Find first index of maximum value. |
| [searchMinimumValues] | Find indices of minimum values. |
| [searchMaximumValues] | Find indices of maximum values. |
| | |
| [isEqual] | Examine if two arrays are equal. |
| [compare] | Compare two arrays (lexicographically). |
| | |
| [head] | Get first value. |
| [tail] | Get values except first. |
| [init] | Get values except last. |
| [last] | Get last value. |
| [middle] | Get values from middle. |
| [slice] | Get part of an array. |
| [slice$] | Get part of an array! |
| | |
| [includes] | Check if array has a value. |
| [hasValue] | Examine if array has a value. |
| [searchValue] | Find first index of a value. |
| [searchValueRight] | Find last index of a value. |
| [searchValueAll] | Find indices of value. |
| [searchAdjacentDuplicateValue] | Find first index of an adjacent duplicate value. |
| [searchMismatchedValue] | Find first index where two arrays differ. |
| | |
| [hasPrefix] | Examine if array starts with a prefix. |
| [hasSuffix] | Examine if array ends with a suffix. |
| [hasInfix] | Examine if array contains an infix. |
| [hasSubsequence] | Examine if array has a subsequence. |
| [hasPermutation] | Examine if array has a permutation. |
| [prefixes] | Obtain all possible prefixes. |
| [suffixes] | Obtain all possible suffixes. |
| [infixes] | Obtain all possible infixes. |
| [subsequences] | Obtain all possible subsequences. |
| [permutations] | Obtain all possible permutations. |
| [searchInfix] | Find first index of an infix. |
| [searchInfixRight] | Find last index of an infix. |
| [searchInfixAll] | Find indices of an infix. |
| [searchSubsequence] | Find first index of a subsequence. |
| | |
| [randomValue] | Pick an arbitrary value. |
| [randomPrefix] | Pick an arbitrary prefix. |
| [randomSuffix] | Pick an arbitrary suffix. |
| [randomInfix] | Pick an arbitrary infix. |
| [randomSubsequence] | Pick an arbitrary subsequence. |
| [randomPermutation] | Pick an arbitrary permutation. |
| [randomPermutation$] | Pick an arbitrary permutation! |
| | |
| [find] | Find first value passing a test. |
| [findRight] | Find last value passing a test. |
| | |
| [take] | Keep first n values only. |
| [takeRight] | Keep last n values only. |
| [takeWhile] | Keep values from left, while a test passes. |
| [takeWhileRight] | Keep values from right, while a test passes. |
| [drop] | Discard first n values only. |
| [dropRight] | Discard last n values only. |
| [dropWhile] | Discard values from left, while a test passes. |
| [dropWhileRight] | Discard values from right, while a test passes. |
| | |
| [scanWhile] | Scan from left, while a test passes. |
| [scanWhileRight] | Scan from right, while a test passes. |
| [scanUntil] | Scan from left, until a test passes. |
| [scanUntilRight] | Scan from right, until a test passes. |
| | |
| [indexOf] | Find first index of a value. |
| [lastIndexOf] | Find last index of a value. |
| [search] | Find index of first value passing a test. |
| [searchRight] | Find index of last value passing a test. |
| [searchAll] | Find indices of values passing a test. |
| | |
| [forEach] | Call a function for each value. |
| [some] | Examine if any value satisfies a test. |
| [every] | Examine if all values satisfy a test. |
| [map] | Transform values of an array. |
| [map$] | Transform values of an array! |
| [reduce] | Reduce values of array to a single value. |
| [reduceRight] | Reduce values from right, to a single value. |
| [filter] | Keep values which pass a test. |
| [filter$] | Keep values which pass a test! |
| [filterAt] | Keep values at given indices. |
| [reject] | Discard values which pass a test. |
| [reject$] | Discard values which pass a test! |
| [rejectAt] | Discard values at given indices. |
| | |
| [flat] | Flatten nested array to given depth. |
| [flatMap] | Flatten nested array, based on map function. |
| | |
| [exclusiveScan] | Perform exclusive prefix scan from left to right. |
| [exclusiveScan$] | Perform exclusive prefix scan from left to right! |
| [inclusiveScan] | Perform inclusive prefix scan from left to right. |
| [inclusiveScan$] | Perform inclusive prefix scan from left to right! |
| [adjacentCombine] | Combine adjacent values of an array. |
| [adjacentCombine$] | Combine adjacent values of an array! |
| | |
| [intersperse] | Place a separator between every value. |
| [interpolate] | Estimate new values between existing ones. |
| [intermix] | Place values of an array between another. |
| [interleave] | Place values from iterables alternately. |
| [zip] | Combine values from arrays. |
| | |
| [fill] | Fill with given value. |
| [fill$] | Fill with given value! |
| [push] | Add value to the end. |
| [push$] | Add values to the end! |
| [pop] | Remove last value. |
| [pop$] | Remove last value! |
| [shift] | Remove first value. |
| [shift$] | Remove first value! |
| [unshift] | Add values to the start. |
| [unshift$] | Add values to the start! |
| [copy] | Copy part of array to another. |
| [copy$] | Copy part of array to another! |
| [copyWithin] | Copy part of array within. |
| [copyWithin$] | Copy part of array within! |
| [moveWithin] | Move part of array within. |
| [moveWithin$] | Move part of array within! |
| [splice] | Remove or replace existing values. |
| [splice$] | Remove or replace existing values! |
| | |
| [count] | Count values which satisfy a test. |
| [countEach] | Count occurrences of each distinct value. |
| [partition] | Segregate values by test result. |
| [partitionEach] | Segregate each distinct value. |
| | |
| [split] | Break array considering test as separator. |
| [splitAt] | Break array considering indices as separator. |
| [cut] | Break array when test passes. |
| [cutRight] | Break array after test passes. |
| [cutAt] | Break array at given indices. |
| [cutAtRight] | Break array after given indices. |
| [group] | Keep similar values together and in order. |
| [chunk] | Break array into chunks of given size. |
| | |
| [concat] | Append values from arrays. |
| [concat$] | Append values from arrays! |
| [join] | Join values together into a string. |
| | |
| [cycle] | Obtain values that cycle through array. |
| [repeat] | Repeat an array given times. |
| [reverse] | Reverse the values. |
| [reverse$] | Reverse the values! |
| [rotate] | Rotate values in array. |
| [rotate$] | Rotate values in array! |
| | |
| [isUnique] | Examine if there are no duplicate values. |
| [isDisjoint] | Examine if arrays have no value in common. |
| [unique] | Remove duplicate values. |
| [union] | Obtain values present in any array. |
| [union$] | Obtain values present in any array! |
| [intersection] | Obtain values present in both arrays. |
| [difference] | Obtain values not present in another array. |
| [symmetricDifference] | Obtain values not present in both arrays. |
| [cartesianProduct] | Obtain cartesian product of arrays. |
<br>
<br>
## References
- [Prefix sum array and difference array : Woburn C.I. PEGWiki](https://wcipeg.com/wiki/Prefix_sum_array_and_difference_array)
- [How to get the count of each distinct value in a column?](https://stackoverflow.com/q/7053902/1413259)
- [How to add region in java script file, visual studio](https://stackoverflow.com/a/51550649/1413259)
- [Operator precedence - JavaScript : MDN Web Docs](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Operator_precedence)
- [numpy.partition - NumPy Manual](https://numpy.org/doc/stable/reference/generated/numpy.partition.html)
<br>
<br>
[](https://wolfram77.github.io)<br>
[](https://nodef.github.io)
[fromRange]: https://jsr.io/@nodef/extra-version/doc/~/fromRange
[fromInvocation]: https://jsr.io/@nodef/extra-version/doc/~/fromInvocation
[fromApplication]: https://jsr.io/@nodef/extra-version/doc/~/fromApplication
[fromIterable]: https://jsr.io/@nodef/extra-version/doc/~/fromIterable
[fromIterable$]: https://jsr.io/@nodef/extra-version/doc/~/fromIterable$
[shallowClone]: https://jsr.io/@nodef/extra-version/doc/~/shallowClone
[deepClone]: https://jsr.io/@nodef/extra-version/doc/~/deepClone
[is]: https://jsr.io/@nodef/extra-version/doc/~/is
[keys]: https://jsr.io/@nodef/extra-version/doc/~/keys
[values]: https://jsr.io/@nodef/extra-version/doc/~/values
[entries]: https://jsr.io/@nodef/extra-version/doc/~/entries
[index]: https://jsr.io/@nodef/extra-version/doc/~/index
[indexRange]: https://jsr.io/@nodef/extra-version/doc/~/indexRange
[isEmpty]: https://jsr.io/@nodef/extra-version/doc/~/isEmpty
[length]: https://jsr.io/@nodef/extra-version/doc/~/length
[resize$]: https://jsr.io/@nodef/extra-version/doc/~/resize$
[clear$]: https://jsr.io/@nodef/extra-version/doc/~/clear$
[get]: https://jsr.io/@nodef/extra-version/doc/~/get
[getAll]: https://jsr.io/@nodef/extra-version/doc/~/getAll
[getPath]: https://jsr.io/@nodef/extra-version/doc/~/getPath
[hasPath]: https://jsr.io/@nodef/extra-version/doc/~/hasPath
[set]: https://jsr.io/@nodef/extra-version/doc/~/set
[set$]: https://jsr.io/@nodef/extra-version/doc/~/set$
[setPath$]: https://jsr.io/@nodef/extra-version/doc/~/setPath$
[swap]: https://jsr.io/@nodef/extra-version/doc/~/swap
[swap$]: https://jsr.io/@nodef/extra-version/doc/~/swap$
[swapRanges]: https://jsr.io/@nodef/extra-version/doc/~/swapRanges
[swapRanges$]: https://jsr.io/@nodef/extra-version/doc/~/swapRanges$
[remove]: https://jsr.io/@nodef/extra-version/doc/~/remove
[remove$]: https://jsr.io/@nodef/extra-version/doc/~/remove$
[removePath$]: https://jsr.io/@nodef/extra-version/doc/~/removePath$
[isSorted]: https://jsr.io/@nodef/extra-version/doc/~/isSorted
[hasUnsortedValue]: https://jsr.io/@nodef/extra-version/doc/~/hasUnsortedValue
[searchUnsortedValue]: https://jsr.io/@nodef/extra-version/doc/~/searchUnsortedValue
[sort]: https://jsr.io/@nodef/extra-version/doc/~/sort
[sort$]: https://jsr.io/@nodef/extra-version/doc/~/sort$
[partialSort]: https://jsr.io/@nodef/extra-version/doc/~/partialSort
[partialSort$]: https://jsr.io/@nodef/extra-version/doc/~/partialSort$
[minimum]: https://jsr.io/@nodef/extra-version/doc/~/minimum
[minimumEntry]: https://jsr.io/@nodef/extra-version/doc/~/minimumEntry
[maximum]: https://jsr.io/@nodef/extra-version/doc/~/maximum
[maximumEntry]: https://jsr.io/@nodef/extra-version/doc/~/maximumEntry
[range]: https://jsr.io/@nodef/extra-version/doc/~/range
[rangeEntries]: https://jsr.io/@nodef/extra-version/doc/~/rangeEntries
[minimums]: https://jsr.io/@nodef/extra-version/doc/~/minimums
[minimumEntries]: https://jsr.io/@nodef/extra-version/doc/~/minimumEntries
[maximums]: https://jsr.io/@nodef/extra-version/doc/~/maximums
[maximumEntries]: https://jsr.io/@nodef/extra-version/doc/~/maximumEntries
[searchMinimumValue]: https://jsr.io/@nodef/extra-version/doc/~/searchMinimumValue
[searchMaximumValue]: https://jsr.io/@nodef/extra-version/doc/~/searchMaximumValue
[searchMinimumValues]: https://jsr.io/@nodef/extra-version/doc/~/searchMinimumValues
[searchMaximumValues]: https://jsr.io/@nodef/extra-version/doc/~/searchMaximumValues
[isEqual]: https://jsr.io/@nodef/extra-version/doc/~/isEqual
[compare]: https://jsr.io/@nodef/extra-version/doc/~/compare
[head]: https://jsr.io/@nodef/extra-version/doc/~/head
[tail]: https://jsr.io/@nodef/extra-version/doc/~/tail
[init]: https://jsr.io/@nodef/extra-version/doc/~/init
[last]: https://jsr.io/@nodef/extra-version/doc/~/last
[middle]: https://jsr.io/@nodef/extra-version/doc/~/middle
[slice]: https://jsr.io/@nodef/extra-version/doc/~/slice
[slice$]: https://jsr.io/@nodef/extra-version/doc/~/slice$
[includes]: https://jsr.io/@nodef/extra-version/doc/~/includes
[hasValue]: https://jsr.io/@nodef/extra-version/doc/~/hasValue
[searchValue]: https://jsr.io/@nodef/extra-version/doc/~/searchValue
[searchValueRight]: https://jsr.io/@nodef/extra-version/doc/~/searchValueRight
[searchValueAll]: https://jsr.io/@nodef/extra-version/doc/~/searchValueAll
[searchAdjacentDuplicateValue]: https://jsr.io/@nodef/extra-version/doc/~/searchAdjacentDuplicateValue
[searchMismatchedValue]: https://jsr.io/@nodef/extra-version/doc/~/searchMismatchedValue
[hasPrefix]: https://jsr.io/@nodef/extra-version/doc/~/hasPrefix
[hasSuffix]: https://jsr.io/@nodef/extra-version/doc/~/hasSuffix
[hasInfix]: https://jsr.io/@nodef/extra-version/doc/~/hasInfix
[hasSubsequence]: https://jsr.io/@nodef/extra-version/doc/~/hasSubsequence
[hasPermutation]: https://jsr.io/@nodef/extra-version/doc/~/hasPermutation
[prefixes]: https://jsr.io/@nodef/extra-version/doc/~/prefixes
[suffixes]: https://jsr.io/@nodef/extra-version/doc/~/suffixes
[infixes]: https://jsr.io/@nodef/extra-version/doc/~/infixes
[subsequences]: https://jsr.io/@nodef/extra-version/doc/~/subsequences
[permutations]: https://jsr.io/@nodef/extra-version/doc/~/permutations
[searchInfix]: https://jsr.io/@nodef/extra-version/doc/~/searchInfix
[searchInfixRight]: https://jsr.io/@nodef/extra-version/doc/~/searchInfixRight
[searchInfixAll]: https://jsr.io/@nodef/extra-version/doc/~/searchInfixAll
[searchSubsequence]: https://jsr.io/@nodef/extra-version/doc/~/searchSubsequence
[randomValue]: https://jsr.io/@nodef/extra-version/doc/~/randomValue
[randomPrefix]: https://jsr.io/@nodef/extra-version/doc/~/randomPrefix
[randomSuffix]: https://jsr.io/@nodef/extra-version/doc/~/randomSuffix
[randomInfix]: https://jsr.io/@nodef/extra-version/doc/~/randomInfix
[randomSubsequence]: https://jsr.io/@nodef/extra-version/doc/~/randomSubsequence
[randomPermutation]: https://jsr.io/@nodef/extra-version/doc/~/randomPermutation
[randomPermutation$]: https://jsr.io/@nodef/extra-version/doc/~/randomPermutation$
[find]: https://jsr.io/@nodef/extra-version/doc/~/find
[findRight]: https://jsr.io/@nodef/extra-version/doc/~/findRight
[take]: https://jsr.io/@nodef/extra-version/doc/~/take
[takeRight]: https://jsr.io/@nodef/extra-version/doc/~/takeRight
[takeWhile]: https://jsr.io/@nodef/extra-version/doc/~/takeWhile
[takeWhileRight]: https://jsr.io/@nodef/extra-version/doc/~/takeWhileRight
[drop]: https://jsr.io/@nodef/extra-version/doc/~/drop
[dropRight]: https://jsr.io/@nodef/extra-version/doc/~/dropRight
[dropWhile]: https://jsr.io/@nodef/extra-version/doc/~/dropWhile
[dropWhileRight]: https://jsr.io/@nodef/extra-version/doc/~/dropWhileRight
[scanWhile]: https://jsr.io/@nodef/extra-version/doc/~/scanWhile
[scanWhileRight]: https://jsr.io/@nodef/extra-version/doc/~/scanWhileRight
[scanUntil]: https://jsr.io/@nodef/extra-version/doc/~/scanUntil
[scanUntilRight]: https://jsr.io/@nodef/extra-version/doc/~/scanUntilRight
[indexOf]: https://jsr.io/@nodef/extra-version/doc/~/indexOf
[lastIndexOf]: https://jsr.io/@nodef/extra-version/doc/~/lastIndexOf
[search]: https://jsr.io/@nodef/extra-version/doc/~/search
[searchRight]: https://jsr.io/@nodef/extra-version/doc/~/searchRight
[searchAll]: https://jsr.io/@nodef/extra-version/doc/~/searchAll
[forEach]: https://jsr.io/@nodef/extra-version/doc/~/forEach
[some]: https://jsr.io/@nodef/extra-version/doc/~/some
[every]: https://jsr.io/@nodef/extra-version/doc/~/every
[map]: https://jsr.io/@nodef/extra-version/doc/~/map
[map$]: https://jsr.io/@nodef/extra-version/doc/~/map$
[reduce]: https://jsr.io/@nodef/extra-version/doc/~/reduce
[reduceRight]: https://jsr.io/@nodef/extra-version/doc/~/reduceRight
[filter]: https://jsr.io/@nodef/extra-version/doc/~/filter
[filter$]: https://jsr.io/@nodef/extra-version/doc/~/filter$
[filterAt]: https://jsr.io/@nodef/extra-version/doc/~/filterAt
[reject]: https://jsr.io/@nodef/extra-version/doc/~/reject
[reject$]: https://jsr.io/@nodef/extra-version/doc/~/reject$
[rejectAt]: https://jsr.io/@nodef/extra-version/doc/~/rejectAt
[flat]: https://jsr.io/@nodef/extra-version/doc/~/flat
[flatMap]: https://jsr.io/@nodef/extra-version/doc/~/flatMap
[exclusiveScan]: https://jsr.io/@nodef/extra-version/doc/~/exclusiveScan
[exclusiveScan$]: https://jsr.io/@nodef/extra-version/doc/~/exclusiveScan$
[inclusiveScan]: https://jsr.io/@nodef/extra-version/doc/~/inclusiveScan
[inclusiveScan$]: https://jsr.io/@nodef/extra-version/doc/~/inclusiveScan$
[adjacentCombine]: https://jsr.io/@nodef/extra-version/doc/~/adjacentCombine
[adjacentCombine$]: https://jsr.io/@nodef/extra-version/doc/~/adjacentCombine$
[intersperse]: https://jsr.io/@nodef/extra-version/doc/~/intersperse
[interpolate]: https://jsr.io/@nodef/extra-version/doc/~/interpolate
[intermix]: https://jsr.io/@nodef/extra-version/doc/~/intermix
[interleave]: https://jsr.io/@nodef/extra-version/doc/~/interleave
[zip]: https://jsr.io/@nodef/extra-version/doc/~/zip
[fill]: https://jsr.io/@nodef/extra-version/doc/~/fill
[fill$]: https://jsr.io/@nodef/extra-version/doc/~/fill$
[push]: https://jsr.io/@nodef/extra-version/doc/~/push
[push$]: https://jsr.io/@nodef/extra-version/doc/~/push$
[pop]: https://jsr.io/@nodef/extra-version/doc/~/pop
[pop$]: https://jsr.io/@nodef/extra-version/doc/~/pop$
[shift]: https://jsr.io/@nodef/extra-version/doc/~/shift
[shift$]: https://jsr.io/@nodef/extra-version/doc/~/shift$
[unshift]: https://jsr.io/@nodef/extra-version/doc/~/unshift
[unshift$]: https://jsr.io/@nodef/extra-version/doc/~/unshift$
[copy]: https://jsr.io/@nodef/extra-version/doc/~/copy
[copy$]: https://jsr.io/@nodef/extra-version/doc/~/copy$
[copyWithin]: https://jsr.io/@nodef/extra-version/doc/~/copyWithin
[copyWithin$]: https://jsr.io/@nodef/extra-version/doc/~/copyWithin$
[moveWithin]: https://jsr.io/@nodef/extra-version/doc/~/moveWithin
[moveWithin$]: https://jsr.io/@nodef/extra-version/doc/~/moveWithin$
[splice]: https://jsr.io/@nodef/extra-version/doc/~/splice
[splice$]: https://jsr.io/@nodef/extra-version/doc/~/splice$
[count]: https://jsr.io/@nodef/extra-version/doc/~/count
[countEach]: https://jsr.io/@nodef/extra-version/doc/~/countEach
[partition]: https://jsr.io/@nodef/extra-version/doc/~/partition
[partitionEach]: https://jsr.io/@nodef/extra-version/doc/~/partitionEach
[split]: https://jsr.io/@nodef/extra-version/doc/~/split
[splitAt]: https://jsr.io/@nodef/extra-version/doc/~/splitAt
[cut]: https://jsr.io/@nodef/extra-version/doc/~/cut
[cutRight]: https://jsr.io/@nodef/extra-version/doc/~/cutRight
[cutAt]: https://jsr.io/@nodef/extra-version/doc/~/cutAt
[cutAtRight]: https://jsr.io/@nodef/extra-version/doc/~/cutAtRight
[group]: https://jsr.io/@nodef/extra-version/doc/~/group
[chunk]: https://jsr.io/@nodef/extra-version/doc/~/chunk
[concat]: https://jsr.io/@nodef/extra-version/doc/~/concat
[concat$]: https://jsr.io/@nodef/extra-version/doc/~/concat$
[join]: https://jsr.io/@nodef/extra-version/doc/~/join
[cycle]: https://jsr.io/@nodef/extra-version/doc/~/cycle
[repeat]: https://jsr.io/@nodef/extra-version/doc/~/repeat
[reverse]: https://jsr.io/@nodef/extra-version/doc/~/reverse
[reverse$]: https://jsr.io/@nodef/extra-version/doc/~/reverse$
[rotate]: https://jsr.io/@nodef/extra-version/doc/~/rotate
[rotate$]: https://jsr.io/@nodef/extra-version/doc/~/rotate$
[isUnique]: https://jsr.io/@nodef/extra-version/doc/~/isUnique
[isDisjoint]: https://jsr.io/@nodef/extra-version/doc/~/isDisjoint
[unique]: https://jsr.io/@nodef/extra-version/doc/~/unique
[union]: https://jsr.io/@nodef/extra-version/doc/~/union
[union$]: https://jsr.io/@nodef/extra-version/doc/~/union$
[intersection]: https://jsr.io/@nodef/extra-version/doc/~/intersection
[difference]: https://jsr.io/@nodef/extra-version/doc/~/difference
[symmetricDifference]: https://jsr.io/@nodef/extra-version/doc/~/symmetricDifference
[cartesianProduct]: https://jsr.io/@nodef/extra-version/doc/~/cartesianProduct