@dereekb/util 13.9.0 → 13.10.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/fetch/index.cjs.js +5 -3
- package/fetch/index.esm.js +5 -3
- package/fetch/package.json +3 -3
- package/index.cjs.js +682 -384
- package/index.esm.js +676 -384
- package/package.json +5 -5
- 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/function/function.d.ts +1 -1
- 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/object/object.filter.pojo.d.ts +10 -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 +13 -1
- 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 +35 -1
- 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/index.cjs.js +1 -0
- package/test/index.esm.js +1 -0
- package/test/package.json +3 -3
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
|
/**
|
|
@@ -462,7 +462,7 @@ function _unsupported_iterable_to_array$z(o, minLen) {
|
|
|
462
462
|
* @param input - single value or array to retrieve from
|
|
463
463
|
* @returns the last element of the array, or the input value itself
|
|
464
464
|
*/ function lastValue(input) {
|
|
465
|
-
return Array.isArray(input) ? input
|
|
465
|
+
return Array.isArray(input) ? input.at(-1) : input;
|
|
466
466
|
}
|
|
467
467
|
/**
|
|
468
468
|
* Returns a tuple with the first and last value of the input.
|
|
@@ -497,9 +497,7 @@ function _unsupported_iterable_to_array$z(o, minLen) {
|
|
|
497
497
|
for(var _len = arguments.length, arrays = new Array(_len), _key = 0; _key < _len; _key++){
|
|
498
498
|
arrays[_key] = arguments[_key];
|
|
499
499
|
}
|
|
500
|
-
return flattenArray(arrays.filter(
|
|
501
|
-
return Boolean(x);
|
|
502
|
-
}));
|
|
500
|
+
return flattenArray(arrays.filter(Boolean));
|
|
503
501
|
}
|
|
504
502
|
/**
|
|
505
503
|
* Flattens a two-dimensional array into a single-dimensional array. Any null/undefined entries in the outer dimension are filtered out.
|
|
@@ -507,9 +505,7 @@ function _unsupported_iterable_to_array$z(o, minLen) {
|
|
|
507
505
|
* @param array - two-dimensional array to flatten, may contain nullish entries
|
|
508
506
|
* @returns a single-dimensional array with all elements from the non-nullish inner arrays
|
|
509
507
|
*/ function flattenArray(array) {
|
|
510
|
-
var filteredValues = array.filter(
|
|
511
|
-
return Boolean(x);
|
|
512
|
-
});
|
|
508
|
+
var filteredValues = array.filter(Boolean);
|
|
513
509
|
return filteredValues.flat();
|
|
514
510
|
}
|
|
515
511
|
/**
|
|
@@ -528,7 +524,7 @@ function _unsupported_iterable_to_array$z(o, minLen) {
|
|
|
528
524
|
* @param input - array to copy, or nullish
|
|
529
525
|
* @returns a new array with the same elements, or an empty array if input is nullish
|
|
530
526
|
*/ function copyArray(input) {
|
|
531
|
-
return input
|
|
527
|
+
return input == null ? [] : _to_consumable_array$m(input);
|
|
532
528
|
}
|
|
533
529
|
/**
|
|
534
530
|
* Pushes the same element onto the target array a specified number of times.
|
|
@@ -764,13 +760,13 @@ function _unsupported_iterable_to_array$z(o, minLen) {
|
|
|
764
760
|
return readKeysSetFunction(readKey)(values);
|
|
765
761
|
}
|
|
766
762
|
|
|
767
|
-
function _array_like_to_array$
|
|
763
|
+
function _array_like_to_array$z(arr, len) {
|
|
768
764
|
if (len == null || len > arr.length) len = arr.length;
|
|
769
765
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
770
766
|
return arr2;
|
|
771
767
|
}
|
|
772
768
|
function _array_without_holes$l(arr) {
|
|
773
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
769
|
+
if (Array.isArray(arr)) return _array_like_to_array$z(arr);
|
|
774
770
|
}
|
|
775
771
|
function _iterable_to_array$l(iter) {
|
|
776
772
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
@@ -779,15 +775,15 @@ function _non_iterable_spread$l() {
|
|
|
779
775
|
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
776
|
}
|
|
781
777
|
function _to_consumable_array$l(arr) {
|
|
782
|
-
return _array_without_holes$l(arr) || _iterable_to_array$l(arr) || _unsupported_iterable_to_array$
|
|
778
|
+
return _array_without_holes$l(arr) || _iterable_to_array$l(arr) || _unsupported_iterable_to_array$z(arr) || _non_iterable_spread$l();
|
|
783
779
|
}
|
|
784
|
-
function _unsupported_iterable_to_array$
|
|
780
|
+
function _unsupported_iterable_to_array$z(o, minLen) {
|
|
785
781
|
if (!o) return;
|
|
786
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
782
|
+
if (typeof o === "string") return _array_like_to_array$z(o, minLen);
|
|
787
783
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
788
784
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
789
785
|
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$
|
|
786
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$z(o, minLen);
|
|
791
787
|
}
|
|
792
788
|
/**
|
|
793
789
|
* Converts an {@link IterableOrValue} into a Set. Strings are treated as single values rather than character iterables.
|
|
@@ -1282,13 +1278,13 @@ function _unsupported_iterable_to_array$y(o, minLen) {
|
|
|
1282
1278
|
return a && b ? a.size === b.size && setContainsAllValues(a, b, true) : a == b;
|
|
1283
1279
|
}
|
|
1284
1280
|
|
|
1285
|
-
function _array_like_to_array$
|
|
1281
|
+
function _array_like_to_array$y(arr, len) {
|
|
1286
1282
|
if (len == null || len > arr.length) len = arr.length;
|
|
1287
1283
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
1288
1284
|
return arr2;
|
|
1289
1285
|
}
|
|
1290
1286
|
function _array_without_holes$k(arr) {
|
|
1291
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
1287
|
+
if (Array.isArray(arr)) return _array_like_to_array$y(arr);
|
|
1292
1288
|
}
|
|
1293
1289
|
function _iterable_to_array$k(iter) {
|
|
1294
1290
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
@@ -1297,15 +1293,15 @@ function _non_iterable_spread$k() {
|
|
|
1297
1293
|
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
1294
|
}
|
|
1299
1295
|
function _to_consumable_array$k(arr) {
|
|
1300
|
-
return _array_without_holes$k(arr) || _iterable_to_array$k(arr) || _unsupported_iterable_to_array$
|
|
1296
|
+
return _array_without_holes$k(arr) || _iterable_to_array$k(arr) || _unsupported_iterable_to_array$y(arr) || _non_iterable_spread$k();
|
|
1301
1297
|
}
|
|
1302
|
-
function _unsupported_iterable_to_array$
|
|
1298
|
+
function _unsupported_iterable_to_array$y(o, minLen) {
|
|
1303
1299
|
if (!o) return;
|
|
1304
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
1300
|
+
if (typeof o === "string") return _array_like_to_array$y(o, minLen);
|
|
1305
1301
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
1306
1302
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
1307
1303
|
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$
|
|
1304
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$y(o, minLen);
|
|
1309
1305
|
}
|
|
1310
1306
|
/**
|
|
1311
1307
|
* Inverts the output of an arbitrary boolean-returning function.
|
|
@@ -1339,7 +1335,9 @@ function _unsupported_iterable_to_array$x(o, minLen) {
|
|
|
1339
1335
|
*/ function arrayDecisionFunction(decision, mode) {
|
|
1340
1336
|
var findFn = mode === 'all' ? invertBooleanReturnFunction(decision) : decision;
|
|
1341
1337
|
return invertBooleanReturnFunction(function(values) {
|
|
1342
|
-
return values.some(
|
|
1338
|
+
return values.some(function(v, i, arr) {
|
|
1339
|
+
return findFn(v, i, arr);
|
|
1340
|
+
});
|
|
1343
1341
|
}, mode === 'all');
|
|
1344
1342
|
}
|
|
1345
1343
|
/**
|
|
@@ -1583,7 +1581,9 @@ function _type_of$l(obj) {
|
|
|
1583
1581
|
return function(values) {
|
|
1584
1582
|
var result;
|
|
1585
1583
|
if (values != null) {
|
|
1586
|
-
result = values.filter(
|
|
1584
|
+
result = values.filter(function(v, i, arr) {
|
|
1585
|
+
return filterFn(v, i, arr);
|
|
1586
|
+
});
|
|
1587
1587
|
} else {
|
|
1588
1588
|
result = [];
|
|
1589
1589
|
}
|
|
@@ -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.
|
|
@@ -2356,16 +2356,16 @@ function _unsupported_iterable_to_array$v(o, minLen) {
|
|
|
2356
2356
|
/**
|
|
2357
2357
|
* Utility for working with boolean string key arrays.
|
|
2358
2358
|
*/ var BooleanStringKeyArrayUtility = booleanKeyArrayUtility(function(x) {
|
|
2359
|
-
return x
|
|
2359
|
+
return 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,
|
|
@@ -3950,7 +3950,7 @@ function _type_of$h(obj) {
|
|
|
3950
3950
|
return fn;
|
|
3951
3951
|
}
|
|
3952
3952
|
|
|
3953
|
-
var DOLLAR_AMOUNT_STRING_REGEX = /^\$?(
|
|
3953
|
+
var DOLLAR_AMOUNT_STRING_REGEX = /^\$?(\d+)\.?(\d\d)$/;
|
|
3954
3954
|
/**
|
|
3955
3955
|
* Dollar amounts are to two decimal places.
|
|
3956
3956
|
*/ var DOLLAR_AMOUNT_PRECISION = 2;
|
|
@@ -4118,7 +4118,7 @@ var DOLLAR_AMOUNT_STRING_REGEX = /^\$?([0-9]+)\.?([0-9][0-9])$/;
|
|
|
4118
4118
|
* decodeRadix36Number('2s'); // 100
|
|
4119
4119
|
* ```
|
|
4120
4120
|
*/ function decodeRadix36Number(encoded) {
|
|
4121
|
-
return parseInt(encoded, 36);
|
|
4121
|
+
return Number.parseInt(encoded, 36);
|
|
4122
4122
|
}
|
|
4123
4123
|
/**
|
|
4124
4124
|
* Pattern that matches strings containing only hexadecimal characters (0-9, a-f, A-F).
|
|
@@ -4231,7 +4231,9 @@ var DOLLAR_AMOUNT_STRING_REGEX = /^\$?([0-9]+)\.?([0-9][0-9])$/;
|
|
|
4231
4231
|
}
|
|
4232
4232
|
function reduceNumbersFn(reduceFn, emptyArrayValue) {
|
|
4233
4233
|
var rFn = function rFn(array) {
|
|
4234
|
-
return array.reduce(
|
|
4234
|
+
return array.reduce(function(a, b) {
|
|
4235
|
+
return reduceFn(a, b);
|
|
4236
|
+
});
|
|
4235
4237
|
};
|
|
4236
4238
|
return function(array) {
|
|
4237
4239
|
return array.length ? rFn(array) : emptyArrayValue;
|
|
@@ -5093,7 +5095,9 @@ function findNext(array, find) {
|
|
|
5093
5095
|
var wrapAround = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : false, steps = arguments.length > 3 ? arguments[3] : void 0;
|
|
5094
5096
|
var result;
|
|
5095
5097
|
if (array) {
|
|
5096
|
-
var index = array.findIndex(
|
|
5098
|
+
var index = array.findIndex(function(v, i, arr) {
|
|
5099
|
+
return find(v, i, arr);
|
|
5100
|
+
});
|
|
5097
5101
|
var nextIndex = getArrayNextIndex(array, index, wrapAround, steps);
|
|
5098
5102
|
if (nextIndex != null) {
|
|
5099
5103
|
result = array[nextIndex];
|
|
@@ -5472,7 +5476,7 @@ function joinStrings(input) {
|
|
|
5472
5476
|
joinStrings: joinStrings,
|
|
5473
5477
|
splitStrings: splitStrings,
|
|
5474
5478
|
splitStringsToSet: function splitStringsToSet(input) {
|
|
5475
|
-
return new Set(input
|
|
5479
|
+
return new Set(input == null ? [] : splitStrings(input));
|
|
5476
5480
|
},
|
|
5477
5481
|
splitJoinRemainder: function splitJoinRemainder1(input, limit) {
|
|
5478
5482
|
return splitJoinRemainder(input, joiner, limit);
|
|
@@ -5503,7 +5507,10 @@ function caseInsensitiveString(input) {
|
|
|
5503
5507
|
* @returns the prefixed string, or undefined if the input is null/undefined
|
|
5504
5508
|
*/ function addPlusPrefixToNumber(value) {
|
|
5505
5509
|
var prefix = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : '+';
|
|
5506
|
-
|
|
5510
|
+
if (value == null) {
|
|
5511
|
+
return undefined;
|
|
5512
|
+
}
|
|
5513
|
+
return value > 0 ? "".concat(prefix).concat(value) : "".concat(value);
|
|
5507
5514
|
}
|
|
5508
5515
|
/**
|
|
5509
5516
|
* Capitalizes the first letter of the input string.
|
|
@@ -5589,7 +5596,7 @@ function caseInsensitiveString(input) {
|
|
|
5589
5596
|
* @param input - string to flatten
|
|
5590
5597
|
* @returns the string with collapsed whitespace
|
|
5591
5598
|
*/ function flattenWhitespace(input) {
|
|
5592
|
-
return input.
|
|
5599
|
+
return input.replaceAll(/[^\S\r\n]+/g, ' ').trim();
|
|
5593
5600
|
}
|
|
5594
5601
|
/**
|
|
5595
5602
|
* Reduces multiple consecutive newlines to a single newline and collapses multiple whitespace characters to a single space.
|
|
@@ -5710,13 +5717,13 @@ function caseInsensitiveString(input) {
|
|
|
5710
5717
|
}
|
|
5711
5718
|
if (config.slice) {
|
|
5712
5719
|
var sliceTransform = sliceStringFunction(config.slice);
|
|
5713
|
-
if (baseTransform
|
|
5720
|
+
if (baseTransform == null) {
|
|
5721
|
+
baseTransform = sliceTransform;
|
|
5722
|
+
} else {
|
|
5714
5723
|
var initialBaseTransform = baseTransform;
|
|
5715
5724
|
baseTransform = function baseTransform(x) {
|
|
5716
5725
|
return initialBaseTransform(sliceTransform(x));
|
|
5717
5726
|
};
|
|
5718
|
-
} else {
|
|
5719
|
-
baseTransform = sliceTransform;
|
|
5720
5727
|
}
|
|
5721
5728
|
}
|
|
5722
5729
|
var transform = baseTransform;
|
|
@@ -6004,7 +6011,7 @@ function _get_prototype_of$4(o) {
|
|
|
6004
6011
|
};
|
|
6005
6012
|
return _get_prototype_of$4(o);
|
|
6006
6013
|
}
|
|
6007
|
-
function _inherits$
|
|
6014
|
+
function _inherits$5(subClass, superClass) {
|
|
6008
6015
|
if (typeof superClass !== "function" && superClass !== null) {
|
|
6009
6016
|
throw new TypeError("Super expression must either be null or a function");
|
|
6010
6017
|
}
|
|
@@ -6015,7 +6022,7 @@ function _inherits$4(subClass, superClass) {
|
|
|
6015
6022
|
configurable: true
|
|
6016
6023
|
}
|
|
6017
6024
|
});
|
|
6018
|
-
if (superClass) _set_prototype_of$
|
|
6025
|
+
if (superClass) _set_prototype_of$5(subClass, superClass);
|
|
6019
6026
|
}
|
|
6020
6027
|
function _possible_constructor_return$4(self, call) {
|
|
6021
6028
|
if (call && (_type_of$g(call) === "object" || typeof call === "function")) {
|
|
@@ -6023,12 +6030,12 @@ function _possible_constructor_return$4(self, call) {
|
|
|
6023
6030
|
}
|
|
6024
6031
|
return _assert_this_initialized$4(self);
|
|
6025
6032
|
}
|
|
6026
|
-
function _set_prototype_of$
|
|
6027
|
-
_set_prototype_of$
|
|
6033
|
+
function _set_prototype_of$5(o, p) {
|
|
6034
|
+
_set_prototype_of$5 = Object.setPrototypeOf || function setPrototypeOf(o, p) {
|
|
6028
6035
|
o.__proto__ = p;
|
|
6029
6036
|
return o;
|
|
6030
6037
|
};
|
|
6031
|
-
return _set_prototype_of$
|
|
6038
|
+
return _set_prototype_of$5(o, p);
|
|
6032
6039
|
}
|
|
6033
6040
|
function _type_of$g(obj) {
|
|
6034
6041
|
"@swc/helpers - typeof";
|
|
@@ -6049,7 +6056,7 @@ function _is_native_reflect_construct$4() {
|
|
|
6049
6056
|
* Error thrown when an assertion fails.
|
|
6050
6057
|
* Extends BaseError and implements ReadableError interface.
|
|
6051
6058
|
*/ var AssertionError = /*#__PURE__*/ function(BaseError) {
|
|
6052
|
-
_inherits$
|
|
6059
|
+
_inherits$5(AssertionError, BaseError);
|
|
6053
6060
|
function AssertionError(error, message) {
|
|
6054
6061
|
_class_call_check$9(this, AssertionError);
|
|
6055
6062
|
var _this;
|
|
@@ -6368,15 +6375,15 @@ function _object_spread$e(target) {
|
|
|
6368
6375
|
* @returns The inverted filter function, or the original if invert is false
|
|
6369
6376
|
*/ var invertFilter = invertBooleanReturnFunction;
|
|
6370
6377
|
|
|
6371
|
-
function _array_like_to_array$
|
|
6378
|
+
function _array_like_to_array$r(arr, len) {
|
|
6372
6379
|
if (len == null || len > arr.length) len = arr.length;
|
|
6373
6380
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
6374
6381
|
return arr2;
|
|
6375
6382
|
}
|
|
6376
|
-
function _array_with_holes$
|
|
6383
|
+
function _array_with_holes$j(arr) {
|
|
6377
6384
|
if (Array.isArray(arr)) return arr;
|
|
6378
6385
|
}
|
|
6379
|
-
function _iterable_to_array_limit$
|
|
6386
|
+
function _iterable_to_array_limit$j(arr, i) {
|
|
6380
6387
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
6381
6388
|
if (_i == null) return;
|
|
6382
6389
|
var _arr = [];
|
|
@@ -6400,23 +6407,23 @@ function _iterable_to_array_limit$i(arr, i) {
|
|
|
6400
6407
|
}
|
|
6401
6408
|
return _arr;
|
|
6402
6409
|
}
|
|
6403
|
-
function _non_iterable_rest$
|
|
6410
|
+
function _non_iterable_rest$j() {
|
|
6404
6411
|
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
6412
|
}
|
|
6406
|
-
function _sliced_to_array$
|
|
6407
|
-
return _array_with_holes$
|
|
6413
|
+
function _sliced_to_array$j(arr, i) {
|
|
6414
|
+
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
6415
|
}
|
|
6409
6416
|
function _type_of$f(obj) {
|
|
6410
6417
|
"@swc/helpers - typeof";
|
|
6411
6418
|
return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
|
|
6412
6419
|
}
|
|
6413
|
-
function _unsupported_iterable_to_array$
|
|
6420
|
+
function _unsupported_iterable_to_array$r(o, minLen) {
|
|
6414
6421
|
if (!o) return;
|
|
6415
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
6422
|
+
if (typeof o === "string") return _array_like_to_array$r(o, minLen);
|
|
6416
6423
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
6417
6424
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
6418
6425
|
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$
|
|
6426
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$r(o, minLen);
|
|
6420
6427
|
}
|
|
6421
6428
|
/**
|
|
6422
6429
|
* Iterates over filtered key/value tuples of an object and invokes a callback for each.
|
|
@@ -6438,7 +6445,9 @@ function _unsupported_iterable_to_array$q(o, minLen) {
|
|
|
6438
6445
|
*/ function forEachKeyValue(obj, param) {
|
|
6439
6446
|
var forEach = param.forEach, filter = param.filter;
|
|
6440
6447
|
var keyValues = filterKeyValueTuples(obj, filter);
|
|
6441
|
-
keyValues.forEach(
|
|
6448
|
+
keyValues.forEach(function(kv, i) {
|
|
6449
|
+
return forEach(kv, i);
|
|
6450
|
+
});
|
|
6442
6451
|
}
|
|
6443
6452
|
/**
|
|
6444
6453
|
* Extracts key/value tuples from an object, optionally filtering them.
|
|
@@ -6474,7 +6483,9 @@ function _unsupported_iterable_to_array$q(o, minLen) {
|
|
|
6474
6483
|
if (filter != null) {
|
|
6475
6484
|
var filterFn = filterKeyValueTupleFunction(filter);
|
|
6476
6485
|
result = function result(obj) {
|
|
6477
|
-
return allKeyValueTuples(obj).filter(
|
|
6486
|
+
return allKeyValueTuples(obj).filter(function(kv, i) {
|
|
6487
|
+
return filterFn(kv, i);
|
|
6488
|
+
});
|
|
6478
6489
|
};
|
|
6479
6490
|
} else {
|
|
6480
6491
|
result = allKeyValueTuples;
|
|
@@ -6558,43 +6569,43 @@ function _unsupported_iterable_to_array$q(o, minLen) {
|
|
|
6558
6569
|
switch(type){
|
|
6559
6570
|
case exports.KeyValueTypleValueFilter.UNDEFINED:
|
|
6560
6571
|
filterFn = function filterFn(param) {
|
|
6561
|
-
var _param = _sliced_to_array$
|
|
6572
|
+
var _param = _sliced_to_array$j(param, 2), x = _param[1];
|
|
6562
6573
|
return x !== undefined;
|
|
6563
6574
|
};
|
|
6564
6575
|
break;
|
|
6565
6576
|
case exports.KeyValueTypleValueFilter.NULL:
|
|
6566
6577
|
filterFn = function filterFn(param) {
|
|
6567
|
-
var _param = _sliced_to_array$
|
|
6578
|
+
var _param = _sliced_to_array$j(param, 2), x = _param[1];
|
|
6568
6579
|
return x != null;
|
|
6569
6580
|
};
|
|
6570
6581
|
break;
|
|
6571
6582
|
case exports.KeyValueTypleValueFilter.FALSY:
|
|
6572
6583
|
filterFn = function filterFn(param) {
|
|
6573
|
-
var _param = _sliced_to_array$
|
|
6584
|
+
var _param = _sliced_to_array$j(param, 2), x = _param[1];
|
|
6574
6585
|
return Boolean(x);
|
|
6575
6586
|
};
|
|
6576
6587
|
break;
|
|
6577
6588
|
case exports.KeyValueTypleValueFilter.EMPTY:
|
|
6578
6589
|
filterFn = function filterFn(param) {
|
|
6579
|
-
var _param = _sliced_to_array$
|
|
6590
|
+
var _param = _sliced_to_array$j(param, 2), x = _param[1];
|
|
6580
6591
|
return hasValueOrNotEmpty(x);
|
|
6581
6592
|
};
|
|
6582
6593
|
break;
|
|
6583
6594
|
case exports.KeyValueTypleValueFilter.EMPTY_STRICT:
|
|
6584
6595
|
filterFn = function filterFn(param) {
|
|
6585
|
-
var _param = _sliced_to_array$
|
|
6596
|
+
var _param = _sliced_to_array$j(param, 2), x = _param[1];
|
|
6586
6597
|
return hasValueOrNotEmptyObject(x);
|
|
6587
6598
|
};
|
|
6588
6599
|
break;
|
|
6589
6600
|
case exports.KeyValueTypleValueFilter.FALSY_AND_EMPTY:
|
|
6590
6601
|
filterFn = function filterFn(param) {
|
|
6591
|
-
var _param = _sliced_to_array$
|
|
6602
|
+
var _param = _sliced_to_array$j(param, 2), x = _param[1];
|
|
6592
6603
|
return Boolean(x) && hasValueOrNotEmpty(x);
|
|
6593
6604
|
};
|
|
6594
6605
|
break;
|
|
6595
6606
|
case exports.KeyValueTypleValueFilter.FALSY_AND_EMPTY_STRICT:
|
|
6596
6607
|
filterFn = function filterFn(param) {
|
|
6597
|
-
var _param = _sliced_to_array$
|
|
6608
|
+
var _param = _sliced_to_array$j(param, 2), x = _param[1];
|
|
6598
6609
|
return Boolean(x) && hasValueOrNotEmptyObject(x);
|
|
6599
6610
|
};
|
|
6600
6611
|
break;
|
|
@@ -6684,12 +6695,12 @@ function cachedGetter(factory) {
|
|
|
6684
6695
|
};
|
|
6685
6696
|
}
|
|
6686
6697
|
|
|
6687
|
-
function _array_like_to_array$
|
|
6698
|
+
function _array_like_to_array$q(arr, len) {
|
|
6688
6699
|
if (len == null || len > arr.length) len = arr.length;
|
|
6689
6700
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
6690
6701
|
return arr2;
|
|
6691
6702
|
}
|
|
6692
|
-
function _array_with_holes$
|
|
6703
|
+
function _array_with_holes$i(arr) {
|
|
6693
6704
|
if (Array.isArray(arr)) return arr;
|
|
6694
6705
|
}
|
|
6695
6706
|
function _define_property$h(obj, key, value) {
|
|
@@ -6705,7 +6716,7 @@ function _define_property$h(obj, key, value) {
|
|
|
6705
6716
|
}
|
|
6706
6717
|
return obj;
|
|
6707
6718
|
}
|
|
6708
|
-
function _iterable_to_array_limit$
|
|
6719
|
+
function _iterable_to_array_limit$i(arr, i) {
|
|
6709
6720
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
6710
6721
|
if (_i == null) return;
|
|
6711
6722
|
var _arr = [];
|
|
@@ -6729,7 +6740,7 @@ function _iterable_to_array_limit$h(arr, i) {
|
|
|
6729
6740
|
}
|
|
6730
6741
|
return _arr;
|
|
6731
6742
|
}
|
|
6732
|
-
function _non_iterable_rest$
|
|
6743
|
+
function _non_iterable_rest$i() {
|
|
6733
6744
|
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
6745
|
}
|
|
6735
6746
|
function _object_spread$d(target) {
|
|
@@ -6747,20 +6758,41 @@ function _object_spread$d(target) {
|
|
|
6747
6758
|
}
|
|
6748
6759
|
return target;
|
|
6749
6760
|
}
|
|
6750
|
-
function _sliced_to_array$
|
|
6751
|
-
return _array_with_holes$
|
|
6761
|
+
function _sliced_to_array$i(arr, i) {
|
|
6762
|
+
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
6763
|
}
|
|
6753
6764
|
function _type_of$e(obj) {
|
|
6754
6765
|
"@swc/helpers - typeof";
|
|
6755
6766
|
return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
|
|
6756
6767
|
}
|
|
6757
|
-
function _unsupported_iterable_to_array$
|
|
6768
|
+
function _unsupported_iterable_to_array$q(o, minLen) {
|
|
6758
6769
|
if (!o) return;
|
|
6759
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
6770
|
+
if (typeof o === "string") return _array_like_to_array$q(o, minLen);
|
|
6760
6771
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
6761
6772
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
6762
6773
|
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$
|
|
6774
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$q(o, minLen);
|
|
6775
|
+
}
|
|
6776
|
+
/**
|
|
6777
|
+
*
|
|
6778
|
+
* @param input
|
|
6779
|
+
*/ function stripObjectFunction(filter) {
|
|
6780
|
+
var copy = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : true;
|
|
6781
|
+
var filterFn = filterFromPOJOFunction({
|
|
6782
|
+
filter: filter,
|
|
6783
|
+
copy: copy
|
|
6784
|
+
});
|
|
6785
|
+
return function(input, copyOverride) {
|
|
6786
|
+
var result;
|
|
6787
|
+
if (input != null) {
|
|
6788
|
+
var filtered = filterFn(input, copyOverride);
|
|
6789
|
+
result = objectHasNoKeys(filtered) ? undefined : filtered;
|
|
6790
|
+
}
|
|
6791
|
+
return result;
|
|
6792
|
+
};
|
|
6793
|
+
}
|
|
6794
|
+
function stripObject(input, copy) {
|
|
6795
|
+
return stripObjectFunction(exports.KeyValueTypleValueFilter.UNDEFINED, copy)(input);
|
|
6764
6796
|
}
|
|
6765
6797
|
// MARK: Object Merging/Overriding
|
|
6766
6798
|
/**
|
|
@@ -7055,7 +7087,7 @@ function _unsupported_iterable_to_array$p(o, minLen) {
|
|
|
7055
7087
|
filter: filter,
|
|
7056
7088
|
// eslint-disable-next-line @typescript-eslint/max-params
|
|
7057
7089
|
forEach: function forEach(param, i, obj, context) {
|
|
7058
|
-
var _param = _sliced_to_array$
|
|
7090
|
+
var _param = _sliced_to_array$i(param, 1), key = _param[0];
|
|
7059
7091
|
context.keys.push(key);
|
|
7060
7092
|
}
|
|
7061
7093
|
});
|
|
@@ -7178,7 +7210,7 @@ function _unsupported_iterable_to_array$p(o, minLen) {
|
|
|
7178
7210
|
var forEachFn = forEachKeyValueOnPOJOFunction({
|
|
7179
7211
|
filter: filter,
|
|
7180
7212
|
forEach: function forEach(param, i, object) {
|
|
7181
|
-
var _param = _sliced_to_array$
|
|
7213
|
+
var _param = _sliced_to_array$i(param, 1), key = _param[0];
|
|
7182
7214
|
delete object[key];
|
|
7183
7215
|
}
|
|
7184
7216
|
});
|
|
@@ -7255,7 +7287,7 @@ function _unsupported_iterable_to_array$p(o, minLen) {
|
|
|
7255
7287
|
filter: filter,
|
|
7256
7288
|
// eslint-disable-next-line @typescript-eslint/max-params
|
|
7257
7289
|
forEach: function forEach(param, i, object, target) {
|
|
7258
|
-
var _param = _sliced_to_array$
|
|
7290
|
+
var _param = _sliced_to_array$i(param, 2), key = _param[0], value = _param[1];
|
|
7259
7291
|
target[key] = value;
|
|
7260
7292
|
}
|
|
7261
7293
|
});
|
|
@@ -7317,7 +7349,7 @@ function _unsupported_iterable_to_array$p(o, minLen) {
|
|
|
7317
7349
|
filter: filter,
|
|
7318
7350
|
// eslint-disable-next-line @typescript-eslint/max-params
|
|
7319
7351
|
forEach: function forEach(param, i, obj, context) {
|
|
7320
|
-
var _param = _sliced_to_array$
|
|
7352
|
+
var _param = _sliced_to_array$i(param, 2), value = _param[1];
|
|
7321
7353
|
context.values.push(value);
|
|
7322
7354
|
}
|
|
7323
7355
|
});
|
|
@@ -7354,7 +7386,7 @@ function _unsupported_iterable_to_array$p(o, minLen) {
|
|
|
7354
7386
|
var invertFilter = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : false;
|
|
7355
7387
|
var keysSet = new Set(keysToFilter);
|
|
7356
7388
|
var filterFn = invertBooleanReturnFunction(function(param) {
|
|
7357
|
-
var _param = _sliced_to_array$
|
|
7389
|
+
var _param = _sliced_to_array$i(param, 1), key = _param[0];
|
|
7358
7390
|
return keysSet.has(key);
|
|
7359
7391
|
}, invertFilter);
|
|
7360
7392
|
return filterTuplesOnPOJOFunction(filterFn);
|
|
@@ -7377,7 +7409,9 @@ function _unsupported_iterable_to_array$p(o, minLen) {
|
|
|
7377
7409
|
*/ function filterTuplesOnPOJOFunction(filterTupleOnObject) {
|
|
7378
7410
|
return function(input) {
|
|
7379
7411
|
var result = {};
|
|
7380
|
-
Object.entries(input).filter(
|
|
7412
|
+
Object.entries(input).filter(function(tuple, i, arr) {
|
|
7413
|
+
return filterTupleOnObject(tuple, i, arr);
|
|
7414
|
+
}).forEach(function(tuple) {
|
|
7381
7415
|
result[tuple[0]] = tuple[1];
|
|
7382
7416
|
});
|
|
7383
7417
|
return result;
|
|
@@ -7555,15 +7589,15 @@ function isInSetDecisionFunction(set, inputReadValue) {
|
|
|
7555
7589
|
return input != null ? new Set(asArray(input)) : input;
|
|
7556
7590
|
}
|
|
7557
7591
|
|
|
7558
|
-
function _array_like_to_array$
|
|
7592
|
+
function _array_like_to_array$p(arr, len) {
|
|
7559
7593
|
if (len == null || len > arr.length) len = arr.length;
|
|
7560
7594
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
7561
7595
|
return arr2;
|
|
7562
7596
|
}
|
|
7563
|
-
function _array_with_holes$
|
|
7597
|
+
function _array_with_holes$h(arr) {
|
|
7564
7598
|
if (Array.isArray(arr)) return arr;
|
|
7565
7599
|
}
|
|
7566
|
-
function _iterable_to_array_limit$
|
|
7600
|
+
function _iterable_to_array_limit$h(arr, i) {
|
|
7567
7601
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
7568
7602
|
if (_i == null) return;
|
|
7569
7603
|
var _arr = [];
|
|
@@ -7587,23 +7621,23 @@ function _iterable_to_array_limit$g(arr, i) {
|
|
|
7587
7621
|
}
|
|
7588
7622
|
return _arr;
|
|
7589
7623
|
}
|
|
7590
|
-
function _non_iterable_rest$
|
|
7624
|
+
function _non_iterable_rest$h() {
|
|
7591
7625
|
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
7626
|
}
|
|
7593
|
-
function _sliced_to_array$
|
|
7594
|
-
return _array_with_holes$
|
|
7627
|
+
function _sliced_to_array$h(arr, i) {
|
|
7628
|
+
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
7629
|
}
|
|
7596
7630
|
function _type_of$d(obj) {
|
|
7597
7631
|
"@swc/helpers - typeof";
|
|
7598
7632
|
return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
|
|
7599
7633
|
}
|
|
7600
|
-
function _unsupported_iterable_to_array$
|
|
7634
|
+
function _unsupported_iterable_to_array$p(o, minLen) {
|
|
7601
7635
|
if (!o) return;
|
|
7602
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
7636
|
+
if (typeof o === "string") return _array_like_to_array$p(o, minLen);
|
|
7603
7637
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
7604
7638
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
7605
7639
|
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$
|
|
7640
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$p(o, minLen);
|
|
7607
7641
|
}
|
|
7608
7642
|
var AUTH_ROLE_CLAIMS_DEFAULT_CLAIM_VALUE = 1;
|
|
7609
7643
|
var AUTH_ROLE_CLAIMS_DEFAULT_EMPTY_VALUE = null;
|
|
@@ -7694,7 +7728,7 @@ var AUTH_ROLE_CLAIMS_DEFAULT_EMPTY_VALUE = null;
|
|
|
7694
7728
|
var claims = {};
|
|
7695
7729
|
// iterate by each claim value to build the claims.
|
|
7696
7730
|
tuples.forEach(function(param) {
|
|
7697
|
-
var _param = _sliced_to_array$
|
|
7731
|
+
var _param = _sliced_to_array$h(param, 2), claimsKey = _param[0], entry = _param[1];
|
|
7698
7732
|
var _entry_encodeValueFromRoles;
|
|
7699
7733
|
var claimsValue = (_entry_encodeValueFromRoles = entry.encodeValueFromRoles(roles)) !== null && _entry_encodeValueFromRoles !== void 0 ? _entry_encodeValueFromRoles : defaultEmptyValue;
|
|
7700
7734
|
claims[claimsKey] = claimsValue;
|
|
@@ -7704,7 +7738,7 @@ var AUTH_ROLE_CLAIMS_DEFAULT_EMPTY_VALUE = null;
|
|
|
7704
7738
|
var forEachKeyValueAddToSet = forEachKeyValueOnPOJOFunction({
|
|
7705
7739
|
// eslint-disable-next-line @typescript-eslint/max-params
|
|
7706
7740
|
forEach: function forEach(param, i, claims, roles) {
|
|
7707
|
-
var _param = _sliced_to_array$
|
|
7741
|
+
var _param = _sliced_to_array$h(param, 2), claimsKey = _param[0], value = _param[1];
|
|
7708
7742
|
var entry = authRoleMap.get(claimsKey);
|
|
7709
7743
|
if (entry != null) {
|
|
7710
7744
|
var decodedRoles = entry.decodeRolesFromValue(value);
|
|
@@ -7740,21 +7774,21 @@ var AUTH_ROLE_CLAIMS_DEFAULT_EMPTY_VALUE = null;
|
|
|
7740
7774
|
});
|
|
7741
7775
|
}
|
|
7742
7776
|
|
|
7743
|
-
function _array_like_to_array$
|
|
7777
|
+
function _array_like_to_array$o(arr, len) {
|
|
7744
7778
|
if (len == null || len > arr.length) len = arr.length;
|
|
7745
7779
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
7746
7780
|
return arr2;
|
|
7747
7781
|
}
|
|
7748
|
-
function _array_with_holes$
|
|
7782
|
+
function _array_with_holes$g(arr) {
|
|
7749
7783
|
if (Array.isArray(arr)) return arr;
|
|
7750
7784
|
}
|
|
7751
7785
|
function _array_without_holes$e(arr) {
|
|
7752
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
7786
|
+
if (Array.isArray(arr)) return _array_like_to_array$o(arr);
|
|
7753
7787
|
}
|
|
7754
7788
|
function _iterable_to_array$e(iter) {
|
|
7755
7789
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
7756
7790
|
}
|
|
7757
|
-
function _iterable_to_array_limit$
|
|
7791
|
+
function _iterable_to_array_limit$g(arr, i) {
|
|
7758
7792
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
7759
7793
|
if (_i == null) return;
|
|
7760
7794
|
var _arr = [];
|
|
@@ -7778,25 +7812,25 @@ function _iterable_to_array_limit$f(arr, i) {
|
|
|
7778
7812
|
}
|
|
7779
7813
|
return _arr;
|
|
7780
7814
|
}
|
|
7781
|
-
function _non_iterable_rest$
|
|
7815
|
+
function _non_iterable_rest$g() {
|
|
7782
7816
|
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
7817
|
}
|
|
7784
7818
|
function _non_iterable_spread$e() {
|
|
7785
7819
|
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
7820
|
}
|
|
7787
|
-
function _sliced_to_array$
|
|
7788
|
-
return _array_with_holes$
|
|
7821
|
+
function _sliced_to_array$g(arr, i) {
|
|
7822
|
+
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
7823
|
}
|
|
7790
7824
|
function _to_consumable_array$e(arr) {
|
|
7791
|
-
return _array_without_holes$e(arr) || _iterable_to_array$e(arr) || _unsupported_iterable_to_array$
|
|
7825
|
+
return _array_without_holes$e(arr) || _iterable_to_array$e(arr) || _unsupported_iterable_to_array$o(arr) || _non_iterable_spread$e();
|
|
7792
7826
|
}
|
|
7793
|
-
function _unsupported_iterable_to_array$
|
|
7827
|
+
function _unsupported_iterable_to_array$o(o, minLen) {
|
|
7794
7828
|
if (!o) return;
|
|
7795
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
7829
|
+
if (typeof o === "string") return _array_like_to_array$o(o, minLen);
|
|
7796
7830
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
7797
7831
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
7798
7832
|
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$
|
|
7833
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$o(o, minLen);
|
|
7800
7834
|
}
|
|
7801
7835
|
/**
|
|
7802
7836
|
* Finds the first and last occurrence of a single character within the input string.
|
|
@@ -7815,7 +7849,7 @@ function _unsupported_iterable_to_array$n(o, minLen) {
|
|
|
7815
7849
|
var _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
|
|
7816
7850
|
try {
|
|
7817
7851
|
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$
|
|
7852
|
+
var _step_value = _sliced_to_array$g(_step.value, 2), i = _step_value[0], char = _step_value[1];
|
|
7819
7853
|
if (char === find) {
|
|
7820
7854
|
if (first === -1) {
|
|
7821
7855
|
first = i;
|
|
@@ -7902,7 +7936,7 @@ function replaceCharacterAtIndexIf(input, index, replacement, decision) {
|
|
|
7902
7936
|
* @param replacement - string to substitute at the index
|
|
7903
7937
|
* @returns the string with the character at the index replaced
|
|
7904
7938
|
*/ function replaceCharacterAtIndexWith(input, index, replacement) {
|
|
7905
|
-
var _splitStringAtIndex = _sliced_to_array$
|
|
7939
|
+
var _splitStringAtIndex = _sliced_to_array$g(splitStringAtIndex(input, index, false), 2), head = _splitStringAtIndex[0], tail = _splitStringAtIndex[1];
|
|
7906
7940
|
return head + replacement + tail;
|
|
7907
7941
|
}
|
|
7908
7942
|
/**
|
|
@@ -7944,7 +7978,7 @@ function replaceCharacterAtIndexIf(input, index, replacement, decision) {
|
|
|
7944
7978
|
var _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
|
|
7945
7979
|
try {
|
|
7946
7980
|
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$
|
|
7981
|
+
var _step_value = _sliced_to_array$g(_step.value, 2), i = _step_value[0], char = _step_value[1];
|
|
7948
7982
|
record[char] = i;
|
|
7949
7983
|
}
|
|
7950
7984
|
} catch (err) {
|
|
@@ -7964,18 +7998,19 @@ function replaceCharacterAtIndexIf(input, index, replacement, decision) {
|
|
|
7964
7998
|
return record;
|
|
7965
7999
|
}
|
|
7966
8000
|
|
|
7967
|
-
function _array_like_to_array$
|
|
8001
|
+
function _array_like_to_array$n(arr, len) {
|
|
7968
8002
|
if (len == null || len > arr.length) len = arr.length;
|
|
7969
8003
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
7970
8004
|
return arr2;
|
|
7971
8005
|
}
|
|
7972
|
-
function _array_with_holes$
|
|
8006
|
+
function _array_with_holes$f(arr) {
|
|
7973
8007
|
if (Array.isArray(arr)) return arr;
|
|
7974
8008
|
}
|
|
7975
8009
|
function _array_without_holes$d(arr) {
|
|
7976
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
8010
|
+
if (Array.isArray(arr)) return _array_like_to_array$n(arr);
|
|
7977
8011
|
}
|
|
7978
8012
|
function _instanceof$3(left, right) {
|
|
8013
|
+
"@swc/helpers - instanceof";
|
|
7979
8014
|
if (right != null && typeof Symbol !== "undefined" && right[Symbol.hasInstance]) {
|
|
7980
8015
|
return !!right[Symbol.hasInstance](left);
|
|
7981
8016
|
} else {
|
|
@@ -7985,7 +8020,7 @@ function _instanceof$3(left, right) {
|
|
|
7985
8020
|
function _iterable_to_array$d(iter) {
|
|
7986
8021
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
7987
8022
|
}
|
|
7988
|
-
function _iterable_to_array_limit$
|
|
8023
|
+
function _iterable_to_array_limit$f(arr, i) {
|
|
7989
8024
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
7990
8025
|
if (_i == null) return;
|
|
7991
8026
|
var _arr = [];
|
|
@@ -8009,25 +8044,25 @@ function _iterable_to_array_limit$e(arr, i) {
|
|
|
8009
8044
|
}
|
|
8010
8045
|
return _arr;
|
|
8011
8046
|
}
|
|
8012
|
-
function _non_iterable_rest$
|
|
8047
|
+
function _non_iterable_rest$f() {
|
|
8013
8048
|
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
8049
|
}
|
|
8015
8050
|
function _non_iterable_spread$d() {
|
|
8016
8051
|
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
8052
|
}
|
|
8018
|
-
function _sliced_to_array$
|
|
8019
|
-
return _array_with_holes$
|
|
8053
|
+
function _sliced_to_array$f(arr, i) {
|
|
8054
|
+
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
8055
|
}
|
|
8021
8056
|
function _to_consumable_array$d(arr) {
|
|
8022
|
-
return _array_without_holes$d(arr) || _iterable_to_array$d(arr) || _unsupported_iterable_to_array$
|
|
8057
|
+
return _array_without_holes$d(arr) || _iterable_to_array$d(arr) || _unsupported_iterable_to_array$n(arr) || _non_iterable_spread$d();
|
|
8023
8058
|
}
|
|
8024
|
-
function _unsupported_iterable_to_array$
|
|
8059
|
+
function _unsupported_iterable_to_array$n(o, minLen) {
|
|
8025
8060
|
if (!o) return;
|
|
8026
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
8061
|
+
if (typeof o === "string") return _array_like_to_array$n(o, minLen);
|
|
8027
8062
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
8028
8063
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
8029
8064
|
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$
|
|
8065
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$n(o, minLen);
|
|
8031
8066
|
}
|
|
8032
8067
|
/**
|
|
8033
8068
|
* Creates a function that replaces all occurrences of the configured target strings with a replacement value.
|
|
@@ -8145,7 +8180,7 @@ function _unsupported_iterable_to_array$m(o, minLen) {
|
|
|
8145
8180
|
var _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
|
|
8146
8181
|
try {
|
|
8147
8182
|
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$
|
|
8183
|
+
var _step_value = _sliced_to_array$f(_step.value, 2), i = _step_value[0], char = _step_value[1];
|
|
8149
8184
|
if (characterSet.has(char)) {
|
|
8150
8185
|
occurrences.push(i);
|
|
8151
8186
|
// return if at the max number of occurences
|
|
@@ -8374,7 +8409,7 @@ function _unsupported_iterable_to_array$m(o, minLen) {
|
|
|
8374
8409
|
* ```
|
|
8375
8410
|
*/ function tryConvertToE164PhoneNumber(input) {
|
|
8376
8411
|
var defaultCountryCode = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : '1';
|
|
8377
|
-
var stripped = input.
|
|
8412
|
+
var stripped = input.replaceAll(PHONE_NUMBER_FORMATTING_CHARACTERS_REGEX, '');
|
|
8378
8413
|
var result;
|
|
8379
8414
|
if (isE164PhoneNumber(stripped, false)) {
|
|
8380
8415
|
result = stripped;
|
|
@@ -8454,12 +8489,12 @@ function isEqualToValueDecisionFunction(equalityValue) {
|
|
|
8454
8489
|
return equalityValueCheckFunction;
|
|
8455
8490
|
}
|
|
8456
8491
|
|
|
8457
|
-
function _array_like_to_array$
|
|
8492
|
+
function _array_like_to_array$m(arr, len) {
|
|
8458
8493
|
if (len == null || len > arr.length) len = arr.length;
|
|
8459
8494
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
8460
8495
|
return arr2;
|
|
8461
8496
|
}
|
|
8462
|
-
function _array_with_holes$
|
|
8497
|
+
function _array_with_holes$e(arr) {
|
|
8463
8498
|
if (Array.isArray(arr)) return arr;
|
|
8464
8499
|
}
|
|
8465
8500
|
function _define_property$g(obj, key, value) {
|
|
@@ -8475,7 +8510,7 @@ function _define_property$g(obj, key, value) {
|
|
|
8475
8510
|
}
|
|
8476
8511
|
return obj;
|
|
8477
8512
|
}
|
|
8478
|
-
function _iterable_to_array_limit$
|
|
8513
|
+
function _iterable_to_array_limit$e(arr, i) {
|
|
8479
8514
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
8480
8515
|
if (_i == null) return;
|
|
8481
8516
|
var _arr = [];
|
|
@@ -8499,7 +8534,7 @@ function _iterable_to_array_limit$d(arr, i) {
|
|
|
8499
8534
|
}
|
|
8500
8535
|
return _arr;
|
|
8501
8536
|
}
|
|
8502
|
-
function _non_iterable_rest$
|
|
8537
|
+
function _non_iterable_rest$e() {
|
|
8503
8538
|
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
8539
|
}
|
|
8505
8540
|
function _object_spread$c(target) {
|
|
@@ -8517,20 +8552,20 @@ function _object_spread$c(target) {
|
|
|
8517
8552
|
}
|
|
8518
8553
|
return target;
|
|
8519
8554
|
}
|
|
8520
|
-
function _sliced_to_array$
|
|
8521
|
-
return _array_with_holes$
|
|
8555
|
+
function _sliced_to_array$e(arr, i) {
|
|
8556
|
+
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
8557
|
}
|
|
8523
8558
|
function _type_of$c(obj) {
|
|
8524
8559
|
"@swc/helpers - typeof";
|
|
8525
8560
|
return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
|
|
8526
8561
|
}
|
|
8527
|
-
function _unsupported_iterable_to_array$
|
|
8562
|
+
function _unsupported_iterable_to_array$m(o, minLen) {
|
|
8528
8563
|
if (!o) return;
|
|
8529
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
8564
|
+
if (typeof o === "string") return _array_like_to_array$m(o, minLen);
|
|
8530
8565
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
8531
8566
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
8532
8567
|
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$
|
|
8568
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$m(o, minLen);
|
|
8534
8569
|
}
|
|
8535
8570
|
var SLASH_PATH_SEPARATOR = '/';
|
|
8536
8571
|
var SLASH_PATH_FILE_TYPE_SEPARATOR = '.';
|
|
@@ -8557,7 +8592,7 @@ var DEFAULT_SLASH_PATH_ILLEGAL_CHARACTERS = [
|
|
|
8557
8592
|
if (input.length === 0) {
|
|
8558
8593
|
type = 'invalid';
|
|
8559
8594
|
} else {
|
|
8560
|
-
var lastValue = input
|
|
8595
|
+
var lastValue = input.at(-1);
|
|
8561
8596
|
if (lastValue === SLASH_PATH_SEPARATOR) {
|
|
8562
8597
|
type = 'folder';
|
|
8563
8598
|
} else {
|
|
@@ -8623,9 +8658,7 @@ var DEFAULT_SLASH_PATH_ILLEGAL_CHARACTERS = [
|
|
|
8623
8658
|
* @param slashPath - The path to split.
|
|
8624
8659
|
* @returns Array of non-empty path segments.
|
|
8625
8660
|
*/ function slashPathParts(slashPath) {
|
|
8626
|
-
return slashPath.split(SLASH_PATH_SEPARATOR).filter(
|
|
8627
|
-
return Boolean(x);
|
|
8628
|
-
});
|
|
8661
|
+
return slashPath.split(SLASH_PATH_SEPARATOR).filter(Boolean);
|
|
8629
8662
|
}
|
|
8630
8663
|
/**
|
|
8631
8664
|
* Creates a function that enforces the specified start type on a slash path.
|
|
@@ -8703,10 +8736,10 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
|
|
|
8703
8736
|
path = undefined;
|
|
8704
8737
|
break;
|
|
8705
8738
|
}
|
|
8706
|
-
if (path
|
|
8707
|
-
path = startTypeFactory(path);
|
|
8708
|
-
} else {
|
|
8739
|
+
if (path == null) {
|
|
8709
8740
|
path = invalidPathValue;
|
|
8741
|
+
} else {
|
|
8742
|
+
path = startTypeFactory(path);
|
|
8710
8743
|
}
|
|
8711
8744
|
// must end with a slash to be a proper folder, unless it is a relative folder path ("", empty string)
|
|
8712
8745
|
if (path) {
|
|
@@ -8741,7 +8774,7 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
|
|
|
8741
8774
|
* @param input - The slash path to fix.
|
|
8742
8775
|
* @returns The path with double slashes collapsed.
|
|
8743
8776
|
*/ function fixMultiSlashesInSlashPath(input) {
|
|
8744
|
-
return input.
|
|
8777
|
+
return input.replaceAll(ALL_DOUBLE_SLASHES_REGEX, SLASH_PATH_SEPARATOR);
|
|
8745
8778
|
}
|
|
8746
8779
|
/**
|
|
8747
8780
|
* Replaces consecutive double slashes with single slashes. Alias for {@link fixMultiSlashesInSlashPath}.
|
|
@@ -8749,7 +8782,7 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
|
|
|
8749
8782
|
* @param input - The slash path to fix.
|
|
8750
8783
|
* @returns The path with double slashes collapsed.
|
|
8751
8784
|
*/ function replaceMultipleFilePathsInSlashPath(input) {
|
|
8752
|
-
return input.
|
|
8785
|
+
return input.replaceAll(ALL_DOUBLE_SLASHES_REGEX, SLASH_PATH_SEPARATOR);
|
|
8753
8786
|
}
|
|
8754
8787
|
/**
|
|
8755
8788
|
* Removes all trailing slashes from a slash path.
|
|
@@ -8793,7 +8826,7 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
|
|
|
8793
8826
|
*/ function replaceInvalidFilePathTypeSeparatorsInSlashPathFunction() {
|
|
8794
8827
|
var replaceWith = arguments.length > 0 && arguments[0] !== void 0 ? arguments[0] : DEFAULT_SLASH_PATH_ILLEGAL_CHARACTER_REPLACEMENT;
|
|
8795
8828
|
return function(input) {
|
|
8796
|
-
var endsOnFileTypeSeparator = input
|
|
8829
|
+
var endsOnFileTypeSeparator = input.at(-1) === SLASH_PATH_FILE_TYPE_SEPARATOR;
|
|
8797
8830
|
var inputToEvaluate = endsOnFileTypeSeparator ? removeTrailingFileTypeSeparators(input) : input;
|
|
8798
8831
|
var _firstAndLastCharacterOccurrence = firstAndLastCharacterOccurrence(inputToEvaluate, SLASH_PATH_FILE_TYPE_SEPARATOR); _firstAndLastCharacterOccurrence.first; var last = _firstAndLastCharacterOccurrence.last, occurences = _firstAndLastCharacterOccurrence.occurences;
|
|
8799
8832
|
var fixedPath;
|
|
@@ -8815,8 +8848,8 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
|
|
|
8815
8848
|
}
|
|
8816
8849
|
default:
|
|
8817
8850
|
{
|
|
8818
|
-
var _splitStringAtIndex = _sliced_to_array$
|
|
8819
|
-
var headWithReplacedSeparators = head.
|
|
8851
|
+
var _splitStringAtIndex = _sliced_to_array$e(splitStringAtIndex(inputToEvaluate, last, true), 2), head = _splitStringAtIndex[0], tail = _splitStringAtIndex[1];
|
|
8852
|
+
var headWithReplacedSeparators = head.replaceAll(ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX, replaceWith);
|
|
8820
8853
|
fixedPath = headWithReplacedSeparators + tail;
|
|
8821
8854
|
break;
|
|
8822
8855
|
}
|
|
@@ -8948,7 +8981,7 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
|
|
|
8948
8981
|
if (pathStartsWithSlash) {
|
|
8949
8982
|
folderPath = SLASH_PATH_SEPARATOR + folderPath;
|
|
8950
8983
|
}
|
|
8951
|
-
fileFolder = folderPathParts
|
|
8984
|
+
fileFolder = folderPathParts.at(-1);
|
|
8952
8985
|
} else {
|
|
8953
8986
|
folderPath = path;
|
|
8954
8987
|
fileFolder = undefined;
|
|
@@ -9066,7 +9099,7 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
|
|
|
9066
9099
|
var _config_matchRemaining, _config_nonMatchingFillValue;
|
|
9067
9100
|
var config = slashPathPathMatcherConfig(input);
|
|
9068
9101
|
var targetPathPartsInput = asArray(config.targetPath);
|
|
9069
|
-
var endComparisonAtIndex = config.maxPartsToCompare
|
|
9102
|
+
var endComparisonAtIndex = config.maxPartsToCompare == null ? Number.MAX_SAFE_INTEGER : config.maxPartsToCompare - 1;
|
|
9070
9103
|
var matchRemaining = typeof config.matchRemaining === 'boolean' ? decisionFunction(config.matchRemaining) : (_config_matchRemaining = config.matchRemaining) !== null && _config_matchRemaining !== void 0 ? _config_matchRemaining : decisionFunction(false);
|
|
9071
9104
|
var nonMatchingFillValue = (_config_nonMatchingFillValue = config.nonMatchingFillValue) !== null && _config_nonMatchingFillValue !== void 0 ? _config_nonMatchingFillValue : false;
|
|
9072
9105
|
var targetPathIndexMatchingDecisionFunctions = expandSlashPathPathMatcherPartToDecisionFunctions(targetPathPartsInput);
|
|
@@ -9141,21 +9174,21 @@ var ALL_SLASH_PATH_FILE_TYPE_SEPARATORS_REGEX = /\.+/g;
|
|
|
9141
9174
|
};
|
|
9142
9175
|
}
|
|
9143
9176
|
|
|
9144
|
-
function _array_like_to_array$
|
|
9177
|
+
function _array_like_to_array$l(arr, len) {
|
|
9145
9178
|
if (len == null || len > arr.length) len = arr.length;
|
|
9146
9179
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
9147
9180
|
return arr2;
|
|
9148
9181
|
}
|
|
9149
|
-
function _array_with_holes$
|
|
9182
|
+
function _array_with_holes$d(arr) {
|
|
9150
9183
|
if (Array.isArray(arr)) return arr;
|
|
9151
9184
|
}
|
|
9152
9185
|
function _array_without_holes$c(arr) {
|
|
9153
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
9186
|
+
if (Array.isArray(arr)) return _array_like_to_array$l(arr);
|
|
9154
9187
|
}
|
|
9155
9188
|
function _iterable_to_array$c(iter) {
|
|
9156
9189
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
9157
9190
|
}
|
|
9158
|
-
function _iterable_to_array_limit$
|
|
9191
|
+
function _iterable_to_array_limit$d(arr, i) {
|
|
9159
9192
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
9160
9193
|
if (_i == null) return;
|
|
9161
9194
|
var _arr = [];
|
|
@@ -9179,25 +9212,25 @@ function _iterable_to_array_limit$c(arr, i) {
|
|
|
9179
9212
|
}
|
|
9180
9213
|
return _arr;
|
|
9181
9214
|
}
|
|
9182
|
-
function _non_iterable_rest$
|
|
9215
|
+
function _non_iterable_rest$d() {
|
|
9183
9216
|
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
9217
|
}
|
|
9185
9218
|
function _non_iterable_spread$c() {
|
|
9186
9219
|
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
9220
|
}
|
|
9188
|
-
function _sliced_to_array$
|
|
9189
|
-
return _array_with_holes$
|
|
9221
|
+
function _sliced_to_array$d(arr, i) {
|
|
9222
|
+
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
9223
|
}
|
|
9191
9224
|
function _to_consumable_array$c(arr) {
|
|
9192
|
-
return _array_without_holes$c(arr) || _iterable_to_array$c(arr) || _unsupported_iterable_to_array$
|
|
9225
|
+
return _array_without_holes$c(arr) || _iterable_to_array$c(arr) || _unsupported_iterable_to_array$l(arr) || _non_iterable_spread$c();
|
|
9193
9226
|
}
|
|
9194
|
-
function _unsupported_iterable_to_array$
|
|
9227
|
+
function _unsupported_iterable_to_array$l(o, minLen) {
|
|
9195
9228
|
if (!o) return;
|
|
9196
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
9229
|
+
if (typeof o === "string") return _array_like_to_array$l(o, minLen);
|
|
9197
9230
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
9198
9231
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
9199
9232
|
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$
|
|
9233
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$l(o, minLen);
|
|
9201
9234
|
}
|
|
9202
9235
|
/**
|
|
9203
9236
|
* Returns true if the input string is a known HTTP protocol (`"http"` or `"https"`).
|
|
@@ -9208,8 +9241,10 @@ function _unsupported_iterable_to_array$k(o, minLen) {
|
|
|
9208
9241
|
return input === 'http' || input === 'https';
|
|
9209
9242
|
}
|
|
9210
9243
|
/**
|
|
9211
|
-
* Simple website domain regex that looks for a period in the string between the domain and the tld
|
|
9212
|
-
|
|
9244
|
+
* Simple website domain regex that looks for a period in the string between the domain and the tld.
|
|
9245
|
+
*
|
|
9246
|
+
* Anchored character-class form prevents catastrophic backtracking on inputs without a period.
|
|
9247
|
+
*/ var HAS_WEBSITE_DOMAIN_NAME_REGEX = /^[^.]+\.[^.]/;
|
|
9213
9248
|
/**
|
|
9214
9249
|
* Returns true if the input probably contains a website domain (has at least one period separating parts).
|
|
9215
9250
|
*
|
|
@@ -9223,7 +9258,8 @@ function _unsupported_iterable_to_array$k(o, minLen) {
|
|
|
9223
9258
|
* @param input - The string to check for a domain.
|
|
9224
9259
|
* @returns Whether the input appears to contain a website domain.
|
|
9225
9260
|
*/ function hasWebsiteDomain(input) {
|
|
9226
|
-
|
|
9261
|
+
var dotIndex = input.indexOf('.');
|
|
9262
|
+
return dotIndex > 0 && dotIndex < input.length - 1;
|
|
9227
9263
|
}
|
|
9228
9264
|
/**
|
|
9229
9265
|
* This Regex is really only reliable for detecting that the TLD exists, but due to the nature of tld's
|
|
@@ -9309,7 +9345,7 @@ function _unsupported_iterable_to_array$k(o, minLen) {
|
|
|
9309
9345
|
var pathHasWebsiteDomain = hasWebsiteDomain(domain);
|
|
9310
9346
|
var inputHasPortNumber = hasPortNumber(input);
|
|
9311
9347
|
var portNumber = inputHasPortNumber ? (_readPortNumber = readPortNumber(input)) !== null && _readPortNumber !== void 0 ? _readPortNumber : undefined : undefined;
|
|
9312
|
-
var _splitStringAtFirstCharacterOccurence = _sliced_to_array$
|
|
9348
|
+
var _splitStringAtFirstCharacterOccurence = _sliced_to_array$d(splitStringAtFirstCharacterOccurence(splitPair.path, '?'), 2), path = _splitStringAtFirstCharacterOccurence[0], query = _splitStringAtFirstCharacterOccurence[1]; // everything after the query is ignored
|
|
9313
9349
|
var isWebsiteUrl = pathHasWebsiteDomain && (path === '' || isValidSlashPath(path + '/'));
|
|
9314
9350
|
var inputHasHttpPrefix = hasHttpPrefix(input);
|
|
9315
9351
|
var result = {
|
|
@@ -9415,7 +9451,7 @@ function _unsupported_iterable_to_array$k(o, minLen) {
|
|
|
9415
9451
|
* @param inputPath - The path string to split.
|
|
9416
9452
|
* @returns A pair containing the path and optional query string.
|
|
9417
9453
|
*/ function websitePathAndQueryPair(inputPath) {
|
|
9418
|
-
var _inputPath_split = _sliced_to_array$
|
|
9454
|
+
var _inputPath_split = _sliced_to_array$d(inputPath.split('?', 2), 2), path = _inputPath_split[0], rawQuery = _inputPath_split[1];
|
|
9419
9455
|
var query = rawQuery ? fixExtraQueryParameters(rawQuery, true) : undefined;
|
|
9420
9456
|
return {
|
|
9421
9457
|
path: path,
|
|
@@ -9615,7 +9651,7 @@ function _unsupported_iterable_to_array$k(o, minLen) {
|
|
|
9615
9651
|
* @returns The extracted domain
|
|
9616
9652
|
*/ function readEmailDomainFromUrlOrEmailAddress(urlLikeInput) {
|
|
9617
9653
|
var emailSplit = urlLikeInput.split('@');
|
|
9618
|
-
var url = emailSplit
|
|
9654
|
+
var url = emailSplit.at(-1);
|
|
9619
9655
|
var domain;
|
|
9620
9656
|
if (emailSplit.length > 1) {
|
|
9621
9657
|
domain = url;
|
|
@@ -9630,13 +9666,13 @@ function _unsupported_iterable_to_array$k(o, minLen) {
|
|
|
9630
9666
|
return domain;
|
|
9631
9667
|
}
|
|
9632
9668
|
|
|
9633
|
-
function _array_like_to_array$
|
|
9669
|
+
function _array_like_to_array$k(arr, len) {
|
|
9634
9670
|
if (len == null || len > arr.length) len = arr.length;
|
|
9635
9671
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
9636
9672
|
return arr2;
|
|
9637
9673
|
}
|
|
9638
9674
|
function _array_without_holes$b(arr) {
|
|
9639
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
9675
|
+
if (Array.isArray(arr)) return _array_like_to_array$k(arr);
|
|
9640
9676
|
}
|
|
9641
9677
|
function _iterable_to_array$b(iter) {
|
|
9642
9678
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
@@ -9645,15 +9681,15 @@ function _non_iterable_spread$b() {
|
|
|
9645
9681
|
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
9682
|
}
|
|
9647
9683
|
function _to_consumable_array$b(arr) {
|
|
9648
|
-
return _array_without_holes$b(arr) || _iterable_to_array$b(arr) || _unsupported_iterable_to_array$
|
|
9684
|
+
return _array_without_holes$b(arr) || _iterable_to_array$b(arr) || _unsupported_iterable_to_array$k(arr) || _non_iterable_spread$b();
|
|
9649
9685
|
}
|
|
9650
|
-
function _unsupported_iterable_to_array$
|
|
9686
|
+
function _unsupported_iterable_to_array$k(o, minLen) {
|
|
9651
9687
|
if (!o) return;
|
|
9652
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
9688
|
+
if (typeof o === "string") return _array_like_to_array$k(o, minLen);
|
|
9653
9689
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
9654
9690
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
9655
9691
|
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$
|
|
9692
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$k(o, minLen);
|
|
9657
9693
|
}
|
|
9658
9694
|
/**
|
|
9659
9695
|
* Converts an EmailParticipant object to a formatted string representation.
|
|
@@ -9806,7 +9842,7 @@ function _get_prototype_of$3(o) {
|
|
|
9806
9842
|
};
|
|
9807
9843
|
return _get_prototype_of$3(o);
|
|
9808
9844
|
}
|
|
9809
|
-
function _inherits$
|
|
9845
|
+
function _inherits$4(subClass, superClass) {
|
|
9810
9846
|
if (typeof superClass !== "function" && superClass !== null) {
|
|
9811
9847
|
throw new TypeError("Super expression must either be null or a function");
|
|
9812
9848
|
}
|
|
@@ -9817,7 +9853,7 @@ function _inherits$3(subClass, superClass) {
|
|
|
9817
9853
|
configurable: true
|
|
9818
9854
|
}
|
|
9819
9855
|
});
|
|
9820
|
-
if (superClass) _set_prototype_of$
|
|
9856
|
+
if (superClass) _set_prototype_of$4(subClass, superClass);
|
|
9821
9857
|
}
|
|
9822
9858
|
function _object_spread$b(target) {
|
|
9823
9859
|
for(var i = 1; i < arguments.length; i++){
|
|
@@ -9859,12 +9895,12 @@ function _possible_constructor_return$3(self, call) {
|
|
|
9859
9895
|
}
|
|
9860
9896
|
return _assert_this_initialized$3(self);
|
|
9861
9897
|
}
|
|
9862
|
-
function _set_prototype_of$
|
|
9863
|
-
_set_prototype_of$
|
|
9898
|
+
function _set_prototype_of$4(o, p) {
|
|
9899
|
+
_set_prototype_of$4 = Object.setPrototypeOf || function setPrototypeOf(o, p) {
|
|
9864
9900
|
o.__proto__ = p;
|
|
9865
9901
|
return o;
|
|
9866
9902
|
};
|
|
9867
|
-
return _set_prototype_of$
|
|
9903
|
+
return _set_prototype_of$4(o, p);
|
|
9868
9904
|
}
|
|
9869
9905
|
function _type_of$b(obj) {
|
|
9870
9906
|
"@swc/helpers - typeof";
|
|
@@ -9924,7 +9960,7 @@ function partialServerError(messageOrError) {
|
|
|
9924
9960
|
/**
|
|
9925
9961
|
* Server error response with a 401 Unauthorized status.
|
|
9926
9962
|
*/ var UnauthorizedServerErrorResponse = /*#__PURE__*/ function(ServerErrorResponse) {
|
|
9927
|
-
_inherits$
|
|
9963
|
+
_inherits$4(UnauthorizedServerErrorResponse, ServerErrorResponse);
|
|
9928
9964
|
function UnauthorizedServerErrorResponse(param) {
|
|
9929
9965
|
var code = param.code, data = param.data, message = param.message;
|
|
9930
9966
|
_class_call_check$7(this, UnauthorizedServerErrorResponse);
|
|
@@ -9955,6 +9991,7 @@ function _define_property$e(obj, key, value) {
|
|
|
9955
9991
|
return obj;
|
|
9956
9992
|
}
|
|
9957
9993
|
function _instanceof$2(left, right) {
|
|
9994
|
+
"@swc/helpers - instanceof";
|
|
9958
9995
|
if (right != null && typeof Symbol !== "undefined" && right[Symbol.hasInstance]) {
|
|
9959
9996
|
return !!right[Symbol.hasInstance](left);
|
|
9960
9997
|
} else {
|
|
@@ -10104,13 +10141,13 @@ function toReadableError(inputError) {
|
|
|
10104
10141
|
return buffer.includes('/Encrypt');
|
|
10105
10142
|
}
|
|
10106
10143
|
|
|
10107
|
-
function _array_like_to_array$
|
|
10144
|
+
function _array_like_to_array$j(arr, len) {
|
|
10108
10145
|
if (len == null || len > arr.length) len = arr.length;
|
|
10109
10146
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
10110
10147
|
return arr2;
|
|
10111
10148
|
}
|
|
10112
10149
|
function _array_without_holes$a(arr) {
|
|
10113
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
10150
|
+
if (Array.isArray(arr)) return _array_like_to_array$j(arr);
|
|
10114
10151
|
}
|
|
10115
10152
|
function _iterable_to_array$a(iter) {
|
|
10116
10153
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
@@ -10119,15 +10156,15 @@ function _non_iterable_spread$a() {
|
|
|
10119
10156
|
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
10157
|
}
|
|
10121
10158
|
function _to_consumable_array$a(arr) {
|
|
10122
|
-
return _array_without_holes$a(arr) || _iterable_to_array$a(arr) || _unsupported_iterable_to_array$
|
|
10159
|
+
return _array_without_holes$a(arr) || _iterable_to_array$a(arr) || _unsupported_iterable_to_array$j(arr) || _non_iterable_spread$a();
|
|
10123
10160
|
}
|
|
10124
|
-
function _unsupported_iterable_to_array$
|
|
10161
|
+
function _unsupported_iterable_to_array$j(o, minLen) {
|
|
10125
10162
|
if (!o) return;
|
|
10126
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
10163
|
+
if (typeof o === "string") return _array_like_to_array$j(o, minLen);
|
|
10127
10164
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
10128
10165
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
10129
10166
|
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$
|
|
10167
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$j(o, minLen);
|
|
10131
10168
|
}
|
|
10132
10169
|
/*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
10170
|
/**
|
|
@@ -10161,19 +10198,13 @@ function _unsupported_iterable_to_array$i(o, minLen) {
|
|
|
10161
10198
|
};
|
|
10162
10199
|
}
|
|
10163
10200
|
|
|
10164
|
-
|
|
10165
|
-
* Identity function that returns the input value unchanged.
|
|
10166
|
-
*
|
|
10167
|
-
* Alias of MAP_IDENTITY, so `isMapIdentityFunction()` will return true for this function.
|
|
10168
|
-
*/ var passThrough = MAP_IDENTITY;
|
|
10169
|
-
|
|
10170
|
-
function _array_like_to_array$h(arr, len) {
|
|
10201
|
+
function _array_like_to_array$i(arr, len) {
|
|
10171
10202
|
if (len == null || len > arr.length) len = arr.length;
|
|
10172
10203
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
10173
10204
|
return arr2;
|
|
10174
10205
|
}
|
|
10175
10206
|
function _array_without_holes$9(arr) {
|
|
10176
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
10207
|
+
if (Array.isArray(arr)) return _array_like_to_array$i(arr);
|
|
10177
10208
|
}
|
|
10178
10209
|
function _iterable_to_array$9(iter) {
|
|
10179
10210
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
@@ -10182,15 +10213,15 @@ function _non_iterable_spread$9() {
|
|
|
10182
10213
|
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
10214
|
}
|
|
10184
10215
|
function _to_consumable_array$9(arr) {
|
|
10185
|
-
return _array_without_holes$9(arr) || _iterable_to_array$9(arr) || _unsupported_iterable_to_array$
|
|
10216
|
+
return _array_without_holes$9(arr) || _iterable_to_array$9(arr) || _unsupported_iterable_to_array$i(arr) || _non_iterable_spread$9();
|
|
10186
10217
|
}
|
|
10187
|
-
function _unsupported_iterable_to_array$
|
|
10218
|
+
function _unsupported_iterable_to_array$i(o, minLen) {
|
|
10188
10219
|
if (!o) return;
|
|
10189
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
10220
|
+
if (typeof o === "string") return _array_like_to_array$i(o, minLen);
|
|
10190
10221
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
10191
10222
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
10192
10223
|
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$
|
|
10224
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$i(o, minLen);
|
|
10194
10225
|
}
|
|
10195
10226
|
/**
|
|
10196
10227
|
* Builds an array from the intersection of an object's keys with the provided keys.
|
|
@@ -10529,13 +10560,13 @@ function performTaskCountLoop(config) {
|
|
|
10529
10560
|
});
|
|
10530
10561
|
}
|
|
10531
10562
|
|
|
10532
|
-
function _array_like_to_array$
|
|
10563
|
+
function _array_like_to_array$h(arr, len) {
|
|
10533
10564
|
if (len == null || len > arr.length) len = arr.length;
|
|
10534
10565
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
10535
10566
|
return arr2;
|
|
10536
10567
|
}
|
|
10537
10568
|
function _array_without_holes$8(arr) {
|
|
10538
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
10569
|
+
if (Array.isArray(arr)) return _array_like_to_array$h(arr);
|
|
10539
10570
|
}
|
|
10540
10571
|
function asyncGeneratorStep$8(gen, resolve, reject, _next, _throw, key, arg) {
|
|
10541
10572
|
try {
|
|
@@ -10573,15 +10604,15 @@ function _non_iterable_spread$8() {
|
|
|
10573
10604
|
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
10605
|
}
|
|
10575
10606
|
function _to_consumable_array$8(arr) {
|
|
10576
|
-
return _array_without_holes$8(arr) || _iterable_to_array$8(arr) || _unsupported_iterable_to_array$
|
|
10607
|
+
return _array_without_holes$8(arr) || _iterable_to_array$8(arr) || _unsupported_iterable_to_array$h(arr) || _non_iterable_spread$8();
|
|
10577
10608
|
}
|
|
10578
|
-
function _unsupported_iterable_to_array$
|
|
10609
|
+
function _unsupported_iterable_to_array$h(o, minLen) {
|
|
10579
10610
|
if (!o) return;
|
|
10580
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
10611
|
+
if (typeof o === "string") return _array_like_to_array$h(o, minLen);
|
|
10581
10612
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
10582
10613
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
10583
10614
|
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$
|
|
10615
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$h(o, minLen);
|
|
10585
10616
|
}
|
|
10586
10617
|
function _ts_generator$8(thisArg, body) {
|
|
10587
10618
|
var f, y, t, _ = {
|
|
@@ -10794,21 +10825,21 @@ function _ts_generator$8(thisArg, body) {
|
|
|
10794
10825
|
};
|
|
10795
10826
|
}
|
|
10796
10827
|
|
|
10797
|
-
function _array_like_to_array$
|
|
10828
|
+
function _array_like_to_array$g(arr, len) {
|
|
10798
10829
|
if (len == null || len > arr.length) len = arr.length;
|
|
10799
10830
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
10800
10831
|
return arr2;
|
|
10801
10832
|
}
|
|
10802
|
-
function _array_with_holes$
|
|
10833
|
+
function _array_with_holes$c(arr) {
|
|
10803
10834
|
if (Array.isArray(arr)) return arr;
|
|
10804
10835
|
}
|
|
10805
10836
|
function _array_without_holes$7(arr) {
|
|
10806
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
10837
|
+
if (Array.isArray(arr)) return _array_like_to_array$g(arr);
|
|
10807
10838
|
}
|
|
10808
10839
|
function _iterable_to_array$7(iter) {
|
|
10809
10840
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
10810
10841
|
}
|
|
10811
|
-
function _iterable_to_array_limit$
|
|
10842
|
+
function _iterable_to_array_limit$c(arr, i) {
|
|
10812
10843
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
10813
10844
|
if (_i == null) return;
|
|
10814
10845
|
var _arr = [];
|
|
@@ -10832,25 +10863,25 @@ function _iterable_to_array_limit$b(arr, i) {
|
|
|
10832
10863
|
}
|
|
10833
10864
|
return _arr;
|
|
10834
10865
|
}
|
|
10835
|
-
function _non_iterable_rest$
|
|
10866
|
+
function _non_iterable_rest$c() {
|
|
10836
10867
|
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
10868
|
}
|
|
10838
10869
|
function _non_iterable_spread$7() {
|
|
10839
10870
|
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
10871
|
}
|
|
10841
|
-
function _sliced_to_array$
|
|
10842
|
-
return _array_with_holes$
|
|
10872
|
+
function _sliced_to_array$c(arr, i) {
|
|
10873
|
+
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
10874
|
}
|
|
10844
10875
|
function _to_consumable_array$7(arr) {
|
|
10845
|
-
return _array_without_holes$7(arr) || _iterable_to_array$7(arr) || _unsupported_iterable_to_array$
|
|
10876
|
+
return _array_without_holes$7(arr) || _iterable_to_array$7(arr) || _unsupported_iterable_to_array$g(arr) || _non_iterable_spread$7();
|
|
10846
10877
|
}
|
|
10847
|
-
function _unsupported_iterable_to_array$
|
|
10878
|
+
function _unsupported_iterable_to_array$g(o, minLen) {
|
|
10848
10879
|
if (!o) return;
|
|
10849
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
10880
|
+
if (typeof o === "string") return _array_like_to_array$g(o, minLen);
|
|
10850
10881
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
10851
10882
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
10852
10883
|
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$
|
|
10884
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$g(o, minLen);
|
|
10854
10885
|
}
|
|
10855
10886
|
/**
|
|
10856
10887
|
* Creates a bidirectional {@link PrimativeKeyDencoderMap} from the given values,
|
|
@@ -10874,7 +10905,7 @@ function _unsupported_iterable_to_array$f(o, minLen) {
|
|
|
10874
10905
|
valuesArray = values;
|
|
10875
10906
|
}
|
|
10876
10907
|
valuesArray.forEach(function(value) {
|
|
10877
|
-
var _value = _sliced_to_array$
|
|
10908
|
+
var _value = _sliced_to_array$c(value, 2), d = _value[0], e = _value[1];
|
|
10878
10909
|
if (map.has(d) || map.has(e)) {
|
|
10879
10910
|
throw new Error("primativeKeyDencoderMap() encountered a repeat key/value: ".concat(d, "/").concat(e, ". Keys and values must be unique."));
|
|
10880
10911
|
}
|
|
@@ -11082,10 +11113,7 @@ function _unsupported_iterable_to_array$f(o, minLen) {
|
|
|
11082
11113
|
var address;
|
|
11083
11114
|
var lineBreakLine = addLinebreaks ? '\n' : '';
|
|
11084
11115
|
var parts = [];
|
|
11085
|
-
parts.push(name);
|
|
11086
|
-
parts.push(phone);
|
|
11087
|
-
parts.push(line1);
|
|
11088
|
-
parts.push(line2);
|
|
11116
|
+
parts.push(name, phone, line1, line2);
|
|
11089
11117
|
if (city || state || zip) {
|
|
11090
11118
|
if (city && (state || zip)) {
|
|
11091
11119
|
parts.push("".concat(city, ", ").concat(state, " ").concat(zip));
|
|
@@ -11265,12 +11293,12 @@ function _unsupported_iterable_to_array$f(o, minLen) {
|
|
|
11265
11293
|
};
|
|
11266
11294
|
}
|
|
11267
11295
|
|
|
11268
|
-
function _array_like_to_array$
|
|
11296
|
+
function _array_like_to_array$f(arr, len) {
|
|
11269
11297
|
if (len == null || len > arr.length) len = arr.length;
|
|
11270
11298
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
11271
11299
|
return arr2;
|
|
11272
11300
|
}
|
|
11273
|
-
function _array_with_holes$
|
|
11301
|
+
function _array_with_holes$b(arr) {
|
|
11274
11302
|
if (Array.isArray(arr)) return arr;
|
|
11275
11303
|
}
|
|
11276
11304
|
function _define_property$c(obj, key, value) {
|
|
@@ -11286,7 +11314,20 @@ function _define_property$c(obj, key, value) {
|
|
|
11286
11314
|
}
|
|
11287
11315
|
return obj;
|
|
11288
11316
|
}
|
|
11289
|
-
function
|
|
11317
|
+
function _inherits$3(subClass, superClass) {
|
|
11318
|
+
if (typeof superClass !== "function" && superClass !== null) {
|
|
11319
|
+
throw new TypeError("Super expression must either be null or a function");
|
|
11320
|
+
}
|
|
11321
|
+
subClass.prototype = Object.create(superClass && superClass.prototype, {
|
|
11322
|
+
constructor: {
|
|
11323
|
+
value: subClass,
|
|
11324
|
+
writable: true,
|
|
11325
|
+
configurable: true
|
|
11326
|
+
}
|
|
11327
|
+
});
|
|
11328
|
+
if (superClass) _set_prototype_of$3(subClass, superClass);
|
|
11329
|
+
}
|
|
11330
|
+
function _iterable_to_array_limit$b(arr, i) {
|
|
11290
11331
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
11291
11332
|
if (_i == null) return;
|
|
11292
11333
|
var _arr = [];
|
|
@@ -11310,7 +11351,7 @@ function _iterable_to_array_limit$a(arr, i) {
|
|
|
11310
11351
|
}
|
|
11311
11352
|
return _arr;
|
|
11312
11353
|
}
|
|
11313
|
-
function _non_iterable_rest$
|
|
11354
|
+
function _non_iterable_rest$b() {
|
|
11314
11355
|
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
11356
|
}
|
|
11316
11357
|
function _object_spread$8(target) {
|
|
@@ -11347,20 +11388,101 @@ function _object_spread_props$4(target, source) {
|
|
|
11347
11388
|
}
|
|
11348
11389
|
return target;
|
|
11349
11390
|
}
|
|
11350
|
-
function
|
|
11351
|
-
|
|
11391
|
+
function _set_prototype_of$3(o, p) {
|
|
11392
|
+
_set_prototype_of$3 = Object.setPrototypeOf || function setPrototypeOf(o, p) {
|
|
11393
|
+
o.__proto__ = p;
|
|
11394
|
+
return o;
|
|
11395
|
+
};
|
|
11396
|
+
return _set_prototype_of$3(o, p);
|
|
11397
|
+
}
|
|
11398
|
+
function _sliced_to_array$b(arr, i) {
|
|
11399
|
+
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
11400
|
}
|
|
11353
11401
|
function _type_of$9(obj) {
|
|
11354
11402
|
"@swc/helpers - typeof";
|
|
11355
11403
|
return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
|
|
11356
11404
|
}
|
|
11357
|
-
function _unsupported_iterable_to_array$
|
|
11405
|
+
function _unsupported_iterable_to_array$f(o, minLen) {
|
|
11358
11406
|
if (!o) return;
|
|
11359
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
11407
|
+
if (typeof o === "string") return _array_like_to_array$f(o, minLen);
|
|
11360
11408
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
11361
11409
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
11362
11410
|
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$
|
|
11411
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$f(o, minLen);
|
|
11412
|
+
}
|
|
11413
|
+
function _wrap_reg_exp(re, groups, source) {
|
|
11414
|
+
_wrap_reg_exp = function(re, groups, source) {
|
|
11415
|
+
return new WrappedRegExp(re, undefined, groups, source);
|
|
11416
|
+
};
|
|
11417
|
+
var _super = RegExp.prototype;
|
|
11418
|
+
var _groups = new WeakMap();
|
|
11419
|
+
var _sources = new WeakMap();
|
|
11420
|
+
var _native_source = Object.getOwnPropertyDescriptor(_super, "source").get;
|
|
11421
|
+
function WrappedRegExp(re, flags, groups, source) {
|
|
11422
|
+
var _re = new RegExp(re, flags);
|
|
11423
|
+
_groups.set(_re, groups || _groups.get(re));
|
|
11424
|
+
_sources.set(_re, source !== undefined ? source : _sources.get(re));
|
|
11425
|
+
return _set_prototype_of$3(_re, WrappedRegExp.prototype);
|
|
11426
|
+
}
|
|
11427
|
+
_inherits$3(WrappedRegExp, RegExp);
|
|
11428
|
+
Object.defineProperty(WrappedRegExp.prototype, "source", {
|
|
11429
|
+
configurable: true,
|
|
11430
|
+
get: function() {
|
|
11431
|
+
var source = _sources.get(this);
|
|
11432
|
+
if (source !== undefined) {
|
|
11433
|
+
try {
|
|
11434
|
+
new RegExp(source, this.flags);
|
|
11435
|
+
return source;
|
|
11436
|
+
} catch (_) {}
|
|
11437
|
+
}
|
|
11438
|
+
return _native_source.call(this);
|
|
11439
|
+
}
|
|
11440
|
+
});
|
|
11441
|
+
WrappedRegExp.prototype.exec = function(str) {
|
|
11442
|
+
var result = _super.exec.call(this, str);
|
|
11443
|
+
if (result) {
|
|
11444
|
+
result.groups = buildGroups(result, this);
|
|
11445
|
+
var indices = result.indices;
|
|
11446
|
+
if (indices) indices.groups = buildGroups(indices, this);
|
|
11447
|
+
}
|
|
11448
|
+
return result;
|
|
11449
|
+
};
|
|
11450
|
+
WrappedRegExp.prototype[Symbol.replace] = function(str, substitution) {
|
|
11451
|
+
if (typeof substitution === "string") {
|
|
11452
|
+
var groups = _groups.get(this);
|
|
11453
|
+
return _super[Symbol.replace].call(this, str, substitution.replace(/\$<([^>]+)>/g, function(_, name) {
|
|
11454
|
+
var group = groups ? groups[name] : undefined;
|
|
11455
|
+
if (group === undefined) return "";
|
|
11456
|
+
return "$" + (Array.isArray(group) ? group.join("$") : group);
|
|
11457
|
+
}));
|
|
11458
|
+
}
|
|
11459
|
+
if (typeof substitution === "function") {
|
|
11460
|
+
var _this = this;
|
|
11461
|
+
return _super[Symbol.replace].call(this, str, function() {
|
|
11462
|
+
var args = arguments;
|
|
11463
|
+
if (typeof args[args.length - 1] !== "object") {
|
|
11464
|
+
args = [].slice.call(args);
|
|
11465
|
+
args.push(buildGroups(args, _this));
|
|
11466
|
+
}
|
|
11467
|
+
return substitution.apply(this, args);
|
|
11468
|
+
});
|
|
11469
|
+
}
|
|
11470
|
+
return _super[Symbol.replace].call(this, str, substitution);
|
|
11471
|
+
};
|
|
11472
|
+
function buildGroups(result, re) {
|
|
11473
|
+
var g = _groups.get(re);
|
|
11474
|
+
return Object.keys(g).reduce(function(groups, name) {
|
|
11475
|
+
var i = g[name];
|
|
11476
|
+
if (typeof i === "number") groups[name] = result[i];
|
|
11477
|
+
else {
|
|
11478
|
+
var k = 0;
|
|
11479
|
+
while(result[i[k]] === undefined && k + 1 < i.length)k++;
|
|
11480
|
+
groups[name] = result[i[k]];
|
|
11481
|
+
}
|
|
11482
|
+
return groups;
|
|
11483
|
+
}, Object.create(null));
|
|
11484
|
+
}
|
|
11485
|
+
return _wrap_reg_exp.apply(this, arguments);
|
|
11364
11486
|
}
|
|
11365
11487
|
/**
|
|
11366
11488
|
* Minimum valid latitude value (-90 degrees).
|
|
@@ -11605,7 +11727,10 @@ function latLngString(lat, lng) {
|
|
|
11605
11727
|
* https://stackoverflow.com/questions/3518504/regular-expression-for-matching-latitude-longitude-coordinates
|
|
11606
11728
|
*
|
|
11607
11729
|
* Has a max precision of 15 because Google Maps returns a 15 decimal places when copying a position.
|
|
11608
|
-
*/ var LAT_LNG_PATTERN =
|
|
11730
|
+
*/ var LAT_LNG_PATTERN = _wrap_reg_exp(/(^[-+]?(?:[1-8]?\d(?:\.\d{0,15})?|90(?:\.0{0,15})?))\s*,\s*([-+]?(?:180(?:\.0{0,15})?|(?:1[0-7]\d|[1-9]?\d)(?:\.\d{0,15})?))$/, {
|
|
11731
|
+
lat: 1,
|
|
11732
|
+
lng: 2
|
|
11733
|
+
}, "(?<lat>^[-+]?(?:[1-8]?\\d(?:\\.\\d{0,15})?|90(?:\\.0{0,15})?))\\s*,\\s*(?<lng>[-+]?(?:180(?:\\.0{0,15})?|(?:1[0-7]\\d|[1-9]?\\d)(?:\\.\\d{0,15})?))$");
|
|
11609
11734
|
/**
|
|
11610
11735
|
* Checks whether the input string matches the expected lat/lng pattern (e.g., `"30.5,-96.3"`).
|
|
11611
11736
|
*
|
|
@@ -11759,7 +11884,7 @@ function latLngString(lat, lng) {
|
|
|
11759
11884
|
* @param latLngString - string in the format `"lat,lng"`
|
|
11760
11885
|
* @returns the parsed point
|
|
11761
11886
|
*/ function latLngPointFromString(latLngString) {
|
|
11762
|
-
var _latLngString_split = _sliced_to_array$
|
|
11887
|
+
var _latLngString_split = _sliced_to_array$b(latLngString.split(','), 2), latString = _latLngString_split[0], lngString = _latLngString_split[1];
|
|
11763
11888
|
var lat = Number(latString) || 0; // default lat and lng to 0 if not valid.
|
|
11764
11889
|
var lng = Number(lngString) || 0;
|
|
11765
11890
|
return {
|
|
@@ -11858,21 +11983,21 @@ function latLngString(lat, lng) {
|
|
|
11858
11983
|
});
|
|
11859
11984
|
}
|
|
11860
11985
|
|
|
11861
|
-
function _array_like_to_array$
|
|
11986
|
+
function _array_like_to_array$e(arr, len) {
|
|
11862
11987
|
if (len == null || len > arr.length) len = arr.length;
|
|
11863
11988
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
11864
11989
|
return arr2;
|
|
11865
11990
|
}
|
|
11866
|
-
function _array_with_holes$
|
|
11991
|
+
function _array_with_holes$a(arr) {
|
|
11867
11992
|
if (Array.isArray(arr)) return arr;
|
|
11868
11993
|
}
|
|
11869
11994
|
function _array_without_holes$6(arr) {
|
|
11870
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
11995
|
+
if (Array.isArray(arr)) return _array_like_to_array$e(arr);
|
|
11871
11996
|
}
|
|
11872
11997
|
function _iterable_to_array$6(iter) {
|
|
11873
11998
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
11874
11999
|
}
|
|
11875
|
-
function _iterable_to_array_limit$
|
|
12000
|
+
function _iterable_to_array_limit$a(arr, i) {
|
|
11876
12001
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
11877
12002
|
if (_i == null) return;
|
|
11878
12003
|
var _arr = [];
|
|
@@ -11896,29 +12021,29 @@ function _iterable_to_array_limit$9(arr, i) {
|
|
|
11896
12021
|
}
|
|
11897
12022
|
return _arr;
|
|
11898
12023
|
}
|
|
11899
|
-
function _non_iterable_rest$
|
|
12024
|
+
function _non_iterable_rest$a() {
|
|
11900
12025
|
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
12026
|
}
|
|
11902
12027
|
function _non_iterable_spread$6() {
|
|
11903
12028
|
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
12029
|
}
|
|
11905
|
-
function _sliced_to_array$
|
|
11906
|
-
return _array_with_holes$
|
|
12030
|
+
function _sliced_to_array$a(arr, i) {
|
|
12031
|
+
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
12032
|
}
|
|
11908
12033
|
function _to_consumable_array$6(arr) {
|
|
11909
|
-
return _array_without_holes$6(arr) || _iterable_to_array$6(arr) || _unsupported_iterable_to_array$
|
|
12034
|
+
return _array_without_holes$6(arr) || _iterable_to_array$6(arr) || _unsupported_iterable_to_array$e(arr) || _non_iterable_spread$6();
|
|
11910
12035
|
}
|
|
11911
12036
|
function _type_of$8(obj) {
|
|
11912
12037
|
"@swc/helpers - typeof";
|
|
11913
12038
|
return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
|
|
11914
12039
|
}
|
|
11915
|
-
function _unsupported_iterable_to_array$
|
|
12040
|
+
function _unsupported_iterable_to_array$e(o, minLen) {
|
|
11916
12041
|
if (!o) return;
|
|
11917
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
12042
|
+
if (typeof o === "string") return _array_like_to_array$e(o, minLen);
|
|
11918
12043
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
11919
12044
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
11920
12045
|
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$
|
|
12046
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$e(o, minLen);
|
|
11922
12047
|
}
|
|
11923
12048
|
/**
|
|
11924
12049
|
* Type guard that checks whether the input is a {@link LatLngBound} by testing for the presence of `sw` and `ne` properties.
|
|
@@ -12145,7 +12270,7 @@ function _unsupported_iterable_to_array$d(o, minLen) {
|
|
|
12145
12270
|
var bound;
|
|
12146
12271
|
if (Array.isArray(input)) {
|
|
12147
12272
|
if (input.length === 2) {
|
|
12148
|
-
var _input = _sliced_to_array$
|
|
12273
|
+
var _input = _sliced_to_array$a(input, 2), sw = _input[0], ne = _input[1];
|
|
12149
12274
|
bound = {
|
|
12150
12275
|
sw: latLngPoint(sw),
|
|
12151
12276
|
ne: latLngPoint(ne)
|
|
@@ -12456,22 +12581,23 @@ function _unsupported_iterable_to_array$d(o, minLen) {
|
|
|
12456
12581
|
return fn;
|
|
12457
12582
|
}
|
|
12458
12583
|
|
|
12459
|
-
function _array_like_to_array$
|
|
12584
|
+
function _array_like_to_array$d(arr, len) {
|
|
12460
12585
|
if (len == null || len > arr.length) len = arr.length;
|
|
12461
12586
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
12462
12587
|
return arr2;
|
|
12463
12588
|
}
|
|
12464
|
-
function _array_with_holes$
|
|
12589
|
+
function _array_with_holes$9(arr) {
|
|
12465
12590
|
if (Array.isArray(arr)) return arr;
|
|
12466
12591
|
}
|
|
12467
12592
|
function _instanceof$1(left, right) {
|
|
12593
|
+
"@swc/helpers - instanceof";
|
|
12468
12594
|
if (right != null && typeof Symbol !== "undefined" && right[Symbol.hasInstance]) {
|
|
12469
12595
|
return !!right[Symbol.hasInstance](left);
|
|
12470
12596
|
} else {
|
|
12471
12597
|
return left instanceof right;
|
|
12472
12598
|
}
|
|
12473
12599
|
}
|
|
12474
|
-
function _iterable_to_array_limit$
|
|
12600
|
+
function _iterable_to_array_limit$9(arr, i) {
|
|
12475
12601
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
12476
12602
|
if (_i == null) return;
|
|
12477
12603
|
var _arr = [];
|
|
@@ -12495,23 +12621,23 @@ function _iterable_to_array_limit$8(arr, i) {
|
|
|
12495
12621
|
}
|
|
12496
12622
|
return _arr;
|
|
12497
12623
|
}
|
|
12498
|
-
function _non_iterable_rest$
|
|
12624
|
+
function _non_iterable_rest$9() {
|
|
12499
12625
|
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
12626
|
}
|
|
12501
|
-
function _sliced_to_array$
|
|
12502
|
-
return _array_with_holes$
|
|
12627
|
+
function _sliced_to_array$9(arr, i) {
|
|
12628
|
+
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
12629
|
}
|
|
12504
12630
|
function _type_of$7(obj) {
|
|
12505
12631
|
"@swc/helpers - typeof";
|
|
12506
12632
|
return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
|
|
12507
12633
|
}
|
|
12508
|
-
function _unsupported_iterable_to_array$
|
|
12634
|
+
function _unsupported_iterable_to_array$d(o, minLen) {
|
|
12509
12635
|
if (!o) return;
|
|
12510
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
12636
|
+
if (typeof o === "string") return _array_like_to_array$d(o, minLen);
|
|
12511
12637
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
12512
12638
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
12513
12639
|
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$
|
|
12640
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$d(o, minLen);
|
|
12515
12641
|
}
|
|
12516
12642
|
/**
|
|
12517
12643
|
* Regular expression for validating ISO8601 date strings.
|
|
@@ -12532,7 +12658,7 @@ function _unsupported_iterable_to_array$c(o, minLen) {
|
|
|
12532
12658
|
* Sat, 03 Feb 2001 04:05:06 GMT
|
|
12533
12659
|
* Tue, 14 Mar 2023 12:34:56 UTC
|
|
12534
12660
|
* Wed, 25 May 2024 20:45:07 EST
|
|
12535
|
-
*/ var UTC_DATE_STRING_REGEX = /^([a-zA-Z]{3},
|
|
12661
|
+
*/ var UTC_DATE_STRING_REGEX = /^([a-zA-Z]{3}, \d{2} [a-zA-Z]{3} \d{4} \d{2}:\d{2}:\d{2} [A-Z]{3})$/;
|
|
12536
12662
|
/**
|
|
12537
12663
|
* Determines if a string is a valid UTC date string.
|
|
12538
12664
|
*
|
|
@@ -12590,7 +12716,7 @@ function isConsideredUtcTimezoneString(timezone) {
|
|
|
12590
12716
|
* @param inputDateString - The ISO8601 day string to parse (e.g., '2022-01-15')
|
|
12591
12717
|
* @returns A Date object set to midnight UTC on the specified day
|
|
12592
12718
|
*/ function parseISO8601DayStringToUTCDate(inputDateString) {
|
|
12593
|
-
var _inputDateString_split = _sliced_to_array$
|
|
12719
|
+
var _inputDateString_split = _sliced_to_array$9(inputDateString.split('-'), 3), yearString = _inputDateString_split[0], monthString = _inputDateString_split[1], dateString = _inputDateString_split[2];
|
|
12594
12720
|
return new Date(Date.UTC(Number(yearString), Number(monthString) - 1, Number(dateString)));
|
|
12595
12721
|
}
|
|
12596
12722
|
/**
|
|
@@ -12628,7 +12754,7 @@ function isConsideredUtcTimezoneString(timezone) {
|
|
|
12628
12754
|
* @param slashDate - The slash date string to convert (e.g., '1/1/20' or '11/15/2022')
|
|
12629
12755
|
* @returns An ISO8601 formatted day string (YYYY-MM-DD)
|
|
12630
12756
|
*/ function monthDaySlashDateToDateString(slashDate) {
|
|
12631
|
-
var _slashDate_split = _sliced_to_array$
|
|
12757
|
+
var _slashDate_split = _sliced_to_array$9(slashDate.split('/'), 3), month = _slashDate_split[0], day = _slashDate_split[1], year = _slashDate_split[2];
|
|
12632
12758
|
if (month.length === 1) {
|
|
12633
12759
|
month = "0".concat(month);
|
|
12634
12760
|
}
|
|
@@ -12657,7 +12783,7 @@ function dateFromDateOrTimeMillisecondsNumber(input) {
|
|
|
12657
12783
|
* @param dateTimeNumber - Unix timestamp number to convert
|
|
12658
12784
|
* @returns Date object if timestamp is valid, null/undefined if timestamp is null/undefined
|
|
12659
12785
|
*/ function unixMillisecondsNumberToDate(dateTimeNumber) {
|
|
12660
|
-
return dateTimeNumber
|
|
12786
|
+
return dateTimeNumber == null ? dateTimeNumber : new Date(dateTimeNumber);
|
|
12661
12787
|
}
|
|
12662
12788
|
/**
|
|
12663
12789
|
* Converts the input DateOrMilliseconds to a Date.
|
|
@@ -13585,7 +13711,7 @@ function _ts_generator$7(thisArg, body) {
|
|
|
13585
13711
|
var dencoder = inputDencoder !== null && inputDencoder !== void 0 ? inputDencoder : NUMBER_STRING_DENCODER_64;
|
|
13586
13712
|
var dencoderNumberValue = numberStringDencoderDecodedNumberValueFunction(dencoder);
|
|
13587
13713
|
var startAtFromCurrentIndex = currentIndex != null ? dencoderNumberValue(currentIndex) + increaseBy : undefined;
|
|
13588
|
-
var startAt = inputStartAt
|
|
13714
|
+
var startAt = inputStartAt == null ? startAtFromCurrentIndex !== null && startAtFromCurrentIndex !== void 0 ? startAtFromCurrentIndex : 0 : dencoderNumberValue(inputStartAt);
|
|
13589
13715
|
var transform = inputTranformFunction !== null && inputTranformFunction !== void 0 ? inputTranformFunction : mapIdentityFunction();
|
|
13590
13716
|
var numberFactory = incrementingNumberFactory({
|
|
13591
13717
|
startAt: startAt,
|
|
@@ -13598,13 +13724,13 @@ function _ts_generator$7(thisArg, body) {
|
|
|
13598
13724
|
};
|
|
13599
13725
|
}
|
|
13600
13726
|
|
|
13601
|
-
function _array_like_to_array$
|
|
13727
|
+
function _array_like_to_array$c(arr, len) {
|
|
13602
13728
|
if (len == null || len > arr.length) len = arr.length;
|
|
13603
13729
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
13604
13730
|
return arr2;
|
|
13605
13731
|
}
|
|
13606
13732
|
function _array_without_holes$5(arr) {
|
|
13607
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
13733
|
+
if (Array.isArray(arr)) return _array_like_to_array$c(arr);
|
|
13608
13734
|
}
|
|
13609
13735
|
function _iterable_to_array$5(iter) {
|
|
13610
13736
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
@@ -13613,15 +13739,15 @@ function _non_iterable_spread$5() {
|
|
|
13613
13739
|
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
13740
|
}
|
|
13615
13741
|
function _to_consumable_array$5(arr) {
|
|
13616
|
-
return _array_without_holes$5(arr) || _iterable_to_array$5(arr) || _unsupported_iterable_to_array$
|
|
13742
|
+
return _array_without_holes$5(arr) || _iterable_to_array$5(arr) || _unsupported_iterable_to_array$c(arr) || _non_iterable_spread$5();
|
|
13617
13743
|
}
|
|
13618
|
-
function _unsupported_iterable_to_array$
|
|
13744
|
+
function _unsupported_iterable_to_array$c(o, minLen) {
|
|
13619
13745
|
if (!o) return;
|
|
13620
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
13746
|
+
if (typeof o === "string") return _array_like_to_array$c(o, minLen);
|
|
13621
13747
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
13622
13748
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
13623
13749
|
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$
|
|
13750
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$c(o, minLen);
|
|
13625
13751
|
}
|
|
13626
13752
|
/**
|
|
13627
13753
|
* Creates an {@link ObjectDeltaArrayCompressor} that can compress and expand arrays of objects using delta encoding.
|
|
@@ -13882,7 +14008,7 @@ function dateFromDateOrTimeSecondsNumber(input) {
|
|
|
13882
14008
|
* @returns An ExpirationDetails object that can determine expiration state
|
|
13883
14009
|
*/ function expirationDetails(input) {
|
|
13884
14010
|
var expiresAt = input.expiresAt, expires = input.expires, inputNow = input.now, expiresFromDate = input.expiresFromDate, defaultExpiresFromDateToNow = input.defaultExpiresFromDateToNow, expiresIn = input.expiresIn;
|
|
13885
|
-
var parsedExpiresFromDate = expiresFromDate
|
|
14011
|
+
var parsedExpiresFromDate = expiresFromDate == null ? null : dateFromDateOrTimeMillisecondsNumber(expiresFromDate);
|
|
13886
14012
|
function getNow(nowOverride) {
|
|
13887
14013
|
var _ref;
|
|
13888
14014
|
return (_ref = nowOverride !== null && nowOverride !== void 0 ? nowOverride : inputNow) !== null && _ref !== void 0 ? _ref : new Date();
|
|
@@ -14000,13 +14126,13 @@ function dateFromDateOrTimeSecondsNumber(input) {
|
|
|
14000
14126
|
return firstExpired !== -1;
|
|
14001
14127
|
}
|
|
14002
14128
|
|
|
14003
|
-
function _array_like_to_array$
|
|
14129
|
+
function _array_like_to_array$b(arr, len) {
|
|
14004
14130
|
if (len == null || len > arr.length) len = arr.length;
|
|
14005
14131
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
14006
14132
|
return arr2;
|
|
14007
14133
|
}
|
|
14008
14134
|
function _array_without_holes$4(arr) {
|
|
14009
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
14135
|
+
if (Array.isArray(arr)) return _array_like_to_array$b(arr);
|
|
14010
14136
|
}
|
|
14011
14137
|
function _iterable_to_array$4(iter) {
|
|
14012
14138
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
@@ -14015,15 +14141,15 @@ function _non_iterable_spread$4() {
|
|
|
14015
14141
|
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
14142
|
}
|
|
14017
14143
|
function _to_consumable_array$4(arr) {
|
|
14018
|
-
return _array_without_holes$4(arr) || _iterable_to_array$4(arr) || _unsupported_iterable_to_array$
|
|
14144
|
+
return _array_without_holes$4(arr) || _iterable_to_array$4(arr) || _unsupported_iterable_to_array$b(arr) || _non_iterable_spread$4();
|
|
14019
14145
|
}
|
|
14020
|
-
function _unsupported_iterable_to_array$
|
|
14146
|
+
function _unsupported_iterable_to_array$b(o, minLen) {
|
|
14021
14147
|
if (!o) return;
|
|
14022
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
14148
|
+
if (typeof o === "string") return _array_like_to_array$b(o, minLen);
|
|
14023
14149
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
14024
14150
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
14025
14151
|
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$
|
|
14152
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$b(o, minLen);
|
|
14027
14153
|
}
|
|
14028
14154
|
/**
|
|
14029
14155
|
* Returns the day of the week for the input date.
|
|
@@ -14760,16 +14886,16 @@ var PROMISE_REF_NUMBER = 0;
|
|
|
14760
14886
|
return ref;
|
|
14761
14887
|
}
|
|
14762
14888
|
|
|
14763
|
-
function _array_like_to_array$
|
|
14889
|
+
function _array_like_to_array$a(arr, len) {
|
|
14764
14890
|
if (len == null || len > arr.length) len = arr.length;
|
|
14765
14891
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
14766
14892
|
return arr2;
|
|
14767
14893
|
}
|
|
14768
|
-
function _array_with_holes$
|
|
14894
|
+
function _array_with_holes$8(arr) {
|
|
14769
14895
|
if (Array.isArray(arr)) return arr;
|
|
14770
14896
|
}
|
|
14771
14897
|
function _array_without_holes$3(arr) {
|
|
14772
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
14898
|
+
if (Array.isArray(arr)) return _array_like_to_array$a(arr);
|
|
14773
14899
|
}
|
|
14774
14900
|
function asyncGeneratorStep$4(gen, resolve, reject, _next, _throw, key, arg) {
|
|
14775
14901
|
try {
|
|
@@ -14816,7 +14942,7 @@ function _define_property$9(obj, key, value) {
|
|
|
14816
14942
|
function _iterable_to_array$3(iter) {
|
|
14817
14943
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
14818
14944
|
}
|
|
14819
|
-
function _iterable_to_array_limit$
|
|
14945
|
+
function _iterable_to_array_limit$8(arr, i) {
|
|
14820
14946
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
14821
14947
|
if (_i == null) return;
|
|
14822
14948
|
var _arr = [];
|
|
@@ -14840,7 +14966,7 @@ function _iterable_to_array_limit$7(arr, i) {
|
|
|
14840
14966
|
}
|
|
14841
14967
|
return _arr;
|
|
14842
14968
|
}
|
|
14843
|
-
function _non_iterable_rest$
|
|
14969
|
+
function _non_iterable_rest$8() {
|
|
14844
14970
|
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
14971
|
}
|
|
14846
14972
|
function _non_iterable_spread$3() {
|
|
@@ -14880,19 +15006,19 @@ function _object_spread_props$2(target, source) {
|
|
|
14880
15006
|
}
|
|
14881
15007
|
return target;
|
|
14882
15008
|
}
|
|
14883
|
-
function _sliced_to_array$
|
|
14884
|
-
return _array_with_holes$
|
|
15009
|
+
function _sliced_to_array$8(arr, i) {
|
|
15010
|
+
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
15011
|
}
|
|
14886
15012
|
function _to_consumable_array$3(arr) {
|
|
14887
|
-
return _array_without_holes$3(arr) || _iterable_to_array$3(arr) || _unsupported_iterable_to_array$
|
|
15013
|
+
return _array_without_holes$3(arr) || _iterable_to_array$3(arr) || _unsupported_iterable_to_array$a(arr) || _non_iterable_spread$3();
|
|
14888
15014
|
}
|
|
14889
|
-
function _unsupported_iterable_to_array$
|
|
15015
|
+
function _unsupported_iterable_to_array$a(o, minLen) {
|
|
14890
15016
|
if (!o) return;
|
|
14891
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
15017
|
+
if (typeof o === "string") return _array_like_to_array$a(o, minLen);
|
|
14892
15018
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
14893
15019
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
14894
15020
|
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$
|
|
15021
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$a(o, minLen);
|
|
14896
15022
|
}
|
|
14897
15023
|
function _ts_generator$4(thisArg, body) {
|
|
14898
15024
|
var f, y, t, _ = {
|
|
@@ -15145,7 +15271,7 @@ function _ts_generator$4(thisArg, body) {
|
|
|
15145
15271
|
}, config)
|
|
15146
15272
|
];
|
|
15147
15273
|
case 1:
|
|
15148
|
-
_ref = _sliced_to_array$
|
|
15274
|
+
_ref = _sliced_to_array$8.apply(void 0, [
|
|
15149
15275
|
_state.sent(),
|
|
15150
15276
|
3
|
|
15151
15277
|
]), value = _ref[1], success = _ref[2];
|
|
@@ -16085,12 +16211,12 @@ function _ts_generator$3(thisArg, body) {
|
|
|
16085
16211
|
};
|
|
16086
16212
|
}
|
|
16087
16213
|
|
|
16088
|
-
function _array_like_to_array$
|
|
16214
|
+
function _array_like_to_array$9(arr, len) {
|
|
16089
16215
|
if (len == null || len > arr.length) len = arr.length;
|
|
16090
16216
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
16091
16217
|
return arr2;
|
|
16092
16218
|
}
|
|
16093
|
-
function _array_with_holes$
|
|
16219
|
+
function _array_with_holes$7(arr) {
|
|
16094
16220
|
if (Array.isArray(arr)) return arr;
|
|
16095
16221
|
}
|
|
16096
16222
|
function asyncGeneratorStep$2(gen, resolve, reject, _next, _throw, key, arg) {
|
|
@@ -16135,7 +16261,7 @@ function _define_property$7(obj, key, value) {
|
|
|
16135
16261
|
}
|
|
16136
16262
|
return obj;
|
|
16137
16263
|
}
|
|
16138
|
-
function _iterable_to_array_limit$
|
|
16264
|
+
function _iterable_to_array_limit$7(arr, i) {
|
|
16139
16265
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
16140
16266
|
if (_i == null) return;
|
|
16141
16267
|
var _arr = [];
|
|
@@ -16159,7 +16285,7 @@ function _iterable_to_array_limit$6(arr, i) {
|
|
|
16159
16285
|
}
|
|
16160
16286
|
return _arr;
|
|
16161
16287
|
}
|
|
16162
|
-
function _non_iterable_rest$
|
|
16288
|
+
function _non_iterable_rest$7() {
|
|
16163
16289
|
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
16290
|
}
|
|
16165
16291
|
function _object_spread$3(target) {
|
|
@@ -16196,16 +16322,16 @@ function _object_spread_props$1(target, source) {
|
|
|
16196
16322
|
}
|
|
16197
16323
|
return target;
|
|
16198
16324
|
}
|
|
16199
|
-
function _sliced_to_array$
|
|
16200
|
-
return _array_with_holes$
|
|
16325
|
+
function _sliced_to_array$7(arr, i) {
|
|
16326
|
+
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
16327
|
}
|
|
16202
|
-
function _unsupported_iterable_to_array$
|
|
16328
|
+
function _unsupported_iterable_to_array$9(o, minLen) {
|
|
16203
16329
|
if (!o) return;
|
|
16204
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
16330
|
+
if (typeof o === "string") return _array_like_to_array$9(o, minLen);
|
|
16205
16331
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
16206
16332
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
16207
16333
|
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$
|
|
16334
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$9(o, minLen);
|
|
16209
16335
|
}
|
|
16210
16336
|
function _ts_generator$2(thisArg, body) {
|
|
16211
16337
|
var f, y, t, _ = {
|
|
@@ -16323,7 +16449,7 @@ function _ts_generator$2(thisArg, body) {
|
|
|
16323
16449
|
tasks = inputTasks;
|
|
16324
16450
|
} else {
|
|
16325
16451
|
tasks = Object.entries(inputTasks).map(function(param) {
|
|
16326
|
-
var _param = _sliced_to_array$
|
|
16452
|
+
var _param = _sliced_to_array$7(param, 2), name = _param[0], run = _param[1];
|
|
16327
16453
|
var namedTask = {
|
|
16328
16454
|
name: name,
|
|
16329
16455
|
run: run
|
|
@@ -16551,7 +16677,7 @@ function _is_native_reflect_construct$2() {
|
|
|
16551
16677
|
result = 0;
|
|
16552
16678
|
break;
|
|
16553
16679
|
case 'running':
|
|
16554
|
-
result = Math.max(0, currentDuration - (
|
|
16680
|
+
result = Math.max(0, currentDuration - (Date.now() - startedAt.getTime()));
|
|
16555
16681
|
break;
|
|
16556
16682
|
case 'paused':
|
|
16557
16683
|
result = null;
|
|
@@ -16850,22 +16976,23 @@ function dateFromLogicalDate(logicalDate) {
|
|
|
16850
16976
|
return convertTimeDuration(totalMinutes, 'min', toUnit);
|
|
16851
16977
|
}
|
|
16852
16978
|
|
|
16853
|
-
function _array_like_to_array$
|
|
16979
|
+
function _array_like_to_array$8(arr, len) {
|
|
16854
16980
|
if (len == null || len > arr.length) len = arr.length;
|
|
16855
16981
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
16856
16982
|
return arr2;
|
|
16857
16983
|
}
|
|
16858
|
-
function _array_with_holes$
|
|
16984
|
+
function _array_with_holes$6(arr) {
|
|
16859
16985
|
if (Array.isArray(arr)) return arr;
|
|
16860
16986
|
}
|
|
16861
16987
|
function _instanceof(left, right) {
|
|
16988
|
+
"@swc/helpers - instanceof";
|
|
16862
16989
|
if (right != null && typeof Symbol !== "undefined" && right[Symbol.hasInstance]) {
|
|
16863
16990
|
return !!right[Symbol.hasInstance](left);
|
|
16864
16991
|
} else {
|
|
16865
16992
|
return left instanceof right;
|
|
16866
16993
|
}
|
|
16867
16994
|
}
|
|
16868
|
-
function _iterable_to_array_limit$
|
|
16995
|
+
function _iterable_to_array_limit$6(arr, i) {
|
|
16869
16996
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
16870
16997
|
if (_i == null) return;
|
|
16871
16998
|
var _arr = [];
|
|
@@ -16889,23 +17016,23 @@ function _iterable_to_array_limit$5(arr, i) {
|
|
|
16889
17016
|
}
|
|
16890
17017
|
return _arr;
|
|
16891
17018
|
}
|
|
16892
|
-
function _non_iterable_rest$
|
|
17019
|
+
function _non_iterable_rest$6() {
|
|
16893
17020
|
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
17021
|
}
|
|
16895
|
-
function _sliced_to_array$
|
|
16896
|
-
return _array_with_holes$
|
|
17022
|
+
function _sliced_to_array$6(arr, i) {
|
|
17023
|
+
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
17024
|
}
|
|
16898
17025
|
function _type_of$3(obj) {
|
|
16899
17026
|
"@swc/helpers - typeof";
|
|
16900
17027
|
return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
|
|
16901
17028
|
}
|
|
16902
|
-
function _unsupported_iterable_to_array$
|
|
17029
|
+
function _unsupported_iterable_to_array$8(o, minLen) {
|
|
16903
17030
|
if (!o) return;
|
|
16904
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
17031
|
+
if (typeof o === "string") return _array_like_to_array$8(o, minLen);
|
|
16905
17032
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
16906
17033
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
16907
17034
|
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$
|
|
17035
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$8(o, minLen);
|
|
16909
17036
|
}
|
|
16910
17037
|
/**
|
|
16911
17038
|
* Performs a deep equality comparison between two values.
|
|
@@ -16984,7 +17111,7 @@ function _compareMaps(a, b, pojoFilter) {
|
|
|
16984
17111
|
return false;
|
|
16985
17112
|
}
|
|
16986
17113
|
var firstInequalityIndex = Array.from(a.entries()).findIndex(function(param) {
|
|
16987
|
-
var _param = _sliced_to_array$
|
|
17114
|
+
var _param = _sliced_to_array$6(param, 2), key = _param[0], aValue = _param[1];
|
|
16988
17115
|
var bValue = b.get(key);
|
|
16989
17116
|
return !areEqualPOJOValuesUsingPojoFilter(aValue, bValue, pojoFilter);
|
|
16990
17117
|
});
|
|
@@ -17103,15 +17230,15 @@ function _compareObjects(a, b, pojoFilter) {
|
|
|
17103
17230
|
});
|
|
17104
17231
|
}
|
|
17105
17232
|
|
|
17106
|
-
function _array_like_to_array$
|
|
17233
|
+
function _array_like_to_array$7(arr, len) {
|
|
17107
17234
|
if (len == null || len > arr.length) len = arr.length;
|
|
17108
17235
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
17109
17236
|
return arr2;
|
|
17110
17237
|
}
|
|
17111
|
-
function _array_with_holes$
|
|
17238
|
+
function _array_with_holes$5(arr) {
|
|
17112
17239
|
if (Array.isArray(arr)) return arr;
|
|
17113
17240
|
}
|
|
17114
|
-
function _iterable_to_array_limit$
|
|
17241
|
+
function _iterable_to_array_limit$5(arr, i) {
|
|
17115
17242
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
17116
17243
|
if (_i == null) return;
|
|
17117
17244
|
var _arr = [];
|
|
@@ -17135,19 +17262,19 @@ function _iterable_to_array_limit$4(arr, i) {
|
|
|
17135
17262
|
}
|
|
17136
17263
|
return _arr;
|
|
17137
17264
|
}
|
|
17138
|
-
function _non_iterable_rest$
|
|
17265
|
+
function _non_iterable_rest$5() {
|
|
17139
17266
|
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
17267
|
}
|
|
17141
|
-
function _sliced_to_array$
|
|
17142
|
-
return _array_with_holes$
|
|
17268
|
+
function _sliced_to_array$5(arr, i) {
|
|
17269
|
+
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
17270
|
}
|
|
17144
|
-
function _unsupported_iterable_to_array$
|
|
17271
|
+
function _unsupported_iterable_to_array$7(o, minLen) {
|
|
17145
17272
|
if (!o) return;
|
|
17146
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
17273
|
+
if (typeof o === "string") return _array_like_to_array$7(o, minLen);
|
|
17147
17274
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
17148
17275
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
17149
17276
|
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$
|
|
17277
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$7(o, minLen);
|
|
17151
17278
|
}
|
|
17152
17279
|
/**
|
|
17153
17280
|
* Converts an {@link ObjectMap} into a `Map` using `Object.entries`.
|
|
@@ -17201,7 +17328,7 @@ function _unsupported_iterable_to_array$6(o, minLen) {
|
|
|
17201
17328
|
return function(object) {
|
|
17202
17329
|
var target = {};
|
|
17203
17330
|
Object.entries(object).forEach(function(param) {
|
|
17204
|
-
var _param = _sliced_to_array$
|
|
17331
|
+
var _param = _sliced_to_array$5(param, 2), key = _param[0], value = _param[1];
|
|
17205
17332
|
var newKey = mapKeyFn(key, value);
|
|
17206
17333
|
target[newKey] = value;
|
|
17207
17334
|
});
|
|
@@ -17327,15 +17454,15 @@ function _type_of$2(obj) {
|
|
|
17327
17454
|
};
|
|
17328
17455
|
}
|
|
17329
17456
|
|
|
17330
|
-
function _array_like_to_array$
|
|
17457
|
+
function _array_like_to_array$6(arr, len) {
|
|
17331
17458
|
if (len == null || len > arr.length) len = arr.length;
|
|
17332
17459
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
17333
17460
|
return arr2;
|
|
17334
17461
|
}
|
|
17335
|
-
function _array_with_holes$
|
|
17462
|
+
function _array_with_holes$4(arr) {
|
|
17336
17463
|
if (Array.isArray(arr)) return arr;
|
|
17337
17464
|
}
|
|
17338
|
-
function _iterable_to_array_limit$
|
|
17465
|
+
function _iterable_to_array_limit$4(arr, i) {
|
|
17339
17466
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
17340
17467
|
if (_i == null) return;
|
|
17341
17468
|
var _arr = [];
|
|
@@ -17359,19 +17486,19 @@ function _iterable_to_array_limit$3(arr, i) {
|
|
|
17359
17486
|
}
|
|
17360
17487
|
return _arr;
|
|
17361
17488
|
}
|
|
17362
|
-
function _non_iterable_rest$
|
|
17489
|
+
function _non_iterable_rest$4() {
|
|
17363
17490
|
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
17491
|
}
|
|
17365
|
-
function _sliced_to_array$
|
|
17366
|
-
return _array_with_holes$
|
|
17492
|
+
function _sliced_to_array$4(arr, i) {
|
|
17493
|
+
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
17494
|
}
|
|
17368
|
-
function _unsupported_iterable_to_array$
|
|
17495
|
+
function _unsupported_iterable_to_array$6(o, minLen) {
|
|
17369
17496
|
if (!o) return;
|
|
17370
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
17497
|
+
if (typeof o === "string") return _array_like_to_array$6(o, minLen);
|
|
17371
17498
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
17372
17499
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
17373
17500
|
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$
|
|
17501
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$6(o, minLen);
|
|
17375
17502
|
}
|
|
17376
17503
|
/**
|
|
17377
17504
|
* Creates bidirectional map functions (`from` and `to`) from a set of {@link ModelFieldConversions}.
|
|
@@ -17383,21 +17510,21 @@ function _unsupported_iterable_to_array$5(o, minLen) {
|
|
|
17383
17510
|
*/ function makeModelMapFunctions(fields) {
|
|
17384
17511
|
var keys = filterKeyValueTuples(fields);
|
|
17385
17512
|
var conversionsByKey = keys.map(function(param) {
|
|
17386
|
-
var _param = _sliced_to_array$
|
|
17513
|
+
var _param = _sliced_to_array$4(param, 2), key = _param[0], field = _param[1];
|
|
17387
17514
|
return [
|
|
17388
17515
|
key,
|
|
17389
17516
|
field
|
|
17390
17517
|
];
|
|
17391
17518
|
});
|
|
17392
17519
|
var fromConversions = conversionsByKey.map(function(param) {
|
|
17393
|
-
var _param = _sliced_to_array$
|
|
17520
|
+
var _param = _sliced_to_array$4(param, 2), key = _param[0], configs = _param[1];
|
|
17394
17521
|
return [
|
|
17395
17522
|
key,
|
|
17396
17523
|
configs.from
|
|
17397
17524
|
];
|
|
17398
17525
|
});
|
|
17399
17526
|
var toConversions = conversionsByKey.map(function(param) {
|
|
17400
|
-
var _param = _sliced_to_array$
|
|
17527
|
+
var _param = _sliced_to_array$4(param, 2), key = _param[0], configs = _param[1];
|
|
17401
17528
|
return [
|
|
17402
17529
|
key,
|
|
17403
17530
|
configs.to
|
|
@@ -17433,7 +17560,7 @@ function _unsupported_iterable_to_array$5(o, minLen) {
|
|
|
17433
17560
|
});
|
|
17434
17561
|
}
|
|
17435
17562
|
targetFields.forEach(function(param) {
|
|
17436
|
-
var _param = _sliced_to_array$
|
|
17563
|
+
var _param = _sliced_to_array$4(param, 2), key = _param[0], convert = _param[1];
|
|
17437
17564
|
return target[key] = convert(input[key]);
|
|
17438
17565
|
});
|
|
17439
17566
|
}
|
|
@@ -17688,13 +17815,13 @@ function _object_spread$2(target) {
|
|
|
17688
17815
|
return config ? "".concat(config.host, ":").concat(config.port) : config;
|
|
17689
17816
|
}
|
|
17690
17817
|
|
|
17691
|
-
function _array_like_to_array$
|
|
17818
|
+
function _array_like_to_array$5(arr, len) {
|
|
17692
17819
|
if (len == null || len > arr.length) len = arr.length;
|
|
17693
17820
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
17694
17821
|
return arr2;
|
|
17695
17822
|
}
|
|
17696
17823
|
function _array_without_holes$2(arr) {
|
|
17697
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
17824
|
+
if (Array.isArray(arr)) return _array_like_to_array$5(arr);
|
|
17698
17825
|
}
|
|
17699
17826
|
function _class_call_check$5(instance, Constructor) {
|
|
17700
17827
|
if (!(instance instanceof Constructor)) {
|
|
@@ -17721,15 +17848,15 @@ function _non_iterable_spread$2() {
|
|
|
17721
17848
|
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
17849
|
}
|
|
17723
17850
|
function _to_consumable_array$2(arr) {
|
|
17724
|
-
return _array_without_holes$2(arr) || _iterable_to_array$2(arr) || _unsupported_iterable_to_array$
|
|
17851
|
+
return _array_without_holes$2(arr) || _iterable_to_array$2(arr) || _unsupported_iterable_to_array$5(arr) || _non_iterable_spread$2();
|
|
17725
17852
|
}
|
|
17726
|
-
function _unsupported_iterable_to_array$
|
|
17853
|
+
function _unsupported_iterable_to_array$5(o, minLen) {
|
|
17727
17854
|
if (!o) return;
|
|
17728
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
17855
|
+
if (typeof o === "string") return _array_like_to_array$5(o, minLen);
|
|
17729
17856
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
17730
17857
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
17731
17858
|
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$
|
|
17859
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$5(o, minLen);
|
|
17733
17860
|
}
|
|
17734
17861
|
/**
|
|
17735
17862
|
* Type of relation change to perform on a collection of models.
|
|
@@ -18220,12 +18347,12 @@ function handlerFactory(readKey, options) {
|
|
|
18220
18347
|
};
|
|
18221
18348
|
}
|
|
18222
18349
|
|
|
18223
|
-
function _array_like_to_array$
|
|
18350
|
+
function _array_like_to_array$4(arr, len) {
|
|
18224
18351
|
if (len == null || len > arr.length) len = arr.length;
|
|
18225
18352
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
18226
18353
|
return arr2;
|
|
18227
18354
|
}
|
|
18228
|
-
function _array_with_holes$
|
|
18355
|
+
function _array_with_holes$3(arr) {
|
|
18229
18356
|
if (Array.isArray(arr)) return arr;
|
|
18230
18357
|
}
|
|
18231
18358
|
function _class_call_check$4(instance, Constructor) {
|
|
@@ -18259,7 +18386,7 @@ function _define_property$5(obj, key, value) {
|
|
|
18259
18386
|
}
|
|
18260
18387
|
return obj;
|
|
18261
18388
|
}
|
|
18262
|
-
function _iterable_to_array_limit$
|
|
18389
|
+
function _iterable_to_array_limit$3(arr, i) {
|
|
18263
18390
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
18264
18391
|
if (_i == null) return;
|
|
18265
18392
|
var _arr = [];
|
|
@@ -18283,19 +18410,19 @@ function _iterable_to_array_limit$2(arr, i) {
|
|
|
18283
18410
|
}
|
|
18284
18411
|
return _arr;
|
|
18285
18412
|
}
|
|
18286
|
-
function _non_iterable_rest$
|
|
18413
|
+
function _non_iterable_rest$3() {
|
|
18287
18414
|
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
18415
|
}
|
|
18289
|
-
function _sliced_to_array$
|
|
18290
|
-
return _array_with_holes$
|
|
18416
|
+
function _sliced_to_array$3(arr, i) {
|
|
18417
|
+
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
18418
|
}
|
|
18292
|
-
function _unsupported_iterable_to_array$
|
|
18419
|
+
function _unsupported_iterable_to_array$4(o, minLen) {
|
|
18293
18420
|
if (!o) return;
|
|
18294
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
18421
|
+
if (typeof o === "string") return _array_like_to_array$4(o, minLen);
|
|
18295
18422
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
18296
18423
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
18297
18424
|
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$
|
|
18425
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$4(o, minLen);
|
|
18299
18426
|
}
|
|
18300
18427
|
/**
|
|
18301
18428
|
* TypedServiceRegistry implementation.
|
|
@@ -18346,7 +18473,7 @@ function _unsupported_iterable_to_array$3(o, minLen) {
|
|
|
18346
18473
|
var instance = new TypedServiceRegistryInstance();
|
|
18347
18474
|
forEachKeyValue(config.services, {
|
|
18348
18475
|
forEach: function forEach(param) {
|
|
18349
|
-
var _param = _sliced_to_array$
|
|
18476
|
+
var _param = _sliced_to_array$3(param, 2), key = _param[0], service = _param[1];
|
|
18350
18477
|
instance.registerServiceForType(key, service);
|
|
18351
18478
|
}
|
|
18352
18479
|
});
|
|
@@ -18743,6 +18870,120 @@ function _is_native_reflect_construct() {
|
|
|
18743
18870
|
}
|
|
18744
18871
|
();
|
|
18745
18872
|
|
|
18873
|
+
function _array_like_to_array$3(arr, len) {
|
|
18874
|
+
if (len == null || len > arr.length) len = arr.length;
|
|
18875
|
+
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
18876
|
+
return arr2;
|
|
18877
|
+
}
|
|
18878
|
+
function _array_with_holes$2(arr) {
|
|
18879
|
+
if (Array.isArray(arr)) return arr;
|
|
18880
|
+
}
|
|
18881
|
+
function _iterable_to_array_limit$2(arr, i) {
|
|
18882
|
+
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
18883
|
+
if (_i == null) return;
|
|
18884
|
+
var _arr = [];
|
|
18885
|
+
var _n = true;
|
|
18886
|
+
var _d = false;
|
|
18887
|
+
var _s, _e;
|
|
18888
|
+
try {
|
|
18889
|
+
for(_i = _i.call(arr); !(_n = (_s = _i.next()).done); _n = true){
|
|
18890
|
+
_arr.push(_s.value);
|
|
18891
|
+
if (i && _arr.length === i) break;
|
|
18892
|
+
}
|
|
18893
|
+
} catch (err) {
|
|
18894
|
+
_d = true;
|
|
18895
|
+
_e = err;
|
|
18896
|
+
} finally{
|
|
18897
|
+
try {
|
|
18898
|
+
if (!_n && _i["return"] != null) _i["return"]();
|
|
18899
|
+
} finally{
|
|
18900
|
+
if (_d) throw _e;
|
|
18901
|
+
}
|
|
18902
|
+
}
|
|
18903
|
+
return _arr;
|
|
18904
|
+
}
|
|
18905
|
+
function _non_iterable_rest$2() {
|
|
18906
|
+
throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
18907
|
+
}
|
|
18908
|
+
function _sliced_to_array$2(arr, i) {
|
|
18909
|
+
return _array_with_holes$2(arr) || _iterable_to_array_limit$2(arr, i) || _unsupported_iterable_to_array$3(arr, i) || _non_iterable_rest$2();
|
|
18910
|
+
}
|
|
18911
|
+
function _unsupported_iterable_to_array$3(o, minLen) {
|
|
18912
|
+
if (!o) return;
|
|
18913
|
+
if (typeof o === "string") return _array_like_to_array$3(o, minLen);
|
|
18914
|
+
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
18915
|
+
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
18916
|
+
if (n === "Map" || n === "Set") return Array.from(n);
|
|
18917
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$3(o, minLen);
|
|
18918
|
+
}
|
|
18919
|
+
/**
|
|
18920
|
+
* Pure string-case converters that do not pull in the
|
|
18921
|
+
* {@link change-case-all} dependency.
|
|
18922
|
+
*
|
|
18923
|
+
* Use these for the common SCREAMING_SNAKE ↔ camelCase conversions
|
|
18924
|
+
* (constant-name ↔ symbol-name flips) without paying for the full
|
|
18925
|
+
* change-case bundle. For arbitrary case detection / round-tripping
|
|
18926
|
+
* across mixed inputs, prefer the dedicated package.
|
|
18927
|
+
*/ /**
|
|
18928
|
+
* Converts a SCREAMING_SNAKE_CASE string into camelCase.
|
|
18929
|
+
*
|
|
18930
|
+
* Empty segments (e.g. leading underscores in `_USER_ID`) are skipped.
|
|
18931
|
+
*
|
|
18932
|
+
* @param input The SCREAMING_SNAKE_CASE input.
|
|
18933
|
+
* @returns The camelCase form.
|
|
18934
|
+
*/ function screamingSnakeToCamelCase(input) {
|
|
18935
|
+
var parts = input.split('_').filter(function(p) {
|
|
18936
|
+
return p.length > 0;
|
|
18937
|
+
});
|
|
18938
|
+
var result = '';
|
|
18939
|
+
var _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
|
|
18940
|
+
try {
|
|
18941
|
+
for(var _iterator = parts.entries()[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
|
|
18942
|
+
var _step_value = _sliced_to_array$2(_step.value, 2), i = _step_value[0], part_ = _step_value[1];
|
|
18943
|
+
var part = part_.toLowerCase();
|
|
18944
|
+
if (i === 0) {
|
|
18945
|
+
result += part;
|
|
18946
|
+
} else {
|
|
18947
|
+
result += part.charAt(0).toUpperCase() + part.slice(1);
|
|
18948
|
+
}
|
|
18949
|
+
}
|
|
18950
|
+
} catch (err) {
|
|
18951
|
+
_didIteratorError = true;
|
|
18952
|
+
_iteratorError = err;
|
|
18953
|
+
} finally{
|
|
18954
|
+
try {
|
|
18955
|
+
if (!_iteratorNormalCompletion && _iterator.return != null) {
|
|
18956
|
+
_iterator.return();
|
|
18957
|
+
}
|
|
18958
|
+
} finally{
|
|
18959
|
+
if (_didIteratorError) {
|
|
18960
|
+
throw _iteratorError;
|
|
18961
|
+
}
|
|
18962
|
+
}
|
|
18963
|
+
}
|
|
18964
|
+
return result;
|
|
18965
|
+
}
|
|
18966
|
+
/**
|
|
18967
|
+
* Converts a camelCase or PascalCase string into SCREAMING_SNAKE_CASE.
|
|
18968
|
+
*
|
|
18969
|
+
* Each upper-case character (other than the first) is preceded by an
|
|
18970
|
+
* underscore, then the whole result is upper-cased.
|
|
18971
|
+
*
|
|
18972
|
+
* @param input The camelCase / PascalCase input.
|
|
18973
|
+
* @returns The SCREAMING_SNAKE_CASE form.
|
|
18974
|
+
*/ function camelOrPascalToScreamingSnake(input) {
|
|
18975
|
+
var out = '';
|
|
18976
|
+
for(var i = 0; i < input.length; i += 1){
|
|
18977
|
+
var ch = input.charAt(i);
|
|
18978
|
+
var isUpper = ch >= 'A' && ch <= 'Z';
|
|
18979
|
+
if (isUpper && i > 0) {
|
|
18980
|
+
out += '_';
|
|
18981
|
+
}
|
|
18982
|
+
out += ch.toUpperCase();
|
|
18983
|
+
}
|
|
18984
|
+
return out;
|
|
18985
|
+
}
|
|
18986
|
+
|
|
18746
18987
|
function _array_like_to_array$2(arr, len) {
|
|
18747
18988
|
if (len == null || len > arr.length) len = arr.length;
|
|
18748
18989
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
@@ -19076,6 +19317,55 @@ function mimeTypeForFileExtension(extension) {
|
|
|
19076
19317
|
cleanString: cleanString
|
|
19077
19318
|
};
|
|
19078
19319
|
}
|
|
19320
|
+
/**
|
|
19321
|
+
* Removes the given suffix from the input string when present, or
|
|
19322
|
+
* returns `undefined` when the input does not end with the suffix.
|
|
19323
|
+
*
|
|
19324
|
+
* Use this when callers want to detect whether the suffix was present
|
|
19325
|
+
* (vs. {@link removeFirstMatchingSuffix}, which silently passes the
|
|
19326
|
+
* input through).
|
|
19327
|
+
*
|
|
19328
|
+
* @param input The string to trim.
|
|
19329
|
+
* @param suffix The suffix to remove.
|
|
19330
|
+
* @returns The input without the suffix, or `undefined` when the input
|
|
19331
|
+
* does not end with the suffix.
|
|
19332
|
+
*/ function removeSuffix(input, suffix) {
|
|
19333
|
+
if (!input.endsWith(suffix)) return undefined;
|
|
19334
|
+
return input.slice(0, -suffix.length);
|
|
19335
|
+
}
|
|
19336
|
+
/**
|
|
19337
|
+
* Removes the first matching suffix from the input string. Returns the
|
|
19338
|
+
* input unchanged when none of the suffixes match.
|
|
19339
|
+
*
|
|
19340
|
+
* @param input The string to trim.
|
|
19341
|
+
* @param suffixes The suffixes to try in order.
|
|
19342
|
+
* @returns The input with the first matching suffix removed, or the
|
|
19343
|
+
* input unchanged when no suffix matches.
|
|
19344
|
+
*/ function removeFirstMatchingSuffix(input, suffixes) {
|
|
19345
|
+
var _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
|
|
19346
|
+
try {
|
|
19347
|
+
for(var _iterator = suffixes[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
|
|
19348
|
+
var suffix = _step.value;
|
|
19349
|
+
if (input.endsWith(suffix)) {
|
|
19350
|
+
return input.slice(0, -suffix.length);
|
|
19351
|
+
}
|
|
19352
|
+
}
|
|
19353
|
+
} catch (err) {
|
|
19354
|
+
_didIteratorError = true;
|
|
19355
|
+
_iteratorError = err;
|
|
19356
|
+
} finally{
|
|
19357
|
+
try {
|
|
19358
|
+
if (!_iteratorNormalCompletion && _iterator.return != null) {
|
|
19359
|
+
_iterator.return();
|
|
19360
|
+
}
|
|
19361
|
+
} finally{
|
|
19362
|
+
if (_didIteratorError) {
|
|
19363
|
+
throw _iteratorError;
|
|
19364
|
+
}
|
|
19365
|
+
}
|
|
19366
|
+
}
|
|
19367
|
+
return input;
|
|
19368
|
+
}
|
|
19079
19369
|
/**
|
|
19080
19370
|
* A pre-configured instance that can be used to add/remove dash prefixes from a string.
|
|
19081
19371
|
*/ var DASH_CHARACTER_PREFIX_INSTANCE = characterPrefixSuffixInstance({
|
|
@@ -19775,7 +20065,9 @@ function invertMaybeBoolean(x) {
|
|
|
19775
20065
|
* ```
|
|
19776
20066
|
*/ function reduceBooleansFn(reduceFn, emptyArrayValue) {
|
|
19777
20067
|
var rFn = function rFn(array) {
|
|
19778
|
-
return Boolean(array.reduce(
|
|
20068
|
+
return Boolean(array.reduce(function(a, b) {
|
|
20069
|
+
return reduceFn(a, b);
|
|
20070
|
+
}));
|
|
19779
20071
|
};
|
|
19780
20072
|
return emptyArrayValue != null ? function(array) {
|
|
19781
20073
|
return array.length ? rFn(array) : emptyArrayValue;
|
|
@@ -20851,6 +21143,7 @@ exports.bufferHasValidPdfMarkings = bufferHasValidPdfMarkings;
|
|
|
20851
21143
|
exports.build = build;
|
|
20852
21144
|
exports.cachedGetter = cachedGetter;
|
|
20853
21145
|
exports.calculateExpirationDate = calculateExpirationDate;
|
|
21146
|
+
exports.camelOrPascalToScreamingSnake = camelOrPascalToScreamingSnake;
|
|
20854
21147
|
exports.capLatValue = capLatValue;
|
|
20855
21148
|
exports.capitalizeFirstLetter = capitalizeFirstLetter;
|
|
20856
21149
|
exports.caseInsensitiveFilterByIndexOfDecisionFactory = caseInsensitiveFilterByIndexOfDecisionFactory;
|
|
@@ -21327,7 +21620,7 @@ exports.padStartFunction = padStartFunction;
|
|
|
21327
21620
|
exports.pairGroupValues = pairGroupValues;
|
|
21328
21621
|
exports.parseISO8601DayStringToUTCDate = parseISO8601DayStringToUTCDate;
|
|
21329
21622
|
exports.partialServerError = partialServerError;
|
|
21330
|
-
exports.passThrough =
|
|
21623
|
+
exports.passThrough = MAP_IDENTITY;
|
|
21331
21624
|
exports.percentNumberFromDecimal = percentNumberFromDecimal;
|
|
21332
21625
|
exports.percentNumberToDecimal = percentNumberToDecimal;
|
|
21333
21626
|
exports.performAsyncTask = performAsyncTask;
|
|
@@ -21406,6 +21699,7 @@ exports.removeByKeyFromBooleanKeyArray = removeByKeyFromBooleanKeyArray;
|
|
|
21406
21699
|
exports.removeCharactersAfterFirstCharacterOccurence = removeCharactersAfterFirstCharacterOccurence;
|
|
21407
21700
|
exports.removeCharactersAfterFirstCharacterOccurenceFunction = removeCharactersAfterFirstCharacterOccurenceFunction;
|
|
21408
21701
|
exports.removeExtensionFromPhoneNumber = removeExtensionFromPhoneNumber;
|
|
21702
|
+
exports.removeFirstMatchingSuffix = removeFirstMatchingSuffix;
|
|
21409
21703
|
exports.removeFromBooleanKeyArray = removeFromBooleanKeyArray;
|
|
21410
21704
|
exports.removeFromSet = removeFromSet;
|
|
21411
21705
|
exports.removeFromSetCopy = removeFromSetCopy;
|
|
@@ -21413,6 +21707,7 @@ exports.removeHttpFromUrl = removeHttpFromUrl;
|
|
|
21413
21707
|
exports.removeModelsWithKey = removeModelsWithKey;
|
|
21414
21708
|
exports.removeModelsWithSameKey = removeModelsWithSameKey;
|
|
21415
21709
|
exports.removeModifiers = removeModifiers;
|
|
21710
|
+
exports.removeSuffix = removeSuffix;
|
|
21416
21711
|
exports.removeTrailingFileTypeSeparators = removeTrailingFileTypeSeparators;
|
|
21417
21712
|
exports.removeTrailingSlashes = removeTrailingSlashes;
|
|
21418
21713
|
exports.removeValuesAtIndexesFromArrayCopy = removeValuesAtIndexesFromArrayCopy;
|
|
@@ -21443,6 +21738,7 @@ exports.runNamedAsyncTasksFunction = runNamedAsyncTasksFunction;
|
|
|
21443
21738
|
exports.safeCompareEquality = safeCompareEquality;
|
|
21444
21739
|
exports.safeEqualityComparatorFunction = safeEqualityComparatorFunction;
|
|
21445
21740
|
exports.safeFindBestIndexMatch = safeFindBestIndexMatch;
|
|
21741
|
+
exports.screamingSnakeToCamelCase = screamingSnakeToCamelCase;
|
|
21446
21742
|
exports.searchStringFilterFunction = searchStringFilterFunction;
|
|
21447
21743
|
exports.secondsToMinutesAndSeconds = secondsToMinutesAndSeconds;
|
|
21448
21744
|
exports.selectiveFieldEncryptor = selectiveFieldEncryptor;
|
|
@@ -21514,6 +21810,8 @@ exports.stringToBoolean = stringToBoolean;
|
|
|
21514
21810
|
exports.stringToLowercaseFunction = stringToLowercaseFunction;
|
|
21515
21811
|
exports.stringToUppercaseFunction = stringToUppercaseFunction;
|
|
21516
21812
|
exports.stringTrimFunction = stringTrimFunction;
|
|
21813
|
+
exports.stripObject = stripObject;
|
|
21814
|
+
exports.stripObjectFunction = stripObjectFunction;
|
|
21517
21815
|
exports.sumOfIntegersBetween = sumOfIntegersBetween;
|
|
21518
21816
|
exports.swMostLatLngPoint = swMostLatLngPoint;
|
|
21519
21817
|
exports.symmetricDifferenceArray = symmetricDifferenceArray;
|