@rimbu/base 2.0.0 → 2.0.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/dist/cjs/arr.cjs +202 -229
- package/dist/cjs/arr.cjs.map +1 -0
- package/dist/cjs/entry.cjs +9 -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 +22 -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/dist/cjs/arr.cjs
CHANGED
|
@@ -1,267 +1,240 @@
|
|
|
1
1
|
"use strict";
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
var
|
|
5
|
-
var
|
|
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 = (mod2) => __copyProps(__defProp({}, "__esModule", { value: true }), mod2);
|
|
19
|
-
|
|
20
|
-
// src/arr.mts
|
|
21
|
-
var arr_exports = {};
|
|
22
|
-
__export(arr_exports, {
|
|
23
|
-
_appendNew: () => _appendNew,
|
|
24
|
-
_appendOld: () => _appendOld,
|
|
25
|
-
_insertNew: () => _insertNew,
|
|
26
|
-
_insertOld: () => _insertOld,
|
|
27
|
-
_lastNew: () => _lastNew,
|
|
28
|
-
_lastOld: () => _lastOld,
|
|
29
|
-
_modNew: () => _modNew,
|
|
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.mapSparse = exports.copySparse = exports.splice = exports._spliceOld = exports._spliceNew = exports.init = exports.tail = exports.insert = exports._insertOld = exports._insertNew = exports.mod = exports._modOld = exports._modNew = exports.update = exports._updateOld = exports._updateNew = exports.last = exports._lastOld = exports._lastNew = exports.prepend = exports._prependOld = exports._prependNew = exports.reverseMap = exports.map = exports.forEach = exports.reverse = exports._reverseOld = exports._reverseNew = exports.concat = exports.append = exports._appendOld = exports._appendNew = void 0;
|
|
4
|
+
var tslib_1 = require("tslib");
|
|
5
|
+
var common_1 = require("@rimbu/common");
|
|
58
6
|
function _appendNew(array, value) {
|
|
59
|
-
|
|
7
|
+
return array.toSpliced(array.length, 0, value);
|
|
60
8
|
}
|
|
9
|
+
exports._appendNew = _appendNew;
|
|
61
10
|
function _appendOld(array, value) {
|
|
62
|
-
|
|
63
|
-
|
|
64
|
-
|
|
65
|
-
}
|
|
66
|
-
|
|
11
|
+
var clone = array.slice();
|
|
12
|
+
clone.push(value);
|
|
13
|
+
return clone;
|
|
14
|
+
}
|
|
15
|
+
exports._appendOld = _appendOld;
|
|
16
|
+
// Returns a copy of the array with the given value appended
|
|
17
|
+
exports.append = "toSpliced" in Array.prototype ? _appendNew : _appendOld;
|
|
18
|
+
// Returns the concatenation of the two arrays, potentially reusing the input array if one of the arrays is empty
|
|
67
19
|
function concat(first, second) {
|
|
68
|
-
|
|
69
|
-
|
|
70
|
-
|
|
71
|
-
|
|
72
|
-
|
|
20
|
+
if (first.length === 0)
|
|
21
|
+
return second;
|
|
22
|
+
if (second.length === 0)
|
|
23
|
+
return first;
|
|
24
|
+
return first.concat(second);
|
|
73
25
|
}
|
|
26
|
+
exports.concat = concat;
|
|
74
27
|
function _reverseNew(array, start, end) {
|
|
75
|
-
|
|
76
|
-
|
|
28
|
+
var source = undefined !== start || undefined !== end
|
|
29
|
+
? array.slice(start !== null && start !== void 0 ? start : 0, (end !== null && end !== void 0 ? end : array.length - 1) + 1)
|
|
30
|
+
: array;
|
|
31
|
+
return source.toReversed();
|
|
77
32
|
}
|
|
33
|
+
exports._reverseNew = _reverseNew;
|
|
78
34
|
function _reverseOld(array, start, end) {
|
|
79
|
-
|
|
80
|
-
|
|
81
|
-
|
|
82
|
-
|
|
83
|
-
|
|
84
|
-
|
|
85
|
-
|
|
86
|
-
|
|
87
|
-
|
|
88
|
-
}
|
|
89
|
-
|
|
90
|
-
|
|
91
|
-
|
|
92
|
-
|
|
93
|
-
|
|
94
|
-
|
|
95
|
-
|
|
96
|
-
|
|
97
|
-
|
|
35
|
+
var _start = start !== null && start !== void 0 ? start : 0;
|
|
36
|
+
var _end = end !== null && end !== void 0 ? end : array.length - 1;
|
|
37
|
+
var length = _end - _start + 1;
|
|
38
|
+
var res = [];
|
|
39
|
+
var arrayIndex = _start - 1;
|
|
40
|
+
var resIndex = length - 1;
|
|
41
|
+
while (++arrayIndex <= _end)
|
|
42
|
+
res[resIndex--] = array[arrayIndex];
|
|
43
|
+
return res;
|
|
44
|
+
}
|
|
45
|
+
exports._reverseOld = _reverseOld;
|
|
46
|
+
// Returns an copy of the array between the start and end indices, with the elements in reversed order.
|
|
47
|
+
exports.reverse = 'toReversed' in Array.prototype ? _reverseNew : _reverseOld;
|
|
48
|
+
// Performs given function on each element of the array, in reverse order if 'reversed' is true.
|
|
49
|
+
function forEach(array, f, state, reversed) {
|
|
50
|
+
if (state === void 0) { state = (0, common_1.TraverseState)(); }
|
|
51
|
+
if (reversed === void 0) { reversed = false; }
|
|
52
|
+
if (state.halted)
|
|
53
|
+
return;
|
|
54
|
+
var halt = state.halt;
|
|
55
|
+
if (reversed) {
|
|
56
|
+
var i = array.length;
|
|
57
|
+
while (!state.halted && --i >= 0) {
|
|
58
|
+
f(array[i], state.nextIndex(), halt);
|
|
59
|
+
}
|
|
98
60
|
}
|
|
99
|
-
|
|
100
|
-
|
|
101
|
-
|
|
102
|
-
|
|
103
|
-
|
|
61
|
+
else {
|
|
62
|
+
var length = array.length;
|
|
63
|
+
var i = -1;
|
|
64
|
+
while (!state.halted && ++i < length) {
|
|
65
|
+
f(array[i], state.nextIndex(), halt);
|
|
66
|
+
}
|
|
104
67
|
}
|
|
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
|
-
}
|
|
120
|
-
function reverseMap(array, f, indexOffset = 0) {
|
|
121
|
-
const result = [];
|
|
122
|
-
let index = indexOffset;
|
|
123
|
-
let arrayIndex = array.length;
|
|
124
|
-
let resultIndex = 0;
|
|
125
|
-
while (--arrayIndex >= 0)
|
|
126
|
-
result[resultIndex++] = f(array[arrayIndex], index++);
|
|
127
|
-
return result;
|
|
128
68
|
}
|
|
69
|
+
exports.forEach = forEach;
|
|
70
|
+
// Returns a copy of the array where given function is applied to each element
|
|
71
|
+
function map(array, f, indexOffset) {
|
|
72
|
+
if (indexOffset === void 0) { indexOffset = 0; }
|
|
73
|
+
if (indexOffset === 0) {
|
|
74
|
+
// without offset, can use standard array map
|
|
75
|
+
return array.map(f);
|
|
76
|
+
}
|
|
77
|
+
var result = [];
|
|
78
|
+
var index = indexOffset;
|
|
79
|
+
var i = -1;
|
|
80
|
+
var length = array.length;
|
|
81
|
+
while (++i < length) {
|
|
82
|
+
result[i] = f(array[i], index++);
|
|
83
|
+
}
|
|
84
|
+
return result;
|
|
85
|
+
}
|
|
86
|
+
exports.map = map;
|
|
87
|
+
// Returns a copy of the array where given functio is applied to each element in reverse order
|
|
88
|
+
function reverseMap(array, f, indexOffset) {
|
|
89
|
+
if (indexOffset === void 0) { indexOffset = 0; }
|
|
90
|
+
var result = [];
|
|
91
|
+
var index = indexOffset;
|
|
92
|
+
var arrayIndex = array.length;
|
|
93
|
+
var resultIndex = 0;
|
|
94
|
+
while (--arrayIndex >= 0)
|
|
95
|
+
result[resultIndex++] = f(array[arrayIndex], index++);
|
|
96
|
+
return result;
|
|
97
|
+
}
|
|
98
|
+
exports.reverseMap = reverseMap;
|
|
129
99
|
function _prependNew(array, value) {
|
|
130
|
-
|
|
100
|
+
return array.toSpliced(0, 0, value);
|
|
131
101
|
}
|
|
102
|
+
exports._prependNew = _prependNew;
|
|
132
103
|
function _prependOld(array, value) {
|
|
133
|
-
|
|
134
|
-
|
|
135
|
-
|
|
104
|
+
var clone = array.slice();
|
|
105
|
+
clone.unshift(value);
|
|
106
|
+
return clone;
|
|
136
107
|
}
|
|
137
|
-
|
|
108
|
+
exports._prependOld = _prependOld;
|
|
109
|
+
// Returns a copy of the given array with the given value added at the start
|
|
110
|
+
exports.prepend = "toSpliced" in Array.prototype ? _prependNew : _prependOld;
|
|
138
111
|
function _lastNew(arr) {
|
|
139
|
-
|
|
112
|
+
return arr.at(-1);
|
|
140
113
|
}
|
|
114
|
+
exports._lastNew = _lastNew;
|
|
141
115
|
function _lastOld(arr) {
|
|
142
|
-
|
|
116
|
+
return arr[arr.length - 1];
|
|
143
117
|
}
|
|
144
|
-
|
|
118
|
+
exports._lastOld = _lastOld;
|
|
119
|
+
// Returns the last element of the array
|
|
120
|
+
exports.last = "at" in Array.prototype ? _lastNew : _lastOld;
|
|
145
121
|
function _updateNew(arr, index, updater) {
|
|
146
|
-
|
|
147
|
-
|
|
148
|
-
|
|
149
|
-
|
|
150
|
-
|
|
151
|
-
|
|
152
|
-
|
|
153
|
-
|
|
154
|
-
|
|
122
|
+
if (index < 0 || index >= arr.length) {
|
|
123
|
+
return arr;
|
|
124
|
+
}
|
|
125
|
+
var curValue = arr[index];
|
|
126
|
+
var newValue = (0, common_1.Update)(curValue, updater);
|
|
127
|
+
if (Object.is(newValue, curValue)) {
|
|
128
|
+
return arr;
|
|
129
|
+
}
|
|
130
|
+
return arr.with(index, newValue);
|
|
155
131
|
}
|
|
132
|
+
exports._updateNew = _updateNew;
|
|
156
133
|
function _updateOld(arr, index, updater) {
|
|
157
|
-
|
|
158
|
-
|
|
159
|
-
|
|
160
|
-
|
|
161
|
-
|
|
162
|
-
|
|
163
|
-
|
|
164
|
-
|
|
165
|
-
|
|
166
|
-
|
|
167
|
-
|
|
168
|
-
}
|
|
169
|
-
|
|
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
|
+
var newArr = arr.slice();
|
|
143
|
+
newArr[index] = newValue;
|
|
144
|
+
return newArr;
|
|
145
|
+
}
|
|
146
|
+
exports._updateOld = _updateOld;
|
|
147
|
+
// Returns a copy of the array where the element at given index is replaced by the given updater.
|
|
148
|
+
// If the new element is the same as the old element, the original array is returned
|
|
149
|
+
exports.update = "with" in Array.prototype ? _updateNew : _updateOld;
|
|
170
150
|
function _modNew(arr, index, f) {
|
|
171
|
-
|
|
172
|
-
|
|
173
|
-
|
|
174
|
-
|
|
175
|
-
|
|
176
|
-
|
|
177
|
-
|
|
178
|
-
|
|
179
|
-
|
|
151
|
+
if (index < 0 || index >= arr.length) {
|
|
152
|
+
return arr;
|
|
153
|
+
}
|
|
154
|
+
var curValue = arr[index];
|
|
155
|
+
var newValue = f(curValue);
|
|
156
|
+
if (Object.is(newValue, curValue)) {
|
|
157
|
+
return arr;
|
|
158
|
+
}
|
|
159
|
+
return arr.with(index, newValue);
|
|
180
160
|
}
|
|
161
|
+
exports._modNew = _modNew;
|
|
181
162
|
function _modOld(arr, index, f) {
|
|
182
|
-
|
|
183
|
-
|
|
184
|
-
|
|
185
|
-
|
|
186
|
-
|
|
187
|
-
|
|
188
|
-
|
|
189
|
-
|
|
190
|
-
|
|
191
|
-
|
|
192
|
-
|
|
193
|
-
}
|
|
194
|
-
|
|
163
|
+
if (index < 0 || index >= arr.length) {
|
|
164
|
+
return arr;
|
|
165
|
+
}
|
|
166
|
+
var curValue = arr[index];
|
|
167
|
+
var newValue = f(curValue);
|
|
168
|
+
if (Object.is(newValue, curValue)) {
|
|
169
|
+
return arr;
|
|
170
|
+
}
|
|
171
|
+
var newArr = arr.slice();
|
|
172
|
+
newArr[index] = newValue;
|
|
173
|
+
return newArr;
|
|
174
|
+
}
|
|
175
|
+
exports._modOld = _modOld;
|
|
176
|
+
// Returns a copy of the array where the element at given index is replaced by applying given function.
|
|
177
|
+
// If the new element is the same as the old element, the original array is returned
|
|
178
|
+
exports.mod = "with" in Array.prototype ? _modNew : _modOld;
|
|
195
179
|
function _insertNew(arr, index, value) {
|
|
196
|
-
|
|
180
|
+
return arr.toSpliced(index, 0, value);
|
|
197
181
|
}
|
|
182
|
+
exports._insertNew = _insertNew;
|
|
198
183
|
function _insertOld(arr, index, value) {
|
|
199
|
-
|
|
200
|
-
|
|
201
|
-
|
|
202
|
-
}
|
|
203
|
-
|
|
184
|
+
var clone = arr.slice();
|
|
185
|
+
clone.splice(index, 0, value);
|
|
186
|
+
return clone;
|
|
187
|
+
}
|
|
188
|
+
exports._insertOld = _insertOld;
|
|
189
|
+
// Returns a copy of the array where at given index the given value is inserted
|
|
190
|
+
exports.insert = "toSpliced" in Array.prototype ? _insertNew : _insertOld;
|
|
191
|
+
// Returns a copy of the array, without its first element
|
|
204
192
|
function tail(arr) {
|
|
205
|
-
|
|
193
|
+
return arr.slice(1);
|
|
206
194
|
}
|
|
195
|
+
exports.tail = tail;
|
|
196
|
+
// Returns a copy of the array, without its last element
|
|
207
197
|
function init(arr) {
|
|
208
|
-
|
|
198
|
+
return arr.slice(0, arr.length - 1);
|
|
209
199
|
}
|
|
210
|
-
|
|
211
|
-
|
|
212
|
-
|
|
213
|
-
|
|
214
|
-
|
|
215
|
-
|
|
216
|
-
|
|
200
|
+
exports.init = init;
|
|
201
|
+
function _spliceNew(arr, start, deleteCount) {
|
|
202
|
+
var items = [];
|
|
203
|
+
for (var _i = 3; _i < arguments.length; _i++) {
|
|
204
|
+
items[_i - 3] = arguments[_i];
|
|
205
|
+
}
|
|
206
|
+
return arr.toSpliced.apply(arr, tslib_1.__spreadArray([start, deleteCount], tslib_1.__read(items), false));
|
|
217
207
|
}
|
|
218
|
-
|
|
208
|
+
exports._spliceNew = _spliceNew;
|
|
209
|
+
function _spliceOld(arr, start, deleteCount) {
|
|
210
|
+
var items = [];
|
|
211
|
+
for (var _i = 3; _i < arguments.length; _i++) {
|
|
212
|
+
items[_i - 3] = arguments[_i];
|
|
213
|
+
}
|
|
214
|
+
var clone = arr.slice();
|
|
215
|
+
clone.splice.apply(clone, tslib_1.__spreadArray([start, deleteCount], tslib_1.__read(items), false));
|
|
216
|
+
return clone;
|
|
217
|
+
}
|
|
218
|
+
exports._spliceOld = _spliceOld;
|
|
219
|
+
// Immutable version of the array .splice command, always returns a new array
|
|
220
|
+
exports.splice = "toSpliced" in Array.prototype ? _spliceNew : _spliceOld;
|
|
221
|
+
// Returns a copy of the array, where its 'sparse' property is kept (sparse = not all indices have a value)
|
|
219
222
|
function copySparse(arr) {
|
|
220
|
-
|
|
221
|
-
|
|
222
|
-
|
|
223
|
-
|
|
224
|
-
|
|
223
|
+
var clone = [];
|
|
224
|
+
for (var key in arr) {
|
|
225
|
+
clone[key] = arr[key];
|
|
226
|
+
}
|
|
227
|
+
return clone;
|
|
225
228
|
}
|
|
229
|
+
exports.copySparse = copySparse;
|
|
230
|
+
// Returns a copy of the array with given function applied to each element, where its 'sparse' property is kept
|
|
231
|
+
// (sparse = not all indices have a value)
|
|
226
232
|
function mapSparse(arr, f) {
|
|
227
|
-
|
|
228
|
-
|
|
229
|
-
|
|
230
|
-
|
|
231
|
-
|
|
233
|
+
var result = Array(arr.length);
|
|
234
|
+
for (var key in arr) {
|
|
235
|
+
result[key] = f(arr[key], key);
|
|
236
|
+
}
|
|
237
|
+
return result;
|
|
232
238
|
}
|
|
233
|
-
|
|
234
|
-
|
|
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
|
-
});
|
|
239
|
+
exports.mapSparse = mapSparse;
|
|
240
|
+
//# sourceMappingURL=arr.cjs.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"arr.cjs","sourceRoot":"","sources":["../../_cjs_prepare/arr.cts"],"names":[],"mappings":";;;;AAAA,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;AAFD,gCAEC;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;AAJD,gCAIC;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;AAPD,wBAOC;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;AAXD,kCAWC;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;AAhBD,kCAgBC;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;AAxBD,0BAwBC;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;AAnBD,kBAmBC;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;AAdD,gCAcC;AAED,SAAgB,WAAW,CACzB,KAAmB,EACnB,KAAQ;IAER,OAAO,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAqB,CAAC;AAC1D,CAAC;AALD,kCAKC;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;AAPD,kCAOC;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;AAFD,4BAEC;AAED,SAAgB,QAAQ,CAAI,GAAiB;IAC3C,OAAO,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAC7B,CAAC;AAFD,4BAEC;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;AAhBD,gCAgBC;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;AAlBD,gCAkBC;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;AAjBD,0BAiBC;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;AAnBD,0BAmBC;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;AAFD,gCAEC;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;AAJD,gCAIC;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;AAFD,oBAEC;AAED,wDAAwD;AACxD,SAAgB,IAAI,CAAI,GAAiB;IACvC,OAAO,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACtC,CAAC;AAFD,oBAEC;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;AAPD,gCAOC;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;AATD,gCASC;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;AAND,gCAMC;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;AAXD,8BAWC"}
|
package/dist/cjs/entry.cjs
CHANGED
|
@@ -1,37 +1,14 @@
|
|
|
1
1
|
"use strict";
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
var __hasOwnProp = Object.prototype.hasOwnProperty;
|
|
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.second = exports.first = void 0;
|
|
4
|
+
// Returns the first element of a 2-Tuple
|
|
27
5
|
function first(entry) {
|
|
28
|
-
|
|
6
|
+
return entry[0];
|
|
29
7
|
}
|
|
8
|
+
exports.first = first;
|
|
9
|
+
// Returns the second element of a 2-Tuple
|
|
30
10
|
function second(entry) {
|
|
31
|
-
|
|
11
|
+
return entry[1];
|
|
32
12
|
}
|
|
33
|
-
|
|
34
|
-
|
|
35
|
-
first,
|
|
36
|
-
second
|
|
37
|
-
});
|
|
13
|
+
exports.second = second;
|
|
14
|
+
//# sourceMappingURL=entry.cjs.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"entry.cjs","sourceRoot":"","sources":["../../_cjs_prepare/entry.cts"],"names":[],"mappings":";;;AAAA,yCAAyC;AACzC,SAAgB,KAAK,CAAO,KAAsB;IAChD,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;AAClB,CAAC;AAFD,sBAEC;AAED,0CAA0C;AAC1C,SAAgB,MAAM,CAAO,KAAsB;IACjD,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;AAClB,CAAC;AAFD,wBAEC"}
|