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
package/dist/every.min.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
 
package/dist/every.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/filter.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
  const __ = Symbol.for('placeholder')
@@ -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 __=Symbol.for("placeholder"),curry2ResolveArg0=(r,t)=>function(n){return r(n,t)},curry2ResolveArg1=(r,t)=>function(n){return r(t,n)},curry2=function(r,t,n){return t==__?curry2ResolveArg0(r,n):curry2ResolveArg1(r,t)},symbolIterator=Symbol.iterator,FilteringIterator=(r,t)=>({[symbolIterator](){return this},next(){let n=r.next();for(;!n.done;){const{value:e}=n;if(t(e))return{value:e,done:!1};n=r.next()}return n}}),isPromise=r=>null!=r&&"function"==typeof r.then,symbolAsyncIterator=Symbol.asyncIterator,FilteringAsyncIterator=(r,t)=>({isAsyncIteratorDone:!1,[symbolAsyncIterator](){return this},async next(){for(;!this.isAsyncIteratorDone;){const{value:n,done:e}=await r.next();if(e)this.isAsyncIteratorDone=!0;else{const r=t(n);if(isPromise(r)?await r:r)return{value:n,done:!1}}}return{value:void 0,done:!0}}}),isArray=Array.isArray,curry4ResolveArg0=(r,t,n,e)=>function(o){return r(o,t,n,e)},curry4ResolveArg1=(r,t,n,e)=>function(o){return r(t,o,n,e)},curry4ResolveArg2=(r,t,n,e)=>function(o){return r(t,n,o,e)},curry4ResolveArg3=(r,t,n,e)=>function(o){return r(t,n,e,o)},curry4=function(r,t,n,e,o){return t==__?curry4ResolveArg0(r,n,e,o):n==__?curry4ResolveArg1(r,t,e,o):e==__?curry4ResolveArg2(r,t,n,o):curry4ResolveArg3(r,t,n,e)},promiseAll=Promise.all.bind(Promise),arrayExtendMap=function(r,t,n,e){const o=t.length;let i=r.length-1;for(;++e<o;)r[++i]=n(t[e],e,r);return r},arrayFilterByConditions=function(r,t,n,e){const o=r.length;let i=-1;for(;++n<o;)e[++i]&&t.push(r[n]);return t},arrayFilter=function(r,t){const n=r.length,e=[];let o=-1,i=-1;for(;++o<n;){const n=r[o],u=t(n,o,r);if(isPromise(u))return promiseAll(arrayExtendMap([u],r,t,o)).then(curry4(arrayFilterByConditions,r,e,o-1,__));u&&(e[++i]=n)}return e},curry3ResolveArg0=(r,t,n)=>function(e){return r(e,t,n)},curry3ResolveArg1=(r,t,n)=>function(e){return r(t,e,n)},curry3ResolveArg2=(r,t,n)=>function(e){return r(t,n,e)},curry3=function(r,t,n,e){return t==__?curry3ResolveArg0(r,n,e):n==__?curry3ResolveArg1(r,t,e):curry3ResolveArg2(r,t,n)},callPropUnary=(r,t,n)=>r[t](n),stringFilter=function(r,t){const n=arrayFilter(r,t);return isPromise(n)?n.then(curry3(callPropUnary,__,"join","")):n.join("")},always=r=>function(){return r},thunkConditional=(r,t,n)=>r?t():n(),thunkify1=(r,t)=>function(){return r(t)},noop=function(){},setFilter=function(r,t){const n=new Set,e=n.add.bind(n),o=[];for(const i of r){const u=t(i,i,r);isPromise(u)?o.push(u.then(curry3(thunkConditional,__,thunkify1(e,i),noop))):u&&n.add(i)}return 0==o.length?n:promiseAll(o).then(always(n))},thunkify4=(r,t,n,e,o)=>function(){return r(t,n,e,o)},callPropBinary=(r,t,n,e)=>r[t](n,e),mapFilter=function(r,t){const n=new Map,e=[];for(const[o,i]of r){const u=t(i,o,r);isPromise(u)?e.push(u.then(curry3(thunkConditional,__,thunkify4(callPropBinary,n,"set",o,i),noop))):u&&n.set(o,i)}return 0==e.length?n:promiseAll(e).then(always(n))},objectSetIf=function(r,t,n,e){e&&(r[t]=n)},objectFilter=function(r,t){const n={},e=[];for(const o in r){const i=r[o],u=t(i,o,r);isPromise(u)?e.push(u.then(curry4(objectSetIf,n,o,r[o],__))):u&&(n[o]=i)}return 0==e.length?n:promiseAll(e).then(always(n))},_filter=function(r,t){return isArray(r)?arrayFilter(r,t):null==r?r:"string"==typeof r||r.constructor==String?stringFilter(r,t):r.constructor==Set?setFilter(r,t):r.constructor==Map?mapFilter(r,t):"function"==typeof r.filter?r.filter(t):"function"==typeof r[symbolIterator]?FilteringIterator(r[symbolIterator](),t):"function"==typeof r[symbolAsyncIterator]?FilteringAsyncIterator(r[symbolAsyncIterator](),t):r.constructor==Object?objectFilter(r,t):r},filter=function(...r){const t=r.pop();return 0==r.length?(n=_filter,o=t,(e=__)==__?curry2ResolveArg0(n,o):curry2ResolveArg1(n,e)):_filter(r[0],t);var n,e,o};export default filter;
package/dist/filter.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/filter.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
  const __ = Symbol.for('placeholder')
@@ -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,isArray=Array.isArray,objectValues=Object.values,objectProto=Object.prototype,nativeObjectToString=objectProto.toString,objectToString=r=>nativeObjectToString.call(r),generatorFunctionTag="[object GeneratorFunction]",isGeneratorFunction=r=>objectToString(r)==generatorFunctionTag,asyncGeneratorFunctionTag="[object AsyncGeneratorFunction]",isAsyncGeneratorFunction=r=>objectToString(r)==asyncGeneratorFunctionTag,__=Symbol.for("placeholder"),curry3ResolveArg0=(r,e,t)=>function(n){return r(n,e,t)},curry3ResolveArg1=(r,e,t)=>function(n){return r(e,n,t)},curry3ResolveArg2=(r,e,t)=>function(n){return r(e,t,n)},curry3=function(r,e,t,n){return e==__?curry3ResolveArg0(r,t,n):t==__?curry3ResolveArg1(r,e,n):curry3ResolveArg2(r,e,t)},iteratorReduceAsync=async function(r,e,t){let n=r.next();if(n.done)return t;for(;!n.done;)t=e(t,n.value),isPromise(t)&&(t=await t),n=r.next();return t},iteratorReduce=function(r,e,t){let n=r.next();if(n.done)return t;for(void 0===t&&(t=n.value,n=r.next());!n.done;){if(t=e(t,n.value),isPromise(t))return t.then(curry3(iteratorReduceAsync,r,e,__));n=r.next()}return t},asyncIteratorReduce=async function(r,e,t){let n=await r.next();if(n.done)return t;for(void 0===t&&(t=n.value,n=await r.next());!n.done;)t=await e(t,n.value),n=await r.next();return t},symbolIterator=Symbol.iterator,symbolAsyncIterator=Symbol.asyncIterator,curry2ResolveArg0=(r,e)=>function(t){return r(t,e)},curry2ResolveArg1=(r,e)=>function(t){return r(e,t)},curry2=function(r,e,t){return e==__?curry2ResolveArg0(r,t):curry2ResolveArg1(r,e)},curryArgs3ResolveArgs0=(r,e,t)=>function(...n){return r(n,e,t)},curryArgs3ResolveArgs1=(r,e,t)=>function(...n){return r(e,n,t)},curryArgs3ResolveArgs2=(r,e,t)=>function(...n){return r(e,t,n)},curryArgs3=function(r,e,t,n){return e==__?curryArgs3ResolveArgs0(r,t,n):t==__?curryArgs3ResolveArgs1(r,e,n):curryArgs3ResolveArgs2(r,e,t)},curry4ResolveArg0=(r,e,t,n)=>function(o){return r(o,e,t,n)},curry4ResolveArg1=(r,e,t,n)=>function(o){return r(e,o,t,n)},curry4ResolveArg2=(r,e,t,n)=>function(o){return r(e,t,o,n)},curry4ResolveArg3=(r,e,t,n)=>function(o){return r(e,t,n,o)},curry4=function(r,e,t,n,o){return e==__?curry4ResolveArg0(r,t,n,o):t==__?curry4ResolveArg1(r,e,n,o):n==__?curry4ResolveArg2(r,e,t,o):curry4ResolveArg3(r,e,t,n)},arrayReduceAsync=async function(r,e,t,n){const o=r.length;for(;++n<o;)t=e(t,r[n],n,r),isPromise(t)&&(t=await t);return t},arrayReduce=function(r,e,t){const n=r.length;let o=-1;for(void 0===t&&(t=r[++o]);++o<n;)if(t=e(t,r[o],o,r),isPromise(t))return t.then(curry4(arrayReduceAsync,r,e,__,o));return t},curry5ResolveArg0=(r,e,t,n,o)=>function(c){return r(c,e,t,n,o)},curry5ResolveArg1=(r,e,t,n,o)=>function(c){return r(e,c,t,n,o)},curry5ResolveArg2=(r,e,t,n,o)=>function(c){return r(e,t,c,n,o)},curry5ResolveArg3=(r,e,t,n,o)=>function(c){return r(e,t,n,c,o)},curry5ResolveArg4=(r,e,t,n,o)=>function(c){return r(e,t,n,o,c)},curry5=function(r,e,t,n,o,c){return e==__?curry5ResolveArg0(r,t,n,o,c):t==__?curry5ResolveArg1(r,e,n,o,c):n==__?curry5ResolveArg2(r,e,t,o,c):o==__?curry5ResolveArg3(r,e,t,n,c):curry5ResolveArg4(r,e,t,n,o)},objectKeys=Object.keys,objectReduceAsync=async function(r,e,t,n,o){const c=n.length;for(;++o<c;){const c=n[o];t=e(t,r[c],c,r),isPromise(t)&&(t=await t)}return t},objectReduce=function(r,e,t){const n=objectKeys(r),o=n.length;let c=-1;for(void 0===t&&(t=r[n[++c]]);++c<o;){const o=n[c];if(t=e(t,r[o],o,r),isPromise(t))return t.then((s=objectReduceAsync,u=e,a=__,l=n,y=c,(i=r)==__?curry5ResolveArg0(s,u,a,l,y):u==__?curry5ResolveArg1(s,i,a,l,y):a==__?curry5ResolveArg2(s,i,u,l,y):l==__?curry5ResolveArg3(s,i,u,a,y):curry5ResolveArg4(s,i,u,a,l)))}var s,i,u,a,l,y;return t},mapReduceAsync=async function(r,e,t,n){for(const[o,c]of n)t=e(t,c,o,r),isPromise(t)&&(t=await t);return t},mapReduce=function(r,e,t){const n=r.entries();if(void 0===t){const r=n.next();if(r.done)return t;t=r.value[1]}for(const[o,c]of n)if(t=e(t,c,o,r),isPromise(t))return t.then(curry4(mapReduceAsync,r,e,__,n));return t},reducerConcat=(r,e)=>function(t,n){const o=r(t,n);return isPromise(o)?o.then(curry2(e,__,n)):e(o,n)},genericReduce=function(r,e,t){return isArray(r)?arrayReduce(r,e,t):null==r?void 0===t?curry2(e,r,__):e(t,r):r.constructor==Map?mapReduce(r,e,t):"function"==typeof r[symbolIterator]?iteratorReduce(r[symbolIterator](),e,t):"function"==typeof r[symbolAsyncIterator]?asyncIteratorReduce(r[symbolAsyncIterator](),e,t):"function"==typeof r.reduce?r.reduce(e,t):"function"==typeof r.chain?r.chain(curry2(e,t,__)):"function"==typeof r.flatMap?r.flatMap(curry2(e,t,__)):r.constructor==Object?objectReduce(r,e,t):void 0===t?curry2(e,r,__):e(t,r)},arrayPush=function(r,e){return r.push(e),r},FlatMappingIterator=function(r,e){let t=[],n=0;return{[symbolIterator](){return this},next(){if(n<t.length){const r=t[n];return n+=1,{value:r,done:!1}}const o=r.next();if(o.done)return o;const c=genericReduce(e(o.value),arrayPush,[]);return c.length>1&&(t=c,n=1),{value:c[0],done:!1}}}},promiseRace=Promise.race.bind(Promise),sleep=r=>new Promise((e=>{setTimeout(e,r)})),FlatMappingAsyncIterator=function(r,e){const t=[],n=new Set;return{isAsyncIteratorDone:!1,[symbolAsyncIterator](){return this},toString:()=>"[object FlatMappingAsyncIterator]",async next(){for(;!this.isAsyncIteratorDone||t.length>0||n.size>0;){if(!this.isAsyncIteratorDone){const{value:o,done:c}=await r.next();if(c)this.isAsyncIteratorDone=c;else{const r=e(o);if(isPromise(r)){const e=r.then(curry3(genericReduce,__,arrayPush,t)).then((()=>n.delete(e)));n.add(e)}else{const e=genericReduce(r,arrayPush,t);if(isPromise(e)){const r=e.then((()=>n.delete(r)));n.add(r)}}}}if(t.length>0)return{value:t.shift(),done:!1};n.size>0&&await promiseRace([sleep(1e3),...n])}return{value:void 0,done:!0}}}},always=r=>function(){return r},getArg1=(r,e)=>e,identity=r=>r,promiseAll=Promise.all.bind(Promise),funcConcatSync=(r,e)=>function(...t){return e(r(...t))},asyncIteratorForEach=async function(r,e){const t=[];for await(const n of r){const r=e(n);isPromise(r)&&t.push(r)}return 0==t.length?r:promiseAll(t).then(always(r))},arrayFlatten=function(r){const e=r.length,t=[],n=[];let o=-1;for(;++o<e;){const e=r[o];if(isArray(e)){const r=e.length;let t=-1;for(;++t<r;)n.push(e[t])}else if(null==e)n.push(e);else if("function"==typeof e.then)t.push(e.then(curry2(arrayPush,n,__)));else if("function"==typeof e[symbolIterator])for(const r of e)n.push(r);else if("function"==typeof e[symbolAsyncIterator])t.push(asyncIteratorForEach(e[symbolAsyncIterator](),curry2(arrayPush,n,__)));else if("function"==typeof e.chain){const r=e.chain(identity);isPromise(r)?t.push(r.then(curry2(arrayPush,n,__))):n.push(r)}else if("function"==typeof e.flatMap){const r=e.flatMap(identity);isPromise(r)?t.push(r.then(curry2(arrayPush,n,__))):n.push(r)}else if("function"==typeof e.reduce){const r=e.reduce(funcConcatSync(getArg1,curry2(arrayPush,n,__)),null);isPromise(r)&&t.push(r)}else if(e.constructor==Object)for(const r in e)n.push(e[r]);else n.push(e)}return 0==t.length?n:promiseAll(t).then(always(n))},arrayMap=function(r,e){const t=r.length,n=Array(t);let o=-1,c=!1;for(;++o<t;){const t=e(r[o],o,r);isPromise(t)&&(c=!0),n[o]=t}return c?promiseAll(n):n},arrayFlatMap=function(r,e){const t=arrayMap(r,e);return isPromise(t)?t.then(arrayFlatten):arrayFlatten(t)},promiseObjectAllExecutor=r=>function(e){const t={};let n=0;for(const o in r){const c=r[o];isPromise(c)?(n+=1,c.then((r=>function(o){t[r]=o,n-=1,0==n&&e(t)})(o))):t[o]=c}0==n&&e(t)},promiseObjectAll=r=>new Promise(promiseObjectAllExecutor(r)),objectMap=function(r,e){const t={};let n=!1;for(const o in r){const c=e(r[o],o,r);isPromise(c)&&(n=!0),t[o]=c}return n?promiseObjectAll(t):t},objectAssign=Object.assign,objectFlatten=function(r){const e=[],t={},n=curry2(objectAssign,t,__),o=funcConcatSync(getArg1,n);for(const c in r){const s=r[c];if(null!=s)if("function"==typeof s[symbolIterator])for(const r of s)objectAssign(t,r);else if("function"==typeof s[symbolAsyncIterator])e.push(asyncIteratorForEach(s[symbolAsyncIterator](),n));else if("function"==typeof s.chain){const r=s.chain(identity);isPromise(r)?e.push(r.then(n)):objectAssign(t,r)}else if("function"==typeof s.flatMap){const r=s.flatMap(identity);isPromise(r)?e.push(r.then(n)):n(r)}else if("function"==typeof s.reduce){const r=s.reduce(o,null);isPromise(r)&&e.push(r)}else objectAssign(t,s)}return 0==e.length?t:promiseAll(e).then((()=>t))},objectFlatMap=function(r,e){const t=objectMap(r,e);return isPromise(t)?t.then(objectFlatten):objectFlatten(t)},callPropUnary=(r,e,t)=>r[e](t),setMap=function(r,e){const t=new Set,n=[];for(const o of r){const c=e(o,o,r);isPromise(c)?n.push(c.then(curry3(callPropUnary,t,"add",__))):t.add(c)}return 0==n.length?t:promiseAll(n).then(always(t))},setFlatten=function(r){r.size;const e=[],t=new Set,n=(r,e)=>t.add(e),o=curry3(callPropUnary,t,"add",__);for(const c of r)if(isArray(c)){const r=c.length;let e=-1;for(;++e<r;)t.add(c[e])}else if(null==c)t.add(c);else if("function"==typeof c[symbolIterator])for(const r of c)t.add(r);else if("function"==typeof c[symbolAsyncIterator])e.push(asyncIteratorForEach(c[symbolAsyncIterator](),o));else if("function"==typeof c.chain){const r=c.chain(identity);isPromise(r)?e.push(r.then(o)):t.add(r)}else if("function"==typeof c.flatMap){const r=c.flatMap(identity);isPromise(r)?e.push(r.then(o)):t.add(r)}else if("function"==typeof c.reduce){const r=c.reduce(n,null);isPromise(r)&&e.push(r)}else if(c.constructor==Object)for(const r in c)t.add(c[r]);else t.add(c);return 0==e.length?t:promiseAll(e).then((()=>t))},setFlatMap=function(r,e){const t=setMap(r,e);return isPromise(t)?t.then(setFlatten):setFlatten(t)},funcConcat=(r,e)=>function(...t){const n=r(...t);return isPromise(n)?n.then(e):e(n)},arrayJoin=(r,e)=>r.join(e),arrayFlattenToString=funcConcat(arrayFlatten,curry2(arrayJoin,__,"")),stringFlatMap=function(r,e){const t=arrayMap(r,e);return isPromise(t)?t.then(arrayFlattenToString):arrayFlattenToString(t)},_flatMap=function(r,e){if(isArray(r))return arrayFlatMap(r,e);if(null==r)return e(r);if("function"==typeof r.then)return r.then(e);if("function"==typeof r.next)return symbolIterator in r?FlatMappingIterator(r,e):FlatMappingAsyncIterator(r,e);if("function"==typeof r.chain)return r.chain(e);if("function"==typeof r.flatMap)return r.flatMap(e);const t=r.constructor;return t==Object?objectFlatMap(r,e):t==Set?setFlatMap(r,e):"string"==typeof r||t==String?stringFlatMap(r,e):e(r)},flatMap=(...r)=>{const e=r.pop();if(0==r.length)return curry2(_flatMap,__,e);const t=r[0];return isPromise(t)?t.then(curry2(_flatMap,__,e)):_flatMap(r[0],e)};export default flatMap;
package/dist/flatMap.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/flatMap.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,__=Symbol.for("placeholder"),curry2ResolveArg0=(r,o)=>function(t){return r(t,o)},curry2ResolveArg1=(r,o)=>function(t){return r(o,t)},curry2=function(r,o,t){return o==__?curry2ResolveArg0(r,t):curry2ResolveArg1(r,o)},isArray=Array.isArray,objectProto=Object.prototype,nativeObjectToString=objectProto.toString,objectToString=r=>nativeObjectToString.call(r),generatorFunctionTag="[object GeneratorFunction]",isGeneratorFunction=r=>objectToString(r)==generatorFunctionTag,asyncGeneratorFunctionTag="[object AsyncGeneratorFunction]",isAsyncGeneratorFunction=r=>objectToString(r)==asyncGeneratorFunctionTag,promiseAll=Promise.all.bind(Promise),always=r=>function(){return r},arrayForEach=function(r,o){const t=r.length,n=[];let e=-1;for(;++e<t;){const t=o(r[e]);isPromise(t)&&n.push(t)}return 0==n.length?r:promiseAll(n).then(always(r))},objectForEach=function(r,o){const t=[];for(const n in r){const e=o(r[n]);isPromise(e)&&t.push(e)}return 0==t.length?r:promiseAll(t).then(always(r))},iteratorForEach=function(r,o){const t=[];for(const n of r){const r=o(n);isPromise(r)&&t.push(r)}return 0==t.length?r:promiseAll(t).then(always(r))},asyncIteratorForEach=async function(r,o){const t=[];for await(const n of r){const r=o(n);isPromise(r)&&t.push(r)}return 0==t.length?r:promiseAll(t).then(always(r))},symbolIterator=Symbol.iterator,symbolAsyncIterator=Symbol.asyncIterator,_forEach=function(r,o){return isArray(r)?arrayForEach(r,o):null==r?r:"function"==typeof r.forEach?r.forEach(o):"function"==typeof r[symbolIterator]?iteratorForEach(r[symbolIterator](),o):"function"==typeof r[symbolAsyncIterator]?asyncIteratorForEach(r[symbolAsyncIterator](),o):r.constructor==Object?objectForEach(r,o):r},forEach=function(...r){const o=r.pop();if(0==r.length)return curry2(_forEach,__,o);const t=r[0];return isPromise(t)?t.then(curry2(_forEach,__,o)):_forEach(t,o)};export default forEach;
package/dist/forEach.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/forEach.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/get.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
 
@@ -118,13 +118,13 @@ const _get = function (object, path, defaultValue) {
118
118
  }
119
119
 
120
120
  const get = function (arg0, arg1, arg2) {
121
+ if (typeof arg0 == 'string' || typeof arg0 == 'number' || isArray(arg0)) {
122
+ return curry3(_get, __, arg0, arg1)
123
+ }
121
124
  if (isPromise(arg0)) {
122
125
  return arg0.then(curry3(_get, __, arg1, arg2))
123
126
  }
124
- if (isObject(arg0) && !isArray(arg0)) {
125
- return _get(arg0, arg1, arg2)
126
- }
127
- return curry3(_get, __, arg0, arg1)
127
+ return _get(arg0, arg1, arg2)
128
128
  }
129
129
 
130
130
  export default get
@@ -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,__=Symbol.for("placeholder"),curry3ResolveArg0=(r,e,t)=>function(n){return r(n,e,t)},curry3ResolveArg1=(r,e,t)=>function(n){return r(e,n,t)},curry3ResolveArg2=(r,e,t)=>function(n){return r(e,t,n)},curry3=function(r,e,t,n){return e==__?curry3ResolveArg0(r,t,n):t==__?curry3ResolveArg1(r,e,n):curry3ResolveArg2(r,e,t)},isArray=Array.isArray,isObject=r=>{if(null==r)return!1;const e=typeof r;return"object"==e||"function"==e},memoizeCappedUnary=function(r,e){const t=new Map,n=function(n){if(t.has(n))return t.get(n);const o=r(n);return t.set(n,o),t.size>e&&t.clear(),o};return n.cache=t,n},pathDelimiters=/[.|[|\]]+/,parsePropertyPath=function(r){const e=r.length-1,t="["==r[0],n="]"==r[e];return t&&n?r.slice(1,e).split(pathDelimiters):t?r.slice(1).split(pathDelimiters):n?r.slice(0,e).split(pathDelimiters):r.split(pathDelimiters)},memoizedCappedParsePropertyPath=memoizeCappedUnary(parsePropertyPath,500),propertyPathToArray=r=>isArray(r)?r:"string"==typeof r?memoizedCappedParsePropertyPath(r):[r],getByPath=function(r,e){const t=propertyPathToArray(e),n=t.length;let o=-1,i=r;for(;++o<n;)if(i=i[t[o]],null==i)return;return i},_get=function(r,e,t){const n=null==r?void 0:getByPath(r,e);return void 0===n?"function"==typeof t?t(r):t:n},get=function(r,e,t){return null!=(n=r)&&"function"==typeof n.then?r.then(curry3(_get,__,e,t)):isObject(r)&&!isArray(r)?_get(r,e,t):curry3(_get,__,r,e);var n};export default get;
7
+ const isPromise=r=>null!=r&&"function"==typeof r.then,__=Symbol.for("placeholder"),curry3ResolveArg0=(r,e,t)=>function(n){return r(n,e,t)},curry3ResolveArg1=(r,e,t)=>function(n){return r(e,n,t)},curry3ResolveArg2=(r,e,t)=>function(n){return r(e,t,n)},curry3=function(r,e,t,n){return e==__?curry3ResolveArg0(r,t,n):t==__?curry3ResolveArg1(r,e,n):curry3ResolveArg2(r,e,t)},isArray=Array.isArray,isObject=r=>{if(null==r)return!1;const e=typeof r;return"object"==e||"function"==e},memoizeCappedUnary=function(r,e){const t=new Map,n=function(n){if(t.has(n))return t.get(n);const o=r(n);return t.set(n,o),t.size>e&&t.clear(),o};return n.cache=t,n},pathDelimiters=/[.|[|\]]+/,parsePropertyPath=function(r){const e=r.length-1,t="["==r[0],n="]"==r[e];return t&&n?r.slice(1,e).split(pathDelimiters):t?r.slice(1).split(pathDelimiters):n?r.slice(0,e).split(pathDelimiters):r.split(pathDelimiters)},memoizedCappedParsePropertyPath=memoizeCappedUnary(parsePropertyPath,500),propertyPathToArray=r=>isArray(r)?r:"string"==typeof r?memoizedCappedParsePropertyPath(r):[r],getByPath=function(r,e){const t=propertyPathToArray(e),n=t.length;let o=-1,i=r;for(;++o<n;)if(i=i[t[o]],null==i)return;return i},_get=function(r,e,t){const n=null==r?void 0:getByPath(r,e);return void 0===n?"function"==typeof t?t(r):t:n},get=function(r,e,t){return"string"==typeof r||"number"==typeof r||isArray(r)?curry3(_get,__,r,e):null!=(n=r)&&"function"==typeof n.then?r.then(curry3(_get,__,e,t)):_get(r,e,t);var n};export default get;
package/dist/get.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
 
@@ -124,13 +124,13 @@ const _get = function (object, path, defaultValue) {
124
124
  }
125
125
 
126
126
  const get = function (arg0, arg1, arg2) {
127
+ if (typeof arg0 == 'string' || typeof arg0 == 'number' || isArray(arg0)) {
128
+ return curry3(_get, __, arg0, arg1)
129
+ }
127
130
  if (isPromise(arg0)) {
128
131
  return arg0.then(curry3(_get, __, arg1, arg2))
129
132
  }
130
- if (isObject(arg0) && !isArray(arg0)) {
131
- return _get(arg0, arg1, arg2)
132
- }
133
- return curry3(_get, __, arg0, arg1)
133
+ return _get(arg0, arg1, arg2)
134
134
  }
135
135
 
136
136
  return get
package/dist/get.min.js CHANGED
@@ -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.get=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=Symbol.for("placeholder"),t=function(t,e,o,r){return e==n?((n,t,e)=>function(o){return n(o,t,e)})(t,o,r):o==n?((n,t,e)=>function(o){return n(t,o,e)})(t,e,r):((n,t,e)=>function(o){return n(t,e,o)})(t,e,o)},e=Array.isArray,o=/[.|[|\]]+/,r=function(n,t){const e=new Map,o=function(o){if(e.has(o))return e.get(o);const r=n(o);return e.set(o,r),e.size>t&&e.clear(),r};return o.cache=e,o}((function(n){const t=n.length-1,e="["==n[0],r="]"==n[t];return e&&r?n.slice(1,t).split(o):e?n.slice(1).split(o):r?n.slice(0,t).split(o):n.split(o)}),500),u=function(n,t){const o=(n=>e(n)?n:"string"==typeof n?r(n):[n])(t),u=o.length;let i=-1,c=n;for(;++i<u;)if(c=c[o[i]],null==c)return;return c},i=function(n,t,e){const o=null==n?void 0:u(n,t);return void 0===o?"function"==typeof e?e(n):e:o};return function(o,r,u){return null!=(c=o)&&"function"==typeof c.then?o.then(t(i,n,r,u)):(n=>{if(null==n)return!1;const t=typeof n;return"object"==t||"function"==t})(o)&&!e(o)?i(o,r,u):t(i,n,o,r);var c}}());
8
+ !function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((()=>t)):n.get=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=Symbol.for("placeholder"),t=function(t,e,o,r){return e==n?((n,t,e)=>function(o){return n(o,t,e)})(t,o,r):o==n?((n,t,e)=>function(o){return n(t,o,e)})(t,e,r):((n,t,e)=>function(o){return n(t,e,o)})(t,e,o)},e=Array.isArray,o=/[.|[|\]]+/,r=function(n,t){const e=new Map,o=function(o){if(e.has(o))return e.get(o);const r=n(o);return e.set(o,r),e.size>t&&e.clear(),r};return o.cache=e,o}((function(n){const t=n.length-1,e="["==n[0],r="]"==n[t];return e&&r?n.slice(1,t).split(o):e?n.slice(1).split(o):r?n.slice(0,t).split(o):n.split(o)}),500),i=function(n,t){const o=(n=>e(n)?n:"string"==typeof n?r(n):[n])(t),i=o.length;let u=-1,c=n;for(;++u<i;)if(c=c[o[u]],null==c)return;return c},u=function(n,t,e){const o=null==n?void 0:i(n,t);return void 0===o?"function"==typeof e?e(n):e:o};return function(o,r,i){return"string"==typeof o||"number"==typeof o||e(o)?t(u,n,o,r):null!=(c=o)&&"function"==typeof c.then?o.then(t(u,n,r,i)):u(o,r,i);var c}}());
package/dist/get.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
 
@@ -118,13 +118,13 @@ const _get = function (object, path, defaultValue) {
118
118
  }
119
119
 
120
120
  const get = function (arg0, arg1, arg2) {
121
+ if (typeof arg0 == 'string' || typeof arg0 == 'number' || isArray(arg0)) {
122
+ return curry3(_get, __, arg0, arg1)
123
+ }
121
124
  if (isPromise(arg0)) {
122
125
  return arg0.then(curry3(_get, __, arg1, arg2))
123
126
  }
124
- if (isObject(arg0) && !isArray(arg0)) {
125
- return _get(arg0, arg1, arg2)
126
- }
127
- return curry3(_get, __, arg0, arg1)
127
+ return _get(arg0, arg1, arg2)
128
128
  }
129
129
 
130
130
  export default get
package/dist/gt.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
 
package/dist/gt.es.min.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
  const isPromise=r=>null!=r&&"function"==typeof r.then,areAnyValuesPromises=function(r){const e=r.length;let o=-1;for(;++o<e;){const e=r[o];if(isPromise(e))return!0}return!1},__=Symbol.for("placeholder"),curry4ResolveArg0=(r,e,o,s)=>function(t){return r(t,e,o,s)},curry4ResolveArg1=(r,e,o,s)=>function(t){return r(e,t,o,s)},curry4ResolveArg2=(r,e,o,s)=>function(t){return r(e,o,t,s)},curry4ResolveArg3=(r,e,o,s)=>function(t){return r(e,o,s,t)},curry4=function(r,e,o,s,t){return e==__?curry4ResolveArg0(r,o,s,t):o==__?curry4ResolveArg1(r,e,s,t):s==__?curry4ResolveArg2(r,e,o,t):curry4ResolveArg3(r,e,o,s)},curryArgs4ResolveArgs0=(r,e,o,s)=>function(...t){return r(t,e,o,s)},curryArgs4ResolveArgs1=(r,e,o,s)=>function(...t){return r(e,t,o,s)},curryArgs4ResolveArgs2=(r,e,o,s)=>function(...t){return r(e,o,t,s)},curryArgs4ResolveArgs3=(r,e,o,s)=>function(...t){return r(e,o,s,t)},curryArgs4=function(r,e,o,s,t){return e==__?curryArgs4ResolveArgs0(r,o,s,t):o==__?curryArgs4ResolveArgs1(r,e,s,t):s==__?curryArgs4ResolveArgs2(r,e,o,t):curryArgs4ResolveArgs3(r,e,o,s)},spread2=r=>function([e,o]){return r(e,o)},promiseAll=Promise.all.bind(Promise),leftResolverRightResolverCompare=function(r,e,o,s){const t=o(...r),l=s(...r);return isPromise(t)||isPromise(l)?promiseAll([t,l]).then(spread2(e)):e(t,l)},leftResolverRightValueCompare=function(r,e,o,s){const t=o(...r);return isPromise(t)||isPromise(s)?promiseAll([t,s]).then(spread2(e)):e(t,s)},leftValueRightResolverCompare=function(r,e,o,s){const t=s(...r);return isPromise(o)||isPromise(t)?promiseAll([o,t]).then(spread2(e)):e(o,t)},ComparisonOperator=r=>function(...e){const o=e.pop(),s=e.pop(),t="function"==typeof s,l="function"==typeof o;return t&&l?0==e.length?curryArgs4(leftResolverRightResolverCompare,__,r,s,o):areAnyValuesPromises(e)?promiseAll(e).then(curry4(leftResolverRightResolverCompare,__,r,s,o)):leftResolverRightResolverCompare(e,r,s,o):t?0==e.length?curryArgs4(leftResolverRightValueCompare,__,r,s,o):areAnyValuesPromises(e)?promiseAll(e).then(curry4(leftResolverRightValueCompare,__,r,s,o)):leftResolverRightValueCompare(e,r,s,o):l?0==e.length?curryArgs4(leftValueRightResolverCompare,__,r,s,o):areAnyValuesPromises(e)?promiseAll(e).then(curry4(leftValueRightResolverCompare,__,r,s,o)):leftValueRightResolverCompare(e,r,s,o):isPromise(s)||isPromise(o)?promiseAll([s,o]).then(spread2(r)):r(s,o)},greaterThan=(r,e)=>r>e,gt=ComparisonOperator(greaterThan);export default gt;
package/dist/gt.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
 
package/dist/gt.min.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
 
package/dist/gt.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/gte.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,areAnyValuesPromises=function(r){const e=r.length;let o=-1;for(;++o<e;){const e=r[o];if(isPromise(e))return!0}return!1},__=Symbol.for("placeholder"),curry4ResolveArg0=(r,e,o,s)=>function(t){return r(t,e,o,s)},curry4ResolveArg1=(r,e,o,s)=>function(t){return r(e,t,o,s)},curry4ResolveArg2=(r,e,o,s)=>function(t){return r(e,o,t,s)},curry4ResolveArg3=(r,e,o,s)=>function(t){return r(e,o,s,t)},curry4=function(r,e,o,s,t){return e==__?curry4ResolveArg0(r,o,s,t):o==__?curry4ResolveArg1(r,e,s,t):s==__?curry4ResolveArg2(r,e,o,t):curry4ResolveArg3(r,e,o,s)},curryArgs4ResolveArgs0=(r,e,o,s)=>function(...t){return r(t,e,o,s)},curryArgs4ResolveArgs1=(r,e,o,s)=>function(...t){return r(e,t,o,s)},curryArgs4ResolveArgs2=(r,e,o,s)=>function(...t){return r(e,o,t,s)},curryArgs4ResolveArgs3=(r,e,o,s)=>function(...t){return r(e,o,s,t)},curryArgs4=function(r,e,o,s,t){return e==__?curryArgs4ResolveArgs0(r,o,s,t):o==__?curryArgs4ResolveArgs1(r,e,s,t):s==__?curryArgs4ResolveArgs2(r,e,o,t):curryArgs4ResolveArgs3(r,e,o,s)},spread2=r=>function([e,o]){return r(e,o)},promiseAll=Promise.all.bind(Promise),leftResolverRightResolverCompare=function(r,e,o,s){const t=o(...r),l=s(...r);return isPromise(t)||isPromise(l)?promiseAll([t,l]).then(spread2(e)):e(t,l)},leftResolverRightValueCompare=function(r,e,o,s){const t=o(...r);return isPromise(t)||isPromise(s)?promiseAll([t,s]).then(spread2(e)):e(t,s)},leftValueRightResolverCompare=function(r,e,o,s){const t=s(...r);return isPromise(o)||isPromise(t)?promiseAll([o,t]).then(spread2(e)):e(o,t)},ComparisonOperator=r=>function(...e){const o=e.pop(),s=e.pop(),t="function"==typeof s,l="function"==typeof o;return t&&l?0==e.length?curryArgs4(leftResolverRightResolverCompare,__,r,s,o):areAnyValuesPromises(e)?promiseAll(e).then(curry4(leftResolverRightResolverCompare,__,r,s,o)):leftResolverRightResolverCompare(e,r,s,o):t?0==e.length?curryArgs4(leftResolverRightValueCompare,__,r,s,o):areAnyValuesPromises(e)?promiseAll(e).then(curry4(leftResolverRightValueCompare,__,r,s,o)):leftResolverRightValueCompare(e,r,s,o):l?0==e.length?curryArgs4(leftValueRightResolverCompare,__,r,s,o):areAnyValuesPromises(e)?promiseAll(e).then(curry4(leftValueRightResolverCompare,__,r,s,o)):leftValueRightResolverCompare(e,r,s,o):isPromise(s)||isPromise(o)?promiseAll([s,o]).then(spread2(r)):r(s,o)},greaterThanOrEqual=(r,e)=>r>=e,gte=ComparisonOperator(greaterThanOrEqual);export default gte;
package/dist/gte.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
 
package/dist/gte.min.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
 
package/dist/gte.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/lt.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
 
package/dist/lt.es.min.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
  const isPromise=r=>null!=r&&"function"==typeof r.then,areAnyValuesPromises=function(r){const e=r.length;let s=-1;for(;++s<e;){const e=r[s];if(isPromise(e))return!0}return!1},__=Symbol.for("placeholder"),curry4ResolveArg0=(r,e,s,o)=>function(l){return r(l,e,s,o)},curry4ResolveArg1=(r,e,s,o)=>function(l){return r(e,l,s,o)},curry4ResolveArg2=(r,e,s,o)=>function(l){return r(e,s,l,o)},curry4ResolveArg3=(r,e,s,o)=>function(l){return r(e,s,o,l)},curry4=function(r,e,s,o,l){return e==__?curry4ResolveArg0(r,s,o,l):s==__?curry4ResolveArg1(r,e,o,l):o==__?curry4ResolveArg2(r,e,s,l):curry4ResolveArg3(r,e,s,o)},curryArgs4ResolveArgs0=(r,e,s,o)=>function(...l){return r(l,e,s,o)},curryArgs4ResolveArgs1=(r,e,s,o)=>function(...l){return r(e,l,s,o)},curryArgs4ResolveArgs2=(r,e,s,o)=>function(...l){return r(e,s,l,o)},curryArgs4ResolveArgs3=(r,e,s,o)=>function(...l){return r(e,s,o,l)},curryArgs4=function(r,e,s,o,l){return e==__?curryArgs4ResolveArgs0(r,s,o,l):s==__?curryArgs4ResolveArgs1(r,e,o,l):o==__?curryArgs4ResolveArgs2(r,e,s,l):curryArgs4ResolveArgs3(r,e,s,o)},spread2=r=>function([e,s]){return r(e,s)},promiseAll=Promise.all.bind(Promise),leftResolverRightResolverCompare=function(r,e,s,o){const l=s(...r),t=o(...r);return isPromise(l)||isPromise(t)?promiseAll([l,t]).then(spread2(e)):e(l,t)},leftResolverRightValueCompare=function(r,e,s,o){const l=s(...r);return isPromise(l)||isPromise(o)?promiseAll([l,o]).then(spread2(e)):e(l,o)},leftValueRightResolverCompare=function(r,e,s,o){const l=o(...r);return isPromise(s)||isPromise(l)?promiseAll([s,l]).then(spread2(e)):e(s,l)},ComparisonOperator=r=>function(...e){const s=e.pop(),o=e.pop(),l="function"==typeof o,t="function"==typeof s;return l&&t?0==e.length?curryArgs4(leftResolverRightResolverCompare,__,r,o,s):areAnyValuesPromises(e)?promiseAll(e).then(curry4(leftResolverRightResolverCompare,__,r,o,s)):leftResolverRightResolverCompare(e,r,o,s):l?0==e.length?curryArgs4(leftResolverRightValueCompare,__,r,o,s):areAnyValuesPromises(e)?promiseAll(e).then(curry4(leftResolverRightValueCompare,__,r,o,s)):leftResolverRightValueCompare(e,r,o,s):t?0==e.length?curryArgs4(leftValueRightResolverCompare,__,r,o,s):areAnyValuesPromises(e)?promiseAll(e).then(curry4(leftValueRightResolverCompare,__,r,o,s)):leftValueRightResolverCompare(e,r,o,s):isPromise(o)||isPromise(s)?promiseAll([o,s]).then(spread2(r)):r(o,s)},lessThan=(r,e)=>r<e,lt=ComparisonOperator(lessThan);export default lt;
package/dist/lt.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
 
package/dist/lt.min.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
 
package/dist/lt.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/lte.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,areAnyValuesPromises=function(r){const e=r.length;let s=-1;for(;++s<e;){const e=r[s];if(isPromise(e))return!0}return!1},__=Symbol.for("placeholder"),curry4ResolveArg0=(r,e,s,o)=>function(l){return r(l,e,s,o)},curry4ResolveArg1=(r,e,s,o)=>function(l){return r(e,l,s,o)},curry4ResolveArg2=(r,e,s,o)=>function(l){return r(e,s,l,o)},curry4ResolveArg3=(r,e,s,o)=>function(l){return r(e,s,o,l)},curry4=function(r,e,s,o,l){return e==__?curry4ResolveArg0(r,s,o,l):s==__?curry4ResolveArg1(r,e,o,l):o==__?curry4ResolveArg2(r,e,s,l):curry4ResolveArg3(r,e,s,o)},curryArgs4ResolveArgs0=(r,e,s,o)=>function(...l){return r(l,e,s,o)},curryArgs4ResolveArgs1=(r,e,s,o)=>function(...l){return r(e,l,s,o)},curryArgs4ResolveArgs2=(r,e,s,o)=>function(...l){return r(e,s,l,o)},curryArgs4ResolveArgs3=(r,e,s,o)=>function(...l){return r(e,s,o,l)},curryArgs4=function(r,e,s,o,l){return e==__?curryArgs4ResolveArgs0(r,s,o,l):s==__?curryArgs4ResolveArgs1(r,e,o,l):o==__?curryArgs4ResolveArgs2(r,e,s,l):curryArgs4ResolveArgs3(r,e,s,o)},spread2=r=>function([e,s]){return r(e,s)},promiseAll=Promise.all.bind(Promise),leftResolverRightResolverCompare=function(r,e,s,o){const l=s(...r),t=o(...r);return isPromise(l)||isPromise(t)?promiseAll([l,t]).then(spread2(e)):e(l,t)},leftResolverRightValueCompare=function(r,e,s,o){const l=s(...r);return isPromise(l)||isPromise(o)?promiseAll([l,o]).then(spread2(e)):e(l,o)},leftValueRightResolverCompare=function(r,e,s,o){const l=o(...r);return isPromise(s)||isPromise(l)?promiseAll([s,l]).then(spread2(e)):e(s,l)},ComparisonOperator=r=>function(...e){const s=e.pop(),o=e.pop(),l="function"==typeof o,t="function"==typeof s;return l&&t?0==e.length?curryArgs4(leftResolverRightResolverCompare,__,r,o,s):areAnyValuesPromises(e)?promiseAll(e).then(curry4(leftResolverRightResolverCompare,__,r,o,s)):leftResolverRightResolverCompare(e,r,o,s):l?0==e.length?curryArgs4(leftResolverRightValueCompare,__,r,o,s):areAnyValuesPromises(e)?promiseAll(e).then(curry4(leftResolverRightValueCompare,__,r,o,s)):leftResolverRightValueCompare(e,r,o,s):t?0==e.length?curryArgs4(leftValueRightResolverCompare,__,r,o,s):areAnyValuesPromises(e)?promiseAll(e).then(curry4(leftValueRightResolverCompare,__,r,o,s)):leftValueRightResolverCompare(e,r,o,s):isPromise(o)||isPromise(s)?promiseAll([o,s]).then(spread2(r)):r(o,s)},lessThanOrEqual=(r,e)=>r<=e,lte=ComparisonOperator(lessThanOrEqual);export default lte;
package/dist/lte.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
 
package/dist/lte.min.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
 
package/dist/lte.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/map.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
 
@@ -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, __),