@nodef/extra-array.web 0.0.0-stage → 4.5.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/LICENSE +21 -0
- package/README.md +611 -2
- package/deno.lock +54 -0
- package/index.d.ts +1421 -0
- package/index.js +2 -0
- package/index.js.map +7 -0
- package/index.test.ts +2054 -0
- package/package.json +13 -3
package/LICENSE
ADDED
|
@@ -0,0 +1,21 @@
|
|
|
1
|
+
MIT License
|
|
2
|
+
|
|
3
|
+
Copyright (c) 2018-26 Subhajit Sahu
|
|
4
|
+
|
|
5
|
+
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
6
|
+
of this software and associated documentation files (the "Software"), to deal
|
|
7
|
+
in the Software without restriction, including without limitation the rights
|
|
8
|
+
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
9
|
+
copies of the Software, and to permit persons to whom the Software is
|
|
10
|
+
furnished to do so, subject to the following conditions:
|
|
11
|
+
|
|
12
|
+
The above copyright notice and this permission notice shall be included in all
|
|
13
|
+
copies or substantial portions of the Software.
|
|
14
|
+
|
|
15
|
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
16
|
+
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
17
|
+
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
18
|
+
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
19
|
+
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
20
|
+
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
21
|
+
SOFTWARE.
|
package/README.md
CHANGED
|
@@ -1,3 +1,612 @@
|
|
|
1
|
-
|
|
1
|
+
A collection of array functions that complement JavaScript's built-in [Array`][array] methods.
|
|
2
2
|
|
|
3
|
-
|
|
3
|
+
▌
|
|
4
|
+
📦 [JSR](https://jsr.io/@nodef/extra-array),
|
|
5
|
+
📦 [NPM](https://www.npmjs.com/package/@nodef/extra-array),
|
|
6
|
+
🌐 [Web](https://cdn.jsdelivr.net/npm/@nodef/extra-array.web),
|
|
7
|
+
📰 [Docs](https://jsr.io/@nodef/extra-array/doc).
|
|
8
|
+
|
|
9
|
+
This package provides a **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 perform **set operations** upon it.
|
|
10
|
+
|
|
11
|
+
Following a consistent naming convention, **all functions except `from*()` take the array as the 1st parameter**. Some functions operate on a specified *range* in the array and are named `ranged*()` (such as `rangedPartialSort()`). Functions like [swap] are **pure** and do not modify the array, while functions like [swap$] **do modify (update)** the array itself — the `$` suffix marks mutation. 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]). Some names are borrowed from other languages such as *Haskell*, *Python*, *Java*, and *Processing*.
|
|
12
|
+
|
|
13
|
+
The additions cover:
|
|
14
|
+
|
|
15
|
+
- **Generation**: [fromRange], [fromInvocation], [fromApplication], [fromIterable].
|
|
16
|
+
- **Cloning**: [shallowClone], [deepClone].
|
|
17
|
+
- **Inspection**: [is], [keys], [values], [entries].
|
|
18
|
+
- **Access**: [get], [set], [getPath], [swap], [remove] and their mutating `$` variants.
|
|
19
|
+
- **Ordering**: [sort], [partialSort], [isSorted], [minimum], [maximum], [range].
|
|
20
|
+
- **Selection**: [head], [tail], [slice], [take], [drop], [scanWhile].
|
|
21
|
+
- **Search**: [searchValue], [searchInfix], [searchSubsequence], [indexOf], [search].
|
|
22
|
+
- **Transformation**: [map], [filter], [flat], [exclusiveScan], [adjacentCombine].
|
|
23
|
+
- **Manipulation**: [fill], [push], [splice], [copyWithin], [rotate].
|
|
24
|
+
- **Partitioning**: [count], [partition], [split], [cutAt], [chunk].
|
|
25
|
+
- **Combination**: [concat], [zip], [interleave], [cartesianProduct].
|
|
26
|
+
- **Set operations**: [unique], [union], [intersection], [difference], [symmetricDifference].
|
|
27
|
+
|
|
28
|
+
[array]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array
|
|
29
|
+
|
|
30
|
+
<br>
|
|
31
|
+
|
|
32
|
+
```javascript
|
|
33
|
+
import * as xarray from "jsr:@nodef/extra-array";
|
|
34
|
+
|
|
35
|
+
|
|
36
|
+
// 1. Get value at an index (supports negative indices).
|
|
37
|
+
const a = [1, 2, 3];
|
|
38
|
+
xarray.get(a, -1);
|
|
39
|
+
// → 3
|
|
40
|
+
|
|
41
|
+
|
|
42
|
+
// 2. Swap two values (pure, does not modify the array).
|
|
43
|
+
xarray.swap([1, 2, 3, 4], 0, 1);
|
|
44
|
+
// → [ 2, 1, 3, 4 ]
|
|
45
|
+
|
|
46
|
+
|
|
47
|
+
// 3. Rotate values (pure).
|
|
48
|
+
xarray.rotate([1, 2, 3, 4], 1);
|
|
49
|
+
// → [ 2, 3, 4, 1 ]
|
|
50
|
+
|
|
51
|
+
|
|
52
|
+
// 4. Obtain all possible arrangements.
|
|
53
|
+
xarray.permutations([1, 2, 3]);
|
|
54
|
+
// → [
|
|
55
|
+
// [], [ 1 ],
|
|
56
|
+
// [ 2 ], [ 3 ],
|
|
57
|
+
// [ 1, 2 ], [ 1, 3 ],
|
|
58
|
+
// [ 2, 1 ], [ 2, 3 ],
|
|
59
|
+
// [ 3, 1 ], [ 3, 2 ],
|
|
60
|
+
// [ 1, 2, 3 ], [ 1, 3, 2 ],
|
|
61
|
+
// [ 2, 1, 3 ], [ 2, 3, 1 ],
|
|
62
|
+
// [ 3, 1, 2 ], [ 3, 2, 1 ]
|
|
63
|
+
// ]
|
|
64
|
+
```
|
|
65
|
+
|
|
66
|
+
<br>
|
|
67
|
+
<br>
|
|
68
|
+
|
|
69
|
+
|
|
70
|
+
## Index
|
|
71
|
+
|
|
72
|
+
### Generation
|
|
73
|
+
|
|
74
|
+
| Property | Description |
|
|
75
|
+
| ---- | ---- |
|
|
76
|
+
| [fromRange] | Generate array from given number range. |
|
|
77
|
+
| [fromInvocation] | Generate array from repeated function invocation. |
|
|
78
|
+
| [fromApplication] | Generate array from repeated function application. |
|
|
79
|
+
| [fromIterable] | Convert an iterable to array. |
|
|
80
|
+
| [fromIterable$] | Convert an iterable to array! |
|
|
81
|
+
|
|
82
|
+
### Cloning
|
|
83
|
+
|
|
84
|
+
| Property | Description |
|
|
85
|
+
| ---- | ---- |
|
|
86
|
+
| [shallowClone] | Shallow clone an array. |
|
|
87
|
+
| [deepClone] | Deep clone an array. |
|
|
88
|
+
|
|
89
|
+
### Inspection
|
|
90
|
+
|
|
91
|
+
| Property | Description |
|
|
92
|
+
| ---- | ---- |
|
|
93
|
+
| [is] | Check if value is an array. |
|
|
94
|
+
| [keys] | Obtain all indices. |
|
|
95
|
+
| [values] | Get all values. |
|
|
96
|
+
| [entries] | Obtain all index-value pairs. |
|
|
97
|
+
|
|
98
|
+
### Indices
|
|
99
|
+
|
|
100
|
+
| Property | Description |
|
|
101
|
+
| ---- | ---- |
|
|
102
|
+
| [index] | Get zero-based index for an element in array. |
|
|
103
|
+
| [indexRange] | Get zero-based index range for part of array. |
|
|
104
|
+
|
|
105
|
+
### Length
|
|
106
|
+
|
|
107
|
+
| Property | Description |
|
|
108
|
+
| ---- | ---- |
|
|
109
|
+
| [isEmpty] | Check if an array is empty. |
|
|
110
|
+
| [length] | Find the length of an array. |
|
|
111
|
+
| [resize$] | Resize an array to given length! |
|
|
112
|
+
| [clear$] | Remove all elements from an array! |
|
|
113
|
+
|
|
114
|
+
### Get/Set
|
|
115
|
+
|
|
116
|
+
| Property | Description |
|
|
117
|
+
| ---- | ---- |
|
|
118
|
+
| [get] | Get value at index. |
|
|
119
|
+
| [getAll] | Get values at indices. |
|
|
120
|
+
| [getPath] | Get value at path in a nested array. |
|
|
121
|
+
| [hasPath] | Check if nested array has a path. |
|
|
122
|
+
| [set] | Set value at index. |
|
|
123
|
+
| [set$] | Set value at index! |
|
|
124
|
+
| [setPath$] | Set value at path in a nested array! |
|
|
125
|
+
| [swap] | Exchange two values. |
|
|
126
|
+
| [swap$] | Exchange two values! |
|
|
127
|
+
| [swapRanges] | Exchange two ranges of values. |
|
|
128
|
+
| [swapRanges$] | Exchange two ranges of values! |
|
|
129
|
+
| [remove] | Remove value at index. |
|
|
130
|
+
| [remove$] | Remove value at index! |
|
|
131
|
+
| [removePath$] | Remove value at path in a nested array! |
|
|
132
|
+
|
|
133
|
+
### Sorting
|
|
134
|
+
|
|
135
|
+
| Property | Description |
|
|
136
|
+
| ---- | ---- |
|
|
137
|
+
| [isSorted] | Examine if array is sorted. |
|
|
138
|
+
| [hasUnsortedValue] | Examine if array has an unsorted value. |
|
|
139
|
+
| [searchUnsortedValue] | Find first index of an unsorted value. |
|
|
140
|
+
| [sort] | Arrange values in order. |
|
|
141
|
+
| [sort$] | Arrange values in order! |
|
|
142
|
+
| [partialSort] | Partially arrange values in order. |
|
|
143
|
+
| [partialSort$] | Partially arrange values in order! |
|
|
144
|
+
|
|
145
|
+
### Minimum/Maximum
|
|
146
|
+
|
|
147
|
+
| Property | Description |
|
|
148
|
+
| ---- | ---- |
|
|
149
|
+
| [minimum] | Find first smallest value. |
|
|
150
|
+
| [minimumEntry] | Find first smallest entry. |
|
|
151
|
+
| [maximum] | Find first largest value. |
|
|
152
|
+
| [maximumEntry] | Find first largest entry. |
|
|
153
|
+
| [range] | Find smallest and largest values. |
|
|
154
|
+
| [rangeEntries] | Find smallest and largest entries. |
|
|
155
|
+
| [minimums] | Find smallest values. |
|
|
156
|
+
| [minimumEntries] | Find smallest entries. |
|
|
157
|
+
| [maximums] | Find largest values. |
|
|
158
|
+
| [maximumEntries] | Find largest entries. |
|
|
159
|
+
| [searchMinimumValue] | Find first index of minimum value. |
|
|
160
|
+
| [searchMaximumValue] | Find first index of maximum value. |
|
|
161
|
+
| [searchMinimumValues] | Find indices of minimum values. |
|
|
162
|
+
| [searchMaximumValues] | Find indices of maximum values. |
|
|
163
|
+
|
|
164
|
+
### Comparison
|
|
165
|
+
|
|
166
|
+
| Property | Description |
|
|
167
|
+
| ---- | ---- |
|
|
168
|
+
| [isEqual] | Examine if two arrays are equal. |
|
|
169
|
+
| [compare] | Compare two arrays (lexicographically). |
|
|
170
|
+
|
|
171
|
+
### Parts
|
|
172
|
+
|
|
173
|
+
| Property | Description |
|
|
174
|
+
| ---- | ---- |
|
|
175
|
+
| [head] | Get first value. |
|
|
176
|
+
| [tail] | Get values except first. |
|
|
177
|
+
| [init] | Get values except last. |
|
|
178
|
+
| [last] | Get last value. |
|
|
179
|
+
| [middle] | Get values from middle. |
|
|
180
|
+
| [slice] | Get part of an array. |
|
|
181
|
+
| [slice$] | Get part of an array! |
|
|
182
|
+
|
|
183
|
+
### Search
|
|
184
|
+
|
|
185
|
+
| Property | Description |
|
|
186
|
+
| ---- | ---- |
|
|
187
|
+
| [includes] | Check if array has a value. |
|
|
188
|
+
| [hasValue] | Examine if array has a value. |
|
|
189
|
+
| [searchValue] | Find first index of a value. |
|
|
190
|
+
| [searchValueRight] | Find last index of a value. |
|
|
191
|
+
| [searchValueAll] | Find indices of value. |
|
|
192
|
+
| [searchAdjacentDuplicateValue] | Find first index of an adjacent duplicate value. |
|
|
193
|
+
| [searchMismatchedValue] | Find first index where two arrays differ. |
|
|
194
|
+
|
|
195
|
+
### Contains
|
|
196
|
+
|
|
197
|
+
| Property | Description |
|
|
198
|
+
| ---- | ---- |
|
|
199
|
+
| [hasPrefix] | Examine if array starts with a prefix. |
|
|
200
|
+
| [hasSuffix] | Examine if array ends with a suffix. |
|
|
201
|
+
| [hasInfix] | Examine if array contains an infix. |
|
|
202
|
+
| [hasSubsequence] | Examine if array has a subsequence. |
|
|
203
|
+
| [hasPermutation] | Examine if array has a permutation. |
|
|
204
|
+
| [prefixes] | Obtain all possible prefixes. |
|
|
205
|
+
| [suffixes] | Obtain all possible suffixes. |
|
|
206
|
+
| [infixes] | Obtain all possible infixes. |
|
|
207
|
+
| [subsequences] | Obtain all possible subsequences. |
|
|
208
|
+
| [permutations] | Obtain all possible permutations. |
|
|
209
|
+
| [searchInfix] | Find first index of an infix. |
|
|
210
|
+
| [searchInfixRight] | Find last index of an infix. |
|
|
211
|
+
| [searchInfixAll] | Find indices of an infix. |
|
|
212
|
+
| [searchSubsequence] | Find first index of a subsequence. |
|
|
213
|
+
|
|
214
|
+
### Random
|
|
215
|
+
|
|
216
|
+
| Property | Description |
|
|
217
|
+
| ---- | ---- |
|
|
218
|
+
| [randomValue] | Pick an arbitrary value. |
|
|
219
|
+
| [randomPrefix] | Pick an arbitrary prefix. |
|
|
220
|
+
| [randomSuffix] | Pick an arbitrary suffix. |
|
|
221
|
+
| [randomInfix] | Pick an arbitrary infix. |
|
|
222
|
+
| [randomSubsequence] | Pick an arbitrary subsequence. |
|
|
223
|
+
| [randomPermutation] | Pick an arbitrary permutation. |
|
|
224
|
+
| [randomPermutation$] | Pick an arbitrary permutation! |
|
|
225
|
+
|
|
226
|
+
### Find
|
|
227
|
+
|
|
228
|
+
| Property | Description |
|
|
229
|
+
| ---- | ---- |
|
|
230
|
+
| [find] | Find first value passing a test. |
|
|
231
|
+
| [findRight] | Find last value passing a test. |
|
|
232
|
+
|
|
233
|
+
### Take/Drop
|
|
234
|
+
|
|
235
|
+
| Property | Description |
|
|
236
|
+
| ---- | ---- |
|
|
237
|
+
| [take] | Keep first n values only. |
|
|
238
|
+
| [takeRight] | Keep last n values only. |
|
|
239
|
+
| [takeWhile] | Keep values from left, while a test passes. |
|
|
240
|
+
| [takeWhileRight] | Keep values from right, while a test passes. |
|
|
241
|
+
| [drop] | Discard first n values only. |
|
|
242
|
+
| [dropRight] | Discard last n values only. |
|
|
243
|
+
| [dropWhile] | Discard values from left, while a test passes. |
|
|
244
|
+
| [dropWhileRight] | Discard values from right, while a test passes. |
|
|
245
|
+
|
|
246
|
+
### Scan
|
|
247
|
+
|
|
248
|
+
| Property | Description |
|
|
249
|
+
| ---- | ---- |
|
|
250
|
+
| [scanWhile] | Scan from left, while a test passes. |
|
|
251
|
+
| [scanWhileRight] | Scan from right, while a test passes. |
|
|
252
|
+
| [scanUntil] | Scan from left, until a test passes. |
|
|
253
|
+
| [scanUntilRight] | Scan from right, until a test passes. |
|
|
254
|
+
|
|
255
|
+
### Search Indices
|
|
256
|
+
|
|
257
|
+
| Property | Description |
|
|
258
|
+
| ---- | ---- |
|
|
259
|
+
| [indexOf] | Find first index of a value. |
|
|
260
|
+
| [lastIndexOf] | Find last index of a value. |
|
|
261
|
+
| [search] | Find index of first value passing a test. |
|
|
262
|
+
| [searchRight] | Find index of last value passing a test. |
|
|
263
|
+
| [searchAll] | Find indices of values passing a test. |
|
|
264
|
+
|
|
265
|
+
### Functional
|
|
266
|
+
|
|
267
|
+
| Property | Description |
|
|
268
|
+
| ---- | ---- |
|
|
269
|
+
| [forEach] | Call a function for each value. |
|
|
270
|
+
| [some] | Examine if any value satisfies a test. |
|
|
271
|
+
| [every] | Examine if all values satisfy a test. |
|
|
272
|
+
| [map] | Transform values of an array. |
|
|
273
|
+
| [map$] | Transform values of an array! |
|
|
274
|
+
| [reduce] | Reduce values of array to a single value. |
|
|
275
|
+
| [reduceRight] | Reduce values from right, to a single value. |
|
|
276
|
+
| [filter] | Keep values which pass a test. |
|
|
277
|
+
| [filter$] | Keep values which pass a test! |
|
|
278
|
+
| [filterAt] | Keep values at given indices. |
|
|
279
|
+
| [reject] | Discard values which pass a test. |
|
|
280
|
+
| [reject$] | Discard values which pass a test! |
|
|
281
|
+
| [rejectAt] | Discard values at given indices. |
|
|
282
|
+
|
|
283
|
+
### Flatten
|
|
284
|
+
|
|
285
|
+
| Property | Description |
|
|
286
|
+
| ---- | ---- |
|
|
287
|
+
| [flat] | Flatten nested array to given depth. |
|
|
288
|
+
| [flatMap] | Flatten nested array, based on map function. |
|
|
289
|
+
|
|
290
|
+
### Prefix Scan
|
|
291
|
+
|
|
292
|
+
| Property | Description |
|
|
293
|
+
| ---- | ---- |
|
|
294
|
+
| [exclusiveScan] | Perform exclusive prefix scan from left to right. |
|
|
295
|
+
| [exclusiveScan$] | Perform exclusive prefix scan from left to right! |
|
|
296
|
+
| [inclusiveScan] | Perform inclusive prefix scan from left to right. |
|
|
297
|
+
| [inclusiveScan$] | Perform inclusive prefix scan from left to right! |
|
|
298
|
+
| [adjacentCombine] | Combine adjacent values of an array. |
|
|
299
|
+
| [adjacentCombine$] | Combine adjacent values of an array! |
|
|
300
|
+
|
|
301
|
+
### Combine
|
|
302
|
+
|
|
303
|
+
| Property | Description |
|
|
304
|
+
| ---- | ---- |
|
|
305
|
+
| [intersperse] | Place a separator between every value. |
|
|
306
|
+
| [interpolate] | Estimate new values between existing ones. |
|
|
307
|
+
| [intermix] | Place values of an array between another. |
|
|
308
|
+
| [interleave] | Place values from iterables alternately. |
|
|
309
|
+
| [zip] | Combine values from arrays. |
|
|
310
|
+
|
|
311
|
+
### Manipulate
|
|
312
|
+
|
|
313
|
+
| Property | Description |
|
|
314
|
+
| ---- | ---- |
|
|
315
|
+
| [fill] | Fill with given value. |
|
|
316
|
+
| [fill$] | Fill with given value! |
|
|
317
|
+
| [push] | Add value to the end. |
|
|
318
|
+
| [push$] | Add values to the end! |
|
|
319
|
+
| [pop] | Remove last value. |
|
|
320
|
+
| [pop$] | Remove last value! |
|
|
321
|
+
| [shift] | Remove first value. |
|
|
322
|
+
| [shift$] | Remove first value! |
|
|
323
|
+
| [unshift] | Add values to the start. |
|
|
324
|
+
| [unshift$] | Add values to the start! |
|
|
325
|
+
| [copy] | Copy part of array to another. |
|
|
326
|
+
| [copy$] | Copy part of array to another! |
|
|
327
|
+
| [copyWithin] | Copy part of array within. |
|
|
328
|
+
| [copyWithin$] | Copy part of array within! |
|
|
329
|
+
| [moveWithin] | Move part of array within. |
|
|
330
|
+
| [moveWithin$] | Move part of array within! |
|
|
331
|
+
| [splice] | Remove or replace existing values. |
|
|
332
|
+
| [splice$] | Remove or replace existing values! |
|
|
333
|
+
|
|
334
|
+
### Count/Partition
|
|
335
|
+
|
|
336
|
+
| Property | Description |
|
|
337
|
+
| ---- | ---- |
|
|
338
|
+
| [count] | Count values which satisfy a test. |
|
|
339
|
+
| [countEach] | Count occurrences of each distinct value. |
|
|
340
|
+
| [partition] | Segregate values by test result. |
|
|
341
|
+
| [partitionEach] | Segregate each distinct value. |
|
|
342
|
+
|
|
343
|
+
### Split
|
|
344
|
+
|
|
345
|
+
| Property | Description |
|
|
346
|
+
| ---- | ---- |
|
|
347
|
+
| [split] | Break array considering test as separator. |
|
|
348
|
+
| [splitAt] | Break array considering indices as separator. |
|
|
349
|
+
| [cut] | Break array when test passes. |
|
|
350
|
+
| [cutRight] | Break array after test passes. |
|
|
351
|
+
| [cutAt] | Break array at given indices. |
|
|
352
|
+
| [cutAtRight] | Break array after given indices. |
|
|
353
|
+
| [group] | Keep similar values together and in order. |
|
|
354
|
+
| [chunk] | Break array into chunks of given size. |
|
|
355
|
+
|
|
356
|
+
### Concatenate/Join
|
|
357
|
+
|
|
358
|
+
| Property | Description |
|
|
359
|
+
| ---- | ---- |
|
|
360
|
+
| [concat] | Append values from arrays. |
|
|
361
|
+
| [concat$] | Append values from arrays! |
|
|
362
|
+
| [join] | Join values together into a string. |
|
|
363
|
+
|
|
364
|
+
### Rearrange
|
|
365
|
+
|
|
366
|
+
| Property | Description |
|
|
367
|
+
| ---- | ---- |
|
|
368
|
+
| [cycle] | Obtain values that cycle through array. |
|
|
369
|
+
| [repeat] | Repeat an array given times. |
|
|
370
|
+
| [reverse] | Reverse the values. |
|
|
371
|
+
| [reverse$] | Reverse the values! |
|
|
372
|
+
| [rotate] | Rotate values in array. |
|
|
373
|
+
| [rotate$] | Rotate values in array! |
|
|
374
|
+
|
|
375
|
+
### Set Operations
|
|
376
|
+
|
|
377
|
+
| Property | Description |
|
|
378
|
+
| ---- | ---- |
|
|
379
|
+
| [isUnique] | Examine if there are no duplicate values. |
|
|
380
|
+
| [isDisjoint] | Examine if arrays have no value in common. |
|
|
381
|
+
| [unique] | Remove duplicate values. |
|
|
382
|
+
| [union] | Obtain values present in any array. |
|
|
383
|
+
| [union$] | Obtain values present in any array! |
|
|
384
|
+
| [intersection] | Obtain values present in both arrays. |
|
|
385
|
+
| [difference] | Obtain values not present in another array. |
|
|
386
|
+
| [symmetricDifference] | Obtain values not present in both arrays. |
|
|
387
|
+
| [cartesianProduct] | Obtain cartesian product of arrays. |
|
|
388
|
+
|
|
389
|
+
<br>
|
|
390
|
+
<br>
|
|
391
|
+
|
|
392
|
+
|
|
393
|
+
## Story
|
|
394
|
+
|
|
395
|
+
An **array** is a *collection of values* stored **contiguously** in memory. Each value has a *zero-based index*, and the number of values is the array's *length*. In JavaScript, an [Array`][array] is a dynamic, resizable object whose elements may be of any type, including other arrays (hence *nested arrays*). Values are accessed with bracket notation (`a[i]`) or, for nested paths, by chaining indices (`a[i][j][k]`). Because JavaScript arrays are *sparse-capable* but typically dense, contiguous access is fast; iteration with `for...of`, `Array.fromAsync()`, or `Array.from()` yields values in index order.
|
|
396
|
+
|
|
397
|
+
In JavaScript, an array can be **created** with `[]`, `Array.of()`, `Array.from()`, or `new Array(n)` (which fills with *empty slots*), and **inspected** with `Array.isArray()`, `a.length`, `a.keys()`, `a.values()`, and `a.entries()`. Values can be **appended** with `a.push()`, **prepended** with `a.unshift()`, **removed** from either end with `a.pop()`/`a.shift()`, and **spliced** in or out with `a.splice()`. Copies are made with `a.slice()`, and the array itself can be reordered with `a.sort()`, `a.reverse()`, or `a.copyWithin()`. A **part** of the array can be extracted with `a.slice(start, end)`; a **test** applied with `a.some()`, `a.every()`, or `a.find()`; and a **functional transformation** performed with `a.map()`, `a.filter()`, and `a.reduce()`. These built-ins form the *idiomatic* baseline that this package extends.
|
|
398
|
+
|
|
399
|
+
The functions in this package **mirror** these built-ins where possible (`get`, `set`, `slice`, `sort`, `map`, `filter`, `reduce`, `some`, `every`) and **add** a wide range of others that are common in functional and mathematical code: *partial sorting* (as in NumPy's `partition`), *prefix scans* (inclusive and exclusive), *range-based variants* (`ranged*()`), *iterable-returning variants* (`i*()`), *random selection* (`random*()`), and *set operations* (`union`, `intersection`, `difference`, `symmetricDifference`, `cartesianProduct`). The `$` suffix consistently denotes **in-place mutation**, so a call to `xarray.map$(a, fn)` is exactly analogous to `Array.prototype.map` but writes into the original array; the pure form `xarray.map(a, fn)` returns a new array. This separation makes it easy to *opt in* to mutation and to reason about which calls allocate.
|
|
400
|
+
|
|
401
|
+
Because the package is a **single flat module**, every function is reachable from the same import. Groupings in the [Index](#index) above are *by purpose*, not by submodule, so you can scan for the operation you want and then confirm the exact signature in the [@nodef/extra-array` docs](https://jsr.io/@nodef/extra-array/doc).
|
|
402
|
+
|
|
403
|
+
<br>
|
|
404
|
+
<br>
|
|
405
|
+
|
|
406
|
+
|
|
407
|
+
## See also
|
|
408
|
+
|
|
409
|
+
- [MDN: Array](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array)
|
|
410
|
+
- [MDN: TypedArray](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray)
|
|
411
|
+
- [Prefix sum array and difference array : Woburn C.I. PEGWiki](https://wcipeg.com/wiki/Prefix_sum_array_and_difference_array)
|
|
412
|
+
- [How to get the count of each distinct value in a column?](https://stackoverflow.com/q/7053902/1413259)
|
|
413
|
+
- [How to add region in java script file, visual studio](https://stackoverflow.com/a/51550649/1413259)
|
|
414
|
+
- [Operator precedence - JavaScript : MDN Web Docs](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Operator_precedence)
|
|
415
|
+
- [numpy.partition - NumPy Manual](https://numpy.org/doc/stable/reference/generated/numpy.partition.html)
|
|
416
|
+
|
|
417
|
+
<br>
|
|
418
|
+
<br>
|
|
419
|
+
|
|
420
|
+
|
|
421
|
+
[](https://wolfram77.github.io)<br>
|
|
422
|
+
[](https://nodef.github.io)
|
|
423
|
+

|
|
424
|
+
|
|
425
|
+
|
|
426
|
+
[fromRange]: https://jsr.io/@nodef/extra-array/doc/~/fromRange
|
|
427
|
+
[fromInvocation]: https://jsr.io/@nodef/extra-array/doc/~/fromInvocation
|
|
428
|
+
[fromApplication]: https://jsr.io/@nodef/extra-array/doc/~/fromApplication
|
|
429
|
+
[fromIterable]: https://jsr.io/@nodef/extra-array/doc/~/fromIterable
|
|
430
|
+
[fromIterable$]: https://jsr.io/@nodef/extra-array/doc/~/fromIterable$
|
|
431
|
+
[shallowClone]: https://jsr.io/@nodef/extra-array/doc/~/shallowClone
|
|
432
|
+
[deepClone]: https://jsr.io/@nodef/extra-array/doc/~/deepClone
|
|
433
|
+
[is]: https://jsr.io/@nodef/extra-array/doc/~/is
|
|
434
|
+
[keys]: https://jsr.io/@nodef/extra-array/doc/~/keys
|
|
435
|
+
[values]: https://jsr.io/@nodef/extra-array/doc/~/values
|
|
436
|
+
[entries]: https://jsr.io/@nodef/extra-array/doc/~/entries
|
|
437
|
+
[index]: https://jsr.io/@nodef/extra-array/doc/~/index
|
|
438
|
+
[indexRange]: https://jsr.io/@nodef/extra-array/doc/~/indexRange
|
|
439
|
+
[isEmpty]: https://jsr.io/@nodef/extra-array/doc/~/isEmpty
|
|
440
|
+
[length]: https://jsr.io/@nodef/extra-array/doc/~/length
|
|
441
|
+
[resize$]: https://jsr.io/@nodef/extra-array/doc/~/resize$
|
|
442
|
+
[clear$]: https://jsr.io/@nodef/extra-array/doc/~/clear$
|
|
443
|
+
[get]: https://jsr.io/@nodef/extra-array/doc/~/get
|
|
444
|
+
[getAll]: https://jsr.io/@nodef/extra-array/doc/~/getAll
|
|
445
|
+
[getPath]: https://jsr.io/@nodef/extra-array/doc/~/getPath
|
|
446
|
+
[hasPath]: https://jsr.io/@nodef/extra-array/doc/~/hasPath
|
|
447
|
+
[set]: https://jsr.io/@nodef/extra-array/doc/~/set
|
|
448
|
+
[set$]: https://jsr.io/@nodef/extra-array/doc/~/set$
|
|
449
|
+
[setPath$]: https://jsr.io/@nodef/extra-array/doc/~/setPath$
|
|
450
|
+
[swap]: https://jsr.io/@nodef/extra-array/doc/~/swap
|
|
451
|
+
[swap$]: https://jsr.io/@nodef/extra-array/doc/~/swap$
|
|
452
|
+
[swapRanges]: https://jsr.io/@nodef/extra-array/doc/~/swapRanges
|
|
453
|
+
[swapRanges$]: https://jsr.io/@nodef/extra-array/doc/~/swapRanges$
|
|
454
|
+
[remove]: https://jsr.io/@nodef/extra-array/doc/~/remove
|
|
455
|
+
[remove$]: https://jsr.io/@nodef/extra-array/doc/~/remove$
|
|
456
|
+
[removePath$]: https://jsr.io/@nodef/extra-array/doc/~/removePath$
|
|
457
|
+
[isSorted]: https://jsr.io/@nodef/extra-array/doc/~/isSorted
|
|
458
|
+
[hasUnsortedValue]: https://jsr.io/@nodef/extra-array/doc/~/hasUnsortedValue
|
|
459
|
+
[searchUnsortedValue]: https://jsr.io/@nodef/extra-array/doc/~/searchUnsortedValue
|
|
460
|
+
[sort]: https://jsr.io/@nodef/extra-array/doc/~/sort
|
|
461
|
+
[sort$]: https://jsr.io/@nodef/extra-array/doc/~/sort$
|
|
462
|
+
[partialSort]: https://jsr.io/@nodef/extra-array/doc/~/partialSort
|
|
463
|
+
[partialSort$]: https://jsr.io/@nodef/extra-array/doc/~/partialSort$
|
|
464
|
+
[minimum]: https://jsr.io/@nodef/extra-array/doc/~/minimum
|
|
465
|
+
[minimumEntry]: https://jsr.io/@nodef/extra-array/doc/~/minimumEntry
|
|
466
|
+
[maximum]: https://jsr.io/@nodef/extra-array/doc/~/maximum
|
|
467
|
+
[maximumEntry]: https://jsr.io/@nodef/extra-array/doc/~/maximumEntry
|
|
468
|
+
[range]: https://jsr.io/@nodef/extra-array/doc/~/range
|
|
469
|
+
[rangeEntries]: https://jsr.io/@nodef/extra-array/doc/~/rangeEntries
|
|
470
|
+
[minimums]: https://jsr.io/@nodef/extra-array/doc/~/minimums
|
|
471
|
+
[minimumEntries]: https://jsr.io/@nodef/extra-array/doc/~/minimumEntries
|
|
472
|
+
[maximums]: https://jsr.io/@nodef/extra-array/doc/~/maximums
|
|
473
|
+
[maximumEntries]: https://jsr.io/@nodef/extra-array/doc/~/maximumEntries
|
|
474
|
+
[searchMinimumValue]: https://jsr.io/@nodef/extra-array/doc/~/searchMinimumValue
|
|
475
|
+
[searchMaximumValue]: https://jsr.io/@nodef/extra-array/doc/~/searchMaximumValue
|
|
476
|
+
[searchMinimumValues]: https://jsr.io/@nodef/extra-array/doc/~/searchMinimumValues
|
|
477
|
+
[searchMaximumValues]: https://jsr.io/@nodef/extra-array/doc/~/searchMaximumValues
|
|
478
|
+
[isEqual]: https://jsr.io/@nodef/extra-array/doc/~/isEqual
|
|
479
|
+
[compare]: https://jsr.io/@nodef/extra-array/doc/~/compare
|
|
480
|
+
[head]: https://jsr.io/@nodef/extra-array/doc/~/head
|
|
481
|
+
[tail]: https://jsr.io/@nodef/extra-array/doc/~/tail
|
|
482
|
+
[init]: https://jsr.io/@nodef/extra-array/doc/~/init
|
|
483
|
+
[last]: https://jsr.io/@nodef/extra-array/doc/~/last
|
|
484
|
+
[middle]: https://jsr.io/@nodef/extra-array/doc/~/middle
|
|
485
|
+
[slice]: https://jsr.io/@nodef/extra-array/doc/~/slice
|
|
486
|
+
[slice$]: https://jsr.io/@nodef/extra-array/doc/~/slice$
|
|
487
|
+
[includes]: https://jsr.io/@nodef/extra-array/doc/~/includes
|
|
488
|
+
[hasValue]: https://jsr.io/@nodef/extra-array/doc/~/hasValue
|
|
489
|
+
[searchValue]: https://jsr.io/@nodef/extra-array/doc/~/searchValue
|
|
490
|
+
[searchValueRight]: https://jsr.io/@nodef/extra-array/doc/~/searchValueRight
|
|
491
|
+
[searchValueAll]: https://jsr.io/@nodef/extra-array/doc/~/searchValueAll
|
|
492
|
+
[searchAdjacentDuplicateValue]: https://jsr.io/@nodef/extra-array/doc/~/searchAdjacentDuplicateValue
|
|
493
|
+
[searchMismatchedValue]: https://jsr.io/@nodef/extra-array/doc/~/searchMismatchedValue
|
|
494
|
+
[hasPrefix]: https://jsr.io/@nodef/extra-array/doc/~/hasPrefix
|
|
495
|
+
[hasSuffix]: https://jsr.io/@nodef/extra-array/doc/~/hasSuffix
|
|
496
|
+
[hasInfix]: https://jsr.io/@nodef/extra-array/doc/~/hasInfix
|
|
497
|
+
[hasSubsequence]: https://jsr.io/@nodef/extra-array/doc/~/hasSubsequence
|
|
498
|
+
[hasPermutation]: https://jsr.io/@nodef/extra-array/doc/~/hasPermutation
|
|
499
|
+
[prefixes]: https://jsr.io/@nodef/extra-array/doc/~/prefixes
|
|
500
|
+
[iprefixes]: https://jsr.io/@nodef/extra-array/doc/~/iprefixes
|
|
501
|
+
[suffixes]: https://jsr.io/@nodef/extra-array/doc/~/suffixes
|
|
502
|
+
[isuffixes]: https://jsr.io/@nodef/extra-array/doc/~/isuffixes
|
|
503
|
+
[infixes]: https://jsr.io/@nodef/extra-array/doc/~/infixes
|
|
504
|
+
[iinfixes]: https://jsr.io/@nodef/extra-array/doc/~/iinfixes
|
|
505
|
+
[subsequences]: https://jsr.io/@nodef/extra-array/doc/~/subsequences
|
|
506
|
+
[isubsequences]: https://jsr.io/@nodef/extra-array/doc/~/isubsequences
|
|
507
|
+
[permutations]: https://jsr.io/@nodef/extra-array/doc/~/permutations
|
|
508
|
+
[ipermutations]: https://jsr.io/@nodef/extra-array/doc/~/ipermutations
|
|
509
|
+
[searchInfix]: https://jsr.io/@nodef/extra-array/doc/~/searchInfix
|
|
510
|
+
[searchInfixRight]: https://jsr.io/@nodef/extra-array/doc/~/searchInfixRight
|
|
511
|
+
[searchInfixAll]: https://jsr.io/@nodef/extra-array/doc/~/searchInfixAll
|
|
512
|
+
[searchSubsequence]: https://jsr.io/@nodef/extra-array/doc/~/searchSubsequence
|
|
513
|
+
[randomValue]: https://jsr.io/@nodef/extra-array/doc/~/randomValue
|
|
514
|
+
[randomPrefix]: https://jsr.io/@nodef/extra-array/doc/~/randomPrefix
|
|
515
|
+
[randomSuffix]: https://jsr.io/@nodef/extra-array/doc/~/randomSuffix
|
|
516
|
+
[randomInfix]: https://jsr.io/@nodef/extra-array/doc/~/randomInfix
|
|
517
|
+
[randomSubsequence]: https://jsr.io/@nodef/extra-array/doc/~/randomSubsequence
|
|
518
|
+
[randomPermutation]: https://jsr.io/@nodef/extra-array/doc/~/randomPermutation
|
|
519
|
+
[randomPermutation$]: https://jsr.io/@nodef/extra-array/doc/~/randomPermutation$
|
|
520
|
+
[find]: https://jsr.io/@nodef/extra-array/doc/~/find
|
|
521
|
+
[findRight]: https://jsr.io/@nodef/extra-array/doc/~/findRight
|
|
522
|
+
[take]: https://jsr.io/@nodef/extra-array/doc/~/take
|
|
523
|
+
[takeRight]: https://jsr.io/@nodef/extra-array/doc/~/takeRight
|
|
524
|
+
[takeWhile]: https://jsr.io/@nodef/extra-array/doc/~/takeWhile
|
|
525
|
+
[takeWhileRight]: https://jsr.io/@nodef/extra-array/doc/~/takeWhileRight
|
|
526
|
+
[drop]: https://jsr.io/@nodef/extra-array/doc/~/drop
|
|
527
|
+
[dropRight]: https://jsr.io/@nodef/extra-array/doc/~/dropRight
|
|
528
|
+
[dropWhile]: https://jsr.io/@nodef/extra-array/doc/~/dropWhile
|
|
529
|
+
[dropWhileRight]: https://jsr.io/@nodef/extra-array/doc/~/dropWhileRight
|
|
530
|
+
[scanWhile]: https://jsr.io/@nodef/extra-array/doc/~/scanWhile
|
|
531
|
+
[scanWhileRight]: https://jsr.io/@nodef/extra-array/doc/~/scanWhileRight
|
|
532
|
+
[scanUntil]: https://jsr.io/@nodef/extra-array/doc/~/scanUntil
|
|
533
|
+
[scanUntilRight]: https://jsr.io/@nodef/extra-array/doc/~/scanUntilRight
|
|
534
|
+
[indexOf]: https://jsr.io/@nodef/extra-array/doc/~/indexOf
|
|
535
|
+
[lastIndexOf]: https://jsr.io/@nodef/extra-array/doc/~/lastIndexOf
|
|
536
|
+
[search]: https://jsr.io/@nodef/extra-array/doc/~/search
|
|
537
|
+
[searchRight]: https://jsr.io/@nodef/extra-array/doc/~/searchRight
|
|
538
|
+
[searchAll]: https://jsr.io/@nodef/extra-array/doc/~/searchAll
|
|
539
|
+
[forEach]: https://jsr.io/@nodef/extra-array/doc/~/forEach
|
|
540
|
+
[some]: https://jsr.io/@nodef/extra-array/doc/~/some
|
|
541
|
+
[every]: https://jsr.io/@nodef/extra-array/doc/~/every
|
|
542
|
+
[map]: https://jsr.io/@nodef/extra-array/doc/~/map
|
|
543
|
+
[map$]: https://jsr.io/@nodef/extra-array/doc/~/map$
|
|
544
|
+
[reduce]: https://jsr.io/@nodef/extra-array/doc/~/reduce
|
|
545
|
+
[reduceRight]: https://jsr.io/@nodef/extra-array/doc/~/reduceRight
|
|
546
|
+
[filter]: https://jsr.io/@nodef/extra-array/doc/~/filter
|
|
547
|
+
[filter$]: https://jsr.io/@nodef/extra-array/doc/~/filter$
|
|
548
|
+
[filterAt]: https://jsr.io/@nodef/extra-array/doc/~/filterAt
|
|
549
|
+
[reject]: https://jsr.io/@nodef/extra-array/doc/~/reject
|
|
550
|
+
[reject$]: https://jsr.io/@nodef/extra-array/doc/~/reject$
|
|
551
|
+
[rejectAt]: https://jsr.io/@nodef/extra-array/doc/~/rejectAt
|
|
552
|
+
[flat]: https://jsr.io/@nodef/extra-array/doc/~/flat
|
|
553
|
+
[flatMap]: https://jsr.io/@nodef/extra-array/doc/~/flatMap
|
|
554
|
+
[exclusiveScan]: https://jsr.io/@nodef/extra-array/doc/~/exclusiveScan
|
|
555
|
+
[exclusiveScan$]: https://jsr.io/@nodef/extra-array/doc/~/exclusiveScan$
|
|
556
|
+
[inclusiveScan]: https://jsr.io/@nodef/extra-array/doc/~/inclusiveScan
|
|
557
|
+
[inclusiveScan$]: https://jsr.io/@nodef/extra-array/doc/~/inclusiveScan$
|
|
558
|
+
[adjacentCombine]: https://jsr.io/@nodef/extra-array/doc/~/adjacentCombine
|
|
559
|
+
[adjacentCombine$]: https://jsr.io/@nodef/extra-array/doc/~/adjacentCombine$
|
|
560
|
+
[intersperse]: https://jsr.io/@nodef/extra-array/doc/~/intersperse
|
|
561
|
+
[interpolate]: https://jsr.io/@nodef/extra-array/doc/~/interpolate
|
|
562
|
+
[intermix]: https://jsr.io/@nodef/extra-array/doc/~/intermix
|
|
563
|
+
[interleave]: https://jsr.io/@nodef/extra-array/doc/~/interleave
|
|
564
|
+
[zip]: https://jsr.io/@nodef/extra-array/doc/~/zip
|
|
565
|
+
[fill]: https://jsr.io/@nodef/extra-array/doc/~/fill
|
|
566
|
+
[fill$]: https://jsr.io/@nodef/extra-array/doc/~/fill$
|
|
567
|
+
[push]: https://jsr.io/@nodef/extra-array/doc/~/push
|
|
568
|
+
[push$]: https://jsr.io/@nodef/extra-array/doc/~/push$
|
|
569
|
+
[pop]: https://jsr.io/@nodef/extra-array/doc/~/pop
|
|
570
|
+
[pop$]: https://jsr.io/@nodef/extra-array/doc/~/pop$
|
|
571
|
+
[shift]: https://jsr.io/@nodef/extra-array/doc/~/shift
|
|
572
|
+
[shift$]: https://jsr.io/@nodef/extra-array/doc/~/shift$
|
|
573
|
+
[unshift]: https://jsr.io/@nodef/extra-array/doc/~/unshift
|
|
574
|
+
[unshift$]: https://jsr.io/@nodef/extra-array/doc/~/unshift$
|
|
575
|
+
[copy]: https://jsr.io/@nodef/extra-array/doc/~/copy
|
|
576
|
+
[copy$]: https://jsr.io/@nodef/extra-array/doc/~/copy$
|
|
577
|
+
[copyWithin]: https://jsr.io/@nodef/extra-array/doc/~/copyWithin
|
|
578
|
+
[copyWithin$]: https://jsr.io/@nodef/extra-array/doc/~/copyWithin$
|
|
579
|
+
[moveWithin]: https://jsr.io/@nodef/extra-array/doc/~/moveWithin
|
|
580
|
+
[moveWithin$]: https://jsr.io/@nodef/extra-array/doc/~/moveWithin$
|
|
581
|
+
[splice]: https://jsr.io/@nodef/extra-array/doc/~/splice
|
|
582
|
+
[splice$]: https://jsr.io/@nodef/extra-array/doc/~/splice$
|
|
583
|
+
[count]: https://jsr.io/@nodef/extra-array/doc/~/count
|
|
584
|
+
[countEach]: https://jsr.io/@nodef/extra-array/doc/~/countEach
|
|
585
|
+
[partition]: https://jsr.io/@nodef/extra-array/doc/~/partition
|
|
586
|
+
[partitionEach]: https://jsr.io/@nodef/extra-array/doc/~/partitionEach
|
|
587
|
+
[split]: https://jsr.io/@nodef/extra-array/doc/~/split
|
|
588
|
+
[splitAt]: https://jsr.io/@nodef/extra-array/doc/~/splitAt
|
|
589
|
+
[cut]: https://jsr.io/@nodef/extra-array/doc/~/cut
|
|
590
|
+
[cutRight]: https://jsr.io/@nodef/extra-array/doc/~/cutRight
|
|
591
|
+
[cutAt]: https://jsr.io/@nodef/extra-array/doc/~/cutAt
|
|
592
|
+
[cutAtRight]: https://jsr.io/@nodef/extra-array/doc/~/cutAtRight
|
|
593
|
+
[group]: https://jsr.io/@nodef/extra-array/doc/~/group
|
|
594
|
+
[chunk]: https://jsr.io/@nodef/extra-array/doc/~/chunk
|
|
595
|
+
[concat]: https://jsr.io/@nodef/extra-array/doc/~/concat
|
|
596
|
+
[concat$]: https://jsr.io/@nodef/extra-array/doc/~/concat$
|
|
597
|
+
[join]: https://jsr.io/@nodef/extra-array/doc/~/join
|
|
598
|
+
[cycle]: https://jsr.io/@nodef/extra-array/doc/~/cycle
|
|
599
|
+
[repeat]: https://jsr.io/@nodef/extra-array/doc/~/repeat
|
|
600
|
+
[reverse]: https://jsr.io/@nodef/extra-array/doc/~/reverse
|
|
601
|
+
[reverse$]: https://jsr.io/@nodef/extra-array/doc/~/reverse$
|
|
602
|
+
[rotate]: https://jsr.io/@nodef/extra-array/doc/~/rotate
|
|
603
|
+
[rotate$]: https://jsr.io/@nodef/extra-array/doc/~/rotate$
|
|
604
|
+
[isUnique]: https://jsr.io/@nodef/extra-array/doc/~/isUnique
|
|
605
|
+
[isDisjoint]: https://jsr.io/@nodef/extra-array/doc/~/isDisjoint
|
|
606
|
+
[unique]: https://jsr.io/@nodef/extra-array/doc/~/unique
|
|
607
|
+
[union]: https://jsr.io/@nodef/extra-array/doc/~/union
|
|
608
|
+
[union$]: https://jsr.io/@nodef/extra-array/doc/~/union$
|
|
609
|
+
[intersection]: https://jsr.io/@nodef/extra-array/doc/~/intersection
|
|
610
|
+
[difference]: https://jsr.io/@nodef/extra-array/doc/~/difference
|
|
611
|
+
[symmetricDifference]: https://jsr.io/@nodef/extra-array/doc/~/symmetricDifference
|
|
612
|
+
[cartesianProduct]: https://jsr.io/@nodef/extra-array/doc/~/cartesianProduct
|