rubico 2.3.1 → 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 (340) hide show
  1. package/README.md +9 -0
  2. package/_internal/arrayMapSeries.js +4 -4
  3. package/_internal/findAllFilePaths.js +2 -4
  4. package/dist/Transducer.es.js +2 -2
  5. package/dist/Transducer.es.min.js +2 -2
  6. package/dist/Transducer.js +2 -2
  7. package/dist/Transducer.min.js +2 -2
  8. package/dist/Transducer.mjs +2 -2
  9. package/dist/__.es.js +2 -2
  10. package/dist/__.es.min.js +2 -2
  11. package/dist/__.js +2 -2
  12. package/dist/__.min.js +2 -2
  13. package/dist/__.mjs +2 -2
  14. package/dist/all.es.js +2 -2
  15. package/dist/all.es.min.js +2 -2
  16. package/dist/all.js +2 -2
  17. package/dist/all.min.js +2 -2
  18. package/dist/all.mjs +2 -2
  19. package/dist/always.es.js +2 -2
  20. package/dist/always.es.min.js +2 -2
  21. package/dist/always.js +2 -2
  22. package/dist/always.min.js +2 -2
  23. package/dist/always.mjs +2 -2
  24. package/dist/and.es.js +2 -2
  25. package/dist/and.es.min.js +2 -2
  26. package/dist/and.js +2 -2
  27. package/dist/and.min.js +2 -2
  28. package/dist/and.mjs +2 -2
  29. package/dist/assign.es.js +2 -2
  30. package/dist/assign.es.min.js +2 -2
  31. package/dist/assign.js +2 -2
  32. package/dist/assign.min.js +2 -2
  33. package/dist/assign.mjs +2 -2
  34. package/dist/compose.es.js +2 -2
  35. package/dist/compose.es.min.js +2 -2
  36. package/dist/compose.js +2 -2
  37. package/dist/compose.min.js +2 -2
  38. package/dist/compose.mjs +2 -2
  39. package/dist/curry.es.js +2 -2
  40. package/dist/curry.es.min.js +2 -2
  41. package/dist/curry.js +2 -2
  42. package/dist/curry.min.js +2 -2
  43. package/dist/curry.mjs +2 -2
  44. package/dist/eq.es.js +2 -2
  45. package/dist/eq.es.min.js +2 -2
  46. package/dist/eq.js +2 -2
  47. package/dist/eq.min.js +2 -2
  48. package/dist/eq.mjs +2 -2
  49. package/dist/every.es.js +2 -2
  50. package/dist/every.es.min.js +2 -2
  51. package/dist/every.js +2 -2
  52. package/dist/every.min.js +2 -2
  53. package/dist/every.mjs +2 -2
  54. package/dist/filter.es.js +2 -2
  55. package/dist/filter.es.min.js +2 -2
  56. package/dist/filter.js +2 -2
  57. package/dist/filter.min.js +2 -2
  58. package/dist/filter.mjs +2 -2
  59. package/dist/flatMap.es.js +2 -2
  60. package/dist/flatMap.es.min.js +2 -2
  61. package/dist/flatMap.js +2 -2
  62. package/dist/flatMap.min.js +2 -2
  63. package/dist/flatMap.mjs +2 -2
  64. package/dist/forEach.es.js +2 -2
  65. package/dist/forEach.es.min.js +2 -2
  66. package/dist/forEach.js +2 -2
  67. package/dist/forEach.min.js +2 -2
  68. package/dist/forEach.mjs +2 -2
  69. package/dist/get.es.js +6 -6
  70. package/dist/get.es.min.js +3 -3
  71. package/dist/get.js +6 -6
  72. package/dist/get.min.js +3 -3
  73. package/dist/get.mjs +6 -6
  74. package/dist/gt.es.js +2 -2
  75. package/dist/gt.es.min.js +2 -2
  76. package/dist/gt.js +2 -2
  77. package/dist/gt.min.js +2 -2
  78. package/dist/gt.mjs +2 -2
  79. package/dist/gte.es.js +2 -2
  80. package/dist/gte.es.min.js +2 -2
  81. package/dist/gte.js +2 -2
  82. package/dist/gte.min.js +2 -2
  83. package/dist/gte.mjs +2 -2
  84. package/dist/lt.es.js +2 -2
  85. package/dist/lt.es.min.js +2 -2
  86. package/dist/lt.js +2 -2
  87. package/dist/lt.min.js +2 -2
  88. package/dist/lt.mjs +2 -2
  89. package/dist/lte.es.js +2 -2
  90. package/dist/lte.es.min.js +2 -2
  91. package/dist/lte.js +2 -2
  92. package/dist/lte.min.js +2 -2
  93. package/dist/lte.mjs +2 -2
  94. package/dist/map.es.js +4 -4
  95. package/dist/map.es.min.js +3 -3
  96. package/dist/map.js +4 -4
  97. package/dist/map.min.js +3 -3
  98. package/dist/map.mjs +4 -4
  99. package/dist/not.es.js +2 -2
  100. package/dist/not.es.min.js +2 -2
  101. package/dist/not.js +2 -2
  102. package/dist/not.min.js +2 -2
  103. package/dist/not.mjs +2 -2
  104. package/dist/omit.es.js +2 -2
  105. package/dist/omit.es.min.js +2 -2
  106. package/dist/omit.js +2 -2
  107. package/dist/omit.min.js +2 -2
  108. package/dist/omit.mjs +2 -2
  109. package/dist/or.es.js +2 -2
  110. package/dist/or.es.min.js +2 -2
  111. package/dist/or.js +2 -2
  112. package/dist/or.min.js +2 -2
  113. package/dist/or.mjs +2 -2
  114. package/dist/pick.es.js +2 -2
  115. package/dist/pick.es.min.js +2 -2
  116. package/dist/pick.js +2 -2
  117. package/dist/pick.min.js +2 -2
  118. package/dist/pick.mjs +2 -2
  119. package/dist/pipe.es.js +2 -2
  120. package/dist/pipe.es.min.js +2 -2
  121. package/dist/pipe.js +2 -2
  122. package/dist/pipe.min.js +2 -2
  123. package/dist/pipe.mjs +2 -2
  124. package/dist/reduce.es.js +2 -2
  125. package/dist/reduce.es.min.js +2 -2
  126. package/dist/reduce.js +2 -2
  127. package/dist/reduce.min.js +2 -2
  128. package/dist/reduce.mjs +2 -2
  129. package/dist/rubico.es.js +8 -8
  130. package/dist/rubico.es.min.js +3 -3
  131. package/dist/rubico.global.js +8 -8
  132. package/dist/rubico.global.min.js +3 -3
  133. package/dist/rubico.js +8 -8
  134. package/dist/rubico.min.js +3 -3
  135. package/dist/rubico.mjs +8 -8
  136. package/dist/set.es.js +2 -2
  137. package/dist/set.es.min.js +2 -2
  138. package/dist/set.js +2 -2
  139. package/dist/set.min.js +2 -2
  140. package/dist/set.mjs +2 -2
  141. package/dist/some.es.js +2 -2
  142. package/dist/some.es.min.js +2 -2
  143. package/dist/some.js +2 -2
  144. package/dist/some.min.js +2 -2
  145. package/dist/some.mjs +2 -2
  146. package/dist/switchCase.es.js +2 -2
  147. package/dist/switchCase.es.min.js +2 -2
  148. package/dist/switchCase.js +2 -2
  149. package/dist/switchCase.min.js +2 -2
  150. package/dist/switchCase.mjs +2 -2
  151. package/dist/tap.es.js +2 -2
  152. package/dist/tap.es.min.js +2 -2
  153. package/dist/tap.js +2 -2
  154. package/dist/tap.min.js +2 -2
  155. package/dist/tap.mjs +2 -2
  156. package/dist/thunkify.es.js +2 -2
  157. package/dist/thunkify.es.min.js +2 -2
  158. package/dist/thunkify.js +2 -2
  159. package/dist/thunkify.min.js +2 -2
  160. package/dist/thunkify.mjs +2 -2
  161. package/dist/transform.es.js +2 -2
  162. package/dist/transform.es.min.js +2 -2
  163. package/dist/transform.js +2 -2
  164. package/dist/transform.min.js +2 -2
  165. package/dist/transform.mjs +2 -2
  166. package/dist/tryCatch.es.js +2 -2
  167. package/dist/tryCatch.es.min.js +2 -2
  168. package/dist/tryCatch.js +2 -2
  169. package/dist/tryCatch.min.js +2 -2
  170. package/dist/tryCatch.mjs +2 -2
  171. package/dist/x/append.es.js +2 -2
  172. package/dist/x/append.es.min.js +2 -2
  173. package/dist/x/append.js +2 -2
  174. package/dist/x/append.min.js +2 -2
  175. package/dist/x/append.mjs +2 -2
  176. package/dist/x/callProp.es.js +2 -2
  177. package/dist/x/callProp.es.min.js +2 -2
  178. package/dist/x/callProp.js +2 -2
  179. package/dist/x/callProp.min.js +2 -2
  180. package/dist/x/callProp.mjs +2 -2
  181. package/dist/x/defaultsDeep.es.js +2 -2
  182. package/dist/x/defaultsDeep.es.min.js +2 -2
  183. package/dist/x/defaultsDeep.js +2 -2
  184. package/dist/x/defaultsDeep.min.js +2 -2
  185. package/dist/x/defaultsDeep.mjs +2 -2
  186. package/dist/x/differenceWith.es.js +2 -2
  187. package/dist/x/differenceWith.es.min.js +2 -2
  188. package/dist/x/differenceWith.js +2 -2
  189. package/dist/x/differenceWith.min.js +2 -2
  190. package/dist/x/differenceWith.mjs +2 -2
  191. package/dist/x/filterOut.es.js +2 -2
  192. package/dist/x/filterOut.es.min.js +2 -2
  193. package/dist/x/filterOut.js +2 -2
  194. package/dist/x/filterOut.min.js +2 -2
  195. package/dist/x/filterOut.mjs +2 -2
  196. package/dist/x/find.es.js +2 -2
  197. package/dist/x/find.es.min.js +2 -2
  198. package/dist/x/find.js +2 -2
  199. package/dist/x/find.min.js +2 -2
  200. package/dist/x/find.mjs +2 -2
  201. package/dist/x/findIndex.es.js +2 -2
  202. package/dist/x/findIndex.es.min.js +2 -2
  203. package/dist/x/findIndex.js +2 -2
  204. package/dist/x/findIndex.min.js +2 -2
  205. package/dist/x/findIndex.mjs +2 -2
  206. package/dist/x/first.es.js +2 -2
  207. package/dist/x/first.es.min.js +2 -2
  208. package/dist/x/first.js +2 -2
  209. package/dist/x/first.min.js +2 -2
  210. package/dist/x/first.mjs +2 -2
  211. package/dist/x/flatten.es.js +2 -2
  212. package/dist/x/flatten.es.min.js +2 -2
  213. package/dist/x/flatten.js +2 -2
  214. package/dist/x/flatten.min.js +2 -2
  215. package/dist/x/flatten.mjs +2 -2
  216. package/dist/x/groupBy.es.js +2 -2
  217. package/dist/x/groupBy.es.min.js +2 -2
  218. package/dist/x/groupBy.js +2 -2
  219. package/dist/x/groupBy.min.js +2 -2
  220. package/dist/x/groupBy.mjs +2 -2
  221. package/dist/x/has.es.js +2 -2
  222. package/dist/x/has.es.min.js +2 -2
  223. package/dist/x/has.js +2 -2
  224. package/dist/x/has.min.js +2 -2
  225. package/dist/x/has.mjs +2 -2
  226. package/dist/x/identity.es.js +2 -2
  227. package/dist/x/identity.es.min.js +2 -2
  228. package/dist/x/identity.js +2 -2
  229. package/dist/x/identity.min.js +2 -2
  230. package/dist/x/identity.mjs +2 -2
  231. package/dist/x/includes.es.js +2 -2
  232. package/dist/x/includes.es.min.js +2 -2
  233. package/dist/x/includes.js +2 -2
  234. package/dist/x/includes.min.js +2 -2
  235. package/dist/x/includes.mjs +2 -2
  236. package/dist/x/isDeepEqual.es.js +2 -2
  237. package/dist/x/isDeepEqual.es.min.js +2 -2
  238. package/dist/x/isDeepEqual.js +2 -2
  239. package/dist/x/isDeepEqual.min.js +2 -2
  240. package/dist/x/isDeepEqual.mjs +2 -2
  241. package/dist/x/isEmpty.es.js +2 -2
  242. package/dist/x/isEmpty.es.min.js +2 -2
  243. package/dist/x/isEmpty.js +2 -2
  244. package/dist/x/isEmpty.min.js +2 -2
  245. package/dist/x/isEmpty.mjs +2 -2
  246. package/dist/x/isEqual.es.js +2 -2
  247. package/dist/x/isEqual.es.min.js +2 -2
  248. package/dist/x/isEqual.js +2 -2
  249. package/dist/x/isEqual.min.js +2 -2
  250. package/dist/x/isEqual.mjs +2 -2
  251. package/dist/x/isFunction.es.js +2 -2
  252. package/dist/x/isFunction.es.min.js +2 -2
  253. package/dist/x/isFunction.js +2 -2
  254. package/dist/x/isFunction.min.js +2 -2
  255. package/dist/x/isFunction.mjs +2 -2
  256. package/dist/x/isIn.es.js +2 -2
  257. package/dist/x/isIn.es.min.js +2 -2
  258. package/dist/x/isIn.js +2 -2
  259. package/dist/x/isIn.min.js +2 -2
  260. package/dist/x/isIn.mjs +2 -2
  261. package/dist/x/isObject.es.js +2 -2
  262. package/dist/x/isObject.es.min.js +2 -2
  263. package/dist/x/isObject.js +2 -2
  264. package/dist/x/isObject.min.js +2 -2
  265. package/dist/x/isObject.mjs +2 -2
  266. package/dist/x/isString.es.js +2 -2
  267. package/dist/x/isString.es.min.js +2 -2
  268. package/dist/x/isString.js +2 -2
  269. package/dist/x/isString.min.js +2 -2
  270. package/dist/x/isString.mjs +2 -2
  271. package/dist/x/keys.es.js +2 -2
  272. package/dist/x/keys.es.min.js +2 -2
  273. package/dist/x/keys.js +2 -2
  274. package/dist/x/keys.min.js +2 -2
  275. package/dist/x/keys.mjs +2 -2
  276. package/dist/x/last.es.js +2 -2
  277. package/dist/x/last.es.min.js +2 -2
  278. package/dist/x/last.js +2 -2
  279. package/dist/x/last.min.js +2 -2
  280. package/dist/x/last.mjs +2 -2
  281. package/dist/x/maxBy.es.js +6 -6
  282. package/dist/x/maxBy.es.min.js +3 -3
  283. package/dist/x/maxBy.js +6 -6
  284. package/dist/x/maxBy.min.js +3 -3
  285. package/dist/x/maxBy.mjs +6 -6
  286. package/dist/x/noop.es.js +2 -2
  287. package/dist/x/noop.es.min.js +2 -2
  288. package/dist/x/noop.js +2 -2
  289. package/dist/x/noop.min.js +2 -2
  290. package/dist/x/noop.mjs +2 -2
  291. package/dist/x/pluck.es.js +8 -8
  292. package/dist/x/pluck.es.min.js +3 -3
  293. package/dist/x/pluck.js +8 -8
  294. package/dist/x/pluck.min.js +3 -3
  295. package/dist/x/pluck.mjs +8 -8
  296. package/dist/x/prepend.es.js +2 -2
  297. package/dist/x/prepend.es.min.js +2 -2
  298. package/dist/x/prepend.js +2 -2
  299. package/dist/x/prepend.min.js +2 -2
  300. package/dist/x/prepend.mjs +2 -2
  301. package/dist/x/size.es.js +2 -2
  302. package/dist/x/size.es.min.js +2 -2
  303. package/dist/x/size.js +2 -2
  304. package/dist/x/size.min.js +2 -2
  305. package/dist/x/size.mjs +2 -2
  306. package/dist/x/trace.es.js +2 -2
  307. package/dist/x/trace.es.min.js +2 -2
  308. package/dist/x/trace.js +2 -2
  309. package/dist/x/trace.min.js +2 -2
  310. package/dist/x/trace.mjs +2 -2
  311. package/dist/x/unionWith.es.js +2 -2
  312. package/dist/x/unionWith.es.min.js +2 -2
  313. package/dist/x/unionWith.js +2 -2
  314. package/dist/x/unionWith.min.js +2 -2
  315. package/dist/x/unionWith.mjs +2 -2
  316. package/dist/x/uniq.es.js +2 -2
  317. package/dist/x/uniq.es.min.js +2 -2
  318. package/dist/x/uniq.js +2 -2
  319. package/dist/x/uniq.min.js +2 -2
  320. package/dist/x/uniq.mjs +2 -2
  321. package/dist/x/unless.es.js +2 -2
  322. package/dist/x/unless.es.min.js +2 -2
  323. package/dist/x/unless.js +2 -2
  324. package/dist/x/unless.min.js +2 -2
  325. package/dist/x/unless.mjs +2 -2
  326. package/dist/x/values.es.js +2 -2
  327. package/dist/x/values.es.min.js +2 -2
  328. package/dist/x/values.js +2 -2
  329. package/dist/x/values.min.js +2 -2
  330. package/dist/x/values.mjs +2 -2
  331. package/dist/x/when.es.js +2 -2
  332. package/dist/x/when.es.min.js +2 -2
  333. package/dist/x/when.js +2 -2
  334. package/dist/x/when.min.js +2 -2
  335. package/dist/x/when.mjs +2 -2
  336. package/es.js +8 -8
  337. package/get.js +4 -4
  338. package/index.js +8 -8
  339. package/map.d.ts +2 -2
  340. package/package.json +1 -1
package/README.md CHANGED
@@ -250,3 +250,12 @@ rubico is [MIT Licensed](https://github.com/a-synchronous/rubico/blob/master/LIC
250
250
  * minimum Firefox version: 57
251
251
  * minimum Edge version: 79
252
252
  * minimum Safari version: 11.1
253
+
254
+ # Awesome Resources
255
+ [rubico simplifies asynchronous code](https://dev.to/richytong/rubico-a-synchrnous-functional-syntax-motivation-20hf)
256
+ <br>
257
+ [Practical Functional Programming in JavaScript - Error Handling](https://dev.to/richytong/practical-functional-programming-in-javascript-error-handling-8g5)
258
+ <br>
259
+ [Practical Functional Programming in JavaScript - Techniques for Composing Data](https://dev.to/richytong/practical-functional-programming-in-javascript-techniques-for-composing-data-c39)
260
+ <br>
261
+ [Practical Functional Programming in JavaScript - Side Effects and Purity](https://dev.to/richytong/practical-functional-programming-in-javascript-side-effects-and-purity-revised-420h)
@@ -13,7 +13,7 @@ const objectSet = require('./objectSet')
13
13
  * arrayMapSeriesAsync<
14
14
  * T any,
15
15
  * array Array<T>,
16
- * mapper T=>Promise|any,
16
+ * mapper (T,index)=>Promise|any,
17
17
  * result Array,
18
18
  * index number,
19
19
  * >(array, mapper, result Array, index) -> Promise|result
@@ -27,7 +27,7 @@ const arrayMapSeriesAsync = async function (
27
27
  ) {
28
28
  const arrayLength = array.length
29
29
  while (++index < arrayLength) {
30
- const resultItem = mapper(array[index])
30
+ const resultItem = mapper(array[index], index)
31
31
  result[index] = isPromise(resultItem) ? await resultItem : resultItem
32
32
  }
33
33
  return result
@@ -41,7 +41,7 @@ const arrayMapSeriesAsync = async function (
41
41
  * arrayMapSeries<
42
42
  * T any,
43
43
  * array Array<T>,
44
- * mapper T=>Promise|any,
44
+ * mapper (T,index)=>Promise|any,
45
45
  * >(array, mapper) -> mappedInSeries Promise|Array
46
46
  * ```
47
47
  *
@@ -54,7 +54,7 @@ const arrayMapSeries = function (array, mapper) {
54
54
  let index = -1
55
55
 
56
56
  while (++index < arrayLength) {
57
- const resultItem = mapper(array[index])
57
+ const resultItem = mapper(array[index], index)
58
58
  if (isPromise(resultItem)) {
59
59
  return resultItem.then(funcConcat(
60
60
  curry3(objectSet, result, index, __),
@@ -1,5 +1,4 @@
1
1
  const fs = require('fs')
2
- const pathResolve = require('./pathResolve')
3
2
 
4
3
  // findAllFilePaths(path string) -> filePaths Promise<Array<string>>
5
4
  const findAllFilePaths = async function (path) {
@@ -10,10 +9,9 @@ const findAllFilePaths = async function (path) {
10
9
  const result = []
11
10
  for (const file of files) {
12
11
  if (file.isDirectory()) {
13
- const filePaths = await findAllFilePaths(pathResolve(path, file.name))
14
- result.push(...filePaths)
12
+ continue
15
13
  } else {
16
- result.push(pathResolve(path, file.name))
14
+ result.push(`${file.path}/${file.name}`)
17
15
  }
18
16
  }
19
17
  return result
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.1
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.1
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,e)=>function(...n){const t=r(...n);return isPromise(t)?t.then(e):e(t)},__=Symbol.for("placeholder"),curry2ResolveArg0=(r,e)=>function(n){return r(n,e)},curry2ResolveArg1=(r,e)=>function(n){return r(e,n)},curry2=function(r,e,n){return e==__?curry2ResolveArg0(r,n):curry2ResolveArg1(r,e)},reducerMap=(r,e)=>function(n,t){const c=e(t);return isPromise(c)?c.then(curry2(r,n,__)):r(n,c)},curry3ResolveArg0=(r,e,n)=>function(t){return r(t,e,n)},curry3ResolveArg1=(r,e,n)=>function(t){return r(e,t,n)},curry3ResolveArg2=(r,e,n)=>function(t){return r(e,n,t)},curry3=function(r,e,n,t){return e==__?curry3ResolveArg0(r,n,t):n==__?curry3ResolveArg1(r,e,t):curry3ResolveArg2(r,e,n)},thunkify2=(r,e,n)=>function(){return r(e,n)},thunkConditional=(r,e,n)=>r?e():n(),always=r=>function(){return r},reducerFilter=(r,e)=>function(n,t){const c=e(t);return isPromise(c)?c.then(curry3(thunkConditional,__,thunkify2(r,n,t),(o=n,function(){return o}))):c?r(n,t):n;var o},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,iteratorReduceAsync=async function(r,e,n){let t=r.next();if(t.done)return n;for(;!t.done;)n=e(n,t.value),isPromise(n)&&(n=await n),t=r.next();return n},iteratorReduce=function(r,e,n){let t=r.next();if(t.done)return n;for(void 0===n&&(n=t.value,t=r.next());!t.done;){if(n=e(n,t.value),isPromise(n))return n.then(curry3(iteratorReduceAsync,r,e,__));t=r.next()}return n},asyncIteratorReduce=async function(r,e,n){let t=await r.next();if(t.done)return n;for(void 0===n&&(n=t.value,t=await r.next());!t.done;)n=await e(n,t.value),t=await r.next();return n},symbolIterator=Symbol.iterator,symbolAsyncIterator=Symbol.asyncIterator,curryArgs3ResolveArgs0=(r,e,n)=>function(...t){return r(t,e,n)},curryArgs3ResolveArgs1=(r,e,n)=>function(...t){return r(e,t,n)},curryArgs3ResolveArgs2=(r,e,n)=>function(...t){return r(e,n,t)},curryArgs3=function(r,e,n,t){return e==__?curryArgs3ResolveArgs0(r,n,t):n==__?curryArgs3ResolveArgs1(r,e,t):curryArgs3ResolveArgs2(r,e,n)},curry4ResolveArg0=(r,e,n,t)=>function(c){return r(c,e,n,t)},curry4ResolveArg1=(r,e,n,t)=>function(c){return r(e,c,n,t)},curry4ResolveArg2=(r,e,n,t)=>function(c){return r(e,n,c,t)},curry4ResolveArg3=(r,e,n,t)=>function(c){return r(e,n,t,c)},curry4=function(r,e,n,t,c){return e==__?curry4ResolveArg0(r,n,t,c):n==__?curry4ResolveArg1(r,e,t,c):t==__?curry4ResolveArg2(r,e,n,c):curry4ResolveArg3(r,e,n,t)},arrayReduceAsync=async function(r,e,n,t){const c=r.length;for(;++t<c;)n=e(n,r[t],t,r),isPromise(n)&&(n=await n);return n},arrayReduce=function(r,e,n){const t=r.length;let c=-1;for(void 0===n&&(n=r[++c]);++c<t;)if(n=e(n,r[c],c,r),isPromise(n))return n.then(curry4(arrayReduceAsync,r,e,__,c));return n},curry5ResolveArg0=(r,e,n,t,c)=>function(o){return r(o,e,n,t,c)},curry5ResolveArg1=(r,e,n,t,c)=>function(o){return r(e,o,n,t,c)},curry5ResolveArg2=(r,e,n,t,c)=>function(o){return r(e,n,o,t,c)},curry5ResolveArg3=(r,e,n,t,c)=>function(o){return r(e,n,t,o,c)},curry5ResolveArg4=(r,e,n,t,c)=>function(o){return r(e,n,t,c,o)},curry5=function(r,e,n,t,c,o){return e==__?curry5ResolveArg0(r,n,t,c,o):n==__?curry5ResolveArg1(r,e,t,c,o):t==__?curry5ResolveArg2(r,e,n,c,o):c==__?curry5ResolveArg3(r,e,n,t,o):curry5ResolveArg4(r,e,n,t,c)},objectKeys=Object.keys,objectReduceAsync=async function(r,e,n,t,c){const o=t.length;for(;++c<o;){const o=t[c];n=e(n,r[o],o,r),isPromise(n)&&(n=await n)}return n},objectReduce=function(r,e,n){const t=objectKeys(r),c=t.length;let o=-1;for(void 0===n&&(n=r[t[++o]]);++o<c;){const c=t[o];if(n=e(n,r[c],c,r),isPromise(n))return n.then(curry5(objectReduceAsync,r,e,__,t,o))}return n},mapReduceAsync=async function(r,e,n,t){for(const[c,o]of t)n=e(n,o,c,r),isPromise(n)&&(n=await n);return n},mapReduce=function(r,e,n){const t=r.entries();if(void 0===n){const r=t.next();if(r.done)return n;n=r.value[1]}for(const[c,o]of t)if(n=e(n,o,c,r),isPromise(n))return n.then(curry4(mapReduceAsync,r,e,__,t));return n},reducerConcat=(r,e)=>function(n,t){const c=r(n,t);return isPromise(c)?c.then(curry2(e,__,t)):e(c,t)},genericReduce=function(r,e,n){return isArray(r)?arrayReduce(r,e,n):null==r?void 0===n?curry2(e,r,__):e(n,r):r.constructor==Map?mapReduce(r,e,n):"function"==typeof r[symbolIterator]?iteratorReduce(r[symbolIterator](),e,n):"function"==typeof r[symbolAsyncIterator]?asyncIteratorReduce(r[symbolAsyncIterator](),e,n):"function"==typeof r.reduce?r.reduce(e,n):"function"==typeof r.chain?r.chain(curry2(e,n,__)):"function"==typeof r.flatMap?r.flatMap(curry2(e,n,__)):r.constructor==Object?objectReduce(r,e,n):void 0===n?curry2(e,r,__):e(n,r)},reducerFlatMap=(r,e)=>function(n,t){const c=e(t);return isPromise(c)?c.then(curry3(genericReduce,__,r,n)):genericReduce(c,r,n)},reducerForEach=(r,e)=>function(n,t){const c=e(t);return isPromise(c)?c.then(thunkify2(r,n,t)):r(n,t)},_reducerTryCatchErrorHandler=function(r,e,n,t,c){const o=r(n,c);return isPromise(o)?o.then(curry2(e,t,__)):e(t,o)},reducerTryCatch=function(r,e,n){const t=e(r);return function(e,c){try{const o=t(e,c);return isPromise(o)?o.catch(curry5(_reducerTryCatchErrorHandler,n,r,__,e,c)):o}catch(t){return _reducerTryCatchErrorHandler(n,r,t,e,c)}}},Transducer={map:function(r){return curry2(reducerMap,__,r)},filter:function(r){return curry2(reducerFilter,__,r)},flatMap:function(r){return curry2(reducerFlatMap,__,r)},forEach:function(r){return curry2(reducerForEach,__,r)},passthrough:function(r){return r},tryCatch:function(r,e){return curry3(reducerTryCatch,__,r,e)}};export default Transducer;
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.1
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.1
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.1
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/__.es.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.1
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')
package/dist/__.es.min.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.1
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");export default __;
package/dist/__.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.1
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/__.min.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.1
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/__.mjs CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.1
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')
package/dist/all.es.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.1
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.1
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 n=r.length;let e=-1;for(;++e<n;){const n=r[e];if(isPromise(n))return!0}return!1},promiseAll=Promise.all.bind(Promise),isArray=Array.isArray,__=Symbol.for("placeholder"),curry2ResolveArg0=(r,n)=>function(e){return r(e,n)},curry2ResolveArg1=(r,n)=>function(e){return r(n,e)},curry2=function(r,n,e){return n==__?curry2ResolveArg0(r,e):curry2ResolveArg1(r,n)},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)},functionArrayAll=function(r,n){const e=r.length,t=Array(e);let o=-1,u=!1;for(;++o<e;){const e=r[o](...n);isPromise(e)&&(u=!0),t[o]=e}return u?promiseAll(t):t},funcConcat=(r,n)=>function(...e){const t=r(...e);return isPromise(t)?t.then(n):n(t)},curry3ResolveArg0=(r,n,e)=>function(t){return r(t,n,e)},curry3ResolveArg1=(r,n,e)=>function(t){return r(n,t,e)},curry3ResolveArg2=(r,n,e)=>function(t){return r(n,e,t)},curry3=function(r,n,e,t){return n==__?curry3ResolveArg0(r,e,t):e==__?curry3ResolveArg1(r,n,t):curry3ResolveArg2(r,n,e)},curry4ResolveArg0=(r,n,e,t)=>function(o){return r(o,n,e,t)},curry4ResolveArg1=(r,n,e,t)=>function(o){return r(n,o,e,t)},curry4ResolveArg2=(r,n,e,t)=>function(o){return r(n,e,o,t)},curry4ResolveArg3=(r,n,e,t)=>function(o){return r(n,e,t,o)},curry4=function(r,n,e,t,o){return n==__?curry4ResolveArg0(r,e,t,o):e==__?curry4ResolveArg1(r,n,t,o):t==__?curry4ResolveArg2(r,n,e,o):curry4ResolveArg3(r,n,e,t)},objectSet=function(r,n,e){return r[n]=e,r},asyncFunctionArrayAllSeries=async function(r,n,e,t){const o=r.length;for(;++t<o;){const o=r[t](...n);e[t]=isPromise(o)?await o:o}return e},functionArrayAllSeries=function(r,n){const e=r.length,t=[];let o=-1;for(;++o<e;){const e=r[o](...n);if(isPromise(e))return e.then(funcConcat(curry3(objectSet,t,o,__),(u=asyncFunctionArrayAllSeries,s=n,l=__,i=o,(c=r)==__?curry4ResolveArg0(u,s,l,i):s==__?curry4ResolveArg1(u,c,l,i):l==__?curry4ResolveArg2(u,c,s,i):curry4ResolveArg3(u,c,s,l))));t[o]=e}var u,c,s,l,i;return t},always=r=>function(){return r},functionObjectAll=function(r,n){const e={},t=[];for(const o in r){const u=r[o](...n);isPromise(u)?t.push(u.then(curry3(objectSet,e,o,__))):e[o]=u}return 0==t.length?e:promiseAll(t).then((o=e,function(){return o}));var o},all=function(...r){const n=r.pop();return 0==r.length?isArray(n)?curryArgs2(functionArrayAll,n,__):curryArgs2(functionObjectAll,n,__):areAnyValuesPromises(r)?isArray(n)?promiseAll(r).then(curry2(functionArrayAll,n,__)):promiseAll(r).then(curry2(functionObjectAll,n,__)):isArray(n)?functionArrayAll(n,r):functionObjectAll(n,r)};all.series=function(...r){const n=r.pop();return 0==r.length?curryArgs2(functionArrayAllSeries,n,__):areAnyValuesPromises(r)?promiseAll(r).then(curry2(functionArrayAllSeries,n,__)):functionArrayAllSeries(n,r)};export default all;
package/dist/all.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.1
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/all.min.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.1
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/all.mjs CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.1
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/always.es.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.1
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.1
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 always=a=>function(){return a};export default always;
package/dist/always.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.1
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.1
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/always.mjs CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.1
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/and.es.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.1
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.1
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 promiseAll=Promise.all.bind(Promise),isPromise=r=>null!=r&&"function"==typeof r.then,areAnyValuesPromises=function(r){const e=r.length;let n=-1;for(;++n<e;){const e=r[n];if(isPromise(e))return!0}return!1},__=Symbol.for("placeholder"),curry2ResolveArg0=(r,e)=>function(n){return r(n,e)},curry2ResolveArg1=(r,e)=>function(n){return r(e,n)},curry2=function(r,e,n){return e==__?curry2ResolveArg0(r,n):curry2ResolveArg1(r,e)},curry3ResolveArg0=(r,e,n)=>function(t){return r(t,e,n)},curry3ResolveArg1=(r,e,n)=>function(t){return r(e,t,n)},curry3ResolveArg2=(r,e,n)=>function(t){return r(e,n,t)},curry3=function(r,e,n,t){return e==__?curry3ResolveArg0(r,n,t):n==__?curry3ResolveArg1(r,e,t):curry3ResolveArg2(r,e,n)},curryArgs2ResolveArgs0=(r,e,n)=>function(...n){return r(n,e)},curryArgs2ResolveArgs1=(r,e,n)=>function(...n){return r(e,n)},curryArgs2=function(r,e,n){return e==__?curryArgs2ResolveArgs0(r,n):curryArgs2ResolveArgs1(r,e)},thunkConditional=(r,e,n)=>r?e():n(),areAllValuesNonfunctions=function(r){const e=r.length;let n=-1;for(;++n<e;)if("function"==typeof r[n])return!1;return!0},thunkify2=(r,e,n)=>function(){return r(e,n)},thunkify3=(r,e,n,t)=>function(){return r(e,n,t)},always=r=>function(){return r},areAllValuesTruthy=function(r,e){const n=r.length;for(;++e<n;){const n=r[e];if(isPromise(n))return n.then(curry3(thunkConditional,__,thunkify2(areAllValuesTruthy,r,e),always(!1)));if(!n)return!1}return!0},asyncArePredicatesAllTruthy=async function(r,e,n){const t=e.length;for(;++n<t;){let t=e[n];if("function"==typeof t&&(t=t(...r)),isPromise(t)&&(t=await t),!t)return!1}return!0},areAllPredicatesTruthy=function(r,e){const n=e.length;let t=-1;for(;++t<n;){let n=e[t];if("function"==typeof n&&(n=n(...r)),isPromise(n))return n.then(curry3(thunkConditional,__,thunkify3(asyncArePredicatesAllTruthy,r,e,t),always(!1)));if(!n)return!1}return!0},and=function(...r){const e=r.pop();return areAllValuesNonfunctions(e)?areAllValuesTruthy(e,-1):0==r.length?(n=areAllPredicatesTruthy,u=e,(t=__)==__?curryArgs2ResolveArgs0(n,u):curryArgs2ResolveArgs1(n,t)):areAnyValuesPromises(r)?promiseAll(r).then(curry2(areAllPredicatesTruthy,__,e)):areAllPredicatesTruthy(r,e);var n,t,u};export default and;
package/dist/and.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.1
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/and.min.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.1
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/and.mjs CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.1
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/assign.es.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.1
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.1
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,objectAssign=Object.assign,__=Symbol.for("placeholder"),curry2ResolveArg0=(r,n)=>function(e){return r(e,n)},curry2ResolveArg1=(r,n)=>function(e){return r(n,e)},curry2=function(r,n,e){return n==__?curry2ResolveArg0(r,e):curry2ResolveArg1(r,n)},curry3ResolveArg0=(r,n,e)=>function(t){return r(t,n,e)},curry3ResolveArg1=(r,n,e)=>function(t){return r(n,t,e)},curry3ResolveArg2=(r,n,e)=>function(t){return r(n,e,t)},curry3=function(r,n,e,t){return n==__?curry3ResolveArg0(r,e,t):e==__?curry3ResolveArg1(r,n,t):curry3ResolveArg2(r,n,e)},always=r=>function(){return r},promiseAll=Promise.all.bind(Promise),objectSet=function(r,n,e){return r[n]=e,r},functionObjectAll=function(r,n){const e={},t=[];for(const o in r){const u=r[o](...n);isPromise(u)?t.push(u.then(curry3(objectSet,e,o,__))):e[o]=u}return 0==t.length?e:promiseAll(t).then((o=e,function(){return o}));var o},_assign=function(r,n){const e=functionObjectAll(n,[r]);return isPromise(e)?e.then(curry3(objectAssign,{},r,__)):{...r,...e}},assign=function(r,n){return null==n?curry2(_assign,__,r):isPromise(r)?r.then(curry2(_assign,__,n)):_assign(r,n)};export default assign;
package/dist/assign.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.1
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.1
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/assign.mjs CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.1
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.1
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.1
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,e)=>function(n){return r(n,e)},curry2ResolveArg1=(r,e)=>function(n){return r(e,n)},curry2=function(r,e,n){return e==__?curry2ResolveArg0(r,n):curry2ResolveArg1(r,e)},promiseAll=Promise.all.bind(Promise),funcApply=(r,e)=>r(...e),isPromise=r=>null!=r&&"function"==typeof r.then,areAnyValuesPromises=function(r){const e=r.length;let n=-1;for(;++n<e;){const e=r[n];if(isPromise(e))return!0}return!1},funcConcat=(r,e)=>function(...n){const o=r(...n);return isPromise(o)?o.then(e):e(o)},compose=function(...r){const e=r.pop().reduceRight(funcConcat);return 0==r.length?e:areAnyValuesPromises(r)?promiseAll(r).then((n=funcApply,t=__,(o=e)==__?curry2ResolveArg0(n,t):curry2ResolveArg1(n,o))):e(...r);var n,o,t};export default compose;
package/dist/compose.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.1
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.1
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/compose.mjs CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.1
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')
package/dist/curry.es.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.1
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.1
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"),_curryArity=(r,t,u)=>function(...n){const y=u.length,c=n.length,e=[];let i=-1,o=-1,f=0;for(;++i<y;){const y=u[i];if(y==__&&(o+=1)<c){const r=n[o];r==__&&(f+=1),e.push(r)}else e.push(y);if(e.length==r)return 0==f?t(...e):curryArity(r,t,e)}for(;++o<c;){const u=n[o];if(u==__&&(f+=1),e.push(u),e.length==r)return 0==f?t(...e):curryArity(r,t,e)}return curryArity(r,t,e)},curryArity=function(r,t,u){const n=u.length;if(n<r)return _curryArity(r,t,u);let y=-1;for(;++y<n;){if(u[y]==__)return _curryArity(r,t,u)}return t(...u)},curry=(r,...t)=>curryArity(r.length,r,t);curry.arity=function(r,t,...u){return curryArity(r,t,u)};export default curry;
package/dist/curry.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.1
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/curry.min.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.1
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/curry.mjs CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.1
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')
package/dist/eq.es.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.1
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/eq.es.min.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.1
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)},equals=function(r,e){return r==e},eq=ComparisonOperator(equals);export default eq;
package/dist/eq.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.1
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/eq.min.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.1
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/eq.mjs CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.1
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.es.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.3.1
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.1
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,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)},isArray=Array.isArray,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)},promiseAll=Promise.all.bind(Promise),callPropUnary=(r,e,t)=>r[e](t),arrayEvery=function(r,e){const t=r.length,n=[];let o=-1;for(;++o<t;){const t=e(r[o]);if(isPromise(t))n.push(t);else if(!t)return!1}return 0==n.length||promiseAll(n).then(curry3(callPropUnary,__,"every",Boolean))},iteratorEvery=function(r,e){const t=[];for(const n of r){const r=e(n);if(isPromise(r))t.push(r);else if(!r)return!1}return 0==t.length||promiseAll(t).then(curry3(callPropUnary,__,"every",Boolean))},SelfReferencingPromise=function(r){const e=r.then((r=>[r,e]));return e},promiseRace=Promise.race.bind(Promise),asyncIteratorEvery=async function(r,e,t,n=20){let o=await r.next();for(;!o.done;){if(t.size>=n){const[r,e]=await promiseRace(t);if(t.delete(e),!r)return!1}const c=e(o.value);if(isPromise(c))t.add(SelfReferencingPromise(c));else if(!c)return!1;o=await r.next()}for(;t.size>0;){const[r,e]=await promiseRace(t);if(t.delete(e),!r)return!1}return!0},objectValues=Object.values,reducerAllSync=(r,e,t)=>!!e&&r(t),reducerEvery=r=>function(e,t){return!1!==e&&(isPromise(e)?e.then(curry3(reducerAllSync,r,__,t)):!!e&&r(t))},symbolIterator=Symbol.iterator,symbolAsyncIterator=Symbol.asyncIterator,_every=function(r,e){return isArray(r)?arrayEvery(r,e):null==r?e(r):"function"==typeof r[symbolIterator]?iteratorEvery(r[symbolIterator](),e):"function"==typeof r[symbolAsyncIterator]?asyncIteratorEvery(r[symbolAsyncIterator](),e,new Set):"function"==typeof r.reduce?r.reduce(reducerEvery(e),!0):r.constructor==Object?arrayEvery(objectValues(r),e):e(r)},every=function(...r){const e=r.pop();if(0==r.length)return curry2(_every,__,e);const t=r[0];return isPromise(t)?t.then(curry2(_every,__,e)):_every(t,e)};export default every;