@gooddata/util 11.68.0-alpha.1 → 11.68.0-alpha.11
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 +179 -0
- package/esm/_/_assignValue.d.ts +12 -0
- package/esm/_/_assignValue.d.ts.map +1 -0
- package/esm/_/_assignValue.js +49 -0
- 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 +28 -0
- package/esm/_/_baseClone.d.ts.map +1 -0
- package/esm/_/_baseClone.js +229 -0
- package/esm/_/_baseDifference.d.ts +18 -0
- package/esm/_/_baseDifference.d.ts.map +1 -0
- package/esm/_/_baseDifference.js +79 -0
- package/esm/_/_baseEach.d.ts +11 -0
- package/esm/_/_baseEach.d.ts.map +1 -0
- package/esm/_/_baseEach.js +62 -0
- package/esm/_/_baseExtremum.d.ts +15 -0
- package/esm/_/_baseExtremum.d.ts.map +1 -0
- package/esm/_/_baseExtremum.js +64 -0
- package/esm/_/_baseGet.d.ts +10 -0
- package/esm/_/_baseGet.d.ts.map +1 -0
- package/esm/_/_baseGet.js +50 -0
- package/esm/_/_baseGetTag.d.ts +9 -0
- package/esm/_/_baseGetTag.d.ts.map +1 -0
- package/esm/_/_baseGetTag.js +48 -0
- package/esm/_/_baseIntersection.d.ts +19 -0
- package/esm/_/_baseIntersection.d.ts.map +1 -0
- package/esm/_/_baseIntersection.js +91 -0
- package/esm/_/_baseIsEqual.d.ts +34 -0
- package/esm/_/_baseIsEqual.d.ts.map +1 -0
- package/esm/_/_baseIsEqual.js +278 -0
- package/esm/_/_baseIsMatch.d.ts +13 -0
- package/esm/_/_baseIsMatch.d.ts.map +1 -0
- package/esm/_/_baseIsMatch.js +67 -0
- package/esm/_/_baseIteratee.d.ts +15 -0
- package/esm/_/_baseIteratee.d.ts.map +1 -0
- package/esm/_/_baseIteratee.js +65 -0
- package/esm/_/_baseKeys.d.ts +12 -0
- package/esm/_/_baseKeys.d.ts.map +1 -0
- package/esm/_/_baseKeys.js +46 -0
- package/esm/_/_baseMatches.d.ts +10 -0
- package/esm/_/_baseMatches.d.ts.map +1 -0
- package/esm/_/_baseMatches.js +50 -0
- package/esm/_/_baseMatchesProperty.d.ts +11 -0
- package/esm/_/_baseMatchesProperty.d.ts.map +1 -0
- package/esm/_/_baseMatchesProperty.js +59 -0
- package/esm/_/_baseMerge.d.ts +19 -0
- package/esm/_/_baseMerge.d.ts.map +1 -0
- package/esm/_/_baseMerge.js +146 -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/_/_baseSet.d.ts +13 -0
- package/esm/_/_baseSet.d.ts.map +1 -0
- package/esm/_/_baseSet.js +74 -0
- package/esm/_/_baseSlice.d.ts +45 -0
- package/esm/_/_baseSlice.d.ts.map +1 -0
- package/esm/_/_baseSlice.js +30 -0
- package/esm/_/_baseSum.d.ts +42 -0
- package/esm/_/_baseSum.d.ts.map +1 -0
- package/esm/_/_baseSum.js +21 -0
- package/esm/_/_baseUniq.d.ts +43 -0
- package/esm/_/_baseUniq.d.ts.map +1 -0
- package/esm/_/_baseUniq.js +57 -0
- package/esm/_/_baseUnset.d.ts +13 -0
- package/esm/_/_baseUnset.d.ts.map +1 -0
- package/esm/_/_baseUnset.js +62 -0
- package/esm/_/_castPath.d.ts +10 -0
- package/esm/_/_castPath.d.ts.map +1 -0
- package/esm/_/_castPath.js +48 -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 +50 -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/_/_flattenArrayLikeObjects.d.ts +11 -0
- package/esm/_/_flattenArrayLikeObjects.d.ts.map +1 -0
- package/esm/_/_flattenArrayLikeObjects.js +55 -0
- package/esm/_/_getAllKeys.d.ts +9 -0
- package/esm/_/_getAllKeys.d.ts.map +1 -0
- package/esm/_/_getAllKeys.js +43 -0
- package/esm/_/_getAllKeysIn.d.ts +12 -0
- package/esm/_/_getAllKeysIn.d.ts.map +1 -0
- package/esm/_/_getAllKeysIn.js +59 -0
- package/esm/_/_getMatchData.d.ts +16 -0
- package/esm/_/_getMatchData.d.ts.map +1 -0
- package/esm/_/_getMatchData.js +46 -0
- package/esm/_/_getRawTag.d.ts +43 -0
- package/esm/_/_getRawTag.d.ts.map +1 -0
- package/esm/_/_getRawTag.js +65 -0
- package/esm/_/_hasPath.d.ts +13 -0
- package/esm/_/_hasPath.d.ts.map +1 -0
- package/esm/_/_hasPath.js +70 -0
- package/esm/_/_initCloneObject.d.ts +10 -0
- package/esm/_/_initCloneObject.d.ts.map +1 -0
- package/esm/_/_initCloneObject.js +48 -0
- package/esm/_/_isIndex.d.ts +11 -0
- package/esm/_/_isIndex.d.ts.map +1 -0
- package/esm/_/_isIndex.js +51 -0
- package/esm/_/_isIterateeCall.d.ts +13 -0
- package/esm/_/_isIterateeCall.d.ts.map +1 -0
- package/esm/_/_isIterateeCall.js +55 -0
- package/esm/_/_isKey.d.ts +12 -0
- package/esm/_/_isKey.d.ts.map +1 -0
- package/esm/_/_isKey.js +58 -0
- package/esm/_/_isPrototype.d.ts +39 -0
- package/esm/_/_isPrototype.d.ts.map +1 -0
- package/esm/_/_isPrototype.js +43 -0
- package/esm/_/_isStrictComparable.d.ts +9 -0
- package/esm/_/_isStrictComparable.d.ts.map +1 -0
- package/esm/_/_isStrictComparable.js +42 -0
- package/esm/_/_matchesStrictComparable.d.ts +41 -0
- package/esm/_/_matchesStrictComparable.d.ts.map +1 -0
- package/esm/_/_matchesStrictComparable.js +50 -0
- package/esm/_/_stringToPath.d.ts +10 -0
- package/esm/_/_stringToPath.d.ts.map +1 -0
- package/esm/_/_stringToPath.js +64 -0
- package/esm/_/_toKey.d.ts +9 -0
- package/esm/_/_toKey.d.ts.map +1 -0
- package/esm/_/_toKey.js +46 -0
- package/esm/_/_unicode.d.ts +27 -0
- package/esm/_/_unicode.d.ts.map +1 -0
- package/esm/_/_unicode.js +120 -0
- package/esm/_/assignIn.d.ts +35 -0
- package/esm/_/assignIn.d.ts.map +1 -0
- package/esm/_/assignIn.js +50 -0
- package/esm/_/bindAll.d.ts +16 -0
- package/esm/_/bindAll.d.ts.map +1 -0
- package/esm/_/bindAll.js +88 -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/_/chunk.d.ts +15 -0
- package/esm/_/chunk.d.ts.map +1 -0
- package/esm/_/chunk.js +61 -0
- package/esm/_/clamp.d.ts +17 -0
- package/esm/_/clamp.d.ts.map +1 -0
- package/esm/_/clamp.js +56 -0
- package/esm/_/clone.d.ts +12 -0
- package/esm/_/clone.d.ts.map +1 -0
- package/esm/_/clone.js +45 -0
- package/esm/_/cloneDeep.d.ts +14 -0
- package/esm/_/cloneDeep.d.ts.map +1 -0
- package/esm/_/cloneDeep.js +47 -0
- package/esm/_/cloneDeepWith.d.ts +18 -0
- package/esm/_/cloneDeepWith.d.ts.map +1 -0
- package/esm/_/cloneDeepWith.js +36 -0
- package/esm/_/compact.d.ts +46 -0
- package/esm/_/compact.d.ts.map +1 -0
- package/esm/_/compact.js +23 -0
- package/esm/_/constant.d.ts +39 -0
- package/esm/_/constant.d.ts.map +1 -0
- package/esm/_/constant.js +43 -0
- package/esm/_/debounce.d.ts +70 -0
- package/esm/_/debounce.d.ts.map +1 -0
- package/esm/_/debounce.js +136 -0
- package/esm/_/deburr.d.ts +10 -0
- package/esm/_/deburr.d.ts.map +1 -0
- package/esm/_/deburr.js +243 -0
- package/esm/_/defaults.d.ts +36 -0
- package/esm/_/defaults.d.ts.map +1 -0
- package/esm/_/defaults.js +51 -0
- package/esm/_/difference.d.ts +14 -0
- package/esm/_/difference.d.ts.map +1 -0
- package/esm/_/difference.js +46 -0
- package/esm/_/differenceBy.d.ts +39 -0
- package/esm/_/differenceBy.d.ts.map +1 -0
- package/esm/_/differenceBy.js +40 -0
- package/esm/_/differenceWith.d.ts +27 -0
- package/esm/_/differenceWith.d.ts.map +1 -0
- package/esm/_/differenceWith.js +39 -0
- package/esm/_/dropRightWhile.d.ts +13 -0
- package/esm/_/dropRightWhile.d.ts.map +1 -0
- package/esm/_/dropRightWhile.js +54 -0
- package/esm/_/eq.d.ts +41 -0
- package/esm/_/eq.d.ts.map +1 -0
- package/esm/_/eq.js +43 -0
- package/esm/_/escape.d.ts +13 -0
- package/esm/_/escape.d.ts.map +1 -0
- package/esm/_/escape.js +56 -0
- package/esm/_/escapeRegExp.d.ts +12 -0
- package/esm/_/escapeRegExp.d.ts.map +1 -0
- package/esm/_/escapeRegExp.js +47 -0
- package/esm/_/findKey.d.ts +14 -0
- package/esm/_/findKey.d.ts.map +1 -0
- package/esm/_/findKey.js +58 -0
- package/esm/_/findLastIndex.d.ts +16 -0
- package/esm/_/findLastIndex.d.ts.map +1 -0
- package/esm/_/findLastIndex.js +67 -0
- package/esm/_/get.d.ts +78 -0
- package/esm/_/get.d.ts.map +1 -0
- package/esm/_/get.js +36 -0
- package/esm/_/groupBy.d.ts +19 -0
- package/esm/_/groupBy.d.ts.map +1 -0
- package/esm/_/groupBy.js +49 -0
- package/esm/_/has.d.ts +23 -0
- package/esm/_/has.d.ts.map +1 -0
- package/esm/_/has.js +35 -0
- package/esm/_/inRange.d.ts +14 -0
- package/esm/_/inRange.d.ts.map +1 -0
- package/esm/_/inRange.js +51 -0
- package/esm/_/initial.d.ts +11 -0
- package/esm/_/initial.d.ts.map +1 -0
- package/esm/_/initial.js +44 -0
- package/esm/_/intersection.d.ts +13 -0
- package/esm/_/intersection.d.ts.map +1 -0
- package/esm/_/intersection.js +45 -0
- package/esm/_/intersectionBy.d.ts +32 -0
- package/esm/_/intersectionBy.d.ts.map +1 -0
- package/esm/_/intersectionBy.js +41 -0
- package/esm/_/intersectionWith.d.ts +28 -0
- package/esm/_/intersectionWith.d.ts.map +1 -0
- package/esm/_/intersectionWith.js +38 -0
- package/esm/_/invert.d.ts +14 -0
- package/esm/_/invert.d.ts.map +1 -0
- package/esm/_/invert.js +55 -0
- package/esm/_/isArguments.d.ts +9 -0
- package/esm/_/isArguments.d.ts.map +1 -0
- package/esm/_/isArguments.js +45 -0
- package/esm/_/isArray.d.ts +61 -0
- package/esm/_/isArray.d.ts.map +1 -0
- package/esm/_/isArray.js +62 -0
- package/esm/_/isArrayLike.d.ts +25 -0
- package/esm/_/isArrayLike.d.ts.map +1 -0
- package/esm/_/isArrayLike.js +35 -0
- package/esm/_/isEmpty.d.ts +49 -0
- package/esm/_/isEmpty.d.ts.map +1 -0
- package/esm/_/isEmpty.js +57 -0
- package/esm/_/isEqual.d.ts +15 -0
- package/esm/_/isEqual.d.ts.map +1 -0
- package/esm/_/isEqual.js +48 -0
- package/esm/_/isError.d.ts +11 -0
- package/esm/_/isError.d.ts.map +1 -0
- package/esm/_/isError.js +57 -0
- package/esm/_/isLength.d.ts +41 -0
- package/esm/_/isLength.d.ts.map +1 -0
- package/esm/_/isLength.js +43 -0
- package/esm/_/isObject.d.ts +40 -0
- package/esm/_/isObject.d.ts.map +1 -0
- package/esm/_/isObject.js +42 -0
- package/esm/_/isObjectLike.d.ts +40 -0
- package/esm/_/isObjectLike.d.ts.map +1 -0
- package/esm/_/isObjectLike.js +42 -0
- package/esm/_/isPlainObject.d.ts +10 -0
- package/esm/_/isPlainObject.d.ts.map +1 -0
- package/esm/_/isPlainObject.js +58 -0
- package/esm/_/isSymbol.d.ts +9 -0
- package/esm/_/isSymbol.d.ts.map +1 -0
- package/esm/_/isSymbol.js +45 -0
- package/esm/_/isTypedArray.d.ts +43 -0
- package/esm/_/isTypedArray.d.ts.map +1 -0
- package/esm/_/isTypedArray.js +45 -0
- 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/_/keys.d.ts +11 -0
- package/esm/_/keys.d.ts.map +1 -0
- package/esm/_/keys.js +60 -0
- package/esm/_/keysIn.d.ts +10 -0
- package/esm/_/keysIn.d.ts.map +1 -0
- package/esm/_/keysIn.js +54 -0
- package/esm/_/mapValues.d.ts +63 -0
- package/esm/_/mapValues.d.ts.map +1 -0
- package/esm/_/mapValues.js +47 -0
- package/esm/_/max.d.ts +16 -0
- package/esm/_/max.d.ts.map +1 -0
- package/esm/_/max.js +37 -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/_/mergeWith.d.ts +34 -0
- package/esm/_/mergeWith.d.ts.map +1 -0
- package/esm/_/mergeWith.js +50 -0
- package/esm/_/min.d.ts +16 -0
- package/esm/_/min.d.ts.map +1 -0
- package/esm/_/min.js +37 -0
- package/esm/_/negate.d.ts +41 -0
- package/esm/_/negate.d.ts.map +1 -0
- package/esm/_/negate.js +48 -0
- package/esm/_/omit.d.ts +27 -0
- package/esm/_/omit.d.ts.map +1 -0
- package/esm/_/omit.js +76 -0
- 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/_/range.d.ts +24 -0
- package/esm/_/range.d.ts.map +1 -0
- package/esm/_/range.js +56 -0
- package/esm/_/reduce.d.ts +37 -0
- package/esm/_/reduce.d.ts.map +1 -0
- package/esm/_/reduce.js +48 -0
- package/esm/_/set.d.ts +25 -0
- package/esm/_/set.d.ts.map +1 -0
- package/esm/_/set.js +35 -0
- package/esm/_/sortBy.d.ts +17 -0
- package/esm/_/sortBy.d.ts.map +1 -0
- package/esm/_/sortBy.js +46 -0
- package/esm/_/sumBy.d.ts +14 -0
- package/esm/_/sumBy.d.ts.map +1 -0
- package/esm/_/sumBy.js +47 -0
- package/esm/_/tail.d.ts +15 -0
- package/esm/_/tail.d.ts.map +1 -0
- package/esm/_/tail.js +36 -0
- package/esm/_/throttle.d.ts +76 -0
- package/esm/_/throttle.d.ts.map +1 -0
- package/esm/_/throttle.js +45 -0
- package/esm/_/times.d.ts +17 -0
- package/esm/_/times.d.ts.map +1 -0
- package/esm/_/times.js +57 -0
- package/esm/_/toFinite.d.ts +10 -0
- package/esm/_/toFinite.d.ts.map +1 -0
- package/esm/_/toFinite.js +50 -0
- package/esm/_/toInteger.d.ts +11 -0
- package/esm/_/toInteger.d.ts.map +1 -0
- package/esm/_/toInteger.js +46 -0
- package/esm/_/toNumber.d.ts +11 -0
- package/esm/_/toNumber.d.ts.map +1 -0
- package/esm/_/toNumber.js +69 -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 +181 -0
- package/esm/_/types.d.ts.map +1 -0
- package/esm/_/types.js +2 -0
- package/esm/_/unescape.d.ts +13 -0
- package/esm/_/unescape.d.ts.map +1 -0
- package/esm/_/unescape.js +56 -0
- package/esm/_/union.d.ts +11 -0
- package/esm/_/union.d.ts.map +1 -0
- package/esm/_/union.js +44 -0
- package/esm/_/unionBy.d.ts +34 -0
- package/esm/_/unionBy.d.ts.map +1 -0
- package/esm/_/unionBy.js +42 -0
- package/esm/_/uniq.d.ts +12 -0
- package/esm/_/uniq.d.ts.map +1 -0
- package/esm/_/uniq.js +47 -0
- package/esm/_/uniqBy.d.ts +13 -0
- package/esm/_/uniqBy.d.ts.map +1 -0
- package/esm/_/uniqBy.js +49 -0
- package/esm/_/uniqWith.d.ts +14 -0
- package/esm/_/uniqWith.d.ts.map +1 -0
- package/esm/_/uniqWith.js +59 -0
- package/esm/_/update.d.ts +17 -0
- package/esm/_/update.d.ts.map +1 -0
- package/esm/_/update.js +55 -0
- package/esm/_/updateWith.d.ts +23 -0
- package/esm/_/updateWith.d.ts.map +1 -0
- package/esm/_/updateWith.js +41 -0
- package/esm/_/upperFirst.d.ts +10 -0
- package/esm/_/upperFirst.d.ts.map +1 -0
- package/esm/_/upperFirst.js +46 -0
- package/esm/_/without.d.ts +15 -0
- package/esm/_/without.d.ts.map +1 -0
- package/esm/_/without.js +47 -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 +69 -0
- package/esm/index.d.ts.map +1 -1
- package/esm/index.js +69 -0
- package/esm/util.d.ts +1870 -67
- package/package.json +5 -4
|
@@ -0,0 +1,19 @@
|
|
|
1
|
+
import type { _MergeWithCustomizer } from "./types.js";
|
|
2
|
+
type _AnyRecord = Record<PropertyKey, unknown>;
|
|
3
|
+
/** Tracks each traversed source value and its merged counterpart, so cycles and shared references are kept. */
|
|
4
|
+
type _Stack = Map<unknown, unknown>;
|
|
5
|
+
/**
|
|
6
|
+
* The base implementation of `_merge` and `_mergeWith` for a single source: merges the own and inherited
|
|
7
|
+
* enumerable string keyed properties of `source` into `object`. When a `customizer` is given it is invoked
|
|
8
|
+
* per property with (objValue, srcValue, key, object, source, stack), and a result other than `undefined`
|
|
9
|
+
* is used as the merged value instead of the default merge.
|
|
10
|
+
*
|
|
11
|
+
* @param object - The destination object.
|
|
12
|
+
* @param source - The source object.
|
|
13
|
+
* @param stack - Tracks traversed source values and their merged counterparts.
|
|
14
|
+
* @param customizer - The function to customize assigned values.
|
|
15
|
+
* @internal
|
|
16
|
+
*/
|
|
17
|
+
export declare function _baseMerge(object: _AnyRecord, source: _AnyRecord, stack: _Stack, customizer?: _MergeWithCustomizer): void;
|
|
18
|
+
export {};
|
|
19
|
+
//# sourceMappingURL=_baseMerge.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"_baseMerge.d.ts","sourceRoot":"","sources":["../../src/_/_baseMerge.ts"],"names":[],"mappings":"AA4CA,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,YAAY,CAAC;AAEvD,KAAK,UAAU,GAAG,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;AAE/C,+GAA+G;AAC/G,KAAK,MAAM,GAAG,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;AAEpC;;;;;;;;;;;GAWG;AACH,wBAAgB,UAAU,CACtB,MAAM,EAAE,UAAU,EAClB,MAAM,EAAE,UAAU,EAClB,KAAK,EAAE,MAAM,EACb,UAAU,CAAC,EAAE,oBAAoB,GAClC,IAAI,CAkBN"}
|
|
@@ -0,0 +1,146 @@
|
|
|
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 { _baseAssignValue } from "./_baseAssignValue.js";
|
|
33
|
+
import { _cloneTypedArray } from "./_cloneTypedArray.js";
|
|
34
|
+
import { _initCloneObject } from "./_initCloneObject.js";
|
|
35
|
+
import { _eq } from "./eq.js";
|
|
36
|
+
import { _isArguments } from "./isArguments.js";
|
|
37
|
+
import { _isArrayLike } from "./isArrayLike.js";
|
|
38
|
+
import { _isObject } from "./isObject.js";
|
|
39
|
+
import { _isObjectLike } from "./isObjectLike.js";
|
|
40
|
+
import { _isPlainObject } from "./isPlainObject.js";
|
|
41
|
+
import { _isTypedArray } from "./isTypedArray.js";
|
|
42
|
+
import { _keysIn } from "./keysIn.js";
|
|
43
|
+
/**
|
|
44
|
+
* The base implementation of `_merge` and `_mergeWith` for a single source: merges the own and inherited
|
|
45
|
+
* enumerable string keyed properties of `source` into `object`. When a `customizer` is given it is invoked
|
|
46
|
+
* per property with (objValue, srcValue, key, object, source, stack), and a result other than `undefined`
|
|
47
|
+
* is used as the merged value instead of the default merge.
|
|
48
|
+
*
|
|
49
|
+
* @param object - The destination object.
|
|
50
|
+
* @param source - The source object.
|
|
51
|
+
* @param stack - Tracks traversed source values and their merged counterparts.
|
|
52
|
+
* @param customizer - The function to customize assigned values.
|
|
53
|
+
* @internal
|
|
54
|
+
*/
|
|
55
|
+
export function _baseMerge(object, source, stack, customizer) {
|
|
56
|
+
if (object === source) {
|
|
57
|
+
return;
|
|
58
|
+
}
|
|
59
|
+
for (const key of _keysIn(source)) {
|
|
60
|
+
const srcValue = source[key];
|
|
61
|
+
if (_isObject(srcValue)) {
|
|
62
|
+
_mergeDeep(object, source, key, stack, customizer);
|
|
63
|
+
continue;
|
|
64
|
+
}
|
|
65
|
+
const customized = customizer?.(_safeGet(object, key), srcValue, key, object, source, stack);
|
|
66
|
+
_assignMergeValue(object, key, customized === undefined ? srcValue : customized);
|
|
67
|
+
}
|
|
68
|
+
}
|
|
69
|
+
/**
|
|
70
|
+
* Merges the object value at `key`: a `customizer` result other than `undefined` is assigned as is; otherwise
|
|
71
|
+
* arrays and plain objects are merged recursively into the destination value, typed arrays are copied, and
|
|
72
|
+
* any other object is assigned by reference.
|
|
73
|
+
*/
|
|
74
|
+
function _mergeDeep(object, source, key, stack, customizer) {
|
|
75
|
+
const objValue = _safeGet(object, key);
|
|
76
|
+
const srcValue = _safeGet(source, key);
|
|
77
|
+
const stacked = stack.get(srcValue);
|
|
78
|
+
if (stacked) {
|
|
79
|
+
_assignMergeValue(object, key, stacked);
|
|
80
|
+
return;
|
|
81
|
+
}
|
|
82
|
+
const customized = customizer?.(objValue, srcValue, key, object, source, stack);
|
|
83
|
+
if (customized !== undefined) {
|
|
84
|
+
_assignMergeValue(object, key, customized);
|
|
85
|
+
return;
|
|
86
|
+
}
|
|
87
|
+
let newValue = srcValue;
|
|
88
|
+
// whether `srcValue` still has to be merged into `newValue`
|
|
89
|
+
let isCommon = true;
|
|
90
|
+
const isArr = Array.isArray(srcValue);
|
|
91
|
+
const isTyped = !isArr && _isTypedArray(srcValue);
|
|
92
|
+
if (isArr || isTyped) {
|
|
93
|
+
if (Array.isArray(objValue)) {
|
|
94
|
+
newValue = objValue;
|
|
95
|
+
}
|
|
96
|
+
else if (_isObjectLike(objValue) && _isArrayLike(objValue)) {
|
|
97
|
+
newValue = Array.from(objValue);
|
|
98
|
+
}
|
|
99
|
+
else if (isTyped) {
|
|
100
|
+
isCommon = false;
|
|
101
|
+
newValue = _cloneTypedArray(srcValue);
|
|
102
|
+
}
|
|
103
|
+
else {
|
|
104
|
+
newValue = [];
|
|
105
|
+
}
|
|
106
|
+
}
|
|
107
|
+
else if (_isPlainObject(srcValue) || _isArguments(srcValue)) {
|
|
108
|
+
newValue = objValue;
|
|
109
|
+
if (_isArguments(objValue)) {
|
|
110
|
+
newValue = _toPlainObject(objValue);
|
|
111
|
+
}
|
|
112
|
+
else if (!_isObject(objValue) || typeof objValue === "function") {
|
|
113
|
+
newValue = _initCloneObject(srcValue);
|
|
114
|
+
}
|
|
115
|
+
}
|
|
116
|
+
else {
|
|
117
|
+
isCommon = false;
|
|
118
|
+
}
|
|
119
|
+
if (isCommon) {
|
|
120
|
+
stack.set(srcValue, newValue);
|
|
121
|
+
_baseMerge(newValue, srcValue, stack, customizer);
|
|
122
|
+
stack.delete(srcValue);
|
|
123
|
+
}
|
|
124
|
+
_assignMergeValue(object, key, newValue);
|
|
125
|
+
}
|
|
126
|
+
/** Assigns `value` unless it equals the current value, or is `undefined` while the key already exists. */
|
|
127
|
+
function _assignMergeValue(object, key, value) {
|
|
128
|
+
if ((value !== undefined && !_eq(object[key], value)) || (value === undefined && !(key in object))) {
|
|
129
|
+
_baseAssignValue(object, key, value);
|
|
130
|
+
}
|
|
131
|
+
}
|
|
132
|
+
/** Reads `object[key]`, except for `__proto__` and a `constructor` function, which are never merged. */
|
|
133
|
+
function _safeGet(object, key) {
|
|
134
|
+
if (key === "__proto__" || (key === "constructor" && typeof object[key] === "function")) {
|
|
135
|
+
return undefined;
|
|
136
|
+
}
|
|
137
|
+
return object[key];
|
|
138
|
+
}
|
|
139
|
+
/** Copies the own and inherited enumerable string keyed properties of `value` into a new plain object. */
|
|
140
|
+
function _toPlainObject(value) {
|
|
141
|
+
const result = {};
|
|
142
|
+
for (const key of _keysIn(value)) {
|
|
143
|
+
_baseAssignValue(result, key, value[key]);
|
|
144
|
+
}
|
|
145
|
+
return result;
|
|
146
|
+
}
|
|
@@ -0,0 +1,11 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* The base implementation of `_sortBy` without param guards: sorts the values of `collection` in ascending
|
|
3
|
+
* order by the results of each iteratee, comparing the results of the first iteratee first.
|
|
4
|
+
*
|
|
5
|
+
* @param collection - The collection to iterate over.
|
|
6
|
+
* @param iteratees - The iteratees to sort by; an array iteratee is a property path.
|
|
7
|
+
* @returns Returns the new sorted array.
|
|
8
|
+
* @internal
|
|
9
|
+
*/
|
|
10
|
+
export declare function _baseOrderBy(collection: unknown, iteratees: unknown[]): unknown[];
|
|
11
|
+
//# sourceMappingURL=_baseOrderBy.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"_baseOrderBy.d.ts","sourceRoot":"","sources":["../../src/_/_baseOrderBy.ts"],"names":[],"mappings":"AA2CA;;;;;;;;GAQG;AACH,wBAAgB,YAAY,CAAC,UAAU,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,GAAG,OAAO,EAAE,CAYjF"}
|
|
@@ -0,0 +1,70 @@
|
|
|
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 { _baseEach } from "./_baseEach.js";
|
|
33
|
+
import { _baseGet } from "./_baseGet.js";
|
|
34
|
+
import { _baseIteratee } from "./_baseIteratee.js";
|
|
35
|
+
import { _compareAscending } from "./_compareAscending.js";
|
|
36
|
+
/**
|
|
37
|
+
* The base implementation of `_sortBy` without param guards: sorts the values of `collection` in ascending
|
|
38
|
+
* order by the results of each iteratee, comparing the results of the first iteratee first.
|
|
39
|
+
*
|
|
40
|
+
* @param collection - The collection to iterate over.
|
|
41
|
+
* @param iteratees - The iteratees to sort by; an array iteratee is a property path.
|
|
42
|
+
* @returns Returns the new sorted array.
|
|
43
|
+
* @internal
|
|
44
|
+
*/
|
|
45
|
+
export function _baseOrderBy(collection, iteratees) {
|
|
46
|
+
const getters = iteratees.length ? iteratees.map(_toGetter) : [(value) => value];
|
|
47
|
+
const entries = [];
|
|
48
|
+
_baseEach(collection, (value) => {
|
|
49
|
+
entries.push({ criteria: getters.map((getter) => getter(value)), value });
|
|
50
|
+
});
|
|
51
|
+
// `Array#sort` is stable, so elements with equal criteria keep their input order
|
|
52
|
+
entries.sort(_compareEntries);
|
|
53
|
+
return entries.map((entry) => entry.value);
|
|
54
|
+
}
|
|
55
|
+
/** An array iteratee is a property path; a one-element path is read as its single key. */
|
|
56
|
+
function _toGetter(iteratee) {
|
|
57
|
+
if (Array.isArray(iteratee)) {
|
|
58
|
+
return (value) => _baseGet(value, iteratee.length === 1 ? iteratee[0] : iteratee);
|
|
59
|
+
}
|
|
60
|
+
return _baseIteratee(iteratee);
|
|
61
|
+
}
|
|
62
|
+
function _compareEntries(entry, other) {
|
|
63
|
+
for (let index = 0; index < entry.criteria.length; index++) {
|
|
64
|
+
const result = _compareAscending(entry.criteria[index], other.criteria[index]);
|
|
65
|
+
if (result) {
|
|
66
|
+
return result;
|
|
67
|
+
}
|
|
68
|
+
}
|
|
69
|
+
return 0;
|
|
70
|
+
}
|
|
@@ -0,0 +1,14 @@
|
|
|
1
|
+
type _AnyRecord = Record<PropertyKey, unknown>;
|
|
2
|
+
/**
|
|
3
|
+
* The base implementation of `_pickBy`: creates an object composed of the own and inherited enumerable
|
|
4
|
+
* string and symbol keyed properties of `object` that `predicate` returns truthy for. The predicate is
|
|
5
|
+
* invoked with two arguments: (value, key). Picked values are kept by reference.
|
|
6
|
+
*
|
|
7
|
+
* @param object - The source object.
|
|
8
|
+
* @param predicate - The function invoked per property.
|
|
9
|
+
* @returns Returns the new object.
|
|
10
|
+
* @internal
|
|
11
|
+
*/
|
|
12
|
+
export declare function _basePickBy(object: unknown, predicate: (value: unknown, key: string | symbol) => unknown): _AnyRecord;
|
|
13
|
+
export {};
|
|
14
|
+
//# sourceMappingURL=_basePickBy.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"_basePickBy.d.ts","sourceRoot":"","sources":["../../src/_/_basePickBy.ts"],"names":[],"mappings":"AAmCA,KAAK,UAAU,GAAG,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;AAE/C;;;;;;;;;GASG;AACH,wBAAgB,WAAW,CACvB,MAAM,EAAE,OAAO,EACf,SAAS,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,KAAK,OAAO,GAC7D,UAAU,CAmBZ"}
|
|
@@ -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,13 @@
|
|
|
1
|
+
import type { _SetWithCustomizer } from "./types.js";
|
|
2
|
+
/**
|
|
3
|
+
* The base implementation of `set`.
|
|
4
|
+
*
|
|
5
|
+
* @param object - The object to modify.
|
|
6
|
+
* @param path - The path of the property to set.
|
|
7
|
+
* @param value - The value to set.
|
|
8
|
+
* @param customizer - The function to customize the containers created along the path.
|
|
9
|
+
* @returns Returns `object`.
|
|
10
|
+
* @internal
|
|
11
|
+
*/
|
|
12
|
+
export declare function _baseSet(object: unknown, path: unknown, value: unknown, customizer?: _SetWithCustomizer<unknown>): unknown;
|
|
13
|
+
//# sourceMappingURL=_baseSet.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"_baseSet.d.ts","sourceRoot":"","sources":["../../src/_/_baseSet.ts"],"names":[],"mappings":"AAsCA,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,YAAY,CAAC;AAErD;;;;;;;;;GASG;AACH,wBAAgB,QAAQ,CACpB,MAAM,EAAE,OAAO,EACf,IAAI,EAAE,OAAO,EACb,KAAK,EAAE,OAAO,EACd,UAAU,CAAC,EAAE,kBAAkB,CAAC,OAAO,CAAC,GACzC,OAAO,CAoCT"}
|
|
@@ -0,0 +1,74 @@
|
|
|
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 { _assignValue } from "./_assignValue.js";
|
|
33
|
+
import { _castPath } from "./_castPath.js";
|
|
34
|
+
import { _isIndex } from "./_isIndex.js";
|
|
35
|
+
import { _toKey } from "./_toKey.js";
|
|
36
|
+
import { _isObject } from "./isObject.js";
|
|
37
|
+
/**
|
|
38
|
+
* The base implementation of `set`.
|
|
39
|
+
*
|
|
40
|
+
* @param object - The object to modify.
|
|
41
|
+
* @param path - The path of the property to set.
|
|
42
|
+
* @param value - The value to set.
|
|
43
|
+
* @param customizer - The function to customize the containers created along the path.
|
|
44
|
+
* @returns Returns `object`.
|
|
45
|
+
* @internal
|
|
46
|
+
*/
|
|
47
|
+
export function _baseSet(object, path, value, customizer) {
|
|
48
|
+
if (!_isObject(object)) {
|
|
49
|
+
return object;
|
|
50
|
+
}
|
|
51
|
+
const keys = _castPath(path, object);
|
|
52
|
+
const lastIndex = keys.length - 1;
|
|
53
|
+
let nested = object;
|
|
54
|
+
for (let index = 0; nested != null && index < keys.length; index++) {
|
|
55
|
+
const key = _toKey(keys[index]);
|
|
56
|
+
if (key === "__proto__" || key === "constructor" || key === "prototype") {
|
|
57
|
+
return object;
|
|
58
|
+
}
|
|
59
|
+
let newValue = value;
|
|
60
|
+
if (index !== lastIndex) {
|
|
61
|
+
const objValue = nested[key];
|
|
62
|
+
// a customizer may supply the container; otherwise keep an existing one, or create an array for
|
|
63
|
+
// an index segment and an object otherwise; symbol keys are passed as they are, although the
|
|
64
|
+
// lodash typing only names string keys
|
|
65
|
+
newValue = customizer?.(objValue, key, nested);
|
|
66
|
+
if (newValue === undefined) {
|
|
67
|
+
newValue = _isObject(objValue) ? objValue : _isIndex(keys[index + 1]) ? [] : {};
|
|
68
|
+
}
|
|
69
|
+
}
|
|
70
|
+
_assignValue(nested, key, newValue);
|
|
71
|
+
nested = nested[key];
|
|
72
|
+
}
|
|
73
|
+
return object;
|
|
74
|
+
}
|
|
@@ -0,0 +1,45 @@
|
|
|
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
|
+
import type { _List } from "./types.js";
|
|
32
|
+
/**
|
|
33
|
+
* The base implementation of `_.slice` without an iteratee call guard: copies the elements of `array` from
|
|
34
|
+
* `start` up to, but not including, `end` into a new dense array. Negative positions count from the end,
|
|
35
|
+
* positions are clamped to the length, and holes become `undefined`. The `length` of `array` is used as is,
|
|
36
|
+
* as in lodash.
|
|
37
|
+
*
|
|
38
|
+
* @param array - The array to slice.
|
|
39
|
+
* @param start - The start position.
|
|
40
|
+
* @param end - The end position.
|
|
41
|
+
* @returns Returns the slice of `array`.
|
|
42
|
+
* @internal
|
|
43
|
+
*/
|
|
44
|
+
export declare function _baseSlice<T>(array: _List<T>, start: number, end: number): T[];
|
|
45
|
+
//# sourceMappingURL=_baseSlice.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"_baseSlice.d.ts","sourceRoot":"","sources":["../../src/_/_baseSlice.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAExC;;;;;;;;;;;GAWG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,CAAC,EAAE,CAsB9E"}
|
|
@@ -0,0 +1,30 @@
|
|
|
1
|
+
// (C) 2026 GoodData Corporation
|
|
2
|
+
/**
|
|
3
|
+
* The base implementation of `_.slice` without an iteratee call guard: copies the elements of `array` from
|
|
4
|
+
* `start` up to, but not including, `end` into a new dense array. Negative positions count from the end,
|
|
5
|
+
* positions are clamped to the length, and holes become `undefined`. The `length` of `array` is used as is,
|
|
6
|
+
* as in lodash.
|
|
7
|
+
*
|
|
8
|
+
* @param array - The array to slice.
|
|
9
|
+
* @param start - The start position.
|
|
10
|
+
* @param end - The end position.
|
|
11
|
+
* @returns Returns the slice of `array`.
|
|
12
|
+
* @internal
|
|
13
|
+
*/
|
|
14
|
+
export function _baseSlice(array, start, end) {
|
|
15
|
+
const length = array.length;
|
|
16
|
+
if (start < 0) {
|
|
17
|
+
start = -start > length ? 0 : length + start;
|
|
18
|
+
}
|
|
19
|
+
end = end > length ? length : end;
|
|
20
|
+
if (end < 0) {
|
|
21
|
+
end += length;
|
|
22
|
+
}
|
|
23
|
+
const count = start > end ? 0 : (end - start) >>> 0;
|
|
24
|
+
const from = start >>> 0;
|
|
25
|
+
const result = Array(count);
|
|
26
|
+
for (let index = 0; index < count; index++) {
|
|
27
|
+
result[index] = array[index + from];
|
|
28
|
+
}
|
|
29
|
+
return result;
|
|
30
|
+
}
|
|
@@ -0,0 +1,42 @@
|
|
|
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
|
+
import type { _List } from "./types.js";
|
|
32
|
+
/**
|
|
33
|
+
* The base implementation of `_sumBy`: adds the iteratee results of `array` with the `+` operator, skipping
|
|
34
|
+
* `undefined` results. As in lodash, the sum is `undefined` when no result was added.
|
|
35
|
+
*
|
|
36
|
+
* @param array - The array to iterate over.
|
|
37
|
+
* @param iteratee - The function invoked per element.
|
|
38
|
+
* @returns Returns the sum.
|
|
39
|
+
* @internal
|
|
40
|
+
*/
|
|
41
|
+
export declare function _baseSum<T>(array: _List<T>, iteratee: (value: T) => unknown): unknown;
|
|
42
|
+
//# sourceMappingURL=_baseSum.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"_baseSum.d.ts","sourceRoot":"","sources":["../../src/_/_baseSum.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAExC;;;;;;;;GAQG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAAG,OAAO,CAarF"}
|
|
@@ -0,0 +1,21 @@
|
|
|
1
|
+
// (C) 2026 GoodData Corporation
|
|
2
|
+
/**
|
|
3
|
+
* The base implementation of `_sumBy`: adds the iteratee results of `array` with the `+` operator, skipping
|
|
4
|
+
* `undefined` results. As in lodash, the sum is `undefined` when no result was added.
|
|
5
|
+
*
|
|
6
|
+
* @param array - The array to iterate over.
|
|
7
|
+
* @param iteratee - The function invoked per element.
|
|
8
|
+
* @returns Returns the sum.
|
|
9
|
+
* @internal
|
|
10
|
+
*/
|
|
11
|
+
export function _baseSum(array, iteratee) {
|
|
12
|
+
let result;
|
|
13
|
+
for (let index = 0; index < array.length; index++) {
|
|
14
|
+
const current = iteratee(array[index]);
|
|
15
|
+
if (current !== undefined) {
|
|
16
|
+
// oxlint-disable-next-line @typescript-eslint/no-explicit-any -- `+` on any value, as in lodash
|
|
17
|
+
result = result === undefined ? current : result + current;
|
|
18
|
+
}
|
|
19
|
+
}
|
|
20
|
+
return result;
|
|
21
|
+
}
|
|
@@ -0,0 +1,43 @@
|
|
|
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
|
+
* The base implementation of `uniqBy` without support for iteratee shorthands.
|
|
33
|
+
*
|
|
34
|
+
* Computed keys are compared by SameValueZero, which is what a `Set` uses: `NaN` equals `NaN`, `0`
|
|
35
|
+
* equals `-0`, and objects compare by reference.
|
|
36
|
+
*
|
|
37
|
+
* @param array - The array to inspect.
|
|
38
|
+
* @param iteratee - The iteratee invoked per element to compute its key.
|
|
39
|
+
* @returns Returns the new duplicate free array.
|
|
40
|
+
* @internal
|
|
41
|
+
*/
|
|
42
|
+
export declare function _baseUniq<T>(array: ArrayLike<T>, iteratee?: (value: T) => unknown): T[];
|
|
43
|
+
//# sourceMappingURL=_baseUniq.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"_baseUniq.d.ts","sourceRoot":"","sources":["../../src/_/_baseUniq.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AAEH;;;;;;;;;;GAUG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,EAAE,CAmBvF"}
|