@rimbu/base 2.0.0 → 2.0.2
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/README.md +22 -20
- package/dist/cjs/arr.cjs +196 -223
- package/dist/cjs/arr.cjs.map +1 -0
- package/dist/cjs/entry.cjs +8 -32
- package/dist/cjs/entry.cjs.map +1 -0
- package/dist/cjs/index.cjs +9 -320
- package/dist/cjs/index.cjs.map +1 -0
- package/dist/cjs/index.d.cts +5 -0
- package/dist/cjs/internal.cjs +4 -31
- package/dist/cjs/internal.cjs.map +1 -0
- package/dist/cjs/internal.d.cts +1 -0
- package/dist/cjs/plain-object.cjs +21 -32
- package/dist/cjs/plain-object.cjs.map +1 -0
- package/dist/cjs/rimbu-error.cjs +45 -66
- package/dist/cjs/rimbu-error.cjs.map +1 -0
- package/dist/cjs/token.cjs +4 -29
- package/dist/cjs/token.cjs.map +1 -0
- package/dist/esm/arr.d.mts +33 -0
- package/dist/esm/entry.d.mts +2 -0
- package/dist/esm/plain-object.d.mts +62 -0
- package/dist/esm/rimbu-error.d.mts +16 -0
- package/dist/esm/token.d.mts +2 -0
- package/package.json +19 -13
- /package/dist/{types/arr.d.mts → cjs/arr.d.cts} +0 -0
- /package/dist/{types/entry.d.mts → cjs/entry.d.cts} +0 -0
- /package/dist/{types/plain-object.d.mts → cjs/plain-object.d.cts} +0 -0
- /package/dist/{types/rimbu-error.d.mts → cjs/rimbu-error.d.cts} +0 -0
- /package/dist/{types/token.d.mts → cjs/token.d.cts} +0 -0
- /package/dist/{types → esm}/index.d.mts +0 -0
- /package/dist/{types → esm}/internal.d.mts +0 -0
package/README.md
CHANGED
|
@@ -18,30 +18,34 @@ For complete documentation please visit the _[Rimbu Docs](https://rimbu.org)_ or
|
|
|
18
18
|
|
|
19
19
|
### Compabitity
|
|
20
20
|
|
|
21
|
-
- [`Node
|
|
21
|
+
- [`Node` ](https://nodejs.org)
|
|
22
22
|
- [`Deno` ](https://deno.com/runtime)
|
|
23
|
-
- [`Bun
|
|
23
|
+
- [`Bun` ](https://bun.sh/)
|
|
24
24
|
- `Web` 
|
|
25
25
|
|
|
26
|
-
###
|
|
26
|
+
### Package Managers
|
|
27
27
|
|
|
28
|
-
|
|
28
|
+
**Yarn:**
|
|
29
29
|
|
|
30
|
-
|
|
31
|
-
|
|
32
|
-
|
|
30
|
+
```sh
|
|
31
|
+
yarn add @rimbu/base
|
|
32
|
+
```
|
|
33
33
|
|
|
34
|
-
|
|
34
|
+
**npm:**
|
|
35
35
|
|
|
36
|
-
|
|
36
|
+
```sh
|
|
37
|
+
npm install @rimbu/base
|
|
38
|
+
```
|
|
37
39
|
|
|
38
|
-
|
|
40
|
+
**Bun:**
|
|
39
41
|
|
|
40
|
-
|
|
42
|
+
```sh
|
|
43
|
+
bun add @rimbu/base
|
|
44
|
+
```
|
|
41
45
|
|
|
42
|
-
|
|
46
|
+
### Deno Setup
|
|
43
47
|
|
|
44
|
-
|
|
48
|
+
Create or edit `import_map.json` in your project root:
|
|
45
49
|
|
|
46
50
|
```json
|
|
47
51
|
{
|
|
@@ -51,7 +55,7 @@ In the root folder of your project, create or edit a file called `import_map.jso
|
|
|
51
55
|
}
|
|
52
56
|
```
|
|
53
57
|
|
|
54
|
-
|
|
58
|
+
_Replace `x.y.z` with the desired version._
|
|
55
59
|
|
|
56
60
|
In this way you can use relative imports from Rimbu in your code, like so:
|
|
57
61
|
|
|
@@ -85,20 +89,18 @@ console.log(arr);
|
|
|
85
89
|
|
|
86
90
|
## Author
|
|
87
91
|
|
|
88
|
-
[Arvid Nicolaas](https://github.com/vitoke)
|
|
92
|
+
Created and maintained by [Arvid Nicolaas](https://github.com/vitoke).
|
|
89
93
|
|
|
90
94
|
## Contributing
|
|
91
95
|
|
|
92
|
-
|
|
96
|
+
We welcome contributions! Please read our [Contributing guide](https://github.com/rimbu-org/rimbu/blob/main/CONTRIBUTING.md).
|
|
93
97
|
|
|
94
98
|
## Contributors
|
|
95
99
|
|
|
96
100
|
<img src = "https://contrib.rocks/image?repo=rimbu-org/rimbu"/>
|
|
97
101
|
|
|
98
|
-
|
|
102
|
+
_Made with [contributors-img](https://contrib.rocks)._
|
|
99
103
|
|
|
100
104
|
## License
|
|
101
105
|
|
|
102
|
-
|
|
103
|
-
|
|
104
|
-
See [LICENSE](./LICENSE) for more information.
|
|
106
|
+
This project is licensed under the MIT License. See the [LICENSE](./LICENSE) for details.
|
package/dist/cjs/arr.cjs
CHANGED
|
@@ -1,267 +1,240 @@
|
|
|
1
1
|
"use strict";
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
|
|
13
|
-
|
|
14
|
-
|
|
15
|
-
|
|
16
|
-
|
|
17
|
-
|
|
18
|
-
|
|
19
|
-
|
|
20
|
-
|
|
21
|
-
|
|
22
|
-
|
|
23
|
-
|
|
24
|
-
|
|
25
|
-
|
|
26
|
-
|
|
27
|
-
|
|
28
|
-
|
|
29
|
-
|
|
30
|
-
_modOld: () => _modOld,
|
|
31
|
-
_prependNew: () => _prependNew,
|
|
32
|
-
_prependOld: () => _prependOld,
|
|
33
|
-
_reverseNew: () => _reverseNew,
|
|
34
|
-
_reverseOld: () => _reverseOld,
|
|
35
|
-
_spliceNew: () => _spliceNew,
|
|
36
|
-
_spliceOld: () => _spliceOld,
|
|
37
|
-
_updateNew: () => _updateNew,
|
|
38
|
-
_updateOld: () => _updateOld,
|
|
39
|
-
append: () => append,
|
|
40
|
-
concat: () => concat,
|
|
41
|
-
copySparse: () => copySparse,
|
|
42
|
-
forEach: () => forEach,
|
|
43
|
-
init: () => init,
|
|
44
|
-
insert: () => insert,
|
|
45
|
-
last: () => last,
|
|
46
|
-
map: () => map,
|
|
47
|
-
mapSparse: () => mapSparse,
|
|
48
|
-
mod: () => mod,
|
|
49
|
-
prepend: () => prepend,
|
|
50
|
-
reverse: () => reverse,
|
|
51
|
-
reverseMap: () => reverseMap,
|
|
52
|
-
splice: () => splice,
|
|
53
|
-
tail: () => tail,
|
|
54
|
-
update: () => update
|
|
55
|
-
});
|
|
56
|
-
module.exports = __toCommonJS(arr_exports);
|
|
57
|
-
var import_common = require("@rimbu/common");
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
exports.splice = exports.insert = exports.mod = exports.update = exports.last = exports.prepend = exports.reverse = exports.append = void 0;
|
|
4
|
+
exports._appendNew = _appendNew;
|
|
5
|
+
exports._appendOld = _appendOld;
|
|
6
|
+
exports.concat = concat;
|
|
7
|
+
exports._reverseNew = _reverseNew;
|
|
8
|
+
exports._reverseOld = _reverseOld;
|
|
9
|
+
exports.forEach = forEach;
|
|
10
|
+
exports.map = map;
|
|
11
|
+
exports.reverseMap = reverseMap;
|
|
12
|
+
exports._prependNew = _prependNew;
|
|
13
|
+
exports._prependOld = _prependOld;
|
|
14
|
+
exports._lastNew = _lastNew;
|
|
15
|
+
exports._lastOld = _lastOld;
|
|
16
|
+
exports._updateNew = _updateNew;
|
|
17
|
+
exports._updateOld = _updateOld;
|
|
18
|
+
exports._modNew = _modNew;
|
|
19
|
+
exports._modOld = _modOld;
|
|
20
|
+
exports._insertNew = _insertNew;
|
|
21
|
+
exports._insertOld = _insertOld;
|
|
22
|
+
exports.tail = tail;
|
|
23
|
+
exports.init = init;
|
|
24
|
+
exports._spliceNew = _spliceNew;
|
|
25
|
+
exports._spliceOld = _spliceOld;
|
|
26
|
+
exports.copySparse = copySparse;
|
|
27
|
+
exports.mapSparse = mapSparse;
|
|
28
|
+
var tslib_1 = require("tslib");
|
|
29
|
+
var common_1 = require("@rimbu/common");
|
|
58
30
|
function _appendNew(array, value) {
|
|
59
|
-
|
|
31
|
+
return array.toSpliced(array.length, 0, value);
|
|
60
32
|
}
|
|
61
33
|
function _appendOld(array, value) {
|
|
62
|
-
|
|
63
|
-
|
|
64
|
-
|
|
34
|
+
var clone = array.slice();
|
|
35
|
+
clone.push(value);
|
|
36
|
+
return clone;
|
|
65
37
|
}
|
|
66
|
-
|
|
38
|
+
// Returns a copy of the array with the given value appended
|
|
39
|
+
exports.append = "toSpliced" in Array.prototype ? _appendNew : _appendOld;
|
|
40
|
+
// Returns the concatenation of the two arrays, potentially reusing the input array if one of the arrays is empty
|
|
67
41
|
function concat(first, second) {
|
|
68
|
-
|
|
69
|
-
|
|
70
|
-
|
|
71
|
-
|
|
72
|
-
|
|
42
|
+
if (first.length === 0)
|
|
43
|
+
return second;
|
|
44
|
+
if (second.length === 0)
|
|
45
|
+
return first;
|
|
46
|
+
return first.concat(second);
|
|
73
47
|
}
|
|
74
48
|
function _reverseNew(array, start, end) {
|
|
75
|
-
|
|
76
|
-
|
|
49
|
+
var source = undefined !== start || undefined !== end
|
|
50
|
+
? array.slice(start !== null && start !== void 0 ? start : 0, (end !== null && end !== void 0 ? end : array.length - 1) + 1)
|
|
51
|
+
: array;
|
|
52
|
+
return source.toReversed();
|
|
77
53
|
}
|
|
78
54
|
function _reverseOld(array, start, end) {
|
|
79
|
-
|
|
80
|
-
|
|
81
|
-
|
|
82
|
-
|
|
83
|
-
|
|
84
|
-
|
|
85
|
-
|
|
86
|
-
|
|
87
|
-
|
|
88
|
-
}
|
|
89
|
-
|
|
90
|
-
|
|
91
|
-
|
|
92
|
-
|
|
93
|
-
|
|
94
|
-
|
|
95
|
-
|
|
96
|
-
|
|
97
|
-
|
|
55
|
+
var _start = start !== null && start !== void 0 ? start : 0;
|
|
56
|
+
var _end = end !== null && end !== void 0 ? end : array.length - 1;
|
|
57
|
+
var length = _end - _start + 1;
|
|
58
|
+
var res = [];
|
|
59
|
+
var arrayIndex = _start - 1;
|
|
60
|
+
var resIndex = length - 1;
|
|
61
|
+
while (++arrayIndex <= _end)
|
|
62
|
+
res[resIndex--] = array[arrayIndex];
|
|
63
|
+
return res;
|
|
64
|
+
}
|
|
65
|
+
// Returns an copy of the array between the start and end indices, with the elements in reversed order.
|
|
66
|
+
exports.reverse = 'toReversed' in Array.prototype ? _reverseNew : _reverseOld;
|
|
67
|
+
// Performs given function on each element of the array, in reverse order if 'reversed' is true.
|
|
68
|
+
function forEach(array, f, state, reversed) {
|
|
69
|
+
if (state === void 0) { state = (0, common_1.TraverseState)(); }
|
|
70
|
+
if (reversed === void 0) { reversed = false; }
|
|
71
|
+
if (state.halted)
|
|
72
|
+
return;
|
|
73
|
+
var halt = state.halt;
|
|
74
|
+
if (reversed) {
|
|
75
|
+
var i = array.length;
|
|
76
|
+
while (!state.halted && --i >= 0) {
|
|
77
|
+
f(array[i], state.nextIndex(), halt);
|
|
78
|
+
}
|
|
98
79
|
}
|
|
99
|
-
|
|
100
|
-
|
|
101
|
-
|
|
102
|
-
|
|
103
|
-
|
|
80
|
+
else {
|
|
81
|
+
var length = array.length;
|
|
82
|
+
var i = -1;
|
|
83
|
+
while (!state.halted && ++i < length) {
|
|
84
|
+
f(array[i], state.nextIndex(), halt);
|
|
85
|
+
}
|
|
104
86
|
}
|
|
105
|
-
}
|
|
106
|
-
}
|
|
107
|
-
function map(array, f, indexOffset = 0) {
|
|
108
|
-
if (indexOffset === 0) {
|
|
109
|
-
return array.map(f);
|
|
110
|
-
}
|
|
111
|
-
const result = [];
|
|
112
|
-
let index = indexOffset;
|
|
113
|
-
let i = -1;
|
|
114
|
-
const length = array.length;
|
|
115
|
-
while (++i < length) {
|
|
116
|
-
result[i] = f(array[i], index++);
|
|
117
|
-
}
|
|
118
|
-
return result;
|
|
119
87
|
}
|
|
120
|
-
|
|
121
|
-
|
|
122
|
-
|
|
123
|
-
|
|
124
|
-
|
|
125
|
-
|
|
126
|
-
|
|
127
|
-
|
|
88
|
+
// Returns a copy of the array where given function is applied to each element
|
|
89
|
+
function map(array, f, indexOffset) {
|
|
90
|
+
if (indexOffset === void 0) { indexOffset = 0; }
|
|
91
|
+
if (indexOffset === 0) {
|
|
92
|
+
// without offset, can use standard array map
|
|
93
|
+
return array.map(f);
|
|
94
|
+
}
|
|
95
|
+
var result = [];
|
|
96
|
+
var index = indexOffset;
|
|
97
|
+
var i = -1;
|
|
98
|
+
var length = array.length;
|
|
99
|
+
while (++i < length) {
|
|
100
|
+
result[i] = f(array[i], index++);
|
|
101
|
+
}
|
|
102
|
+
return result;
|
|
103
|
+
}
|
|
104
|
+
// Returns a copy of the array where given functio is applied to each element in reverse order
|
|
105
|
+
function reverseMap(array, f, indexOffset) {
|
|
106
|
+
if (indexOffset === void 0) { indexOffset = 0; }
|
|
107
|
+
var result = [];
|
|
108
|
+
var index = indexOffset;
|
|
109
|
+
var arrayIndex = array.length;
|
|
110
|
+
var resultIndex = 0;
|
|
111
|
+
while (--arrayIndex >= 0)
|
|
112
|
+
result[resultIndex++] = f(array[arrayIndex], index++);
|
|
113
|
+
return result;
|
|
128
114
|
}
|
|
129
115
|
function _prependNew(array, value) {
|
|
130
|
-
|
|
116
|
+
return array.toSpliced(0, 0, value);
|
|
131
117
|
}
|
|
132
118
|
function _prependOld(array, value) {
|
|
133
|
-
|
|
134
|
-
|
|
135
|
-
|
|
119
|
+
var clone = array.slice();
|
|
120
|
+
clone.unshift(value);
|
|
121
|
+
return clone;
|
|
136
122
|
}
|
|
137
|
-
|
|
123
|
+
// Returns a copy of the given array with the given value added at the start
|
|
124
|
+
exports.prepend = "toSpliced" in Array.prototype ? _prependNew : _prependOld;
|
|
138
125
|
function _lastNew(arr) {
|
|
139
|
-
|
|
126
|
+
return arr.at(-1);
|
|
140
127
|
}
|
|
141
128
|
function _lastOld(arr) {
|
|
142
|
-
|
|
129
|
+
return arr[arr.length - 1];
|
|
143
130
|
}
|
|
144
|
-
|
|
131
|
+
// Returns the last element of the array
|
|
132
|
+
exports.last = "at" in Array.prototype ? _lastNew : _lastOld;
|
|
145
133
|
function _updateNew(arr, index, updater) {
|
|
146
|
-
|
|
147
|
-
|
|
148
|
-
|
|
149
|
-
|
|
150
|
-
|
|
151
|
-
|
|
152
|
-
|
|
153
|
-
|
|
154
|
-
|
|
134
|
+
if (index < 0 || index >= arr.length) {
|
|
135
|
+
return arr;
|
|
136
|
+
}
|
|
137
|
+
var curValue = arr[index];
|
|
138
|
+
var newValue = (0, common_1.Update)(curValue, updater);
|
|
139
|
+
if (Object.is(newValue, curValue)) {
|
|
140
|
+
return arr;
|
|
141
|
+
}
|
|
142
|
+
return arr.with(index, newValue);
|
|
155
143
|
}
|
|
156
144
|
function _updateOld(arr, index, updater) {
|
|
157
|
-
|
|
158
|
-
|
|
159
|
-
|
|
160
|
-
|
|
161
|
-
|
|
162
|
-
|
|
163
|
-
|
|
164
|
-
|
|
165
|
-
|
|
166
|
-
|
|
167
|
-
|
|
145
|
+
if (index < 0 || index >= arr.length) {
|
|
146
|
+
return arr;
|
|
147
|
+
}
|
|
148
|
+
var curValue = arr[index];
|
|
149
|
+
var newValue = (0, common_1.Update)(curValue, updater);
|
|
150
|
+
if (Object.is(newValue, curValue)) {
|
|
151
|
+
return arr;
|
|
152
|
+
}
|
|
153
|
+
var newArr = arr.slice();
|
|
154
|
+
newArr[index] = newValue;
|
|
155
|
+
return newArr;
|
|
168
156
|
}
|
|
169
|
-
|
|
157
|
+
// Returns a copy of the array where the element at given index is replaced by the given updater.
|
|
158
|
+
// If the new element is the same as the old element, the original array is returned
|
|
159
|
+
exports.update = "with" in Array.prototype ? _updateNew : _updateOld;
|
|
170
160
|
function _modNew(arr, index, f) {
|
|
171
|
-
|
|
172
|
-
|
|
173
|
-
|
|
174
|
-
|
|
175
|
-
|
|
176
|
-
|
|
177
|
-
|
|
178
|
-
|
|
179
|
-
|
|
161
|
+
if (index < 0 || index >= arr.length) {
|
|
162
|
+
return arr;
|
|
163
|
+
}
|
|
164
|
+
var curValue = arr[index];
|
|
165
|
+
var newValue = f(curValue);
|
|
166
|
+
if (Object.is(newValue, curValue)) {
|
|
167
|
+
return arr;
|
|
168
|
+
}
|
|
169
|
+
return arr.with(index, newValue);
|
|
180
170
|
}
|
|
181
171
|
function _modOld(arr, index, f) {
|
|
182
|
-
|
|
183
|
-
|
|
184
|
-
|
|
185
|
-
|
|
186
|
-
|
|
187
|
-
|
|
188
|
-
|
|
189
|
-
|
|
190
|
-
|
|
191
|
-
|
|
192
|
-
|
|
172
|
+
if (index < 0 || index >= arr.length) {
|
|
173
|
+
return arr;
|
|
174
|
+
}
|
|
175
|
+
var curValue = arr[index];
|
|
176
|
+
var newValue = f(curValue);
|
|
177
|
+
if (Object.is(newValue, curValue)) {
|
|
178
|
+
return arr;
|
|
179
|
+
}
|
|
180
|
+
var newArr = arr.slice();
|
|
181
|
+
newArr[index] = newValue;
|
|
182
|
+
return newArr;
|
|
193
183
|
}
|
|
194
|
-
|
|
184
|
+
// Returns a copy of the array where the element at given index is replaced by applying given function.
|
|
185
|
+
// If the new element is the same as the old element, the original array is returned
|
|
186
|
+
exports.mod = "with" in Array.prototype ? _modNew : _modOld;
|
|
195
187
|
function _insertNew(arr, index, value) {
|
|
196
|
-
|
|
188
|
+
return arr.toSpliced(index, 0, value);
|
|
197
189
|
}
|
|
198
190
|
function _insertOld(arr, index, value) {
|
|
199
|
-
|
|
200
|
-
|
|
201
|
-
|
|
191
|
+
var clone = arr.slice();
|
|
192
|
+
clone.splice(index, 0, value);
|
|
193
|
+
return clone;
|
|
202
194
|
}
|
|
203
|
-
|
|
195
|
+
// Returns a copy of the array where at given index the given value is inserted
|
|
196
|
+
exports.insert = "toSpliced" in Array.prototype ? _insertNew : _insertOld;
|
|
197
|
+
// Returns a copy of the array, without its first element
|
|
204
198
|
function tail(arr) {
|
|
205
|
-
|
|
199
|
+
return arr.slice(1);
|
|
206
200
|
}
|
|
201
|
+
// Returns a copy of the array, without its last element
|
|
207
202
|
function init(arr) {
|
|
208
|
-
|
|
203
|
+
return arr.slice(0, arr.length - 1);
|
|
209
204
|
}
|
|
210
|
-
function _spliceNew(arr, start, deleteCount
|
|
211
|
-
|
|
205
|
+
function _spliceNew(arr, start, deleteCount) {
|
|
206
|
+
var items = [];
|
|
207
|
+
for (var _i = 3; _i < arguments.length; _i++) {
|
|
208
|
+
items[_i - 3] = arguments[_i];
|
|
209
|
+
}
|
|
210
|
+
return arr.toSpliced.apply(arr, tslib_1.__spreadArray([start, deleteCount], tslib_1.__read(items), false));
|
|
212
211
|
}
|
|
213
|
-
function _spliceOld(arr, start, deleteCount
|
|
214
|
-
|
|
215
|
-
|
|
216
|
-
|
|
212
|
+
function _spliceOld(arr, start, deleteCount) {
|
|
213
|
+
var items = [];
|
|
214
|
+
for (var _i = 3; _i < arguments.length; _i++) {
|
|
215
|
+
items[_i - 3] = arguments[_i];
|
|
216
|
+
}
|
|
217
|
+
var clone = arr.slice();
|
|
218
|
+
clone.splice.apply(clone, tslib_1.__spreadArray([start, deleteCount], tslib_1.__read(items), false));
|
|
219
|
+
return clone;
|
|
217
220
|
}
|
|
218
|
-
|
|
221
|
+
// Immutable version of the array .splice command, always returns a new array
|
|
222
|
+
exports.splice = "toSpliced" in Array.prototype ? _spliceNew : _spliceOld;
|
|
223
|
+
// Returns a copy of the array, where its 'sparse' property is kept (sparse = not all indices have a value)
|
|
219
224
|
function copySparse(arr) {
|
|
220
|
-
|
|
221
|
-
|
|
222
|
-
|
|
223
|
-
|
|
224
|
-
|
|
225
|
+
var clone = [];
|
|
226
|
+
for (var key in arr) {
|
|
227
|
+
clone[key] = arr[key];
|
|
228
|
+
}
|
|
229
|
+
return clone;
|
|
225
230
|
}
|
|
231
|
+
// Returns a copy of the array with given function applied to each element, where its 'sparse' property is kept
|
|
232
|
+
// (sparse = not all indices have a value)
|
|
226
233
|
function mapSparse(arr, f) {
|
|
227
|
-
|
|
228
|
-
|
|
229
|
-
|
|
230
|
-
|
|
231
|
-
|
|
234
|
+
var result = Array(arr.length);
|
|
235
|
+
for (var key in arr) {
|
|
236
|
+
result[key] = f(arr[key], key);
|
|
237
|
+
}
|
|
238
|
+
return result;
|
|
232
239
|
}
|
|
233
|
-
|
|
234
|
-
0 && (module.exports = {
|
|
235
|
-
_appendNew,
|
|
236
|
-
_appendOld,
|
|
237
|
-
_insertNew,
|
|
238
|
-
_insertOld,
|
|
239
|
-
_lastNew,
|
|
240
|
-
_lastOld,
|
|
241
|
-
_modNew,
|
|
242
|
-
_modOld,
|
|
243
|
-
_prependNew,
|
|
244
|
-
_prependOld,
|
|
245
|
-
_reverseNew,
|
|
246
|
-
_reverseOld,
|
|
247
|
-
_spliceNew,
|
|
248
|
-
_spliceOld,
|
|
249
|
-
_updateNew,
|
|
250
|
-
_updateOld,
|
|
251
|
-
append,
|
|
252
|
-
concat,
|
|
253
|
-
copySparse,
|
|
254
|
-
forEach,
|
|
255
|
-
init,
|
|
256
|
-
insert,
|
|
257
|
-
last,
|
|
258
|
-
map,
|
|
259
|
-
mapSparse,
|
|
260
|
-
mod,
|
|
261
|
-
prepend,
|
|
262
|
-
reverse,
|
|
263
|
-
reverseMap,
|
|
264
|
-
splice,
|
|
265
|
-
tail,
|
|
266
|
-
update
|
|
267
|
-
});
|
|
240
|
+
//# sourceMappingURL=arr.cjs.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"arr.cjs","sourceRoot":"","sources":["../../_cjs_prepare/arr.cts"],"names":[],"mappings":";;;AAEA,gCAEC;AAED,gCAIC;AAMD,wBAOC;AAED,kCAWC;AAED,kCAgBC;AAOD,0BAwBC;AAGD,kBAmBC;AAGD,gCAcC;AAED,kCAKC;AAED,kCAOC;AAMD,4BAEC;AAED,4BAEC;AAKD,gCAgBC;AAED,gCAkBC;AAMD,0BAiBC;AAED,0BAmBC;AAMD,gCAEC;AAED,gCAIC;AAMD,oBAEC;AAGD,oBAEC;AAED,gCAOC;AAED,gCASC;AAMD,gCAMC;AAID,8BAWC;;AAvTD,wCAA0E;AAE1E,SAAgB,UAAU,CAAI,KAAmB,EAAE,KAAQ;IACzD,OAAO,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,KAAK,CAAqB,CAAC;AACrE,CAAC;AAED,SAAgB,UAAU,CAAI,KAAmB,EAAE,KAAQ;IACzD,IAAM,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;IAC5B,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClB,OAAO,KAAyB,CAAC;AACnC,CAAC;AAED,4DAA4D;AAC/C,QAAA,MAAM,GAAG,WAAW,IAAI,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC;AAE/E,iHAAiH;AACjH,SAAgB,MAAM,CACpB,KAAmB,EACnB,MAAoB;IAEpB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,MAAM,CAAC;IACtC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACtC,OAAO,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;AAC9B,CAAC;AAED,SAAgB,WAAW,CACzB,KAAmB,EACnB,KAAc,EACd,GAAY;IAEZ,IAAM,MAAM,GACV,SAAS,KAAK,KAAK,IAAI,SAAS,KAAK,GAAG;QACtC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,aAAL,KAAK,cAAL,KAAK,GAAI,CAAC,EAAE,CAAC,GAAG,aAAH,GAAG,cAAH,GAAG,GAAI,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACxD,CAAC,CAAC,KAAK,CAAC;IAEZ,OAAO,MAAM,CAAC,UAAU,EAAE,CAAC;AAC7B,CAAC;AAED,SAAgB,WAAW,CACzB,KAAmB,EACnB,KAAc,EACd,GAAY;IAEZ,IAAM,MAAM,GAAG,KAAK,aAAL,KAAK,cAAL,KAAK,GAAI,CAAC,CAAC;IAC1B,IAAM,IAAI,GAAG,GAAG,aAAH,GAAG,cAAH,GAAG,GAAI,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACrC,IAAM,MAAM,GAAG,IAAI,GAAG,MAAM,GAAG,CAAC,CAAC;IACjC,IAAM,GAAG,GAAG,EAAS,CAAC;IAEtB,IAAI,UAAU,GAAG,MAAM,GAAG,CAAC,CAAC;IAC5B,IAAI,QAAQ,GAAG,MAAM,GAAG,CAAC,CAAC;IAE1B,OAAO,EAAE,UAAU,IAAI,IAAI;QAAE,GAAG,CAAC,QAAQ,EAAE,CAAC,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC;IAEjE,OAAO,GAAG,CAAC;AACb,CAAC;AAED,uGAAuG;AAC1F,QAAA,OAAO,GAClB,YAAY,IAAI,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC;AAE9D,gGAAgG;AAChG,SAAgB,OAAO,CACrB,KAAmB,EACnB,CAAsD,EACtD,KAAsC,EACtC,QAAgB;IADhB,sBAAA,EAAA,YAAuB,sBAAa,GAAE;IACtC,yBAAA,EAAA,gBAAgB;IAEhB,IAAI,KAAK,CAAC,MAAM;QAAE,OAAO;IAEjB,IAAA,IAAI,GAAK,KAAK,KAAV,CAAW;IAEvB,IAAI,QAAQ,EAAE,CAAC;QACb,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;QAErB,OAAO,CAAC,KAAK,CAAC,MAAM,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACjC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,SAAS,EAAE,EAAE,IAAI,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;SAAM,CAAC;QACN,IAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;QAC5B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QAEX,OAAO,CAAC,KAAK,CAAC,MAAM,IAAI,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC;YACrC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,SAAS,EAAE,EAAE,IAAI,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,SAAgB,GAAG,CACjB,KAAmB,EACnB,CAAiC,EACjC,WAAe;IAAf,4BAAA,EAAA,eAAe;IAEf,IAAI,WAAW,KAAK,CAAC,EAAE,CAAC;QACtB,6CAA6C;QAC7C,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;IAED,IAAM,MAAM,GAAQ,EAAE,CAAC;IAEvB,IAAI,KAAK,GAAG,WAAW,CAAC;IACxB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IACX,IAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAC5B,OAAO,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC;QACpB,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;IACnC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,8FAA8F;AAC9F,SAAgB,UAAU,CACxB,KAAmB,EACnB,CAAiC,EACjC,WAAe;IAAf,4BAAA,EAAA,eAAe;IAEf,IAAM,MAAM,GAAQ,EAAE,CAAC;IAEvB,IAAI,KAAK,GAAG,WAAW,CAAC;IACxB,IAAI,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC;IAC9B,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,OAAO,EAAE,UAAU,IAAI,CAAC;QACtB,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;IAExD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAgB,WAAW,CACzB,KAAmB,EACnB,KAAQ;IAER,OAAO,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAqB,CAAC;AAC1D,CAAC;AAED,SAAgB,WAAW,CACzB,KAAmB,EACnB,KAAQ;IAER,IAAM,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;IAC5B,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IACrB,OAAO,KAAyB,CAAC;AACnC,CAAC;AAED,4EAA4E;AAC/D,QAAA,OAAO,GAClB,WAAW,IAAI,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC;AAE7D,SAAgB,QAAQ,CAAI,GAAiB;IAC3C,OAAO,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC;AACrB,CAAC;AAED,SAAgB,QAAQ,CAAI,GAAiB;IAC3C,OAAO,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAC7B,CAAC;AAED,wCAAwC;AAC3B,QAAA,IAAI,GAAG,IAAI,IAAI,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;AAElE,SAAgB,UAAU,CACxB,GAAiB,EACjB,KAAa,EACb,OAAkB;IAElB,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;QACrC,OAAO,GAAG,CAAC;IACb,CAAC;IACD,IAAM,QAAQ,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;IAE5B,IAAM,QAAQ,GAAG,IAAA,eAAM,EAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IAC3C,IAAI,MAAM,CAAC,EAAE,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,CAAC;QAClC,OAAO,GAAG,CAAC;IACb,CAAC;IAED,OAAO,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;AACnC,CAAC;AAED,SAAgB,UAAU,CACxB,GAAiB,EACjB,KAAa,EACb,OAAkB;IAElB,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;QACrC,OAAO,GAAG,CAAC;IACb,CAAC;IACD,IAAM,QAAQ,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;IAE5B,IAAM,QAAQ,GAAG,IAAA,eAAM,EAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IAC3C,IAAI,MAAM,CAAC,EAAE,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,CAAC;QAClC,OAAO,GAAG,CAAC;IACb,CAAC;IAED,IAAM,MAAM,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC;IAC3B,MAAM,CAAC,KAAK,CAAC,GAAG,QAAQ,CAAC;IACzB,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,iGAAiG;AACjG,oFAAoF;AACvE,QAAA,MAAM,GAAG,MAAM,IAAI,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC;AAE1E,SAAgB,OAAO,CACrB,GAAiB,EACjB,KAAa,EACb,CAAkB;IAElB,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;QACrC,OAAO,GAAG,CAAC;IACb,CAAC;IAED,IAAM,QAAQ,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;IAC5B,IAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;IAE7B,IAAI,MAAM,CAAC,EAAE,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,CAAC;QAClC,OAAO,GAAG,CAAC;IACb,CAAC;IAED,OAAO,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;AACnC,CAAC;AAED,SAAgB,OAAO,CACrB,GAAiB,EACjB,KAAa,EACb,CAAkB;IAElB,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;QACrC,OAAO,GAAG,CAAC;IACb,CAAC;IAED,IAAM,QAAQ,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;IAC5B,IAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;IAE7B,IAAI,MAAM,CAAC,EAAE,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,CAAC;QAClC,OAAO,GAAG,CAAC;IACb,CAAC;IAED,IAAM,MAAM,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC;IAC3B,MAAM,CAAC,KAAK,CAAC,GAAG,QAAQ,CAAC;IACzB,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,uGAAuG;AACvG,oFAAoF;AACvE,QAAA,GAAG,GAAG,MAAM,IAAI,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;AAEjE,SAAgB,UAAU,CAAI,GAAiB,EAAE,KAAa,EAAE,KAAQ;IACtE,OAAO,GAAG,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;AACxC,CAAC;AAED,SAAgB,UAAU,CAAI,GAAiB,EAAE,KAAa,EAAE,KAAQ;IACtE,IAAM,KAAK,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC;IAC1B,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;IAC9B,OAAO,KAAK,CAAC;AACf,CAAC;AAED,+EAA+E;AAClE,QAAA,MAAM,GAAG,WAAW,IAAI,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC;AAE/E,yDAAyD;AACzD,SAAgB,IAAI,CAAI,GAAiB;IACvC,OAAO,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AACtB,CAAC;AAED,wDAAwD;AACxD,SAAgB,IAAI,CAAI,GAAiB;IACvC,OAAO,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACtC,CAAC;AAED,SAAgB,UAAU,CACxB,GAAiB,EACjB,KAAa,EACb,WAAmB;IACnB,eAAa;SAAb,UAAa,EAAb,qBAAa,EAAb,IAAa;QAAb,8BAAa;;IAEb,OAAO,GAAG,CAAC,SAAS,OAAb,GAAG,yBAAW,KAAK,EAAE,WAAW,kBAAK,KAAK,WAAE;AACrD,CAAC;AAED,SAAgB,UAAU,CACxB,GAAiB,EACjB,KAAa,EACb,WAAmB;IACnB,eAAa;SAAb,UAAa,EAAb,qBAAa,EAAb,IAAa;QAAb,8BAAa;;IAEb,IAAM,KAAK,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC;IAC1B,KAAK,CAAC,MAAM,OAAZ,KAAK,yBAAQ,KAAK,EAAE,WAAW,kBAAK,KAAK,WAAE;IAC3C,OAAO,KAAK,CAAC;AACf,CAAC;AAED,6EAA6E;AAChE,QAAA,MAAM,GAAG,WAAW,IAAI,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC;AAE/E,2GAA2G;AAC3G,SAAgB,UAAU,CAAI,GAAiB;IAC7C,IAAM,KAAK,GAAQ,EAAE,CAAC;IACtB,KAAK,IAAM,GAAG,IAAI,GAAG,EAAE,CAAC;QACtB,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;IACxB,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,+GAA+G;AAC/G,0CAA0C;AAC1C,SAAgB,SAAS,CACvB,GAAiB,EACjB,CAAkC;IAElC,IAAM,MAAM,GAAS,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAEvC,KAAK,IAAM,GAAG,IAAI,GAAG,EAAE,CAAC;QACtB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,GAAU,CAAC,CAAC;IACxC,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}
|
package/dist/cjs/entry.cjs
CHANGED
|
@@ -1,37 +1,13 @@
|
|
|
1
1
|
"use strict";
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
var __export = (target, all) => {
|
|
7
|
-
for (var name in all)
|
|
8
|
-
__defProp(target, name, { get: all[name], enumerable: true });
|
|
9
|
-
};
|
|
10
|
-
var __copyProps = (to, from, except, desc) => {
|
|
11
|
-
if (from && typeof from === "object" || typeof from === "function") {
|
|
12
|
-
for (let key of __getOwnPropNames(from))
|
|
13
|
-
if (!__hasOwnProp.call(to, key) && key !== except)
|
|
14
|
-
__defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
|
|
15
|
-
}
|
|
16
|
-
return to;
|
|
17
|
-
};
|
|
18
|
-
var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
|
|
19
|
-
|
|
20
|
-
// src/entry.mts
|
|
21
|
-
var entry_exports = {};
|
|
22
|
-
__export(entry_exports, {
|
|
23
|
-
first: () => first,
|
|
24
|
-
second: () => second
|
|
25
|
-
});
|
|
26
|
-
module.exports = __toCommonJS(entry_exports);
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
exports.first = first;
|
|
4
|
+
exports.second = second;
|
|
5
|
+
// Returns the first element of a 2-Tuple
|
|
27
6
|
function first(entry) {
|
|
28
|
-
|
|
7
|
+
return entry[0];
|
|
29
8
|
}
|
|
9
|
+
// Returns the second element of a 2-Tuple
|
|
30
10
|
function second(entry) {
|
|
31
|
-
|
|
11
|
+
return entry[1];
|
|
32
12
|
}
|
|
33
|
-
|
|
34
|
-
0 && (module.exports = {
|
|
35
|
-
first,
|
|
36
|
-
second
|
|
37
|
-
});
|
|
13
|
+
//# sourceMappingURL=entry.cjs.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"entry.cjs","sourceRoot":"","sources":["../../_cjs_prepare/entry.cts"],"names":[],"mappings":";;AACA,sBAEC;AAGD,wBAEC;AARD,yCAAyC;AACzC,SAAgB,KAAK,CAAO,KAAsB;IAChD,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;AAClB,CAAC;AAED,0CAA0C;AAC1C,SAAgB,MAAM,CAAO,KAAsB;IACjD,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;AAClB,CAAC"}
|