@dereekb/util 13.4.2 → 13.5.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 +11 -36
- package/fetch/index.esm.js +11 -36
- package/fetch/package.json +2 -2
- package/index.cjs.js +255 -274
- package/index.esm.js +253 -275
- package/package.json +1 -1
- package/src/lib/contact/phone.d.ts +24 -3
- package/src/lib/string/html.d.ts +51 -0
- package/test/package.json +2 -2
package/index.cjs.js
CHANGED
|
@@ -3,34 +3,34 @@
|
|
|
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$A(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
|
-
function _array_without_holes$
|
|
12
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
11
|
+
function _array_without_holes$n(arr) {
|
|
12
|
+
if (Array.isArray(arr)) return _array_like_to_array$A(arr);
|
|
13
13
|
}
|
|
14
|
-
function _iterable_to_array$
|
|
14
|
+
function _iterable_to_array$n(iter) {
|
|
15
15
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
16
16
|
}
|
|
17
|
-
function _non_iterable_spread$
|
|
17
|
+
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
|
-
function _to_consumable_array$
|
|
21
|
-
return _array_without_holes$
|
|
20
|
+
function _to_consumable_array$n(arr) {
|
|
21
|
+
return _array_without_holes$n(arr) || _iterable_to_array$n(arr) || _unsupported_iterable_to_array$A(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$A(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$A(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$A(o, minLen);
|
|
34
34
|
}
|
|
35
35
|
// MARK: Functions
|
|
36
36
|
/**
|
|
@@ -65,7 +65,7 @@ function _unsupported_iterable_to_array$C(o, minLen) {
|
|
|
65
65
|
values
|
|
66
66
|
];
|
|
67
67
|
} else if (isIterable(values)) {
|
|
68
|
-
iterable = _to_consumable_array$
|
|
68
|
+
iterable = _to_consumable_array$n(values); // copy the array
|
|
69
69
|
} else {
|
|
70
70
|
iterable = [
|
|
71
71
|
values
|
|
@@ -393,30 +393,30 @@ function _unsupported_iterable_to_array$C(o, minLen) {
|
|
|
393
393
|
}
|
|
394
394
|
}
|
|
395
395
|
|
|
396
|
-
function _array_like_to_array$
|
|
396
|
+
function _array_like_to_array$z(arr, len) {
|
|
397
397
|
if (len == null || len > arr.length) len = arr.length;
|
|
398
398
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
399
399
|
return arr2;
|
|
400
400
|
}
|
|
401
|
-
function _array_without_holes$
|
|
402
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
401
|
+
function _array_without_holes$m(arr) {
|
|
402
|
+
if (Array.isArray(arr)) return _array_like_to_array$z(arr);
|
|
403
403
|
}
|
|
404
|
-
function _iterable_to_array$
|
|
404
|
+
function _iterable_to_array$m(iter) {
|
|
405
405
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
406
406
|
}
|
|
407
|
-
function _non_iterable_spread$
|
|
407
|
+
function _non_iterable_spread$m() {
|
|
408
408
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
409
409
|
}
|
|
410
|
-
function _to_consumable_array$
|
|
411
|
-
return _array_without_holes$
|
|
410
|
+
function _to_consumable_array$m(arr) {
|
|
411
|
+
return _array_without_holes$m(arr) || _iterable_to_array$m(arr) || _unsupported_iterable_to_array$z(arr) || _non_iterable_spread$m();
|
|
412
412
|
}
|
|
413
|
-
function _unsupported_iterable_to_array$
|
|
413
|
+
function _unsupported_iterable_to_array$z(o, minLen) {
|
|
414
414
|
if (!o) return;
|
|
415
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
415
|
+
if (typeof o === "string") return _array_like_to_array$z(o, minLen);
|
|
416
416
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
417
417
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
418
418
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
419
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
419
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$z(o, minLen);
|
|
420
420
|
}
|
|
421
421
|
// MARK: Functions
|
|
422
422
|
/**
|
|
@@ -550,7 +550,7 @@ function _unsupported_iterable_to_array$B(o, minLen) {
|
|
|
550
550
|
* @param input - array to copy, or nullish
|
|
551
551
|
* @returns a new array with the same elements, or an empty array if input is nullish
|
|
552
552
|
*/ function copyArray(input) {
|
|
553
|
-
return input != null ? _to_consumable_array$
|
|
553
|
+
return input != null ? _to_consumable_array$m(input) : [];
|
|
554
554
|
}
|
|
555
555
|
/**
|
|
556
556
|
* Pushes the same element onto the target array a specified number of times.
|
|
@@ -573,7 +573,7 @@ function _unsupported_iterable_to_array$B(o, minLen) {
|
|
|
573
573
|
*/ function mergeArrays(arrays) {
|
|
574
574
|
return mergeArraysIntoArray.apply(void 0, [
|
|
575
575
|
[]
|
|
576
|
-
].concat(_to_consumable_array$
|
|
576
|
+
].concat(_to_consumable_array$m(arrays)));
|
|
577
577
|
}
|
|
578
578
|
/**
|
|
579
579
|
* Merges the input arrays into the target array by pushing each item from each array. Creates an empty array if the target is nullish.
|
|
@@ -659,7 +659,7 @@ function _unsupported_iterable_to_array$B(o, minLen) {
|
|
|
659
659
|
var length = values.length;
|
|
660
660
|
var secondHalfStartIndex = Math.max(keepFromFront, length - (maxToTake - keepFromFront));
|
|
661
661
|
var secondHalfEndIndex = length;
|
|
662
|
-
results = _to_consumable_array$
|
|
662
|
+
results = _to_consumable_array$m(values.slice(0, keepFromFront)).concat(_to_consumable_array$m(values.slice(secondHalfStartIndex, secondHalfEndIndex)));
|
|
663
663
|
}
|
|
664
664
|
return results;
|
|
665
665
|
}
|
|
@@ -785,30 +785,30 @@ function _unsupported_iterable_to_array$B(o, minLen) {
|
|
|
785
785
|
return readKeysSetFunction(readKey)(values);
|
|
786
786
|
}
|
|
787
787
|
|
|
788
|
-
function _array_like_to_array$
|
|
788
|
+
function _array_like_to_array$y(arr, len) {
|
|
789
789
|
if (len == null || len > arr.length) len = arr.length;
|
|
790
790
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
791
791
|
return arr2;
|
|
792
792
|
}
|
|
793
|
-
function _array_without_holes$
|
|
794
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
793
|
+
function _array_without_holes$l(arr) {
|
|
794
|
+
if (Array.isArray(arr)) return _array_like_to_array$y(arr);
|
|
795
795
|
}
|
|
796
|
-
function _iterable_to_array$
|
|
796
|
+
function _iterable_to_array$l(iter) {
|
|
797
797
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
798
798
|
}
|
|
799
|
-
function _non_iterable_spread$
|
|
799
|
+
function _non_iterable_spread$l() {
|
|
800
800
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
801
801
|
}
|
|
802
|
-
function _to_consumable_array$
|
|
803
|
-
return _array_without_holes$
|
|
802
|
+
function _to_consumable_array$l(arr) {
|
|
803
|
+
return _array_without_holes$l(arr) || _iterable_to_array$l(arr) || _unsupported_iterable_to_array$y(arr) || _non_iterable_spread$l();
|
|
804
804
|
}
|
|
805
|
-
function _unsupported_iterable_to_array$
|
|
805
|
+
function _unsupported_iterable_to_array$y(o, minLen) {
|
|
806
806
|
if (!o) return;
|
|
807
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
807
|
+
if (typeof o === "string") return _array_like_to_array$y(o, minLen);
|
|
808
808
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
809
809
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
810
810
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
811
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
811
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$y(o, minLen);
|
|
812
812
|
}
|
|
813
813
|
/**
|
|
814
814
|
* Converts an {@link IterableOrValue} into a Set. Strings are treated as single values rather than character iterables.
|
|
@@ -940,7 +940,7 @@ function _unsupported_iterable_to_array$A(o, minLen) {
|
|
|
940
940
|
* @param b - Second set.
|
|
941
941
|
* @returns An array of values present in only one of the sets.
|
|
942
942
|
*/ function symmetricDifferenceArrayBetweenSets(a, b) {
|
|
943
|
-
return _to_consumable_array$
|
|
943
|
+
return _to_consumable_array$l(extraSet.symmetricDifference(a, b));
|
|
944
944
|
}
|
|
945
945
|
/**
|
|
946
946
|
* Flattens a two-dimensional array into a Set of unique values.
|
|
@@ -1311,30 +1311,30 @@ function _unsupported_iterable_to_array$A(o, minLen) {
|
|
|
1311
1311
|
return a && b ? a.size === b.size && setContainsAllValues(a, b, true) : a == b;
|
|
1312
1312
|
}
|
|
1313
1313
|
|
|
1314
|
-
function _array_like_to_array$
|
|
1314
|
+
function _array_like_to_array$x(arr, len) {
|
|
1315
1315
|
if (len == null || len > arr.length) len = arr.length;
|
|
1316
1316
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
1317
1317
|
return arr2;
|
|
1318
1318
|
}
|
|
1319
|
-
function _array_without_holes$
|
|
1320
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
1319
|
+
function _array_without_holes$k(arr) {
|
|
1320
|
+
if (Array.isArray(arr)) return _array_like_to_array$x(arr);
|
|
1321
1321
|
}
|
|
1322
|
-
function _iterable_to_array$
|
|
1322
|
+
function _iterable_to_array$k(iter) {
|
|
1323
1323
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
1324
1324
|
}
|
|
1325
|
-
function _non_iterable_spread$
|
|
1325
|
+
function _non_iterable_spread$k() {
|
|
1326
1326
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
1327
1327
|
}
|
|
1328
|
-
function _to_consumable_array$
|
|
1329
|
-
return _array_without_holes$
|
|
1328
|
+
function _to_consumable_array$k(arr) {
|
|
1329
|
+
return _array_without_holes$k(arr) || _iterable_to_array$k(arr) || _unsupported_iterable_to_array$x(arr) || _non_iterable_spread$k();
|
|
1330
1330
|
}
|
|
1331
|
-
function _unsupported_iterable_to_array$
|
|
1331
|
+
function _unsupported_iterable_to_array$x(o, minLen) {
|
|
1332
1332
|
if (!o) return;
|
|
1333
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
1333
|
+
if (typeof o === "string") return _array_like_to_array$x(o, minLen);
|
|
1334
1334
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
1335
1335
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
1336
1336
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
1337
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
1337
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$x(o, minLen);
|
|
1338
1338
|
}
|
|
1339
1339
|
/**
|
|
1340
1340
|
* Inverts the output of an arbitrary boolean-returning function.
|
|
@@ -1352,7 +1352,7 @@ function _unsupported_iterable_to_array$z(o, minLen) {
|
|
|
1352
1352
|
var _decisionFn;
|
|
1353
1353
|
var result = (_decisionFn = decisionFn).call.apply(_decisionFn, [
|
|
1354
1354
|
undefined
|
|
1355
|
-
].concat(_to_consumable_array$
|
|
1355
|
+
].concat(_to_consumable_array$k(args)));
|
|
1356
1356
|
return !result;
|
|
1357
1357
|
};
|
|
1358
1358
|
} else {
|
|
@@ -1834,30 +1834,30 @@ function chainMapFunction(a, b) {
|
|
|
1834
1834
|
}
|
|
1835
1835
|
}
|
|
1836
1836
|
|
|
1837
|
-
function _array_like_to_array$
|
|
1837
|
+
function _array_like_to_array$w(arr, len) {
|
|
1838
1838
|
if (len == null || len > arr.length) len = arr.length;
|
|
1839
1839
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
1840
1840
|
return arr2;
|
|
1841
1841
|
}
|
|
1842
|
-
function _array_without_holes$
|
|
1843
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
1842
|
+
function _array_without_holes$j(arr) {
|
|
1843
|
+
if (Array.isArray(arr)) return _array_like_to_array$w(arr);
|
|
1844
1844
|
}
|
|
1845
|
-
function _iterable_to_array$
|
|
1845
|
+
function _iterable_to_array$j(iter) {
|
|
1846
1846
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
1847
1847
|
}
|
|
1848
|
-
function _non_iterable_spread$
|
|
1848
|
+
function _non_iterable_spread$j() {
|
|
1849
1849
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
1850
1850
|
}
|
|
1851
|
-
function _to_consumable_array$
|
|
1852
|
-
return _array_without_holes$
|
|
1851
|
+
function _to_consumable_array$j(arr) {
|
|
1852
|
+
return _array_without_holes$j(arr) || _iterable_to_array$j(arr) || _unsupported_iterable_to_array$w(arr) || _non_iterable_spread$j();
|
|
1853
1853
|
}
|
|
1854
|
-
function _unsupported_iterable_to_array$
|
|
1854
|
+
function _unsupported_iterable_to_array$w(o, minLen) {
|
|
1855
1855
|
if (!o) return;
|
|
1856
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
1856
|
+
if (typeof o === "string") return _array_like_to_array$w(o, minLen);
|
|
1857
1857
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
1858
1858
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
1859
1859
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
1860
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
1860
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$w(o, minLen);
|
|
1861
1861
|
}
|
|
1862
1862
|
/**
|
|
1863
1863
|
* Concatenates multiple arrays and returns only unique values.
|
|
@@ -1868,7 +1868,7 @@ function _unsupported_iterable_to_array$y(o, minLen) {
|
|
|
1868
1868
|
for(var _len = arguments.length, arrays = new Array(_len), _key = 0; _key < _len; _key++){
|
|
1869
1869
|
arrays[_key] = arguments[_key];
|
|
1870
1870
|
}
|
|
1871
|
-
return unique(concatArrays.apply(void 0, _to_consumable_array$
|
|
1871
|
+
return unique(concatArrays.apply(void 0, _to_consumable_array$j(arrays)));
|
|
1872
1872
|
}
|
|
1873
1873
|
/**
|
|
1874
1874
|
* Flattens a 2D array and returns only unique values.
|
|
@@ -1892,7 +1892,7 @@ function _unsupported_iterable_to_array$y(o, minLen) {
|
|
|
1892
1892
|
if (exclude.length) {
|
|
1893
1893
|
removeFromSet(unique, exclude);
|
|
1894
1894
|
}
|
|
1895
|
-
return
|
|
1895
|
+
return Array.from(unique);
|
|
1896
1896
|
}
|
|
1897
1897
|
/**
|
|
1898
1898
|
* Reads and resolves keys from a {@link FilterUniqueFunctionAdditionalKeysInput}, handling both raw key arrays and structured input objects.
|
|
@@ -1914,7 +1914,7 @@ function _unsupported_iterable_to_array$y(o, minLen) {
|
|
|
1914
1914
|
if (input.values) {
|
|
1915
1915
|
addToSet(keys, input.values.map(readKey));
|
|
1916
1916
|
}
|
|
1917
|
-
return
|
|
1917
|
+
return Array.from(keys);
|
|
1918
1918
|
}
|
|
1919
1919
|
/**
|
|
1920
1920
|
* Creates a {@link FilterUniqueFunction} that deduplicates items by their computed key.
|
|
@@ -1995,14 +1995,6 @@ function allowValueOnceFilter(inputReadKey) {
|
|
|
1995
1995
|
return fn;
|
|
1996
1996
|
}
|
|
1997
1997
|
|
|
1998
|
-
function _array_like_to_array$x(arr, len) {
|
|
1999
|
-
if (len == null || len > arr.length) len = arr.length;
|
|
2000
|
-
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
2001
|
-
return arr2;
|
|
2002
|
-
}
|
|
2003
|
-
function _array_without_holes$m(arr) {
|
|
2004
|
-
if (Array.isArray(arr)) return _array_like_to_array$x(arr);
|
|
2005
|
-
}
|
|
2006
1998
|
function _class_call_check$b(instance, Constructor) {
|
|
2007
1999
|
if (!(instance instanceof Constructor)) {
|
|
2008
2000
|
throw new TypeError("Cannot call a class as a function");
|
|
@@ -2021,27 +2013,10 @@ function _define_property$l(obj, key, value) {
|
|
|
2021
2013
|
}
|
|
2022
2014
|
return obj;
|
|
2023
2015
|
}
|
|
2024
|
-
function _iterable_to_array$m(iter) {
|
|
2025
|
-
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
2026
|
-
}
|
|
2027
|
-
function _non_iterable_spread$m() {
|
|
2028
|
-
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
2029
|
-
}
|
|
2030
|
-
function _to_consumable_array$m(arr) {
|
|
2031
|
-
return _array_without_holes$m(arr) || _iterable_to_array$m(arr) || _unsupported_iterable_to_array$x(arr) || _non_iterable_spread$m();
|
|
2032
|
-
}
|
|
2033
2016
|
function _type_of$k(obj) {
|
|
2034
2017
|
"@swc/helpers - typeof";
|
|
2035
2018
|
return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
|
|
2036
2019
|
}
|
|
2037
|
-
function _unsupported_iterable_to_array$x(o, minLen) {
|
|
2038
|
-
if (!o) return;
|
|
2039
|
-
if (typeof o === "string") return _array_like_to_array$x(o, minLen);
|
|
2040
|
-
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
2041
|
-
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
2042
|
-
if (n === "Map" || n === "Set") return Array.from(n);
|
|
2043
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$x(o, minLen);
|
|
2044
|
-
}
|
|
2045
2020
|
var DEFAULT_UNKNOWN_MODEL_TYPE_STRING = 'unknown';
|
|
2046
2021
|
/**
|
|
2047
2022
|
* Reads the `id` property from a {@link UniqueModel}.
|
|
@@ -2063,7 +2038,7 @@ var DEFAULT_UNKNOWN_MODEL_TYPE_STRING = 'unknown';
|
|
|
2063
2038
|
* // result: ['a', 'b', 'c']
|
|
2064
2039
|
* ```
|
|
2065
2040
|
*/ function uniqueKeys(keys) {
|
|
2066
|
-
return
|
|
2041
|
+
return Array.from(new Set(keys));
|
|
2067
2042
|
}
|
|
2068
2043
|
function uniqueModels(models) {
|
|
2069
2044
|
var readKey = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : readUniqueModelKey;
|
|
@@ -2293,30 +2268,30 @@ function readModelKey(input) {
|
|
|
2293
2268
|
}
|
|
2294
2269
|
;
|
|
2295
2270
|
|
|
2296
|
-
function _array_like_to_array$
|
|
2271
|
+
function _array_like_to_array$v(arr, len) {
|
|
2297
2272
|
if (len == null || len > arr.length) len = arr.length;
|
|
2298
2273
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
2299
2274
|
return arr2;
|
|
2300
2275
|
}
|
|
2301
|
-
function _array_without_holes$
|
|
2302
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
2276
|
+
function _array_without_holes$i(arr) {
|
|
2277
|
+
if (Array.isArray(arr)) return _array_like_to_array$v(arr);
|
|
2303
2278
|
}
|
|
2304
|
-
function _iterable_to_array$
|
|
2279
|
+
function _iterable_to_array$i(iter) {
|
|
2305
2280
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
2306
2281
|
}
|
|
2307
|
-
function _non_iterable_spread$
|
|
2282
|
+
function _non_iterable_spread$i() {
|
|
2308
2283
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
2309
2284
|
}
|
|
2310
|
-
function _to_consumable_array$
|
|
2311
|
-
return _array_without_holes$
|
|
2285
|
+
function _to_consumable_array$i(arr) {
|
|
2286
|
+
return _array_without_holes$i(arr) || _iterable_to_array$i(arr) || _unsupported_iterable_to_array$v(arr) || _non_iterable_spread$i();
|
|
2312
2287
|
}
|
|
2313
|
-
function _unsupported_iterable_to_array$
|
|
2288
|
+
function _unsupported_iterable_to_array$v(o, minLen) {
|
|
2314
2289
|
if (!o) return;
|
|
2315
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
2290
|
+
if (typeof o === "string") return _array_like_to_array$v(o, minLen);
|
|
2316
2291
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
2317
2292
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
2318
2293
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
2319
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
2294
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$v(o, minLen);
|
|
2320
2295
|
}
|
|
2321
2296
|
/**
|
|
2322
2297
|
* Wraps a key reading function to ensure that empty string keys are not used in boolean key arrays.
|
|
@@ -2357,7 +2332,7 @@ function _unsupported_iterable_to_array$w(o, minLen) {
|
|
|
2357
2332
|
* @param readKey - Function to extract the key from a value
|
|
2358
2333
|
* @returns A new boolean key array with the value inserted
|
|
2359
2334
|
*/ function insertIntoBooleanKeyArray(array, value, readKey) {
|
|
2360
|
-
return array ? _to_consumable_array$
|
|
2335
|
+
return array ? _to_consumable_array$i(removeModelsWithSameKey(array, value, readBooleanKeySafetyWrap(readKey))).concat([
|
|
2361
2336
|
value
|
|
2362
2337
|
]) : [
|
|
2363
2338
|
value
|
|
@@ -2423,13 +2398,13 @@ function _unsupported_iterable_to_array$w(o, minLen) {
|
|
|
2423
2398
|
return x ? x : undefined;
|
|
2424
2399
|
});
|
|
2425
2400
|
|
|
2426
|
-
function _array_like_to_array$
|
|
2401
|
+
function _array_like_to_array$u(arr, len) {
|
|
2427
2402
|
if (len == null || len > arr.length) len = arr.length;
|
|
2428
2403
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
2429
2404
|
return arr2;
|
|
2430
2405
|
}
|
|
2431
|
-
function _array_without_holes$
|
|
2432
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
2406
|
+
function _array_without_holes$h(arr) {
|
|
2407
|
+
if (Array.isArray(arr)) return _array_like_to_array$u(arr);
|
|
2433
2408
|
}
|
|
2434
2409
|
function _class_call_check$a(instance, Constructor) {
|
|
2435
2410
|
if (!(instance instanceof Constructor)) {
|
|
@@ -2462,22 +2437,22 @@ function _define_property$k(obj, key, value) {
|
|
|
2462
2437
|
}
|
|
2463
2438
|
return obj;
|
|
2464
2439
|
}
|
|
2465
|
-
function _iterable_to_array$
|
|
2440
|
+
function _iterable_to_array$h(iter) {
|
|
2466
2441
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
2467
2442
|
}
|
|
2468
|
-
function _non_iterable_spread$
|
|
2443
|
+
function _non_iterable_spread$h() {
|
|
2469
2444
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
2470
2445
|
}
|
|
2471
|
-
function _to_consumable_array$
|
|
2472
|
-
return _array_without_holes$
|
|
2446
|
+
function _to_consumable_array$h(arr) {
|
|
2447
|
+
return _array_without_holes$h(arr) || _iterable_to_array$h(arr) || _unsupported_iterable_to_array$u(arr) || _non_iterable_spread$h();
|
|
2473
2448
|
}
|
|
2474
|
-
function _unsupported_iterable_to_array$
|
|
2449
|
+
function _unsupported_iterable_to_array$u(o, minLen) {
|
|
2475
2450
|
if (!o) return;
|
|
2476
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
2451
|
+
if (typeof o === "string") return _array_like_to_array$u(o, minLen);
|
|
2477
2452
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
2478
2453
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
2479
2454
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
2480
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
2455
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$u(o, minLen);
|
|
2481
2456
|
}
|
|
2482
2457
|
/**
|
|
2483
2458
|
* Set that is implemented internally using a Map, and input values have their keys read.
|
|
@@ -2659,7 +2634,7 @@ function _unsupported_iterable_to_array$v(o, minLen) {
|
|
|
2659
2634
|
* @returns An array of all stored values.
|
|
2660
2635
|
*/ key: "valuesArray",
|
|
2661
2636
|
value: function valuesArray() {
|
|
2662
|
-
return _to_consumable_array$
|
|
2637
|
+
return _to_consumable_array$h(this._map.values());
|
|
2663
2638
|
}
|
|
2664
2639
|
},
|
|
2665
2640
|
{
|
|
@@ -2673,30 +2648,30 @@ function _unsupported_iterable_to_array$v(o, minLen) {
|
|
|
2673
2648
|
}
|
|
2674
2649
|
();
|
|
2675
2650
|
|
|
2676
|
-
function _array_like_to_array$
|
|
2651
|
+
function _array_like_to_array$t(arr, len) {
|
|
2677
2652
|
if (len == null || len > arr.length) len = arr.length;
|
|
2678
2653
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
2679
2654
|
return arr2;
|
|
2680
2655
|
}
|
|
2681
|
-
function _array_without_holes$
|
|
2682
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
2656
|
+
function _array_without_holes$g(arr) {
|
|
2657
|
+
if (Array.isArray(arr)) return _array_like_to_array$t(arr);
|
|
2683
2658
|
}
|
|
2684
|
-
function _iterable_to_array$
|
|
2659
|
+
function _iterable_to_array$g(iter) {
|
|
2685
2660
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
2686
2661
|
}
|
|
2687
|
-
function _non_iterable_spread$
|
|
2662
|
+
function _non_iterable_spread$g() {
|
|
2688
2663
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
2689
2664
|
}
|
|
2690
|
-
function _to_consumable_array$
|
|
2691
|
-
return _array_without_holes$
|
|
2665
|
+
function _to_consumable_array$g(arr) {
|
|
2666
|
+
return _array_without_holes$g(arr) || _iterable_to_array$g(arr) || _unsupported_iterable_to_array$t(arr) || _non_iterable_spread$g();
|
|
2692
2667
|
}
|
|
2693
|
-
function _unsupported_iterable_to_array$
|
|
2668
|
+
function _unsupported_iterable_to_array$t(o, minLen) {
|
|
2694
2669
|
if (!o) return;
|
|
2695
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
2670
|
+
if (typeof o === "string") return _array_like_to_array$t(o, minLen);
|
|
2696
2671
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
2697
2672
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
2698
2673
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
2699
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
2674
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$t(o, minLen);
|
|
2700
2675
|
}
|
|
2701
2676
|
var SORT_VALUE_LESS_THAN = -1;
|
|
2702
2677
|
var SORT_VALUE_GREATER_THAN = 1;
|
|
@@ -2752,7 +2727,7 @@ function reverseCompareFn(compareFn) {
|
|
|
2752
2727
|
var doSort = sortWith != null;
|
|
2753
2728
|
var result = values;
|
|
2754
2729
|
if (alwaysReturnCopy || sortOnCopy && doSort) {
|
|
2755
|
-
result = _to_consumable_array$
|
|
2730
|
+
result = _to_consumable_array$g(values);
|
|
2756
2731
|
}
|
|
2757
2732
|
if (doSort) {
|
|
2758
2733
|
result = result.sort(sortWith);
|
|
@@ -2832,7 +2807,7 @@ function reverseCompareFn(compareFn) {
|
|
|
2832
2807
|
};
|
|
2833
2808
|
}
|
|
2834
2809
|
|
|
2835
|
-
function _array_like_to_array$
|
|
2810
|
+
function _array_like_to_array$s(arr, len) {
|
|
2836
2811
|
if (len == null || len > arr.length) len = arr.length;
|
|
2837
2812
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
2838
2813
|
return arr2;
|
|
@@ -2840,10 +2815,10 @@ function _array_like_to_array$t(arr, len) {
|
|
|
2840
2815
|
function _array_with_holes$k(arr) {
|
|
2841
2816
|
if (Array.isArray(arr)) return arr;
|
|
2842
2817
|
}
|
|
2843
|
-
function _array_without_holes$
|
|
2844
|
-
if (Array.isArray(arr)) return _array_like_to_array$
|
|
2818
|
+
function _array_without_holes$f(arr) {
|
|
2819
|
+
if (Array.isArray(arr)) return _array_like_to_array$s(arr);
|
|
2845
2820
|
}
|
|
2846
|
-
function _iterable_to_array$
|
|
2821
|
+
function _iterable_to_array$f(iter) {
|
|
2847
2822
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
2848
2823
|
}
|
|
2849
2824
|
function _iterable_to_array_limit$k(arr, i) {
|
|
@@ -2873,22 +2848,22 @@ function _iterable_to_array_limit$k(arr, i) {
|
|
|
2873
2848
|
function _non_iterable_rest$k() {
|
|
2874
2849
|
throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
2875
2850
|
}
|
|
2876
|
-
function _non_iterable_spread$
|
|
2851
|
+
function _non_iterable_spread$f() {
|
|
2877
2852
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
2878
2853
|
}
|
|
2879
2854
|
function _sliced_to_array$k(arr, i) {
|
|
2880
|
-
return _array_with_holes$k(arr) || _iterable_to_array_limit$k(arr, i) || _unsupported_iterable_to_array$
|
|
2855
|
+
return _array_with_holes$k(arr) || _iterable_to_array_limit$k(arr, i) || _unsupported_iterable_to_array$s(arr, i) || _non_iterable_rest$k();
|
|
2881
2856
|
}
|
|
2882
|
-
function _to_consumable_array$
|
|
2883
|
-
return _array_without_holes$
|
|
2857
|
+
function _to_consumable_array$f(arr) {
|
|
2858
|
+
return _array_without_holes$f(arr) || _iterable_to_array$f(arr) || _unsupported_iterable_to_array$s(arr) || _non_iterable_spread$f();
|
|
2884
2859
|
}
|
|
2885
|
-
function _unsupported_iterable_to_array$
|
|
2860
|
+
function _unsupported_iterable_to_array$s(o, minLen) {
|
|
2886
2861
|
if (!o) return;
|
|
2887
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
2862
|
+
if (typeof o === "string") return _array_like_to_array$s(o, minLen);
|
|
2888
2863
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
2889
2864
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
2890
2865
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
2891
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
2866
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$s(o, minLen);
|
|
2892
2867
|
}
|
|
2893
2868
|
/**
|
|
2894
2869
|
* Splits the input array into batches of a maximum size. Each batch carries its zero-based index as `.i`.
|
|
@@ -2904,7 +2879,7 @@ function _unsupported_iterable_to_array$t(o, minLen) {
|
|
|
2904
2879
|
* // result[1] => ['c', 'd'], result[1].i => 1
|
|
2905
2880
|
* ```
|
|
2906
2881
|
*/ function batch(input, batchSize) {
|
|
2907
|
-
var array = _to_consumable_array$
|
|
2882
|
+
var array = _to_consumable_array$f(input); // Copy array before splicing it.
|
|
2908
2883
|
var batches = [];
|
|
2909
2884
|
var i = 0;
|
|
2910
2885
|
while(array.length > 0){
|
|
@@ -3007,7 +2982,7 @@ function _unsupported_iterable_to_array$t(o, minLen) {
|
|
|
3007
2982
|
newItems.push(getValue());
|
|
3008
2983
|
}
|
|
3009
2984
|
});
|
|
3010
|
-
return _to_consumable_array$
|
|
2985
|
+
return _to_consumable_array$f(restoredOrder).concat(_to_consumable_array$f(newItems)).filter(function(x) {
|
|
3011
2986
|
return x !== undefined;
|
|
3012
2987
|
}); // Allow null to be passed.
|
|
3013
2988
|
}
|
|
@@ -3025,7 +3000,7 @@ function _unsupported_iterable_to_array$t(o, minLen) {
|
|
|
3025
3000
|
var a = arguments.length > 0 && arguments[0] !== void 0 ? arguments[0] : [], b = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : [], _ref = arguments.length > 2 ? arguments[2] : void 0, groupKeyFn = _ref.groupKeyFn, isEqual = _ref.isEqual;
|
|
3026
3001
|
var areDifferent = false;
|
|
3027
3002
|
if (a.length === b.length) {
|
|
3028
|
-
var pairs = pairGroupValues(_to_consumable_array$
|
|
3003
|
+
var pairs = pairGroupValues(_to_consumable_array$f(a).concat(_to_consumable_array$f(b)), groupKeyFn);
|
|
3029
3004
|
if (pairs.unpaired.length > 0) {
|
|
3030
3005
|
// Any unpaired items means there is a difference.
|
|
3031
3006
|
areDifferent = true;
|
|
@@ -3134,7 +3109,7 @@ function makeValuesGroupMap(values, groupKeyFn) {
|
|
|
3134
3109
|
return map;
|
|
3135
3110
|
}
|
|
3136
3111
|
|
|
3137
|
-
function _array_like_to_array$
|
|
3112
|
+
function _array_like_to_array$r(arr, len) {
|
|
3138
3113
|
if (len == null || len > arr.length) len = arr.length;
|
|
3139
3114
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
3140
3115
|
return arr2;
|
|
@@ -3142,12 +3117,6 @@ function _array_like_to_array$s(arr, len) {
|
|
|
3142
3117
|
function _array_with_holes$j(arr) {
|
|
3143
3118
|
if (Array.isArray(arr)) return arr;
|
|
3144
3119
|
}
|
|
3145
|
-
function _array_without_holes$h(arr) {
|
|
3146
|
-
if (Array.isArray(arr)) return _array_like_to_array$s(arr);
|
|
3147
|
-
}
|
|
3148
|
-
function _iterable_to_array$h(iter) {
|
|
3149
|
-
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
3150
|
-
}
|
|
3151
3120
|
function _iterable_to_array_limit$j(arr, i) {
|
|
3152
3121
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
3153
3122
|
if (_i == null) return;
|
|
@@ -3175,22 +3144,16 @@ function _iterable_to_array_limit$j(arr, i) {
|
|
|
3175
3144
|
function _non_iterable_rest$j() {
|
|
3176
3145
|
throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
3177
3146
|
}
|
|
3178
|
-
function _non_iterable_spread$h() {
|
|
3179
|
-
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
3180
|
-
}
|
|
3181
3147
|
function _sliced_to_array$j(arr, i) {
|
|
3182
|
-
return _array_with_holes$j(arr) || _iterable_to_array_limit$j(arr, i) || _unsupported_iterable_to_array$
|
|
3148
|
+
return _array_with_holes$j(arr) || _iterable_to_array_limit$j(arr, i) || _unsupported_iterable_to_array$r(arr, i) || _non_iterable_rest$j();
|
|
3183
3149
|
}
|
|
3184
|
-
function
|
|
3185
|
-
return _array_without_holes$h(arr) || _iterable_to_array$h(arr) || _unsupported_iterable_to_array$s(arr) || _non_iterable_spread$h();
|
|
3186
|
-
}
|
|
3187
|
-
function _unsupported_iterable_to_array$s(o, minLen) {
|
|
3150
|
+
function _unsupported_iterable_to_array$r(o, minLen) {
|
|
3188
3151
|
if (!o) return;
|
|
3189
|
-
if (typeof o === "string") return _array_like_to_array$
|
|
3152
|
+
if (typeof o === "string") return _array_like_to_array$r(o, minLen);
|
|
3190
3153
|
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
3191
3154
|
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
3192
3155
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
3193
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$
|
|
3156
|
+
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$r(o, minLen);
|
|
3194
3157
|
}
|
|
3195
3158
|
/**
|
|
3196
3159
|
* Combines multiple Maps into a single Map. Later maps override earlier values for the same key.
|
|
@@ -3228,7 +3191,7 @@ function _unsupported_iterable_to_array$s(o, minLen) {
|
|
|
3228
3191
|
* @param map - The map to convert
|
|
3229
3192
|
* @returns An array of [key, value] tuples
|
|
3230
3193
|
*/ function mapToTuples(map) {
|
|
3231
|
-
return
|
|
3194
|
+
return Array.from(map.entries());
|
|
3232
3195
|
}
|
|
3233
3196
|
/**
|
|
3234
3197
|
* Expands a Map with array values into individual key/value tuples.
|
|
@@ -5939,31 +5902,6 @@ function caseInsensitiveString(input) {
|
|
|
5939
5902
|
}
|
|
5940
5903
|
}
|
|
5941
5904
|
|
|
5942
|
-
function _array_like_to_array$r(arr, len) {
|
|
5943
|
-
if (len == null || len > arr.length) len = arr.length;
|
|
5944
|
-
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
5945
|
-
return arr2;
|
|
5946
|
-
}
|
|
5947
|
-
function _array_without_holes$g(arr) {
|
|
5948
|
-
if (Array.isArray(arr)) return _array_like_to_array$r(arr);
|
|
5949
|
-
}
|
|
5950
|
-
function _iterable_to_array$g(iter) {
|
|
5951
|
-
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
5952
|
-
}
|
|
5953
|
-
function _non_iterable_spread$g() {
|
|
5954
|
-
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
5955
|
-
}
|
|
5956
|
-
function _to_consumable_array$g(arr) {
|
|
5957
|
-
return _array_without_holes$g(arr) || _iterable_to_array$g(arr) || _unsupported_iterable_to_array$r(arr) || _non_iterable_spread$g();
|
|
5958
|
-
}
|
|
5959
|
-
function _unsupported_iterable_to_array$r(o, minLen) {
|
|
5960
|
-
if (!o) return;
|
|
5961
|
-
if (typeof o === "string") return _array_like_to_array$r(o, minLen);
|
|
5962
|
-
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
5963
|
-
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
5964
|
-
if (n === "Map" || n === "Set") return Array.from(n);
|
|
5965
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$r(o, minLen);
|
|
5966
|
-
}
|
|
5967
5905
|
/**
|
|
5968
5906
|
* Compares two string arrays and returns whether they contain different values, ignoring case.
|
|
5969
5907
|
*
|
|
@@ -6019,7 +5957,7 @@ function _unsupported_iterable_to_array$r(o, minLen) {
|
|
|
6019
5957
|
* @param values - iterable of strings to deduplicate
|
|
6020
5958
|
* @returns an array of unique lowercase strings
|
|
6021
5959
|
*/ function uniqueCaseInsensitiveStrings(values) {
|
|
6022
|
-
return
|
|
5960
|
+
return Array.from(uniqueCaseInsensitiveStringsSet(values));
|
|
6023
5961
|
}
|
|
6024
5962
|
/**
|
|
6025
5963
|
* Returns a {@link Set} of unique lowercase strings from the input, compared case-insensitively.
|
|
@@ -7916,10 +7854,10 @@ function _array_like_to_array$n(arr, len) {
|
|
|
7916
7854
|
function _array_with_holes$f(arr) {
|
|
7917
7855
|
if (Array.isArray(arr)) return arr;
|
|
7918
7856
|
}
|
|
7919
|
-
function _array_without_holes$
|
|
7857
|
+
function _array_without_holes$e(arr) {
|
|
7920
7858
|
if (Array.isArray(arr)) return _array_like_to_array$n(arr);
|
|
7921
7859
|
}
|
|
7922
|
-
function _iterable_to_array$
|
|
7860
|
+
function _iterable_to_array$e(iter) {
|
|
7923
7861
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
7924
7862
|
}
|
|
7925
7863
|
function _iterable_to_array_limit$f(arr, i) {
|
|
@@ -7949,14 +7887,14 @@ function _iterable_to_array_limit$f(arr, i) {
|
|
|
7949
7887
|
function _non_iterable_rest$f() {
|
|
7950
7888
|
throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
7951
7889
|
}
|
|
7952
|
-
function _non_iterable_spread$
|
|
7890
|
+
function _non_iterable_spread$e() {
|
|
7953
7891
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
7954
7892
|
}
|
|
7955
7893
|
function _sliced_to_array$f(arr, i) {
|
|
7956
7894
|
return _array_with_holes$f(arr) || _iterable_to_array_limit$f(arr, i) || _unsupported_iterable_to_array$n(arr, i) || _non_iterable_rest$f();
|
|
7957
7895
|
}
|
|
7958
|
-
function _to_consumable_array$
|
|
7959
|
-
return _array_without_holes$
|
|
7896
|
+
function _to_consumable_array$e(arr) {
|
|
7897
|
+
return _array_without_holes$e(arr) || _iterable_to_array$e(arr) || _unsupported_iterable_to_array$n(arr) || _non_iterable_spread$e();
|
|
7960
7898
|
}
|
|
7961
7899
|
function _unsupported_iterable_to_array$n(o, minLen) {
|
|
7962
7900
|
if (!o) return;
|
|
@@ -7982,7 +7920,7 @@ function _unsupported_iterable_to_array$n(o, minLen) {
|
|
|
7982
7920
|
}
|
|
7983
7921
|
var _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
|
|
7984
7922
|
try {
|
|
7985
|
-
for(var _iterator = _to_consumable_array$
|
|
7923
|
+
for(var _iterator = _to_consumable_array$e(input).entries()[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
|
|
7986
7924
|
var _step_value = _sliced_to_array$f(_step.value, 2), i = _step_value[0], char = _step_value[1];
|
|
7987
7925
|
if (char === find) {
|
|
7988
7926
|
if (first === -1) {
|
|
@@ -8115,7 +8053,7 @@ function replaceCharacterAtIndexIf(input, index, replacement, decision) {
|
|
|
8115
8053
|
var record = {};
|
|
8116
8054
|
var _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
|
|
8117
8055
|
try {
|
|
8118
|
-
for(var _iterator = _to_consumable_array$
|
|
8056
|
+
for(var _iterator = _to_consumable_array$e(chars).entries()[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
|
|
8119
8057
|
var _step_value = _sliced_to_array$f(_step.value, 2), i = _step_value[0], char = _step_value[1];
|
|
8120
8058
|
record[char] = i;
|
|
8121
8059
|
}
|
|
@@ -8144,7 +8082,7 @@ function _array_like_to_array$m(arr, len) {
|
|
|
8144
8082
|
function _array_with_holes$e(arr) {
|
|
8145
8083
|
if (Array.isArray(arr)) return arr;
|
|
8146
8084
|
}
|
|
8147
|
-
function _array_without_holes$
|
|
8085
|
+
function _array_without_holes$d(arr) {
|
|
8148
8086
|
if (Array.isArray(arr)) return _array_like_to_array$m(arr);
|
|
8149
8087
|
}
|
|
8150
8088
|
function _instanceof$3(left, right) {
|
|
@@ -8154,7 +8092,7 @@ function _instanceof$3(left, right) {
|
|
|
8154
8092
|
return left instanceof right;
|
|
8155
8093
|
}
|
|
8156
8094
|
}
|
|
8157
|
-
function _iterable_to_array$
|
|
8095
|
+
function _iterable_to_array$d(iter) {
|
|
8158
8096
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
8159
8097
|
}
|
|
8160
8098
|
function _iterable_to_array_limit$e(arr, i) {
|
|
@@ -8184,14 +8122,14 @@ function _iterable_to_array_limit$e(arr, i) {
|
|
|
8184
8122
|
function _non_iterable_rest$e() {
|
|
8185
8123
|
throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
8186
8124
|
}
|
|
8187
|
-
function _non_iterable_spread$
|
|
8125
|
+
function _non_iterable_spread$d() {
|
|
8188
8126
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
8189
8127
|
}
|
|
8190
8128
|
function _sliced_to_array$e(arr, i) {
|
|
8191
8129
|
return _array_with_holes$e(arr) || _iterable_to_array_limit$e(arr, i) || _unsupported_iterable_to_array$m(arr, i) || _non_iterable_rest$e();
|
|
8192
8130
|
}
|
|
8193
|
-
function _to_consumable_array$
|
|
8194
|
-
return _array_without_holes$
|
|
8131
|
+
function _to_consumable_array$d(arr) {
|
|
8132
|
+
return _array_without_holes$d(arr) || _iterable_to_array$d(arr) || _unsupported_iterable_to_array$m(arr) || _non_iterable_spread$d();
|
|
8195
8133
|
}
|
|
8196
8134
|
function _unsupported_iterable_to_array$m(o, minLen) {
|
|
8197
8135
|
if (!o) return;
|
|
@@ -8316,7 +8254,7 @@ function _unsupported_iterable_to_array$m(o, minLen) {
|
|
|
8316
8254
|
var occurrences = [];
|
|
8317
8255
|
var _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
|
|
8318
8256
|
try {
|
|
8319
|
-
for(var _iterator = _to_consumable_array$
|
|
8257
|
+
for(var _iterator = _to_consumable_array$d(input).entries()[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
|
|
8320
8258
|
var _step_value = _sliced_to_array$e(_step.value, 2), i = _step_value[0], char = _step_value[1];
|
|
8321
8259
|
if (characterSet.has(char)) {
|
|
8322
8260
|
occurrences.push(i);
|
|
@@ -8438,11 +8376,11 @@ function _unsupported_iterable_to_array$m(o, minLen) {
|
|
|
8438
8376
|
|
|
8439
8377
|
/**
|
|
8440
8378
|
* Regular expression for validating E.164 phone numbers.
|
|
8441
|
-
* Validates numbers that start with a + followed by
|
|
8379
|
+
* Validates numbers that start with a + followed by 7-15 digits.
|
|
8442
8380
|
* The first digit after the + must be 1-9 (not 0).
|
|
8443
8381
|
*
|
|
8444
8382
|
* Requires the + to be provided.
|
|
8445
|
-
*/ var E164PHONE_NUMBER_REGEX = /^\+[1-9]\d{
|
|
8383
|
+
*/ var E164PHONE_NUMBER_REGEX = /^\+[1-9]\d{6,14}$/;
|
|
8446
8384
|
/**
|
|
8447
8385
|
* Validates if the input string is a valid E.164 phone number.
|
|
8448
8386
|
*
|
|
@@ -8455,18 +8393,18 @@ function _unsupported_iterable_to_array$m(o, minLen) {
|
|
|
8455
8393
|
}
|
|
8456
8394
|
/**
|
|
8457
8395
|
* Regular expression for validating E.164 phone numbers with an optional extension.
|
|
8458
|
-
* Validates numbers in the format +number or +number#extension.
|
|
8396
|
+
* Validates numbers with 7-15 digits in the format +number or +number#extension.
|
|
8459
8397
|
* The extension part is 1-6 digits following a # character.
|
|
8460
8398
|
*
|
|
8461
8399
|
* Requires the + to be provided.
|
|
8462
|
-
*/ var E164PHONE_NUMBER_WITH_OPTIONAL_EXTENSION_REGEX = /^\+[1-9]\d{
|
|
8400
|
+
*/ var E164PHONE_NUMBER_WITH_OPTIONAL_EXTENSION_REGEX = /^\+[1-9]\d{6,14}(#\d{1,6})?$/;
|
|
8463
8401
|
/**
|
|
8464
8402
|
* Regular expression for validating E.164 phone numbers that must include an extension.
|
|
8465
|
-
* Validates numbers strictly in the format +number#extension.
|
|
8403
|
+
* Validates numbers with 7-15 digits strictly in the format +number#extension.
|
|
8466
8404
|
* The extension part is 1-6 digits following a # character.
|
|
8467
8405
|
*
|
|
8468
8406
|
* Requires the + to be provided and the extension part.
|
|
8469
|
-
*/ var E164PHONE_NUMBER_WITH_EXTENSION_REGEX = /^\+[1-9]\d{
|
|
8407
|
+
*/ var E164PHONE_NUMBER_WITH_EXTENSION_REGEX = /^\+[1-9]\d{6,14}(#\d{1,6})$/;
|
|
8470
8408
|
/**
|
|
8471
8409
|
* Validates if the input string is a valid E.164 phone number with an extension.
|
|
8472
8410
|
* The phone number must be in the format +number#extension.
|
|
@@ -8522,6 +8460,42 @@ function _unsupported_iterable_to_array$m(o, minLen) {
|
|
|
8522
8460
|
*/ function e164PhoneNumberFromE164PhoneNumberExtensionPair(input) {
|
|
8523
8461
|
return input.extension ? "".concat(input.number, "#").concat(input.extension) : input.number;
|
|
8524
8462
|
}
|
|
8463
|
+
/**
|
|
8464
|
+
* Regex matching common phone number formatting characters to strip: parentheses, hyphens, spaces, and dots.
|
|
8465
|
+
*/ var PHONE_NUMBER_FORMATTING_CHARACTERS_REGEX = /[() \-\.]/g;
|
|
8466
|
+
/**
|
|
8467
|
+
* Attempts to convert a raw phone number string into a valid {@link E164PhoneNumber}.
|
|
8468
|
+
*
|
|
8469
|
+
* Strips common formatting characters (parentheses, hyphens, spaces, dots), then checks
|
|
8470
|
+
* if the result is already valid E.164. If not, prepends the given country code and
|
|
8471
|
+
* validates again.
|
|
8472
|
+
*
|
|
8473
|
+
* @param input - A raw phone number string, possibly with formatting (e.g. `'(720)6620850'`, `'720-662-0850'`)
|
|
8474
|
+
* @param defaultCountryCode - The country calling code to prepend if the number lacks one (default: `'1'` for US/Canada)
|
|
8475
|
+
* @returns The corrected {@link E164PhoneNumber}, or `undefined` if the input cannot be converted
|
|
8476
|
+
*
|
|
8477
|
+
* @example
|
|
8478
|
+
* ```typescript
|
|
8479
|
+
* tryConvertToE164PhoneNumber('(720)6620850'); // '+17206620850'
|
|
8480
|
+
* tryConvertToE164PhoneNumber('720-662-0850'); // '+17206620850'
|
|
8481
|
+
* tryConvertToE164PhoneNumber('+17206620850'); // '+17206620850'
|
|
8482
|
+
* tryConvertToE164PhoneNumber('7206620850', '44'); // '+447206620850'
|
|
8483
|
+
* tryConvertToE164PhoneNumber('abc'); // undefined
|
|
8484
|
+
* ```
|
|
8485
|
+
*/ function tryConvertToE164PhoneNumber(input) {
|
|
8486
|
+
var defaultCountryCode = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : '1';
|
|
8487
|
+
var stripped = input.replace(PHONE_NUMBER_FORMATTING_CHARACTERS_REGEX, '');
|
|
8488
|
+
var result;
|
|
8489
|
+
if (isE164PhoneNumber(stripped, false)) {
|
|
8490
|
+
result = stripped;
|
|
8491
|
+
} else {
|
|
8492
|
+
var withCountryCode = "+".concat(defaultCountryCode).concat(stripped);
|
|
8493
|
+
if (isE164PhoneNumber(withCountryCode, false)) {
|
|
8494
|
+
result = withCountryCode;
|
|
8495
|
+
}
|
|
8496
|
+
}
|
|
8497
|
+
return result;
|
|
8498
|
+
}
|
|
8525
8499
|
|
|
8526
8500
|
/**
|
|
8527
8501
|
* Creates a {@link DecisionFunction} that always returns the given boolean, regardless of input.
|
|
@@ -9293,10 +9267,10 @@ function _array_like_to_array$k(arr, len) {
|
|
|
9293
9267
|
function _array_with_holes$c(arr) {
|
|
9294
9268
|
if (Array.isArray(arr)) return arr;
|
|
9295
9269
|
}
|
|
9296
|
-
function _array_without_holes$
|
|
9270
|
+
function _array_without_holes$c(arr) {
|
|
9297
9271
|
if (Array.isArray(arr)) return _array_like_to_array$k(arr);
|
|
9298
9272
|
}
|
|
9299
|
-
function _iterable_to_array$
|
|
9273
|
+
function _iterable_to_array$c(iter) {
|
|
9300
9274
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
9301
9275
|
}
|
|
9302
9276
|
function _iterable_to_array_limit$c(arr, i) {
|
|
@@ -9326,14 +9300,14 @@ function _iterable_to_array_limit$c(arr, i) {
|
|
|
9326
9300
|
function _non_iterable_rest$c() {
|
|
9327
9301
|
throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
9328
9302
|
}
|
|
9329
|
-
function _non_iterable_spread$
|
|
9303
|
+
function _non_iterable_spread$c() {
|
|
9330
9304
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
9331
9305
|
}
|
|
9332
9306
|
function _sliced_to_array$c(arr, i) {
|
|
9333
9307
|
return _array_with_holes$c(arr) || _iterable_to_array_limit$c(arr, i) || _unsupported_iterable_to_array$k(arr, i) || _non_iterable_rest$c();
|
|
9334
9308
|
}
|
|
9335
|
-
function _to_consumable_array$
|
|
9336
|
-
return _array_without_holes$
|
|
9309
|
+
function _to_consumable_array$c(arr) {
|
|
9310
|
+
return _array_without_holes$c(arr) || _iterable_to_array$c(arr) || _unsupported_iterable_to_array$k(arr) || _non_iterable_spread$c();
|
|
9337
9311
|
}
|
|
9338
9312
|
function _unsupported_iterable_to_array$k(o, minLen) {
|
|
9339
9313
|
if (!o) return;
|
|
@@ -9505,7 +9479,7 @@ function _unsupported_iterable_to_array$k(o, minLen) {
|
|
|
9505
9479
|
var baseWebUrl = removeWebProtocolPrefix(baseWebsiteUrl(basePath)); // remove prefix to prevent issues with slash paths
|
|
9506
9480
|
var webUrl = mergeSlashPaths([
|
|
9507
9481
|
baseWebUrl
|
|
9508
|
-
].concat(_to_consumable_array$
|
|
9482
|
+
].concat(_to_consumable_array$c(asArray(paths))));
|
|
9509
9483
|
return setWebProtocolPrefix(webUrl, protocol);
|
|
9510
9484
|
}
|
|
9511
9485
|
/**
|
|
@@ -9783,17 +9757,17 @@ function _array_like_to_array$j(arr, len) {
|
|
|
9783
9757
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
9784
9758
|
return arr2;
|
|
9785
9759
|
}
|
|
9786
|
-
function _array_without_holes$
|
|
9760
|
+
function _array_without_holes$b(arr) {
|
|
9787
9761
|
if (Array.isArray(arr)) return _array_like_to_array$j(arr);
|
|
9788
9762
|
}
|
|
9789
|
-
function _iterable_to_array$
|
|
9763
|
+
function _iterable_to_array$b(iter) {
|
|
9790
9764
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
9791
9765
|
}
|
|
9792
|
-
function _non_iterable_spread$
|
|
9766
|
+
function _non_iterable_spread$b() {
|
|
9793
9767
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
9794
9768
|
}
|
|
9795
|
-
function _to_consumable_array$
|
|
9796
|
-
return _array_without_holes$
|
|
9769
|
+
function _to_consumable_array$b(arr) {
|
|
9770
|
+
return _array_without_holes$b(arr) || _iterable_to_array$b(arr) || _unsupported_iterable_to_array$j(arr) || _non_iterable_spread$b();
|
|
9797
9771
|
}
|
|
9798
9772
|
function _unsupported_iterable_to_array$j(o, minLen) {
|
|
9799
9773
|
if (!o) return;
|
|
@@ -9846,7 +9820,7 @@ function _unsupported_iterable_to_array$j(o, minLen) {
|
|
|
9846
9820
|
return x.email;
|
|
9847
9821
|
});
|
|
9848
9822
|
var emailsWithoutParticipants = excludeValuesFromArray(emails, participantEmails);
|
|
9849
|
-
return _to_consumable_array$
|
|
9823
|
+
return _to_consumable_array$b(participants).concat(_to_consumable_array$b(emailsWithoutParticipants.map(function(email) {
|
|
9850
9824
|
return {
|
|
9851
9825
|
email: email
|
|
9852
9826
|
};
|
|
@@ -10229,17 +10203,17 @@ function _array_like_to_array$i(arr, len) {
|
|
|
10229
10203
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
10230
10204
|
return arr2;
|
|
10231
10205
|
}
|
|
10232
|
-
function _array_without_holes$
|
|
10206
|
+
function _array_without_holes$a(arr) {
|
|
10233
10207
|
if (Array.isArray(arr)) return _array_like_to_array$i(arr);
|
|
10234
10208
|
}
|
|
10235
|
-
function _iterable_to_array$
|
|
10209
|
+
function _iterable_to_array$a(iter) {
|
|
10236
10210
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
10237
10211
|
}
|
|
10238
|
-
function _non_iterable_spread$
|
|
10212
|
+
function _non_iterable_spread$a() {
|
|
10239
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.");
|
|
10240
10214
|
}
|
|
10241
|
-
function _to_consumable_array$
|
|
10242
|
-
return _array_without_holes$
|
|
10215
|
+
function _to_consumable_array$a(arr) {
|
|
10216
|
+
return _array_without_holes$a(arr) || _iterable_to_array$a(arr) || _unsupported_iterable_to_array$i(arr) || _non_iterable_spread$a();
|
|
10243
10217
|
}
|
|
10244
10218
|
function _unsupported_iterable_to_array$i(o, minLen) {
|
|
10245
10219
|
if (!o) return;
|
|
@@ -10264,7 +10238,7 @@ function _unsupported_iterable_to_array$i(o, minLen) {
|
|
|
10264
10238
|
args[_key] = arguments[_key];
|
|
10265
10239
|
}
|
|
10266
10240
|
var forwardFn = getter();
|
|
10267
|
-
return forwardFn.apply(void 0, _to_consumable_array$
|
|
10241
|
+
return forwardFn.apply(void 0, _to_consumable_array$a(args));
|
|
10268
10242
|
};
|
|
10269
10243
|
}
|
|
10270
10244
|
/**
|
|
@@ -10292,17 +10266,17 @@ function _array_like_to_array$h(arr, len) {
|
|
|
10292
10266
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
10293
10267
|
return arr2;
|
|
10294
10268
|
}
|
|
10295
|
-
function _array_without_holes$
|
|
10269
|
+
function _array_without_holes$9(arr) {
|
|
10296
10270
|
if (Array.isArray(arr)) return _array_like_to_array$h(arr);
|
|
10297
10271
|
}
|
|
10298
|
-
function _iterable_to_array$
|
|
10272
|
+
function _iterable_to_array$9(iter) {
|
|
10299
10273
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
10300
10274
|
}
|
|
10301
|
-
function _non_iterable_spread$
|
|
10275
|
+
function _non_iterable_spread$9() {
|
|
10302
10276
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
10303
10277
|
}
|
|
10304
|
-
function _to_consumable_array$
|
|
10305
|
-
return _array_without_holes$
|
|
10278
|
+
function _to_consumable_array$9(arr) {
|
|
10279
|
+
return _array_without_holes$9(arr) || _iterable_to_array$9(arr) || _unsupported_iterable_to_array$h(arr) || _non_iterable_spread$9();
|
|
10306
10280
|
}
|
|
10307
10281
|
function _unsupported_iterable_to_array$h(o, minLen) {
|
|
10308
10282
|
if (!o) return;
|
|
@@ -10320,7 +10294,7 @@ function _unsupported_iterable_to_array$h(o, minLen) {
|
|
|
10320
10294
|
* @param keys - The keys to intersect with the object
|
|
10321
10295
|
* @returns An array of values from the matching keys
|
|
10322
10296
|
*/ function mapKeysIntersectionObjectToArray(object, keys) {
|
|
10323
|
-
var keysToApply = _to_consumable_array$
|
|
10297
|
+
var keysToApply = _to_consumable_array$9(keys);
|
|
10324
10298
|
var applyArray = [];
|
|
10325
10299
|
keysToApply.forEach(function(key) {
|
|
10326
10300
|
var values = object[key];
|
|
@@ -10654,7 +10628,7 @@ function _array_like_to_array$g(arr, len) {
|
|
|
10654
10628
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
10655
10629
|
return arr2;
|
|
10656
10630
|
}
|
|
10657
|
-
function _array_without_holes$
|
|
10631
|
+
function _array_without_holes$8(arr) {
|
|
10658
10632
|
if (Array.isArray(arr)) return _array_like_to_array$g(arr);
|
|
10659
10633
|
}
|
|
10660
10634
|
function asyncGeneratorStep$8(gen, resolve, reject, _next, _throw, key, arg) {
|
|
@@ -10686,14 +10660,14 @@ function _async_to_generator$8(fn) {
|
|
|
10686
10660
|
});
|
|
10687
10661
|
};
|
|
10688
10662
|
}
|
|
10689
|
-
function _iterable_to_array$
|
|
10663
|
+
function _iterable_to_array$8(iter) {
|
|
10690
10664
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
10691
10665
|
}
|
|
10692
|
-
function _non_iterable_spread$
|
|
10666
|
+
function _non_iterable_spread$8() {
|
|
10693
10667
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
10694
10668
|
}
|
|
10695
|
-
function _to_consumable_array$
|
|
10696
|
-
return _array_without_holes$
|
|
10669
|
+
function _to_consumable_array$8(arr) {
|
|
10670
|
+
return _array_without_holes$8(arr) || _iterable_to_array$8(arr) || _unsupported_iterable_to_array$g(arr) || _non_iterable_spread$8();
|
|
10697
10671
|
}
|
|
10698
10672
|
function _unsupported_iterable_to_array$g(o, minLen) {
|
|
10699
10673
|
if (!o) return;
|
|
@@ -10857,7 +10831,7 @@ function _ts_generator$8(thisArg, body) {
|
|
|
10857
10831
|
case 2:
|
|
10858
10832
|
verifiedIds = _state.sent();
|
|
10859
10833
|
// concat identifiers
|
|
10860
|
-
ids = _to_consumable_array$
|
|
10834
|
+
ids = _to_consumable_array$8(ids).concat(_to_consumable_array$8(verifiedIds));
|
|
10861
10835
|
return [
|
|
10862
10836
|
3,
|
|
10863
10837
|
1
|
|
@@ -10922,10 +10896,10 @@ function _array_like_to_array$f(arr, len) {
|
|
|
10922
10896
|
function _array_with_holes$b(arr) {
|
|
10923
10897
|
if (Array.isArray(arr)) return arr;
|
|
10924
10898
|
}
|
|
10925
|
-
function _array_without_holes$
|
|
10899
|
+
function _array_without_holes$7(arr) {
|
|
10926
10900
|
if (Array.isArray(arr)) return _array_like_to_array$f(arr);
|
|
10927
10901
|
}
|
|
10928
|
-
function _iterable_to_array$
|
|
10902
|
+
function _iterable_to_array$7(iter) {
|
|
10929
10903
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
10930
10904
|
}
|
|
10931
10905
|
function _iterable_to_array_limit$b(arr, i) {
|
|
@@ -10955,14 +10929,14 @@ function _iterable_to_array_limit$b(arr, i) {
|
|
|
10955
10929
|
function _non_iterable_rest$b() {
|
|
10956
10930
|
throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
10957
10931
|
}
|
|
10958
|
-
function _non_iterable_spread$
|
|
10932
|
+
function _non_iterable_spread$7() {
|
|
10959
10933
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
10960
10934
|
}
|
|
10961
10935
|
function _sliced_to_array$b(arr, i) {
|
|
10962
10936
|
return _array_with_holes$b(arr) || _iterable_to_array_limit$b(arr, i) || _unsupported_iterable_to_array$f(arr, i) || _non_iterable_rest$b();
|
|
10963
10937
|
}
|
|
10964
|
-
function _to_consumable_array$
|
|
10965
|
-
return _array_without_holes$
|
|
10938
|
+
function _to_consumable_array$7(arr) {
|
|
10939
|
+
return _array_without_holes$7(arr) || _iterable_to_array$7(arr) || _unsupported_iterable_to_array$f(arr) || _non_iterable_spread$7();
|
|
10966
10940
|
}
|
|
10967
10941
|
function _unsupported_iterable_to_array$f(o, minLen) {
|
|
10968
10942
|
if (!o) return;
|
|
@@ -11074,7 +11048,7 @@ function _unsupported_iterable_to_array$f(o, minLen) {
|
|
|
11074
11048
|
var splitEncodedValues = splitter ? function(encodedValues) {
|
|
11075
11049
|
return encodedValues.split(splitter);
|
|
11076
11050
|
} : function(encodedValues) {
|
|
11077
|
-
return _to_consumable_array$
|
|
11051
|
+
return _to_consumable_array$7(encodedValues);
|
|
11078
11052
|
};
|
|
11079
11053
|
return function(input) {
|
|
11080
11054
|
if (typeof input === 'string') {
|
|
@@ -11988,10 +11962,10 @@ function _array_like_to_array$d(arr, len) {
|
|
|
11988
11962
|
function _array_with_holes$9(arr) {
|
|
11989
11963
|
if (Array.isArray(arr)) return arr;
|
|
11990
11964
|
}
|
|
11991
|
-
function _array_without_holes$
|
|
11965
|
+
function _array_without_holes$6(arr) {
|
|
11992
11966
|
if (Array.isArray(arr)) return _array_like_to_array$d(arr);
|
|
11993
11967
|
}
|
|
11994
|
-
function _iterable_to_array$
|
|
11968
|
+
function _iterable_to_array$6(iter) {
|
|
11995
11969
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
11996
11970
|
}
|
|
11997
11971
|
function _iterable_to_array_limit$9(arr, i) {
|
|
@@ -12021,14 +11995,14 @@ function _iterable_to_array_limit$9(arr, i) {
|
|
|
12021
11995
|
function _non_iterable_rest$9() {
|
|
12022
11996
|
throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
12023
11997
|
}
|
|
12024
|
-
function _non_iterable_spread$
|
|
11998
|
+
function _non_iterable_spread$6() {
|
|
12025
11999
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
12026
12000
|
}
|
|
12027
12001
|
function _sliced_to_array$9(arr, i) {
|
|
12028
12002
|
return _array_with_holes$9(arr) || _iterable_to_array_limit$9(arr, i) || _unsupported_iterable_to_array$d(arr, i) || _non_iterable_rest$9();
|
|
12029
12003
|
}
|
|
12030
|
-
function _to_consumable_array$
|
|
12031
|
-
return _array_without_holes$
|
|
12004
|
+
function _to_consumable_array$6(arr) {
|
|
12005
|
+
return _array_without_holes$6(arr) || _iterable_to_array$6(arr) || _unsupported_iterable_to_array$d(arr) || _non_iterable_spread$6();
|
|
12032
12006
|
}
|
|
12033
12007
|
function _type_of$8(obj) {
|
|
12034
12008
|
"@swc/helpers - typeof";
|
|
@@ -12281,10 +12255,10 @@ function _unsupported_iterable_to_array$d(o, minLen) {
|
|
|
12281
12255
|
var lngs = points.map(function(x) {
|
|
12282
12256
|
return x.lng;
|
|
12283
12257
|
});
|
|
12284
|
-
var minLat = (_Math = Math).min.apply(_Math, _to_consumable_array$
|
|
12285
|
-
var maxLat = (_Math1 = Math).max.apply(_Math1, _to_consumable_array$
|
|
12286
|
-
var minLng = (_Math2 = Math).min.apply(_Math2, _to_consumable_array$
|
|
12287
|
-
var maxLng = (_Math3 = Math).max.apply(_Math3, _to_consumable_array$
|
|
12258
|
+
var minLat = (_Math = Math).min.apply(_Math, _to_consumable_array$6(lats));
|
|
12259
|
+
var maxLat = (_Math1 = Math).max.apply(_Math1, _to_consumable_array$6(lats));
|
|
12260
|
+
var minLng = (_Math2 = Math).min.apply(_Math2, _to_consumable_array$6(lngs));
|
|
12261
|
+
var maxLng = (_Math3 = Math).max.apply(_Math3, _to_consumable_array$6(lngs));
|
|
12288
12262
|
bound = {
|
|
12289
12263
|
sw: latLngPoint([
|
|
12290
12264
|
minLat,
|
|
@@ -13726,17 +13700,17 @@ function _array_like_to_array$b(arr, len) {
|
|
|
13726
13700
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
13727
13701
|
return arr2;
|
|
13728
13702
|
}
|
|
13729
|
-
function _array_without_holes$
|
|
13703
|
+
function _array_without_holes$5(arr) {
|
|
13730
13704
|
if (Array.isArray(arr)) return _array_like_to_array$b(arr);
|
|
13731
13705
|
}
|
|
13732
|
-
function _iterable_to_array$
|
|
13706
|
+
function _iterable_to_array$5(iter) {
|
|
13733
13707
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
13734
13708
|
}
|
|
13735
|
-
function _non_iterable_spread$
|
|
13709
|
+
function _non_iterable_spread$5() {
|
|
13736
13710
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
13737
13711
|
}
|
|
13738
|
-
function _to_consumable_array$
|
|
13739
|
-
return _array_without_holes$
|
|
13712
|
+
function _to_consumable_array$5(arr) {
|
|
13713
|
+
return _array_without_holes$5(arr) || _iterable_to_array$5(arr) || _unsupported_iterable_to_array$b(arr) || _non_iterable_spread$5();
|
|
13740
13714
|
}
|
|
13741
13715
|
function _unsupported_iterable_to_array$b(o, minLen) {
|
|
13742
13716
|
if (!o) return;
|
|
@@ -13757,7 +13731,7 @@ function _unsupported_iterable_to_array$b(o, minLen) {
|
|
|
13757
13731
|
*/ function objectDeltaArrayCompressor(config) {
|
|
13758
13732
|
var _equalityChecker = config.equalityChecker;
|
|
13759
13733
|
var assignKnownValuesToCopy = assignValuesToPOJOFunction({
|
|
13760
|
-
keysFilter: _to_consumable_array$
|
|
13734
|
+
keysFilter: _to_consumable_array$5(_equalityChecker._fields.keys()),
|
|
13761
13735
|
valueFilter: exports.KeyValueTypleValueFilter.NULL
|
|
13762
13736
|
});
|
|
13763
13737
|
function compress(uncompressed) {
|
|
@@ -13794,7 +13768,7 @@ function _unsupported_iterable_to_array$b(o, minLen) {
|
|
|
13794
13768
|
});
|
|
13795
13769
|
return result;
|
|
13796
13770
|
}
|
|
13797
|
-
var allKeys = _to_consumable_array$
|
|
13771
|
+
var allKeys = _to_consumable_array$5(_equalityChecker._fields.keys());
|
|
13798
13772
|
function expand(compressed) {
|
|
13799
13773
|
if (compressed.length === 0) {
|
|
13800
13774
|
return [];
|
|
@@ -14123,17 +14097,17 @@ function _array_like_to_array$a(arr, len) {
|
|
|
14123
14097
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
14124
14098
|
return arr2;
|
|
14125
14099
|
}
|
|
14126
|
-
function _array_without_holes$
|
|
14100
|
+
function _array_without_holes$4(arr) {
|
|
14127
14101
|
if (Array.isArray(arr)) return _array_like_to_array$a(arr);
|
|
14128
14102
|
}
|
|
14129
|
-
function _iterable_to_array$
|
|
14103
|
+
function _iterable_to_array$4(iter) {
|
|
14130
14104
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
14131
14105
|
}
|
|
14132
|
-
function _non_iterable_spread$
|
|
14106
|
+
function _non_iterable_spread$4() {
|
|
14133
14107
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
14134
14108
|
}
|
|
14135
|
-
function _to_consumable_array$
|
|
14136
|
-
return _array_without_holes$
|
|
14109
|
+
function _to_consumable_array$4(arr) {
|
|
14110
|
+
return _array_without_holes$4(arr) || _iterable_to_array$4(arr) || _unsupported_iterable_to_array$a(arr) || _non_iterable_spread$4();
|
|
14137
14111
|
}
|
|
14138
14112
|
function _unsupported_iterable_to_array$a(o, minLen) {
|
|
14139
14113
|
if (!o) return;
|
|
@@ -14267,9 +14241,9 @@ function _unsupported_iterable_to_array$a(o, minLen) {
|
|
|
14267
14241
|
if (sundayFirst) {
|
|
14268
14242
|
dayOfWeekNames = [
|
|
14269
14243
|
sunday
|
|
14270
|
-
].concat(_to_consumable_array$
|
|
14244
|
+
].concat(_to_consumable_array$4(days));
|
|
14271
14245
|
} else {
|
|
14272
|
-
dayOfWeekNames = _to_consumable_array$
|
|
14246
|
+
dayOfWeekNames = _to_consumable_array$4(days).concat([
|
|
14273
14247
|
sunday
|
|
14274
14248
|
]);
|
|
14275
14249
|
}
|
|
@@ -14888,7 +14862,7 @@ function _array_like_to_array$9(arr, len) {
|
|
|
14888
14862
|
function _array_with_holes$7(arr) {
|
|
14889
14863
|
if (Array.isArray(arr)) return arr;
|
|
14890
14864
|
}
|
|
14891
|
-
function _array_without_holes$
|
|
14865
|
+
function _array_without_holes$3(arr) {
|
|
14892
14866
|
if (Array.isArray(arr)) return _array_like_to_array$9(arr);
|
|
14893
14867
|
}
|
|
14894
14868
|
function asyncGeneratorStep$4(gen, resolve, reject, _next, _throw, key, arg) {
|
|
@@ -14933,7 +14907,7 @@ function _define_property$9(obj, key, value) {
|
|
|
14933
14907
|
}
|
|
14934
14908
|
return obj;
|
|
14935
14909
|
}
|
|
14936
|
-
function _iterable_to_array$
|
|
14910
|
+
function _iterable_to_array$3(iter) {
|
|
14937
14911
|
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
14938
14912
|
}
|
|
14939
14913
|
function _iterable_to_array_limit$7(arr, i) {
|
|
@@ -14963,7 +14937,7 @@ function _iterable_to_array_limit$7(arr, i) {
|
|
|
14963
14937
|
function _non_iterable_rest$7() {
|
|
14964
14938
|
throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
14965
14939
|
}
|
|
14966
|
-
function _non_iterable_spread$
|
|
14940
|
+
function _non_iterable_spread$3() {
|
|
14967
14941
|
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
14968
14942
|
}
|
|
14969
14943
|
function _object_spread$5(target) {
|
|
@@ -15003,8 +14977,8 @@ function _object_spread_props$2(target, source) {
|
|
|
15003
14977
|
function _sliced_to_array$7(arr, i) {
|
|
15004
14978
|
return _array_with_holes$7(arr) || _iterable_to_array_limit$7(arr, i) || _unsupported_iterable_to_array$9(arr, i) || _non_iterable_rest$7();
|
|
15005
14979
|
}
|
|
15006
|
-
function _to_consumable_array$
|
|
15007
|
-
return _array_without_holes$
|
|
14980
|
+
function _to_consumable_array$3(arr) {
|
|
14981
|
+
return _array_without_holes$3(arr) || _iterable_to_array$3(arr) || _unsupported_iterable_to_array$9(arr) || _non_iterable_spread$3();
|
|
15008
14982
|
}
|
|
15009
14983
|
function _unsupported_iterable_to_array$9(o, minLen) {
|
|
15010
14984
|
if (!o) return;
|
|
@@ -15371,7 +15345,7 @@ function _performAsyncTask(_0, _1) {
|
|
|
15371
15345
|
2,
|
|
15372
15346
|
[
|
|
15373
15347
|
value
|
|
15374
|
-
].concat(_to_consumable_array$
|
|
15348
|
+
].concat(_to_consumable_array$3(result))
|
|
15375
15349
|
];
|
|
15376
15350
|
}
|
|
15377
15351
|
retriesRemaining = retriesAllowed - tryNumber;
|
|
@@ -15650,7 +15624,7 @@ function _performAsyncTask(_0, _1) {
|
|
|
15650
15624
|
];
|
|
15651
15625
|
}).reverse(); // reverse to use push/pop
|
|
15652
15626
|
baseI += newTaskEntries.length;
|
|
15653
|
-
incompleteTasks = _to_consumable_array$
|
|
15627
|
+
incompleteTasks = _to_consumable_array$3(newTaskEntries).concat(_to_consumable_array$3(incompleteTasks)); // new tasks go to the front of the stack
|
|
15654
15628
|
}
|
|
15655
15629
|
_state.label = 2;
|
|
15656
15630
|
case 2:
|
|
@@ -16858,9 +16832,6 @@ function _array_like_to_array$7(arr, len) {
|
|
|
16858
16832
|
function _array_with_holes$5(arr) {
|
|
16859
16833
|
if (Array.isArray(arr)) return arr;
|
|
16860
16834
|
}
|
|
16861
|
-
function _array_without_holes$3(arr) {
|
|
16862
|
-
if (Array.isArray(arr)) return _array_like_to_array$7(arr);
|
|
16863
|
-
}
|
|
16864
16835
|
function _instanceof(left, right) {
|
|
16865
16836
|
if (right != null && typeof Symbol !== "undefined" && right[Symbol.hasInstance]) {
|
|
16866
16837
|
return !!right[Symbol.hasInstance](left);
|
|
@@ -16868,9 +16839,6 @@ function _instanceof(left, right) {
|
|
|
16868
16839
|
return left instanceof right;
|
|
16869
16840
|
}
|
|
16870
16841
|
}
|
|
16871
|
-
function _iterable_to_array$3(iter) {
|
|
16872
|
-
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
|
16873
|
-
}
|
|
16874
16842
|
function _iterable_to_array_limit$5(arr, i) {
|
|
16875
16843
|
var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
|
|
16876
16844
|
if (_i == null) return;
|
|
@@ -16898,15 +16866,9 @@ function _iterable_to_array_limit$5(arr, i) {
|
|
|
16898
16866
|
function _non_iterable_rest$5() {
|
|
16899
16867
|
throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
16900
16868
|
}
|
|
16901
|
-
function _non_iterable_spread$3() {
|
|
16902
|
-
throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
16903
|
-
}
|
|
16904
16869
|
function _sliced_to_array$5(arr, i) {
|
|
16905
16870
|
return _array_with_holes$5(arr) || _iterable_to_array_limit$5(arr, i) || _unsupported_iterable_to_array$7(arr, i) || _non_iterable_rest$5();
|
|
16906
16871
|
}
|
|
16907
|
-
function _to_consumable_array$3(arr) {
|
|
16908
|
-
return _array_without_holes$3(arr) || _iterable_to_array$3(arr) || _unsupported_iterable_to_array$7(arr) || _non_iterable_spread$3();
|
|
16909
|
-
}
|
|
16910
16872
|
function _type_of$3(obj) {
|
|
16911
16873
|
"@swc/helpers - typeof";
|
|
16912
16874
|
return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
|
|
@@ -16991,7 +16953,7 @@ function _compareMaps(a, b, pojoFilter) {
|
|
|
16991
16953
|
if (a.size !== b.size) {
|
|
16992
16954
|
return false;
|
|
16993
16955
|
}
|
|
16994
|
-
var firstInequalityIndex =
|
|
16956
|
+
var firstInequalityIndex = Array.from(a.entries()).findIndex(function(param) {
|
|
16995
16957
|
var _param = _sliced_to_array$5(param, 2), key = _param[0], aValue = _param[1];
|
|
16996
16958
|
var bValue = b.get(key);
|
|
16997
16959
|
return !areEqualPOJOValuesUsingPojoFilter(aValue, bValue, pojoFilter);
|
|
@@ -18791,6 +18753,22 @@ function _unsupported_iterable_to_array$2(o, minLen) {
|
|
|
18791
18753
|
if (n === "Map" || n === "Set") return Array.from(n);
|
|
18792
18754
|
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array$2(o, minLen);
|
|
18793
18755
|
}
|
|
18756
|
+
/**
|
|
18757
|
+
* Converts a CSS token into a var() string.
|
|
18758
|
+
*
|
|
18759
|
+
* @example
|
|
18760
|
+
* ```ts
|
|
18761
|
+
* cssTokenVar('--dbx-primary-color'); // 'var(--dbx-primary-color)'
|
|
18762
|
+
* ```
|
|
18763
|
+
*
|
|
18764
|
+
* @param cssToken - the CSS token to convert
|
|
18765
|
+
* @returns the var() string
|
|
18766
|
+
*/ function cssTokenVar(cssToken) {
|
|
18767
|
+
return "var(".concat(cssToken, ")");
|
|
18768
|
+
}
|
|
18769
|
+
/**
|
|
18770
|
+
* @deprecated Use {@link cssTokenVar} instead.
|
|
18771
|
+
*/ var cssVariableVar = cssTokenVar;
|
|
18794
18772
|
/**
|
|
18795
18773
|
* Joins together various arrays of CSS classes into a single space-separated string of unique class names.
|
|
18796
18774
|
*
|
|
@@ -20906,6 +20884,8 @@ exports.countPOJOKeys = countPOJOKeys;
|
|
|
20906
20884
|
exports.countPOJOKeysFunction = countPOJOKeysFunction;
|
|
20907
20885
|
exports.cronExpressionRepeatingEveryNMinutes = cronExpressionRepeatingEveryNMinutes;
|
|
20908
20886
|
exports.cssClassesSet = cssClassesSet;
|
|
20887
|
+
exports.cssTokenVar = cssTokenVar;
|
|
20888
|
+
exports.cssVariableVar = cssVariableVar;
|
|
20909
20889
|
exports.cutString = cutString;
|
|
20910
20890
|
exports.cutStringFunction = cutStringFunction;
|
|
20911
20891
|
exports.cutToPrecision = cutToPrecision;
|
|
@@ -21547,6 +21527,7 @@ exports.transformStringFunctionConfig = transformStringFunctionConfig;
|
|
|
21547
21527
|
exports.transformStrings = transformStrings;
|
|
21548
21528
|
exports.trimArray = trimArray;
|
|
21549
21529
|
exports.trueOrFalseString = trueOrFalseString;
|
|
21530
|
+
exports.tryConvertToE164PhoneNumber = tryConvertToE164PhoneNumber;
|
|
21550
21531
|
exports.tryWithPromiseFactoriesFunction = tryWithPromiseFactoriesFunction;
|
|
21551
21532
|
exports.typedServiceRegistry = typedServiceRegistry;
|
|
21552
21533
|
exports.unique = unique;
|