@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.
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/esm/_/keys.js ADDED
@@ -0,0 +1,60 @@
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 { _baseKeys } from "./_baseKeys.js";
33
+ import { _isIndex } from "./_isIndex.js";
34
+ import { _isArguments } from "./isArguments.js";
35
+ import { _isArrayLike } from "./isArrayLike.js";
36
+ import { _isTypedArray } from "./isTypedArray.js";
37
+ /**
38
+ * Creates an array of the own enumerable string keys of `object`. Arrays, arguments objects and typed arrays
39
+ * list every index first, holes included, followed by their other own keys; other array-likes, strings
40
+ * included, list their own keys as they are. Non-object values are coerced to objects.
41
+ *
42
+ * @param object - The object to query.
43
+ * @returns Returns the array of property names.
44
+ * @internal
45
+ */
46
+ export function _keys(object) {
47
+ if (!_isArrayLike(object)) {
48
+ return _baseKeys(object);
49
+ }
50
+ const value = Object(object);
51
+ const indexed = Array.isArray(value) || _isArguments(value) || _isTypedArray(value);
52
+ const length = indexed ? value.length : 0;
53
+ const result = Array.from({ length }, (_, index) => String(index));
54
+ for (const key of Object.keys(value)) {
55
+ if (!(indexed && (key === "length" || _isIndex(key, length)))) {
56
+ result.push(key);
57
+ }
58
+ }
59
+ return result;
60
+ }
@@ -0,0 +1,10 @@
1
+ /**
2
+ * Creates an array of the own and inherited enumerable string keys of `object`. Arrays, arguments objects
3
+ * and typed arrays list every index first, holes included, followed by their other keys.
4
+ *
5
+ * @param object - The object to query.
6
+ * @returns Returns the array of property names.
7
+ * @internal
8
+ */
9
+ export declare function _keysIn(object: unknown): string[];
10
+ //# sourceMappingURL=keysIn.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"keysIn.d.ts","sourceRoot":"","sources":["../../src/_/keysIn.ts"],"names":[],"mappings":"AAqCA;;;;;;;GAOG;AACH,wBAAgB,OAAO,CAAC,MAAM,EAAE,OAAO,GAAG,MAAM,EAAE,CAajD"}
@@ -0,0 +1,54 @@
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 { _isIndex } from "./_isIndex.js";
33
+ import { _isArguments } from "./isArguments.js";
34
+ import { _isTypedArray } from "./isTypedArray.js";
35
+ /**
36
+ * Creates an array of the own and inherited enumerable string keys of `object`. Arrays, arguments objects
37
+ * and typed arrays list every index first, holes included, followed by their other keys.
38
+ *
39
+ * @param object - The object to query.
40
+ * @returns Returns the array of property names.
41
+ * @internal
42
+ */
43
+ export function _keysIn(object) {
44
+ const value = Object(object);
45
+ const indexed = Array.isArray(value) || _isArguments(value) || _isTypedArray(value);
46
+ const length = indexed ? value.length : 0;
47
+ const result = Array.from({ length }, (_, index) => String(index));
48
+ for (const key in value) {
49
+ if (!(indexed && (key === "length" || _isIndex(key, length)))) {
50
+ result.push(key);
51
+ }
52
+ }
53
+ return result;
54
+ }
@@ -0,0 +1,63 @@
1
+ import type { _ArrayIterator, _Dictionary, _NumericDictionary, _ObjectIterator, _PartialObject, _StringIterator } from "./types.js";
2
+ /**
3
+ * Creates an object with the same keys as `object` and values generated by running each own enumerable
4
+ * string keyed property of `object` thru `iteratee`. The iteratee is invoked with three arguments:
5
+ * (value, key, object). Arrays, strings and other array-likes are mapped by index.
6
+ *
7
+ * @param object - The object to iterate over.
8
+ * @param iteratee - The function invoked per iteration, or an iteratee shorthand. Defaults to identity.
9
+ * @returns Returns the new mapped object.
10
+ * @internal
11
+ */
12
+ export declare function _mapValues<TResult>(obj: string | null | undefined, callback: _StringIterator<TResult>): _NumericDictionary<TResult>;
13
+ /**
14
+ * @internal
15
+ */
16
+ export declare function _mapValues<T, TResult>(array: T[], callback: _ArrayIterator<T, TResult>): _NumericDictionary<TResult>;
17
+ /**
18
+ * @internal
19
+ */
20
+ export declare function _mapValues<T extends object, TResult>(obj: T | null | undefined, callback: _ObjectIterator<T, TResult>): {
21
+ [P in keyof T]: TResult;
22
+ };
23
+ /**
24
+ * @internal
25
+ */
26
+ export declare function _mapValues<T>(obj: _Dictionary<T> | _NumericDictionary<T> | null | undefined, iteratee: object): _Dictionary<boolean>;
27
+ /**
28
+ * @internal
29
+ */
30
+ export declare function _mapValues<T extends object>(obj: T | null | undefined, iteratee: object): {
31
+ [P in keyof T]: boolean;
32
+ };
33
+ /**
34
+ * @internal
35
+ */
36
+ export declare function _mapValues<T, TKey extends keyof T>(obj: _Dictionary<T> | _NumericDictionary<T> | null | undefined, iteratee: TKey): _Dictionary<T[TKey]>;
37
+ /**
38
+ * @internal
39
+ */
40
+ export declare function _mapValues<T>(obj: _Dictionary<T> | _NumericDictionary<T> | null | undefined, iteratee: string): _Dictionary<any>;
41
+ /**
42
+ * @internal
43
+ */
44
+ export declare function _mapValues<T extends object>(obj: T | null | undefined, iteratee: string): {
45
+ [P in keyof T]: any;
46
+ };
47
+ /**
48
+ * @internal
49
+ */
50
+ export declare function _mapValues(obj: string | null | undefined): _NumericDictionary<string>;
51
+ /**
52
+ * @internal
53
+ */
54
+ export declare function _mapValues<T>(obj: _Dictionary<T> | _NumericDictionary<T> | null | undefined): _Dictionary<T>;
55
+ /**
56
+ * @internal
57
+ */
58
+ export declare function _mapValues<T extends object>(obj: T): T;
59
+ /**
60
+ * @internal
61
+ */
62
+ export declare function _mapValues<T extends object>(obj: T | null | undefined): _PartialObject<T>;
63
+ //# sourceMappingURL=mapValues.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"mapValues.d.ts","sourceRoot":"","sources":["../../src/_/mapValues.ts"],"names":[],"mappings":"AAoCA,OAAO,KAAK,EACR,cAAc,EACd,WAAW,EACX,kBAAkB,EAClB,eAAe,EACf,cAAc,EACd,eAAe,EAClB,MAAM,YAAY,CAAC;AAIpB;;;;;;;;;GASG;AACH,wBAAgB,UAAU,CAAC,OAAO,EAC9B,GAAG,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,EAC9B,QAAQ,EAAE,eAAe,CAAC,OAAO,CAAC,GACnC,kBAAkB,CAAC,OAAO,CAAC,CAAC;AAC/B;;GAEG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,OAAO,EACjC,KAAK,EAAE,CAAC,EAAE,EACV,QAAQ,EAAE,cAAc,CAAC,CAAC,EAAE,OAAO,CAAC,GACrC,kBAAkB,CAAC,OAAO,CAAC,CAAC;AAC/B;;GAEG;AACH,wBAAgB,UAAU,CAAC,CAAC,SAAS,MAAM,EAAE,OAAO,EAChD,GAAG,EAAE,CAAC,GAAG,IAAI,GAAG,SAAS,EACzB,QAAQ,EAAE,eAAe,CAAC,CAAC,EAAE,OAAO,CAAC,GACtC;KAAG,CAAC,IAAI,MAAM,CAAC,GAAG,OAAO;CAAE,CAAC;AAC/B;;GAEG;AACH,wBAAgB,UAAU,CAAC,CAAC,EACxB,GAAG,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,kBAAkB,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,SAAS,EAC9D,QAAQ,EAAE,MAAM,GACjB,WAAW,CAAC,OAAO,CAAC,CAAC;AACxB;;GAEG;AACH,wBAAgB,UAAU,CAAC,CAAC,SAAS,MAAM,EACvC,GAAG,EAAE,CAAC,GAAG,IAAI,GAAG,SAAS,EACzB,QAAQ,EAAE,MAAM,GACjB;KAAG,CAAC,IAAI,MAAM,CAAC,GAAG,OAAO;CAAE,CAAC;AAC/B;;GAEG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,SAAS,MAAM,CAAC,EAC9C,GAAG,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,kBAAkB,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,SAAS,EAC9D,QAAQ,EAAE,IAAI,GACf,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AACxB;;GAEG;AACH,wBAAgB,UAAU,CAAC,CAAC,EACxB,GAAG,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,kBAAkB,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,SAAS,EAC9D,QAAQ,EAAE,MAAM,GAEjB,WAAW,CAAC,GAAG,CAAC,CAAC;AACpB;;GAEG;AAEH,wBAAgB,UAAU,CAAC,CAAC,SAAS,MAAM,EACvC,GAAG,EAAE,CAAC,GAAG,IAAI,GAAG,SAAS,EACzB,QAAQ,EAAE,MAAM,GACjB;KAAG,CAAC,IAAI,MAAM,CAAC,GAAG,GAAG;CAAE,CAAC;AAC3B;;GAEG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC;AACvF;;GAEG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,kBAAkB,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,SAAS,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;AAC9G;;GAEG;AACH,wBAAgB,UAAU,CAAC,CAAC,SAAS,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;AACxD;;GAEG;AACH,wBAAgB,UAAU,CAAC,CAAC,SAAS,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,IAAI,GAAG,SAAS,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC"}
@@ -0,0 +1,47 @@
1
+ // (C) 2026 GoodData Corporation
2
+ /*!
3
+ * Portions of this file are derived from Lodash.
4
+ * https://github.com/lodash/lodash
5
+ *
6
+ * Copyright OpenJS Foundation and other contributors <https://openjsf.org/>
7
+ *
8
+ * Based on Underscore.js, copyright Jeremy Ashkenas,
9
+ * DocumentCloud and Investigative Reporters & Editors <http://underscorejs.org/>
10
+ *
11
+ * Modifications Copyright (c) 2026 GoodData Corporation
12
+ *
13
+ * Permission is hereby granted, free of charge, to any person obtaining
14
+ * a copy of this software and associated documentation files (the
15
+ * "Software"), to deal in the Software without restriction, including
16
+ * without limitation the rights to use, copy, modify, merge, publish,
17
+ * distribute, sublicense, and/or sell copies of the Software, and to
18
+ * permit persons to whom the Software is furnished to do so, subject to
19
+ * the following conditions:
20
+ *
21
+ * The above copyright notice and this permission notice shall be
22
+ * included in all copies or substantial portions of the Software.
23
+ *
24
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25
+ * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26
+ * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27
+ * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
28
+ * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
29
+ * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
30
+ * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
31
+ */
32
+ import { _baseAssignValue } from "./_baseAssignValue.js";
33
+ import { _baseIteratee } from "./_baseIteratee.js";
34
+ import { _keys } from "./keys.js";
35
+ export function _mapValues(object, iteratee) {
36
+ const result = {};
37
+ if (object == null) {
38
+ return result;
39
+ }
40
+ const transform = _baseIteratee(iteratee);
41
+ const source = Object(object);
42
+ for (const key of _keys(source)) {
43
+ // defines a `__proto__` key as an own property instead of changing the prototype
44
+ _baseAssignValue(result, key, transform(source[key], key, source));
45
+ }
46
+ return result;
47
+ }
package/esm/_/max.d.ts ADDED
@@ -0,0 +1,16 @@
1
+ import type { _List } from "./types.js";
2
+ /**
3
+ * Computes the maximum value of `array` using the `>` operator, so mixed values coerce the way the operator
4
+ * does. Nullish, `NaN` and symbol elements are skipped. If `array` is empty or falsey, `undefined` is
5
+ * returned.
6
+ *
7
+ * @param array - The array to iterate over.
8
+ * @returns Returns the maximum value.
9
+ * @internal
10
+ */
11
+ export declare function _max<T>(array: readonly [T, ...T[]]): T;
12
+ /**
13
+ * @internal
14
+ */
15
+ export declare function _max<T>(array: _List<T> | null | undefined): T | undefined;
16
+ //# sourceMappingURL=max.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"max.d.ts","sourceRoot":"","sources":["../../src/_/max.ts"],"names":[],"mappings":"AAkCA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAKxC;;;;;;;;GAQG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;AACxD;;GAEG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,SAAS,GAAG,CAAC,GAAG,SAAS,CAAC"}
package/esm/_/max.js ADDED
@@ -0,0 +1,37 @@
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 { _baseExtremum } from "./_baseExtremum.js";
33
+ // oxlint-disable-next-line @typescript-eslint/no-explicit-any -- the `>` operator is applied to arbitrary values, as in lodash
34
+ const isGreater = (value, other) => value > other;
35
+ export function _max(array) {
36
+ return array?.length ? _baseExtremum(array, (value) => value, isGreater) : undefined;
37
+ }
@@ -0,0 +1,89 @@
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 cache a memoized function keeps its results in. Keys are compared by SameValueZero, as a `Map`
33
+ * does, so `NaN` equals `NaN` and objects compare by reference.
34
+ *
35
+ * @internal
36
+ */
37
+ export type _MapCache = {
38
+ /** Removes `key` and its value from the cache; returns whether the entry was removed. */
39
+ delete(key: unknown): boolean;
40
+ /** Gets the cached value for `key`. */
41
+ get(key: unknown): unknown;
42
+ /** Checks if a cached value for `key` exists. */
43
+ has(key: unknown): boolean;
44
+ /** Sets `value` to `key` of the cache; a cache that returns itself here lets `set` be chained. */
45
+ set(key: unknown, value: unknown): unknown;
46
+ /** Removes all entries from the cache. */
47
+ clear?: (() => void) | undefined;
48
+ };
49
+ /**
50
+ * @internal
51
+ */
52
+ export type _MapCacheConstructor = new () => _MapCache;
53
+ /**
54
+ * What `_memoize` adds to the function it returns.
55
+ *
56
+ * @internal
57
+ */
58
+ export type _MemoizedFunction = {
59
+ /** The cache of results, exposed so callers can inspect or edit it. */
60
+ cache: _MapCache;
61
+ };
62
+ /**
63
+ * The shape of `_memoize`: the memoizing function itself plus the `Cache` constructor every memoized
64
+ * function starts with.
65
+ *
66
+ * @internal
67
+ */
68
+ export type _Memoize = {
69
+ <T extends (...args: any) => any>(func: T, resolver?: (this: ThisParameterType<T>, ...args: Parameters<T>) => unknown): T & _MemoizedFunction;
70
+ /** The constructor of the cache every memoized function starts with; a native `Map` unless replaced. */
71
+ Cache: _MapCacheConstructor;
72
+ };
73
+ /**
74
+ * Creates a function that memoizes the result of `func`. If `resolver` is provided, it determines the
75
+ * cache key for storing the result based on the arguments provided to the memoized function. By
76
+ * default, the first argument provided to the memoized function is used as the map cache key. The
77
+ * `func` is invoked with the `this` binding of the memoized function.
78
+ *
79
+ * **Note:** The cache is exposed as the `cache` property on the memoized function. Its creation may be
80
+ * customized by replacing the `_memoize.Cache` constructor with one whose instances implement the
81
+ * `Map` method interface of `clear`, `delete`, `get`, `has`, and `set`.
82
+ *
83
+ * @param func - The function to have its output memoized.
84
+ * @param resolver - The function to resolve the cache key.
85
+ * @returns Returns the new memoized function.
86
+ * @internal
87
+ */
88
+ export declare const _memoize: _Memoize;
89
+ //# sourceMappingURL=memoize.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"memoize.d.ts","sourceRoot":"","sources":["../../src/_/memoize.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AAEH;;;;;GAKG;AACH,MAAM,MAAM,SAAS,GAAG;IACpB,yFAAyF;IACzF,MAAM,CAAC,GAAG,EAAE,OAAO,GAAG,OAAO,CAAC;IAC9B,uCAAuC;IACvC,GAAG,CAAC,GAAG,EAAE,OAAO,GAAG,OAAO,CAAC;IAC3B,iDAAiD;IACjD,GAAG,CAAC,GAAG,EAAE,OAAO,GAAG,OAAO,CAAC;IAC3B,kGAAkG;IAClG,GAAG,CAAC,GAAG,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC;IAC3C,0CAA0C;IAC1C,KAAK,CAAC,EAAE,CAAC,MAAM,IAAI,CAAC,GAAG,SAAS,CAAC;CACpC,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,oBAAoB,GAAG,UAAU,SAAS,CAAC;AAEvD;;;;GAIG;AACH,MAAM,MAAM,iBAAiB,GAAG;IAC5B,uEAAuE;IACvE,KAAK,EAAE,SAAS,CAAC;CACpB,CAAC;AAEF;;;;;GAKG;AACH,MAAM,MAAM,QAAQ,GAAG;IAEnB,CAAC,CAAC,SAAS,CAAC,GAAG,IAAI,EAAE,GAAG,KAAK,GAAG,EAC5B,IAAI,EAAE,CAAC,EACP,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,iBAAiB,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,KAAK,OAAO,GAC3E,CAAC,GAAG,iBAAiB,CAAC;IACzB,wGAAwG;IACxG,KAAK,EAAE,oBAAoB,CAAC;CAC/B,CAAC;AAEF;;;;;;;;;;;;;;GAcG;AACH,eAAO,MAAM,QAAQ,EAAE,QA+BtB,CAAC"}
@@ -0,0 +1,36 @@
1
+ // (C) 2026 GoodData Corporation
2
+ /**
3
+ * Creates a function that memoizes the result of `func`. If `resolver` is provided, it determines the
4
+ * cache key for storing the result based on the arguments provided to the memoized function. By
5
+ * default, the first argument provided to the memoized function is used as the map cache key. The
6
+ * `func` is invoked with the `this` binding of the memoized function.
7
+ *
8
+ * **Note:** The cache is exposed as the `cache` property on the memoized function. Its creation may be
9
+ * customized by replacing the `_memoize.Cache` constructor with one whose instances implement the
10
+ * `Map` method interface of `clear`, `delete`, `get`, `has`, and `set`.
11
+ *
12
+ * @param func - The function to have its output memoized.
13
+ * @param resolver - The function to resolve the cache key.
14
+ * @returns Returns the new memoized function.
15
+ * @internal
16
+ */
17
+ export const _memoize = Object.assign(
18
+ // oxlint-disable-next-line @typescript-eslint/no-explicit-any
19
+ function memoize(func, resolver) {
20
+ if (typeof func !== "function" || (resolver != null && typeof resolver !== "function")) {
21
+ throw new TypeError("Expected a function");
22
+ }
23
+ const memoized = function (...args) {
24
+ const key = resolver ? resolver.apply(this, args) : args[0];
25
+ const cache = memoized.cache;
26
+ if (cache.has(key)) {
27
+ return cache.get(key);
28
+ }
29
+ const result = func.apply(this, args);
30
+ // a cache whose `set` does not return itself keeps the existing instance
31
+ memoized.cache = cache.set(key, result) || cache;
32
+ return result;
33
+ };
34
+ memoized.cache = new _memoize.Cache();
35
+ return memoized;
36
+ }, { Cache: Map });
@@ -0,0 +1,32 @@
1
+ /**
2
+ * Recursively merges own and inherited enumerable string keyed properties of source objects into the
3
+ * destination object. Source properties that resolve to `undefined` are skipped if a destination value
4
+ * exists. Array and plain object properties are merged recursively. Other objects and value types are
5
+ * overridden by assignment. Source objects are applied from left to right. Subsequent sources overwrite
6
+ * property assignments of previous sources.
7
+ *
8
+ * **Note:** This method mutates `object`.
9
+ *
10
+ * @param object - The destination object.
11
+ * @param sources - The source objects.
12
+ * @returns Returns `object`.
13
+ * @internal
14
+ */
15
+ export declare function _merge<TObject, TSource>(object: TObject, source: TSource): TObject & TSource;
16
+ /**
17
+ * @internal
18
+ */
19
+ export declare function _merge<TObject, TSource1, TSource2>(object: TObject, source1: TSource1, source2: TSource2): TObject & TSource1 & TSource2;
20
+ /**
21
+ * @internal
22
+ */
23
+ export declare function _merge<TObject, TSource1, TSource2, TSource3>(object: TObject, source1: TSource1, source2: TSource2, source3: TSource3): TObject & TSource1 & TSource2 & TSource3;
24
+ /**
25
+ * @internal
26
+ */
27
+ export declare function _merge<TObject, TSource1, TSource2, TSource3, TSource4>(object: TObject, source1: TSource1, source2: TSource2, source3: TSource3, source4: TSource4): TObject & TSource1 & TSource2 & TSource3 & TSource4;
28
+ /**
29
+ * @internal
30
+ */
31
+ export declare function _merge(object: any, ...otherArgs: any[]): any;
32
+ //# sourceMappingURL=merge.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"merge.d.ts","sourceRoot":"","sources":["../../src/_/merge.ts"],"names":[],"mappings":"AAsCA;;;;;;;;;;;;;GAaG;AACH,wBAAgB,MAAM,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,GAAG,OAAO,GAAG,OAAO,CAAC;AAC9F;;GAEG;AACH,wBAAgB,MAAM,CAAC,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAC9C,MAAM,EAAE,OAAO,EACf,OAAO,EAAE,QAAQ,EACjB,OAAO,EAAE,QAAQ,GAClB,OAAO,GAAG,QAAQ,GAAG,QAAQ,CAAC;AACjC;;GAEG;AACH,wBAAgB,MAAM,CAAC,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EACxD,MAAM,EAAE,OAAO,EACf,OAAO,EAAE,QAAQ,EACjB,OAAO,EAAE,QAAQ,EACjB,OAAO,EAAE,QAAQ,GAClB,OAAO,GAAG,QAAQ,GAAG,QAAQ,GAAG,QAAQ,CAAC;AAC5C;;GAEG;AACH,wBAAgB,MAAM,CAAC,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAClE,MAAM,EAAE,OAAO,EACf,OAAO,EAAE,QAAQ,EACjB,OAAO,EAAE,QAAQ,EACjB,OAAO,EAAE,QAAQ,EACjB,OAAO,EAAE,QAAQ,GAClB,OAAO,GAAG,QAAQ,GAAG,QAAQ,GAAG,QAAQ,GAAG,QAAQ,CAAC;AACvD;;GAEG;AAEH,wBAAgB,MAAM,CAAC,MAAM,EAAE,GAAG,EAAE,GAAG,SAAS,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC"}
package/esm/_/merge.js ADDED
@@ -0,0 +1,45 @@
1
+ // (C) 2026 GoodData Corporation
2
+ /*!
3
+ * Portions of this file are derived from Lodash.
4
+ * https://github.com/lodash/lodash
5
+ *
6
+ * Copyright OpenJS Foundation and other contributors <https://openjsf.org/>
7
+ *
8
+ * Based on Underscore.js, copyright Jeremy Ashkenas,
9
+ * DocumentCloud and Investigative Reporters & Editors <http://underscorejs.org/>
10
+ *
11
+ * Modifications Copyright (c) 2026 GoodData Corporation
12
+ *
13
+ * Permission is hereby granted, free of charge, to any person obtaining
14
+ * a copy of this software and associated documentation files (the
15
+ * "Software"), to deal in the Software without restriction, including
16
+ * without limitation the rights to use, copy, modify, merge, publish,
17
+ * distribute, sublicense, and/or sell copies of the Software, and to
18
+ * permit persons to whom the Software is furnished to do so, subject to
19
+ * the following conditions:
20
+ *
21
+ * The above copyright notice and this permission notice shall be
22
+ * included in all copies or substantial portions of the Software.
23
+ *
24
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25
+ * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26
+ * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27
+ * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
28
+ * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
29
+ * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
30
+ * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
31
+ */
32
+ import { _baseMerge } from "./_baseMerge.js";
33
+ import { _isIterateeCall } from "./_isIterateeCall.js";
34
+ export function _merge(object, ...sources) {
35
+ const target = Object(object);
36
+ // when called as an iteratee, e.g. by `reduce`, only the value is a source, not the index and collection
37
+ const length = sources.length > 2 && _isIterateeCall(sources[0], sources[1], sources[2]) ? 1 : sources.length;
38
+ for (let index = 0; index < length; index++) {
39
+ const source = sources[index];
40
+ if (source) {
41
+ _baseMerge(target, Object(source), new Map());
42
+ }
43
+ }
44
+ return target;
45
+ }
@@ -0,0 +1,34 @@
1
+ import type { _MergeWithCustomizer } from "./types.js";
2
+ /**
3
+ * This method is like `_merge` except that it accepts `customizer` which is invoked to produce the merged
4
+ * values of the destination and source properties. If `customizer` returns `undefined`, merging is handled
5
+ * by the method instead. The `customizer` is invoked with six arguments: (objValue, srcValue, key, object,
6
+ * source, stack). It is taken from the last argument when that is a function preceded by at least one
7
+ * source.
8
+ *
9
+ * **Note:** This method mutates `object`.
10
+ *
11
+ * @param object - The destination object.
12
+ * @param source - The source object.
13
+ * @param customizer - The function to customize assigned values.
14
+ * @returns Returns `object`.
15
+ * @internal
16
+ */
17
+ export declare function _mergeWith<TObject, TSource>(object: TObject, source: TSource, customizer: _MergeWithCustomizer): TObject & TSource;
18
+ /**
19
+ * @internal
20
+ */
21
+ export declare function _mergeWith<TObject, TSource1, TSource2>(object: TObject, source1: TSource1, source2: TSource2, customizer: _MergeWithCustomizer): TObject & TSource1 & TSource2;
22
+ /**
23
+ * @internal
24
+ */
25
+ export declare function _mergeWith<TObject, TSource1, TSource2, TSource3>(object: TObject, source1: TSource1, source2: TSource2, source3: TSource3, customizer: _MergeWithCustomizer): TObject & TSource1 & TSource2 & TSource3;
26
+ /**
27
+ * @internal
28
+ */
29
+ export declare function _mergeWith<TObject, TSource1, TSource2, TSource3, TSource4>(object: TObject, source1: TSource1, source2: TSource2, source3: TSource3, source4: TSource4, customizer: _MergeWithCustomizer): TObject & TSource1 & TSource2 & TSource3 & TSource4;
30
+ /**
31
+ * @internal
32
+ */
33
+ export declare function _mergeWith(object: any, ...otherArgs: any[]): any;
34
+ //# sourceMappingURL=mergeWith.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"mergeWith.d.ts","sourceRoot":"","sources":["../../src/_/mergeWith.ts"],"names":[],"mappings":"AAmCA,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,YAAY,CAAC;AAIvD;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,UAAU,CAAC,OAAO,EAAE,OAAO,EACvC,MAAM,EAAE,OAAO,EACf,MAAM,EAAE,OAAO,EACf,UAAU,EAAE,oBAAoB,GACjC,OAAO,GAAG,OAAO,CAAC;AACrB;;GAEG;AACH,wBAAgB,UAAU,CAAC,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAClD,MAAM,EAAE,OAAO,EACf,OAAO,EAAE,QAAQ,EACjB,OAAO,EAAE,QAAQ,EACjB,UAAU,EAAE,oBAAoB,GACjC,OAAO,GAAG,QAAQ,GAAG,QAAQ,CAAC;AACjC;;GAEG;AACH,wBAAgB,UAAU,CAAC,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAC5D,MAAM,EAAE,OAAO,EACf,OAAO,EAAE,QAAQ,EACjB,OAAO,EAAE,QAAQ,EACjB,OAAO,EAAE,QAAQ,EACjB,UAAU,EAAE,oBAAoB,GACjC,OAAO,GAAG,QAAQ,GAAG,QAAQ,GAAG,QAAQ,CAAC;AAC5C;;GAEG;AACH,wBAAgB,UAAU,CAAC,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EACtE,MAAM,EAAE,OAAO,EACf,OAAO,EAAE,QAAQ,EACjB,OAAO,EAAE,QAAQ,EACjB,OAAO,EAAE,QAAQ,EACjB,OAAO,EAAE,QAAQ,EACjB,UAAU,EAAE,oBAAoB,GACjC,OAAO,GAAG,QAAQ,GAAG,QAAQ,GAAG,QAAQ,GAAG,QAAQ,CAAC;AACvD;;GAEG;AAEH,wBAAgB,UAAU,CAAC,MAAM,EAAE,GAAG,EAAE,GAAG,SAAS,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC"}
@@ -0,0 +1,50 @@
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 { _baseMerge } from "./_baseMerge.js";
33
+ import { _isIterateeCall } from "./_isIterateeCall.js";
34
+ export function _mergeWith(object, ...args) {
35
+ const target = Object(object);
36
+ const last = args[args.length - 1];
37
+ const customizer = args.length > 1 && typeof last === "function" ? last : undefined;
38
+ let length = customizer ? args.length - 1 : args.length;
39
+ // when called as an iteratee, e.g. by `reduce`, only the value is a source, not the index and collection
40
+ if (args.length > 2 && _isIterateeCall(args[0], args[1], args[2])) {
41
+ length = 1;
42
+ }
43
+ for (let index = 0; index < length; index++) {
44
+ const source = args[index];
45
+ if (source) {
46
+ _baseMerge(target, Object(source), new Map(), customizer);
47
+ }
48
+ }
49
+ return target;
50
+ }
package/esm/_/min.d.ts ADDED
@@ -0,0 +1,16 @@
1
+ import type { _List } from "./types.js";
2
+ /**
3
+ * Computes the minimum value of `array` using the `<` operator, so mixed values coerce the way the operator
4
+ * does. Nullish, `NaN` and symbol elements are skipped. If `array` is empty or falsey, `undefined` is
5
+ * returned.
6
+ *
7
+ * @param array - The array to iterate over.
8
+ * @returns Returns the minimum value.
9
+ * @internal
10
+ */
11
+ export declare function _min<T>(array: readonly [T, ...T[]]): T;
12
+ /**
13
+ * @internal
14
+ */
15
+ export declare function _min<T>(array: _List<T> | null | undefined): T | undefined;
16
+ //# sourceMappingURL=min.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"min.d.ts","sourceRoot":"","sources":["../../src/_/min.ts"],"names":[],"mappings":"AAkCA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAKxC;;;;;;;;GAQG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;AACxD;;GAEG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,SAAS,GAAG,CAAC,GAAG,SAAS,CAAC"}