rubico 2.3.0 → 2.3.2

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 (423) hide show
  1. package/AggregateReducer.d.ts +10 -0
  2. package/README.md +9 -0
  3. package/Transducer.d.ts +231 -0
  4. package/__.d.ts +2 -0
  5. package/_internal/EmptyMap.d.ts +2 -0
  6. package/_internal/arrayFind.d.ts +15 -0
  7. package/_internal/arrayMapSeries.js +4 -4
  8. package/_internal/asyncIteratorFind.d.ts +12 -0
  9. package/_internal/findAllFilePaths.js +2 -4
  10. package/_internal/iteratorFind.d.ts +12 -0
  11. package/_internal/thunkify5.d.ts +20 -0
  12. package/_internal/timeInLoop.d.ts +25 -0
  13. package/_internal/timeInLoopAsync.d.ts +23 -0
  14. package/all.d.ts +100 -0
  15. package/always.d.ts +2 -0
  16. package/and.d.ts +45 -0
  17. package/assign.d.ts +46 -0
  18. package/compose.d.ts +25 -0
  19. package/curry.d.ts +70 -0
  20. package/dist/Transducer.es.js +2 -2
  21. package/dist/Transducer.es.min.js +2 -2
  22. package/dist/Transducer.js +2 -2
  23. package/dist/Transducer.min.js +2 -2
  24. package/dist/Transducer.mjs +2 -2
  25. package/dist/__.es.js +2 -2
  26. package/dist/__.es.min.js +2 -2
  27. package/dist/__.js +2 -2
  28. package/dist/__.min.js +2 -2
  29. package/dist/__.mjs +2 -2
  30. package/dist/all.es.js +2 -2
  31. package/dist/all.es.min.js +2 -2
  32. package/dist/all.js +2 -2
  33. package/dist/all.min.js +2 -2
  34. package/dist/all.mjs +2 -2
  35. package/dist/always.es.js +2 -2
  36. package/dist/always.es.min.js +2 -2
  37. package/dist/always.js +2 -2
  38. package/dist/always.min.js +2 -2
  39. package/dist/always.mjs +2 -2
  40. package/dist/and.es.js +2 -2
  41. package/dist/and.es.min.js +2 -2
  42. package/dist/and.js +2 -2
  43. package/dist/and.min.js +2 -2
  44. package/dist/and.mjs +2 -2
  45. package/dist/assign.es.js +2 -2
  46. package/dist/assign.es.min.js +2 -2
  47. package/dist/assign.js +2 -2
  48. package/dist/assign.min.js +2 -2
  49. package/dist/assign.mjs +2 -2
  50. package/dist/compose.es.js +2 -2
  51. package/dist/compose.es.min.js +2 -2
  52. package/dist/compose.js +2 -2
  53. package/dist/compose.min.js +2 -2
  54. package/dist/compose.mjs +2 -2
  55. package/dist/curry.es.js +2 -2
  56. package/dist/curry.es.min.js +2 -2
  57. package/dist/curry.js +2 -2
  58. package/dist/curry.min.js +2 -2
  59. package/dist/curry.mjs +2 -2
  60. package/dist/eq.es.js +2 -2
  61. package/dist/eq.es.min.js +2 -2
  62. package/dist/eq.js +2 -2
  63. package/dist/eq.min.js +2 -2
  64. package/dist/eq.mjs +2 -2
  65. package/dist/every.es.js +2 -2
  66. package/dist/every.es.min.js +2 -2
  67. package/dist/every.js +2 -2
  68. package/dist/every.min.js +2 -2
  69. package/dist/every.mjs +2 -2
  70. package/dist/filter.es.js +2 -2
  71. package/dist/filter.es.min.js +2 -2
  72. package/dist/filter.js +2 -2
  73. package/dist/filter.min.js +2 -2
  74. package/dist/filter.mjs +2 -2
  75. package/dist/flatMap.es.js +2 -2
  76. package/dist/flatMap.es.min.js +2 -2
  77. package/dist/flatMap.js +2 -2
  78. package/dist/flatMap.min.js +2 -2
  79. package/dist/flatMap.mjs +2 -2
  80. package/dist/forEach.es.js +2 -2
  81. package/dist/forEach.es.min.js +2 -2
  82. package/dist/forEach.js +2 -2
  83. package/dist/forEach.min.js +2 -2
  84. package/dist/forEach.mjs +2 -2
  85. package/dist/get.es.js +6 -6
  86. package/dist/get.es.min.js +3 -3
  87. package/dist/get.js +6 -6
  88. package/dist/get.min.js +3 -3
  89. package/dist/get.mjs +6 -6
  90. package/dist/gt.es.js +2 -2
  91. package/dist/gt.es.min.js +2 -2
  92. package/dist/gt.js +2 -2
  93. package/dist/gt.min.js +2 -2
  94. package/dist/gt.mjs +2 -2
  95. package/dist/gte.es.js +2 -2
  96. package/dist/gte.es.min.js +2 -2
  97. package/dist/gte.js +2 -2
  98. package/dist/gte.min.js +2 -2
  99. package/dist/gte.mjs +2 -2
  100. package/dist/lt.es.js +2 -2
  101. package/dist/lt.es.min.js +2 -2
  102. package/dist/lt.js +2 -2
  103. package/dist/lt.min.js +2 -2
  104. package/dist/lt.mjs +2 -2
  105. package/dist/lte.es.js +2 -2
  106. package/dist/lte.es.min.js +2 -2
  107. package/dist/lte.js +2 -2
  108. package/dist/lte.min.js +2 -2
  109. package/dist/lte.mjs +2 -2
  110. package/dist/map.es.js +4 -4
  111. package/dist/map.es.min.js +3 -3
  112. package/dist/map.js +4 -4
  113. package/dist/map.min.js +3 -3
  114. package/dist/map.mjs +4 -4
  115. package/dist/not.es.js +2 -2
  116. package/dist/not.es.min.js +2 -2
  117. package/dist/not.js +2 -2
  118. package/dist/not.min.js +2 -2
  119. package/dist/not.mjs +2 -2
  120. package/dist/omit.es.js +2 -2
  121. package/dist/omit.es.min.js +2 -2
  122. package/dist/omit.js +2 -2
  123. package/dist/omit.min.js +2 -2
  124. package/dist/omit.mjs +2 -2
  125. package/dist/or.es.js +2 -2
  126. package/dist/or.es.min.js +2 -2
  127. package/dist/or.js +2 -2
  128. package/dist/or.min.js +2 -2
  129. package/dist/or.mjs +2 -2
  130. package/dist/pick.es.js +2 -2
  131. package/dist/pick.es.min.js +2 -2
  132. package/dist/pick.js +2 -2
  133. package/dist/pick.min.js +2 -2
  134. package/dist/pick.mjs +2 -2
  135. package/dist/pipe.es.js +2 -2
  136. package/dist/pipe.es.min.js +2 -2
  137. package/dist/pipe.js +2 -2
  138. package/dist/pipe.min.js +2 -2
  139. package/dist/pipe.mjs +2 -2
  140. package/dist/reduce.es.js +2 -2
  141. package/dist/reduce.es.min.js +2 -2
  142. package/dist/reduce.js +2 -2
  143. package/dist/reduce.min.js +2 -2
  144. package/dist/reduce.mjs +2 -2
  145. package/dist/rubico.es.js +8 -8
  146. package/dist/rubico.es.min.js +3 -3
  147. package/dist/rubico.global.js +8 -8
  148. package/dist/rubico.global.min.js +3 -3
  149. package/dist/rubico.js +8 -8
  150. package/dist/rubico.min.js +3 -3
  151. package/dist/rubico.mjs +8 -8
  152. package/dist/set.es.js +2 -2
  153. package/dist/set.es.min.js +2 -2
  154. package/dist/set.js +2 -2
  155. package/dist/set.min.js +2 -2
  156. package/dist/set.mjs +2 -2
  157. package/dist/some.es.js +2 -2
  158. package/dist/some.es.min.js +2 -2
  159. package/dist/some.js +2 -2
  160. package/dist/some.min.js +2 -2
  161. package/dist/some.mjs +2 -2
  162. package/dist/switchCase.es.js +2 -2
  163. package/dist/switchCase.es.min.js +2 -2
  164. package/dist/switchCase.js +2 -2
  165. package/dist/switchCase.min.js +2 -2
  166. package/dist/switchCase.mjs +2 -2
  167. package/dist/tap.es.js +2 -2
  168. package/dist/tap.es.min.js +2 -2
  169. package/dist/tap.js +2 -2
  170. package/dist/tap.min.js +2 -2
  171. package/dist/tap.mjs +2 -2
  172. package/dist/thunkify.es.js +2 -2
  173. package/dist/thunkify.es.min.js +2 -2
  174. package/dist/thunkify.js +2 -2
  175. package/dist/thunkify.min.js +2 -2
  176. package/dist/thunkify.mjs +2 -2
  177. package/dist/transform.es.js +2 -2
  178. package/dist/transform.es.min.js +2 -2
  179. package/dist/transform.js +2 -2
  180. package/dist/transform.min.js +2 -2
  181. package/dist/transform.mjs +2 -2
  182. package/dist/tryCatch.es.js +2 -2
  183. package/dist/tryCatch.es.min.js +2 -2
  184. package/dist/tryCatch.js +2 -2
  185. package/dist/tryCatch.min.js +2 -2
  186. package/dist/tryCatch.mjs +2 -2
  187. package/dist/x/append.es.js +2 -2
  188. package/dist/x/append.es.min.js +2 -2
  189. package/dist/x/append.js +2 -2
  190. package/dist/x/append.min.js +2 -2
  191. package/dist/x/append.mjs +2 -2
  192. package/dist/x/callProp.es.js +2 -2
  193. package/dist/x/callProp.es.min.js +2 -2
  194. package/dist/x/callProp.js +2 -2
  195. package/dist/x/callProp.min.js +2 -2
  196. package/dist/x/callProp.mjs +2 -2
  197. package/dist/x/defaultsDeep.es.js +2 -2
  198. package/dist/x/defaultsDeep.es.min.js +2 -2
  199. package/dist/x/defaultsDeep.js +2 -2
  200. package/dist/x/defaultsDeep.min.js +2 -2
  201. package/dist/x/defaultsDeep.mjs +2 -2
  202. package/dist/x/differenceWith.es.js +2 -2
  203. package/dist/x/differenceWith.es.min.js +2 -2
  204. package/dist/x/differenceWith.js +2 -2
  205. package/dist/x/differenceWith.min.js +2 -2
  206. package/dist/x/differenceWith.mjs +2 -2
  207. package/dist/x/filterOut.es.js +2 -2
  208. package/dist/x/filterOut.es.min.js +2 -2
  209. package/dist/x/filterOut.js +2 -2
  210. package/dist/x/filterOut.min.js +2 -2
  211. package/dist/x/filterOut.mjs +2 -2
  212. package/dist/x/find.es.js +2 -2
  213. package/dist/x/find.es.min.js +2 -2
  214. package/dist/x/find.js +2 -2
  215. package/dist/x/find.min.js +2 -2
  216. package/dist/x/find.mjs +2 -2
  217. package/dist/x/findIndex.es.js +2 -2
  218. package/dist/x/findIndex.es.min.js +2 -2
  219. package/dist/x/findIndex.js +2 -2
  220. package/dist/x/findIndex.min.js +2 -2
  221. package/dist/x/findIndex.mjs +2 -2
  222. package/dist/x/first.es.js +2 -2
  223. package/dist/x/first.es.min.js +2 -2
  224. package/dist/x/first.js +2 -2
  225. package/dist/x/first.min.js +2 -2
  226. package/dist/x/first.mjs +2 -2
  227. package/dist/x/flatten.es.js +2 -2
  228. package/dist/x/flatten.es.min.js +2 -2
  229. package/dist/x/flatten.js +2 -2
  230. package/dist/x/flatten.min.js +2 -2
  231. package/dist/x/flatten.mjs +2 -2
  232. package/dist/x/groupBy.es.js +2 -2
  233. package/dist/x/groupBy.es.min.js +2 -2
  234. package/dist/x/groupBy.js +2 -2
  235. package/dist/x/groupBy.min.js +2 -2
  236. package/dist/x/groupBy.mjs +2 -2
  237. package/dist/x/has.es.js +2 -2
  238. package/dist/x/has.es.min.js +2 -2
  239. package/dist/x/has.js +2 -2
  240. package/dist/x/has.min.js +2 -2
  241. package/dist/x/has.mjs +2 -2
  242. package/dist/x/identity.es.js +2 -2
  243. package/dist/x/identity.es.min.js +2 -2
  244. package/dist/x/identity.js +2 -2
  245. package/dist/x/identity.min.js +2 -2
  246. package/dist/x/identity.mjs +2 -2
  247. package/dist/x/includes.es.js +2 -2
  248. package/dist/x/includes.es.min.js +2 -2
  249. package/dist/x/includes.js +2 -2
  250. package/dist/x/includes.min.js +2 -2
  251. package/dist/x/includes.mjs +2 -2
  252. package/dist/x/isDeepEqual.es.js +2 -2
  253. package/dist/x/isDeepEqual.es.min.js +2 -2
  254. package/dist/x/isDeepEqual.js +2 -2
  255. package/dist/x/isDeepEqual.min.js +2 -2
  256. package/dist/x/isDeepEqual.mjs +2 -2
  257. package/dist/x/isEmpty.es.js +2 -2
  258. package/dist/x/isEmpty.es.min.js +2 -2
  259. package/dist/x/isEmpty.js +2 -2
  260. package/dist/x/isEmpty.min.js +2 -2
  261. package/dist/x/isEmpty.mjs +2 -2
  262. package/dist/x/isEqual.es.js +2 -2
  263. package/dist/x/isEqual.es.min.js +2 -2
  264. package/dist/x/isEqual.js +2 -2
  265. package/dist/x/isEqual.min.js +2 -2
  266. package/dist/x/isEqual.mjs +2 -2
  267. package/dist/x/isFunction.es.js +2 -2
  268. package/dist/x/isFunction.es.min.js +2 -2
  269. package/dist/x/isFunction.js +2 -2
  270. package/dist/x/isFunction.min.js +2 -2
  271. package/dist/x/isFunction.mjs +2 -2
  272. package/dist/x/isIn.es.js +2 -2
  273. package/dist/x/isIn.es.min.js +2 -2
  274. package/dist/x/isIn.js +2 -2
  275. package/dist/x/isIn.min.js +2 -2
  276. package/dist/x/isIn.mjs +2 -2
  277. package/dist/x/isObject.es.js +2 -2
  278. package/dist/x/isObject.es.min.js +2 -2
  279. package/dist/x/isObject.js +2 -2
  280. package/dist/x/isObject.min.js +2 -2
  281. package/dist/x/isObject.mjs +2 -2
  282. package/dist/x/isString.es.js +2 -2
  283. package/dist/x/isString.es.min.js +2 -2
  284. package/dist/x/isString.js +2 -2
  285. package/dist/x/isString.min.js +2 -2
  286. package/dist/x/isString.mjs +2 -2
  287. package/dist/x/keys.es.js +2 -2
  288. package/dist/x/keys.es.min.js +2 -2
  289. package/dist/x/keys.js +2 -2
  290. package/dist/x/keys.min.js +2 -2
  291. package/dist/x/keys.mjs +2 -2
  292. package/dist/x/last.es.js +2 -2
  293. package/dist/x/last.es.min.js +2 -2
  294. package/dist/x/last.js +2 -2
  295. package/dist/x/last.min.js +2 -2
  296. package/dist/x/last.mjs +2 -2
  297. package/dist/x/maxBy.es.js +6 -6
  298. package/dist/x/maxBy.es.min.js +3 -3
  299. package/dist/x/maxBy.js +6 -6
  300. package/dist/x/maxBy.min.js +3 -3
  301. package/dist/x/maxBy.mjs +6 -6
  302. package/dist/x/noop.es.js +2 -2
  303. package/dist/x/noop.es.min.js +2 -2
  304. package/dist/x/noop.js +2 -2
  305. package/dist/x/noop.min.js +2 -2
  306. package/dist/x/noop.mjs +2 -2
  307. package/dist/x/pluck.es.js +8 -8
  308. package/dist/x/pluck.es.min.js +3 -3
  309. package/dist/x/pluck.js +8 -8
  310. package/dist/x/pluck.min.js +3 -3
  311. package/dist/x/pluck.mjs +8 -8
  312. package/dist/x/prepend.es.js +2 -2
  313. package/dist/x/prepend.es.min.js +2 -2
  314. package/dist/x/prepend.js +2 -2
  315. package/dist/x/prepend.min.js +2 -2
  316. package/dist/x/prepend.mjs +2 -2
  317. package/dist/x/size.es.js +2 -2
  318. package/dist/x/size.es.min.js +2 -2
  319. package/dist/x/size.js +2 -2
  320. package/dist/x/size.min.js +2 -2
  321. package/dist/x/size.mjs +2 -2
  322. package/dist/x/trace.es.js +2 -2
  323. package/dist/x/trace.es.min.js +2 -2
  324. package/dist/x/trace.js +2 -2
  325. package/dist/x/trace.min.js +2 -2
  326. package/dist/x/trace.mjs +2 -2
  327. package/dist/x/unionWith.es.js +2 -2
  328. package/dist/x/unionWith.es.min.js +2 -2
  329. package/dist/x/unionWith.js +2 -2
  330. package/dist/x/unionWith.min.js +2 -2
  331. package/dist/x/unionWith.mjs +2 -2
  332. package/dist/x/uniq.es.js +2 -2
  333. package/dist/x/uniq.es.min.js +2 -2
  334. package/dist/x/uniq.js +2 -2
  335. package/dist/x/uniq.min.js +2 -2
  336. package/dist/x/uniq.mjs +2 -2
  337. package/dist/x/unless.es.js +2 -2
  338. package/dist/x/unless.es.min.js +2 -2
  339. package/dist/x/unless.js +2 -2
  340. package/dist/x/unless.min.js +2 -2
  341. package/dist/x/unless.mjs +2 -2
  342. package/dist/x/values.es.js +2 -2
  343. package/dist/x/values.es.min.js +2 -2
  344. package/dist/x/values.js +2 -2
  345. package/dist/x/values.min.js +2 -2
  346. package/dist/x/values.mjs +2 -2
  347. package/dist/x/when.es.js +2 -2
  348. package/dist/x/when.es.min.js +2 -2
  349. package/dist/x/when.js +2 -2
  350. package/dist/x/when.min.js +2 -2
  351. package/dist/x/when.mjs +2 -2
  352. package/eq.d.ts +51 -0
  353. package/es.d.ts +80 -0
  354. package/es.js +8 -8
  355. package/every.d.ts +52 -0
  356. package/filter.d.ts +148 -0
  357. package/flatMap.d.ts +109 -0
  358. package/forEach.d.ts +35 -0
  359. package/get.d.ts +70 -0
  360. package/get.js +4 -4
  361. package/global.d.ts +1 -0
  362. package/gt.d.ts +49 -0
  363. package/gte.d.ts +51 -0
  364. package/index.d.ts +1 -0
  365. package/index.js +8 -8
  366. package/lt.d.ts +49 -0
  367. package/lte.d.ts +49 -0
  368. package/map.d.ts +246 -0
  369. package/monad/Instance.d.ts +246 -0
  370. package/monad/Instance.js +188 -206
  371. package/not.d.ts +34 -0
  372. package/omit.d.ts +50 -0
  373. package/or.d.ts +43 -0
  374. package/package.json +41 -4
  375. package/pick.d.ts +43 -0
  376. package/pipe.d.ts +49 -0
  377. package/reduce.d.ts +166 -0
  378. package/set.d.ts +61 -0
  379. package/some.d.ts +65 -0
  380. package/switchCase.d.ts +76 -0
  381. package/tap.d.ts +53 -0
  382. package/thunkify.d.ts +21 -0
  383. package/transform.d.ts +131 -0
  384. package/tryCatch.d.ts +47 -0
  385. package/x/append.d.ts +38 -0
  386. package/x/callProp.d.ts +20 -0
  387. package/x/defaultsDeep.d.ts +42 -0
  388. package/x/differenceWith.d.ts +25 -0
  389. package/x/filterOut.d.ts +39 -0
  390. package/x/find.d.ts +34 -0
  391. package/x/findIndex.d.ts +25 -0
  392. package/x/first.d.ts +23 -0
  393. package/x/flatten.d.ts +57 -0
  394. package/x/groupBy.d.ts +50 -0
  395. package/x/has.d.ts +25 -0
  396. package/x/heapUsedInLoop.d.ts +53 -0
  397. package/x/identity.d.ts +21 -0
  398. package/x/includes.d.ts +25 -0
  399. package/x/index.d.ts +34 -0
  400. package/x/is.d.ts +2 -0
  401. package/x/isEmpty.d.ts +24 -0
  402. package/x/isEqual.d.ts +2 -0
  403. package/x/isFunction.d.ts +23 -0
  404. package/x/isIn.d.ts +61 -0
  405. package/x/isObject.d.ts +2 -0
  406. package/x/isString.benchmarks.d.ts +1 -0
  407. package/x/isString.d.ts +21 -0
  408. package/x/keys.d.ts +23 -0
  409. package/x/last.d.ts +22 -0
  410. package/x/maxBy.d.ts +41 -0
  411. package/x/noop.d.ts +21 -0
  412. package/x/pluck.d.ts +35 -0
  413. package/x/prepend.d.ts +38 -0
  414. package/x/size.d.ts +21 -0
  415. package/x/test.d.ts +1 -0
  416. package/x/timeInLoop.d.ts +21 -0
  417. package/x/trace.d.ts +30 -0
  418. package/x/tracef.d.ts +7 -0
  419. package/x/unionWith.d.ts +31 -0
  420. package/x/uniq.d.ts +24 -0
  421. package/x/unless.d.ts +28 -0
  422. package/x/values.d.ts +23 -0
  423. package/x/when.d.ts +28 -0
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
- const isPromise=r=>null!=r&&"function"==typeof r.then,funcConcat=(r,t)=>function(...e){const n=r(...e);return isPromise(n)?n.then(t):t(n)},symbolIterator=Symbol.iterator,MappingIterator=(r,t)=>({toString:()=>"[object MappingIterator]",[symbolIterator](){return this},next(){const e=r.next();return e.done?e:{value:t(e.value),done:!1}}}),NextIteration=r=>({value:r,done:!1}),symbolAsyncIterator=Symbol.asyncIterator,MappingAsyncIterator=(r,t)=>({[symbolAsyncIterator](){return this},async next(){const e=await r.next();if(e.done)return e;const n=t(e.value);return isPromise(n)?n.then(NextIteration):{value:n,done:!1}}}),__=Symbol.for("placeholder"),curry2ResolveArg0=(r,t)=>function(e){return r(e,t)},curry2ResolveArg1=(r,t)=>function(e){return r(t,e)},curry2=function(r,t,e){return t==__?curry2ResolveArg0(r,e):curry2ResolveArg1(r,t)},isArray=Array.isArray,isObject=r=>{if(null==r)return!1;const t=typeof r;return"object"==t||"function"==t},promiseAll=Promise.all.bind(Promise),arrayMap=function(r,t){const e=r.length,n=Array(e);let o=-1,s=!1;for(;++o<e;){const e=t(r[o],o,r);isPromise(e)&&(s=!0),n[o]=e}return s?promiseAll(n):n},curry3ResolveArg0=(r,t,e)=>function(n){return r(n,t,e)},curry3ResolveArg1=(r,t,e)=>function(n){return r(t,n,e)},curry3ResolveArg2=(r,t,e)=>function(n){return r(t,e,n)},curry3=function(r,t,e,n){return t==__?curry3ResolveArg0(r,e,n):e==__?curry3ResolveArg1(r,t,n):curry3ResolveArg2(r,t,e)},callPropUnary=(r,t,e)=>r[t](e),stringMap=function(r,t){const e=arrayMap(r,t);return isPromise(e)?e.then(curry3(callPropUnary,__,"join","")):e.join("")},always=r=>function(){return r},setMap=function(r,t){const e=new Set,n=[];for(const o of r){const s=t(o,o,r);isPromise(s)?n.push(s.then(curry3(callPropUnary,e,"add",__))):e.add(s)}return 0==n.length?e:promiseAll(n).then(always(e))},curry4ResolveArg0=(r,t,e,n)=>function(o){return r(o,t,e,n)},curry4ResolveArg1=(r,t,e,n)=>function(o){return r(t,o,e,n)},curry4ResolveArg2=(r,t,e,n)=>function(o){return r(t,e,o,n)},curry4ResolveArg3=(r,t,e,n)=>function(o){return r(t,e,n,o)},curry4=function(r,t,e,n,o){return t==__?curry4ResolveArg0(r,e,n,o):e==__?curry4ResolveArg1(r,t,n,o):n==__?curry4ResolveArg2(r,t,e,o):curry4ResolveArg3(r,t,e,n)},callPropBinary=(r,t,e,n)=>r[t](e,n),mapMap=function(r,t){const e=new Map,n=[];for(const[o,s]of r){const c=t(s,o,r);isPromise(c)?n.push(c.then(curry4(callPropBinary,e,"set",o,__))):e.set(o,c)}return 0==n.length?e:promiseAll(n).then(always(e))},promiseObjectAllExecutor=r=>function(t){const e={};let n=0;for(const o in r){const s=r[o];isPromise(s)?(n+=1,s.then((r=>function(o){e[r]=o,n-=1,0==n&&t(e)})(o))):e[o]=s}0==n&&t(e)},promiseObjectAll=r=>new Promise(promiseObjectAllExecutor(r)),objectMap=function(r,t){const e={};let n=!1;for(const o in r){const s=t(r[o],o,r);isPromise(s)&&(n=!0),e[o]=s}return n?promiseObjectAll(e):e},objectSet=function(r,t,e){return r[t]=e,r},arrayMapSeriesAsync=async function(r,t,e,n){const o=r.length;for(;++n<o;){const o=t(r[n]);e[n]=isPromise(o)?await o:o}return e},arrayMapSeries=function(r,t){const e=r.length,n=Array(e);let o=-1;for(;++o<e;){const e=t(r[o]);if(isPromise(e))return e.then(funcConcat(curry3(objectSet,n,o,__),curry4(arrayMapSeriesAsync,r,t,__,o)));n[o]=e}return n},tapSync=r=>function(...t){return r(...t),t[0]},promiseRace=Promise.race.bind(Promise),arrayMapPoolAsync=async function(r,t,e,n,o,s){const c=r.length;for(;++o<c;){s.size>=e&&await promiseRace(s);const c=t(r[o]);if(isPromise(c)){const r=c.then(tapSync((()=>s.delete(r))));s.add(r),n[o]=r}else n[o]=c}return promiseAll(n)},arrayMapPool=function(r,t,e){const n=r.length,o=Array(n);let s=-1;for(;++s<n;){const n=t(r[s]);if(isPromise(n)){const c=new Set,i=n.then(tapSync((()=>c.delete(i))));return c.add(i),o[s]=i,arrayMapPoolAsync(r,t,e,o,s,c)}o[s]=n}return o},_curryArity=(r,t,e)=>function(...n){const o=e.length,s=n.length,c=[];let i=-1,a=-1,u=0;for(;++i<o;){const o=e[i];if(o==__&&(a+=1)<s){const r=n[a];r==__&&(u+=1),c.push(r)}else c.push(o);if(c.length==r)return 0==u?t(...c):curryArity(r,t,c)}for(;++a<s;){const e=n[a];if(e==__&&(u+=1),c.push(e),c.length==r)return 0==u?t(...c):curryArity(r,t,c)}return curryArity(r,t,c)},curryArity=function(r,t,e){const n=e.length;if(n<r)return _curryArity(r,t,e);let o=-1;for(;++o<n;){if(e[o]==__)return _curryArity(r,t,e)}return t(...e)},spread2=r=>function([t,e]){return r(t,e)},objectMapEntries=function(r,t){const e={},n=[];for(const o in r){const s=t([o,r[o]]);isPromise(s)?n.push(s.then(spread2(curryArity(3,objectSet,[e])))):e[s[0]]=s[1]}return 0==n.length?e:promiseAll(n).then(always(e))},mapSet=function(r,t,e){return r.set(t,e)},mapMapEntriesForEachCallback=(r,t,e)=>function(n,o){const s=r([o,n]);isPromise(s)?e.push(s.then(spread2(curryArity(3,mapSet,[t])))):t.set(s[0],s[1])},mapMapEntries=function(r,t){const e=new Map,n=[];return r.forEach(mapMapEntriesForEachCallback(t,e,n)),0==n.length?e:promiseAll(n).then(always(e))},_map=function(r,t){return isArray(r)?arrayMap(r,t):null==r?r:"function"==typeof r.then?r.then(t):"function"==typeof r.map?r.map(t):"string"==typeof r||r.constructor==String?stringMap(r,t):r.constructor==Set?setMap(r,t):r.constructor==Map?mapMap(r,t):"function"==typeof r[symbolIterator]?MappingIterator(r[symbolIterator](),t):"function"==typeof r[symbolAsyncIterator]?MappingAsyncIterator(r[symbolAsyncIterator](),t):r.constructor==Object?objectMap(r,t):t(r)},map=(...r)=>{const t=r.pop();if(0==r.length)return curry2(_map,__,t);const e=r[0];return isPromise(e)?e.then(curry2(_map,__,t)):_map(e,t)};map.entries=function(r){return function(t){if(null==t)throw new TypeError("value is not an Object or Map");if(t.constructor==Object)return objectMapEntries(t,r);if(t.constructor==Map)return mapMapEntries(t,r);throw new TypeError("value is not an Object or Map")}},map.series=r=>function(t){if(isArray(t))return arrayMapSeries(t,r);throw new TypeError(`${t} is not an Array`)},map.pool=(r,t)=>function(e){if(isArray(e))return arrayMapPool(e,t,r);throw new TypeError(`${e} is not an Array`)};const memoizeCappedUnary=function(r,t){const e=new Map,n=function(n){if(e.has(n))return e.get(n);const o=r(n);return e.set(n,o),e.size>t&&e.clear(),o};return n.cache=e,n},pathDelimiters=/[.|[|\]]+/,parsePropertyPath=function(r){const t=r.length-1,e="["==r[0],n="]"==r[t];return e&&n?r.slice(1,t).split(pathDelimiters):e?r.slice(1).split(pathDelimiters):n?r.slice(0,t).split(pathDelimiters):r.split(pathDelimiters)},memoizedCappedParsePropertyPath=memoizeCappedUnary(parsePropertyPath,500),propertyPathToArray=r=>isArray(r)?r:"string"==typeof r?memoizedCappedParsePropertyPath(r):[r],getByPath=function(r,t){const e=propertyPathToArray(t),n=e.length;let o=-1,s=r;for(;++o<n;)if(s=s[e[o]],null==s)return;return s},_get=function(r,t,e){const n=null==r?void 0:getByPath(r,t);return void 0===n?"function"==typeof e?e(r):e:n},get=function(r,t,e){return isPromise(r)?r.then(curry3(_get,__,t,e)):isObject(r)&&!isArray(r)?_get(r,t,e):curry3(_get,__,r,t)},pluck=function(...r){const t=r.pop(),e=isPromise(n=t)?n.then(curry3(_get,__,o,s)):isObject(n)&&!isArray(n)?_get(n,o,s):curry3(_get,__,n,o);var n,o,s;return 0==r.length?map(e):map(r[0],e)};export default pluck;
7
+ const isPromise=r=>null!=r&&"function"==typeof r.then,funcConcat=(r,t)=>function(...e){const n=r(...e);return isPromise(n)?n.then(t):t(n)},symbolIterator=Symbol.iterator,MappingIterator=(r,t)=>({toString:()=>"[object MappingIterator]",[symbolIterator](){return this},next(){const e=r.next();return e.done?e:{value:t(e.value),done:!1}}}),NextIteration=r=>({value:r,done:!1}),symbolAsyncIterator=Symbol.asyncIterator,MappingAsyncIterator=(r,t)=>({[symbolAsyncIterator](){return this},async next(){const e=await r.next();if(e.done)return e;const n=t(e.value);return isPromise(n)?n.then(NextIteration):{value:n,done:!1}}}),__=Symbol.for("placeholder"),curry2ResolveArg0=(r,t)=>function(e){return r(e,t)},curry2ResolveArg1=(r,t)=>function(e){return r(t,e)},curry2=function(r,t,e){return t==__?curry2ResolveArg0(r,e):curry2ResolveArg1(r,t)},isArray=Array.isArray,isObject=r=>{if(null==r)return!1;const t=typeof r;return"object"==t||"function"==t},promiseAll=Promise.all.bind(Promise),arrayMap=function(r,t){const e=r.length,n=Array(e);let o=-1,s=!1;for(;++o<e;){const e=t(r[o],o,r);isPromise(e)&&(s=!0),n[o]=e}return s?promiseAll(n):n},curry3ResolveArg0=(r,t,e)=>function(n){return r(n,t,e)},curry3ResolveArg1=(r,t,e)=>function(n){return r(t,n,e)},curry3ResolveArg2=(r,t,e)=>function(n){return r(t,e,n)},curry3=function(r,t,e,n){return t==__?curry3ResolveArg0(r,e,n):e==__?curry3ResolveArg1(r,t,n):curry3ResolveArg2(r,t,e)},callPropUnary=(r,t,e)=>r[t](e),stringMap=function(r,t){const e=arrayMap(r,t);return isPromise(e)?e.then(curry3(callPropUnary,__,"join","")):e.join("")},always=r=>function(){return r},setMap=function(r,t){const e=new Set,n=[];for(const o of r){const s=t(o,o,r);isPromise(s)?n.push(s.then(curry3(callPropUnary,e,"add",__))):e.add(s)}return 0==n.length?e:promiseAll(n).then(always(e))},curry4ResolveArg0=(r,t,e,n)=>function(o){return r(o,t,e,n)},curry4ResolveArg1=(r,t,e,n)=>function(o){return r(t,o,e,n)},curry4ResolveArg2=(r,t,e,n)=>function(o){return r(t,e,o,n)},curry4ResolveArg3=(r,t,e,n)=>function(o){return r(t,e,n,o)},curry4=function(r,t,e,n,o){return t==__?curry4ResolveArg0(r,e,n,o):e==__?curry4ResolveArg1(r,t,n,o):n==__?curry4ResolveArg2(r,t,e,o):curry4ResolveArg3(r,t,e,n)},callPropBinary=(r,t,e,n)=>r[t](e,n),mapMap=function(r,t){const e=new Map,n=[];for(const[o,s]of r){const c=t(s,o,r);isPromise(c)?n.push(c.then(curry4(callPropBinary,e,"set",o,__))):e.set(o,c)}return 0==n.length?e:promiseAll(n).then(always(e))},promiseObjectAllExecutor=r=>function(t){const e={};let n=0;for(const o in r){const s=r[o];isPromise(s)?(n+=1,s.then((r=>function(o){e[r]=o,n-=1,0==n&&t(e)})(o))):e[o]=s}0==n&&t(e)},promiseObjectAll=r=>new Promise(promiseObjectAllExecutor(r)),objectMap=function(r,t){const e={};let n=!1;for(const o in r){const s=t(r[o],o,r);isPromise(s)&&(n=!0),e[o]=s}return n?promiseObjectAll(e):e},objectSet=function(r,t,e){return r[t]=e,r},arrayMapSeriesAsync=async function(r,t,e,n){const o=r.length;for(;++n<o;){const o=t(r[n],n);e[n]=isPromise(o)?await o:o}return e},arrayMapSeries=function(r,t){const e=r.length,n=Array(e);let o=-1;for(;++o<e;){const e=t(r[o],o);if(isPromise(e))return e.then(funcConcat(curry3(objectSet,n,o,__),curry4(arrayMapSeriesAsync,r,t,__,o)));n[o]=e}return n},tapSync=r=>function(...t){return r(...t),t[0]},promiseRace=Promise.race.bind(Promise),arrayMapPoolAsync=async function(r,t,e,n,o,s){const c=r.length;for(;++o<c;){s.size>=e&&await promiseRace(s);const c=t(r[o]);if(isPromise(c)){const r=c.then(tapSync((()=>s.delete(r))));s.add(r),n[o]=r}else n[o]=c}return promiseAll(n)},arrayMapPool=function(r,t,e){const n=r.length,o=Array(n);let s=-1;for(;++s<n;){const n=t(r[s]);if(isPromise(n)){const c=new Set,i=n.then(tapSync((()=>c.delete(i))));return c.add(i),o[s]=i,arrayMapPoolAsync(r,t,e,o,s,c)}o[s]=n}return o},_curryArity=(r,t,e)=>function(...n){const o=e.length,s=n.length,c=[];let i=-1,a=-1,u=0;for(;++i<o;){const o=e[i];if(o==__&&(a+=1)<s){const r=n[a];r==__&&(u+=1),c.push(r)}else c.push(o);if(c.length==r)return 0==u?t(...c):curryArity(r,t,c)}for(;++a<s;){const e=n[a];if(e==__&&(u+=1),c.push(e),c.length==r)return 0==u?t(...c):curryArity(r,t,c)}return curryArity(r,t,c)},curryArity=function(r,t,e){const n=e.length;if(n<r)return _curryArity(r,t,e);let o=-1;for(;++o<n;){if(e[o]==__)return _curryArity(r,t,e)}return t(...e)},spread2=r=>function([t,e]){return r(t,e)},objectMapEntries=function(r,t){const e={},n=[];for(const o in r){const s=t([o,r[o]]);isPromise(s)?n.push(s.then(spread2(curryArity(3,objectSet,[e])))):e[s[0]]=s[1]}return 0==n.length?e:promiseAll(n).then(always(e))},mapSet=function(r,t,e){return r.set(t,e)},mapMapEntriesForEachCallback=(r,t,e)=>function(n,o){const s=r([o,n]);isPromise(s)?e.push(s.then(spread2(curryArity(3,mapSet,[t])))):t.set(s[0],s[1])},mapMapEntries=function(r,t){const e=new Map,n=[];return r.forEach(mapMapEntriesForEachCallback(t,e,n)),0==n.length?e:promiseAll(n).then(always(e))},_map=function(r,t){return isArray(r)?arrayMap(r,t):null==r?r:"function"==typeof r.then?r.then(t):"function"==typeof r.map?r.map(t):"string"==typeof r||r.constructor==String?stringMap(r,t):r.constructor==Set?setMap(r,t):r.constructor==Map?mapMap(r,t):"function"==typeof r[symbolIterator]?MappingIterator(r[symbolIterator](),t):"function"==typeof r[symbolAsyncIterator]?MappingAsyncIterator(r[symbolAsyncIterator](),t):r.constructor==Object?objectMap(r,t):t(r)},map=(...r)=>{const t=r.pop();if(0==r.length)return curry2(_map,__,t);const e=r[0];return isPromise(e)?e.then(curry2(_map,__,t)):_map(e,t)};map.entries=function(r){return function(t){if(null==t)throw new TypeError("value is not an Object or Map");if(t.constructor==Object)return objectMapEntries(t,r);if(t.constructor==Map)return mapMapEntries(t,r);throw new TypeError("value is not an Object or Map")}},map.series=r=>function(t){if(isArray(t))return arrayMapSeries(t,r);throw new TypeError(`${t} is not an Array`)},map.pool=(r,t)=>function(e){if(isArray(e))return arrayMapPool(e,t,r);throw new TypeError(`${e} is not an Array`)};const memoizeCappedUnary=function(r,t){const e=new Map,n=function(n){if(e.has(n))return e.get(n);const o=r(n);return e.set(n,o),e.size>t&&e.clear(),o};return n.cache=e,n},pathDelimiters=/[.|[|\]]+/,parsePropertyPath=function(r){const t=r.length-1,e="["==r[0],n="]"==r[t];return e&&n?r.slice(1,t).split(pathDelimiters):e?r.slice(1).split(pathDelimiters):n?r.slice(0,t).split(pathDelimiters):r.split(pathDelimiters)},memoizedCappedParsePropertyPath=memoizeCappedUnary(parsePropertyPath,500),propertyPathToArray=r=>isArray(r)?r:"string"==typeof r?memoizedCappedParsePropertyPath(r):[r],getByPath=function(r,t){const e=propertyPathToArray(t),n=e.length;let o=-1,s=r;for(;++o<n;)if(s=s[e[o]],null==s)return;return s},_get=function(r,t,e){const n=null==r?void 0:getByPath(r,t);return void 0===n?"function"==typeof e?e(r):e:n},get=function(r,t,e){return"string"==typeof r||"number"==typeof r||isArray(r)?curry3(_get,__,r,t):isPromise(r)?r.then(curry3(_get,__,t,e)):_get(r,t,e)},pluck=function(...r){const t=r.pop(),e="string"==typeof(n=t)||"number"==typeof n||isArray(n)?curry3(_get,__,n,o):isPromise(n)?n.then(curry3(_get,__,o,s)):_get(n,o,s);var n,o,s;return 0==r.length?map(e):map(r[0],e)};export default pluck;
package/dist/x/pluck.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
@@ -275,7 +275,7 @@ const arrayMapSeriesAsync = async function (
275
275
  ) {
276
276
  const arrayLength = array.length
277
277
  while (++index < arrayLength) {
278
- const resultItem = mapper(array[index])
278
+ const resultItem = mapper(array[index], index)
279
279
  result[index] = isPromise(resultItem) ? await resultItem : resultItem
280
280
  }
281
281
  return result
@@ -287,7 +287,7 @@ const arrayMapSeries = function (array, mapper) {
287
287
  let index = -1
288
288
 
289
289
  while (++index < arrayLength) {
290
- const resultItem = mapper(array[index])
290
+ const resultItem = mapper(array[index], index)
291
291
  if (isPromise(resultItem)) {
292
292
  return resultItem.then(funcConcat(
293
293
  curry3(objectSet, result, index, __),
@@ -595,13 +595,13 @@ const _get = function (object, path, defaultValue) {
595
595
  }
596
596
 
597
597
  const get = function (arg0, arg1, arg2) {
598
+ if (typeof arg0 == 'string' || typeof arg0 == 'number' || isArray(arg0)) {
599
+ return curry3(_get, __, arg0, arg1)
600
+ }
598
601
  if (isPromise(arg0)) {
599
602
  return arg0.then(curry3(_get, __, arg1, arg2))
600
603
  }
601
- if (isObject(arg0) && !isArray(arg0)) {
602
- return _get(arg0, arg1, arg2)
603
- }
604
- return curry3(_get, __, arg0, arg1)
604
+ return _get(arg0, arg1, arg2)
605
605
  }
606
606
 
607
607
  const pluck = function (...args) {
@@ -1,8 +1,8 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
8
- !function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((()=>t)):n.pluck=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=n=>null!=n&&"function"==typeof n.then,t=(t,e)=>function(...r){const o=t(...r);return n(o)?o.then(e):e(o)},e=Symbol.iterator,r=(n,t)=>({toString:()=>"[object MappingIterator]",[e](){return this},next(){const e=n.next();return e.done?e:{value:t(e.value),done:!1}}}),o=n=>({value:n,done:!1}),u=Symbol.asyncIterator,c=(t,e)=>({[u](){return this},async next(){const r=await t.next();if(r.done)return r;const u=e(r.value);return n(u)?u.then(o):{value:u,done:!1}}}),i=Symbol.for("placeholder"),s=function(n,t,e){return t==i?((n,t)=>function(e){return n(e,t)})(n,e):((n,t)=>function(e){return n(t,e)})(n,t)},f=Array.isArray,l=Promise.all.bind(Promise),h=function(t,e){const r=t.length,o=Array(r);let u=-1,c=!1;for(;++u<r;){const r=e(t[u],u,t);n(r)&&(c=!0),o[u]=r}return c?l(o):o},a=function(n,t,e,r){return t==i?((n,t,e)=>function(r){return n(r,t,e)})(n,e,r):e==i?((n,t,e)=>function(r){return n(t,r,e)})(n,t,r):((n,t,e)=>function(r){return n(t,e,r)})(n,t,e)},p=(n,t,e)=>n[t](e),y=n=>function(){return n},g=function(n,t,e,r,o){return t==i?((n,t,e,r)=>function(o){return n(o,t,e,r)})(n,e,r,o):e==i?((n,t,e,r)=>function(o){return n(t,o,e,r)})(n,t,r,o):r==i?((n,t,e,r)=>function(o){return n(t,e,o,r)})(n,t,e,o):((n,t,e,r)=>function(o){return n(t,e,r,o)})(n,t,e,r)},d=(n,t,e,r)=>n[t](e,r),w=t=>new Promise((t=>function(e){const r={};let o=0;for(const u in t){const c=t[u];n(c)?(o+=1,c.then((n=>function(t){r[n]=t,o-=1,0==o&&e(r)})(u))):r[u]=c}0==o&&e(r)})(t)),b=function(n,t,e){return n[t]=e,n},m=async function(t,e,r,o){const u=t.length;for(;++o<u;){const u=e(t[o]);r[o]=n(u)?await u:u}return r},j=n=>function(...t){return n(...t),t[0]},v=Promise.race.bind(Promise),M=async function(t,e,r,o,u,c){const i=t.length;for(;++u<i;){c.size>=r&&await v(c);const i=e(t[u]);if(n(i)){const n=i.then(j((()=>c.delete(n))));c.add(n),o[u]=n}else o[u]=i}return l(o)},S=(n,t,e)=>function(...r){const o=e.length,u=r.length,c=[];let s=-1,f=-1,l=0;for(;++s<o;){const o=e[s];if(o==i&&(f+=1)<u){const n=r[f];n==i&&(l+=1),c.push(n)}else c.push(o);if(c.length==n)return 0==l?t(...c):A(n,t,c)}for(;++f<u;){const e=r[f];if(e==i&&(l+=1),c.push(e),c.length==n)return 0==l?t(...c):A(n,t,c)}return A(n,t,c)},A=function(n,t,e){const r=e.length;if(r<n)return S(n,t,e);let o=-1;for(;++o<r;){if(e[o]==i)return S(n,t,e)}return t(...e)},T=n=>function([t,e]){return n(t,e)},x=function(n,t,e){return n.set(t,e)},E=function(t,e){const r=new Map,o=[];return t.forEach(((t,e,r)=>function(o,u){const c=t([u,o]);n(c)?r.push(c.then(T(A(3,x,[e])))):e.set(c[0],c[1])})(e,r,o)),0==o.length?r:l(o).then(y(r))},P=function(t,o){return f(t)?h(t,o):null==t?t:"function"==typeof t.then?t.then(o):"function"==typeof t.map?t.map(o):"string"==typeof t||t.constructor==String?function(t,e){const r=h(t,e);return n(r)?r.then(a(p,i,"join","")):r.join("")}(t,o):t.constructor==Set?function(t,e){const r=new Set,o=[];for(const u of t){const c=e(u,u,t);n(c)?o.push(c.then(a(p,r,"add",i))):r.add(c)}return 0==o.length?r:l(o).then(y(r))}(t,o):t.constructor==Map?function(t,e){const r=new Map,o=[];for(const[u,c]of t){const s=e(c,u,t);n(s)?o.push(s.then(g(d,r,"set",u,i))):r.set(u,s)}return 0==o.length?r:l(o).then(y(r))}(t,o):"function"==typeof t[e]?r(t[e](),o):"function"==typeof t[u]?c(t[u](),o):t.constructor==Object?function(t,e){const r={};let o=!1;for(const u in t){const c=e(t[u],u,t);n(c)&&(o=!0),r[u]=c}return o?w(r):r}(t,o):o(t)},O=(...t)=>{const e=t.pop();if(0==t.length)return s(P,i,e);const r=t[0];return n(r)?r.then(s(P,i,e)):P(r,e)};O.entries=function(t){return function(e){if(null==e)throw new TypeError("value is not an Object or Map");if(e.constructor==Object)return function(t,e){const r={},o=[];for(const u in t){const c=e([u,t[u]]);n(c)?o.push(c.then(T(A(3,b,[r])))):r[c[0]]=c[1]}return 0==o.length?r:l(o).then(y(r))}(e,t);if(e.constructor==Map)return E(e,t);throw new TypeError("value is not an Object or Map")}},O.series=e=>function(r){if(f(r))return function(e,r){const o=e.length,u=Array(o);let c=-1;for(;++c<o;){const o=r(e[c]);if(n(o))return o.then(t(a(b,u,c,i),g(m,e,r,i,c)));u[c]=o}return u}(r,e);throw new TypeError(`${r} is not an Array`)},O.pool=(t,e)=>function(r){if(f(r))return function(t,e,r){const o=t.length,u=Array(o);let c=-1;for(;++c<o;){const o=e(t[c]);if(n(o)){const n=new Set,i=o.then(j((()=>n.delete(i))));return n.add(i),u[c]=i,M(t,e,r,u,c,n)}u[c]=o}return u}(r,e,t);throw new TypeError(`${r} is not an Array`)};const z=/[.|[|\]]+/,I=function(n,t){const e=new Map,r=function(r){if(e.has(r))return e.get(r);const o=n(r);return e.set(r,o),e.size>t&&e.clear(),o};return r.cache=e,r}((function(n){const t=n.length-1,e="["==n[0],r="]"==n[t];return e&&r?n.slice(1,t).split(z):e?n.slice(1).split(z):r?n.slice(0,t).split(z):n.split(z)}),500),$=function(n,t){const e=(n=>f(n)?n:"string"==typeof n?I(n):[n])(t),r=e.length;let o=-1,u=n;for(;++o<r;)if(u=u[e[o]],null==u)return;return u},k=function(n,t,e){const r=null==n?void 0:$(n,t);return void 0===r?"function"==typeof e?e(n):e:r};return function(...t){const e=t.pop(),r=n(o=e)?o.then(a(k,i,u,c)):(n=>{if(null==n)return!1;const t=typeof n;return"object"==t||"function"==t})(o)&&!f(o)?k(o,u,c):a(k,i,o,u);var o,u,c;return 0==t.length?O(r):O(t[0],r)}}());
8
+ !function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((()=>t)):n.pluck=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=n=>null!=n&&"function"==typeof n.then,t=(t,e)=>function(...r){const o=t(...r);return n(o)?o.then(e):e(o)},e=Symbol.iterator,r=(n,t)=>({toString:()=>"[object MappingIterator]",[e](){return this},next(){const e=n.next();return e.done?e:{value:t(e.value),done:!1}}}),o=n=>({value:n,done:!1}),u=Symbol.asyncIterator,c=(t,e)=>({[u](){return this},async next(){const r=await t.next();if(r.done)return r;const u=e(r.value);return n(u)?u.then(o):{value:u,done:!1}}}),i=Symbol.for("placeholder"),s=function(n,t,e){return t==i?((n,t)=>function(e){return n(e,t)})(n,e):((n,t)=>function(e){return n(t,e)})(n,t)},f=Array.isArray,l=Promise.all.bind(Promise),h=function(t,e){const r=t.length,o=Array(r);let u=-1,c=!1;for(;++u<r;){const r=e(t[u],u,t);n(r)&&(c=!0),o[u]=r}return c?l(o):o},a=function(n,t,e,r){return t==i?((n,t,e)=>function(r){return n(r,t,e)})(n,e,r):e==i?((n,t,e)=>function(r){return n(t,r,e)})(n,t,r):((n,t,e)=>function(r){return n(t,e,r)})(n,t,e)},p=(n,t,e)=>n[t](e),y=n=>function(){return n},g=function(n,t,e,r,o){return t==i?((n,t,e,r)=>function(o){return n(o,t,e,r)})(n,e,r,o):e==i?((n,t,e,r)=>function(o){return n(t,o,e,r)})(n,t,r,o):r==i?((n,t,e,r)=>function(o){return n(t,e,o,r)})(n,t,e,o):((n,t,e,r)=>function(o){return n(t,e,r,o)})(n,t,e,r)},d=(n,t,e,r)=>n[t](e,r),w=t=>new Promise((t=>function(e){const r={};let o=0;for(const u in t){const c=t[u];n(c)?(o+=1,c.then((n=>function(t){r[n]=t,o-=1,0==o&&e(r)})(u))):r[u]=c}0==o&&e(r)})(t)),b=function(n,t,e){return n[t]=e,n},m=async function(t,e,r,o){const u=t.length;for(;++o<u;){const u=e(t[o],o);r[o]=n(u)?await u:u}return r},v=n=>function(...t){return n(...t),t[0]},j=Promise.race.bind(Promise),M=async function(t,e,r,o,u,c){const i=t.length;for(;++u<i;){c.size>=r&&await j(c);const i=e(t[u]);if(n(i)){const n=i.then(v((()=>c.delete(n))));c.add(n),o[u]=n}else o[u]=i}return l(o)},S=(n,t,e)=>function(...r){const o=e.length,u=r.length,c=[];let s=-1,f=-1,l=0;for(;++s<o;){const o=e[s];if(o==i&&(f+=1)<u){const n=r[f];n==i&&(l+=1),c.push(n)}else c.push(o);if(c.length==n)return 0==l?t(...c):A(n,t,c)}for(;++f<u;){const e=r[f];if(e==i&&(l+=1),c.push(e),c.length==n)return 0==l?t(...c):A(n,t,c)}return A(n,t,c)},A=function(n,t,e){const r=e.length;if(r<n)return S(n,t,e);let o=-1;for(;++o<r;){if(e[o]==i)return S(n,t,e)}return t(...e)},T=n=>function([t,e]){return n(t,e)},x=function(n,t,e){return n.set(t,e)},E=function(t,e){const r=new Map,o=[];return t.forEach(((t,e,r)=>function(o,u){const c=t([u,o]);n(c)?r.push(c.then(T(A(3,x,[e])))):e.set(c[0],c[1])})(e,r,o)),0==o.length?r:l(o).then(y(r))},P=function(t,o){return f(t)?h(t,o):null==t?t:"function"==typeof t.then?t.then(o):"function"==typeof t.map?t.map(o):"string"==typeof t||t.constructor==String?function(t,e){const r=h(t,e);return n(r)?r.then(a(p,i,"join","")):r.join("")}(t,o):t.constructor==Set?function(t,e){const r=new Set,o=[];for(const u of t){const c=e(u,u,t);n(c)?o.push(c.then(a(p,r,"add",i))):r.add(c)}return 0==o.length?r:l(o).then(y(r))}(t,o):t.constructor==Map?function(t,e){const r=new Map,o=[];for(const[u,c]of t){const s=e(c,u,t);n(s)?o.push(s.then(g(d,r,"set",u,i))):r.set(u,s)}return 0==o.length?r:l(o).then(y(r))}(t,o):"function"==typeof t[e]?r(t[e](),o):"function"==typeof t[u]?c(t[u](),o):t.constructor==Object?function(t,e){const r={};let o=!1;for(const u in t){const c=e(t[u],u,t);n(c)&&(o=!0),r[u]=c}return o?w(r):r}(t,o):o(t)},O=(...t)=>{const e=t.pop();if(0==t.length)return s(P,i,e);const r=t[0];return n(r)?r.then(s(P,i,e)):P(r,e)};O.entries=function(t){return function(e){if(null==e)throw new TypeError("value is not an Object or Map");if(e.constructor==Object)return function(t,e){const r={},o=[];for(const u in t){const c=e([u,t[u]]);n(c)?o.push(c.then(T(A(3,b,[r])))):r[c[0]]=c[1]}return 0==o.length?r:l(o).then(y(r))}(e,t);if(e.constructor==Map)return E(e,t);throw new TypeError("value is not an Object or Map")}},O.series=e=>function(r){if(f(r))return function(e,r){const o=e.length,u=Array(o);let c=-1;for(;++c<o;){const o=r(e[c],c);if(n(o))return o.then(t(a(b,u,c,i),g(m,e,r,i,c)));u[c]=o}return u}(r,e);throw new TypeError(`${r} is not an Array`)},O.pool=(t,e)=>function(r){if(f(r))return function(t,e,r){const o=t.length,u=Array(o);let c=-1;for(;++c<o;){const o=e(t[c]);if(n(o)){const n=new Set,i=o.then(v((()=>n.delete(i))));return n.add(i),u[c]=i,M(t,e,r,u,c,n)}u[c]=o}return u}(r,e,t);throw new TypeError(`${r} is not an Array`)};const z=/[.|[|\]]+/,I=function(n,t){const e=new Map,r=function(r){if(e.has(r))return e.get(r);const o=n(r);return e.set(r,o),e.size>t&&e.clear(),o};return r.cache=e,r}((function(n){const t=n.length-1,e="["==n[0],r="]"==n[t];return e&&r?n.slice(1,t).split(z):e?n.slice(1).split(z):r?n.slice(0,t).split(z):n.split(z)}),500),$=function(n,t){const e=(n=>f(n)?n:"string"==typeof n?I(n):[n])(t),r=e.length;let o=-1,u=n;for(;++o<r;)if(u=u[e[o]],null==u)return;return u},k=function(n,t,e){const r=null==n?void 0:$(n,t);return void 0===r?"function"==typeof e?e(n):e:r};return function(...t){const e=t.pop(),r="string"==typeof(o=e)||"number"==typeof o||f(o)?a(k,i,o,u):n(o)?o.then(a(k,i,u,c)):k(o,u,c);var o,u,c;return 0==t.length?O(r):O(t[0],r)}}());
package/dist/x/pluck.mjs CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
@@ -269,7 +269,7 @@ const arrayMapSeriesAsync = async function (
269
269
  ) {
270
270
  const arrayLength = array.length
271
271
  while (++index < arrayLength) {
272
- const resultItem = mapper(array[index])
272
+ const resultItem = mapper(array[index], index)
273
273
  result[index] = isPromise(resultItem) ? await resultItem : resultItem
274
274
  }
275
275
  return result
@@ -281,7 +281,7 @@ const arrayMapSeries = function (array, mapper) {
281
281
  let index = -1
282
282
 
283
283
  while (++index < arrayLength) {
284
- const resultItem = mapper(array[index])
284
+ const resultItem = mapper(array[index], index)
285
285
  if (isPromise(resultItem)) {
286
286
  return resultItem.then(funcConcat(
287
287
  curry3(objectSet, result, index, __),
@@ -589,13 +589,13 @@ const _get = function (object, path, defaultValue) {
589
589
  }
590
590
 
591
591
  const get = function (arg0, arg1, arg2) {
592
+ if (typeof arg0 == 'string' || typeof arg0 == 'number' || isArray(arg0)) {
593
+ return curry3(_get, __, arg0, arg1)
594
+ }
592
595
  if (isPromise(arg0)) {
593
596
  return arg0.then(curry3(_get, __, arg1, arg2))
594
597
  }
595
- if (isObject(arg0) && !isArray(arg0)) {
596
- return _get(arg0, arg1, arg2)
597
- }
598
- return curry3(_get, __, arg0, arg1)
598
+ return _get(arg0, arg1, arg2)
599
599
  }
600
600
 
601
601
  const pluck = function (...args) {
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
  const isString=function(r){return"string"==typeof r||null!=r&&r.constructor==String},isArray=Array.isArray,prepend=r=>function(n){if(isArray(n))return isArray(r)?[...r,...n]:[r,...n];if(isString(n)){if(!isString(r))throw new TypeError(`${r} is not a string`);return`${r}${n}`}throw new TypeError(`${n} is not an Array or string`)};export default prepend;
package/dist/x/prepend.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
package/dist/x/size.es.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
  const objectKeysLength=e=>{let t=0;for(const n in e)t+=1;return t},size=e=>"string"==typeof e?e.length:null==e?0:"number"==typeof e.length?e.length:"number"==typeof e.size?e.size:e.constructor==Object?objectKeysLength(e):1;export default size;
package/dist/x/size.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
package/dist/x/size.mjs CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
  const isPromise=r=>null!=r&&"function"==typeof r.then,funcConcat=(r,n)=>function(...e){const o=r(...e);return isPromise(o)?o.then(n):n(o)},always=r=>function(){return r},thunkifyArgs=(r,n)=>function(){return r(...n)},thunkConditional=(r,n,e)=>r?n():e(),__=Symbol.for("placeholder"),curry3ResolveArg0=(r,n,e)=>function(o){return r(o,n,e)},curry3ResolveArg1=(r,n,e)=>function(o){return r(n,o,e)},curry3ResolveArg2=(r,n,e)=>function(o){return r(n,e,o)},curry3=function(r,n,e,o){return n==__?curry3ResolveArg0(r,e,o):e==__?curry3ResolveArg1(r,n,o):curry3ResolveArg2(r,n,e)},curryArgs2ResolveArgs0=(r,n,e)=>function(...e){return r(e,n)},curryArgs2ResolveArgs1=(r,n,e)=>function(...e){return r(n,e)},curryArgs2=function(r,n,e){return n==__?curryArgs2ResolveArgs0(r,e):curryArgs2ResolveArgs1(r,n)},_tap=function(r,n){const e=r[0],o=n(...r);return isPromise(o)?o.then(always(e)):e},tap=function(...r){const n=r.pop();return 0==r.length?(e=_tap,t=n,(o=__)==__?curryArgs2ResolveArgs0(e,t):curryArgs2ResolveArgs1(e,o)):_tap(r,n);var e,o,t};tap.if=(r,n)=>function(...e){const o=r(...e);if(isPromise(o))return o.then((t=thunkConditional,s=__,u=thunkifyArgs(tap(n),e),c=always(e[0]),s==__?curry3ResolveArg0(t,u,c):u==__?curry3ResolveArg1(t,s,c):curry3ResolveArg2(t,s,u)));var t,s,u,c;if(o){const r=n(...e);if(isPromise(r))return r.then(always(e[0]))}return e[0]};const consoleLog=console.log,trace=function(...r){const n=r[0];return"function"==typeof n?tap((e=n,o=consoleLog,function(...r){const n=e(...r);return isPromise(n)?n.then(o):o(n)})):tap(consoleLog)(...r);var e,o};export default trace;
package/dist/x/trace.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
package/dist/x/trace.mjs CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
  const isArray=Array.isArray,isPromise=r=>null!=r&&"function"==typeof r.then,promiseAll=Promise.all.bind(Promise),__=Symbol.for("placeholder"),curry3ResolveArg0=(r,n,t)=>function(e){return r(e,n,t)},curry3ResolveArg1=(r,n,t)=>function(e){return r(n,e,t)},curry3ResolveArg2=(r,n,t)=>function(e){return r(n,t,e)},curry3=function(r,n,t,e){return n==__?curry3ResolveArg0(r,t,e):t==__?curry3ResolveArg1(r,n,e):curry3ResolveArg2(r,n,t)},thunkify2=(r,n,t)=>function(){return r(n,t)},thunkify4=(r,n,t,e,o)=>function(){return r(n,t,e,o)},funcConcatSync=(r,n)=>function(...t){return n(r(...t))},callPropUnary=(r,n,t)=>r[n](t),thunkConditional=(r,n,t)=>r?n():t(),arrayPush=function(r,n){return r.push(n),r},always=r=>function(){return r},curry2ResolveArg0=(r,n)=>function(t){return r(t,n)},curry2ResolveArg1=(r,n)=>function(t){return r(n,t)},curry2=function(r,n,t){return n==__?curry2ResolveArg0(r,t):curry2ResolveArg1(r,n)},getArg1=(r,n)=>n,identity=r=>r,asyncIteratorForEach=async function(r,n){const t=[];for await(const e of r){const r=n(e);isPromise(r)&&t.push(r)}return 0==t.length?r:promiseAll(t).then(always(r))},symbolIterator=Symbol.iterator,symbolAsyncIterator=Symbol.asyncIterator,arrayFlatten=function(r){const n=r.length,t=[],e=[];let o=-1;for(;++o<n;){const n=r[o];if(isArray(n)){const r=n.length;let t=-1;for(;++t<r;)e.push(n[t])}else if(null==n)e.push(n);else if("function"==typeof n.then)t.push(n.then(curry2(arrayPush,e,__)));else if("function"==typeof n[symbolIterator])for(const r of n)e.push(r);else if("function"==typeof n[symbolAsyncIterator])t.push(asyncIteratorForEach(n[symbolAsyncIterator](),curry2(arrayPush,e,__)));else if("function"==typeof n.chain){const r=n.chain(identity);isPromise(r)?t.push(r.then(curry2(arrayPush,e,__))):e.push(r)}else if("function"==typeof n.flatMap){const r=n.flatMap(identity);isPromise(r)?t.push(r.then(curry2(arrayPush,e,__))):e.push(r)}else if("function"==typeof n.reduce){const r=n.reduce(funcConcatSync(getArg1,curry2(arrayPush,e,__)),null);isPromise(r)&&t.push(r)}else if(n.constructor==Object)for(const r in n)e.push(n[r]);else e.push(n)}return 0==t.length?e:promiseAll(t).then(always(e))},noop=function(){},arrayIncludesWith=function(r,n,t){const e=r.length,o=[];let s=-1;for(;++s<e;){const e=t(n,r[s]);if(isPromise(e))o.push(e);else if(e)return!0}return 0!=o.length&&promiseAll(o).then(curry3(callPropUnary,__,"some",Boolean))},arrayUniqWithAsync=async function(r,n,t,e){const o=r.length;for(;++e<o;){const o=r[e],s=arrayIncludesWith(t,o,n);(isPromise(s)?await s:s)||t.push(o)}return t},arrayUniqWith=function(r,n){const t=r.length,e=[];let o=-1;for(;++o<t;){const t=r[o],s=arrayIncludesWith(e,t,n);if(isPromise(s))return s.then(funcConcatSync(curry3(thunkConditional,__,noop,thunkify2(arrayPush,e,t)),thunkify4(arrayUniqWithAsync,r,n,e,o)));s||e.push(t)}return e},unionWith=r=>function(n){if(isArray(n))return arrayUniqWith(arrayFlatten(n),r);throw new TypeError(`${n} is not an Array`)};export default unionWith;
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
package/dist/x/uniq.es.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
  const isArray=Array.isArray,uniq=r=>{if(!isArray(r))throw Error("uniq(arr): arr is not an array");return[...new Set(r)]};export default uniq;
package/dist/x/uniq.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
package/dist/x/uniq.mjs CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
  const isPromise=r=>null!=r&&"function"==typeof r.then,always=r=>function(){return r},__=Symbol.for("placeholder"),thunkify1=(r,n)=>function(){return r(n)},curry3ResolveArg0=(r,n,e)=>function(u){return r(u,n,e)},curry3ResolveArg1=(r,n,e)=>function(u){return r(n,u,e)},curry3ResolveArg2=(r,n,e)=>function(u){return r(n,e,u)},curry3=function(r,n,e,u){return n==__?curry3ResolveArg0(r,e,u):e==__?curry3ResolveArg1(r,n,u):curry3ResolveArg2(r,n,e)},thunkConditional=(r,n,e)=>r?n():e(),unless=(r,n)=>function(e){const u=r(e);return isPromise(u)?u.then((o=thunkConditional,t=__,c=always(e),l=thunkify1(n,e),t==__?curry3ResolveArg0(o,c,l):c==__?curry3ResolveArg1(o,t,l):curry3ResolveArg2(o,t,c))):u?e:n(e);var o,t,c,l};export default unless;
package/dist/x/unless.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
package/dist/x/unless.mjs CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
  const objectValues=Object.values,values=e=>null==e?[]:"function"==typeof e.values?[...e.values()]:objectValues(e);export default values;
package/dist/x/values.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
package/dist/x/values.mjs CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
package/dist/x/when.es.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
  const isPromise=r=>null!=r&&"function"==typeof r.then,always=r=>function(){return r},__=Symbol.for("placeholder"),thunkify1=(r,n)=>function(){return r(n)},curry3ResolveArg0=(r,n,e)=>function(u){return r(u,n,e)},curry3ResolveArg1=(r,n,e)=>function(u){return r(n,u,e)},curry3ResolveArg2=(r,n,e)=>function(u){return r(n,e,u)},curry3=function(r,n,e,u){return n==__?curry3ResolveArg0(r,e,u):e==__?curry3ResolveArg1(r,n,u):curry3ResolveArg2(r,n,e)},thunkConditional=(r,n,e)=>r?n():e(),when=(r,n)=>function(e){const u=r(e);return isPromise(u)?u.then((o=thunkConditional,t=__,c=thunkify1(n,e),l=always(e),t==__?curry3ResolveArg0(o,c,l):c==__?curry3ResolveArg1(o,t,l):curry3ResolveArg2(o,t,c))):u?n(e):e;var o,t,c,l};export default when;
package/dist/x/when.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
package/dist/x/when.mjs CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.0
2
+ * rubico v2.3.2
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2023 Richard Tong
4
+ * (c) 2019-2024 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7