@gooddata/util 11.68.0-alpha.5 → 11.68.0-alpha.7
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/LICENSE +1 -1
- package/NOTICE +177 -0
- package/esm/_/_assignValue.d.ts.map +1 -1
- package/esm/_/_assignValue.js +2 -6
- package/esm/_/_baseAssignValue.d.ts +41 -0
- package/esm/_/_baseAssignValue.d.ts.map +1 -0
- package/esm/_/_baseAssignValue.js +48 -0
- package/esm/_/_baseClone.d.ts.map +1 -1
- package/esm/_/_baseClone.js +3 -30
- package/esm/_/_baseMerge.d.ts +15 -0
- package/esm/_/_baseMerge.d.ts.map +1 -0
- package/esm/_/_baseMerge.js +137 -0
- package/esm/_/_baseOrderBy.d.ts +11 -0
- package/esm/_/_baseOrderBy.d.ts.map +1 -0
- package/esm/_/_baseOrderBy.js +70 -0
- package/esm/_/_basePickBy.d.ts +14 -0
- package/esm/_/_basePickBy.d.ts.map +1 -0
- package/esm/_/_basePickBy.js +57 -0
- package/esm/_/_cloneArrayBuffer.d.ts +39 -0
- package/esm/_/_cloneArrayBuffer.d.ts.map +1 -0
- package/esm/_/_cloneArrayBuffer.js +45 -0
- package/esm/_/_cloneTypedArray.d.ts +10 -0
- package/esm/_/_cloneTypedArray.d.ts.map +1 -0
- package/esm/_/_cloneTypedArray.js +49 -0
- package/esm/_/_compareAscending.d.ts +12 -0
- package/esm/_/_compareAscending.d.ts.map +1 -0
- package/esm/_/_compareAscending.js +78 -0
- package/esm/_/_createCompounder.d.ts +11 -0
- package/esm/_/_createCompounder.d.ts.map +1 -0
- package/esm/_/_createCompounder.js +47 -0
- package/esm/_/_initCloneObject.d.ts +10 -0
- package/esm/_/_initCloneObject.d.ts.map +1 -0
- package/esm/_/_initCloneObject.js +48 -0
- package/esm/_/_unicode.d.ts +27 -0
- package/esm/_/_unicode.d.ts.map +1 -0
- package/esm/_/_unicode.js +120 -0
- package/esm/_/camelCase.d.ts +10 -0
- package/esm/_/camelCase.d.ts.map +1 -0
- package/esm/_/camelCase.js +45 -0
- package/esm/_/capitalize.d.ts +9 -0
- package/esm/_/capitalize.d.ts.map +1 -0
- package/esm/_/capitalize.js +43 -0
- package/esm/_/deburr.d.ts +10 -0
- package/esm/_/deburr.d.ts.map +1 -0
- package/esm/_/deburr.js +243 -0
- package/esm/_/difference.d.ts +14 -0
- package/esm/_/difference.d.ts.map +1 -0
- package/esm/_/difference.js +67 -0
- package/esm/_/escape.d.ts +13 -0
- package/esm/_/escape.d.ts.map +1 -0
- package/esm/_/escape.js +56 -0
- package/esm/_/has.d.ts +23 -0
- package/esm/_/has.d.ts.map +1 -0
- package/esm/_/has.js +35 -0
- package/esm/_/isArray.d.ts +61 -0
- package/esm/_/isArray.d.ts.map +1 -0
- package/esm/_/isArray.js +62 -0
- package/esm/_/isPlainObject.d.ts +1 -1
- package/esm/_/isPlainObject.d.ts.map +1 -1
- package/esm/_/kebabCase.d.ts +9 -0
- package/esm/_/kebabCase.d.ts.map +1 -0
- package/esm/_/kebabCase.js +40 -0
- package/esm/_/keyBy.d.ts +17 -0
- package/esm/_/keyBy.d.ts.map +1 -0
- package/esm/_/keyBy.js +43 -0
- package/esm/_/keysIn.d.ts +10 -0
- package/esm/_/keysIn.d.ts.map +1 -0
- package/esm/_/keysIn.js +54 -0
- package/esm/_/memoize.d.ts +89 -0
- package/esm/_/memoize.d.ts.map +1 -0
- package/esm/_/memoize.js +36 -0
- package/esm/_/merge.d.ts +32 -0
- package/esm/_/merge.d.ts.map +1 -0
- package/esm/_/merge.js +45 -0
- package/esm/_/omit.d.ts +1 -5
- package/esm/_/omit.d.ts.map +1 -1
- package/esm/_/omitBy.d.ts +21 -0
- package/esm/_/omitBy.d.ts.map +1 -0
- package/esm/_/omitBy.js +37 -0
- package/esm/_/partial.d.ts +87 -0
- package/esm/_/partial.d.ts.map +1 -0
- package/esm/_/partial.js +30 -0
- package/esm/_/partition.d.ts +23 -0
- package/esm/_/partition.d.ts.map +1 -0
- package/esm/_/partition.js +42 -0
- package/esm/_/pick.d.ts +18 -0
- package/esm/_/pick.d.ts.map +1 -0
- package/esm/_/pick.js +48 -0
- package/esm/_/pickBy.d.ts +21 -0
- package/esm/_/pickBy.d.ts.map +1 -0
- package/esm/_/pickBy.js +36 -0
- package/esm/_/sortBy.d.ts +17 -0
- package/esm/_/sortBy.d.ts.map +1 -0
- package/esm/_/sortBy.js +46 -0
- package/esm/_/throttle.d.ts +76 -0
- package/esm/_/throttle.d.ts.map +1 -0
- package/esm/_/throttle.js +45 -0
- package/esm/_/toString.d.ts +11 -0
- package/esm/_/toString.d.ts.map +1 -0
- package/esm/_/toString.js +57 -0
- package/esm/_/types.d.ts +64 -0
- package/esm/_/types.d.ts.map +1 -1
- package/esm/_/union.d.ts +11 -0
- package/esm/_/union.d.ts.map +1 -0
- package/esm/_/union.js +55 -0
- package/esm/_/uniq.d.ts +12 -0
- package/esm/_/uniq.d.ts.map +1 -0
- package/esm/_/uniq.js +47 -0
- package/esm/_/uniqWith.d.ts +14 -0
- package/esm/_/uniqWith.d.ts.map +1 -0
- package/esm/_/uniqWith.js +59 -0
- package/esm/_/upperFirst.d.ts +10 -0
- package/esm/_/upperFirst.d.ts.map +1 -0
- package/esm/_/upperFirst.js +46 -0
- package/esm/_/words.d.ts +9 -0
- package/esm/_/words.d.ts.map +1 -0
- package/esm/_/words.js +50 -0
- package/esm/_/zip.d.ts +28 -0
- package/esm/_/zip.d.ts.map +1 -0
- package/esm/_/zip.js +38 -0
- package/esm/index.d.ts +23 -2
- package/esm/index.d.ts.map +1 -1
- package/esm/index.js +21 -0
- package/esm/util.d.ts +549 -0
- package/package.json +5 -4
|
@@ -0,0 +1,57 @@
|
|
|
1
|
+
// (C) 2026 GoodData Corporation
|
|
2
|
+
/*!
|
|
3
|
+
* Portions of this file are derived from Lodash.
|
|
4
|
+
* https://github.com/lodash/lodash
|
|
5
|
+
*
|
|
6
|
+
* Copyright OpenJS Foundation and other contributors <https://openjsf.org/>
|
|
7
|
+
*
|
|
8
|
+
* Based on Underscore.js, copyright Jeremy Ashkenas,
|
|
9
|
+
* DocumentCloud and Investigative Reporters & Editors <http://underscorejs.org/>
|
|
10
|
+
*
|
|
11
|
+
* Modifications Copyright (c) 2026 GoodData Corporation
|
|
12
|
+
*
|
|
13
|
+
* Permission is hereby granted, free of charge, to any person obtaining
|
|
14
|
+
* a copy of this software and associated documentation files (the
|
|
15
|
+
* "Software"), to deal in the Software without restriction, including
|
|
16
|
+
* without limitation the rights to use, copy, modify, merge, publish,
|
|
17
|
+
* distribute, sublicense, and/or sell copies of the Software, and to
|
|
18
|
+
* permit persons to whom the Software is furnished to do so, subject to
|
|
19
|
+
* the following conditions:
|
|
20
|
+
*
|
|
21
|
+
* The above copyright notice and this permission notice shall be
|
|
22
|
+
* included in all copies or substantial portions of the Software.
|
|
23
|
+
*
|
|
24
|
+
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
25
|
+
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
26
|
+
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
|
27
|
+
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
|
28
|
+
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
|
29
|
+
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
|
30
|
+
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
31
|
+
*/
|
|
32
|
+
import { _getAllKeysIn } from "./_getAllKeysIn.js";
|
|
33
|
+
/**
|
|
34
|
+
* The base implementation of `_pickBy`: creates an object composed of the own and inherited enumerable
|
|
35
|
+
* string and symbol keyed properties of `object` that `predicate` returns truthy for. The predicate is
|
|
36
|
+
* invoked with two arguments: (value, key). Picked values are kept by reference.
|
|
37
|
+
*
|
|
38
|
+
* @param object - The source object.
|
|
39
|
+
* @param predicate - The function invoked per property.
|
|
40
|
+
* @returns Returns the new object.
|
|
41
|
+
* @internal
|
|
42
|
+
*/
|
|
43
|
+
export function _basePickBy(object, predicate) {
|
|
44
|
+
const result = {};
|
|
45
|
+
if (object == null) {
|
|
46
|
+
return result;
|
|
47
|
+
}
|
|
48
|
+
const source = Object(object);
|
|
49
|
+
for (const key of _getAllKeysIn(source)) {
|
|
50
|
+
const value = source[key];
|
|
51
|
+
// keys that would change the prototype of the result are never written, as in lodash
|
|
52
|
+
if (predicate(value, key) && key !== "__proto__" && key !== "constructor" && key !== "prototype") {
|
|
53
|
+
result[key] = value;
|
|
54
|
+
}
|
|
55
|
+
}
|
|
56
|
+
return result;
|
|
57
|
+
}
|
|
@@ -0,0 +1,39 @@
|
|
|
1
|
+
/*!
|
|
2
|
+
* Portions of this file are derived from Lodash.
|
|
3
|
+
* https://github.com/lodash/lodash
|
|
4
|
+
*
|
|
5
|
+
* Copyright OpenJS Foundation and other contributors <https://openjsf.org/>
|
|
6
|
+
*
|
|
7
|
+
* Based on Underscore.js, copyright Jeremy Ashkenas,
|
|
8
|
+
* DocumentCloud and Investigative Reporters & Editors <http://underscorejs.org/>
|
|
9
|
+
*
|
|
10
|
+
* Modifications Copyright (c) 2026 GoodData Corporation
|
|
11
|
+
*
|
|
12
|
+
* Permission is hereby granted, free of charge, to any person obtaining
|
|
13
|
+
* a copy of this software and associated documentation files (the
|
|
14
|
+
* "Software"), to deal in the Software without restriction, including
|
|
15
|
+
* without limitation the rights to use, copy, modify, merge, publish,
|
|
16
|
+
* distribute, sublicense, and/or sell copies of the Software, and to
|
|
17
|
+
* permit persons to whom the Software is furnished to do so, subject to
|
|
18
|
+
* the following conditions:
|
|
19
|
+
*
|
|
20
|
+
* The above copyright notice and this permission notice shall be
|
|
21
|
+
* included in all copies or substantial portions of the Software.
|
|
22
|
+
*
|
|
23
|
+
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
24
|
+
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
25
|
+
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
|
26
|
+
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
|
27
|
+
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
|
28
|
+
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
|
29
|
+
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
30
|
+
*/
|
|
31
|
+
/**
|
|
32
|
+
* Creates a clone of `arrayBuffer` of the same class and byte length.
|
|
33
|
+
*
|
|
34
|
+
* @param arrayBuffer - The array buffer to clone.
|
|
35
|
+
* @returns Returns the cloned array buffer.
|
|
36
|
+
* @internal
|
|
37
|
+
*/
|
|
38
|
+
export declare function _cloneArrayBuffer(arrayBuffer: ArrayBufferLike): ArrayBufferLike;
|
|
39
|
+
//# sourceMappingURL=_cloneArrayBuffer.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"_cloneArrayBuffer.d.ts","sourceRoot":"","sources":["../../src/_/_cloneArrayBuffer.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AAEH;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,WAAW,EAAE,eAAe,GAAG,eAAe,CAQ/E"}
|
|
@@ -0,0 +1,45 @@
|
|
|
1
|
+
// (C) 2026 GoodData Corporation
|
|
2
|
+
/*!
|
|
3
|
+
* Portions of this file are derived from Lodash.
|
|
4
|
+
* https://github.com/lodash/lodash
|
|
5
|
+
*
|
|
6
|
+
* Copyright OpenJS Foundation and other contributors <https://openjsf.org/>
|
|
7
|
+
*
|
|
8
|
+
* Based on Underscore.js, copyright Jeremy Ashkenas,
|
|
9
|
+
* DocumentCloud and Investigative Reporters & Editors <http://underscorejs.org/>
|
|
10
|
+
*
|
|
11
|
+
* Modifications Copyright (c) 2026 GoodData Corporation
|
|
12
|
+
*
|
|
13
|
+
* Permission is hereby granted, free of charge, to any person obtaining
|
|
14
|
+
* a copy of this software and associated documentation files (the
|
|
15
|
+
* "Software"), to deal in the Software without restriction, including
|
|
16
|
+
* without limitation the rights to use, copy, modify, merge, publish,
|
|
17
|
+
* distribute, sublicense, and/or sell copies of the Software, and to
|
|
18
|
+
* permit persons to whom the Software is furnished to do so, subject to
|
|
19
|
+
* the following conditions:
|
|
20
|
+
*
|
|
21
|
+
* The above copyright notice and this permission notice shall be
|
|
22
|
+
* included in all copies or substantial portions of the Software.
|
|
23
|
+
*
|
|
24
|
+
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
25
|
+
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
26
|
+
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
|
27
|
+
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
|
28
|
+
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
|
29
|
+
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
|
30
|
+
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
31
|
+
*/
|
|
32
|
+
/**
|
|
33
|
+
* Creates a clone of `arrayBuffer` of the same class and byte length.
|
|
34
|
+
*
|
|
35
|
+
* @param arrayBuffer - The array buffer to clone.
|
|
36
|
+
* @returns Returns the cloned array buffer.
|
|
37
|
+
* @internal
|
|
38
|
+
*/
|
|
39
|
+
export function _cloneArrayBuffer(arrayBuffer) {
|
|
40
|
+
const Ctor = arrayBuffer
|
|
41
|
+
.constructor;
|
|
42
|
+
const result = new Ctor(arrayBuffer.byteLength);
|
|
43
|
+
new Uint8Array(result).set(new Uint8Array(arrayBuffer));
|
|
44
|
+
return result;
|
|
45
|
+
}
|
|
@@ -0,0 +1,10 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* Clones a typed array of any class, keeping its view offset and length over a copy of the whole buffer.
|
|
3
|
+
* A Node `Buffer` is copied through `Buffer.from`, since constructing one directly is deprecated.
|
|
4
|
+
*
|
|
5
|
+
* @param typedArray - The typed array to clone.
|
|
6
|
+
* @returns Returns the cloned typed array.
|
|
7
|
+
* @internal
|
|
8
|
+
*/
|
|
9
|
+
export declare function _cloneTypedArray(typedArray: ArrayBufferView & ArrayLike<unknown>): ArrayBufferView;
|
|
10
|
+
//# sourceMappingURL=_cloneTypedArray.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"_cloneTypedArray.d.ts","sourceRoot":"","sources":["../../src/_/_cloneTypedArray.ts"],"names":[],"mappings":"AA8CA;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAAC,UAAU,EAAE,eAAe,GAAG,SAAS,CAAC,OAAO,CAAC,GAAG,eAAe,CAQlG"}
|
|
@@ -0,0 +1,49 @@
|
|
|
1
|
+
// (C) 2026 GoodData Corporation
|
|
2
|
+
/*!
|
|
3
|
+
* Portions of this file are derived from Lodash.
|
|
4
|
+
* https://github.com/lodash/lodash
|
|
5
|
+
*
|
|
6
|
+
* Copyright OpenJS Foundation and other contributors <https://openjsf.org/>
|
|
7
|
+
*
|
|
8
|
+
* Based on Underscore.js, copyright Jeremy Ashkenas,
|
|
9
|
+
* DocumentCloud and Investigative Reporters & Editors <http://underscorejs.org/>
|
|
10
|
+
*
|
|
11
|
+
* Modifications Copyright (c) 2026 GoodData Corporation
|
|
12
|
+
*
|
|
13
|
+
* Permission is hereby granted, free of charge, to any person obtaining
|
|
14
|
+
* a copy of this software and associated documentation files (the
|
|
15
|
+
* "Software"), to deal in the Software without restriction, including
|
|
16
|
+
* without limitation the rights to use, copy, modify, merge, publish,
|
|
17
|
+
* distribute, sublicense, and/or sell copies of the Software, and to
|
|
18
|
+
* permit persons to whom the Software is furnished to do so, subject to
|
|
19
|
+
* the following conditions:
|
|
20
|
+
*
|
|
21
|
+
* The above copyright notice and this permission notice shall be
|
|
22
|
+
* included in all copies or substantial portions of the Software.
|
|
23
|
+
*
|
|
24
|
+
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
25
|
+
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
26
|
+
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
|
27
|
+
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
|
28
|
+
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
|
29
|
+
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
|
30
|
+
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
31
|
+
*/
|
|
32
|
+
import { _cloneArrayBuffer } from "./_cloneArrayBuffer.js";
|
|
33
|
+
/** Node's `Buffer`, when present; typed structurally because this package has no Node typings. */
|
|
34
|
+
const NodeBuffer = globalThis.Buffer;
|
|
35
|
+
/**
|
|
36
|
+
* Clones a typed array of any class, keeping its view offset and length over a copy of the whole buffer.
|
|
37
|
+
* A Node `Buffer` is copied through `Buffer.from`, since constructing one directly is deprecated.
|
|
38
|
+
*
|
|
39
|
+
* @param typedArray - The typed array to clone.
|
|
40
|
+
* @returns Returns the cloned typed array.
|
|
41
|
+
* @internal
|
|
42
|
+
*/
|
|
43
|
+
export function _cloneTypedArray(typedArray) {
|
|
44
|
+
if (NodeBuffer?.isBuffer(typedArray)) {
|
|
45
|
+
return NodeBuffer.from(typedArray);
|
|
46
|
+
}
|
|
47
|
+
const Ctor = typedArray.constructor;
|
|
48
|
+
return new Ctor(_cloneArrayBuffer(typedArray.buffer), typedArray.byteOffset, typedArray.length);
|
|
49
|
+
}
|
|
@@ -0,0 +1,12 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* Compares values to sort them in ascending order. Ordinary values come first, compared with `<` and `>`,
|
|
3
|
+
* followed by symbols, `null`, `undefined` and `NaN`, in that order. Values of the same group that are
|
|
4
|
+
* neither smaller nor greater than each other compare as equal.
|
|
5
|
+
*
|
|
6
|
+
* @param value - The value to compare.
|
|
7
|
+
* @param other - The other value to compare.
|
|
8
|
+
* @returns Returns the sort order indicator for `value`.
|
|
9
|
+
* @internal
|
|
10
|
+
*/
|
|
11
|
+
export declare function _compareAscending(value: unknown, other: unknown): number;
|
|
12
|
+
//# sourceMappingURL=_compareAscending.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"_compareAscending.d.ts","sourceRoot":"","sources":["../../src/_/_compareAscending.ts"],"names":[],"mappings":"AAmCA;;;;;;;;;GASG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,GAAG,MAAM,CAwBxE"}
|
|
@@ -0,0 +1,78 @@
|
|
|
1
|
+
// (C) 2026 GoodData Corporation
|
|
2
|
+
/*!
|
|
3
|
+
* Portions of this file are derived from Lodash.
|
|
4
|
+
* https://github.com/lodash/lodash
|
|
5
|
+
*
|
|
6
|
+
* Copyright OpenJS Foundation and other contributors <https://openjsf.org/>
|
|
7
|
+
*
|
|
8
|
+
* Based on Underscore.js, copyright Jeremy Ashkenas,
|
|
9
|
+
* DocumentCloud and Investigative Reporters & Editors <http://underscorejs.org/>
|
|
10
|
+
*
|
|
11
|
+
* Modifications Copyright (c) 2026 GoodData Corporation
|
|
12
|
+
*
|
|
13
|
+
* Permission is hereby granted, free of charge, to any person obtaining
|
|
14
|
+
* a copy of this software and associated documentation files (the
|
|
15
|
+
* "Software"), to deal in the Software without restriction, including
|
|
16
|
+
* without limitation the rights to use, copy, modify, merge, publish,
|
|
17
|
+
* distribute, sublicense, and/or sell copies of the Software, and to
|
|
18
|
+
* permit persons to whom the Software is furnished to do so, subject to
|
|
19
|
+
* the following conditions:
|
|
20
|
+
*
|
|
21
|
+
* The above copyright notice and this permission notice shall be
|
|
22
|
+
* included in all copies or substantial portions of the Software.
|
|
23
|
+
*
|
|
24
|
+
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
25
|
+
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
26
|
+
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
|
27
|
+
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
|
28
|
+
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
|
29
|
+
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
|
30
|
+
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
31
|
+
*/
|
|
32
|
+
import { _isSymbol } from "./isSymbol.js";
|
|
33
|
+
/**
|
|
34
|
+
* Compares values to sort them in ascending order. Ordinary values come first, compared with `<` and `>`,
|
|
35
|
+
* followed by symbols, `null`, `undefined` and `NaN`, in that order. Values of the same group that are
|
|
36
|
+
* neither smaller nor greater than each other compare as equal.
|
|
37
|
+
*
|
|
38
|
+
* @param value - The value to compare.
|
|
39
|
+
* @param other - The other value to compare.
|
|
40
|
+
* @returns Returns the sort order indicator for `value`.
|
|
41
|
+
* @internal
|
|
42
|
+
*/
|
|
43
|
+
export function _compareAscending(value, other) {
|
|
44
|
+
if (value === other) {
|
|
45
|
+
return 0;
|
|
46
|
+
}
|
|
47
|
+
const valueRank = _rank(value);
|
|
48
|
+
const otherRank = _rank(other);
|
|
49
|
+
if (valueRank !== otherRank) {
|
|
50
|
+
return valueRank < otherRank ? -1 : 1;
|
|
51
|
+
}
|
|
52
|
+
// only ordinary values are compared to each other; the relational operators handle any type pair
|
|
53
|
+
if (valueRank === 0) {
|
|
54
|
+
if (value > other) {
|
|
55
|
+
return 1;
|
|
56
|
+
}
|
|
57
|
+
if (value < other) {
|
|
58
|
+
return -1;
|
|
59
|
+
}
|
|
60
|
+
}
|
|
61
|
+
return 0;
|
|
62
|
+
}
|
|
63
|
+
function _rank(value) {
|
|
64
|
+
if (_isSymbol(value)) {
|
|
65
|
+
return 1;
|
|
66
|
+
}
|
|
67
|
+
if (value === null) {
|
|
68
|
+
return 2;
|
|
69
|
+
}
|
|
70
|
+
if (value === undefined) {
|
|
71
|
+
return 3;
|
|
72
|
+
}
|
|
73
|
+
// NaN is the only value that is not equal to itself
|
|
74
|
+
if (value !== value) {
|
|
75
|
+
return 4;
|
|
76
|
+
}
|
|
77
|
+
return 0;
|
|
78
|
+
}
|
|
@@ -0,0 +1,11 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* Creates a function like `_camelCase`: the string is deburred, stripped of apostrophes and split into words
|
|
3
|
+
* (on separators, case changes, digits and Unicode boundaries, as lodash does), which `callback` then folds
|
|
4
|
+
* into the result, receiving the result so far, the word and its index.
|
|
5
|
+
*
|
|
6
|
+
* @param callback - The function to combine each word.
|
|
7
|
+
* @returns Returns the new compounder function.
|
|
8
|
+
* @internal
|
|
9
|
+
*/
|
|
10
|
+
export declare function _createCompounder(callback: (result: string, word: string, index: number) => string): (string?: string) => string;
|
|
11
|
+
//# sourceMappingURL=_createCompounder.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"_createCompounder.d.ts","sourceRoot":"","sources":["../../src/_/_createCompounder.ts"],"names":[],"mappings":"AAuCA;;;;;;;;GAQG;AACH,wBAAgB,iBAAiB,CAC7B,QAAQ,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,KAAK,MAAM,GAClE,CAAC,MAAM,CAAC,EAAE,MAAM,KAAK,MAAM,CAE7B"}
|
|
@@ -0,0 +1,47 @@
|
|
|
1
|
+
// (C) 2026 GoodData Corporation
|
|
2
|
+
/*!
|
|
3
|
+
* Portions of this file are derived from Lodash.
|
|
4
|
+
* https://github.com/lodash/lodash
|
|
5
|
+
*
|
|
6
|
+
* Copyright OpenJS Foundation and other contributors <https://openjsf.org/>
|
|
7
|
+
*
|
|
8
|
+
* Based on Underscore.js, copyright Jeremy Ashkenas,
|
|
9
|
+
* DocumentCloud and Investigative Reporters & Editors <http://underscorejs.org/>
|
|
10
|
+
*
|
|
11
|
+
* Modifications Copyright (c) 2026 GoodData Corporation
|
|
12
|
+
*
|
|
13
|
+
* Permission is hereby granted, free of charge, to any person obtaining
|
|
14
|
+
* a copy of this software and associated documentation files (the
|
|
15
|
+
* "Software"), to deal in the Software without restriction, including
|
|
16
|
+
* without limitation the rights to use, copy, modify, merge, publish,
|
|
17
|
+
* distribute, sublicense, and/or sell copies of the Software, and to
|
|
18
|
+
* permit persons to whom the Software is furnished to do so, subject to
|
|
19
|
+
* the following conditions:
|
|
20
|
+
*
|
|
21
|
+
* The above copyright notice and this permission notice shall be
|
|
22
|
+
* included in all copies or substantial portions of the Software.
|
|
23
|
+
*
|
|
24
|
+
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
25
|
+
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
26
|
+
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
|
27
|
+
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
|
28
|
+
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
|
29
|
+
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
|
30
|
+
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
31
|
+
*/
|
|
32
|
+
import { _deburr } from "./deburr.js";
|
|
33
|
+
import { _words } from "./words.js";
|
|
34
|
+
/** Used to match apostrophes. */
|
|
35
|
+
const RE_APOS = /['’]/g;
|
|
36
|
+
/**
|
|
37
|
+
* Creates a function like `_camelCase`: the string is deburred, stripped of apostrophes and split into words
|
|
38
|
+
* (on separators, case changes, digits and Unicode boundaries, as lodash does), which `callback` then folds
|
|
39
|
+
* into the result, receiving the result so far, the word and its index.
|
|
40
|
+
*
|
|
41
|
+
* @param callback - The function to combine each word.
|
|
42
|
+
* @returns Returns the new compounder function.
|
|
43
|
+
* @internal
|
|
44
|
+
*/
|
|
45
|
+
export function _createCompounder(callback) {
|
|
46
|
+
return (string) => _words(_deburr(string).replace(RE_APOS, "")).reduce(callback, "");
|
|
47
|
+
}
|
|
@@ -0,0 +1,10 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* Initializes a plain-object clone with the same prototype. Prototype objects and objects without a
|
|
3
|
+
* constructor function, such as null-prototype objects, clone into ordinary `Object` instances.
|
|
4
|
+
*
|
|
5
|
+
* @param object - The object to clone.
|
|
6
|
+
* @returns Returns the initialized clone.
|
|
7
|
+
* @internal
|
|
8
|
+
*/
|
|
9
|
+
export declare function _initCloneObject(object: object): Record<PropertyKey, unknown>;
|
|
10
|
+
//# sourceMappingURL=_initCloneObject.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"_initCloneObject.d.ts","sourceRoot":"","sources":["../../src/_/_initCloneObject.ts"],"names":[],"mappings":"AAoCA;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,CAQ7E"}
|
|
@@ -0,0 +1,48 @@
|
|
|
1
|
+
// (C) 2026 GoodData Corporation
|
|
2
|
+
/*!
|
|
3
|
+
* Portions of this file are derived from Lodash.
|
|
4
|
+
* https://github.com/lodash/lodash
|
|
5
|
+
*
|
|
6
|
+
* Copyright OpenJS Foundation and other contributors <https://openjsf.org/>
|
|
7
|
+
*
|
|
8
|
+
* Based on Underscore.js, copyright Jeremy Ashkenas,
|
|
9
|
+
* DocumentCloud and Investigative Reporters & Editors <http://underscorejs.org/>
|
|
10
|
+
*
|
|
11
|
+
* Modifications Copyright (c) 2026 GoodData Corporation
|
|
12
|
+
*
|
|
13
|
+
* Permission is hereby granted, free of charge, to any person obtaining
|
|
14
|
+
* a copy of this software and associated documentation files (the
|
|
15
|
+
* "Software"), to deal in the Software without restriction, including
|
|
16
|
+
* without limitation the rights to use, copy, modify, merge, publish,
|
|
17
|
+
* distribute, sublicense, and/or sell copies of the Software, and to
|
|
18
|
+
* permit persons to whom the Software is furnished to do so, subject to
|
|
19
|
+
* the following conditions:
|
|
20
|
+
*
|
|
21
|
+
* The above copyright notice and this permission notice shall be
|
|
22
|
+
* included in all copies or substantial portions of the Software.
|
|
23
|
+
*
|
|
24
|
+
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
25
|
+
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
26
|
+
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
|
27
|
+
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
|
28
|
+
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
|
29
|
+
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
|
30
|
+
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
31
|
+
*/
|
|
32
|
+
import { _isPrototype } from "./_isPrototype.js";
|
|
33
|
+
import { _isObject } from "./isObject.js";
|
|
34
|
+
/**
|
|
35
|
+
* Initializes a plain-object clone with the same prototype. Prototype objects and objects without a
|
|
36
|
+
* constructor function, such as null-prototype objects, clone into ordinary `Object` instances.
|
|
37
|
+
*
|
|
38
|
+
* @param object - The object to clone.
|
|
39
|
+
* @returns Returns the initialized clone.
|
|
40
|
+
* @internal
|
|
41
|
+
*/
|
|
42
|
+
export function _initCloneObject(object) {
|
|
43
|
+
if (typeof object.constructor !== "function" || _isPrototype(object)) {
|
|
44
|
+
return {};
|
|
45
|
+
}
|
|
46
|
+
const proto = Object.getPrototypeOf(object);
|
|
47
|
+
return _isObject(proto) ? Object.create(proto) : {};
|
|
48
|
+
}
|
|
@@ -0,0 +1,27 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* Checks if `string` contains Unicode symbols: zero-width joiners, combining marks, variation selectors or
|
|
3
|
+
* code points from the astral planes.
|
|
4
|
+
*
|
|
5
|
+
* @param string - The string to inspect.
|
|
6
|
+
* @returns Returns `true` if a symbol is found, else `false`.
|
|
7
|
+
* @internal
|
|
8
|
+
*/
|
|
9
|
+
export declare function _hasUnicode(string: string): boolean;
|
|
10
|
+
/**
|
|
11
|
+
* Splits a Unicode `string` into an array of its symbols, keeping surrogate pairs, combining marks and
|
|
12
|
+
* joined emoji sequences together.
|
|
13
|
+
*
|
|
14
|
+
* @param string - The string to convert.
|
|
15
|
+
* @returns Returns the converted array.
|
|
16
|
+
* @internal
|
|
17
|
+
*/
|
|
18
|
+
export declare function _unicodeToArray(string: string): string[];
|
|
19
|
+
/**
|
|
20
|
+
* Splits a Unicode `string` into an array of its words.
|
|
21
|
+
*
|
|
22
|
+
* @param string - The string to inspect.
|
|
23
|
+
* @returns Returns the words of `string`.
|
|
24
|
+
* @internal
|
|
25
|
+
*/
|
|
26
|
+
export declare function _unicodeWords(string: string): string[];
|
|
27
|
+
//# sourceMappingURL=_unicode.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"_unicode.d.ts","sourceRoot":"","sources":["../../src/_/_unicode.ts"],"names":[],"mappings":"AAoGA;;;;;;;GAOG;AACH,wBAAgB,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAEnD;AAED;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,CAExD;AAED;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,CAEtD"}
|
|
@@ -0,0 +1,120 @@
|
|
|
1
|
+
// (C) 2026 GoodData Corporation
|
|
2
|
+
/*!
|
|
3
|
+
* Portions of this file are derived from Lodash.
|
|
4
|
+
* https://github.com/lodash/lodash
|
|
5
|
+
*
|
|
6
|
+
* Copyright OpenJS Foundation and other contributors <https://openjsf.org/>
|
|
7
|
+
*
|
|
8
|
+
* Based on Underscore.js, copyright Jeremy Ashkenas,
|
|
9
|
+
* DocumentCloud and Investigative Reporters & Editors <http://underscorejs.org/>
|
|
10
|
+
*
|
|
11
|
+
* Modifications Copyright (c) 2026 GoodData Corporation
|
|
12
|
+
*
|
|
13
|
+
* Permission is hereby granted, free of charge, to any person obtaining
|
|
14
|
+
* a copy of this software and associated documentation files (the
|
|
15
|
+
* "Software"), to deal in the Software without restriction, including
|
|
16
|
+
* without limitation the rights to use, copy, modify, merge, publish,
|
|
17
|
+
* distribute, sublicense, and/or sell copies of the Software, and to
|
|
18
|
+
* permit persons to whom the Software is furnished to do so, subject to
|
|
19
|
+
* the following conditions:
|
|
20
|
+
*
|
|
21
|
+
* The above copyright notice and this permission notice shall be
|
|
22
|
+
* included in all copies or substantial portions of the Software.
|
|
23
|
+
*
|
|
24
|
+
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
25
|
+
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
26
|
+
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
|
27
|
+
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
|
28
|
+
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
|
29
|
+
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
|
30
|
+
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
31
|
+
*/
|
|
32
|
+
/** Used to compose unicode character classes. */
|
|
33
|
+
const RS_ASTRAL_RANGE = "\\ud800-\\udfff";
|
|
34
|
+
const RS_COMBO_RANGE = "\\u0300-\\u036f\\ufe20-\\ufe2f\\u20d0-\\u20ff";
|
|
35
|
+
const RS_DINGBAT_RANGE = "\\u2700-\\u27bf";
|
|
36
|
+
const RS_LOWER_RANGE = "a-z\\xdf-\\xf6\\xf8-\\xff";
|
|
37
|
+
const RS_MATH_OP_RANGE = "\\xac\\xb1\\xd7\\xf7";
|
|
38
|
+
const RS_NON_CHAR_RANGE = "\\x00-\\x2f\\x3a-\\x40\\x5b-\\x60\\x7b-\\xbf";
|
|
39
|
+
const RS_PUNCTUATION_RANGE = "\\u2000-\\u206f";
|
|
40
|
+
const RS_SPACE_RANGE = " \\t\\x0b\\f\\xa0\\ufeff\\n\\r\\u2028\\u2029\\u1680\\u180e\\u2000\\u2001\\u2002\\u2003\\u2004\\u2005\\u2006\\u2007\\u2008\\u2009\\u200a\\u202f\\u205f\\u3000";
|
|
41
|
+
const RS_UPPER_RANGE = "A-Z\\xc0-\\xd6\\xd8-\\xde";
|
|
42
|
+
const RS_VAR_RANGE = "\\ufe0e\\ufe0f";
|
|
43
|
+
const RS_BREAK_RANGE = RS_MATH_OP_RANGE + RS_NON_CHAR_RANGE + RS_PUNCTUATION_RANGE + RS_SPACE_RANGE;
|
|
44
|
+
/** Used to compose unicode capture groups. */
|
|
45
|
+
const RS_APOS = "['’]";
|
|
46
|
+
const RS_ASTRAL = `[${RS_ASTRAL_RANGE}]`;
|
|
47
|
+
const RS_BREAK = `[${RS_BREAK_RANGE}]`;
|
|
48
|
+
const RS_COMBO = `[${RS_COMBO_RANGE}]`;
|
|
49
|
+
const RS_DIGITS = "\\d+";
|
|
50
|
+
const RS_DINGBAT = `[${RS_DINGBAT_RANGE}]`;
|
|
51
|
+
const RS_LOWER = `[${RS_LOWER_RANGE}]`;
|
|
52
|
+
const RS_MISC = `[^${RS_ASTRAL_RANGE}${RS_BREAK_RANGE}${RS_DIGITS}${RS_DINGBAT_RANGE}${RS_LOWER_RANGE}${RS_UPPER_RANGE}]`;
|
|
53
|
+
const RS_FITZ = "\\ud83c[\\udffb-\\udfff]";
|
|
54
|
+
const RS_MODIFIER = `(?:${RS_COMBO}|${RS_FITZ})`;
|
|
55
|
+
const RS_NON_ASTRAL = `[^${RS_ASTRAL_RANGE}]`;
|
|
56
|
+
const RS_REGIONAL = "(?:\\ud83c[\\udde6-\\uddff]){2}";
|
|
57
|
+
const RS_SURR_PAIR = "[\\ud800-\\udbff][\\udc00-\\udfff]";
|
|
58
|
+
const RS_UPPER = `[${RS_UPPER_RANGE}]`;
|
|
59
|
+
const RS_ZWJ = "\\u200d";
|
|
60
|
+
/** Used to compose unicode regexes. */
|
|
61
|
+
const RS_MISC_LOWER = `(?:${RS_LOWER}|${RS_MISC})`;
|
|
62
|
+
const RS_MISC_UPPER = `(?:${RS_UPPER}|${RS_MISC})`;
|
|
63
|
+
const RS_OPT_CONTR_LOWER = `(?:${RS_APOS}(?:d|ll|m|re|s|t|ve))?`;
|
|
64
|
+
const RS_OPT_CONTR_UPPER = `(?:${RS_APOS}(?:D|LL|M|RE|S|T|VE))?`;
|
|
65
|
+
const RE_OPT_MOD = `${RS_MODIFIER}?`;
|
|
66
|
+
const RS_OPT_VAR = `[${RS_VAR_RANGE}]?`;
|
|
67
|
+
const RS_OPT_JOIN = `(?:${RS_ZWJ}(?:${[RS_NON_ASTRAL, RS_REGIONAL, RS_SURR_PAIR].join("|")})${RS_OPT_VAR}${RE_OPT_MOD})*`;
|
|
68
|
+
const RS_ORD_LOWER = "\\d*(?:1st|2nd|3rd|(?![123])\\dth)(?=\\b|[A-Z_])";
|
|
69
|
+
const RS_ORD_UPPER = "\\d*(?:1ST|2ND|3RD|(?![123])\\dTH)(?=\\b|[a-z_])";
|
|
70
|
+
const RS_SEQ = RS_OPT_VAR + RE_OPT_MOD + RS_OPT_JOIN;
|
|
71
|
+
const RS_EMOJI = `(?:${[RS_DINGBAT, RS_REGIONAL, RS_SURR_PAIR].join("|")})${RS_SEQ}`;
|
|
72
|
+
const RS_NON_ASTRAL_COMBO = `${RS_NON_ASTRAL}${RS_COMBO}?`;
|
|
73
|
+
const RS_SYMBOL = `(?:${[RS_NON_ASTRAL_COMBO, RS_COMBO, RS_REGIONAL, RS_SURR_PAIR, RS_ASTRAL].join("|")})`;
|
|
74
|
+
/** Used to detect strings with zero-width joiners or code points from the astral planes. */
|
|
75
|
+
const RE_HAS_UNICODE = new RegExp(`[${RS_ZWJ}${RS_ASTRAL_RANGE}${RS_COMBO_RANGE}${RS_VAR_RANGE}]`);
|
|
76
|
+
/** Used to match string symbols, that is, what a user would perceive as one character. */
|
|
77
|
+
const RE_UNICODE = new RegExp(`${RS_FITZ}(?=${RS_FITZ})|${RS_SYMBOL}${RS_SEQ}`, "g");
|
|
78
|
+
/** Used to match complex or compound words. */
|
|
79
|
+
const RE_UNICODE_WORD = new RegExp([
|
|
80
|
+
`${RS_UPPER}?${RS_LOWER}+${RS_OPT_CONTR_LOWER}(?=${[RS_BREAK, RS_UPPER, "$"].join("|")})`,
|
|
81
|
+
`${RS_MISC_UPPER}+${RS_OPT_CONTR_UPPER}(?=${[RS_BREAK, RS_UPPER + RS_MISC_LOWER, "$"].join("|")})`,
|
|
82
|
+
`${RS_UPPER}?${RS_MISC_LOWER}+${RS_OPT_CONTR_LOWER}`,
|
|
83
|
+
`${RS_UPPER}+${RS_OPT_CONTR_UPPER}`,
|
|
84
|
+
RS_ORD_UPPER,
|
|
85
|
+
RS_ORD_LOWER,
|
|
86
|
+
RS_DIGITS,
|
|
87
|
+
RS_EMOJI,
|
|
88
|
+
].join("|"), "g");
|
|
89
|
+
/**
|
|
90
|
+
* Checks if `string` contains Unicode symbols: zero-width joiners, combining marks, variation selectors or
|
|
91
|
+
* code points from the astral planes.
|
|
92
|
+
*
|
|
93
|
+
* @param string - The string to inspect.
|
|
94
|
+
* @returns Returns `true` if a symbol is found, else `false`.
|
|
95
|
+
* @internal
|
|
96
|
+
*/
|
|
97
|
+
export function _hasUnicode(string) {
|
|
98
|
+
return RE_HAS_UNICODE.test(string);
|
|
99
|
+
}
|
|
100
|
+
/**
|
|
101
|
+
* Splits a Unicode `string` into an array of its symbols, keeping surrogate pairs, combining marks and
|
|
102
|
+
* joined emoji sequences together.
|
|
103
|
+
*
|
|
104
|
+
* @param string - The string to convert.
|
|
105
|
+
* @returns Returns the converted array.
|
|
106
|
+
* @internal
|
|
107
|
+
*/
|
|
108
|
+
export function _unicodeToArray(string) {
|
|
109
|
+
return string.match(RE_UNICODE) ?? [];
|
|
110
|
+
}
|
|
111
|
+
/**
|
|
112
|
+
* Splits a Unicode `string` into an array of its words.
|
|
113
|
+
*
|
|
114
|
+
* @param string - The string to inspect.
|
|
115
|
+
* @returns Returns the words of `string`.
|
|
116
|
+
* @internal
|
|
117
|
+
*/
|
|
118
|
+
export function _unicodeWords(string) {
|
|
119
|
+
return string.match(RE_UNICODE_WORD) ?? [];
|
|
120
|
+
}
|
|
@@ -0,0 +1,10 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* Converts `string` to camel case: the words of the string, lower-cased, with every word but the first
|
|
3
|
+
* capitalised, joined together.
|
|
4
|
+
*
|
|
5
|
+
* @param string - The string to convert.
|
|
6
|
+
* @returns Returns the camel cased string.
|
|
7
|
+
* @internal
|
|
8
|
+
*/
|
|
9
|
+
export declare const _camelCase: (string?: string) => string;
|
|
10
|
+
//# sourceMappingURL=camelCase.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"camelCase.d.ts","sourceRoot":"","sources":["../../src/_/camelCase.ts"],"names":[],"mappings":"AAoCA;;;;;;;GAOG;AACH,eAAO,MAAM,UAAU,EAAE,CAAC,MAAM,CAAC,EAAE,MAAM,KAAK,MAI5C,CAAC"}
|
|
@@ -0,0 +1,45 @@
|
|
|
1
|
+
// (C) 2026 GoodData Corporation
|
|
2
|
+
/*!
|
|
3
|
+
* Portions of this file are derived from Lodash.
|
|
4
|
+
* https://github.com/lodash/lodash
|
|
5
|
+
*
|
|
6
|
+
* Copyright OpenJS Foundation and other contributors <https://openjsf.org/>
|
|
7
|
+
*
|
|
8
|
+
* Based on Underscore.js, copyright Jeremy Ashkenas,
|
|
9
|
+
* DocumentCloud and Investigative Reporters & Editors <http://underscorejs.org/>
|
|
10
|
+
*
|
|
11
|
+
* Modifications Copyright (c) 2026 GoodData Corporation
|
|
12
|
+
*
|
|
13
|
+
* Permission is hereby granted, free of charge, to any person obtaining
|
|
14
|
+
* a copy of this software and associated documentation files (the
|
|
15
|
+
* "Software"), to deal in the Software without restriction, including
|
|
16
|
+
* without limitation the rights to use, copy, modify, merge, publish,
|
|
17
|
+
* distribute, sublicense, and/or sell copies of the Software, and to
|
|
18
|
+
* permit persons to whom the Software is furnished to do so, subject to
|
|
19
|
+
* the following conditions:
|
|
20
|
+
*
|
|
21
|
+
* The above copyright notice and this permission notice shall be
|
|
22
|
+
* included in all copies or substantial portions of the Software.
|
|
23
|
+
*
|
|
24
|
+
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
25
|
+
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
26
|
+
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
|
27
|
+
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
|
28
|
+
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
|
29
|
+
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
|
30
|
+
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
31
|
+
*/
|
|
32
|
+
import { _createCompounder } from "./_createCompounder.js";
|
|
33
|
+
import { _upperFirst } from "./upperFirst.js";
|
|
34
|
+
/**
|
|
35
|
+
* Converts `string` to camel case: the words of the string, lower-cased, with every word but the first
|
|
36
|
+
* capitalised, joined together.
|
|
37
|
+
*
|
|
38
|
+
* @param string - The string to convert.
|
|
39
|
+
* @returns Returns the camel cased string.
|
|
40
|
+
* @internal
|
|
41
|
+
*/
|
|
42
|
+
export const _camelCase = _createCompounder((result, word, index) => {
|
|
43
|
+
const lower = word.toLowerCase();
|
|
44
|
+
return result + (index ? _upperFirst(lower) : lower);
|
|
45
|
+
});
|
|
@@ -0,0 +1,9 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* Converts the first character of `string` to upper case and the remaining to lower case.
|
|
3
|
+
*
|
|
4
|
+
* @param string - The string to capitalize.
|
|
5
|
+
* @returns Returns the capitalized string.
|
|
6
|
+
* @internal
|
|
7
|
+
*/
|
|
8
|
+
export declare function _capitalize(string?: string): string;
|
|
9
|
+
//# sourceMappingURL=capitalize.d.ts.map
|