@gooddata/util 11.68.0-alpha.0 → 11.68.0-alpha.10

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.
Files changed (397) hide show
  1. package/LICENSE +1 -1
  2. package/NOTICE +179 -0
  3. package/esm/_/_assignValue.d.ts +12 -0
  4. package/esm/_/_assignValue.d.ts.map +1 -0
  5. package/esm/_/_assignValue.js +49 -0
  6. package/esm/_/_baseAssignValue.d.ts +41 -0
  7. package/esm/_/_baseAssignValue.d.ts.map +1 -0
  8. package/esm/_/_baseAssignValue.js +48 -0
  9. package/esm/_/_baseClone.d.ts +28 -0
  10. package/esm/_/_baseClone.d.ts.map +1 -0
  11. package/esm/_/_baseClone.js +229 -0
  12. package/esm/_/_baseDifference.d.ts +18 -0
  13. package/esm/_/_baseDifference.d.ts.map +1 -0
  14. package/esm/_/_baseDifference.js +79 -0
  15. package/esm/_/_baseEach.d.ts +11 -0
  16. package/esm/_/_baseEach.d.ts.map +1 -0
  17. package/esm/_/_baseEach.js +62 -0
  18. package/esm/_/_baseExtremum.d.ts +15 -0
  19. package/esm/_/_baseExtremum.d.ts.map +1 -0
  20. package/esm/_/_baseExtremum.js +64 -0
  21. package/esm/_/_baseGet.d.ts +10 -0
  22. package/esm/_/_baseGet.d.ts.map +1 -0
  23. package/esm/_/_baseGet.js +50 -0
  24. package/esm/_/_baseGetTag.d.ts +9 -0
  25. package/esm/_/_baseGetTag.d.ts.map +1 -0
  26. package/esm/_/_baseGetTag.js +48 -0
  27. package/esm/_/_baseIntersection.d.ts +19 -0
  28. package/esm/_/_baseIntersection.d.ts.map +1 -0
  29. package/esm/_/_baseIntersection.js +91 -0
  30. package/esm/_/_baseIsEqual.d.ts +34 -0
  31. package/esm/_/_baseIsEqual.d.ts.map +1 -0
  32. package/esm/_/_baseIsEqual.js +278 -0
  33. package/esm/_/_baseIsMatch.d.ts +13 -0
  34. package/esm/_/_baseIsMatch.d.ts.map +1 -0
  35. package/esm/_/_baseIsMatch.js +67 -0
  36. package/esm/_/_baseIteratee.d.ts +15 -0
  37. package/esm/_/_baseIteratee.d.ts.map +1 -0
  38. package/esm/_/_baseIteratee.js +65 -0
  39. package/esm/_/_baseKeys.d.ts +12 -0
  40. package/esm/_/_baseKeys.d.ts.map +1 -0
  41. package/esm/_/_baseKeys.js +46 -0
  42. package/esm/_/_baseMatches.d.ts +10 -0
  43. package/esm/_/_baseMatches.d.ts.map +1 -0
  44. package/esm/_/_baseMatches.js +50 -0
  45. package/esm/_/_baseMatchesProperty.d.ts +11 -0
  46. package/esm/_/_baseMatchesProperty.d.ts.map +1 -0
  47. package/esm/_/_baseMatchesProperty.js +59 -0
  48. package/esm/_/_baseMerge.d.ts +19 -0
  49. package/esm/_/_baseMerge.d.ts.map +1 -0
  50. package/esm/_/_baseMerge.js +146 -0
  51. package/esm/_/_baseOrderBy.d.ts +11 -0
  52. package/esm/_/_baseOrderBy.d.ts.map +1 -0
  53. package/esm/_/_baseOrderBy.js +70 -0
  54. package/esm/_/_basePickBy.d.ts +14 -0
  55. package/esm/_/_basePickBy.d.ts.map +1 -0
  56. package/esm/_/_basePickBy.js +57 -0
  57. package/esm/_/_baseSet.d.ts +13 -0
  58. package/esm/_/_baseSet.d.ts.map +1 -0
  59. package/esm/_/_baseSet.js +74 -0
  60. package/esm/_/_baseSlice.d.ts +45 -0
  61. package/esm/_/_baseSlice.d.ts.map +1 -0
  62. package/esm/_/_baseSlice.js +30 -0
  63. package/esm/_/_baseSum.d.ts +42 -0
  64. package/esm/_/_baseSum.d.ts.map +1 -0
  65. package/esm/_/_baseSum.js +21 -0
  66. package/esm/_/_baseUniq.d.ts +43 -0
  67. package/esm/_/_baseUniq.d.ts.map +1 -0
  68. package/esm/_/_baseUniq.js +57 -0
  69. package/esm/_/_baseUnset.d.ts +13 -0
  70. package/esm/_/_baseUnset.d.ts.map +1 -0
  71. package/esm/_/_baseUnset.js +62 -0
  72. package/esm/_/_castPath.d.ts +10 -0
  73. package/esm/_/_castPath.d.ts.map +1 -0
  74. package/esm/_/_castPath.js +48 -0
  75. package/esm/_/_cloneArrayBuffer.d.ts +39 -0
  76. package/esm/_/_cloneArrayBuffer.d.ts.map +1 -0
  77. package/esm/_/_cloneArrayBuffer.js +45 -0
  78. package/esm/_/_cloneTypedArray.d.ts +10 -0
  79. package/esm/_/_cloneTypedArray.d.ts.map +1 -0
  80. package/esm/_/_cloneTypedArray.js +50 -0
  81. package/esm/_/_compareAscending.d.ts +12 -0
  82. package/esm/_/_compareAscending.d.ts.map +1 -0
  83. package/esm/_/_compareAscending.js +78 -0
  84. package/esm/_/_createCompounder.d.ts +11 -0
  85. package/esm/_/_createCompounder.d.ts.map +1 -0
  86. package/esm/_/_createCompounder.js +47 -0
  87. package/esm/_/_flattenArrayLikeObjects.d.ts +11 -0
  88. package/esm/_/_flattenArrayLikeObjects.d.ts.map +1 -0
  89. package/esm/_/_flattenArrayLikeObjects.js +55 -0
  90. package/esm/_/_getAllKeys.d.ts +9 -0
  91. package/esm/_/_getAllKeys.d.ts.map +1 -0
  92. package/esm/_/_getAllKeys.js +43 -0
  93. package/esm/_/_getAllKeysIn.d.ts +12 -0
  94. package/esm/_/_getAllKeysIn.d.ts.map +1 -0
  95. package/esm/_/_getAllKeysIn.js +59 -0
  96. package/esm/_/_getMatchData.d.ts +16 -0
  97. package/esm/_/_getMatchData.d.ts.map +1 -0
  98. package/esm/_/_getMatchData.js +46 -0
  99. package/esm/_/_getRawTag.d.ts +43 -0
  100. package/esm/_/_getRawTag.d.ts.map +1 -0
  101. package/esm/_/_getRawTag.js +65 -0
  102. package/esm/_/_hasPath.d.ts +13 -0
  103. package/esm/_/_hasPath.d.ts.map +1 -0
  104. package/esm/_/_hasPath.js +70 -0
  105. package/esm/_/_initCloneObject.d.ts +10 -0
  106. package/esm/_/_initCloneObject.d.ts.map +1 -0
  107. package/esm/_/_initCloneObject.js +48 -0
  108. package/esm/_/_isIndex.d.ts +11 -0
  109. package/esm/_/_isIndex.d.ts.map +1 -0
  110. package/esm/_/_isIndex.js +51 -0
  111. package/esm/_/_isIterateeCall.d.ts +13 -0
  112. package/esm/_/_isIterateeCall.d.ts.map +1 -0
  113. package/esm/_/_isIterateeCall.js +55 -0
  114. package/esm/_/_isKey.d.ts +12 -0
  115. package/esm/_/_isKey.d.ts.map +1 -0
  116. package/esm/_/_isKey.js +58 -0
  117. package/esm/_/_isPrototype.d.ts +39 -0
  118. package/esm/_/_isPrototype.d.ts.map +1 -0
  119. package/esm/_/_isPrototype.js +43 -0
  120. package/esm/_/_isStrictComparable.d.ts +9 -0
  121. package/esm/_/_isStrictComparable.d.ts.map +1 -0
  122. package/esm/_/_isStrictComparable.js +42 -0
  123. package/esm/_/_matchesStrictComparable.d.ts +41 -0
  124. package/esm/_/_matchesStrictComparable.d.ts.map +1 -0
  125. package/esm/_/_matchesStrictComparable.js +50 -0
  126. package/esm/_/_stringToPath.d.ts +10 -0
  127. package/esm/_/_stringToPath.d.ts.map +1 -0
  128. package/esm/_/_stringToPath.js +64 -0
  129. package/esm/_/_toKey.d.ts +9 -0
  130. package/esm/_/_toKey.d.ts.map +1 -0
  131. package/esm/_/_toKey.js +46 -0
  132. package/esm/_/_unicode.d.ts +27 -0
  133. package/esm/_/_unicode.d.ts.map +1 -0
  134. package/esm/_/_unicode.js +120 -0
  135. package/esm/_/assignIn.d.ts +35 -0
  136. package/esm/_/assignIn.d.ts.map +1 -0
  137. package/esm/_/assignIn.js +50 -0
  138. package/esm/_/bindAll.d.ts +16 -0
  139. package/esm/_/bindAll.d.ts.map +1 -0
  140. package/esm/_/bindAll.js +88 -0
  141. package/esm/_/camelCase.d.ts +10 -0
  142. package/esm/_/camelCase.d.ts.map +1 -0
  143. package/esm/_/camelCase.js +45 -0
  144. package/esm/_/capitalize.d.ts +9 -0
  145. package/esm/_/capitalize.d.ts.map +1 -0
  146. package/esm/_/capitalize.js +43 -0
  147. package/esm/_/chunk.d.ts +15 -0
  148. package/esm/_/chunk.d.ts.map +1 -0
  149. package/esm/_/chunk.js +61 -0
  150. package/esm/_/clamp.d.ts +17 -0
  151. package/esm/_/clamp.d.ts.map +1 -0
  152. package/esm/_/clamp.js +56 -0
  153. package/esm/_/clone.d.ts +12 -0
  154. package/esm/_/clone.d.ts.map +1 -0
  155. package/esm/_/clone.js +45 -0
  156. package/esm/_/cloneDeep.d.ts +14 -0
  157. package/esm/_/cloneDeep.d.ts.map +1 -0
  158. package/esm/_/cloneDeep.js +47 -0
  159. package/esm/_/cloneDeepWith.d.ts +18 -0
  160. package/esm/_/cloneDeepWith.d.ts.map +1 -0
  161. package/esm/_/cloneDeepWith.js +36 -0
  162. package/esm/_/compact.d.ts +46 -0
  163. package/esm/_/compact.d.ts.map +1 -0
  164. package/esm/_/compact.js +23 -0
  165. package/esm/_/constant.d.ts +39 -0
  166. package/esm/_/constant.d.ts.map +1 -0
  167. package/esm/_/constant.js +43 -0
  168. package/esm/_/debounce.d.ts +70 -0
  169. package/esm/_/debounce.d.ts.map +1 -0
  170. package/esm/_/debounce.js +136 -0
  171. package/esm/_/deburr.d.ts +10 -0
  172. package/esm/_/deburr.d.ts.map +1 -0
  173. package/esm/_/deburr.js +243 -0
  174. package/esm/_/defaults.d.ts +36 -0
  175. package/esm/_/defaults.d.ts.map +1 -0
  176. package/esm/_/defaults.js +51 -0
  177. package/esm/_/difference.d.ts +14 -0
  178. package/esm/_/difference.d.ts.map +1 -0
  179. package/esm/_/difference.js +46 -0
  180. package/esm/_/differenceBy.d.ts +39 -0
  181. package/esm/_/differenceBy.d.ts.map +1 -0
  182. package/esm/_/differenceBy.js +40 -0
  183. package/esm/_/differenceWith.d.ts +27 -0
  184. package/esm/_/differenceWith.d.ts.map +1 -0
  185. package/esm/_/differenceWith.js +39 -0
  186. package/esm/_/dropRightWhile.d.ts +13 -0
  187. package/esm/_/dropRightWhile.d.ts.map +1 -0
  188. package/esm/_/dropRightWhile.js +54 -0
  189. package/esm/_/eq.d.ts +41 -0
  190. package/esm/_/eq.d.ts.map +1 -0
  191. package/esm/_/eq.js +43 -0
  192. package/esm/_/escape.d.ts +13 -0
  193. package/esm/_/escape.d.ts.map +1 -0
  194. package/esm/_/escape.js +56 -0
  195. package/esm/_/escapeRegExp.d.ts +12 -0
  196. package/esm/_/escapeRegExp.d.ts.map +1 -0
  197. package/esm/_/escapeRegExp.js +47 -0
  198. package/esm/_/findKey.d.ts +14 -0
  199. package/esm/_/findKey.d.ts.map +1 -0
  200. package/esm/_/findKey.js +58 -0
  201. package/esm/_/findLastIndex.d.ts +16 -0
  202. package/esm/_/findLastIndex.d.ts.map +1 -0
  203. package/esm/_/findLastIndex.js +67 -0
  204. package/esm/_/get.d.ts +78 -0
  205. package/esm/_/get.d.ts.map +1 -0
  206. package/esm/_/get.js +36 -0
  207. package/esm/_/groupBy.d.ts +19 -0
  208. package/esm/_/groupBy.d.ts.map +1 -0
  209. package/esm/_/groupBy.js +49 -0
  210. package/esm/_/has.d.ts +23 -0
  211. package/esm/_/has.d.ts.map +1 -0
  212. package/esm/_/has.js +35 -0
  213. package/esm/_/inRange.d.ts +14 -0
  214. package/esm/_/inRange.d.ts.map +1 -0
  215. package/esm/_/inRange.js +51 -0
  216. package/esm/_/initial.d.ts +11 -0
  217. package/esm/_/initial.d.ts.map +1 -0
  218. package/esm/_/initial.js +44 -0
  219. package/esm/_/intersection.d.ts +13 -0
  220. package/esm/_/intersection.d.ts.map +1 -0
  221. package/esm/_/intersection.js +45 -0
  222. package/esm/_/intersectionBy.d.ts +32 -0
  223. package/esm/_/intersectionBy.d.ts.map +1 -0
  224. package/esm/_/intersectionBy.js +41 -0
  225. package/esm/_/intersectionWith.d.ts +28 -0
  226. package/esm/_/intersectionWith.d.ts.map +1 -0
  227. package/esm/_/intersectionWith.js +38 -0
  228. package/esm/_/invert.d.ts +14 -0
  229. package/esm/_/invert.d.ts.map +1 -0
  230. package/esm/_/invert.js +55 -0
  231. package/esm/_/isArguments.d.ts +9 -0
  232. package/esm/_/isArguments.d.ts.map +1 -0
  233. package/esm/_/isArguments.js +45 -0
  234. package/esm/_/isArray.d.ts +61 -0
  235. package/esm/_/isArray.d.ts.map +1 -0
  236. package/esm/_/isArray.js +62 -0
  237. package/esm/_/isArrayLike.d.ts +25 -0
  238. package/esm/_/isArrayLike.d.ts.map +1 -0
  239. package/esm/_/isArrayLike.js +35 -0
  240. package/esm/_/isEmpty.d.ts +49 -0
  241. package/esm/_/isEmpty.d.ts.map +1 -0
  242. package/esm/_/isEmpty.js +57 -0
  243. package/esm/_/isEqual.d.ts +15 -0
  244. package/esm/_/isEqual.d.ts.map +1 -0
  245. package/esm/_/isEqual.js +48 -0
  246. package/esm/_/isError.d.ts +11 -0
  247. package/esm/_/isError.d.ts.map +1 -0
  248. package/esm/_/isError.js +57 -0
  249. package/esm/_/isLength.d.ts +41 -0
  250. package/esm/_/isLength.d.ts.map +1 -0
  251. package/esm/_/isLength.js +43 -0
  252. package/esm/_/isObject.d.ts +40 -0
  253. package/esm/_/isObject.d.ts.map +1 -0
  254. package/esm/_/isObject.js +42 -0
  255. package/esm/_/isObjectLike.d.ts +40 -0
  256. package/esm/_/isObjectLike.d.ts.map +1 -0
  257. package/esm/_/isObjectLike.js +42 -0
  258. package/esm/_/isPlainObject.d.ts +10 -0
  259. package/esm/_/isPlainObject.d.ts.map +1 -0
  260. package/esm/_/isPlainObject.js +58 -0
  261. package/esm/_/isSymbol.d.ts +9 -0
  262. package/esm/_/isSymbol.d.ts.map +1 -0
  263. package/esm/_/isSymbol.js +45 -0
  264. package/esm/_/isTypedArray.d.ts +43 -0
  265. package/esm/_/isTypedArray.d.ts.map +1 -0
  266. package/esm/_/isTypedArray.js +45 -0
  267. package/esm/_/kebabCase.d.ts +9 -0
  268. package/esm/_/kebabCase.d.ts.map +1 -0
  269. package/esm/_/kebabCase.js +40 -0
  270. package/esm/_/keyBy.d.ts +17 -0
  271. package/esm/_/keyBy.d.ts.map +1 -0
  272. package/esm/_/keyBy.js +43 -0
  273. package/esm/_/keys.d.ts +11 -0
  274. package/esm/_/keys.d.ts.map +1 -0
  275. package/esm/_/keys.js +60 -0
  276. package/esm/_/keysIn.d.ts +10 -0
  277. package/esm/_/keysIn.d.ts.map +1 -0
  278. package/esm/_/keysIn.js +54 -0
  279. package/esm/_/mapValues.d.ts +63 -0
  280. package/esm/_/mapValues.d.ts.map +1 -0
  281. package/esm/_/mapValues.js +47 -0
  282. package/esm/_/max.d.ts +16 -0
  283. package/esm/_/max.d.ts.map +1 -0
  284. package/esm/_/max.js +37 -0
  285. package/esm/_/memoize.d.ts +89 -0
  286. package/esm/_/memoize.d.ts.map +1 -0
  287. package/esm/_/memoize.js +36 -0
  288. package/esm/_/merge.d.ts +32 -0
  289. package/esm/_/merge.d.ts.map +1 -0
  290. package/esm/_/merge.js +45 -0
  291. package/esm/_/mergeWith.d.ts +34 -0
  292. package/esm/_/mergeWith.d.ts.map +1 -0
  293. package/esm/_/mergeWith.js +50 -0
  294. package/esm/_/min.d.ts +16 -0
  295. package/esm/_/min.d.ts.map +1 -0
  296. package/esm/_/min.js +37 -0
  297. package/esm/_/negate.d.ts +41 -0
  298. package/esm/_/negate.d.ts.map +1 -0
  299. package/esm/_/negate.js +48 -0
  300. package/esm/_/omit.d.ts +27 -0
  301. package/esm/_/omit.d.ts.map +1 -0
  302. package/esm/_/omit.js +76 -0
  303. package/esm/_/omitBy.d.ts +21 -0
  304. package/esm/_/omitBy.d.ts.map +1 -0
  305. package/esm/_/omitBy.js +37 -0
  306. package/esm/_/partial.d.ts +87 -0
  307. package/esm/_/partial.d.ts.map +1 -0
  308. package/esm/_/partial.js +30 -0
  309. package/esm/_/partition.d.ts +23 -0
  310. package/esm/_/partition.d.ts.map +1 -0
  311. package/esm/_/partition.js +42 -0
  312. package/esm/_/pick.d.ts +18 -0
  313. package/esm/_/pick.d.ts.map +1 -0
  314. package/esm/_/pick.js +48 -0
  315. package/esm/_/pickBy.d.ts +21 -0
  316. package/esm/_/pickBy.d.ts.map +1 -0
  317. package/esm/_/pickBy.js +36 -0
  318. package/esm/_/range.d.ts +24 -0
  319. package/esm/_/range.d.ts.map +1 -0
  320. package/esm/_/range.js +56 -0
  321. package/esm/_/reduce.d.ts +37 -0
  322. package/esm/_/reduce.d.ts.map +1 -0
  323. package/esm/_/reduce.js +48 -0
  324. package/esm/_/set.d.ts +25 -0
  325. package/esm/_/set.d.ts.map +1 -0
  326. package/esm/_/set.js +35 -0
  327. package/esm/_/sortBy.d.ts +17 -0
  328. package/esm/_/sortBy.d.ts.map +1 -0
  329. package/esm/_/sortBy.js +46 -0
  330. package/esm/_/sumBy.d.ts +14 -0
  331. package/esm/_/sumBy.d.ts.map +1 -0
  332. package/esm/_/sumBy.js +47 -0
  333. package/esm/_/tail.d.ts +15 -0
  334. package/esm/_/tail.d.ts.map +1 -0
  335. package/esm/_/tail.js +36 -0
  336. package/esm/_/throttle.d.ts +76 -0
  337. package/esm/_/throttle.d.ts.map +1 -0
  338. package/esm/_/throttle.js +45 -0
  339. package/esm/_/times.d.ts +17 -0
  340. package/esm/_/times.d.ts.map +1 -0
  341. package/esm/_/times.js +57 -0
  342. package/esm/_/toFinite.d.ts +10 -0
  343. package/esm/_/toFinite.d.ts.map +1 -0
  344. package/esm/_/toFinite.js +50 -0
  345. package/esm/_/toInteger.d.ts +11 -0
  346. package/esm/_/toInteger.d.ts.map +1 -0
  347. package/esm/_/toInteger.js +46 -0
  348. package/esm/_/toNumber.d.ts +11 -0
  349. package/esm/_/toNumber.d.ts.map +1 -0
  350. package/esm/_/toNumber.js +69 -0
  351. package/esm/_/toString.d.ts +11 -0
  352. package/esm/_/toString.d.ts.map +1 -0
  353. package/esm/_/toString.js +57 -0
  354. package/esm/_/types.d.ts +181 -0
  355. package/esm/_/types.d.ts.map +1 -0
  356. package/esm/_/types.js +2 -0
  357. package/esm/_/unescape.d.ts +13 -0
  358. package/esm/_/unescape.d.ts.map +1 -0
  359. package/esm/_/unescape.js +56 -0
  360. package/esm/_/union.d.ts +11 -0
  361. package/esm/_/union.d.ts.map +1 -0
  362. package/esm/_/union.js +44 -0
  363. package/esm/_/unionBy.d.ts +34 -0
  364. package/esm/_/unionBy.d.ts.map +1 -0
  365. package/esm/_/unionBy.js +42 -0
  366. package/esm/_/uniq.d.ts +12 -0
  367. package/esm/_/uniq.d.ts.map +1 -0
  368. package/esm/_/uniq.js +47 -0
  369. package/esm/_/uniqBy.d.ts +13 -0
  370. package/esm/_/uniqBy.d.ts.map +1 -0
  371. package/esm/_/uniqBy.js +49 -0
  372. package/esm/_/uniqWith.d.ts +14 -0
  373. package/esm/_/uniqWith.d.ts.map +1 -0
  374. package/esm/_/uniqWith.js +59 -0
  375. package/esm/_/update.d.ts +17 -0
  376. package/esm/_/update.d.ts.map +1 -0
  377. package/esm/_/update.js +55 -0
  378. package/esm/_/updateWith.d.ts +23 -0
  379. package/esm/_/updateWith.d.ts.map +1 -0
  380. package/esm/_/updateWith.js +41 -0
  381. package/esm/_/upperFirst.d.ts +10 -0
  382. package/esm/_/upperFirst.d.ts.map +1 -0
  383. package/esm/_/upperFirst.js +46 -0
  384. package/esm/_/without.d.ts +15 -0
  385. package/esm/_/without.d.ts.map +1 -0
  386. package/esm/_/without.js +47 -0
  387. package/esm/_/words.d.ts +9 -0
  388. package/esm/_/words.d.ts.map +1 -0
  389. package/esm/_/words.js +50 -0
  390. package/esm/_/zip.d.ts +28 -0
  391. package/esm/_/zip.d.ts.map +1 -0
  392. package/esm/_/zip.js +38 -0
  393. package/esm/index.d.ts +69 -0
  394. package/esm/index.d.ts.map +1 -1
  395. package/esm/index.js +69 -0
  396. package/esm/util.d.ts +1870 -67
  397. package/package.json +5 -4
package/LICENSE CHANGED
@@ -1,4 +1,4 @@
1
- Copyright (c) 2020-2022 GoodData Corporation
1
+ Copyright (c) 2020-2026 GoodData Corporation
2
2
 
3
3
  Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
4
4
 
package/NOTICE ADDED
@@ -0,0 +1,179 @@
1
+ Copyright (c) 2017-2026 GoodData Corporation
2
+
3
+ This product includes a number of subcomponents with separate copyright notices and license terms below. Your use of these subcomponents is subject to the terms and conditions of the subcomponent's license. This GoodData project does not necessarily use all the open source software referred to below and may also only use portions of a given package. With respect to the open source software listed in this document, if you (i) have any questions, (ii) wish to receive source code for packages under licenses that require their source code to be made available (such as the GNU Lesser Public License), or (iii) discover any errors or omissions in the licensing information provided, please contact us at legal@gooddata.com. Please identify in source code requests: (i) the packages for which you are requesting corresponding source, (ii) the GoodData product (including any available version) with which the package was provided; and (iii) an email address (if available) or postal address at which GoodData may contact you.
4
+
5
+ --------------------------------------------------------------------------------
6
+ Attribution Notice for @gooddata/util (11.68.0-alpha.10)
7
+ Package License: MIT
8
+ Own License File: LICENSE
9
+ Date generated: 2026-11-10
10
+ Revision ID: 84da343e85211db46f29811651dc10b32662b222
11
+
12
+ This notice lists the components that @gooddata/util depends on, directly or through other
13
+ packages, with the license and copyright information reported for each of them.
14
+ The license of @gooddata/util itself is stated in its LICENSE file. Each component below is
15
+ subject to its own license terms, given in its entry; the license of @gooddata/util does not
16
+ change those terms.
17
+ --------------------------------------------------------------------------------
18
+
19
+ Dependencies
20
+
21
+ Local GoodData SDK components
22
+ No local SDK dependencies selected.
23
+
24
+ External components
25
+ - lodash-es (4.18.1) [CC0-1.0, MIT] — Direct
26
+ - ts-invariant (0.10.3) [MIT] — Direct
27
+ - tslib (2.8.1) [ISC] — Direct
28
+
29
+ ================================================================================
30
+ External components
31
+ ================================================================================
32
+
33
+ --------------------------------------------------------------------------------
34
+ Package Title: lodash-es (4.18.1)
35
+ Package Locator: npm+lodash-es$4.18.1
36
+ Package Depth: Direct
37
+ --------------------------------------------------------------------------------
38
+
39
+ * Declared Licenses *
40
+ CC0-1.0, MIT
41
+
42
+ * CC0-1.0 *
43
+
44
+ * License Header *
45
+ Creative Commons Legal Code
46
+ CC0 1.0 Universal CREATIVE COMMONS CORPORATION IS NOT A LAW FIRM AND DOES NOT PROVIDE LEGAL SERVICES. DISTRIBUTION OF THIS DOCUMENT DOES NOT CREATE AN ATTORNEY-CLIENT RELATIONSHIP. CREATIVE COMMONS PROVIDES THIS INFORMATION ON AN "AS-IS" BASIS. CREATIVE COMMONS MAKES NO WARRANTIES REGARDING THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS PROVIDED HEREUNDER, AND DISCLAIMS LIABILITY FOR DAMAGES RESULTING FROM THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS PROVIDED HEREUNDER.
47
+ Statement of Purpose
48
+ The laws of most jurisdictions throughout the world automatically confer exclusive Copyright and Related Rights (defined below) upon the creator and subsequent owner(s) (each and all, an "owner") of an original work of authorship and/or a database (each, a "Work").
49
+ Certain owners wish to permanently relinquish those rights to a Work for the purpose of contributing to a commons of creative, cultural and scientific works ("Commons") that the public can reliably and without fear of later claims of infringement build upon, modify, incorporate in other works, reuse and redistribute as freely as possible in any form whatsoever and for any purposes, including without limitation commercial purposes. These owners may contribute to the Commons to promote the ideal of a free culture and the further production of creative, cultural and scientific works, or to gain reputation or greater distribution for their Work in part through the use and efforts of others.
50
+ For these and/or other purposes and motivations, and without any expectation of additional consideration or compensation, the person associating CC0 with a Work (the "Affirmer"), to the extent that he or she is an owner of Copyright and Related Rights in the Work, voluntarily elects to apply CC0 to the Work and publicly distribute the Work under its terms, with knowledge of his or her Copyright and Related Rights in the Work and the meaning and intended legal effect of CC0 on those rights.
51
+ 1. Copyright and Related Rights. A Work made available under CC0 may be protected by copyright and related or neighboring rights ("Copyright and Related Rights"). Copyright and Related Rights include, but are not limited to, the following:
52
+ i. the right to reproduce, adapt, distribute, perform, display, communicate, and translate a Work;
53
+ ii. moral rights retained by the original author(s) and/or performer(s);
54
+ iii. publicity and privacy rights pertaining to a person's image or likeness depicted in a Work;
55
+ iv. rights protecting against unfair competition in regards to a Work, subject to the limitations in paragraph 4(a), below;
56
+ v. rights protecting the extraction, dissemination, use and reuse of data in a Work;
57
+ vi. database rights (such as those arising under Directive 96/9/EC of the European Parliament and of the Council of 11 March 1996 on the legal protection of databases, and under any national implementation thereof, including any amended or successor version of such directive); and
58
+ vii. other similar, equivalent or corresponding rights throughout the world based on applicable law or treaty, and any national implementations thereof.
59
+ 2. Waiver. To the greatest extent permitted by, but not in contravention of, applicable law, Affirmer hereby overtly, fully, permanently, irrevocably and unconditionally waives, abandons, and surrenders all of Affirmer's Copyright and Related Rights and associated claims and causes of action, whether now known or unknown (including existing as well as future claims and causes of action), in the Work (i) in all territories worldwide, (ii) for the maximum duration provided by applicable law or treaty (including future time extensions), (iii) in any current or future medium and for any number of copies, and (iv) for any purpose whatsoever, including without limitation commercial, advertising or promotional purposes (the "Waiver"). Affirmer makes the Waiver for the benefit of each member of the public at large and to the detriment of Affirmer's heirs and successors, fully intending that such Waiver shall not be subject to revocation, rescission, cancellation, termination, or any other legal or equitable action to disrupt the quiet enjoyment of the Work by the public as contemplated by Affirmer's express Statement of Purpose.
60
+ 3. Public License Fallback. Should any part of the Waiver for any reason be judged legally invalid or ineffective under applicable law, then the Waiver shall be preserved to the maximum extent permitted taking into account Affirmer's express Statement of Purpose. In addition, to the extent the Waiver is so judged Affirmer hereby grants to each affected person a royalty-free, non transferable, non sublicensable, non exclusive, irrevocable and unconditional license to exercise Affirmer's Copyright and Related Rights in the Work (i) in all territories worldwide, (ii) for the maximum duration provided by applicable law or treaty (including future time extensions), (iii) in any current or future medium and for any number of copies, and (iv) for any purpose whatsoever, including without limitation commercial, advertising or promotional purposes (the "License"). The License shall be deemed effective as of the date CC0 was applied by Affirmer to the Work. Should any part of the License for any reason be judged legally invalid or ineffective under applicable law, such partial invalidity or ineffectiveness shall not invalidate the remainder of the License, and in such case Affirmer hereby affirms that he or she will not (i) exercise any of his or her remaining Copyright and Related Rights in the Work or (ii) assert any associated claims and causes of action with respect to the Work, in either case contrary to Affirmer's express Statement of Purpose.
61
+ 4. Limitations and Disclaimers.
62
+ a. No trademark or patent rights held by Affirmer are waived, abandoned, surrendered, licensed or otherwise affected by this document.
63
+ b. Affirmer offers the Work as-is and makes no representations or warranties of any kind concerning the Work, express, implied, statutory or otherwise, including without limitation warranties of title, merchantability, fitness for a particular purpose, non infringement, or the absence of latent or other defects, accuracy, or the present or absence of errors, whether or not discoverable, all to the greatest extent permissible under applicable law.
64
+ c. Affirmer disclaims responsibility for clearing rights of other persons that may apply to the Work or any use thereof, including without limitation any person's Copyright and Related Rights in the Work. Further, Affirmer disclaims responsibility for obtaining any necessary consents, permissions or other rights required for any use of the Work.
65
+ d. Affirmer understands and acknowledges that Creative Commons is not a party to this document and has no duty or obligation with respect to this CC0 or use of the Work.
66
+
67
+ * MIT *
68
+
69
+ * License Header *
70
+ Copyright OpenJS Foundation and other contributors <https://openjsf.org/>
71
+
72
+ Based on Underscore.js, copyright Jeremy Ashkenas,
73
+ DocumentCloud and Investigative Reporters & Editors <http://underscorejs.org/>
74
+
75
+ This software consists of voluntary contributions made by many
76
+ individuals. For exact contribution history, see the revision history
77
+ available at https://github.com/lodash/lodash
78
+
79
+ The following license applies to all parts of this software except as
80
+ documented below:
81
+
82
+ ====
83
+
84
+ Permission is hereby granted, free of charge, to any person obtaining
85
+ a copy of this software and associated documentation files (the
86
+ "Software"), to deal in the Software without restriction, including
87
+ without limitation the rights to use, copy, modify, merge, publish,
88
+ distribute, sublicense, and/or sell copies of the Software, and to
89
+ permit persons to whom the Software is furnished to do so, subject to
90
+ the following conditions:
91
+
92
+ The above copyright notice and this permission notice shall be
93
+ included in all copies or substantial portions of the Software.
94
+
95
+ THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
96
+ EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
97
+ MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
98
+ NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
99
+ LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
100
+ OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
101
+ WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
102
+
103
+ ====
104
+
105
+ Copyright and related rights for sample code are waived via CC0. Sample
106
+ code is defined as all source code displayed within the prose of the
107
+ documentation.
108
+
109
+ CC0: http://creativecommons.org/publicdomain/zero/1.0/
110
+
111
+ ====
112
+
113
+ Files located in the node_modules and vendor directories are externally
114
+ maintained libraries used by this software which have their own
115
+ licenses; we recommend you read them, as their terms may differ from the
116
+ terms above.
117
+
118
+ * Copyrights *
119
+ MIT
120
+ - Copyright (c) OpenJS Foundation and other contributors <https://openjsf.org/>
121
+
122
+ --------------------------------------------------------------------------------
123
+ Package Title: ts-invariant (0.10.3)
124
+ Package Locator: npm+ts-invariant$0.10.3
125
+ Package Depth: Direct
126
+ --------------------------------------------------------------------------------
127
+
128
+ * Declared Licenses *
129
+ MIT
130
+
131
+ * License Header *
132
+ MIT License
133
+
134
+ Copyright (c) 2019 Apollo GraphQL
135
+
136
+ Permission is hereby granted, free of charge, to any person obtaining a copy
137
+ of this software and associated documentation files (the "Software"), to deal
138
+ in the Software without restriction, including without limitation the rights
139
+ to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
140
+ copies of the Software, and to permit persons to whom the Software is
141
+ furnished to do so, subject to the following conditions:
142
+
143
+ The above copyright notice and this permission notice shall be included in all
144
+ copies or substantial portions of the Software.
145
+
146
+ THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
147
+ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
148
+ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
149
+ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
150
+ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
151
+ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
152
+ SOFTWARE.
153
+
154
+ * Copyrights *
155
+ MIT
156
+ - Copyright (c) 2019 Apollo GraphQL
157
+
158
+ --------------------------------------------------------------------------------
159
+ Package Title: tslib (2.8.1)
160
+ Package Locator: npm+tslib$2.8.1
161
+ Package Depth: Direct
162
+ --------------------------------------------------------------------------------
163
+
164
+ * Declared Licenses *
165
+ ISC
166
+
167
+ * License Header *
168
+ Copyright (c) Microsoft Corporation.
169
+
170
+ Permission to use, copy, modify, and/or distribute this software for any
171
+ purpose with or without fee is hereby granted.
172
+
173
+ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
174
+ REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
175
+ AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
176
+ INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
177
+ LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
178
+ OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
179
+ PERFORMANCE OF THIS SOFTWARE.
@@ -0,0 +1,12 @@
1
+ /**
2
+ * Assigns `value` to `key` of `object` unless an own property with an equivalent value already exists.
3
+ * Boxed strings expose non-writable index properties, so skipping those is what keeps them assignable.
4
+ * A `__proto__` key is defined as an own property so it cannot change the prototype.
5
+ *
6
+ * @param object - The object to modify.
7
+ * @param key - The key of the property to assign.
8
+ * @param value - The value to assign.
9
+ * @internal
10
+ */
11
+ export declare function _assignValue(object: Record<PropertyKey, unknown>, key: PropertyKey, value: unknown): void;
12
+ //# sourceMappingURL=_assignValue.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"_assignValue.d.ts","sourceRoot":"","sources":["../../src/_/_assignValue.ts"],"names":[],"mappings":"AAoCA;;;;;;;;;GASG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,EAAE,GAAG,EAAE,WAAW,EAAE,KAAK,EAAE,OAAO,GAAG,IAAI,CAMzG"}
@@ -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 { _baseAssignValue } from "./_baseAssignValue.js";
33
+ import { _eq } from "./eq.js";
34
+ /**
35
+ * Assigns `value` to `key` of `object` unless an own property with an equivalent value already exists.
36
+ * Boxed strings expose non-writable index properties, so skipping those is what keeps them assignable.
37
+ * A `__proto__` key is defined as an own property so it cannot change the prototype.
38
+ *
39
+ * @param object - The object to modify.
40
+ * @param key - The key of the property to assign.
41
+ * @param value - The value to assign.
42
+ * @internal
43
+ */
44
+ export function _assignValue(object, key, value) {
45
+ if (Object.hasOwn(object, key) && _eq(object[key], value) && !(value === undefined && !(key in object))) {
46
+ return;
47
+ }
48
+ _baseAssignValue(object, key, value);
49
+ }
@@ -0,0 +1,41 @@
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 `_assignValue` without value checks. A `__proto__` key is defined as an own
33
+ * property, so it never changes the prototype of `object`.
34
+ *
35
+ * @param object - The object to modify.
36
+ * @param key - The key of the property to assign.
37
+ * @param value - The value to assign.
38
+ * @internal
39
+ */
40
+ export declare function _baseAssignValue(object: Record<PropertyKey, unknown>, key: PropertyKey, value: unknown): void;
41
+ //# sourceMappingURL=_baseAssignValue.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"_baseAssignValue.d.ts","sourceRoot":"","sources":["../../src/_/_baseAssignValue.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AAEH;;;;;;;;GAQG;AACH,wBAAgB,gBAAgB,CAC5B,MAAM,EAAE,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,EACpC,GAAG,EAAE,WAAW,EAChB,KAAK,EAAE,OAAO,GACf,IAAI,CAMN"}
@@ -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
+ /**
33
+ * The base implementation of `_assignValue` without value checks. A `__proto__` key is defined as an own
34
+ * property, so it never changes the prototype of `object`.
35
+ *
36
+ * @param object - The object to modify.
37
+ * @param key - The key of the property to assign.
38
+ * @param value - The value to assign.
39
+ * @internal
40
+ */
41
+ export function _baseAssignValue(object, key, value) {
42
+ if (key === "__proto__") {
43
+ Object.defineProperty(object, key, { configurable: true, enumerable: true, value, writable: true });
44
+ }
45
+ else {
46
+ object[key] = value;
47
+ }
48
+ }
@@ -0,0 +1,28 @@
1
+ import type { _CloneDeepWithCustomizer } from "./types.js";
2
+ /** Tracks each traversed object and its clone, so cycles and shared references are reproduced. */
3
+ type _Stack = Map<object, unknown>;
4
+ /** The key and container of a nested value, handed to the customizer. */
5
+ type _Parent = {
6
+ key: unknown;
7
+ object: object;
8
+ };
9
+ /**
10
+ * The base implementation of `_clone`, `_cloneDeep` and `_cloneDeepWith` which tracks traversed objects. A
11
+ * shallow clone copies array elements and own enumerable keys by reference and shares the buffer of typed
12
+ * arrays and data views; `Map` and `Set` entries are still shallow-cloned one level, as in lodash. A
13
+ * `customizer` is invoked for every value before it is cloned, with the value alone at the top level and
14
+ * with (value, key, object, stack) below; a result other than `undefined` is used as is.
15
+ *
16
+ * @param value - The value to clone.
17
+ * @param deep - Whether to recursively clone nested values.
18
+ * @param customizer - The function to customize cloning.
19
+ * @param stack - Tracks traversed objects and their clone counterparts.
20
+ * @param parent - The key and container of `value` when it sits inside another value being cloned;
21
+ * uncloneable nested values are kept by reference while an uncloneable top-level value becomes an empty
22
+ * object.
23
+ * @returns Returns the cloned value.
24
+ * @internal
25
+ */
26
+ export declare function _baseClone(value: unknown, deep: boolean, customizer?: _CloneDeepWithCustomizer<unknown>, stack?: _Stack, parent?: _Parent): unknown;
27
+ export {};
28
+ //# sourceMappingURL=_baseClone.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"_baseClone.d.ts","sourceRoot":"","sources":["../../src/_/_baseClone.ts"],"names":[],"mappings":"AA0CA,OAAO,KAAK,EAAE,wBAAwB,EAAE,MAAM,YAAY,CAAC;AAkC3D,kGAAkG;AAClG,KAAK,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;AAEnC,yEAAyE;AACzE,KAAK,OAAO,GAAG;IAAE,GAAG,EAAE,OAAO,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC;AAMhD;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,UAAU,CACtB,KAAK,EAAE,OAAO,EACd,IAAI,EAAE,OAAO,EACb,UAAU,CAAC,EAAE,wBAAwB,CAAC,OAAO,CAAC,EAC9C,KAAK,GAAE,MAAkB,EACzB,MAAM,CAAC,EAAE,OAAO,GACjB,OAAO,CAiGT"}
@@ -0,0 +1,229 @@
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 { _baseGetTag } from "./_baseGetTag.js";
34
+ import { _cloneArrayBuffer } from "./_cloneArrayBuffer.js";
35
+ import { _cloneTypedArray } from "./_cloneTypedArray.js";
36
+ import { _getAllKeys } from "./_getAllKeys.js";
37
+ import { _initCloneObject } from "./_initCloneObject.js";
38
+ import { _isIndex } from "./_isIndex.js";
39
+ import { _isObject } from "./isObject.js";
40
+ import { _isTypedArray } from "./isTypedArray.js";
41
+ /** `Object#toString` result references. */
42
+ const ARGS_TAG = "[object Arguments]";
43
+ const ARRAY_BUFFER_TAG = "[object ArrayBuffer]";
44
+ const BOOL_TAG = "[object Boolean]";
45
+ const DATA_VIEW_TAG = "[object DataView]";
46
+ const DATE_TAG = "[object Date]";
47
+ const FUNC_TAG = "[object Function]";
48
+ const MAP_TAG = "[object Map]";
49
+ const NUMBER_TAG = "[object Number]";
50
+ const OBJECT_TAG = "[object Object]";
51
+ const REGEXP_TAG = "[object RegExp]";
52
+ const SET_TAG = "[object Set]";
53
+ const STRING_TAG = "[object String]";
54
+ const SYMBOL_TAG = "[object Symbol]";
55
+ /** Tags of the non-plain, non-array values that `_initCloneByTag` knows how to clone. */
56
+ const CLONEABLE_TAGS = new Set([
57
+ ARRAY_BUFFER_TAG,
58
+ BOOL_TAG,
59
+ DATA_VIEW_TAG,
60
+ DATE_TAG,
61
+ MAP_TAG,
62
+ NUMBER_TAG,
63
+ REGEXP_TAG,
64
+ SET_TAG,
65
+ STRING_TAG,
66
+ SYMBOL_TAG,
67
+ ]);
68
+ /** Used to match `RegExp` flags from their coerced string values. */
69
+ const RE_FLAGS = /\w*$/;
70
+ /**
71
+ * The base implementation of `_clone`, `_cloneDeep` and `_cloneDeepWith` which tracks traversed objects. A
72
+ * shallow clone copies array elements and own enumerable keys by reference and shares the buffer of typed
73
+ * arrays and data views; `Map` and `Set` entries are still shallow-cloned one level, as in lodash. A
74
+ * `customizer` is invoked for every value before it is cloned, with the value alone at the top level and
75
+ * with (value, key, object, stack) below; a result other than `undefined` is used as is.
76
+ *
77
+ * @param value - The value to clone.
78
+ * @param deep - Whether to recursively clone nested values.
79
+ * @param customizer - The function to customize cloning.
80
+ * @param stack - Tracks traversed objects and their clone counterparts.
81
+ * @param parent - The key and container of `value` when it sits inside another value being cloned;
82
+ * uncloneable nested values are kept by reference while an uncloneable top-level value becomes an empty
83
+ * object.
84
+ * @returns Returns the cloned value.
85
+ * @internal
86
+ */
87
+ export function _baseClone(value, deep, customizer, stack = new Map(), parent) {
88
+ if (customizer) {
89
+ // symbol keys are passed as they are, although the lodash typing only names string and number keys;
90
+ // the top-level call passes the value alone, which the lodash typing does not express
91
+ const customized = parent
92
+ ? customizer(value, parent.key, parent.object, stack)
93
+ : customizer(value);
94
+ if (customized !== undefined) {
95
+ return customized;
96
+ }
97
+ }
98
+ if (!_isObject(value)) {
99
+ return value;
100
+ }
101
+ const nested = parent !== undefined;
102
+ const isArr = Array.isArray(value);
103
+ const source = value;
104
+ let result;
105
+ if (isArr) {
106
+ result = _initCloneArray(value);
107
+ if (!deep) {
108
+ // holes become explicit `undefined` entries, extra properties are not copied
109
+ for (let index = 0; index < value.length; index++) {
110
+ result[index] = source[index];
111
+ }
112
+ return result;
113
+ }
114
+ }
115
+ else {
116
+ const tag = _baseGetTag(value);
117
+ if (tag === OBJECT_TAG || tag === ARGS_TAG || (tag === FUNC_TAG && !nested)) {
118
+ result = tag === FUNC_TAG ? {} : _initCloneObject(value);
119
+ if (!deep) {
120
+ for (const key of _getAllKeys(value)) {
121
+ _assignValue(result, key, source[key]);
122
+ }
123
+ return result;
124
+ }
125
+ }
126
+ else if (_isTypedArray(value) || CLONEABLE_TAGS.has(tag)) {
127
+ result = _initCloneByTag(value, tag, deep);
128
+ }
129
+ else {
130
+ return nested ? value : {};
131
+ }
132
+ }
133
+ const stacked = stack.get(value);
134
+ if (stacked) {
135
+ return stacked;
136
+ }
137
+ stack.set(value, result);
138
+ if (value instanceof Set) {
139
+ const target = result;
140
+ value.forEach((subValue) => {
141
+ target.add(_baseClone(subValue, deep, customizer, stack, { key: subValue, object: value }));
142
+ });
143
+ }
144
+ else if (value instanceof Map) {
145
+ const target = result;
146
+ // keys are kept by reference, only values are cloned
147
+ value.forEach((subValue, key) => {
148
+ target.set(key, _baseClone(subValue, deep, customizer, stack, { key, object: value }));
149
+ });
150
+ }
151
+ if (isArr) {
152
+ // holes are visited too and become explicit `undefined` entries in the clone
153
+ for (let index = 0; index < value.length; index++) {
154
+ const cloned = _baseClone(source[index], deep, customizer, stack, {
155
+ key: index,
156
+ object: value,
157
+ });
158
+ _assignValue(result, index, cloned);
159
+ }
160
+ }
161
+ else {
162
+ // with a customizer the index keys of a typed array are visited too, so elements can be customized
163
+ for (const key of customizer ? _getAllKeys(value) : _ownKeys(value)) {
164
+ const cloned = _baseClone(source[key], deep, customizer, stack, { key, object: value });
165
+ _assignValue(result, key, cloned);
166
+ }
167
+ }
168
+ return result;
169
+ }
170
+ /**
171
+ * Own enumerable string and symbol keys to copy. Typed arrays skip their index keys, which the clone
172
+ * already holds, so only extra properties set on them are visited.
173
+ */
174
+ function _ownKeys(value) {
175
+ const keys = _getAllKeys(value);
176
+ if (!_isTypedArray(value)) {
177
+ return keys;
178
+ }
179
+ const length = value.length;
180
+ return keys.filter((key) => typeof key === "symbol" || !_isIndex(key, length));
181
+ }
182
+ /**
183
+ * Initializes an array clone of the same class and length, copying the properties `RegExp#exec` adds.
184
+ */
185
+ function _initCloneArray(array) {
186
+ const length = array.length;
187
+ const result = new array.constructor(length);
188
+ if (length && typeof array[0] === "string" && Object.hasOwn(array, "index")) {
189
+ const execResult = array;
190
+ result["index"] = execResult["index"];
191
+ result["input"] = execResult["input"];
192
+ }
193
+ return result;
194
+ }
195
+ /**
196
+ * Initializes a clone of a value by its `toStringTag`. Collections come back empty and are filled by
197
+ * the caller; everything else is complete on return. A shallow clone of a typed array or data view shares
198
+ * the buffer of the original, an array buffer is always copied.
199
+ */
200
+ function _initCloneByTag(object, tag, deep) {
201
+ const Ctor = object.constructor;
202
+ switch (tag) {
203
+ case ARRAY_BUFFER_TAG:
204
+ return _cloneArrayBuffer(object);
205
+ case BOOL_TAG:
206
+ case DATE_TAG:
207
+ return new Ctor(Number(object));
208
+ case DATA_VIEW_TAG: {
209
+ const view = object;
210
+ const buffer = deep ? _cloneArrayBuffer(view.buffer) : view.buffer;
211
+ return new Ctor(buffer, view.byteOffset, view.byteLength);
212
+ }
213
+ case MAP_TAG:
214
+ case SET_TAG:
215
+ return new Ctor();
216
+ case NUMBER_TAG:
217
+ case STRING_TAG:
218
+ return new Ctor(object);
219
+ case REGEXP_TAG: {
220
+ const regexp = object;
221
+ const result = new Ctor(regexp.source, RE_FLAGS.exec(String(regexp))?.[0]);
222
+ result.lastIndex = regexp.lastIndex;
223
+ return result;
224
+ }
225
+ case SYMBOL_TAG:
226
+ return Object(object.valueOf());
227
+ }
228
+ return _cloneTypedArray(object, deep);
229
+ }
@@ -0,0 +1,18 @@
1
+ import type { _List } from "./types.js";
2
+ /**
3
+ * The base implementation of `_difference`, `_differenceBy` and `_differenceWith`: creates an array of the
4
+ * `array` values whose criteria are not among the criteria of the `values` lists, compared with
5
+ * SameValueZero, or with `comparator` when one is given. The order and references of result values are
6
+ * determined by the first array, with `-0` normalised to `0` unless a comparator is used. Only array-like
7
+ * objects are inspected: any other `array` yields an empty array and any other entry of `values` is skipped.
8
+ *
9
+ * @param array - The array to inspect.
10
+ * @param values - The lists of values to exclude.
11
+ * @param iteratee - The iteratee invoked per element to produce its criterion. Defaults to identity.
12
+ * @param comparator - The comparator invoked per element with (arrayValue, otherValue); a truthy result
13
+ * excludes the element.
14
+ * @returns Returns the new array of filtered values.
15
+ * @internal
16
+ */
17
+ export declare function _baseDifference<T>(array: _List<T> | null | undefined, values: unknown[], iteratee?: (value: unknown) => unknown, comparator?: (arrayValue: unknown, otherValue: unknown) => boolean): T[];
18
+ //# sourceMappingURL=_baseDifference.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"_baseDifference.d.ts","sourceRoot":"","sources":["../../src/_/_baseDifference.ts"],"names":[],"mappings":"AAmCA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAExC;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAC7B,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,SAAS,EAClC,MAAM,EAAE,OAAO,EAAE,EACjB,QAAQ,GAAE,CAAC,KAAK,EAAE,OAAO,KAAK,OAA0B,EACxD,UAAU,CAAC,EAAE,CAAC,UAAU,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,KAAK,OAAO,GACnE,CAAC,EAAE,CAoCL"}