@dereekb/util 13.9.0 → 13.10.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/fetch/index.cjs.js +1 -1
- package/fetch/index.esm.js +1 -1
- package/fetch/package.json +2 -2
- package/index.cjs.js +491 -324
- package/index.esm.js +488 -325
- package/package.json +1 -1
- package/src/lib/array/array.boolean.d.ts +4 -0
- package/src/lib/array/array.number.d.ts +3 -0
- package/src/lib/auth/auth.role.claims.d.ts +5 -0
- package/src/lib/auth/auth.role.d.ts +5 -0
- package/src/lib/boolean.d.ts +4 -0
- package/src/lib/contact/domain.d.ts +5 -0
- package/src/lib/contact/email.d.ts +10 -0
- package/src/lib/contact/phone.d.ts +10 -0
- package/src/lib/date/date.d.ts +77 -0
- package/src/lib/date/date.time.d.ts +4 -0
- package/src/lib/date/date.unix.d.ts +4 -0
- package/src/lib/date/hour.d.ts +8 -0
- package/src/lib/encryption/encryption.object.d.ts +4 -0
- package/src/lib/error/error.d.ts +4 -0
- package/src/lib/file/file.d.ts +4 -0
- package/src/lib/file/xml.d.ts +4 -0
- package/src/lib/hash.d.ts +4 -0
- package/src/lib/model/model.d.ts +20 -0
- package/src/lib/number/bitwise.dencoder.d.ts +8 -0
- package/src/lib/number/dollar.d.ts +31 -0
- package/src/lib/number/encoded.d.ts +8 -0
- package/src/lib/number/number.d.ts +15 -0
- package/src/lib/number/pay.d.ts +8 -0
- package/src/lib/number/round.d.ts +10 -0
- package/src/lib/object/object.d.ts +4 -0
- package/src/lib/page/page.d.ts +5 -0
- package/src/lib/path/path.d.ts +8 -0
- package/src/lib/promise/promise.d.ts +5 -0
- package/src/lib/relation/relation.d.ts +10 -0
- package/src/lib/sort.d.ts +3 -0
- package/src/lib/storage/storage.d.ts +9 -0
- package/src/lib/string/case.d.ts +28 -0
- package/src/lib/string/dencoder.d.ts +12 -0
- package/src/lib/string/html.d.ts +20 -0
- package/src/lib/string/index.d.ts +1 -0
- package/src/lib/string/json.d.ts +4 -0
- package/src/lib/string/mimetype.d.ts +12 -0
- package/src/lib/string/password.d.ts +4 -0
- package/src/lib/string/prefix.d.ts +36 -0
- package/src/lib/string/tree.d.ts +4 -0
- package/src/lib/string/url.d.ts +32 -0
- package/src/lib/value/address.d.ts +35 -0
- package/src/lib/value/cron.d.ts +4 -0
- package/src/lib/value/indexed.d.ts +4 -0
- package/src/lib/value/modifier.d.ts +4 -0
- package/src/lib/value/pixel.d.ts +14 -0
- package/src/lib/value/point.d.ts +11 -0
- package/src/lib/value/zoom.d.ts +4 -0
- package/test/package.json +2 -2
package/index.cjs.js
CHANGED
|
@@ -3,13 +3,13 @@
|
|
|
3
3
|
var extraSet = require('extra-set');
|
|
4
4
|
var makeError = require('make-error');
|
|
5
5
|
|
|
6
|
-
function _array_like_to_array$
|
|
6
|
+
function _array_like_to_array$B(arr, len) {
|
|
7
7
|
if (len == null || len > arr.length) len = arr.length;
|
|
8
8
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
9
9
|
return arr2;
|
|
10
10
|
}
|
|
11
11
|
function _array_without_holes$n(arr) {
|
|
12
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
12
|
+
if (Array.isArray(arr)) return _array_like_to_array$B(arr);
|
|
13
13
|
}
|
|
14
14
|
function _iterable_to_array$n(iter) {
|
|
15
15
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
@@ -18,19 +18,19 @@ function _non_iterable_spread$n() {
|
|
|
18
18
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
19
19
|
}
|
|
20
20
|
function _to_consumable_array$n(arr) {
|
|
21
|
-
return _array_without_holes$n(arr) || _iterable_to_array$n(arr) || _unsupported_iterable_to_array$
|
|
21
|
+
return _array_without_holes$n(arr) || _iterable_to_array$n(arr) || _unsupported_iterable_to_array$B(arr) || _non_iterable_spread$n();
|
|
22
22
|
}
|
|
23
23
|
function _type_of$m(obj) {
|
|
24
24
|
"@swc/helpers - typeof";
|
|
25
25
|
return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
|
|
26
26
|
}
|
|
27
|
-
function _unsupported_iterable_to_array$
|
|
27
|
+
function _unsupported_iterable_to_array$B(o, minLen) {
|
|
28
28
|
if (!o) return;
|
|
29
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
29
|
+
if (typeof o === "string") return _array_like_to_array$B(o, minLen);
|
|
30
30
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
31
31
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
32
32
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
33
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
33
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$B(o, minLen);
|
|
34
34
|
}
|
|
35
35
|
// MARK: Functions
|
|
36
36
|
/**
|
|
@@ -383,13 +383,13 @@ function _unsupported_iterable_to_array$A(o, minLen) {
|
|
|
383
383
|
return result;
|
|
384
384
|
}
|
|
385
385
|
|
|
386
|
-
function _array_like_to_array$
|
|
386
|
+
function _array_like_to_array$A(arr, len) {
|
|
387
387
|
if (len == null || len > arr.length) len = arr.length;
|
|
388
388
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
389
389
|
return arr2;
|
|
390
390
|
}
|
|
391
391
|
function _array_without_holes$m(arr) {
|
|
392
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
392
|
+
if (Array.isArray(arr)) return _array_like_to_array$A(arr);
|
|
393
393
|
}
|
|
394
394
|
function _iterable_to_array$m(iter) {
|
|
395
395
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
@@ -398,15 +398,15 @@ function _non_iterable_spread$m() {
|
|
|
398
398
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
399
399
|
}
|
|
400
400
|
function _to_consumable_array$m(arr) {
|
|
401
|
-
return _array_without_holes$m(arr) || _iterable_to_array$m(arr) || _unsupported_iterable_to_array$
|
|
401
|
+
return _array_without_holes$m(arr) || _iterable_to_array$m(arr) || _unsupported_iterable_to_array$A(arr) || _non_iterable_spread$m();
|
|
402
402
|
}
|
|
403
|
-
function _unsupported_iterable_to_array$
|
|
403
|
+
function _unsupported_iterable_to_array$A(o, minLen) {
|
|
404
404
|
if (!o) return;
|
|
405
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
405
|
+
if (typeof o === "string") return _array_like_to_array$A(o, minLen);
|
|
406
406
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
407
407
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
408
408
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
409
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
409
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$A(o, minLen);
|
|
410
410
|
}
|
|
411
411
|
// MARK: Functions
|
|
412
412
|
/**
|
|
@@ -528,7 +528,7 @@ function _unsupported_iterable_to_array$z(o, minLen) {
|
|
|
528
528
|
* @param input - array to copy, or nullish
|
|
529
529
|
* @returns a new array with the same elements, or an empty array if input is nullish
|
|
530
530
|
*/ function copyArray(input) {
|
|
531
|
-
return input
|
|
531
|
+
return input == null ? [] : _to_consumable_array$m(input);
|
|
532
532
|
}
|
|
533
533
|
/**
|
|
534
534
|
* Pushes the same element onto the target array a specified number of times.
|
|
@@ -764,13 +764,13 @@ function _unsupported_iterable_to_array$z(o, minLen) {
|
|
|
764
764
|
return readKeysSetFunction(readKey)(values);
|
|
765
765
|
}
|
|
766
766
|
|
|
767
|
-
function _array_like_to_array$
|
|
767
|
+
function _array_like_to_array$z(arr, len) {
|
|
768
768
|
if (len == null || len > arr.length) len = arr.length;
|
|
769
769
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
770
770
|
return arr2;
|
|
771
771
|
}
|
|
772
772
|
function _array_without_holes$l(arr) {
|
|
773
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
773
|
+
if (Array.isArray(arr)) return _array_like_to_array$z(arr);
|
|
774
774
|
}
|
|
775
775
|
function _iterable_to_array$l(iter) {
|
|
776
776
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
@@ -779,15 +779,15 @@ function _non_iterable_spread$l() {
|
|
|
779
779
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
780
780
|
}
|
|
781
781
|
function _to_consumable_array$l(arr) {
|
|
782
|
-
return _array_without_holes$l(arr) || _iterable_to_array$l(arr) || _unsupported_iterable_to_array$
|
|
782
|
+
return _array_without_holes$l(arr) || _iterable_to_array$l(arr) || _unsupported_iterable_to_array$z(arr) || _non_iterable_spread$l();
|
|
783
783
|
}
|
|
784
|
-
function _unsupported_iterable_to_array$
|
|
784
|
+
function _unsupported_iterable_to_array$z(o, minLen) {
|
|
785
785
|
if (!o) return;
|
|
786
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
786
|
+
if (typeof o === "string") return _array_like_to_array$z(o, minLen);
|
|
787
787
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
788
788
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
789
789
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
790
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
790
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$z(o, minLen);
|
|
791
791
|
}
|
|
792
792
|
/**
|
|
793
793
|
* Converts an {@link IterableOrValue} into a Set. Strings are treated as single values rather than character iterables.
|
|
@@ -1282,13 +1282,13 @@ function _unsupported_iterable_to_array$y(o, minLen) {
|
|
|
1282
1282
|
return a && b ? a.size === b.size && setContainsAllValues(a, b, true) : a == b;
|
|
1283
1283
|
}
|
|
1284
1284
|
|
|
1285
|
-
function _array_like_to_array$
|
|
1285
|
+
function _array_like_to_array$y(arr, len) {
|
|
1286
1286
|
if (len == null || len > arr.length) len = arr.length;
|
|
1287
1287
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
1288
1288
|
return arr2;
|
|
1289
1289
|
}
|
|
1290
1290
|
function _array_without_holes$k(arr) {
|
|
1291
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
1291
|
+
if (Array.isArray(arr)) return _array_like_to_array$y(arr);
|
|
1292
1292
|
}
|
|
1293
1293
|
function _iterable_to_array$k(iter) {
|
|
1294
1294
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
@@ -1297,15 +1297,15 @@ function _non_iterable_spread$k() {
|
|
|
1297
1297
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
1298
1298
|
}
|
|
1299
1299
|
function _to_consumable_array$k(arr) {
|
|
1300
|
-
return _array_without_holes$k(arr) || _iterable_to_array$k(arr) || _unsupported_iterable_to_array$
|
|
1300
|
+
return _array_without_holes$k(arr) || _iterable_to_array$k(arr) || _unsupported_iterable_to_array$y(arr) || _non_iterable_spread$k();
|
|
1301
1301
|
}
|
|
1302
|
-
function _unsupported_iterable_to_array$
|
|
1302
|
+
function _unsupported_iterable_to_array$y(o, minLen) {
|
|
1303
1303
|
if (!o) return;
|
|
1304
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
1304
|
+
if (typeof o === "string") return _array_like_to_array$y(o, minLen);
|
|
1305
1305
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
1306
1306
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
1307
1307
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
1308
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
1308
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$y(o, minLen);
|
|
1309
1309
|
}
|
|
1310
1310
|
/**
|
|
1311
1311
|
* Inverts the output of an arbitrary boolean-returning function.
|
|
@@ -1795,13 +1795,13 @@ function chainMapFunction(a, b) {
|
|
|
1795
1795
|
} : a;
|
|
1796
1796
|
}
|
|
1797
1797
|
|
|
1798
|
-
function _array_like_to_array$
|
|
1798
|
+
function _array_like_to_array$x(arr, len) {
|
|
1799
1799
|
if (len == null || len > arr.length) len = arr.length;
|
|
1800
1800
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
1801
1801
|
return arr2;
|
|
1802
1802
|
}
|
|
1803
1803
|
function _array_without_holes$j(arr) {
|
|
1804
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
1804
|
+
if (Array.isArray(arr)) return _array_like_to_array$x(arr);
|
|
1805
1805
|
}
|
|
1806
1806
|
function _iterable_to_array$j(iter) {
|
|
1807
1807
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
@@ -1810,15 +1810,15 @@ function _non_iterable_spread$j() {
|
|
|
1810
1810
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
1811
1811
|
}
|
|
1812
1812
|
function _to_consumable_array$j(arr) {
|
|
1813
|
-
return _array_without_holes$j(arr) || _iterable_to_array$j(arr) || _unsupported_iterable_to_array$
|
|
1813
|
+
return _array_without_holes$j(arr) || _iterable_to_array$j(arr) || _unsupported_iterable_to_array$x(arr) || _non_iterable_spread$j();
|
|
1814
1814
|
}
|
|
1815
|
-
function _unsupported_iterable_to_array$
|
|
1815
|
+
function _unsupported_iterable_to_array$x(o, minLen) {
|
|
1816
1816
|
if (!o) return;
|
|
1817
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
1817
|
+
if (typeof o === "string") return _array_like_to_array$x(o, minLen);
|
|
1818
1818
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
1819
1819
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
1820
1820
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
1821
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
1821
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$x(o, minLen);
|
|
1822
1822
|
}
|
|
1823
1823
|
/**
|
|
1824
1824
|
* Concatenates multiple arrays and returns only unique values.
|
|
@@ -2229,13 +2229,13 @@ function readModelKey(input) {
|
|
|
2229
2229
|
}
|
|
2230
2230
|
;
|
|
2231
2231
|
|
|
2232
|
-
function _array_like_to_array$
|
|
2232
|
+
function _array_like_to_array$w(arr, len) {
|
|
2233
2233
|
if (len == null || len > arr.length) len = arr.length;
|
|
2234
2234
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
2235
2235
|
return arr2;
|
|
2236
2236
|
}
|
|
2237
2237
|
function _array_without_holes$i(arr) {
|
|
2238
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
2238
|
+
if (Array.isArray(arr)) return _array_like_to_array$w(arr);
|
|
2239
2239
|
}
|
|
2240
2240
|
function _iterable_to_array$i(iter) {
|
|
2241
2241
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
@@ -2244,15 +2244,15 @@ function _non_iterable_spread$i() {
|
|
|
2244
2244
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
2245
2245
|
}
|
|
2246
2246
|
function _to_consumable_array$i(arr) {
|
|
2247
|
-
return _array_without_holes$i(arr) || _iterable_to_array$i(arr) || _unsupported_iterable_to_array$
|
|
2247
|
+
return _array_without_holes$i(arr) || _iterable_to_array$i(arr) || _unsupported_iterable_to_array$w(arr) || _non_iterable_spread$i();
|
|
2248
2248
|
}
|
|
2249
|
-
function _unsupported_iterable_to_array$
|
|
2249
|
+
function _unsupported_iterable_to_array$w(o, minLen) {
|
|
2250
2250
|
if (!o) return;
|
|
2251
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
2251
|
+
if (typeof o === "string") return _array_like_to_array$w(o, minLen);
|
|
2252
2252
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
2253
2253
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
2254
2254
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
2255
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
2255
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$w(o, minLen);
|
|
2256
2256
|
}
|
|
2257
2257
|
/**
|
|
2258
2258
|
* Wraps a key reading function to ensure that empty string keys are not used in boolean key arrays.
|
|
@@ -2359,13 +2359,13 @@ function _unsupported_iterable_to_array$v(o, minLen) {
|
|
|
2359
2359
|
return x ? x : undefined;
|
|
2360
2360
|
});
|
|
2361
2361
|
|
|
2362
|
-
function _array_like_to_array$
|
|
2362
|
+
function _array_like_to_array$v(arr, len) {
|
|
2363
2363
|
if (len == null || len > arr.length) len = arr.length;
|
|
2364
2364
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
2365
2365
|
return arr2;
|
|
2366
2366
|
}
|
|
2367
2367
|
function _array_without_holes$h(arr) {
|
|
2368
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
2368
|
+
if (Array.isArray(arr)) return _array_like_to_array$v(arr);
|
|
2369
2369
|
}
|
|
2370
2370
|
function _class_call_check$a(instance, Constructor) {
|
|
2371
2371
|
if (!(instance instanceof Constructor)) {
|
|
@@ -2405,15 +2405,15 @@ function _non_iterable_spread$h() {
|
|
|
2405
2405
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
2406
2406
|
}
|
|
2407
2407
|
function _to_consumable_array$h(arr) {
|
|
2408
|
-
return _array_without_holes$h(arr) || _iterable_to_array$h(arr) || _unsupported_iterable_to_array$
|
|
2408
|
+
return _array_without_holes$h(arr) || _iterable_to_array$h(arr) || _unsupported_iterable_to_array$v(arr) || _non_iterable_spread$h();
|
|
2409
2409
|
}
|
|
2410
|
-
function _unsupported_iterable_to_array$
|
|
2410
|
+
function _unsupported_iterable_to_array$v(o, minLen) {
|
|
2411
2411
|
if (!o) return;
|
|
2412
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
2412
|
+
if (typeof o === "string") return _array_like_to_array$v(o, minLen);
|
|
2413
2413
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
2414
2414
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
2415
2415
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
2416
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
2416
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$v(o, minLen);
|
|
2417
2417
|
}
|
|
2418
2418
|
/**
|
|
2419
2419
|
* Set that is implemented internally using a Map, and input values have their keys read.
|
|
@@ -2609,13 +2609,13 @@ function _unsupported_iterable_to_array$u(o, minLen) {
|
|
|
2609
2609
|
}
|
|
2610
2610
|
();
|
|
2611
2611
|
|
|
2612
|
-
function _array_like_to_array$
|
|
2612
|
+
function _array_like_to_array$u(arr, len) {
|
|
2613
2613
|
if (len == null || len > arr.length) len = arr.length;
|
|
2614
2614
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
2615
2615
|
return arr2;
|
|
2616
2616
|
}
|
|
2617
2617
|
function _array_without_holes$g(arr) {
|
|
2618
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
2618
|
+
if (Array.isArray(arr)) return _array_like_to_array$u(arr);
|
|
2619
2619
|
}
|
|
2620
2620
|
function _iterable_to_array$g(iter) {
|
|
2621
2621
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
@@ -2624,15 +2624,15 @@ function _non_iterable_spread$g() {
|
|
|
2624
2624
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
2625
2625
|
}
|
|
2626
2626
|
function _to_consumable_array$g(arr) {
|
|
2627
|
-
return _array_without_holes$g(arr) || _iterable_to_array$g(arr) || _unsupported_iterable_to_array$
|
|
2627
|
+
return _array_without_holes$g(arr) || _iterable_to_array$g(arr) || _unsupported_iterable_to_array$u(arr) || _non_iterable_spread$g();
|
|
2628
2628
|
}
|
|
2629
|
-
function _unsupported_iterable_to_array$
|
|
2629
|
+
function _unsupported_iterable_to_array$u(o, minLen) {
|
|
2630
2630
|
if (!o) return;
|
|
2631
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
2631
|
+
if (typeof o === "string") return _array_like_to_array$u(o, minLen);
|
|
2632
2632
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
2633
2633
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
2634
2634
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
2635
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
2635
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$u(o, minLen);
|
|
2636
2636
|
}
|
|
2637
2637
|
var SORT_VALUE_LESS_THAN = -1;
|
|
2638
2638
|
var SORT_VALUE_GREATER_THAN = 1;
|
|
@@ -2767,21 +2767,21 @@ function reverseCompareFn(compareFn) {
|
|
|
2767
2767
|
};
|
|
2768
2768
|
}
|
|
2769
2769
|
|
|
2770
|
-
function _array_like_to_array$
|
|
2770
|
+
function _array_like_to_array$t(arr, len) {
|
|
2771
2771
|
if (len == null || len > arr.length) len = arr.length;
|
|
2772
2772
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
2773
2773
|
return arr2;
|
|
2774
2774
|
}
|
|
2775
|
-
function _array_with_holes$
|
|
2775
|
+
function _array_with_holes$l(arr) {
|
|
2776
2776
|
if (Array.isArray(arr)) return arr;
|
|
2777
2777
|
}
|
|
2778
2778
|
function _array_without_holes$f(arr) {
|
|
2779
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
2779
|
+
if (Array.isArray(arr)) return _array_like_to_array$t(arr);
|
|
2780
2780
|
}
|
|
2781
2781
|
function _iterable_to_array$f(iter) {
|
|
2782
2782
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
2783
2783
|
}
|
|
2784
|
-
function _iterable_to_array_limit$
|
|
2784
|
+
function _iterable_to_array_limit$l(arr, i) {
|
|
2785
2785
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
2786
2786
|
if (_i == null) return;
|
|
2787
2787
|
var _arr = [];
|
|
@@ -2805,25 +2805,25 @@ function _iterable_to_array_limit$k(arr, i) {
|
|
|
2805
2805
|
}
|
|
2806
2806
|
return _arr;
|
|
2807
2807
|
}
|
|
2808
|
-
function _non_iterable_rest$
|
|
2808
|
+
function _non_iterable_rest$l() {
|
|
2809
2809
|
throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
2810
2810
|
}
|
|
2811
2811
|
function _non_iterable_spread$f() {
|
|
2812
2812
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
2813
2813
|
}
|
|
2814
|
-
function _sliced_to_array$
|
|
2815
|
-
return _array_with_holes$
|
|
2814
|
+
function _sliced_to_array$l(arr, i) {
|
|
2815
|
+
return _array_with_holes$l(arr) || _iterable_to_array_limit$l(arr, i) || _unsupported_iterable_to_array$t(arr, i) || _non_iterable_rest$l();
|
|
2816
2816
|
}
|
|
2817
2817
|
function _to_consumable_array$f(arr) {
|
|
2818
|
-
return _array_without_holes$f(arr) || _iterable_to_array$f(arr) || _unsupported_iterable_to_array$
|
|
2818
|
+
return _array_without_holes$f(arr) || _iterable_to_array$f(arr) || _unsupported_iterable_to_array$t(arr) || _non_iterable_spread$f();
|
|
2819
2819
|
}
|
|
2820
|
-
function _unsupported_iterable_to_array$
|
|
2820
|
+
function _unsupported_iterable_to_array$t(o, minLen) {
|
|
2821
2821
|
if (!o) return;
|
|
2822
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
2822
|
+
if (typeof o === "string") return _array_like_to_array$t(o, minLen);
|
|
2823
2823
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
2824
2824
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
2825
2825
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
2826
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
2826
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$t(o, minLen);
|
|
2827
2827
|
}
|
|
2828
2828
|
/**
|
|
2829
2829
|
* Splits the input array into batches of a maximum size. Each batch carries its zero-based index as `.i`.
|
|
@@ -2968,7 +2968,7 @@ function _unsupported_iterable_to_array$s(o, minLen) {
|
|
|
2968
2968
|
var _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
|
|
2969
2969
|
try {
|
|
2970
2970
|
for(var _iterator = pairs.pairs[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
|
|
2971
|
-
var _step_value = _sliced_to_array$
|
|
2971
|
+
var _step_value = _sliced_to_array$l(_step.value, 2), aa = _step_value[0], bb = _step_value[1];
|
|
2972
2972
|
// If any item is not the same, break.
|
|
2973
2973
|
if (!isEqual(aa, bb)) {
|
|
2974
2974
|
areDifferent = true;
|
|
@@ -3069,15 +3069,15 @@ function makeValuesGroupMap(values, groupKeyFn) {
|
|
|
3069
3069
|
return map;
|
|
3070
3070
|
}
|
|
3071
3071
|
|
|
3072
|
-
function _array_like_to_array$
|
|
3072
|
+
function _array_like_to_array$s(arr, len) {
|
|
3073
3073
|
if (len == null || len > arr.length) len = arr.length;
|
|
3074
3074
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
3075
3075
|
return arr2;
|
|
3076
3076
|
}
|
|
3077
|
-
function _array_with_holes$
|
|
3077
|
+
function _array_with_holes$k(arr) {
|
|
3078
3078
|
if (Array.isArray(arr)) return arr;
|
|
3079
3079
|
}
|
|
3080
|
-
function _iterable_to_array_limit$
|
|
3080
|
+
function _iterable_to_array_limit$k(arr, i) {
|
|
3081
3081
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
3082
3082
|
if (_i == null) return;
|
|
3083
3083
|
var _arr = [];
|
|
@@ -3101,19 +3101,19 @@ function _iterable_to_array_limit$j(arr, i) {
|
|
|
3101
3101
|
}
|
|
3102
3102
|
return _arr;
|
|
3103
3103
|
}
|
|
3104
|
-
function _non_iterable_rest$
|
|
3104
|
+
function _non_iterable_rest$k() {
|
|
3105
3105
|
throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
3106
3106
|
}
|
|
3107
|
-
function _sliced_to_array$
|
|
3108
|
-
return _array_with_holes$
|
|
3107
|
+
function _sliced_to_array$k(arr, i) {
|
|
3108
|
+
return _array_with_holes$k(arr) || _iterable_to_array_limit$k(arr, i) || _unsupported_iterable_to_array$s(arr, i) || _non_iterable_rest$k();
|
|
3109
3109
|
}
|
|
3110
|
-
function _unsupported_iterable_to_array$
|
|
3110
|
+
function _unsupported_iterable_to_array$s(o, minLen) {
|
|
3111
3111
|
if (!o) return;
|
|
3112
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
3112
|
+
if (typeof o === "string") return _array_like_to_array$s(o, minLen);
|
|
3113
3113
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
3114
3114
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
3115
3115
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
3116
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
3116
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$s(o, minLen);
|
|
3117
3117
|
}
|
|
3118
3118
|
/**
|
|
3119
3119
|
* Combines multiple Maps into a single Map. Later maps override earlier values for the same key.
|
|
@@ -3169,7 +3169,7 @@ function _unsupported_iterable_to_array$r(o, minLen) {
|
|
|
3169
3169
|
*/ function expandArrayValueTuples(values) {
|
|
3170
3170
|
var tuples = [];
|
|
3171
3171
|
values.forEach(function(param) {
|
|
3172
|
-
var _param = _sliced_to_array$
|
|
3172
|
+
var _param = _sliced_to_array$k(param, 2), key = _param[0], _$values = _param[1];
|
|
3173
3173
|
useIterableOrValue(_$values, function(value) {
|
|
3174
3174
|
tuples.push([
|
|
3175
3175
|
key,
|
|
@@ -5472,7 +5472,7 @@ function joinStrings(input) {
|
|
|
5472
5472
|
joinStrings: joinStrings,
|
|
5473
5473
|
splitStrings: splitStrings,
|
|
5474
5474
|
splitStringsToSet: function splitStringsToSet(input) {
|
|
5475
|
-
return new Set(input
|
|
5475
|
+
return new Set(input == null ? [] : splitStrings(input));
|
|
5476
5476
|
},
|
|
5477
5477
|
splitJoinRemainder: function splitJoinRemainder1(input, limit) {
|
|
5478
5478
|
return splitJoinRemainder(input, joiner, limit);
|
|
@@ -5710,13 +5710,13 @@ function caseInsensitiveString(input) {
|
|
|
5710
5710
|
}
|
|
5711
5711
|
if (config.slice) {
|
|
5712
5712
|
var sliceTransform = sliceStringFunction(config.slice);
|
|
5713
|
-
if (baseTransform
|
|
5713
|
+
if (baseTransform == null) {
|
|
5714
|
+
baseTransform = sliceTransform;
|
|
5715
|
+
} else {
|
|
5714
5716
|
var initialBaseTransform = baseTransform;
|
|
5715
5717
|
baseTransform = function baseTransform(x) {
|
|
5716
5718
|
return initialBaseTransform(sliceTransform(x));
|
|
5717
5719
|
};
|
|
5718
|
-
} else {
|
|
5719
|
-
baseTransform = sliceTransform;
|
|
5720
5720
|
}
|
|
5721
5721
|
}
|
|
5722
5722
|
var transform = baseTransform;
|
|
@@ -6368,15 +6368,15 @@ function _object_spread$e(target) {
|
|
|
6368
6368
|
* @returns The inverted filter function, or the original if invert is false
|
|
6369
6369
|
*/ var invertFilter = invertBooleanReturnFunction;
|
|
6370
6370
|
|
|
6371
|
-
function _array_like_to_array$
|
|
6371
|
+
function _array_like_to_array$r(arr, len) {
|
|
6372
6372
|
if (len == null || len > arr.length) len = arr.length;
|
|
6373
6373
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
6374
6374
|
return arr2;
|
|
6375
6375
|
}
|
|
6376
|
-
function _array_with_holes$
|
|
6376
|
+
function _array_with_holes$j(arr) {
|
|
6377
6377
|
if (Array.isArray(arr)) return arr;
|
|
6378
6378
|
}
|
|
6379
|
-
function _iterable_to_array_limit$
|
|
6379
|
+
function _iterable_to_array_limit$j(arr, i) {
|
|
6380
6380
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
6381
6381
|
if (_i == null) return;
|
|
6382
6382
|
var _arr = [];
|
|
@@ -6400,23 +6400,23 @@ function _iterable_to_array_limit$i(arr, i) {
|
|
|
6400
6400
|
}
|
|
6401
6401
|
return _arr;
|
|
6402
6402
|
}
|
|
6403
|
-
function _non_iterable_rest$
|
|
6403
|
+
function _non_iterable_rest$j() {
|
|
6404
6404
|
throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
6405
6405
|
}
|
|
6406
|
-
function _sliced_to_array$
|
|
6407
|
-
return _array_with_holes$
|
|
6406
|
+
function _sliced_to_array$j(arr, i) {
|
|
6407
|
+
return _array_with_holes$j(arr) || _iterable_to_array_limit$j(arr, i) || _unsupported_iterable_to_array$r(arr, i) || _non_iterable_rest$j();
|
|
6408
6408
|
}
|
|
6409
6409
|
function _type_of$f(obj) {
|
|
6410
6410
|
"@swc/helpers - typeof";
|
|
6411
6411
|
return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
|
|
6412
6412
|
}
|
|
6413
|
-
function _unsupported_iterable_to_array$
|
|
6413
|
+
function _unsupported_iterable_to_array$r(o, minLen) {
|
|
6414
6414
|
if (!o) return;
|
|
6415
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
6415
|
+
if (typeof o === "string") return _array_like_to_array$r(o, minLen);
|
|
6416
6416
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
6417
6417
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
6418
6418
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
6419
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
6419
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$r(o, minLen);
|
|
6420
6420
|
}
|
|
6421
6421
|
/**
|
|
6422
6422
|
* Iterates over filtered key/value tuples of an object and invokes a callback for each.
|
|
@@ -6558,43 +6558,43 @@ function _unsupported_iterable_to_array$q(o, minLen) {
|
|
|
6558
6558
|
switch(type){
|
|
6559
6559
|
case exports.KeyValueTypleValueFilter.UNDEFINED:
|
|
6560
6560
|
filterFn = function filterFn(param) {
|
|
6561
|
-
var _param = _sliced_to_array$
|
|
6561
|
+
var _param = _sliced_to_array$j(param, 2), x = _param[1];
|
|
6562
6562
|
return x !== undefined;
|
|
6563
6563
|
};
|
|
6564
6564
|
break;
|
|
6565
6565
|
case exports.KeyValueTypleValueFilter.NULL:
|
|
6566
6566
|
filterFn = function filterFn(param) {
|
|
6567
|
-
var _param = _sliced_to_array$
|
|
6567
|
+
var _param = _sliced_to_array$j(param, 2), x = _param[1];
|
|
6568
6568
|
return x != null;
|
|
6569
6569
|
};
|
|
6570
6570
|
break;
|
|
6571
6571
|
case exports.KeyValueTypleValueFilter.FALSY:
|
|
6572
6572
|
filterFn = function filterFn(param) {
|
|
6573
|
-
var _param = _sliced_to_array$
|
|
6573
|
+
var _param = _sliced_to_array$j(param, 2), x = _param[1];
|
|
6574
6574
|
return Boolean(x);
|
|
6575
6575
|
};
|
|
6576
6576
|
break;
|
|
6577
6577
|
case exports.KeyValueTypleValueFilter.EMPTY:
|
|
6578
6578
|
filterFn = function filterFn(param) {
|
|
6579
|
-
var _param = _sliced_to_array$
|
|
6579
|
+
var _param = _sliced_to_array$j(param, 2), x = _param[1];
|
|
6580
6580
|
return hasValueOrNotEmpty(x);
|
|
6581
6581
|
};
|
|
6582
6582
|
break;
|
|
6583
6583
|
case exports.KeyValueTypleValueFilter.EMPTY_STRICT:
|
|
6584
6584
|
filterFn = function filterFn(param) {
|
|
6585
|
-
var _param = _sliced_to_array$
|
|
6585
|
+
var _param = _sliced_to_array$j(param, 2), x = _param[1];
|
|
6586
6586
|
return hasValueOrNotEmptyObject(x);
|
|
6587
6587
|
};
|
|
6588
6588
|
break;
|
|
6589
6589
|
case exports.KeyValueTypleValueFilter.FALSY_AND_EMPTY:
|
|
6590
6590
|
filterFn = function filterFn(param) {
|
|
6591
|
-
var _param = _sliced_to_array$
|
|
6591
|
+
var _param = _sliced_to_array$j(param, 2), x = _param[1];
|
|
6592
6592
|
return Boolean(x) && hasValueOrNotEmpty(x);
|
|
6593
6593
|
};
|
|
6594
6594
|
break;
|
|
6595
6595
|
case exports.KeyValueTypleValueFilter.FALSY_AND_EMPTY_STRICT:
|
|
6596
6596
|
filterFn = function filterFn(param) {
|
|
6597
|
-
var _param = _sliced_to_array$
|
|
6597
|
+
var _param = _sliced_to_array$j(param, 2), x = _param[1];
|
|
6598
6598
|
return Boolean(x) && hasValueOrNotEmptyObject(x);
|
|
6599
6599
|
};
|
|
6600
6600
|
break;
|
|
@@ -6684,12 +6684,12 @@ function cachedGetter(factory) {
|
|
|
6684
6684
|
};
|
|
6685
6685
|
}
|
|
6686
6686
|
|
|
6687
|
-
function _array_like_to_array$
|
|
6687
|
+
function _array_like_to_array$q(arr, len) {
|
|
6688
6688
|
if (len == null || len > arr.length) len = arr.length;
|
|
6689
6689
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
6690
6690
|
return arr2;
|
|
6691
6691
|
}
|
|
6692
|
-
function _array_with_holes$
|
|
6692
|
+
function _array_with_holes$i(arr) {
|
|
6693
6693
|
if (Array.isArray(arr)) return arr;
|
|
6694
6694
|
}
|
|
6695
6695
|
function _define_property$h(obj, key, value) {
|
|
@@ -6705,7 +6705,7 @@ function _define_property$h(obj, key, value) {
|
|
|
6705
6705
|
}
|
|
6706
6706
|
return obj;
|
|
6707
6707
|
}
|
|
6708
|
-
function _iterable_to_array_limit$
|
|
6708
|
+
function _iterable_to_array_limit$i(arr, i) {
|
|
6709
6709
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
6710
6710
|
if (_i == null) return;
|
|
6711
6711
|
var _arr = [];
|
|
@@ -6729,7 +6729,7 @@ function _iterable_to_array_limit$h(arr, i) {
|
|
|
6729
6729
|
}
|
|
6730
6730
|
return _arr;
|
|
6731
6731
|
}
|
|
6732
|
-
function _non_iterable_rest$
|
|
6732
|
+
function _non_iterable_rest$i() {
|
|
6733
6733
|
throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
6734
6734
|
}
|
|
6735
6735
|
function _object_spread$d(target) {
|
|
@@ -6747,20 +6747,20 @@ function _object_spread$d(target) {
|
|
|
6747
6747
|
}
|
|
6748
6748
|
return target;
|
|
6749
6749
|
}
|
|
6750
|
-
function _sliced_to_array$
|
|
6751
|
-
return _array_with_holes$
|
|
6750
|
+
function _sliced_to_array$i(arr, i) {
|
|
6751
|
+
return _array_with_holes$i(arr) || _iterable_to_array_limit$i(arr, i) || _unsupported_iterable_to_array$q(arr, i) || _non_iterable_rest$i();
|
|
6752
6752
|
}
|
|
6753
6753
|
function _type_of$e(obj) {
|
|
6754
6754
|
"@swc/helpers - typeof";
|
|
6755
6755
|
return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
|
|
6756
6756
|
}
|
|
6757
|
-
function _unsupported_iterable_to_array$
|
|
6757
|
+
function _unsupported_iterable_to_array$q(o, minLen) {
|
|
6758
6758
|
if (!o) return;
|
|
6759
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
6759
|
+
if (typeof o === "string") return _array_like_to_array$q(o, minLen);
|
|
6760
6760
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
6761
6761
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
6762
6762
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
6763
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
6763
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$q(o, minLen);
|
|
6764
6764
|
}
|
|
6765
6765
|
// MARK: Object Merging/Overriding
|
|
6766
6766
|
/**
|
|
@@ -7055,7 +7055,7 @@ function _unsupported_iterable_to_array$p(o, minLen) {
|
|
|
7055
7055
|
filter: filter,
|
|
7056
7056
|
// eslint-disable-next-line @typescript-eslint/max-params
|
|
7057
7057
|
forEach: function forEach(param, i, obj, context) {
|
|
7058
|
-
var _param = _sliced_to_array$
|
|
7058
|
+
var _param = _sliced_to_array$i(param, 1), key = _param[0];
|
|
7059
7059
|
context.keys.push(key);
|
|
7060
7060
|
}
|
|
7061
7061
|
});
|
|
@@ -7178,7 +7178,7 @@ function _unsupported_iterable_to_array$p(o, minLen) {
|
|
|
7178
7178
|
var forEachFn = forEachKeyValueOnPOJOFunction({
|
|
7179
7179
|
filter: filter,
|
|
7180
7180
|
forEach: function forEach(param, i, object) {
|
|
7181
|
-
var _param = _sliced_to_array$
|
|
7181
|
+
var _param = _sliced_to_array$i(param, 1), key = _param[0];
|
|
7182
7182
|
delete object[key];
|
|
7183
7183
|
}
|
|
7184
7184
|
});
|
|
@@ -7255,7 +7255,7 @@ function _unsupported_iterable_to_array$p(o, minLen) {
|
|
|
7255
7255
|
filter: filter,
|
|
7256
7256
|
// eslint-disable-next-line @typescript-eslint/max-params
|
|
7257
7257
|
forEach: function forEach(param, i, object, target) {
|
|
7258
|
-
var _param = _sliced_to_array$
|
|
7258
|
+
var _param = _sliced_to_array$i(param, 2), key = _param[0], value = _param[1];
|
|
7259
7259
|
target[key] = value;
|
|
7260
7260
|
}
|
|
7261
7261
|
});
|
|
@@ -7317,7 +7317,7 @@ function _unsupported_iterable_to_array$p(o, minLen) {
|
|
|
7317
7317
|
filter: filter,
|
|
7318
7318
|
// eslint-disable-next-line @typescript-eslint/max-params
|
|
7319
7319
|
forEach: function forEach(param, i, obj, context) {
|
|
7320
|
-
var _param = _sliced_to_array$
|
|
7320
|
+
var _param = _sliced_to_array$i(param, 2), value = _param[1];
|
|
7321
7321
|
context.values.push(value);
|
|
7322
7322
|
}
|
|
7323
7323
|
});
|
|
@@ -7354,7 +7354,7 @@ function _unsupported_iterable_to_array$p(o, minLen) {
|
|
|
7354
7354
|
var invertFilter = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : false;
|
|
7355
7355
|
var keysSet = new Set(keysToFilter);
|
|
7356
7356
|
var filterFn = invertBooleanReturnFunction(function(param) {
|
|
7357
|
-
var _param = _sliced_to_array$
|
|
7357
|
+
var _param = _sliced_to_array$i(param, 1), key = _param[0];
|
|
7358
7358
|
return keysSet.has(key);
|
|
7359
7359
|
}, invertFilter);
|
|
7360
7360
|
return filterTuplesOnPOJOFunction(filterFn);
|
|
@@ -7555,15 +7555,15 @@ function isInSetDecisionFunction(set, inputReadValue) {
|
|
|
7555
7555
|
return input != null ? new Set(asArray(input)) : input;
|
|
7556
7556
|
}
|
|
7557
7557
|
|
|
7558
|
-
function _array_like_to_array$
|
|
7558
|
+
function _array_like_to_array$p(arr, len) {
|
|
7559
7559
|
if (len == null || len > arr.length) len = arr.length;
|
|
7560
7560
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
7561
7561
|
return arr2;
|
|
7562
7562
|
}
|
|
7563
|
-
function _array_with_holes$
|
|
7563
|
+
function _array_with_holes$h(arr) {
|
|
7564
7564
|
if (Array.isArray(arr)) return arr;
|
|
7565
7565
|
}
|
|
7566
|
-
function _iterable_to_array_limit$
|
|
7566
|
+
function _iterable_to_array_limit$h(arr, i) {
|
|
7567
7567
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
7568
7568
|
if (_i == null) return;
|
|
7569
7569
|
var _arr = [];
|
|
@@ -7587,23 +7587,23 @@ function _iterable_to_array_limit$g(arr, i) {
|
|
|
7587
7587
|
}
|
|
7588
7588
|
return _arr;
|
|
7589
7589
|
}
|
|
7590
|
-
function _non_iterable_rest$
|
|
7590
|
+
function _non_iterable_rest$h() {
|
|
7591
7591
|
throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
7592
7592
|
}
|
|
7593
|
-
function _sliced_to_array$
|
|
7594
|
-
return _array_with_holes$
|
|
7593
|
+
function _sliced_to_array$h(arr, i) {
|
|
7594
|
+
return _array_with_holes$h(arr) || _iterable_to_array_limit$h(arr, i) || _unsupported_iterable_to_array$p(arr, i) || _non_iterable_rest$h();
|
|
7595
7595
|
}
|
|
7596
7596
|
function _type_of$d(obj) {
|
|
7597
7597
|
"@swc/helpers - typeof";
|
|
7598
7598
|
return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
|
|
7599
7599
|
}
|
|
7600
|
-
function _unsupported_iterable_to_array$
|
|
7600
|
+
function _unsupported_iterable_to_array$p(o, minLen) {
|
|
7601
7601
|
if (!o) return;
|
|
7602
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
7602
|
+
if (typeof o === "string") return _array_like_to_array$p(o, minLen);
|
|
7603
7603
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
7604
7604
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
7605
7605
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
7606
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
7606
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$p(o, minLen);
|
|
7607
7607
|
}
|
|
7608
7608
|
var AUTH_ROLE_CLAIMS_DEFAULT_CLAIM_VALUE = 1;
|
|
7609
7609
|
var AUTH_ROLE_CLAIMS_DEFAULT_EMPTY_VALUE = null;
|
|
@@ -7694,7 +7694,7 @@ var AUTH_ROLE_CLAIMS_DEFAULT_EMPTY_VALUE = null;
|
|
|
7694
7694
|
var claims = {};
|
|
7695
7695
|
// iterate by each claim value to build the claims.
|
|
7696
7696
|
tuples.forEach(function(param) {
|
|
7697
|
-
var _param = _sliced_to_array$
|
|
7697
|
+
var _param = _sliced_to_array$h(param, 2), claimsKey = _param[0], entry = _param[1];
|
|
7698
7698
|
var _entry_encodeValueFromRoles;
|
|
7699
7699
|
var claimsValue = (_entry_encodeValueFromRoles = entry.encodeValueFromRoles(roles)) !== null && _entry_encodeValueFromRoles !== void 0 ? _entry_encodeValueFromRoles : defaultEmptyValue;
|
|
7700
7700
|
claims[claimsKey] = claimsValue;
|
|
@@ -7704,7 +7704,7 @@ var AUTH_ROLE_CLAIMS_DEFAULT_EMPTY_VALUE = null;
|
|
|
7704
7704
|
var forEachKeyValueAddToSet = forEachKeyValueOnPOJOFunction({
|
|
7705
7705
|
// eslint-disable-next-line @typescript-eslint/max-params
|
|
7706
7706
|
forEach: function forEach(param, i, claims, roles) {
|
|
7707
|
-
var _param = _sliced_to_array$
|
|
7707
|
+
var _param = _sliced_to_array$h(param, 2), claimsKey = _param[0], value = _param[1];
|
|
7708
7708
|
var entry = authRoleMap.get(claimsKey);
|
|
7709
7709
|
if (entry != null) {
|
|
7710
7710
|
var decodedRoles = entry.decodeRolesFromValue(value);
|
|
@@ -7740,21 +7740,21 @@ var AUTH_ROLE_CLAIMS_DEFAULT_EMPTY_VALUE = null;
|
|
|
7740
7740
|
});
|
|
7741
7741
|
}
|
|
7742
7742
|
|
|
7743
|
-
function _array_like_to_array$
|
|
7743
|
+
function _array_like_to_array$o(arr, len) {
|
|
7744
7744
|
if (len == null || len > arr.length) len = arr.length;
|
|
7745
7745
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
7746
7746
|
return arr2;
|
|
7747
7747
|
}
|
|
7748
|
-
function _array_with_holes$
|
|
7748
|
+
function _array_with_holes$g(arr) {
|
|
7749
7749
|
if (Array.isArray(arr)) return arr;
|
|
7750
7750
|
}
|
|
7751
7751
|
function _array_without_holes$e(arr) {
|
|
7752
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
7752
|
+
if (Array.isArray(arr)) return _array_like_to_array$o(arr);
|
|
7753
7753
|
}
|
|
7754
7754
|
function _iterable_to_array$e(iter) {
|
|
7755
7755
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
7756
7756
|
}
|
|
7757
|
-
function _iterable_to_array_limit$
|
|
7757
|
+
function _iterable_to_array_limit$g(arr, i) {
|
|
7758
7758
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
7759
7759
|
if (_i == null) return;
|
|
7760
7760
|
var _arr = [];
|
|
@@ -7778,25 +7778,25 @@ function _iterable_to_array_limit$f(arr, i) {
|
|
|
7778
7778
|
}
|
|
7779
7779
|
return _arr;
|
|
7780
7780
|
}
|
|
7781
|
-
function _non_iterable_rest$
|
|
7781
|
+
function _non_iterable_rest$g() {
|
|
7782
7782
|
throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
7783
7783
|
}
|
|
7784
7784
|
function _non_iterable_spread$e() {
|
|
7785
7785
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
7786
7786
|
}
|
|
7787
|
-
function _sliced_to_array$
|
|
7788
|
-
return _array_with_holes$
|
|
7787
|
+
function _sliced_to_array$g(arr, i) {
|
|
7788
|
+
return _array_with_holes$g(arr) || _iterable_to_array_limit$g(arr, i) || _unsupported_iterable_to_array$o(arr, i) || _non_iterable_rest$g();
|
|
7789
7789
|
}
|
|
7790
7790
|
function _to_consumable_array$e(arr) {
|
|
7791
|
-
return _array_without_holes$e(arr) || _iterable_to_array$e(arr) || _unsupported_iterable_to_array$
|
|
7791
|
+
return _array_without_holes$e(arr) || _iterable_to_array$e(arr) || _unsupported_iterable_to_array$o(arr) || _non_iterable_spread$e();
|
|
7792
7792
|
}
|
|
7793
|
-
function _unsupported_iterable_to_array$
|
|
7793
|
+
function _unsupported_iterable_to_array$o(o, minLen) {
|
|
7794
7794
|
if (!o) return;
|
|
7795
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
7795
|
+
if (typeof o === "string") return _array_like_to_array$o(o, minLen);
|
|
7796
7796
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
7797
7797
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
7798
7798
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
7799
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
7799
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$o(o, minLen);
|
|
7800
7800
|
}
|
|
7801
7801
|
/**
|
|
7802
7802
|
* Finds the first and last occurrence of a single character within the input string.
|
|
@@ -7815,7 +7815,7 @@ function _unsupported_iterable_to_array$n(o, minLen) {
|
|
|
7815
7815
|
var _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
|
|
7816
7816
|
try {
|
|
7817
7817
|
for(var _iterator = _to_consumable_array$e(input).entries()[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
|
|
7818
|
-
var _step_value = _sliced_to_array$
|
|
7818
|
+
var _step_value = _sliced_to_array$g(_step.value, 2), i = _step_value[0], char = _step_value[1];
|
|
7819
7819
|
if (char === find) {
|
|
7820
7820
|
if (first === -1) {
|
|
7821
7821
|
first = i;
|
|
@@ -7902,7 +7902,7 @@ function replaceCharacterAtIndexIf(input, index, replacement, decision) {
|
|
|
7902
7902
|
* @param replacement - string to substitute at the index
|
|
7903
7903
|
* @returns the string with the character at the index replaced
|
|
7904
7904
|
*/ function replaceCharacterAtIndexWith(input, index, replacement) {
|
|
7905
|
-
var _splitStringAtIndex = _sliced_to_array$
|
|
7905
|
+
var _splitStringAtIndex = _sliced_to_array$g(splitStringAtIndex(input, index, false), 2), head = _splitStringAtIndex[0], tail = _splitStringAtIndex[1];
|
|
7906
7906
|
return head + replacement + tail;
|
|
7907
7907
|
}
|
|
7908
7908
|
/**
|
|
@@ -7944,7 +7944,7 @@ function replaceCharacterAtIndexIf(input, index, replacement, decision) {
|
|
|
7944
7944
|
var _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
|
|
7945
7945
|
try {
|
|
7946
7946
|
for(var _iterator = _to_consumable_array$e(chars).entries()[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
|
|
7947
|
-
var _step_value = _sliced_to_array$
|
|
7947
|
+
var _step_value = _sliced_to_array$g(_step.value, 2), i = _step_value[0], char = _step_value[1];
|
|
7948
7948
|
record[char] = i;
|
|
7949
7949
|
}
|
|
7950
7950
|
} catch (err) {
|
|
@@ -7964,16 +7964,16 @@ function replaceCharacterAtIndexIf(input, index, replacement, decision) {
|
|
|
7964
7964
|
return record;
|
|
7965
7965
|
}
|
|
7966
7966
|
|
|
7967
|
-
function _array_like_to_array$
|
|
7967
|
+
function _array_like_to_array$n(arr, len) {
|
|
7968
7968
|
if (len == null || len > arr.length) len = arr.length;
|
|
7969
7969
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
7970
7970
|
return arr2;
|
|
7971
7971
|
}
|
|
7972
|
-
function _array_with_holes$
|
|
7972
|
+
function _array_with_holes$f(arr) {
|
|
7973
7973
|
if (Array.isArray(arr)) return arr;
|
|
7974
7974
|
}
|
|
7975
7975
|
function _array_without_holes$d(arr) {
|
|
7976
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
7976
|
+
if (Array.isArray(arr)) return _array_like_to_array$n(arr);
|
|
7977
7977
|
}
|
|
7978
7978
|
function _instanceof$3(left, right) {
|
|
7979
7979
|
if (right != null && typeof Symbol !== "undefined" && right[Symbol.hasInstance]) {
|
|
@@ -7985,7 +7985,7 @@ function _instanceof$3(left, right) {
|
|
|
7985
7985
|
function _iterable_to_array$d(iter) {
|
|
7986
7986
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
7987
7987
|
}
|
|
7988
|
-
function _iterable_to_array_limit$
|
|
7988
|
+
function _iterable_to_array_limit$f(arr, i) {
|
|
7989
7989
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
7990
7990
|
if (_i == null) return;
|
|
7991
7991
|
var _arr = [];
|
|
@@ -8009,25 +8009,25 @@ function _iterable_to_array_limit$e(arr, i) {
|
|
|
8009
8009
|
}
|
|
8010
8010
|
return _arr;
|
|
8011
8011
|
}
|
|
8012
|
-
function _non_iterable_rest$
|
|
8012
|
+
function _non_iterable_rest$f() {
|
|
8013
8013
|
throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
8014
8014
|
}
|
|
8015
8015
|
function _non_iterable_spread$d() {
|
|
8016
8016
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
8017
8017
|
}
|
|
8018
|
-
function _sliced_to_array$
|
|
8019
|
-
return _array_with_holes$
|
|
8018
|
+
function _sliced_to_array$f(arr, i) {
|
|
8019
|
+
return _array_with_holes$f(arr) || _iterable_to_array_limit$f(arr, i) || _unsupported_iterable_to_array$n(arr, i) || _non_iterable_rest$f();
|
|
8020
8020
|
}
|
|
8021
8021
|
function _to_consumable_array$d(arr) {
|
|
8022
|
-
return _array_without_holes$d(arr) || _iterable_to_array$d(arr) || _unsupported_iterable_to_array$
|
|
8022
|
+
return _array_without_holes$d(arr) || _iterable_to_array$d(arr) || _unsupported_iterable_to_array$n(arr) || _non_iterable_spread$d();
|
|
8023
8023
|
}
|
|
8024
|
-
function _unsupported_iterable_to_array$
|
|
8024
|
+
function _unsupported_iterable_to_array$n(o, minLen) {
|
|
8025
8025
|
if (!o) return;
|
|
8026
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
8026
|
+
if (typeof o === "string") return _array_like_to_array$n(o, minLen);
|
|
8027
8027
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
8028
8028
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
8029
8029
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
8030
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
8030
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$n(o, minLen);
|
|
8031
8031
|
}
|
|
8032
8032
|
/**
|
|
8033
8033
|
* Creates a function that replaces all occurrences of the configured target strings with a replacement value.
|
|
@@ -8145,7 +8145,7 @@ function _unsupported_iterable_to_array$m(o, minLen) {
|
|
|
8145
8145
|
var _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
|
|
8146
8146
|
try {
|
|
8147
8147
|
for(var _iterator = _to_consumable_array$d(input).entries()[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
|
|
8148
|
-
var _step_value = _sliced_to_array$
|
|
8148
|
+
var _step_value = _sliced_to_array$f(_step.value, 2), i = _step_value[0], char = _step_value[1];
|
|
8149
8149
|
if (characterSet.has(char)) {
|
|
8150
8150
|
occurrences.push(i);
|
|
8151
8151
|
// return if at the max number of occurences
|
|
@@ -8454,12 +8454,12 @@ function isEqualToValueDecisionFunction(equalityValue) {
|
|
|
8454
8454
|
return equalityValueCheckFunction;
|
|
8455
8455
|
}
|
|
8456
8456
|
|
|
8457
|
-
function _array_like_to_array$
|
|
8457
|
+
function _array_like_to_array$m(arr, len) {
|
|
8458
8458
|
if (len == null || len > arr.length) len = arr.length;
|
|
8459
8459
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
8460
8460
|
return arr2;
|
|
8461
8461
|
}
|
|
8462
|
-
function _array_with_holes$
|
|
8462
|
+
function _array_with_holes$e(arr) {
|
|
8463
8463
|
if (Array.isArray(arr)) return arr;
|
|
8464
8464
|
}
|
|
8465
8465
|
function _define_property$g(obj, key, value) {
|
|
@@ -8475,7 +8475,7 @@ function _define_property$g(obj, key, value) {
|
|
|
8475
8475
|
}
|
|
8476
8476
|
return obj;
|
|
8477
8477
|
}
|
|
8478
|
-
function _iterable_to_array_limit$
|
|
8478
|
+
function _iterable_to_array_limit$e(arr, i) {
|
|
8479
8479
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
8480
8480
|
if (_i == null) return;
|
|
8481
8481
|
var _arr = [];
|
|
@@ -8499,7 +8499,7 @@ function _iterable_to_array_limit$d(arr, i) {
|
|
|
8499
8499
|
}
|
|
8500
8500
|
return _arr;
|
|
8501
8501
|
}
|
|
8502
|
-
function _non_iterable_rest$
|
|
8502
|
+
function _non_iterable_rest$e() {
|
|
8503
8503
|
throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
8504
8504
|
}
|
|
8505
8505
|
function _object_spread$c(target) {
|
|
@@ -8517,20 +8517,20 @@ function _object_spread$c(target) {
|
|
|
8517
8517
|
}
|
|
8518
8518
|
return target;
|
|
8519
8519
|
}
|
|
8520
|
-
function _sliced_to_array$
|
|
8521
|
-
return _array_with_holes$
|
|
8520
|
+
function _sliced_to_array$e(arr, i) {
|
|
8521
|
+
return _array_with_holes$e(arr) || _iterable_to_array_limit$e(arr, i) || _unsupported_iterable_to_array$m(arr, i) || _non_iterable_rest$e();
|
|
8522
8522
|
}
|
|
8523
8523
|
function _type_of$c(obj) {
|
|
8524
8524
|
"@swc/helpers - typeof";
|
|
8525
8525
|
return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
|
|
8526
8526
|
}
|
|
8527
|
-
function _unsupported_iterable_to_array$
|
|
8527
|
+
function _unsupported_iterable_to_array$m(o, minLen) {
|
|
8528
8528
|
if (!o) return;
|
|
8529
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
8529
|
+
if (typeof o === "string") return _array_like_to_array$m(o, minLen);
|
|
8530
8530
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
8531
8531
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
8532
8532
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
8533
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
8533
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$m(o, minLen);
|
|
8534
8534
|
}
|
|
8535
8535
|
var SLASH_PATH_SEPARATOR = '/';
|
|
8536
8536
|
var SLASH_PATH_FILE_TYPE_SEPARATOR = '.';
|
|
@@ -8703,10 +8703,10 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
|
|
|
8703
8703
|
path = undefined;
|
|
8704
8704
|
break;
|
|
8705
8705
|
}
|
|
8706
|
-
if (path
|
|
8707
|
-
path = startTypeFactory(path);
|
|
8708
|
-
} else {
|
|
8706
|
+
if (path == null) {
|
|
8709
8707
|
path = invalidPathValue;
|
|
8708
|
+
} else {
|
|
8709
|
+
path = startTypeFactory(path);
|
|
8710
8710
|
}
|
|
8711
8711
|
// must end with a slash to be a proper folder, unless it is a relative folder path ("", empty string)
|
|
8712
8712
|
if (path) {
|
|
@@ -8815,7 +8815,7 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
|
|
|
8815
8815
|
}
|
|
8816
8816
|
default:
|
|
8817
8817
|
{
|
|
8818
|
-
var _splitStringAtIndex = _sliced_to_array$
|
|
8818
|
+
var _splitStringAtIndex = _sliced_to_array$e(splitStringAtIndex(inputToEvaluate, last, true), 2), head = _splitStringAtIndex[0], tail = _splitStringAtIndex[1];
|
|
8819
8819
|
var headWithReplacedSeparators = head.replace(ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX, replaceWith);
|
|
8820
8820
|
fixedPath = headWithReplacedSeparators + tail;
|
|
8821
8821
|
break;
|
|
@@ -9066,7 +9066,7 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
|
|
|
9066
9066
|
var _config_matchRemaining, _config_nonMatchingFillValue;
|
|
9067
9067
|
var config = slashPathPathMatcherConfig(input);
|
|
9068
9068
|
var targetPathPartsInput = asArray(config.targetPath);
|
|
9069
|
-
var endComparisonAtIndex = config.maxPartsToCompare
|
|
9069
|
+
var endComparisonAtIndex = config.maxPartsToCompare == null ? Number.MAX_SAFE_INTEGER : config.maxPartsToCompare - 1;
|
|
9070
9070
|
var matchRemaining = typeof config.matchRemaining === 'boolean' ? decisionFunction(config.matchRemaining) : (_config_matchRemaining = config.matchRemaining) !== null && _config_matchRemaining !== void 0 ? _config_matchRemaining : decisionFunction(false);
|
|
9071
9071
|
var nonMatchingFillValue = (_config_nonMatchingFillValue = config.nonMatchingFillValue) !== null && _config_nonMatchingFillValue !== void 0 ? _config_nonMatchingFillValue : false;
|
|
9072
9072
|
var targetPathIndexMatchingDecisionFunctions = expandSlashPathPathMatcherPartToDecisionFunctions(targetPathPartsInput);
|
|
@@ -9141,21 +9141,21 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
|
|
|
9141
9141
|
};
|
|
9142
9142
|
}
|
|
9143
9143
|
|
|
9144
|
-
function _array_like_to_array$
|
|
9144
|
+
function _array_like_to_array$l(arr, len) {
|
|
9145
9145
|
if (len == null || len > arr.length) len = arr.length;
|
|
9146
9146
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
9147
9147
|
return arr2;
|
|
9148
9148
|
}
|
|
9149
|
-
function _array_with_holes$
|
|
9149
|
+
function _array_with_holes$d(arr) {
|
|
9150
9150
|
if (Array.isArray(arr)) return arr;
|
|
9151
9151
|
}
|
|
9152
9152
|
function _array_without_holes$c(arr) {
|
|
9153
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
9153
|
+
if (Array.isArray(arr)) return _array_like_to_array$l(arr);
|
|
9154
9154
|
}
|
|
9155
9155
|
function _iterable_to_array$c(iter) {
|
|
9156
9156
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
9157
9157
|
}
|
|
9158
|
-
function _iterable_to_array_limit$
|
|
9158
|
+
function _iterable_to_array_limit$d(arr, i) {
|
|
9159
9159
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
9160
9160
|
if (_i == null) return;
|
|
9161
9161
|
var _arr = [];
|
|
@@ -9179,25 +9179,25 @@ function _iterable_to_array_limit$c(arr, i) {
|
|
|
9179
9179
|
}
|
|
9180
9180
|
return _arr;
|
|
9181
9181
|
}
|
|
9182
|
-
function _non_iterable_rest$
|
|
9182
|
+
function _non_iterable_rest$d() {
|
|
9183
9183
|
throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
9184
9184
|
}
|
|
9185
9185
|
function _non_iterable_spread$c() {
|
|
9186
9186
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
9187
9187
|
}
|
|
9188
|
-
function _sliced_to_array$
|
|
9189
|
-
return _array_with_holes$
|
|
9188
|
+
function _sliced_to_array$d(arr, i) {
|
|
9189
|
+
return _array_with_holes$d(arr) || _iterable_to_array_limit$d(arr, i) || _unsupported_iterable_to_array$l(arr, i) || _non_iterable_rest$d();
|
|
9190
9190
|
}
|
|
9191
9191
|
function _to_consumable_array$c(arr) {
|
|
9192
|
-
return _array_without_holes$c(arr) || _iterable_to_array$c(arr) || _unsupported_iterable_to_array$
|
|
9192
|
+
return _array_without_holes$c(arr) || _iterable_to_array$c(arr) || _unsupported_iterable_to_array$l(arr) || _non_iterable_spread$c();
|
|
9193
9193
|
}
|
|
9194
|
-
function _unsupported_iterable_to_array$
|
|
9194
|
+
function _unsupported_iterable_to_array$l(o, minLen) {
|
|
9195
9195
|
if (!o) return;
|
|
9196
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
9196
|
+
if (typeof o === "string") return _array_like_to_array$l(o, minLen);
|
|
9197
9197
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
9198
9198
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
9199
9199
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
9200
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
9200
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$l(o, minLen);
|
|
9201
9201
|
}
|
|
9202
9202
|
/**
|
|
9203
9203
|
* Returns true if the input string is a known HTTP protocol (`"http"` or `"https"`).
|
|
@@ -9309,7 +9309,7 @@ function _unsupported_iterable_to_array$k(o, minLen) {
|
|
|
9309
9309
|
var pathHasWebsiteDomain = hasWebsiteDomain(domain);
|
|
9310
9310
|
var inputHasPortNumber = hasPortNumber(input);
|
|
9311
9311
|
var portNumber = inputHasPortNumber ? (_readPortNumber = readPortNumber(input)) !== null && _readPortNumber !== void 0 ? _readPortNumber : undefined : undefined;
|
|
9312
|
-
var _splitStringAtFirstCharacterOccurence = _sliced_to_array$
|
|
9312
|
+
var _splitStringAtFirstCharacterOccurence = _sliced_to_array$d(splitStringAtFirstCharacterOccurence(splitPair.path, '?'), 2), path = _splitStringAtFirstCharacterOccurence[0], query = _splitStringAtFirstCharacterOccurence[1]; // everything after the query is ignored
|
|
9313
9313
|
var isWebsiteUrl = pathHasWebsiteDomain && (path === '' || isValidSlashPath(path + '/'));
|
|
9314
9314
|
var inputHasHttpPrefix = hasHttpPrefix(input);
|
|
9315
9315
|
var result = {
|
|
@@ -9415,7 +9415,7 @@ function _unsupported_iterable_to_array$k(o, minLen) {
|
|
|
9415
9415
|
* @param inputPath - The path string to split.
|
|
9416
9416
|
* @returns A pair containing the path and optional query string.
|
|
9417
9417
|
*/ function websitePathAndQueryPair(inputPath) {
|
|
9418
|
-
var _inputPath_split = _sliced_to_array$
|
|
9418
|
+
var _inputPath_split = _sliced_to_array$d(inputPath.split('?', 2), 2), path = _inputPath_split[0], rawQuery = _inputPath_split[1];
|
|
9419
9419
|
var query = rawQuery ? fixExtraQueryParameters(rawQuery, true) : undefined;
|
|
9420
9420
|
return {
|
|
9421
9421
|
path: path,
|
|
@@ -9630,13 +9630,13 @@ function _unsupported_iterable_to_array$k(o, minLen) {
|
|
|
9630
9630
|
return domain;
|
|
9631
9631
|
}
|
|
9632
9632
|
|
|
9633
|
-
function _array_like_to_array$
|
|
9633
|
+
function _array_like_to_array$k(arr, len) {
|
|
9634
9634
|
if (len == null || len > arr.length) len = arr.length;
|
|
9635
9635
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
9636
9636
|
return arr2;
|
|
9637
9637
|
}
|
|
9638
9638
|
function _array_without_holes$b(arr) {
|
|
9639
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
9639
|
+
if (Array.isArray(arr)) return _array_like_to_array$k(arr);
|
|
9640
9640
|
}
|
|
9641
9641
|
function _iterable_to_array$b(iter) {
|
|
9642
9642
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
@@ -9645,15 +9645,15 @@ function _non_iterable_spread$b() {
|
|
|
9645
9645
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
9646
9646
|
}
|
|
9647
9647
|
function _to_consumable_array$b(arr) {
|
|
9648
|
-
return _array_without_holes$b(arr) || _iterable_to_array$b(arr) || _unsupported_iterable_to_array$
|
|
9648
|
+
return _array_without_holes$b(arr) || _iterable_to_array$b(arr) || _unsupported_iterable_to_array$k(arr) || _non_iterable_spread$b();
|
|
9649
9649
|
}
|
|
9650
|
-
function _unsupported_iterable_to_array$
|
|
9650
|
+
function _unsupported_iterable_to_array$k(o, minLen) {
|
|
9651
9651
|
if (!o) return;
|
|
9652
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
9652
|
+
if (typeof o === "string") return _array_like_to_array$k(o, minLen);
|
|
9653
9653
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
9654
9654
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
9655
9655
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
9656
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
9656
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$k(o, minLen);
|
|
9657
9657
|
}
|
|
9658
9658
|
/**
|
|
9659
9659
|
* Converts an EmailParticipant object to a formatted string representation.
|
|
@@ -10104,13 +10104,13 @@ function toReadableError(inputError) {
|
|
|
10104
10104
|
return buffer.includes('/Encrypt');
|
|
10105
10105
|
}
|
|
10106
10106
|
|
|
10107
|
-
function _array_like_to_array$
|
|
10107
|
+
function _array_like_to_array$j(arr, len) {
|
|
10108
10108
|
if (len == null || len > arr.length) len = arr.length;
|
|
10109
10109
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
10110
10110
|
return arr2;
|
|
10111
10111
|
}
|
|
10112
10112
|
function _array_without_holes$a(arr) {
|
|
10113
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
10113
|
+
if (Array.isArray(arr)) return _array_like_to_array$j(arr);
|
|
10114
10114
|
}
|
|
10115
10115
|
function _iterable_to_array$a(iter) {
|
|
10116
10116
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
@@ -10119,15 +10119,15 @@ function _non_iterable_spread$a() {
|
|
|
10119
10119
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
10120
10120
|
}
|
|
10121
10121
|
function _to_consumable_array$a(arr) {
|
|
10122
|
-
return _array_without_holes$a(arr) || _iterable_to_array$a(arr) || _unsupported_iterable_to_array$
|
|
10122
|
+
return _array_without_holes$a(arr) || _iterable_to_array$a(arr) || _unsupported_iterable_to_array$j(arr) || _non_iterable_spread$a();
|
|
10123
10123
|
}
|
|
10124
|
-
function _unsupported_iterable_to_array$
|
|
10124
|
+
function _unsupported_iterable_to_array$j(o, minLen) {
|
|
10125
10125
|
if (!o) return;
|
|
10126
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
10126
|
+
if (typeof o === "string") return _array_like_to_array$j(o, minLen);
|
|
10127
10127
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
10128
10128
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
10129
10129
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
10130
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
10130
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$j(o, minLen);
|
|
10131
10131
|
}
|
|
10132
10132
|
/*eslint @typescript-eslint/no-explicit-any:"off"*/ // any is used with intent here. using unknown can have strange effects in usage of forwardFunction and type capture.
|
|
10133
10133
|
/**
|
|
@@ -10167,13 +10167,13 @@ function _unsupported_iterable_to_array$i(o, minLen) {
|
|
|
10167
10167
|
* Alias of MAP_IDENTITY, so `isMapIdentityFunction()` will return true for this function.
|
|
10168
10168
|
*/ var passThrough = MAP_IDENTITY;
|
|
10169
10169
|
|
|
10170
|
-
function _array_like_to_array$
|
|
10170
|
+
function _array_like_to_array$i(arr, len) {
|
|
10171
10171
|
if (len == null || len > arr.length) len = arr.length;
|
|
10172
10172
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
10173
10173
|
return arr2;
|
|
10174
10174
|
}
|
|
10175
10175
|
function _array_without_holes$9(arr) {
|
|
10176
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
10176
|
+
if (Array.isArray(arr)) return _array_like_to_array$i(arr);
|
|
10177
10177
|
}
|
|
10178
10178
|
function _iterable_to_array$9(iter) {
|
|
10179
10179
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
@@ -10182,15 +10182,15 @@ function _non_iterable_spread$9() {
|
|
|
10182
10182
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
10183
10183
|
}
|
|
10184
10184
|
function _to_consumable_array$9(arr) {
|
|
10185
|
-
return _array_without_holes$9(arr) || _iterable_to_array$9(arr) || _unsupported_iterable_to_array$
|
|
10185
|
+
return _array_without_holes$9(arr) || _iterable_to_array$9(arr) || _unsupported_iterable_to_array$i(arr) || _non_iterable_spread$9();
|
|
10186
10186
|
}
|
|
10187
|
-
function _unsupported_iterable_to_array$
|
|
10187
|
+
function _unsupported_iterable_to_array$i(o, minLen) {
|
|
10188
10188
|
if (!o) return;
|
|
10189
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
10189
|
+
if (typeof o === "string") return _array_like_to_array$i(o, minLen);
|
|
10190
10190
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
10191
10191
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
10192
10192
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
10193
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
10193
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$i(o, minLen);
|
|
10194
10194
|
}
|
|
10195
10195
|
/**
|
|
10196
10196
|
* Builds an array from the intersection of an object's keys with the provided keys.
|
|
@@ -10529,13 +10529,13 @@ function performTaskCountLoop(config) {
|
|
|
10529
10529
|
});
|
|
10530
10530
|
}
|
|
10531
10531
|
|
|
10532
|
-
function _array_like_to_array$
|
|
10532
|
+
function _array_like_to_array$h(arr, len) {
|
|
10533
10533
|
if (len == null || len > arr.length) len = arr.length;
|
|
10534
10534
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
10535
10535
|
return arr2;
|
|
10536
10536
|
}
|
|
10537
10537
|
function _array_without_holes$8(arr) {
|
|
10538
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
10538
|
+
if (Array.isArray(arr)) return _array_like_to_array$h(arr);
|
|
10539
10539
|
}
|
|
10540
10540
|
function asyncGeneratorStep$8(gen, resolve, reject, _next, _throw, key, arg) {
|
|
10541
10541
|
try {
|
|
@@ -10573,15 +10573,15 @@ function _non_iterable_spread$8() {
|
|
|
10573
10573
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
10574
10574
|
}
|
|
10575
10575
|
function _to_consumable_array$8(arr) {
|
|
10576
|
-
return _array_without_holes$8(arr) || _iterable_to_array$8(arr) || _unsupported_iterable_to_array$
|
|
10576
|
+
return _array_without_holes$8(arr) || _iterable_to_array$8(arr) || _unsupported_iterable_to_array$h(arr) || _non_iterable_spread$8();
|
|
10577
10577
|
}
|
|
10578
|
-
function _unsupported_iterable_to_array$
|
|
10578
|
+
function _unsupported_iterable_to_array$h(o, minLen) {
|
|
10579
10579
|
if (!o) return;
|
|
10580
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
10580
|
+
if (typeof o === "string") return _array_like_to_array$h(o, minLen);
|
|
10581
10581
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
10582
10582
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
10583
10583
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
10584
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
10584
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$h(o, minLen);
|
|
10585
10585
|
}
|
|
10586
10586
|
function _ts_generator$8(thisArg, body) {
|
|
10587
10587
|
var f, y, t, _ = {
|
|
@@ -10794,21 +10794,21 @@ function _ts_generator$8(thisArg, body) {
|
|
|
10794
10794
|
};
|
|
10795
10795
|
}
|
|
10796
10796
|
|
|
10797
|
-
function _array_like_to_array$
|
|
10797
|
+
function _array_like_to_array$g(arr, len) {
|
|
10798
10798
|
if (len == null || len > arr.length) len = arr.length;
|
|
10799
10799
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
10800
10800
|
return arr2;
|
|
10801
10801
|
}
|
|
10802
|
-
function _array_with_holes$
|
|
10802
|
+
function _array_with_holes$c(arr) {
|
|
10803
10803
|
if (Array.isArray(arr)) return arr;
|
|
10804
10804
|
}
|
|
10805
10805
|
function _array_without_holes$7(arr) {
|
|
10806
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
10806
|
+
if (Array.isArray(arr)) return _array_like_to_array$g(arr);
|
|
10807
10807
|
}
|
|
10808
10808
|
function _iterable_to_array$7(iter) {
|
|
10809
10809
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
10810
10810
|
}
|
|
10811
|
-
function _iterable_to_array_limit$
|
|
10811
|
+
function _iterable_to_array_limit$c(arr, i) {
|
|
10812
10812
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
10813
10813
|
if (_i == null) return;
|
|
10814
10814
|
var _arr = [];
|
|
@@ -10832,25 +10832,25 @@ function _iterable_to_array_limit$b(arr, i) {
|
|
|
10832
10832
|
}
|
|
10833
10833
|
return _arr;
|
|
10834
10834
|
}
|
|
10835
|
-
function _non_iterable_rest$
|
|
10835
|
+
function _non_iterable_rest$c() {
|
|
10836
10836
|
throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
10837
10837
|
}
|
|
10838
10838
|
function _non_iterable_spread$7() {
|
|
10839
10839
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
10840
10840
|
}
|
|
10841
|
-
function _sliced_to_array$
|
|
10842
|
-
return _array_with_holes$
|
|
10841
|
+
function _sliced_to_array$c(arr, i) {
|
|
10842
|
+
return _array_with_holes$c(arr) || _iterable_to_array_limit$c(arr, i) || _unsupported_iterable_to_array$g(arr, i) || _non_iterable_rest$c();
|
|
10843
10843
|
}
|
|
10844
10844
|
function _to_consumable_array$7(arr) {
|
|
10845
|
-
return _array_without_holes$7(arr) || _iterable_to_array$7(arr) || _unsupported_iterable_to_array$
|
|
10845
|
+
return _array_without_holes$7(arr) || _iterable_to_array$7(arr) || _unsupported_iterable_to_array$g(arr) || _non_iterable_spread$7();
|
|
10846
10846
|
}
|
|
10847
|
-
function _unsupported_iterable_to_array$
|
|
10847
|
+
function _unsupported_iterable_to_array$g(o, minLen) {
|
|
10848
10848
|
if (!o) return;
|
|
10849
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
10849
|
+
if (typeof o === "string") return _array_like_to_array$g(o, minLen);
|
|
10850
10850
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
10851
10851
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
10852
10852
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
10853
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
10853
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$g(o, minLen);
|
|
10854
10854
|
}
|
|
10855
10855
|
/**
|
|
10856
10856
|
* Creates a bidirectional {@link PrimativeKeyDencoderMap} from the given values,
|
|
@@ -10874,7 +10874,7 @@ function _unsupported_iterable_to_array$f(o, minLen) {
|
|
|
10874
10874
|
valuesArray = values;
|
|
10875
10875
|
}
|
|
10876
10876
|
valuesArray.forEach(function(value) {
|
|
10877
|
-
var _value = _sliced_to_array$
|
|
10877
|
+
var _value = _sliced_to_array$c(value, 2), d = _value[0], e = _value[1];
|
|
10878
10878
|
if (map.has(d) || map.has(e)) {
|
|
10879
10879
|
throw new Error("primativeKeyDencoderMap() encountered a repeat key/value: ".concat(d, "/").concat(e, ". Keys and values must be unique."));
|
|
10880
10880
|
}
|
|
@@ -11265,12 +11265,12 @@ function _unsupported_iterable_to_array$f(o, minLen) {
|
|
|
11265
11265
|
};
|
|
11266
11266
|
}
|
|
11267
11267
|
|
|
11268
|
-
function _array_like_to_array$
|
|
11268
|
+
function _array_like_to_array$f(arr, len) {
|
|
11269
11269
|
if (len == null || len > arr.length) len = arr.length;
|
|
11270
11270
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
11271
11271
|
return arr2;
|
|
11272
11272
|
}
|
|
11273
|
-
function _array_with_holes$
|
|
11273
|
+
function _array_with_holes$b(arr) {
|
|
11274
11274
|
if (Array.isArray(arr)) return arr;
|
|
11275
11275
|
}
|
|
11276
11276
|
function _define_property$c(obj, key, value) {
|
|
@@ -11286,7 +11286,7 @@ function _define_property$c(obj, key, value) {
|
|
|
11286
11286
|
}
|
|
11287
11287
|
return obj;
|
|
11288
11288
|
}
|
|
11289
|
-
function _iterable_to_array_limit$
|
|
11289
|
+
function _iterable_to_array_limit$b(arr, i) {
|
|
11290
11290
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
11291
11291
|
if (_i == null) return;
|
|
11292
11292
|
var _arr = [];
|
|
@@ -11310,7 +11310,7 @@ function _iterable_to_array_limit$a(arr, i) {
|
|
|
11310
11310
|
}
|
|
11311
11311
|
return _arr;
|
|
11312
11312
|
}
|
|
11313
|
-
function _non_iterable_rest$
|
|
11313
|
+
function _non_iterable_rest$b() {
|
|
11314
11314
|
throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
11315
11315
|
}
|
|
11316
11316
|
function _object_spread$8(target) {
|
|
@@ -11347,20 +11347,20 @@ function _object_spread_props$4(target, source) {
|
|
|
11347
11347
|
}
|
|
11348
11348
|
return target;
|
|
11349
11349
|
}
|
|
11350
|
-
function _sliced_to_array$
|
|
11351
|
-
return _array_with_holes$
|
|
11350
|
+
function _sliced_to_array$b(arr, i) {
|
|
11351
|
+
return _array_with_holes$b(arr) || _iterable_to_array_limit$b(arr, i) || _unsupported_iterable_to_array$f(arr, i) || _non_iterable_rest$b();
|
|
11352
11352
|
}
|
|
11353
11353
|
function _type_of$9(obj) {
|
|
11354
11354
|
"@swc/helpers - typeof";
|
|
11355
11355
|
return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
|
|
11356
11356
|
}
|
|
11357
|
-
function _unsupported_iterable_to_array$
|
|
11357
|
+
function _unsupported_iterable_to_array$f(o, minLen) {
|
|
11358
11358
|
if (!o) return;
|
|
11359
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
11359
|
+
if (typeof o === "string") return _array_like_to_array$f(o, minLen);
|
|
11360
11360
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
11361
11361
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
11362
11362
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
11363
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
11363
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$f(o, minLen);
|
|
11364
11364
|
}
|
|
11365
11365
|
/**
|
|
11366
11366
|
* Minimum valid latitude value (-90 degrees).
|
|
@@ -11759,7 +11759,7 @@ function latLngString(lat, lng) {
|
|
|
11759
11759
|
* @param latLngString - string in the format `"lat,lng"`
|
|
11760
11760
|
* @returns the parsed point
|
|
11761
11761
|
*/ function latLngPointFromString(latLngString) {
|
|
11762
|
-
var _latLngString_split = _sliced_to_array$
|
|
11762
|
+
var _latLngString_split = _sliced_to_array$b(latLngString.split(','), 2), latString = _latLngString_split[0], lngString = _latLngString_split[1];
|
|
11763
11763
|
var lat = Number(latString) || 0; // default lat and lng to 0 if not valid.
|
|
11764
11764
|
var lng = Number(lngString) || 0;
|
|
11765
11765
|
return {
|
|
@@ -11858,21 +11858,21 @@ function latLngString(lat, lng) {
|
|
|
11858
11858
|
});
|
|
11859
11859
|
}
|
|
11860
11860
|
|
|
11861
|
-
function _array_like_to_array$
|
|
11861
|
+
function _array_like_to_array$e(arr, len) {
|
|
11862
11862
|
if (len == null || len > arr.length) len = arr.length;
|
|
11863
11863
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
11864
11864
|
return arr2;
|
|
11865
11865
|
}
|
|
11866
|
-
function _array_with_holes$
|
|
11866
|
+
function _array_with_holes$a(arr) {
|
|
11867
11867
|
if (Array.isArray(arr)) return arr;
|
|
11868
11868
|
}
|
|
11869
11869
|
function _array_without_holes$6(arr) {
|
|
11870
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
11870
|
+
if (Array.isArray(arr)) return _array_like_to_array$e(arr);
|
|
11871
11871
|
}
|
|
11872
11872
|
function _iterable_to_array$6(iter) {
|
|
11873
11873
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
11874
11874
|
}
|
|
11875
|
-
function _iterable_to_array_limit$
|
|
11875
|
+
function _iterable_to_array_limit$a(arr, i) {
|
|
11876
11876
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
11877
11877
|
if (_i == null) return;
|
|
11878
11878
|
var _arr = [];
|
|
@@ -11896,29 +11896,29 @@ function _iterable_to_array_limit$9(arr, i) {
|
|
|
11896
11896
|
}
|
|
11897
11897
|
return _arr;
|
|
11898
11898
|
}
|
|
11899
|
-
function _non_iterable_rest$
|
|
11899
|
+
function _non_iterable_rest$a() {
|
|
11900
11900
|
throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
11901
11901
|
}
|
|
11902
11902
|
function _non_iterable_spread$6() {
|
|
11903
11903
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
11904
11904
|
}
|
|
11905
|
-
function _sliced_to_array$
|
|
11906
|
-
return _array_with_holes$
|
|
11905
|
+
function _sliced_to_array$a(arr, i) {
|
|
11906
|
+
return _array_with_holes$a(arr) || _iterable_to_array_limit$a(arr, i) || _unsupported_iterable_to_array$e(arr, i) || _non_iterable_rest$a();
|
|
11907
11907
|
}
|
|
11908
11908
|
function _to_consumable_array$6(arr) {
|
|
11909
|
-
return _array_without_holes$6(arr) || _iterable_to_array$6(arr) || _unsupported_iterable_to_array$
|
|
11909
|
+
return _array_without_holes$6(arr) || _iterable_to_array$6(arr) || _unsupported_iterable_to_array$e(arr) || _non_iterable_spread$6();
|
|
11910
11910
|
}
|
|
11911
11911
|
function _type_of$8(obj) {
|
|
11912
11912
|
"@swc/helpers - typeof";
|
|
11913
11913
|
return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
|
|
11914
11914
|
}
|
|
11915
|
-
function _unsupported_iterable_to_array$
|
|
11915
|
+
function _unsupported_iterable_to_array$e(o, minLen) {
|
|
11916
11916
|
if (!o) return;
|
|
11917
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
11917
|
+
if (typeof o === "string") return _array_like_to_array$e(o, minLen);
|
|
11918
11918
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
11919
11919
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
11920
11920
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
11921
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
11921
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$e(o, minLen);
|
|
11922
11922
|
}
|
|
11923
11923
|
/**
|
|
11924
11924
|
* Type guard that checks whether the input is a {@link LatLngBound} by testing for the presence of `sw` and `ne` properties.
|
|
@@ -12145,7 +12145,7 @@ function _unsupported_iterable_to_array$d(o, minLen) {
|
|
|
12145
12145
|
var bound;
|
|
12146
12146
|
if (Array.isArray(input)) {
|
|
12147
12147
|
if (input.length === 2) {
|
|
12148
|
-
var _input = _sliced_to_array$
|
|
12148
|
+
var _input = _sliced_to_array$a(input, 2), sw = _input[0], ne = _input[1];
|
|
12149
12149
|
bound = {
|
|
12150
12150
|
sw: latLngPoint(sw),
|
|
12151
12151
|
ne: latLngPoint(ne)
|
|
@@ -12456,12 +12456,12 @@ function _unsupported_iterable_to_array$d(o, minLen) {
|
|
|
12456
12456
|
return fn;
|
|
12457
12457
|
}
|
|
12458
12458
|
|
|
12459
|
-
function _array_like_to_array$
|
|
12459
|
+
function _array_like_to_array$d(arr, len) {
|
|
12460
12460
|
if (len == null || len > arr.length) len = arr.length;
|
|
12461
12461
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
12462
12462
|
return arr2;
|
|
12463
12463
|
}
|
|
12464
|
-
function _array_with_holes$
|
|
12464
|
+
function _array_with_holes$9(arr) {
|
|
12465
12465
|
if (Array.isArray(arr)) return arr;
|
|
12466
12466
|
}
|
|
12467
12467
|
function _instanceof$1(left, right) {
|
|
@@ -12471,7 +12471,7 @@ function _instanceof$1(left, right) {
|
|
|
12471
12471
|
return left instanceof right;
|
|
12472
12472
|
}
|
|
12473
12473
|
}
|
|
12474
|
-
function _iterable_to_array_limit$
|
|
12474
|
+
function _iterable_to_array_limit$9(arr, i) {
|
|
12475
12475
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
12476
12476
|
if (_i == null) return;
|
|
12477
12477
|
var _arr = [];
|
|
@@ -12495,23 +12495,23 @@ function _iterable_to_array_limit$8(arr, i) {
|
|
|
12495
12495
|
}
|
|
12496
12496
|
return _arr;
|
|
12497
12497
|
}
|
|
12498
|
-
function _non_iterable_rest$
|
|
12498
|
+
function _non_iterable_rest$9() {
|
|
12499
12499
|
throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
12500
12500
|
}
|
|
12501
|
-
function _sliced_to_array$
|
|
12502
|
-
return _array_with_holes$
|
|
12501
|
+
function _sliced_to_array$9(arr, i) {
|
|
12502
|
+
return _array_with_holes$9(arr) || _iterable_to_array_limit$9(arr, i) || _unsupported_iterable_to_array$d(arr, i) || _non_iterable_rest$9();
|
|
12503
12503
|
}
|
|
12504
12504
|
function _type_of$7(obj) {
|
|
12505
12505
|
"@swc/helpers - typeof";
|
|
12506
12506
|
return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
|
|
12507
12507
|
}
|
|
12508
|
-
function _unsupported_iterable_to_array$
|
|
12508
|
+
function _unsupported_iterable_to_array$d(o, minLen) {
|
|
12509
12509
|
if (!o) return;
|
|
12510
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
12510
|
+
if (typeof o === "string") return _array_like_to_array$d(o, minLen);
|
|
12511
12511
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
12512
12512
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
12513
12513
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
12514
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
12514
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$d(o, minLen);
|
|
12515
12515
|
}
|
|
12516
12516
|
/**
|
|
12517
12517
|
* Regular expression for validating ISO8601 date strings.
|
|
@@ -12590,7 +12590,7 @@ function isConsideredUtcTimezoneString(timezone) {
|
|
|
12590
12590
|
* @param inputDateString - The ISO8601 day string to parse (e.g., '2022-01-15')
|
|
12591
12591
|
* @returns A Date object set to midnight UTC on the specified day
|
|
12592
12592
|
*/ function parseISO8601DayStringToUTCDate(inputDateString) {
|
|
12593
|
-
var _inputDateString_split = _sliced_to_array$
|
|
12593
|
+
var _inputDateString_split = _sliced_to_array$9(inputDateString.split('-'), 3), yearString = _inputDateString_split[0], monthString = _inputDateString_split[1], dateString = _inputDateString_split[2];
|
|
12594
12594
|
return new Date(Date.UTC(Number(yearString), Number(monthString) - 1, Number(dateString)));
|
|
12595
12595
|
}
|
|
12596
12596
|
/**
|
|
@@ -12628,7 +12628,7 @@ function isConsideredUtcTimezoneString(timezone) {
|
|
|
12628
12628
|
* @param slashDate - The slash date string to convert (e.g., '1/1/20' or '11/15/2022')
|
|
12629
12629
|
* @returns An ISO8601 formatted day string (YYYY-MM-DD)
|
|
12630
12630
|
*/ function monthDaySlashDateToDateString(slashDate) {
|
|
12631
|
-
var _slashDate_split = _sliced_to_array$
|
|
12631
|
+
var _slashDate_split = _sliced_to_array$9(slashDate.split('/'), 3), month = _slashDate_split[0], day = _slashDate_split[1], year = _slashDate_split[2];
|
|
12632
12632
|
if (month.length === 1) {
|
|
12633
12633
|
month = "0".concat(month);
|
|
12634
12634
|
}
|
|
@@ -12657,7 +12657,7 @@ function dateFromDateOrTimeMillisecondsNumber(input) {
|
|
|
12657
12657
|
* @param dateTimeNumber - Unix timestamp number to convert
|
|
12658
12658
|
* @returns Date object if timestamp is valid, null/undefined if timestamp is null/undefined
|
|
12659
12659
|
*/ function unixMillisecondsNumberToDate(dateTimeNumber) {
|
|
12660
|
-
return dateTimeNumber
|
|
12660
|
+
return dateTimeNumber == null ? dateTimeNumber : new Date(dateTimeNumber);
|
|
12661
12661
|
}
|
|
12662
12662
|
/**
|
|
12663
12663
|
* Converts the input DateOrMilliseconds to a Date.
|
|
@@ -13585,7 +13585,7 @@ function _ts_generator$7(thisArg, body) {
|
|
|
13585
13585
|
var dencoder = inputDencoder !== null && inputDencoder !== void 0 ? inputDencoder : NUMBER_STRING_DENCODER_64;
|
|
13586
13586
|
var dencoderNumberValue = numberStringDencoderDecodedNumberValueFunction(dencoder);
|
|
13587
13587
|
var startAtFromCurrentIndex = currentIndex != null ? dencoderNumberValue(currentIndex) + increaseBy : undefined;
|
|
13588
|
-
var startAt = inputStartAt
|
|
13588
|
+
var startAt = inputStartAt == null ? startAtFromCurrentIndex !== null && startAtFromCurrentIndex !== void 0 ? startAtFromCurrentIndex : 0 : dencoderNumberValue(inputStartAt);
|
|
13589
13589
|
var transform = inputTranformFunction !== null && inputTranformFunction !== void 0 ? inputTranformFunction : mapIdentityFunction();
|
|
13590
13590
|
var numberFactory = incrementingNumberFactory({
|
|
13591
13591
|
startAt: startAt,
|
|
@@ -13598,13 +13598,13 @@ function _ts_generator$7(thisArg, body) {
|
|
|
13598
13598
|
};
|
|
13599
13599
|
}
|
|
13600
13600
|
|
|
13601
|
-
function _array_like_to_array$
|
|
13601
|
+
function _array_like_to_array$c(arr, len) {
|
|
13602
13602
|
if (len == null || len > arr.length) len = arr.length;
|
|
13603
13603
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
13604
13604
|
return arr2;
|
|
13605
13605
|
}
|
|
13606
13606
|
function _array_without_holes$5(arr) {
|
|
13607
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
13607
|
+
if (Array.isArray(arr)) return _array_like_to_array$c(arr);
|
|
13608
13608
|
}
|
|
13609
13609
|
function _iterable_to_array$5(iter) {
|
|
13610
13610
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
@@ -13613,15 +13613,15 @@ function _non_iterable_spread$5() {
|
|
|
13613
13613
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
13614
13614
|
}
|
|
13615
13615
|
function _to_consumable_array$5(arr) {
|
|
13616
|
-
return _array_without_holes$5(arr) || _iterable_to_array$5(arr) || _unsupported_iterable_to_array$
|
|
13616
|
+
return _array_without_holes$5(arr) || _iterable_to_array$5(arr) || _unsupported_iterable_to_array$c(arr) || _non_iterable_spread$5();
|
|
13617
13617
|
}
|
|
13618
|
-
function _unsupported_iterable_to_array$
|
|
13618
|
+
function _unsupported_iterable_to_array$c(o, minLen) {
|
|
13619
13619
|
if (!o) return;
|
|
13620
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
13620
|
+
if (typeof o === "string") return _array_like_to_array$c(o, minLen);
|
|
13621
13621
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
13622
13622
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
13623
13623
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
13624
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
13624
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$c(o, minLen);
|
|
13625
13625
|
}
|
|
13626
13626
|
/**
|
|
13627
13627
|
* Creates an {@link ObjectDeltaArrayCompressor} that can compress and expand arrays of objects using delta encoding.
|
|
@@ -13882,7 +13882,7 @@ function dateFromDateOrTimeSecondsNumber(input) {
|
|
|
13882
13882
|
* @returns An ExpirationDetails object that can determine expiration state
|
|
13883
13883
|
*/ function expirationDetails(input) {
|
|
13884
13884
|
var expiresAt = input.expiresAt, expires = input.expires, inputNow = input.now, expiresFromDate = input.expiresFromDate, defaultExpiresFromDateToNow = input.defaultExpiresFromDateToNow, expiresIn = input.expiresIn;
|
|
13885
|
-
var parsedExpiresFromDate = expiresFromDate
|
|
13885
|
+
var parsedExpiresFromDate = expiresFromDate == null ? null : dateFromDateOrTimeMillisecondsNumber(expiresFromDate);
|
|
13886
13886
|
function getNow(nowOverride) {
|
|
13887
13887
|
var _ref;
|
|
13888
13888
|
return (_ref = nowOverride !== null && nowOverride !== void 0 ? nowOverride : inputNow) !== null && _ref !== void 0 ? _ref : new Date();
|
|
@@ -14000,13 +14000,13 @@ function dateFromDateOrTimeSecondsNumber(input) {
|
|
|
14000
14000
|
return firstExpired !== -1;
|
|
14001
14001
|
}
|
|
14002
14002
|
|
|
14003
|
-
function _array_like_to_array$
|
|
14003
|
+
function _array_like_to_array$b(arr, len) {
|
|
14004
14004
|
if (len == null || len > arr.length) len = arr.length;
|
|
14005
14005
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
14006
14006
|
return arr2;
|
|
14007
14007
|
}
|
|
14008
14008
|
function _array_without_holes$4(arr) {
|
|
14009
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
14009
|
+
if (Array.isArray(arr)) return _array_like_to_array$b(arr);
|
|
14010
14010
|
}
|
|
14011
14011
|
function _iterable_to_array$4(iter) {
|
|
14012
14012
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
@@ -14015,15 +14015,15 @@ function _non_iterable_spread$4() {
|
|
|
14015
14015
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
14016
14016
|
}
|
|
14017
14017
|
function _to_consumable_array$4(arr) {
|
|
14018
|
-
return _array_without_holes$4(arr) || _iterable_to_array$4(arr) || _unsupported_iterable_to_array$
|
|
14018
|
+
return _array_without_holes$4(arr) || _iterable_to_array$4(arr) || _unsupported_iterable_to_array$b(arr) || _non_iterable_spread$4();
|
|
14019
14019
|
}
|
|
14020
|
-
function _unsupported_iterable_to_array$
|
|
14020
|
+
function _unsupported_iterable_to_array$b(o, minLen) {
|
|
14021
14021
|
if (!o) return;
|
|
14022
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
14022
|
+
if (typeof o === "string") return _array_like_to_array$b(o, minLen);
|
|
14023
14023
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
14024
14024
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
14025
14025
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
14026
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
14026
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$b(o, minLen);
|
|
14027
14027
|
}
|
|
14028
14028
|
/**
|
|
14029
14029
|
* Returns the day of the week for the input date.
|
|
@@ -14760,16 +14760,16 @@ var PROMISE_REF_NUMBER = 0;
|
|
|
14760
14760
|
return ref;
|
|
14761
14761
|
}
|
|
14762
14762
|
|
|
14763
|
-
function _array_like_to_array$
|
|
14763
|
+
function _array_like_to_array$a(arr, len) {
|
|
14764
14764
|
if (len == null || len > arr.length) len = arr.length;
|
|
14765
14765
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
14766
14766
|
return arr2;
|
|
14767
14767
|
}
|
|
14768
|
-
function _array_with_holes$
|
|
14768
|
+
function _array_with_holes$8(arr) {
|
|
14769
14769
|
if (Array.isArray(arr)) return arr;
|
|
14770
14770
|
}
|
|
14771
14771
|
function _array_without_holes$3(arr) {
|
|
14772
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
14772
|
+
if (Array.isArray(arr)) return _array_like_to_array$a(arr);
|
|
14773
14773
|
}
|
|
14774
14774
|
function asyncGeneratorStep$4(gen, resolve, reject, _next, _throw, key, arg) {
|
|
14775
14775
|
try {
|
|
@@ -14816,7 +14816,7 @@ function _define_property$9(obj, key, value) {
|
|
|
14816
14816
|
function _iterable_to_array$3(iter) {
|
|
14817
14817
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
14818
14818
|
}
|
|
14819
|
-
function _iterable_to_array_limit$
|
|
14819
|
+
function _iterable_to_array_limit$8(arr, i) {
|
|
14820
14820
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
14821
14821
|
if (_i == null) return;
|
|
14822
14822
|
var _arr = [];
|
|
@@ -14840,7 +14840,7 @@ function _iterable_to_array_limit$7(arr, i) {
|
|
|
14840
14840
|
}
|
|
14841
14841
|
return _arr;
|
|
14842
14842
|
}
|
|
14843
|
-
function _non_iterable_rest$
|
|
14843
|
+
function _non_iterable_rest$8() {
|
|
14844
14844
|
throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
14845
14845
|
}
|
|
14846
14846
|
function _non_iterable_spread$3() {
|
|
@@ -14880,19 +14880,19 @@ function _object_spread_props$2(target, source) {
|
|
|
14880
14880
|
}
|
|
14881
14881
|
return target;
|
|
14882
14882
|
}
|
|
14883
|
-
function _sliced_to_array$
|
|
14884
|
-
return _array_with_holes$
|
|
14883
|
+
function _sliced_to_array$8(arr, i) {
|
|
14884
|
+
return _array_with_holes$8(arr) || _iterable_to_array_limit$8(arr, i) || _unsupported_iterable_to_array$a(arr, i) || _non_iterable_rest$8();
|
|
14885
14885
|
}
|
|
14886
14886
|
function _to_consumable_array$3(arr) {
|
|
14887
|
-
return _array_without_holes$3(arr) || _iterable_to_array$3(arr) || _unsupported_iterable_to_array$
|
|
14887
|
+
return _array_without_holes$3(arr) || _iterable_to_array$3(arr) || _unsupported_iterable_to_array$a(arr) || _non_iterable_spread$3();
|
|
14888
14888
|
}
|
|
14889
|
-
function _unsupported_iterable_to_array$
|
|
14889
|
+
function _unsupported_iterable_to_array$a(o, minLen) {
|
|
14890
14890
|
if (!o) return;
|
|
14891
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
14891
|
+
if (typeof o === "string") return _array_like_to_array$a(o, minLen);
|
|
14892
14892
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
14893
14893
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
14894
14894
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
14895
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
14895
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$a(o, minLen);
|
|
14896
14896
|
}
|
|
14897
14897
|
function _ts_generator$4(thisArg, body) {
|
|
14898
14898
|
var f, y, t, _ = {
|
|
@@ -15145,7 +15145,7 @@ function _ts_generator$4(thisArg, body) {
|
|
|
15145
15145
|
}, config)
|
|
15146
15146
|
];
|
|
15147
15147
|
case 1:
|
|
15148
|
-
_ref = _sliced_to_array$
|
|
15148
|
+
_ref = _sliced_to_array$8.apply(void 0, [
|
|
15149
15149
|
_state.sent(),
|
|
15150
15150
|
3
|
|
15151
15151
|
]), value = _ref[1], success = _ref[2];
|
|
@@ -16085,12 +16085,12 @@ function _ts_generator$3(thisArg, body) {
|
|
|
16085
16085
|
};
|
|
16086
16086
|
}
|
|
16087
16087
|
|
|
16088
|
-
function _array_like_to_array$
|
|
16088
|
+
function _array_like_to_array$9(arr, len) {
|
|
16089
16089
|
if (len == null || len > arr.length) len = arr.length;
|
|
16090
16090
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
16091
16091
|
return arr2;
|
|
16092
16092
|
}
|
|
16093
|
-
function _array_with_holes$
|
|
16093
|
+
function _array_with_holes$7(arr) {
|
|
16094
16094
|
if (Array.isArray(arr)) return arr;
|
|
16095
16095
|
}
|
|
16096
16096
|
function asyncGeneratorStep$2(gen, resolve, reject, _next, _throw, key, arg) {
|
|
@@ -16135,7 +16135,7 @@ function _define_property$7(obj, key, value) {
|
|
|
16135
16135
|
}
|
|
16136
16136
|
return obj;
|
|
16137
16137
|
}
|
|
16138
|
-
function _iterable_to_array_limit$
|
|
16138
|
+
function _iterable_to_array_limit$7(arr, i) {
|
|
16139
16139
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
16140
16140
|
if (_i == null) return;
|
|
16141
16141
|
var _arr = [];
|
|
@@ -16159,7 +16159,7 @@ function _iterable_to_array_limit$6(arr, i) {
|
|
|
16159
16159
|
}
|
|
16160
16160
|
return _arr;
|
|
16161
16161
|
}
|
|
16162
|
-
function _non_iterable_rest$
|
|
16162
|
+
function _non_iterable_rest$7() {
|
|
16163
16163
|
throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
16164
16164
|
}
|
|
16165
16165
|
function _object_spread$3(target) {
|
|
@@ -16196,16 +16196,16 @@ function _object_spread_props$1(target, source) {
|
|
|
16196
16196
|
}
|
|
16197
16197
|
return target;
|
|
16198
16198
|
}
|
|
16199
|
-
function _sliced_to_array$
|
|
16200
|
-
return _array_with_holes$
|
|
16199
|
+
function _sliced_to_array$7(arr, i) {
|
|
16200
|
+
return _array_with_holes$7(arr) || _iterable_to_array_limit$7(arr, i) || _unsupported_iterable_to_array$9(arr, i) || _non_iterable_rest$7();
|
|
16201
16201
|
}
|
|
16202
|
-
function _unsupported_iterable_to_array$
|
|
16202
|
+
function _unsupported_iterable_to_array$9(o, minLen) {
|
|
16203
16203
|
if (!o) return;
|
|
16204
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
16204
|
+
if (typeof o === "string") return _array_like_to_array$9(o, minLen);
|
|
16205
16205
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
16206
16206
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
16207
16207
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
16208
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
16208
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$9(o, minLen);
|
|
16209
16209
|
}
|
|
16210
16210
|
function _ts_generator$2(thisArg, body) {
|
|
16211
16211
|
var f, y, t, _ = {
|
|
@@ -16323,7 +16323,7 @@ function _ts_generator$2(thisArg, body) {
|
|
|
16323
16323
|
tasks = inputTasks;
|
|
16324
16324
|
} else {
|
|
16325
16325
|
tasks = Object.entries(inputTasks).map(function(param) {
|
|
16326
|
-
var _param = _sliced_to_array$
|
|
16326
|
+
var _param = _sliced_to_array$7(param, 2), name = _param[0], run = _param[1];
|
|
16327
16327
|
var namedTask = {
|
|
16328
16328
|
name: name,
|
|
16329
16329
|
run: run
|
|
@@ -16850,12 +16850,12 @@ function dateFromLogicalDate(logicalDate) {
|
|
|
16850
16850
|
return convertTimeDuration(totalMinutes, 'min', toUnit);
|
|
16851
16851
|
}
|
|
16852
16852
|
|
|
16853
|
-
function _array_like_to_array$
|
|
16853
|
+
function _array_like_to_array$8(arr, len) {
|
|
16854
16854
|
if (len == null || len > arr.length) len = arr.length;
|
|
16855
16855
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
16856
16856
|
return arr2;
|
|
16857
16857
|
}
|
|
16858
|
-
function _array_with_holes$
|
|
16858
|
+
function _array_with_holes$6(arr) {
|
|
16859
16859
|
if (Array.isArray(arr)) return arr;
|
|
16860
16860
|
}
|
|
16861
16861
|
function _instanceof(left, right) {
|
|
@@ -16865,7 +16865,7 @@ function _instanceof(left, right) {
|
|
|
16865
16865
|
return left instanceof right;
|
|
16866
16866
|
}
|
|
16867
16867
|
}
|
|
16868
|
-
function _iterable_to_array_limit$
|
|
16868
|
+
function _iterable_to_array_limit$6(arr, i) {
|
|
16869
16869
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
16870
16870
|
if (_i == null) return;
|
|
16871
16871
|
var _arr = [];
|
|
@@ -16889,23 +16889,23 @@ function _iterable_to_array_limit$5(arr, i) {
|
|
|
16889
16889
|
}
|
|
16890
16890
|
return _arr;
|
|
16891
16891
|
}
|
|
16892
|
-
function _non_iterable_rest$
|
|
16892
|
+
function _non_iterable_rest$6() {
|
|
16893
16893
|
throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
16894
16894
|
}
|
|
16895
|
-
function _sliced_to_array$
|
|
16896
|
-
return _array_with_holes$
|
|
16895
|
+
function _sliced_to_array$6(arr, i) {
|
|
16896
|
+
return _array_with_holes$6(arr) || _iterable_to_array_limit$6(arr, i) || _unsupported_iterable_to_array$8(arr, i) || _non_iterable_rest$6();
|
|
16897
16897
|
}
|
|
16898
16898
|
function _type_of$3(obj) {
|
|
16899
16899
|
"@swc/helpers - typeof";
|
|
16900
16900
|
return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
|
|
16901
16901
|
}
|
|
16902
|
-
function _unsupported_iterable_to_array$
|
|
16902
|
+
function _unsupported_iterable_to_array$8(o, minLen) {
|
|
16903
16903
|
if (!o) return;
|
|
16904
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
16904
|
+
if (typeof o === "string") return _array_like_to_array$8(o, minLen);
|
|
16905
16905
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
16906
16906
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
16907
16907
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
16908
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
16908
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$8(o, minLen);
|
|
16909
16909
|
}
|
|
16910
16910
|
/**
|
|
16911
16911
|
* Performs a deep equality comparison between two values.
|
|
@@ -16984,7 +16984,7 @@ function _compareMaps(a, b, pojoFilter) {
|
|
|
16984
16984
|
return false;
|
|
16985
16985
|
}
|
|
16986
16986
|
var firstInequalityIndex = Array.from(a.entries()).findIndex(function(param) {
|
|
16987
|
-
var _param = _sliced_to_array$
|
|
16987
|
+
var _param = _sliced_to_array$6(param, 2), key = _param[0], aValue = _param[1];
|
|
16988
16988
|
var bValue = b.get(key);
|
|
16989
16989
|
return !areEqualPOJOValuesUsingPojoFilter(aValue, bValue, pojoFilter);
|
|
16990
16990
|
});
|
|
@@ -17103,15 +17103,15 @@ function _compareObjects(a, b, pojoFilter) {
|
|
|
17103
17103
|
});
|
|
17104
17104
|
}
|
|
17105
17105
|
|
|
17106
|
-
function _array_like_to_array$
|
|
17106
|
+
function _array_like_to_array$7(arr, len) {
|
|
17107
17107
|
if (len == null || len > arr.length) len = arr.length;
|
|
17108
17108
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
17109
17109
|
return arr2;
|
|
17110
17110
|
}
|
|
17111
|
-
function _array_with_holes$
|
|
17111
|
+
function _array_with_holes$5(arr) {
|
|
17112
17112
|
if (Array.isArray(arr)) return arr;
|
|
17113
17113
|
}
|
|
17114
|
-
function _iterable_to_array_limit$
|
|
17114
|
+
function _iterable_to_array_limit$5(arr, i) {
|
|
17115
17115
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
17116
17116
|
if (_i == null) return;
|
|
17117
17117
|
var _arr = [];
|
|
@@ -17135,19 +17135,19 @@ function _iterable_to_array_limit$4(arr, i) {
|
|
|
17135
17135
|
}
|
|
17136
17136
|
return _arr;
|
|
17137
17137
|
}
|
|
17138
|
-
function _non_iterable_rest$
|
|
17138
|
+
function _non_iterable_rest$5() {
|
|
17139
17139
|
throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
17140
17140
|
}
|
|
17141
|
-
function _sliced_to_array$
|
|
17142
|
-
return _array_with_holes$
|
|
17141
|
+
function _sliced_to_array$5(arr, i) {
|
|
17142
|
+
return _array_with_holes$5(arr) || _iterable_to_array_limit$5(arr, i) || _unsupported_iterable_to_array$7(arr, i) || _non_iterable_rest$5();
|
|
17143
17143
|
}
|
|
17144
|
-
function _unsupported_iterable_to_array$
|
|
17144
|
+
function _unsupported_iterable_to_array$7(o, minLen) {
|
|
17145
17145
|
if (!o) return;
|
|
17146
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
17146
|
+
if (typeof o === "string") return _array_like_to_array$7(o, minLen);
|
|
17147
17147
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
17148
17148
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
17149
17149
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
17150
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
17150
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$7(o, minLen);
|
|
17151
17151
|
}
|
|
17152
17152
|
/**
|
|
17153
17153
|
* Converts an {@link ObjectMap} into a `Map` using `Object.entries`.
|
|
@@ -17201,7 +17201,7 @@ function _unsupported_iterable_to_array$6(o, minLen) {
|
|
|
17201
17201
|
return function(object) {
|
|
17202
17202
|
var target = {};
|
|
17203
17203
|
Object.entries(object).forEach(function(param) {
|
|
17204
|
-
var _param = _sliced_to_array$
|
|
17204
|
+
var _param = _sliced_to_array$5(param, 2), key = _param[0], value = _param[1];
|
|
17205
17205
|
var newKey = mapKeyFn(key, value);
|
|
17206
17206
|
target[newKey] = value;
|
|
17207
17207
|
});
|
|
@@ -17327,15 +17327,15 @@ function _type_of$2(obj) {
|
|
|
17327
17327
|
};
|
|
17328
17328
|
}
|
|
17329
17329
|
|
|
17330
|
-
function _array_like_to_array$
|
|
17330
|
+
function _array_like_to_array$6(arr, len) {
|
|
17331
17331
|
if (len == null || len > arr.length) len = arr.length;
|
|
17332
17332
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
17333
17333
|
return arr2;
|
|
17334
17334
|
}
|
|
17335
|
-
function _array_with_holes$
|
|
17335
|
+
function _array_with_holes$4(arr) {
|
|
17336
17336
|
if (Array.isArray(arr)) return arr;
|
|
17337
17337
|
}
|
|
17338
|
-
function _iterable_to_array_limit$
|
|
17338
|
+
function _iterable_to_array_limit$4(arr, i) {
|
|
17339
17339
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
17340
17340
|
if (_i == null) return;
|
|
17341
17341
|
var _arr = [];
|
|
@@ -17359,19 +17359,19 @@ function _iterable_to_array_limit$3(arr, i) {
|
|
|
17359
17359
|
}
|
|
17360
17360
|
return _arr;
|
|
17361
17361
|
}
|
|
17362
|
-
function _non_iterable_rest$
|
|
17362
|
+
function _non_iterable_rest$4() {
|
|
17363
17363
|
throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
17364
17364
|
}
|
|
17365
|
-
function _sliced_to_array$
|
|
17366
|
-
return _array_with_holes$
|
|
17365
|
+
function _sliced_to_array$4(arr, i) {
|
|
17366
|
+
return _array_with_holes$4(arr) || _iterable_to_array_limit$4(arr, i) || _unsupported_iterable_to_array$6(arr, i) || _non_iterable_rest$4();
|
|
17367
17367
|
}
|
|
17368
|
-
function _unsupported_iterable_to_array$
|
|
17368
|
+
function _unsupported_iterable_to_array$6(o, minLen) {
|
|
17369
17369
|
if (!o) return;
|
|
17370
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
17370
|
+
if (typeof o === "string") return _array_like_to_array$6(o, minLen);
|
|
17371
17371
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
17372
17372
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
17373
17373
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
17374
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
17374
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$6(o, minLen);
|
|
17375
17375
|
}
|
|
17376
17376
|
/**
|
|
17377
17377
|
* Creates bidirectional map functions (`from` and `to`) from a set of {@link ModelFieldConversions}.
|
|
@@ -17383,21 +17383,21 @@ function _unsupported_iterable_to_array$5(o, minLen) {
|
|
|
17383
17383
|
*/ function makeModelMapFunctions(fields) {
|
|
17384
17384
|
var keys = filterKeyValueTuples(fields);
|
|
17385
17385
|
var conversionsByKey = keys.map(function(param) {
|
|
17386
|
-
var _param = _sliced_to_array$
|
|
17386
|
+
var _param = _sliced_to_array$4(param, 2), key = _param[0], field = _param[1];
|
|
17387
17387
|
return [
|
|
17388
17388
|
key,
|
|
17389
17389
|
field
|
|
17390
17390
|
];
|
|
17391
17391
|
});
|
|
17392
17392
|
var fromConversions = conversionsByKey.map(function(param) {
|
|
17393
|
-
var _param = _sliced_to_array$
|
|
17393
|
+
var _param = _sliced_to_array$4(param, 2), key = _param[0], configs = _param[1];
|
|
17394
17394
|
return [
|
|
17395
17395
|
key,
|
|
17396
17396
|
configs.from
|
|
17397
17397
|
];
|
|
17398
17398
|
});
|
|
17399
17399
|
var toConversions = conversionsByKey.map(function(param) {
|
|
17400
|
-
var _param = _sliced_to_array$
|
|
17400
|
+
var _param = _sliced_to_array$4(param, 2), key = _param[0], configs = _param[1];
|
|
17401
17401
|
return [
|
|
17402
17402
|
key,
|
|
17403
17403
|
configs.to
|
|
@@ -17433,7 +17433,7 @@ function _unsupported_iterable_to_array$5(o, minLen) {
|
|
|
17433
17433
|
});
|
|
17434
17434
|
}
|
|
17435
17435
|
targetFields.forEach(function(param) {
|
|
17436
|
-
var _param = _sliced_to_array$
|
|
17436
|
+
var _param = _sliced_to_array$4(param, 2), key = _param[0], convert = _param[1];
|
|
17437
17437
|
return target[key] = convert(input[key]);
|
|
17438
17438
|
});
|
|
17439
17439
|
}
|
|
@@ -17688,13 +17688,13 @@ function _object_spread$2(target) {
|
|
|
17688
17688
|
return config ? "".concat(config.host, ":").concat(config.port) : config;
|
|
17689
17689
|
}
|
|
17690
17690
|
|
|
17691
|
-
function _array_like_to_array$
|
|
17691
|
+
function _array_like_to_array$5(arr, len) {
|
|
17692
17692
|
if (len == null || len > arr.length) len = arr.length;
|
|
17693
17693
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
17694
17694
|
return arr2;
|
|
17695
17695
|
}
|
|
17696
17696
|
function _array_without_holes$2(arr) {
|
|
17697
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
17697
|
+
if (Array.isArray(arr)) return _array_like_to_array$5(arr);
|
|
17698
17698
|
}
|
|
17699
17699
|
function _class_call_check$5(instance, Constructor) {
|
|
17700
17700
|
if (!(instance instanceof Constructor)) {
|
|
@@ -17721,15 +17721,15 @@ function _non_iterable_spread$2() {
|
|
|
17721
17721
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
17722
17722
|
}
|
|
17723
17723
|
function _to_consumable_array$2(arr) {
|
|
17724
|
-
return _array_without_holes$2(arr) || _iterable_to_array$2(arr) || _unsupported_iterable_to_array$
|
|
17724
|
+
return _array_without_holes$2(arr) || _iterable_to_array$2(arr) || _unsupported_iterable_to_array$5(arr) || _non_iterable_spread$2();
|
|
17725
17725
|
}
|
|
17726
|
-
function _unsupported_iterable_to_array$
|
|
17726
|
+
function _unsupported_iterable_to_array$5(o, minLen) {
|
|
17727
17727
|
if (!o) return;
|
|
17728
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
17728
|
+
if (typeof o === "string") return _array_like_to_array$5(o, minLen);
|
|
17729
17729
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
17730
17730
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
17731
17731
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
17732
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
17732
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$5(o, minLen);
|
|
17733
17733
|
}
|
|
17734
17734
|
/**
|
|
17735
17735
|
* Type of relation change to perform on a collection of models.
|
|
@@ -18220,12 +18220,12 @@ function handlerFactory(readKey, options) {
|
|
|
18220
18220
|
};
|
|
18221
18221
|
}
|
|
18222
18222
|
|
|
18223
|
-
function _array_like_to_array$
|
|
18223
|
+
function _array_like_to_array$4(arr, len) {
|
|
18224
18224
|
if (len == null || len > arr.length) len = arr.length;
|
|
18225
18225
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
18226
18226
|
return arr2;
|
|
18227
18227
|
}
|
|
18228
|
-
function _array_with_holes$
|
|
18228
|
+
function _array_with_holes$3(arr) {
|
|
18229
18229
|
if (Array.isArray(arr)) return arr;
|
|
18230
18230
|
}
|
|
18231
18231
|
function _class_call_check$4(instance, Constructor) {
|
|
@@ -18259,7 +18259,7 @@ function _define_property$5(obj, key, value) {
|
|
|
18259
18259
|
}
|
|
18260
18260
|
return obj;
|
|
18261
18261
|
}
|
|
18262
|
-
function _iterable_to_array_limit$
|
|
18262
|
+
function _iterable_to_array_limit$3(arr, i) {
|
|
18263
18263
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
18264
18264
|
if (_i == null) return;
|
|
18265
18265
|
var _arr = [];
|
|
@@ -18283,19 +18283,19 @@ function _iterable_to_array_limit$2(arr, i) {
|
|
|
18283
18283
|
}
|
|
18284
18284
|
return _arr;
|
|
18285
18285
|
}
|
|
18286
|
-
function _non_iterable_rest$
|
|
18286
|
+
function _non_iterable_rest$3() {
|
|
18287
18287
|
throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
18288
18288
|
}
|
|
18289
|
-
function _sliced_to_array$
|
|
18290
|
-
return _array_with_holes$
|
|
18289
|
+
function _sliced_to_array$3(arr, i) {
|
|
18290
|
+
return _array_with_holes$3(arr) || _iterable_to_array_limit$3(arr, i) || _unsupported_iterable_to_array$4(arr, i) || _non_iterable_rest$3();
|
|
18291
18291
|
}
|
|
18292
|
-
function _unsupported_iterable_to_array$
|
|
18292
|
+
function _unsupported_iterable_to_array$4(o, minLen) {
|
|
18293
18293
|
if (!o) return;
|
|
18294
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
18294
|
+
if (typeof o === "string") return _array_like_to_array$4(o, minLen);
|
|
18295
18295
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
18296
18296
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
18297
18297
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
18298
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
18298
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$4(o, minLen);
|
|
18299
18299
|
}
|
|
18300
18300
|
/**
|
|
18301
18301
|
* TypedServiceRegistry implementation.
|
|
@@ -18346,7 +18346,7 @@ function _unsupported_iterable_to_array$3(o, minLen) {
|
|
|
18346
18346
|
var instance = new TypedServiceRegistryInstance();
|
|
18347
18347
|
forEachKeyValue(config.services, {
|
|
18348
18348
|
forEach: function forEach(param) {
|
|
18349
|
-
var _param = _sliced_to_array$
|
|
18349
|
+
var _param = _sliced_to_array$3(param, 2), key = _param[0], service = _param[1];
|
|
18350
18350
|
instance.registerServiceForType(key, service);
|
|
18351
18351
|
}
|
|
18352
18352
|
});
|
|
@@ -18743,6 +18743,120 @@ function _is_native_reflect_construct() {
|
|
|
18743
18743
|
}
|
|
18744
18744
|
();
|
|
18745
18745
|
|
|
18746
|
+
function _array_like_to_array$3(arr, len) {
|
|
18747
|
+
if (len == null || len > arr.length) len = arr.length;
|
|
18748
|
+
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
18749
|
+
return arr2;
|
|
18750
|
+
}
|
|
18751
|
+
function _array_with_holes$2(arr) {
|
|
18752
|
+
if (Array.isArray(arr)) return arr;
|
|
18753
|
+
}
|
|
18754
|
+
function _iterable_to_array_limit$2(arr, i) {
|
|
18755
|
+
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
18756
|
+
if (_i == null) return;
|
|
18757
|
+
var _arr = [];
|
|
18758
|
+
var _n = true;
|
|
18759
|
+
var _d = false;
|
|
18760
|
+
var _s, _e;
|
|
18761
|
+
try {
|
|
18762
|
+
for(_i = _i.call(arr); !(_n = (_s = _i.next()).done); _n = true){
|
|
18763
|
+
_arr.push(_s.value);
|
|
18764
|
+
if (i && _arr.length === i) break;
|
|
18765
|
+
}
|
|
18766
|
+
} catch (err) {
|
|
18767
|
+
_d = true;
|
|
18768
|
+
_e = err;
|
|
18769
|
+
} finally{
|
|
18770
|
+
try {
|
|
18771
|
+
if (!_n && _i["return"] != null) _i["return"]();
|
|
18772
|
+
} finally{
|
|
18773
|
+
if (_d) throw _e;
|
|
18774
|
+
}
|
|
18775
|
+
}
|
|
18776
|
+
return _arr;
|
|
18777
|
+
}
|
|
18778
|
+
function _non_iterable_rest$2() {
|
|
18779
|
+
throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
18780
|
+
}
|
|
18781
|
+
function _sliced_to_array$2(arr, i) {
|
|
18782
|
+
return _array_with_holes$2(arr) || _iterable_to_array_limit$2(arr, i) || _unsupported_iterable_to_array$3(arr, i) || _non_iterable_rest$2();
|
|
18783
|
+
}
|
|
18784
|
+
function _unsupported_iterable_to_array$3(o, minLen) {
|
|
18785
|
+
if (!o) return;
|
|
18786
|
+
if (typeof o === "string") return _array_like_to_array$3(o, minLen);
|
|
18787
|
+
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
18788
|
+
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
18789
|
+
if (n === "Map" || n === "Set") return Array.from(n);
|
|
18790
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$3(o, minLen);
|
|
18791
|
+
}
|
|
18792
|
+
/**
|
|
18793
|
+
* Pure string-case converters that do not pull in the
|
|
18794
|
+
* {@link change-case-all} dependency.
|
|
18795
|
+
*
|
|
18796
|
+
* Use these for the common SCREAMING_SNAKE ↔ camelCase conversions
|
|
18797
|
+
* (constant-name ↔ symbol-name flips) without paying for the full
|
|
18798
|
+
* change-case bundle. For arbitrary case detection / round-tripping
|
|
18799
|
+
* across mixed inputs, prefer the dedicated package.
|
|
18800
|
+
*/ /**
|
|
18801
|
+
* Converts a SCREAMING_SNAKE_CASE string into camelCase.
|
|
18802
|
+
*
|
|
18803
|
+
* Empty segments (e.g. leading underscores in `_USER_ID`) are skipped.
|
|
18804
|
+
*
|
|
18805
|
+
* @param input The SCREAMING_SNAKE_CASE input.
|
|
18806
|
+
* @returns The camelCase form.
|
|
18807
|
+
*/ function screamingSnakeToCamelCase(input) {
|
|
18808
|
+
var parts = input.split('_').filter(function(p) {
|
|
18809
|
+
return p.length > 0;
|
|
18810
|
+
});
|
|
18811
|
+
var result = '';
|
|
18812
|
+
var _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
|
|
18813
|
+
try {
|
|
18814
|
+
for(var _iterator = parts.entries()[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
|
|
18815
|
+
var _step_value = _sliced_to_array$2(_step.value, 2), i = _step_value[0], part_ = _step_value[1];
|
|
18816
|
+
var part = part_.toLowerCase();
|
|
18817
|
+
if (i === 0) {
|
|
18818
|
+
result += part;
|
|
18819
|
+
} else {
|
|
18820
|
+
result += part.charAt(0).toUpperCase() + part.slice(1);
|
|
18821
|
+
}
|
|
18822
|
+
}
|
|
18823
|
+
} catch (err) {
|
|
18824
|
+
_didIteratorError = true;
|
|
18825
|
+
_iteratorError = err;
|
|
18826
|
+
} finally{
|
|
18827
|
+
try {
|
|
18828
|
+
if (!_iteratorNormalCompletion && _iterator.return != null) {
|
|
18829
|
+
_iterator.return();
|
|
18830
|
+
}
|
|
18831
|
+
} finally{
|
|
18832
|
+
if (_didIteratorError) {
|
|
18833
|
+
throw _iteratorError;
|
|
18834
|
+
}
|
|
18835
|
+
}
|
|
18836
|
+
}
|
|
18837
|
+
return result;
|
|
18838
|
+
}
|
|
18839
|
+
/**
|
|
18840
|
+
* Converts a camelCase or PascalCase string into SCREAMING_SNAKE_CASE.
|
|
18841
|
+
*
|
|
18842
|
+
* Each upper-case character (other than the first) is preceded by an
|
|
18843
|
+
* underscore, then the whole result is upper-cased.
|
|
18844
|
+
*
|
|
18845
|
+
* @param input The camelCase / PascalCase input.
|
|
18846
|
+
* @returns The SCREAMING_SNAKE_CASE form.
|
|
18847
|
+
*/ function camelOrPascalToScreamingSnake(input) {
|
|
18848
|
+
var out = '';
|
|
18849
|
+
for(var i = 0; i < input.length; i += 1){
|
|
18850
|
+
var ch = input.charAt(i);
|
|
18851
|
+
var isUpper = ch >= 'A' && ch <= 'Z';
|
|
18852
|
+
if (isUpper && i > 0) {
|
|
18853
|
+
out += '_';
|
|
18854
|
+
}
|
|
18855
|
+
out += ch.toUpperCase();
|
|
18856
|
+
}
|
|
18857
|
+
return out;
|
|
18858
|
+
}
|
|
18859
|
+
|
|
18746
18860
|
function _array_like_to_array$2(arr, len) {
|
|
18747
18861
|
if (len == null || len > arr.length) len = arr.length;
|
|
18748
18862
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
@@ -19076,6 +19190,55 @@ function mimeTypeForFileExtension(extension) {
|
|
|
19076
19190
|
cleanString: cleanString
|
|
19077
19191
|
};
|
|
19078
19192
|
}
|
|
19193
|
+
/**
|
|
19194
|
+
* Removes the given suffix from the input string when present, or
|
|
19195
|
+
* returns `undefined` when the input does not end with the suffix.
|
|
19196
|
+
*
|
|
19197
|
+
* Use this when callers want to detect whether the suffix was present
|
|
19198
|
+
* (vs. {@link removeFirstMatchingSuffix}, which silently passes the
|
|
19199
|
+
* input through).
|
|
19200
|
+
*
|
|
19201
|
+
* @param input The string to trim.
|
|
19202
|
+
* @param suffix The suffix to remove.
|
|
19203
|
+
* @returns The input without the suffix, or `undefined` when the input
|
|
19204
|
+
* does not end with the suffix.
|
|
19205
|
+
*/ function removeSuffix(input, suffix) {
|
|
19206
|
+
if (!input.endsWith(suffix)) return undefined;
|
|
19207
|
+
return input.slice(0, -suffix.length);
|
|
19208
|
+
}
|
|
19209
|
+
/**
|
|
19210
|
+
* Removes the first matching suffix from the input string. Returns the
|
|
19211
|
+
* input unchanged when none of the suffixes match.
|
|
19212
|
+
*
|
|
19213
|
+
* @param input The string to trim.
|
|
19214
|
+
* @param suffixes The suffixes to try in order.
|
|
19215
|
+
* @returns The input with the first matching suffix removed, or the
|
|
19216
|
+
* input unchanged when no suffix matches.
|
|
19217
|
+
*/ function removeFirstMatchingSuffix(input, suffixes) {
|
|
19218
|
+
var _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
|
|
19219
|
+
try {
|
|
19220
|
+
for(var _iterator = suffixes[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
|
|
19221
|
+
var suffix = _step.value;
|
|
19222
|
+
if (input.endsWith(suffix)) {
|
|
19223
|
+
return input.slice(0, -suffix.length);
|
|
19224
|
+
}
|
|
19225
|
+
}
|
|
19226
|
+
} catch (err) {
|
|
19227
|
+
_didIteratorError = true;
|
|
19228
|
+
_iteratorError = err;
|
|
19229
|
+
} finally{
|
|
19230
|
+
try {
|
|
19231
|
+
if (!_iteratorNormalCompletion && _iterator.return != null) {
|
|
19232
|
+
_iterator.return();
|
|
19233
|
+
}
|
|
19234
|
+
} finally{
|
|
19235
|
+
if (_didIteratorError) {
|
|
19236
|
+
throw _iteratorError;
|
|
19237
|
+
}
|
|
19238
|
+
}
|
|
19239
|
+
}
|
|
19240
|
+
return input;
|
|
19241
|
+
}
|
|
19079
19242
|
/**
|
|
19080
19243
|
* A pre-configured instance that can be used to add/remove dash prefixes from a string.
|
|
19081
19244
|
*/ var DASH_CHARACTER_PREFIX_INSTANCE = characterPrefixSuffixInstance({
|
|
@@ -20851,6 +21014,7 @@ exports.bufferHasValidPdfMarkings = bufferHasValidPdfMarkings;
|
|
|
20851
21014
|
exports.build = build;
|
|
20852
21015
|
exports.cachedGetter = cachedGetter;
|
|
20853
21016
|
exports.calculateExpirationDate = calculateExpirationDate;
|
|
21017
|
+
exports.camelOrPascalToScreamingSnake = camelOrPascalToScreamingSnake;
|
|
20854
21018
|
exports.capLatValue = capLatValue;
|
|
20855
21019
|
exports.capitalizeFirstLetter = capitalizeFirstLetter;
|
|
20856
21020
|
exports.caseInsensitiveFilterByIndexOfDecisionFactory = caseInsensitiveFilterByIndexOfDecisionFactory;
|
|
@@ -21406,6 +21570,7 @@ exports.removeByKeyFromBooleanKeyArray = removeByKeyFromBooleanKeyArray;
|
|
|
21406
21570
|
exports.removeCharactersAfterFirstCharacterOccurence = removeCharactersAfterFirstCharacterOccurence;
|
|
21407
21571
|
exports.removeCharactersAfterFirstCharacterOccurenceFunction = removeCharactersAfterFirstCharacterOccurenceFunction;
|
|
21408
21572
|
exports.removeExtensionFromPhoneNumber = removeExtensionFromPhoneNumber;
|
|
21573
|
+
exports.removeFirstMatchingSuffix = removeFirstMatchingSuffix;
|
|
21409
21574
|
exports.removeFromBooleanKeyArray = removeFromBooleanKeyArray;
|
|
21410
21575
|
exports.removeFromSet = removeFromSet;
|
|
21411
21576
|
exports.removeFromSetCopy = removeFromSetCopy;
|
|
@@ -21413,6 +21578,7 @@ exports.removeHttpFromUrl = removeHttpFromUrl;
|
|
|
21413
21578
|
exports.removeModelsWithKey = removeModelsWithKey;
|
|
21414
21579
|
exports.removeModelsWithSameKey = removeModelsWithSameKey;
|
|
21415
21580
|
exports.removeModifiers = removeModifiers;
|
|
21581
|
+
exports.removeSuffix = removeSuffix;
|
|
21416
21582
|
exports.removeTrailingFileTypeSeparators = removeTrailingFileTypeSeparators;
|
|
21417
21583
|
exports.removeTrailingSlashes = removeTrailingSlashes;
|
|
21418
21584
|
exports.removeValuesAtIndexesFromArrayCopy = removeValuesAtIndexesFromArrayCopy;
|
|
@@ -21443,6 +21609,7 @@ exports.runNamedAsyncTasksFunction = runNamedAsyncTasksFunction;
|
|
|
21443
21609
|
exports.safeCompareEquality = safeCompareEquality;
|
|
21444
21610
|
exports.safeEqualityComparatorFunction = safeEqualityComparatorFunction;
|
|
21445
21611
|
exports.safeFindBestIndexMatch = safeFindBestIndexMatch;
|
|
21612
|
+
exports.screamingSnakeToCamelCase = screamingSnakeToCamelCase;
|
|
21446
21613
|
exports.searchStringFilterFunction = searchStringFilterFunction;
|
|
21447
21614
|
exports.secondsToMinutesAndSeconds = secondsToMinutesAndSeconds;
|
|
21448
21615
|
exports.selectiveFieldEncryptor = selectiveFieldEncryptor;
|