@nodef/extra-array.web 0.0.0-stage → 4.5.0

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 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,487 @@
1
- # Temporary Holding Version
1
+ An [array] is a collection of values, stored contiguously.<br>
2
2
 
3
- This version is a temporary placeholder for this package. An operational version to replace this has been submitted for review and is awaiting a staged release.
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
+ <br>
10
+
11
+
12
+ This package includes comprehensive set of array functions with which you can
13
+ **generate** an array, **clone** it, query **about** it, get non-negative
14
+ **indices**, manage its **length**, **get/set** elements, fully or partially
15
+ **sort** it, obtain **minimum(s)/maximum(s)**, **compare** it with another
16
+ array, get a **part** of it, **search a value**, obtain all possible
17
+ **arrangements** or **random arrangements**, **find** an element, **take/drop**
18
+ elements or **scan** from its beginning or its end, **search** the index of a
19
+ part of it, perform **functional** operations, **flatten** multi-level arrays,
20
+ obtain **prefix sum**, **manipulate** it in various ways, **count/partition**
21
+ elements, **split** it, **concatenate/join** multiple arrays, **rearrange**
22
+ elements within it, or performing **set operations** upon it.
23
+
24
+ We use a consistent naming scheme that helps you quickly identify the functions
25
+ you need. All functions except `from*()` take array as 1st parameter. Some
26
+ functions operate on a specified range in the array and are called `ranged*()`,
27
+ such as `rangedPartialSort()`. Functions like `swap()` are pure and do not
28
+ modify the array itself, while functions like `swap$()` *do modify (update)* the
29
+ array itself. Some functions accept a map function for *faster comparison*, such
30
+ as `unique()`. Further, functions which return an iterable instead of an array
31
+ are prefixed with `i`, such as `isubsequences()`. We borrow some names from
32
+ other programming languages such as *Haskell*, *Python*, *Java*, and
33
+ *Processing*.
34
+
35
+ [array]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array
36
+
37
+ <br>
38
+
39
+ ```javascript
40
+ import * as xarray from "jsr:@nodef/extra-array";
41
+
42
+ var x = [1, 2, 3];
43
+ xarray.get(x, -1);
44
+ // → 3
45
+
46
+ var x = [1, 2, 3, 4];
47
+ xarray.swap(x, 0, 1);
48
+ // → [ 2, 1, 3, 4 ]
49
+
50
+ var x = [1, 2, 3, 4];
51
+ xarray.rotate(x, 1);
52
+ // → [ 2, 3, 4, 1 ]
53
+
54
+ xarray.permutations([1, 2, 3]);
55
+ // → [
56
+ // [], [ 1 ],
57
+ // [ 2 ], [ 3 ],
58
+ // [ 1, 2 ], [ 1, 3 ],
59
+ // [ 2, 1 ], [ 2, 3 ],
60
+ // [ 3, 1 ], [ 3, 2 ],
61
+ // [ 1, 2, 3 ], [ 1, 3, 2 ],
62
+ // [ 2, 1, 3 ], [ 2, 3, 1 ],
63
+ // [ 3, 1, 2 ], [ 3, 2, 1 ]
64
+ // ]
65
+ ```
66
+
67
+ <br>
68
+ <br>
69
+
70
+
71
+
72
+ ## Index
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
+ | [shallowClone] | Shallow clone an array. |
83
+ | [deepClone] | Deep clone an array. |
84
+ | | |
85
+ | [is] | Check if value is an array. |
86
+ | [keys] | Obtain all indices. |
87
+ | [values] | Get all values. |
88
+ | [entries] | Obtain all index-value pairs. |
89
+ | | |
90
+ | [index] | Get zero-based index for an element in array. |
91
+ | [indexRange] | Get zero-based index range for part of array. |
92
+ | | |
93
+ | [isEmpty] | Check if an array is empty. |
94
+ | [length] | Find the length of an array. |
95
+ | [resize$] | Resize an array to given length! |
96
+ | [clear$] | Remove all elements from an array! |
97
+ | | |
98
+ | [get] | Get value at index. |
99
+ | [getAll] | Get values at indices. |
100
+ | [getPath] | Get value at path in a nested array. |
101
+ | [hasPath] | Check if nested array has a path. |
102
+ | [set] | Set value at index. |
103
+ | [set$] | Set value at index! |
104
+ | [setPath$] | Set value at path in a nested array! |
105
+ | [swap] | Exchange two values. |
106
+ | [swap$] | Exchange two values! |
107
+ | [swapRanges] | Exchange two ranges of values. |
108
+ | [swapRanges$] | Exchange two ranges of values! |
109
+ | [remove] | Remove value at index. |
110
+ | [remove$] | Remove value at index! |
111
+ | [removePath$] | Remove value at path in a nested array! |
112
+ | | |
113
+ | [isSorted] | Examine if array is sorted. |
114
+ | [hasUnsortedValue] | Examine if array has an unsorted value. |
115
+ | [searchUnsortedValue] | Find first index of an unsorted value. |
116
+ | [sort] | Arrange values in order. |
117
+ | [sort$] | Arrange values in order! |
118
+ | [partialSort] | Partially arrange values in order. |
119
+ | [partialSort$] | Partially arrange values in order! |
120
+ | | |
121
+ | [minimum] | Find first smallest value. |
122
+ | [minimumEntry] | Find first smallest entry. |
123
+ | [maximum] | Find first largest value. |
124
+ | [maximumEntry] | Find first largest entry. |
125
+ | [range] | Find smallest and largest values. |
126
+ | [rangeEntries] | Find smallest and largest entries. |
127
+ | [minimums] | Find smallest values. |
128
+ | [minimumEntries] | Find smallest entries. |
129
+ | [maximums] | Find largest values. |
130
+ | [maximumEntries] | Find largest entries. |
131
+ | [searchMinimumValue] | Find first index of minimum value. |
132
+ | [searchMaximumValue] | Find first index of maximum value. |
133
+ | [searchMinimumValues] | Find indices of minimum values. |
134
+ | [searchMaximumValues] | Find indices of maximum values. |
135
+ | | |
136
+ | [isEqual] | Examine if two arrays are equal. |
137
+ | [compare] | Compare two arrays (lexicographically). |
138
+ | | |
139
+ | [head] | Get first value. |
140
+ | [tail] | Get values except first. |
141
+ | [init] | Get values except last. |
142
+ | [last] | Get last value. |
143
+ | [middle] | Get values from middle. |
144
+ | [slice] | Get part of an array. |
145
+ | [slice$] | Get part of an array! |
146
+ | | |
147
+ | [includes] | Check if array has a value. |
148
+ | [hasValue] | Examine if array has a value. |
149
+ | [searchValue] | Find first index of a value. |
150
+ | [searchValueRight] | Find last index of a value. |
151
+ | [searchValueAll] | Find indices of value. |
152
+ | [searchAdjacentDuplicateValue] | Find first index of an adjacent duplicate value. |
153
+ | [searchMismatchedValue] | Find first index where two arrays differ. |
154
+ | | |
155
+ | [hasPrefix] | Examine if array starts with a prefix. |
156
+ | [hasSuffix] | Examine if array ends with a suffix. |
157
+ | [hasInfix] | Examine if array contains an infix. |
158
+ | [hasSubsequence] | Examine if array has a subsequence. |
159
+ | [hasPermutation] | Examine if array has a permutation. |
160
+ | [prefixes] | Obtain all possible prefixes. |
161
+ | [suffixes] | Obtain all possible suffixes. |
162
+ | [infixes] | Obtain all possible infixes. |
163
+ | [subsequences] | Obtain all possible subsequences. |
164
+ | [permutations] | Obtain all possible permutations. |
165
+ | [searchInfix] | Find first index of an infix. |
166
+ | [searchInfixRight] | Find last index of an infix. |
167
+ | [searchInfixAll] | Find indices of an infix. |
168
+ | [searchSubsequence] | Find first index of a subsequence. |
169
+ | | |
170
+ | [randomValue] | Pick an arbitrary value. |
171
+ | [randomPrefix] | Pick an arbitrary prefix. |
172
+ | [randomSuffix] | Pick an arbitrary suffix. |
173
+ | [randomInfix] | Pick an arbitrary infix. |
174
+ | [randomSubsequence] | Pick an arbitrary subsequence. |
175
+ | [randomPermutation] | Pick an arbitrary permutation. |
176
+ | [randomPermutation$] | Pick an arbitrary permutation! |
177
+ | | |
178
+ | [find] | Find first value passing a test. |
179
+ | [findRight] | Find last value passing a test. |
180
+ | | |
181
+ | [take] | Keep first n values only. |
182
+ | [takeRight] | Keep last n values only. |
183
+ | [takeWhile] | Keep values from left, while a test passes. |
184
+ | [takeWhileRight] | Keep values from right, while a test passes. |
185
+ | [drop] | Discard first n values only. |
186
+ | [dropRight] | Discard last n values only. |
187
+ | [dropWhile] | Discard values from left, while a test passes. |
188
+ | [dropWhileRight] | Discard values from right, while a test passes. |
189
+ | | |
190
+ | [scanWhile] | Scan from left, while a test passes. |
191
+ | [scanWhileRight] | Scan from right, while a test passes. |
192
+ | [scanUntil] | Scan from left, until a test passes. |
193
+ | [scanUntilRight] | Scan from right, until a test passes. |
194
+ | | |
195
+ | [indexOf] | Find first index of a value. |
196
+ | [lastIndexOf] | Find last index of a value. |
197
+ | [search] | Find index of first value passing a test. |
198
+ | [searchRight] | Find index of last value passing a test. |
199
+ | [searchAll] | Find indices of values passing a test. |
200
+ | | |
201
+ | [forEach] | Call a function for each value. |
202
+ | [some] | Examine if any value satisfies a test. |
203
+ | [every] | Examine if all values satisfy a test. |
204
+ | [map] | Transform values of an array. |
205
+ | [map$] | Transform values of an array! |
206
+ | [reduce] | Reduce values of array to a single value. |
207
+ | [reduceRight] | Reduce values from right, to a single value. |
208
+ | [filter] | Keep values which pass a test. |
209
+ | [filter$] | Keep values which pass a test! |
210
+ | [filterAt] | Keep values at given indices. |
211
+ | [reject] | Discard values which pass a test. |
212
+ | [reject$] | Discard values which pass a test! |
213
+ | [rejectAt] | Discard values at given indices. |
214
+ | | |
215
+ | [flat] | Flatten nested array to given depth. |
216
+ | [flatMap] | Flatten nested array, based on map function. |
217
+ | | |
218
+ | [exclusiveScan] | Perform exclusive prefix scan from left to right. |
219
+ | [exclusiveScan$] | Perform exclusive prefix scan from left to right! |
220
+ | [inclusiveScan] | Perform inclusive prefix scan from left to right. |
221
+ | [inclusiveScan$] | Perform inclusive prefix scan from left to right! |
222
+ | [adjacentCombine] | Combine adjacent values of an array. |
223
+ | [adjacentCombine$] | Combine adjacent values of an array! |
224
+ | | |
225
+ | [intersperse] | Place a separator between every value. |
226
+ | [interpolate] | Estimate new values between existing ones. |
227
+ | [intermix] | Place values of an array between another. |
228
+ | [interleave] | Place values from iterables alternately. |
229
+ | [zip] | Combine values from arrays. |
230
+ | | |
231
+ | [fill] | Fill with given value. |
232
+ | [fill$] | Fill with given value! |
233
+ | [push] | Add value to the end. |
234
+ | [push$] | Add values to the end! |
235
+ | [pop] | Remove last value. |
236
+ | [pop$] | Remove last value! |
237
+ | [shift] | Remove first value. |
238
+ | [shift$] | Remove first value! |
239
+ | [unshift] | Add values to the start. |
240
+ | [unshift$] | Add values to the start! |
241
+ | [copy] | Copy part of array to another. |
242
+ | [copy$] | Copy part of array to another! |
243
+ | [copyWithin] | Copy part of array within. |
244
+ | [copyWithin$] | Copy part of array within! |
245
+ | [moveWithin] | Move part of array within. |
246
+ | [moveWithin$] | Move part of array within! |
247
+ | [splice] | Remove or replace existing values. |
248
+ | [splice$] | Remove or replace existing values! |
249
+ | | |
250
+ | [count] | Count values which satisfy a test. |
251
+ | [countEach] | Count occurrences of each distinct value. |
252
+ | [partition] | Segregate values by test result. |
253
+ | [partitionEach] | Segregate each distinct value. |
254
+ | | |
255
+ | [split] | Break array considering test as separator. |
256
+ | [splitAt] | Break array considering indices as separator. |
257
+ | [cut] | Break array when test passes. |
258
+ | [cutRight] | Break array after test passes. |
259
+ | [cutAt] | Break array at given indices. |
260
+ | [cutAtRight] | Break array after given indices. |
261
+ | [group] | Keep similar values together and in order. |
262
+ | [chunk] | Break array into chunks of given size. |
263
+ | | |
264
+ | [concat] | Append values from arrays. |
265
+ | [concat$] | Append values from arrays! |
266
+ | [join] | Join values together into a string. |
267
+ | | |
268
+ | [cycle] | Obtain values that cycle through array. |
269
+ | [repeat] | Repeat an array given times. |
270
+ | [reverse] | Reverse the values. |
271
+ | [reverse$] | Reverse the values! |
272
+ | [rotate] | Rotate values in array. |
273
+ | [rotate$] | Rotate values in array! |
274
+ | | |
275
+ | [isUnique] | Examine if there are no duplicate values. |
276
+ | [isDisjoint] | Examine if arrays have no value in common. |
277
+ | [unique] | Remove duplicate values. |
278
+ | [union] | Obtain values present in any array. |
279
+ | [union$] | Obtain values present in any array! |
280
+ | [intersection] | Obtain values present in both arrays. |
281
+ | [difference] | Obtain values not present in another array. |
282
+ | [symmetricDifference] | Obtain values not present in both arrays. |
283
+ | [cartesianProduct] | Obtain cartesian product of arrays. |
284
+
285
+ <br>
286
+ <br>
287
+
288
+
289
+ ## References
290
+
291
+ - [Prefix sum array and difference array : Woburn C.I. PEGWiki](https://wcipeg.com/wiki/Prefix_sum_array_and_difference_array)
292
+ - [How to get the count of each distinct value in a column?](https://stackoverflow.com/q/7053902/1413259)
293
+ - [How to add region in java script file, visual studio](https://stackoverflow.com/a/51550649/1413259)
294
+ - [Operator precedence - JavaScript : MDN Web Docs](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Operator_precedence)
295
+ - [numpy.partition - NumPy Manual](https://numpy.org/doc/stable/reference/generated/numpy.partition.html)
296
+
297
+ <br>
298
+ <br>
299
+
300
+
301
+ [![](https://raw.githubusercontent.com/qb40/designs/gh-pages/0/image/11.png)](https://wolfram77.github.io)<br>
302
+ [![ORG](https://img.shields.io/badge/org-nodef-green?logo=Org)](https://nodef.github.io)
303
+ ![](https://ga-beacon.deno.dev/G-RC63DPBH3P:SH3Eq-NoQ9mwgYeHWxu7cw/github.com/nodef/extra-array)
304
+
305
+
306
+ [fromRange]: https://jsr.io/@nodef/extra-array/doc/~/fromRange
307
+ [fromInvocation]: https://jsr.io/@nodef/extra-array/doc/~/fromInvocation
308
+ [fromApplication]: https://jsr.io/@nodef/extra-array/doc/~/fromApplication
309
+ [fromIterable]: https://jsr.io/@nodef/extra-array/doc/~/fromIterable
310
+ [fromIterable$]: https://jsr.io/@nodef/extra-array/doc/~/fromIterable$
311
+ [shallowClone]: https://jsr.io/@nodef/extra-array/doc/~/shallowClone
312
+ [deepClone]: https://jsr.io/@nodef/extra-array/doc/~/deepClone
313
+ [is]: https://jsr.io/@nodef/extra-array/doc/~/is
314
+ [keys]: https://jsr.io/@nodef/extra-array/doc/~/keys
315
+ [values]: https://jsr.io/@nodef/extra-array/doc/~/values
316
+ [entries]: https://jsr.io/@nodef/extra-array/doc/~/entries
317
+ [index]: https://jsr.io/@nodef/extra-array/doc/~/index
318
+ [indexRange]: https://jsr.io/@nodef/extra-array/doc/~/indexRange
319
+ [isEmpty]: https://jsr.io/@nodef/extra-array/doc/~/isEmpty
320
+ [length]: https://jsr.io/@nodef/extra-array/doc/~/length
321
+ [resize$]: https://jsr.io/@nodef/extra-array/doc/~/resize$
322
+ [clear$]: https://jsr.io/@nodef/extra-array/doc/~/clear$
323
+ [get]: https://jsr.io/@nodef/extra-array/doc/~/get
324
+ [getAll]: https://jsr.io/@nodef/extra-array/doc/~/getAll
325
+ [getPath]: https://jsr.io/@nodef/extra-array/doc/~/getPath
326
+ [hasPath]: https://jsr.io/@nodef/extra-array/doc/~/hasPath
327
+ [set]: https://jsr.io/@nodef/extra-array/doc/~/set
328
+ [set$]: https://jsr.io/@nodef/extra-array/doc/~/set$
329
+ [setPath$]: https://jsr.io/@nodef/extra-array/doc/~/setPath$
330
+ [swap]: https://jsr.io/@nodef/extra-array/doc/~/swap
331
+ [swap$]: https://jsr.io/@nodef/extra-array/doc/~/swap$
332
+ [swapRanges]: https://jsr.io/@nodef/extra-array/doc/~/swapRanges
333
+ [swapRanges$]: https://jsr.io/@nodef/extra-array/doc/~/swapRanges$
334
+ [remove]: https://jsr.io/@nodef/extra-array/doc/~/remove
335
+ [remove$]: https://jsr.io/@nodef/extra-array/doc/~/remove$
336
+ [removePath$]: https://jsr.io/@nodef/extra-array/doc/~/removePath$
337
+ [isSorted]: https://jsr.io/@nodef/extra-array/doc/~/isSorted
338
+ [hasUnsortedValue]: https://jsr.io/@nodef/extra-array/doc/~/hasUnsortedValue
339
+ [searchUnsortedValue]: https://jsr.io/@nodef/extra-array/doc/~/searchUnsortedValue
340
+ [sort]: https://jsr.io/@nodef/extra-array/doc/~/sort
341
+ [sort$]: https://jsr.io/@nodef/extra-array/doc/~/sort$
342
+ [partialSort]: https://jsr.io/@nodef/extra-array/doc/~/partialSort
343
+ [partialSort$]: https://jsr.io/@nodef/extra-array/doc/~/partialSort$
344
+ [minimum]: https://jsr.io/@nodef/extra-array/doc/~/minimum
345
+ [minimumEntry]: https://jsr.io/@nodef/extra-array/doc/~/minimumEntry
346
+ [maximum]: https://jsr.io/@nodef/extra-array/doc/~/maximum
347
+ [maximumEntry]: https://jsr.io/@nodef/extra-array/doc/~/maximumEntry
348
+ [range]: https://jsr.io/@nodef/extra-array/doc/~/range
349
+ [rangeEntries]: https://jsr.io/@nodef/extra-array/doc/~/rangeEntries
350
+ [minimums]: https://jsr.io/@nodef/extra-array/doc/~/minimums
351
+ [minimumEntries]: https://jsr.io/@nodef/extra-array/doc/~/minimumEntries
352
+ [maximums]: https://jsr.io/@nodef/extra-array/doc/~/maximums
353
+ [maximumEntries]: https://jsr.io/@nodef/extra-array/doc/~/maximumEntries
354
+ [searchMinimumValue]: https://jsr.io/@nodef/extra-array/doc/~/searchMinimumValue
355
+ [searchMaximumValue]: https://jsr.io/@nodef/extra-array/doc/~/searchMaximumValue
356
+ [searchMinimumValues]: https://jsr.io/@nodef/extra-array/doc/~/searchMinimumValues
357
+ [searchMaximumValues]: https://jsr.io/@nodef/extra-array/doc/~/searchMaximumValues
358
+ [isEqual]: https://jsr.io/@nodef/extra-array/doc/~/isEqual
359
+ [compare]: https://jsr.io/@nodef/extra-array/doc/~/compare
360
+ [head]: https://jsr.io/@nodef/extra-array/doc/~/head
361
+ [tail]: https://jsr.io/@nodef/extra-array/doc/~/tail
362
+ [init]: https://jsr.io/@nodef/extra-array/doc/~/init
363
+ [last]: https://jsr.io/@nodef/extra-array/doc/~/last
364
+ [middle]: https://jsr.io/@nodef/extra-array/doc/~/middle
365
+ [slice]: https://jsr.io/@nodef/extra-array/doc/~/slice
366
+ [slice$]: https://jsr.io/@nodef/extra-array/doc/~/slice$
367
+ [includes]: https://jsr.io/@nodef/extra-array/doc/~/includes
368
+ [hasValue]: https://jsr.io/@nodef/extra-array/doc/~/hasValue
369
+ [searchValue]: https://jsr.io/@nodef/extra-array/doc/~/searchValue
370
+ [searchValueRight]: https://jsr.io/@nodef/extra-array/doc/~/searchValueRight
371
+ [searchValueAll]: https://jsr.io/@nodef/extra-array/doc/~/searchValueAll
372
+ [searchAdjacentDuplicateValue]: https://jsr.io/@nodef/extra-array/doc/~/searchAdjacentDuplicateValue
373
+ [searchMismatchedValue]: https://jsr.io/@nodef/extra-array/doc/~/searchMismatchedValue
374
+ [hasPrefix]: https://jsr.io/@nodef/extra-array/doc/~/hasPrefix
375
+ [hasSuffix]: https://jsr.io/@nodef/extra-array/doc/~/hasSuffix
376
+ [hasInfix]: https://jsr.io/@nodef/extra-array/doc/~/hasInfix
377
+ [hasSubsequence]: https://jsr.io/@nodef/extra-array/doc/~/hasSubsequence
378
+ [hasPermutation]: https://jsr.io/@nodef/extra-array/doc/~/hasPermutation
379
+ [prefixes]: https://jsr.io/@nodef/extra-array/doc/~/prefixes
380
+ [suffixes]: https://jsr.io/@nodef/extra-array/doc/~/suffixes
381
+ [infixes]: https://jsr.io/@nodef/extra-array/doc/~/infixes
382
+ [subsequences]: https://jsr.io/@nodef/extra-array/doc/~/subsequences
383
+ [permutations]: https://jsr.io/@nodef/extra-array/doc/~/permutations
384
+ [searchInfix]: https://jsr.io/@nodef/extra-array/doc/~/searchInfix
385
+ [searchInfixRight]: https://jsr.io/@nodef/extra-array/doc/~/searchInfixRight
386
+ [searchInfixAll]: https://jsr.io/@nodef/extra-array/doc/~/searchInfixAll
387
+ [searchSubsequence]: https://jsr.io/@nodef/extra-array/doc/~/searchSubsequence
388
+ [randomValue]: https://jsr.io/@nodef/extra-array/doc/~/randomValue
389
+ [randomPrefix]: https://jsr.io/@nodef/extra-array/doc/~/randomPrefix
390
+ [randomSuffix]: https://jsr.io/@nodef/extra-array/doc/~/randomSuffix
391
+ [randomInfix]: https://jsr.io/@nodef/extra-array/doc/~/randomInfix
392
+ [randomSubsequence]: https://jsr.io/@nodef/extra-array/doc/~/randomSubsequence
393
+ [randomPermutation]: https://jsr.io/@nodef/extra-array/doc/~/randomPermutation
394
+ [randomPermutation$]: https://jsr.io/@nodef/extra-array/doc/~/randomPermutation$
395
+ [find]: https://jsr.io/@nodef/extra-array/doc/~/find
396
+ [findRight]: https://jsr.io/@nodef/extra-array/doc/~/findRight
397
+ [take]: https://jsr.io/@nodef/extra-array/doc/~/take
398
+ [takeRight]: https://jsr.io/@nodef/extra-array/doc/~/takeRight
399
+ [takeWhile]: https://jsr.io/@nodef/extra-array/doc/~/takeWhile
400
+ [takeWhileRight]: https://jsr.io/@nodef/extra-array/doc/~/takeWhileRight
401
+ [drop]: https://jsr.io/@nodef/extra-array/doc/~/drop
402
+ [dropRight]: https://jsr.io/@nodef/extra-array/doc/~/dropRight
403
+ [dropWhile]: https://jsr.io/@nodef/extra-array/doc/~/dropWhile
404
+ [dropWhileRight]: https://jsr.io/@nodef/extra-array/doc/~/dropWhileRight
405
+ [scanWhile]: https://jsr.io/@nodef/extra-array/doc/~/scanWhile
406
+ [scanWhileRight]: https://jsr.io/@nodef/extra-array/doc/~/scanWhileRight
407
+ [scanUntil]: https://jsr.io/@nodef/extra-array/doc/~/scanUntil
408
+ [scanUntilRight]: https://jsr.io/@nodef/extra-array/doc/~/scanUntilRight
409
+ [indexOf]: https://jsr.io/@nodef/extra-array/doc/~/indexOf
410
+ [lastIndexOf]: https://jsr.io/@nodef/extra-array/doc/~/lastIndexOf
411
+ [search]: https://jsr.io/@nodef/extra-array/doc/~/search
412
+ [searchRight]: https://jsr.io/@nodef/extra-array/doc/~/searchRight
413
+ [searchAll]: https://jsr.io/@nodef/extra-array/doc/~/searchAll
414
+ [forEach]: https://jsr.io/@nodef/extra-array/doc/~/forEach
415
+ [some]: https://jsr.io/@nodef/extra-array/doc/~/some
416
+ [every]: https://jsr.io/@nodef/extra-array/doc/~/every
417
+ [map]: https://jsr.io/@nodef/extra-array/doc/~/map
418
+ [map$]: https://jsr.io/@nodef/extra-array/doc/~/map$
419
+ [reduce]: https://jsr.io/@nodef/extra-array/doc/~/reduce
420
+ [reduceRight]: https://jsr.io/@nodef/extra-array/doc/~/reduceRight
421
+ [filter]: https://jsr.io/@nodef/extra-array/doc/~/filter
422
+ [filter$]: https://jsr.io/@nodef/extra-array/doc/~/filter$
423
+ [filterAt]: https://jsr.io/@nodef/extra-array/doc/~/filterAt
424
+ [reject]: https://jsr.io/@nodef/extra-array/doc/~/reject
425
+ [reject$]: https://jsr.io/@nodef/extra-array/doc/~/reject$
426
+ [rejectAt]: https://jsr.io/@nodef/extra-array/doc/~/rejectAt
427
+ [flat]: https://jsr.io/@nodef/extra-array/doc/~/flat
428
+ [flatMap]: https://jsr.io/@nodef/extra-array/doc/~/flatMap
429
+ [exclusiveScan]: https://jsr.io/@nodef/extra-array/doc/~/exclusiveScan
430
+ [exclusiveScan$]: https://jsr.io/@nodef/extra-array/doc/~/exclusiveScan$
431
+ [inclusiveScan]: https://jsr.io/@nodef/extra-array/doc/~/inclusiveScan
432
+ [inclusiveScan$]: https://jsr.io/@nodef/extra-array/doc/~/inclusiveScan$
433
+ [adjacentCombine]: https://jsr.io/@nodef/extra-array/doc/~/adjacentCombine
434
+ [adjacentCombine$]: https://jsr.io/@nodef/extra-array/doc/~/adjacentCombine$
435
+ [intersperse]: https://jsr.io/@nodef/extra-array/doc/~/intersperse
436
+ [interpolate]: https://jsr.io/@nodef/extra-array/doc/~/interpolate
437
+ [intermix]: https://jsr.io/@nodef/extra-array/doc/~/intermix
438
+ [interleave]: https://jsr.io/@nodef/extra-array/doc/~/interleave
439
+ [zip]: https://jsr.io/@nodef/extra-array/doc/~/zip
440
+ [fill]: https://jsr.io/@nodef/extra-array/doc/~/fill
441
+ [fill$]: https://jsr.io/@nodef/extra-array/doc/~/fill$
442
+ [push]: https://jsr.io/@nodef/extra-array/doc/~/push
443
+ [push$]: https://jsr.io/@nodef/extra-array/doc/~/push$
444
+ [pop]: https://jsr.io/@nodef/extra-array/doc/~/pop
445
+ [pop$]: https://jsr.io/@nodef/extra-array/doc/~/pop$
446
+ [shift]: https://jsr.io/@nodef/extra-array/doc/~/shift
447
+ [shift$]: https://jsr.io/@nodef/extra-array/doc/~/shift$
448
+ [unshift]: https://jsr.io/@nodef/extra-array/doc/~/unshift
449
+ [unshift$]: https://jsr.io/@nodef/extra-array/doc/~/unshift$
450
+ [copy]: https://jsr.io/@nodef/extra-array/doc/~/copy
451
+ [copy$]: https://jsr.io/@nodef/extra-array/doc/~/copy$
452
+ [copyWithin]: https://jsr.io/@nodef/extra-array/doc/~/copyWithin
453
+ [copyWithin$]: https://jsr.io/@nodef/extra-array/doc/~/copyWithin$
454
+ [moveWithin]: https://jsr.io/@nodef/extra-array/doc/~/moveWithin
455
+ [moveWithin$]: https://jsr.io/@nodef/extra-array/doc/~/moveWithin$
456
+ [splice]: https://jsr.io/@nodef/extra-array/doc/~/splice
457
+ [splice$]: https://jsr.io/@nodef/extra-array/doc/~/splice$
458
+ [count]: https://jsr.io/@nodef/extra-array/doc/~/count
459
+ [countEach]: https://jsr.io/@nodef/extra-array/doc/~/countEach
460
+ [partition]: https://jsr.io/@nodef/extra-array/doc/~/partition
461
+ [partitionEach]: https://jsr.io/@nodef/extra-array/doc/~/partitionEach
462
+ [split]: https://jsr.io/@nodef/extra-array/doc/~/split
463
+ [splitAt]: https://jsr.io/@nodef/extra-array/doc/~/splitAt
464
+ [cut]: https://jsr.io/@nodef/extra-array/doc/~/cut
465
+ [cutRight]: https://jsr.io/@nodef/extra-array/doc/~/cutRight
466
+ [cutAt]: https://jsr.io/@nodef/extra-array/doc/~/cutAt
467
+ [cutAtRight]: https://jsr.io/@nodef/extra-array/doc/~/cutAtRight
468
+ [group]: https://jsr.io/@nodef/extra-array/doc/~/group
469
+ [chunk]: https://jsr.io/@nodef/extra-array/doc/~/chunk
470
+ [concat]: https://jsr.io/@nodef/extra-array/doc/~/concat
471
+ [concat$]: https://jsr.io/@nodef/extra-array/doc/~/concat$
472
+ [join]: https://jsr.io/@nodef/extra-array/doc/~/join
473
+ [cycle]: https://jsr.io/@nodef/extra-array/doc/~/cycle
474
+ [repeat]: https://jsr.io/@nodef/extra-array/doc/~/repeat
475
+ [reverse]: https://jsr.io/@nodef/extra-array/doc/~/reverse
476
+ [reverse$]: https://jsr.io/@nodef/extra-array/doc/~/reverse$
477
+ [rotate]: https://jsr.io/@nodef/extra-array/doc/~/rotate
478
+ [rotate$]: https://jsr.io/@nodef/extra-array/doc/~/rotate$
479
+ [isUnique]: https://jsr.io/@nodef/extra-array/doc/~/isUnique
480
+ [isDisjoint]: https://jsr.io/@nodef/extra-array/doc/~/isDisjoint
481
+ [unique]: https://jsr.io/@nodef/extra-array/doc/~/unique
482
+ [union]: https://jsr.io/@nodef/extra-array/doc/~/union
483
+ [union$]: https://jsr.io/@nodef/extra-array/doc/~/union$
484
+ [intersection]: https://jsr.io/@nodef/extra-array/doc/~/intersection
485
+ [difference]: https://jsr.io/@nodef/extra-array/doc/~/difference
486
+ [symmetricDifference]: https://jsr.io/@nodef/extra-array/doc/~/symmetricDifference
487
+ [cartesianProduct]: https://jsr.io/@nodef/extra-array/doc/~/cartesianProduct
package/deno.lock ADDED
@@ -0,0 +1,54 @@
1
+ {
2
+ "version": "5",
3
+ "specifiers": {
4
+ "jsr:@nodef/extra-function@^1.4.1": "1.4.1",
5
+ "jsr:@nodef/extra-math@^1.6.1": "1.6.1",
6
+ "jsr:@nodef/extra-number@^2.6.0": "2.6.0",
7
+ "jsr:@std/assert@^1.0.19": "1.0.19",
8
+ "jsr:@std/cli@^1.0.32": "1.0.32",
9
+ "jsr:@std/fmt@^1.0.10": "1.0.10",
10
+ "jsr:@std/internal@^1.0.12": "1.0.14",
11
+ "jsr:@std/internal@^1.0.14": "1.0.14"
12
+ },
13
+ "jsr": {
14
+ "@nodef/extra-function@1.4.1": {
15
+ "integrity": "43be508904a624352563550eb01a2d46da56c72cb87cd9667c2291e6883bfc7a"
16
+ },
17
+ "@nodef/extra-math@1.6.1": {
18
+ "integrity": "fa82c802c7a0f4336a8073578292fc7d754817a7d61207534ed0743770d63d06",
19
+ "dependencies": [
20
+ "jsr:@nodef/extra-number"
21
+ ]
22
+ },
23
+ "@nodef/extra-number@2.6.0": {
24
+ "integrity": "92742ec2c9f9cbd82fbf84a5cb8da6738d7a4e92bf4aac90cdd96712e9683db8"
25
+ },
26
+ "@std/assert@1.0.19": {
27
+ "integrity": "eaada96ee120cb980bc47e040f82814d786fe8162ecc53c91d8df60b8755991e",
28
+ "dependencies": [
29
+ "jsr:@std/internal@^1.0.12"
30
+ ]
31
+ },
32
+ "@std/cli@1.0.32": {
33
+ "integrity": "188b3a100d6202d64e3f5bd3d799c7fa4f6d77f92cc65eb7f641c1fa0aa92a66",
34
+ "dependencies": [
35
+ "jsr:@std/fmt",
36
+ "jsr:@std/internal@^1.0.14"
37
+ ]
38
+ },
39
+ "@std/fmt@1.0.10": {
40
+ "integrity": "90dfba288802ac6de82fb31d0917eb9e4450b9925b954d5e51fc29ac07419db5"
41
+ },
42
+ "@std/internal@1.0.14": {
43
+ "integrity": "291516b3d4c35024d6ffbc0a9df5bf4c64116e05b50012cf846710152d2ffdf7"
44
+ }
45
+ },
46
+ "workspace": {
47
+ "dependencies": [
48
+ "jsr:@nodef/extra-function@^1.4.1",
49
+ "jsr:@nodef/extra-math@^1.6.1",
50
+ "jsr:@std/assert@^1.0.19",
51
+ "jsr:@std/cli@^1.0.32"
52
+ ]
53
+ }
54
+ }