@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
@@ -0,0 +1,67 @@
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 { _baseIteratee } from "./_baseIteratee.js";
33
+ import { _toInteger } from "./toInteger.js";
34
+ /**
35
+ * This method is like `_findIndex` except that it iterates over elements of `array` from right to left,
36
+ * returning the index of the first element `predicate` returns truthy for, else `-1`. The predicate is
37
+ * invoked with three arguments: (value, index, array), may be an iteratee shorthand and defaults to the
38
+ * identity. The search starts at `fromIndex`, which is coerced to an integer the way lodash does it, counted
39
+ * from the end when negative and clamped into the array.
40
+ *
41
+ * @param array - The array to inspect.
42
+ * @param predicate - The function invoked per iteration.
43
+ * @param fromIndex - The index to search from. Defaults to the last index.
44
+ * @returns Returns the index of the found element, else `-1`.
45
+ * @internal
46
+ */
47
+ export function _findLastIndex(array, predicate, fromIndex) {
48
+ if (!array?.length) {
49
+ return -1;
50
+ }
51
+ const length = array.length;
52
+ let start = length - 1;
53
+ if (fromIndex !== undefined) {
54
+ const from = _toInteger(fromIndex);
55
+ // as in lodash, the sign is read from the raw argument
56
+ start = fromIndex < 0 ? Math.max(length + from, 0) : Math.min(from, length - 1);
57
+ }
58
+ const test = _baseIteratee(predicate);
59
+ // counting down from one past the start keeps a `-0` start from being returned as is, as in lodash
60
+ let index = start + 1;
61
+ while (index--) {
62
+ if (test(array[index], index, array)) {
63
+ return index;
64
+ }
65
+ }
66
+ return -1;
67
+ }
package/esm/_/get.d.ts ADDED
@@ -0,0 +1,78 @@
1
+ import type { _PropertyPath } from "./set.js";
2
+ import type { _NumericDictionary } from "./types.js";
3
+ /**
4
+ * Gets the value at `path` of `object`. If the resolved value is `undefined`, the `defaultValue` is returned
5
+ * in its place; `null` and other values are returned as they are. Paths may be dotted or bracketed strings,
6
+ * arrays of keys, symbols or numbers, and a key that exists on `object` is read directly instead of being
7
+ * parsed as a path, as in lodash.
8
+ *
9
+ * Unlike the lodash typings, string paths are not typed by their segments; they resolve to `any`.
10
+ *
11
+ * @param object - The object to query.
12
+ * @param path - The path of the property to get.
13
+ * @param defaultValue - The value returned for `undefined` resolved values.
14
+ * @returns Returns the resolved value.
15
+ * @internal
16
+ */
17
+ export declare function _get<TObject extends object, TKey extends keyof TObject>(object: TObject, path: TKey | [TKey]): TObject[TKey];
18
+ /**
19
+ * @internal
20
+ */
21
+ export declare function _get<TObject extends object, TKey extends keyof TObject>(object: TObject | null | undefined, path: TKey | [TKey]): TObject[TKey] | undefined;
22
+ /**
23
+ * @internal
24
+ */
25
+ export declare function _get<TObject extends object, TKey extends keyof TObject, TDefault>(object: TObject | null | undefined, path: TKey | [TKey], defaultValue: TDefault): Exclude<TObject[TKey], undefined> | TDefault;
26
+ /**
27
+ * @internal
28
+ */
29
+ export declare function _get<TObject extends object, TKey1 extends keyof TObject, TKey2 extends keyof TObject[TKey1]>(object: TObject, path: [TKey1, TKey2]): TObject[TKey1][TKey2];
30
+ /**
31
+ * @internal
32
+ */
33
+ export declare function _get<TObject extends object, TKey1 extends keyof TObject, TKey2 extends keyof NonNullable<TObject[TKey1]>>(object: TObject | null | undefined, path: [TKey1, TKey2]): NonNullable<TObject[TKey1]>[TKey2] | undefined;
34
+ /**
35
+ * @internal
36
+ */
37
+ export declare function _get<TObject extends object, TKey1 extends keyof TObject, TKey2 extends keyof NonNullable<TObject[TKey1]>, TDefault>(object: TObject | null | undefined, path: [TKey1, TKey2], defaultValue: TDefault): Exclude<NonNullable<TObject[TKey1]>[TKey2], undefined> | TDefault;
38
+ /**
39
+ * @internal
40
+ */
41
+ export declare function _get<TObject extends object, TKey1 extends keyof TObject, TKey2 extends keyof TObject[TKey1], TKey3 extends keyof TObject[TKey1][TKey2]>(object: TObject, path: [TKey1, TKey2, TKey3]): TObject[TKey1][TKey2][TKey3];
42
+ /**
43
+ * @internal
44
+ */
45
+ export declare function _get<TObject extends object, TKey1 extends keyof TObject, TKey2 extends keyof NonNullable<TObject[TKey1]>, TKey3 extends keyof NonNullable<NonNullable<TObject[TKey1]>[TKey2]>>(object: TObject | null | undefined, path: [TKey1, TKey2, TKey3]): NonNullable<NonNullable<TObject[TKey1]>[TKey2]>[TKey3] | undefined;
46
+ /**
47
+ * @internal
48
+ */
49
+ export declare function _get<TObject extends object, TKey1 extends keyof TObject, TKey2 extends keyof NonNullable<TObject[TKey1]>, TKey3 extends keyof NonNullable<NonNullable<TObject[TKey1]>[TKey2]>, TDefault>(object: TObject | null | undefined, path: [TKey1, TKey2, TKey3], defaultValue: TDefault): Exclude<NonNullable<NonNullable<TObject[TKey1]>[TKey2]>[TKey3], undefined> | TDefault;
50
+ /**
51
+ * @internal
52
+ */
53
+ export declare function _get<TObject extends object, TKey1 extends keyof TObject, TKey2 extends keyof TObject[TKey1], TKey3 extends keyof TObject[TKey1][TKey2], TKey4 extends keyof TObject[TKey1][TKey2][TKey3]>(object: TObject, path: [TKey1, TKey2, TKey3, TKey4]): TObject[TKey1][TKey2][TKey3][TKey4];
54
+ /**
55
+ * @internal
56
+ */
57
+ export declare function _get<T>(object: _NumericDictionary<T>, path: number): T;
58
+ /**
59
+ * @internal
60
+ */
61
+ export declare function _get<T>(object: _NumericDictionary<T> | null | undefined, path: number): T | undefined;
62
+ /**
63
+ * @internal
64
+ */
65
+ export declare function _get<T, TDefault>(object: _NumericDictionary<T> | null | undefined, path: number, defaultValue: TDefault): T | TDefault;
66
+ /**
67
+ * @internal
68
+ */
69
+ export declare function _get<TDefault>(object: null | undefined, path: _PropertyPath, defaultValue: TDefault): TDefault;
70
+ /**
71
+ * @internal
72
+ */
73
+ export declare function _get(object: null | undefined, path: _PropertyPath): undefined;
74
+ /**
75
+ * @internal
76
+ */
77
+ export declare function _get(object: any, path: _PropertyPath, defaultValue?: any): any;
78
+ //# sourceMappingURL=get.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"get.d.ts","sourceRoot":"","sources":["../../src/_/get.ts"],"names":[],"mappings":"AAkCA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AAC9C,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,YAAY,CAAC;AAErD;;;;;;;;;;;;;GAaG;AACH,wBAAgB,IAAI,CAAC,OAAO,SAAS,MAAM,EAAE,IAAI,SAAS,MAAM,OAAO,EACnE,MAAM,EAAE,OAAO,EACf,IAAI,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,GACpB,OAAO,CAAC,IAAI,CAAC,CAAC;AACjB;;GAEG;AACH,wBAAgB,IAAI,CAAC,OAAO,SAAS,MAAM,EAAE,IAAI,SAAS,MAAM,OAAO,EACnE,MAAM,EAAE,OAAO,GAAG,IAAI,GAAG,SAAS,EAClC,IAAI,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,GACpB,OAAO,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC;AAC7B;;GAEG;AACH,wBAAgB,IAAI,CAAC,OAAO,SAAS,MAAM,EAAE,IAAI,SAAS,MAAM,OAAO,EAAE,QAAQ,EAC7E,MAAM,EAAE,OAAO,GAAG,IAAI,GAAG,SAAS,EAClC,IAAI,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,EACnB,YAAY,EAAE,QAAQ,GACvB,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,SAAS,CAAC,GAAG,QAAQ,CAAC;AAChD;;GAEG;AACH,wBAAgB,IAAI,CAAC,OAAO,SAAS,MAAM,EAAE,KAAK,SAAS,MAAM,OAAO,EAAE,KAAK,SAAS,MAAM,OAAO,CAAC,KAAK,CAAC,EACxG,MAAM,EAAE,OAAO,EACf,IAAI,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,GACrB,OAAO,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC;AACzB;;GAEG;AACH,wBAAgB,IAAI,CAChB,OAAO,SAAS,MAAM,EACtB,KAAK,SAAS,MAAM,OAAO,EAC3B,KAAK,SAAS,MAAM,WAAW,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EACjD,MAAM,EAAE,OAAO,GAAG,IAAI,GAAG,SAAS,EAAE,IAAI,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,WAAW,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,SAAS,CAAC;AAC5G;;GAEG;AACH,wBAAgB,IAAI,CAChB,OAAO,SAAS,MAAM,EACtB,KAAK,SAAS,MAAM,OAAO,EAC3B,KAAK,SAAS,MAAM,WAAW,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAC/C,QAAQ,EAER,MAAM,EAAE,OAAO,GAAG,IAAI,GAAG,SAAS,EAClC,IAAI,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,EACpB,YAAY,EAAE,QAAQ,GACvB,OAAO,CAAC,WAAW,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,SAAS,CAAC,GAAG,QAAQ,CAAC;AACrE;;GAEG;AACH,wBAAgB,IAAI,CAChB,OAAO,SAAS,MAAM,EACtB,KAAK,SAAS,MAAM,OAAO,EAC3B,KAAK,SAAS,MAAM,OAAO,CAAC,KAAK,CAAC,EAClC,KAAK,SAAS,MAAM,OAAO,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,EAC3C,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC;AAC9E;;GAEG;AACH,wBAAgB,IAAI,CAChB,OAAO,SAAS,MAAM,EACtB,KAAK,SAAS,MAAM,OAAO,EAC3B,KAAK,SAAS,MAAM,WAAW,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAC/C,KAAK,SAAS,MAAM,WAAW,CAAC,WAAW,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAEnE,MAAM,EAAE,OAAO,GAAG,IAAI,GAAG,SAAS,EAClC,IAAI,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAC5B,WAAW,CAAC,WAAW,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,SAAS,CAAC;AACtE;;GAEG;AACH,wBAAgB,IAAI,CAChB,OAAO,SAAS,MAAM,EACtB,KAAK,SAAS,MAAM,OAAO,EAC3B,KAAK,SAAS,MAAM,WAAW,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAC/C,KAAK,SAAS,MAAM,WAAW,CAAC,WAAW,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EACnE,QAAQ,EAER,MAAM,EAAE,OAAO,GAAG,IAAI,GAAG,SAAS,EAClC,IAAI,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,EAC3B,YAAY,EAAE,QAAQ,GACvB,OAAO,CAAC,WAAW,CAAC,WAAW,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,SAAS,CAAC,GAAG,QAAQ,CAAC;AACzF;;GAEG;AACH,wBAAgB,IAAI,CAChB,OAAO,SAAS,MAAM,EACtB,KAAK,SAAS,MAAM,OAAO,EAC3B,KAAK,SAAS,MAAM,OAAO,CAAC,KAAK,CAAC,EAClC,KAAK,SAAS,MAAM,OAAO,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,EACzC,KAAK,SAAS,MAAM,OAAO,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,EAClD,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC;AAC5F;;GAEG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,kBAAkB,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,GAAG,CAAC,CAAC;AACxE;;GAEG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,kBAAkB,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,SAAS,EAAE,IAAI,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS,CAAC;AACvG;;GAEG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,QAAQ,EAC5B,MAAM,EAAE,kBAAkB,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,SAAS,EAChD,IAAI,EAAE,MAAM,EACZ,YAAY,EAAE,QAAQ,GACvB,CAAC,GAAG,QAAQ,CAAC;AAChB;;GAEG;AACH,wBAAgB,IAAI,CAAC,QAAQ,EACzB,MAAM,EAAE,IAAI,GAAG,SAAS,EACxB,IAAI,EAAE,aAAa,EACnB,YAAY,EAAE,QAAQ,GACvB,QAAQ,CAAC;AACZ;;GAEG;AACH,wBAAgB,IAAI,CAAC,MAAM,EAAE,IAAI,GAAG,SAAS,EAAE,IAAI,EAAE,aAAa,GAAG,SAAS,CAAC;AAC/E;;GAEG;AAEH,wBAAgB,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,aAAa,EAAE,YAAY,CAAC,EAAE,GAAG,GAAG,GAAG,CAAC"}
package/esm/_/get.js ADDED
@@ -0,0 +1,36 @@
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 { _baseGet } from "./_baseGet.js";
33
+ export function _get(object, path, defaultValue) {
34
+ const result = object == null ? undefined : _baseGet(object, path);
35
+ return result === undefined ? defaultValue : result;
36
+ }
@@ -0,0 +1,19 @@
1
+ import type { _Dictionary, _List, _ValueIteratee } from "./types.js";
2
+ /**
3
+ * Creates an object composed of keys generated from the results of running each element of
4
+ * `collection` thru `iteratee`. The order of grouped values is determined by the order they occur in
5
+ * `collection`. The corresponding value of each key is an array of elements responsible for generating
6
+ * the key. The iteratee is invoked with one argument: (value).
7
+ *
8
+ * @param collection - The collection to iterate over.
9
+ * @param iteratee - The iteratee to transform keys.
10
+ * @returns Returns the composed aggregate object.
11
+ * @internal
12
+ */
13
+ export declare function _groupBy<T>(collection: _List<T> | null | undefined, iteratee?: _ValueIteratee<T>): _Dictionary<T[]>;
14
+ /**
15
+ * @see _groupBy
16
+ * @internal
17
+ */
18
+ export declare function _groupBy<T extends object>(collection: T | null | undefined, iteratee?: _ValueIteratee<T[keyof T]>): _Dictionary<Array<T[keyof T]>>;
19
+ //# sourceMappingURL=groupBy.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"groupBy.d.ts","sourceRoot":"","sources":["../../src/_/groupBy.ts"],"names":[],"mappings":"AAoCA,OAAO,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAErE;;;;;;;;;;GAUG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EACtB,UAAU,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,SAAS,EACvC,QAAQ,CAAC,EAAE,cAAc,CAAC,CAAC,CAAC,GAC7B,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC;AACpB;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,CAAC,SAAS,MAAM,EACrC,UAAU,EAAE,CAAC,GAAG,IAAI,GAAG,SAAS,EAChC,QAAQ,CAAC,EAAE,cAAc,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GACtC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC"}
@@ -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 { _assignValue } from "./_assignValue.js";
33
+ import { _baseEach } from "./_baseEach.js";
34
+ import { _baseIteratee } from "./_baseIteratee.js";
35
+ export function _groupBy(collection, iteratee) {
36
+ const result = {};
37
+ const toKey = _baseIteratee(iteratee);
38
+ _baseEach(collection, (value) => {
39
+ const key = toKey(value);
40
+ if (Object.hasOwn(result, key)) {
41
+ result[key].push(value);
42
+ }
43
+ else {
44
+ // defines a `__proto__` key as an own property instead of changing the prototype
45
+ _assignValue(result, key, [value]);
46
+ }
47
+ });
48
+ return result;
49
+ }
package/esm/_/has.d.ts ADDED
@@ -0,0 +1,23 @@
1
+ import type { _PropertyPath } from "./set.js";
2
+ import type { _PropertyName } from "./types.js";
3
+ declare const uniqueSymbol: unique symbol;
4
+ /**
5
+ * Checks if `path` is a direct property of `object`: every segment of the path must be an own property of
6
+ * the value before it, or a valid index of an array or arguments object.
7
+ *
8
+ * @param object - The object to query.
9
+ * @param path - The path to check.
10
+ * @returns Returns `true` if `path` exists, else `false`.
11
+ * @internal
12
+ */
13
+ export declare function _has<T, K extends _PropertyName>(object: T, path: K): object is T & {
14
+ [P in K]: P extends keyof T ? T[P] : Record<string, unknown> extends T ? T[keyof T] : unknown;
15
+ } & {
16
+ [uniqueSymbol]: unknown;
17
+ };
18
+ /**
19
+ * @internal
20
+ */
21
+ export declare function _has<T>(object: T, path: _PropertyPath): boolean;
22
+ export {};
23
+ //# sourceMappingURL=has.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"has.d.ts","sourceRoot":"","sources":["../../src/_/has.ts"],"names":[],"mappings":"AAkCA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AAC9C,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAEhD,OAAO,CAAC,MAAM,YAAY,EAAE,OAAO,MAAM,CAAC;AAE1C;;;;;;;;GAQG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,CAAC,SAAS,aAAa,EAC3C,MAAM,EAAE,CAAC,EACT,IAAI,EAAE,CAAC,GACR,MAAM,IAAI,CAAC,GAAG;KACZ,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,OAAO;CAChG,GAAG;IAAE,CAAC,YAAY,CAAC,EAAE,OAAO,CAAA;CAAE,CAAC;AAChC;;GAEG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,aAAa,GAAG,OAAO,CAAC"}
package/esm/_/has.js ADDED
@@ -0,0 +1,35 @@
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 { _hasPath } from "./_hasPath.js";
33
+ export function _has(object, path) {
34
+ return object != null && _hasPath(object, path, (target, key) => Object.hasOwn(target, key));
35
+ }
@@ -0,0 +1,14 @@
1
+ /**
2
+ * Checks if `number` is between `start` and up to, but not including, `end`. If `end` is not specified,
3
+ * it's set to `start` with `start` then set to `0`. If `start` is greater than `end` the params are swapped
4
+ * to support negative ranges. The bounds are coerced to finite numbers and `number` to a number the way
5
+ * lodash does it, so a `NaN` bound becomes `0` and a `NaN` number is never in range.
6
+ *
7
+ * @param number - The number to check.
8
+ * @param start - The start of the range.
9
+ * @param end - The end of the range.
10
+ * @returns Returns `true` if `number` is in the range, else `false`.
11
+ * @internal
12
+ */
13
+ export declare function _inRange(number: number, start: number, end?: number): boolean;
14
+ //# sourceMappingURL=inRange.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"inRange.d.ts","sourceRoot":"","sources":["../../src/_/inRange.ts"],"names":[],"mappings":"AAoCA;;;;;;;;;;;GAWG;AACH,wBAAgB,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,OAAO,CAM7E"}
@@ -0,0 +1,51 @@
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 { _toFinite } from "./toFinite.js";
33
+ import { _toNumber } from "./toNumber.js";
34
+ /**
35
+ * Checks if `number` is between `start` and up to, but not including, `end`. If `end` is not specified,
36
+ * it's set to `start` with `start` then set to `0`. If `start` is greater than `end` the params are swapped
37
+ * to support negative ranges. The bounds are coerced to finite numbers and `number` to a number the way
38
+ * lodash does it, so a `NaN` bound becomes `0` and a `NaN` number is never in range.
39
+ *
40
+ * @param number - The number to check.
41
+ * @param start - The start of the range.
42
+ * @param end - The end of the range.
43
+ * @returns Returns `true` if `number` is in the range, else `false`.
44
+ * @internal
45
+ */
46
+ export function _inRange(number, start, end) {
47
+ const first = _toFinite(start);
48
+ const [from, to] = end === undefined ? [0, first] : [first, _toFinite(end)];
49
+ const value = _toNumber(number);
50
+ return value >= Math.min(from, to) && value < Math.max(from, to);
51
+ }
@@ -0,0 +1,11 @@
1
+ import type { _List } from "./types.js";
2
+ /**
3
+ * Gets all but the last element of `array` as a new dense array. Nullish input and anything without a
4
+ * truthy `length` yield an empty array.
5
+ *
6
+ * @param array - The array to query.
7
+ * @returns Returns the slice of `array`.
8
+ * @internal
9
+ */
10
+ export declare function _initial<T>(array: _List<T> | null | undefined): T[];
11
+ //# sourceMappingURL=initial.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"initial.d.ts","sourceRoot":"","sources":["../../src/_/initial.ts"],"names":[],"mappings":"AAkCA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAExC;;;;;;;GAOG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,SAAS,GAAG,CAAC,EAAE,CAInE"}
@@ -0,0 +1,44 @@
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 { _baseSlice } from "./_baseSlice.js";
33
+ /**
34
+ * Gets all but the last element of `array` as a new dense array. Nullish input and anything without a
35
+ * truthy `length` yield an empty array.
36
+ *
37
+ * @param array - The array to query.
38
+ * @returns Returns the slice of `array`.
39
+ * @internal
40
+ */
41
+ export function _initial(array) {
42
+ const length = array == null ? 0 : array.length;
43
+ return length ? _baseSlice(array, 0, -1) : [];
44
+ }
@@ -0,0 +1,13 @@
1
+ import type { _List } from "./types.js";
2
+ /**
3
+ * Creates an array of unique values that are included in all given arrays using SameValueZero for equality
4
+ * comparisons. The order and references of result values are determined by the first array, with `-0`
5
+ * normalised to `0`. A first argument that is not an array-like object yields an empty array, and any other
6
+ * argument that is not one counts as an empty array.
7
+ *
8
+ * @param arrays - The arrays to inspect.
9
+ * @returns Returns the new array of intersecting values.
10
+ * @internal
11
+ */
12
+ export declare function _intersection<T>(...arrays: (_List<T> | null | undefined)[]): T[];
13
+ //# sourceMappingURL=intersection.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"intersection.d.ts","sourceRoot":"","sources":["../../src/_/intersection.ts"],"names":[],"mappings":"AAkCA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAExC;;;;;;;;;GASG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,GAAG,MAAM,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,SAAS,CAAC,EAAE,GAAG,CAAC,EAAE,CAEhF"}
@@ -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 { _baseIntersection } from "./_baseIntersection.js";
33
+ /**
34
+ * Creates an array of unique values that are included in all given arrays using SameValueZero for equality
35
+ * comparisons. The order and references of result values are determined by the first array, with `-0`
36
+ * normalised to `0`. A first argument that is not an array-like object yields an empty array, and any other
37
+ * argument that is not one counts as an empty array.
38
+ *
39
+ * @param arrays - The arrays to inspect.
40
+ * @returns Returns the new array of intersecting values.
41
+ * @internal
42
+ */
43
+ export function _intersection(...arrays) {
44
+ return _baseIntersection(arrays);
45
+ }
@@ -0,0 +1,32 @@
1
+ import type { _List, _ValueIteratee } from "./types.js";
2
+ /**
3
+ * This method is like `_intersection` except that it accepts `iteratee` which is invoked for each element
4
+ * of each array to generate the criterion by which they're compared. The order and references of result
5
+ * values are determined by the first array. The iteratee is invoked with one argument: (value). As in
6
+ * lodash, the last argument is taken as the iteratee unless it is an array-like object, so an array is
7
+ * always a list to intersect.
8
+ *
9
+ * @param array - The first array to inspect.
10
+ * @param values - The other arrays to inspect.
11
+ * @param iteratee - The iteratee invoked per element.
12
+ * @returns Returns the new array of intersecting values.
13
+ * @internal
14
+ */
15
+ export declare function _intersectionBy<T1, T2>(array: _List<T1> | null, values: _List<T2>, iteratee: _ValueIteratee<T1 | T2>): T1[];
16
+ /**
17
+ * @internal
18
+ */
19
+ export declare function _intersectionBy<T1, T2, T3>(array: _List<T1> | null, values1: _List<T2>, values2: _List<T3>, iteratee: _ValueIteratee<T1 | T2 | T3>): T1[];
20
+ /**
21
+ * @internal
22
+ */
23
+ export declare function _intersectionBy<T1, T2, T3, T4>(array: _List<T1> | null | undefined, values1: _List<T2>, values2: _List<T3>, ...values: (_List<T4> | _ValueIteratee<T1 | T2 | T3 | T4>)[]): T1[];
24
+ /**
25
+ * @internal
26
+ */
27
+ export declare function _intersectionBy<T>(array?: _List<T> | null, ...values: _List<T>[]): T[];
28
+ /**
29
+ * @internal
30
+ */
31
+ export declare function _intersectionBy<T>(...values: (_List<T> | _ValueIteratee<T>)[]): T[];
32
+ //# sourceMappingURL=intersectionBy.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"intersectionBy.d.ts","sourceRoot":"","sources":["../../src/_/intersectionBy.ts"],"names":[],"mappings":"AAqCA,OAAO,KAAK,EAAE,KAAK,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAExD;;;;;;;;;;;;GAYG;AACH,wBAAgB,eAAe,CAAC,EAAE,EAAE,EAAE,EAClC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC,GAAG,IAAI,EACvB,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,EACjB,QAAQ,EAAE,cAAc,CAAC,EAAE,GAAG,EAAE,CAAC,GAClC,EAAE,EAAE,CAAC;AACR;;GAEG;AACH,wBAAgB,eAAe,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EACtC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC,GAAG,IAAI,EACvB,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC,EAClB,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC,EAClB,QAAQ,EAAE,cAAc,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,GACvC,EAAE,EAAE,CAAC;AACR;;GAEG;AACH,wBAAgB,eAAe,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAC1C,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC,GAAG,IAAI,GAAG,SAAS,EACnC,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC,EAClB,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC,EAClB,GAAG,MAAM,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,GAC7D,EAAE,EAAE,CAAC;AACR;;GAEG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,GAAG,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;AACxF;;GAEG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,GAAG,MAAM,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC"}
@@ -0,0 +1,41 @@
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 { _baseIntersection } from "./_baseIntersection.js";
33
+ import { _baseIteratee } from "./_baseIteratee.js";
34
+ import { _isArrayLike } from "./isArrayLike.js";
35
+ import { _isObjectLike } from "./isObjectLike.js";
36
+ export function _intersectionBy(...values) {
37
+ const last = values[values.length - 1];
38
+ const lastIsList = _isObjectLike(last) && _isArrayLike(last);
39
+ const arrays = lastIsList || values.length === 0 ? values : values.slice(0, -1);
40
+ return _baseIntersection(arrays, _baseIteratee(lastIsList ? undefined : last));
41
+ }
@@ -0,0 +1,28 @@
1
+ import type { _Comparator, _Comparator2, _List } from "./types.js";
2
+ /**
3
+ * This method is like `_intersection` except that it accepts `comparator` which is invoked to compare
4
+ * elements of the arrays. The order and references of result values are determined by the first array. The
5
+ * comparator is invoked with two arguments: (arrVal, othVal). As in lodash, only a function in the last
6
+ * position is taken as the comparator, arguments that are not array-like objects count as empty, the result
7
+ * is deduplicated through the comparator too, and `-0` is kept as it is when a comparator is used.
8
+ *
9
+ * @param array - The first array to inspect.
10
+ * @param values - The other arrays to inspect.
11
+ * @param comparator - The comparator invoked per element.
12
+ * @returns Returns the new array of intersecting values.
13
+ * @internal
14
+ */
15
+ export declare function _intersectionWith<T1, T2>(array: _List<T1> | null | undefined, values: _List<T2>, comparator: _Comparator2<T1, T1 | T2>): T1[];
16
+ /**
17
+ * @internal
18
+ */
19
+ export declare function _intersectionWith<T1, T2, T3>(array: _List<T1> | null | undefined, values1: _List<T2>, values2: _List<T3>, comparator: _Comparator2<T1, T1 | T2 | T3>): T1[];
20
+ /**
21
+ * @internal
22
+ */
23
+ export declare function _intersectionWith<T1, T2, T3, T4>(array: _List<T1> | null | undefined, values1: _List<T2>, values2: _List<T3>, ...values: (_List<T4> | _Comparator2<T1, T1 | T2 | T3 | T4>)[]): T1[];
24
+ /**
25
+ * @internal
26
+ */
27
+ export declare function _intersectionWith<T>(array?: _List<T> | null, ...values: (_List<T> | _Comparator<T>)[]): T[];
28
+ //# sourceMappingURL=intersectionWith.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"intersectionWith.d.ts","sourceRoot":"","sources":["../../src/_/intersectionWith.ts"],"names":[],"mappings":"AAkCA,OAAO,KAAK,EAAE,WAAW,EAAE,YAAY,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAEnE;;;;;;;;;;;;GAYG;AACH,wBAAgB,iBAAiB,CAAC,EAAE,EAAE,EAAE,EACpC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC,GAAG,IAAI,GAAG,SAAS,EACnC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,EACjB,UAAU,EAAE,YAAY,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,GACtC,EAAE,EAAE,CAAC;AACR;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EACxC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC,GAAG,IAAI,GAAG,SAAS,EACnC,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC,EAClB,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC,EAClB,UAAU,EAAE,YAAY,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,GAC3C,EAAE,EAAE,CAAC;AACR;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAC5C,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC,GAAG,IAAI,GAAG,SAAS,EACnC,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC,EAClB,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC,EAClB,GAAG,MAAM,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,GAC/D,EAAE,EAAE,CAAC;AACR;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,GAAG,MAAM,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC"}