rubico 2.7.7 → 2.7.9

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 (341) hide show
  1. package/README.md +12 -16
  2. package/_internal/arrayForEach.js +1 -1
  3. package/_internal/arrayForEachSeries.js +1 -1
  4. package/_internal/objectForEach.js +1 -1
  5. package/_internal/objectForEachSeries.js +1 -1
  6. package/dist/Transducer.es.js +2 -2
  7. package/dist/Transducer.es.min.js +2 -2
  8. package/dist/Transducer.js +2 -2
  9. package/dist/Transducer.min.js +2 -2
  10. package/dist/Transducer.mjs +2 -2
  11. package/dist/__.es.js +2 -2
  12. package/dist/__.es.min.js +2 -2
  13. package/dist/__.js +2 -2
  14. package/dist/__.min.js +2 -2
  15. package/dist/__.mjs +2 -2
  16. package/dist/all.es.js +2 -2
  17. package/dist/all.es.min.js +2 -2
  18. package/dist/all.js +2 -2
  19. package/dist/all.min.js +2 -2
  20. package/dist/all.mjs +2 -2
  21. package/dist/always.es.js +2 -2
  22. package/dist/always.es.min.js +2 -2
  23. package/dist/always.js +2 -2
  24. package/dist/always.min.js +2 -2
  25. package/dist/always.mjs +2 -2
  26. package/dist/and.es.js +2 -2
  27. package/dist/and.es.min.js +2 -2
  28. package/dist/and.js +2 -2
  29. package/dist/and.min.js +2 -2
  30. package/dist/and.mjs +2 -2
  31. package/dist/assign.es.js +2 -2
  32. package/dist/assign.es.min.js +2 -2
  33. package/dist/assign.js +2 -2
  34. package/dist/assign.min.js +2 -2
  35. package/dist/assign.mjs +2 -2
  36. package/dist/compose.es.js +2 -2
  37. package/dist/compose.es.min.js +2 -2
  38. package/dist/compose.js +2 -2
  39. package/dist/compose.min.js +2 -2
  40. package/dist/compose.mjs +2 -2
  41. package/dist/curry.es.js +2 -2
  42. package/dist/curry.es.min.js +2 -2
  43. package/dist/curry.js +2 -2
  44. package/dist/curry.min.js +2 -2
  45. package/dist/curry.mjs +2 -2
  46. package/dist/eq.es.js +2 -2
  47. package/dist/eq.es.min.js +2 -2
  48. package/dist/eq.js +2 -2
  49. package/dist/eq.min.js +2 -2
  50. package/dist/eq.mjs +2 -2
  51. package/dist/every.es.js +2 -2
  52. package/dist/every.es.min.js +2 -2
  53. package/dist/every.js +2 -2
  54. package/dist/every.min.js +2 -2
  55. package/dist/every.mjs +2 -2
  56. package/dist/filter.es.js +2 -2
  57. package/dist/filter.es.min.js +2 -2
  58. package/dist/filter.js +2 -2
  59. package/dist/filter.min.js +2 -2
  60. package/dist/filter.mjs +2 -2
  61. package/dist/flatMap.es.js +2 -2
  62. package/dist/flatMap.es.min.js +2 -2
  63. package/dist/flatMap.js +2 -2
  64. package/dist/flatMap.min.js +2 -2
  65. package/dist/flatMap.mjs +2 -2
  66. package/dist/forEach.es.js +6 -6
  67. package/dist/forEach.es.min.js +3 -3
  68. package/dist/forEach.js +6 -6
  69. package/dist/forEach.min.js +3 -3
  70. package/dist/forEach.mjs +6 -6
  71. package/dist/get.es.js +2 -2
  72. package/dist/get.es.min.js +2 -2
  73. package/dist/get.js +2 -2
  74. package/dist/get.min.js +2 -2
  75. package/dist/get.mjs +2 -2
  76. package/dist/gt.es.js +2 -2
  77. package/dist/gt.es.min.js +2 -2
  78. package/dist/gt.js +2 -2
  79. package/dist/gt.min.js +2 -2
  80. package/dist/gt.mjs +2 -2
  81. package/dist/gte.es.js +2 -2
  82. package/dist/gte.es.min.js +2 -2
  83. package/dist/gte.js +2 -2
  84. package/dist/gte.min.js +2 -2
  85. package/dist/gte.mjs +2 -2
  86. package/dist/lt.es.js +2 -2
  87. package/dist/lt.es.min.js +2 -2
  88. package/dist/lt.js +2 -2
  89. package/dist/lt.min.js +2 -2
  90. package/dist/lt.mjs +2 -2
  91. package/dist/lte.es.js +2 -2
  92. package/dist/lte.es.min.js +2 -2
  93. package/dist/lte.js +2 -2
  94. package/dist/lte.min.js +2 -2
  95. package/dist/lte.mjs +2 -2
  96. package/dist/map.es.js +2 -2
  97. package/dist/map.es.min.js +2 -2
  98. package/dist/map.js +2 -2
  99. package/dist/map.min.js +2 -2
  100. package/dist/map.mjs +2 -2
  101. package/dist/not.es.js +2 -2
  102. package/dist/not.es.min.js +2 -2
  103. package/dist/not.js +2 -2
  104. package/dist/not.min.js +2 -2
  105. package/dist/not.mjs +2 -2
  106. package/dist/omit.es.js +2 -2
  107. package/dist/omit.es.min.js +2 -2
  108. package/dist/omit.js +2 -2
  109. package/dist/omit.min.js +2 -2
  110. package/dist/omit.mjs +2 -2
  111. package/dist/or.es.js +2 -2
  112. package/dist/or.es.min.js +2 -2
  113. package/dist/or.js +2 -2
  114. package/dist/or.min.js +2 -2
  115. package/dist/or.mjs +2 -2
  116. package/dist/pick.es.js +2 -2
  117. package/dist/pick.es.min.js +2 -2
  118. package/dist/pick.js +2 -2
  119. package/dist/pick.min.js +2 -2
  120. package/dist/pick.mjs +2 -2
  121. package/dist/pipe.es.js +2 -2
  122. package/dist/pipe.es.min.js +2 -2
  123. package/dist/pipe.js +2 -2
  124. package/dist/pipe.min.js +2 -2
  125. package/dist/pipe.mjs +2 -2
  126. package/dist/reduce.es.js +2 -2
  127. package/dist/reduce.es.min.js +2 -2
  128. package/dist/reduce.js +2 -2
  129. package/dist/reduce.min.js +2 -2
  130. package/dist/reduce.mjs +2 -2
  131. package/dist/rubico.es.js +6 -6
  132. package/dist/rubico.es.min.js +3 -3
  133. package/dist/rubico.global.js +6 -6
  134. package/dist/rubico.global.min.js +3 -3
  135. package/dist/rubico.js +6 -6
  136. package/dist/rubico.min.js +3 -3
  137. package/dist/rubico.mjs +6 -6
  138. package/dist/set.es.js +2 -2
  139. package/dist/set.es.min.js +2 -2
  140. package/dist/set.js +2 -2
  141. package/dist/set.min.js +2 -2
  142. package/dist/set.mjs +2 -2
  143. package/dist/some.es.js +2 -2
  144. package/dist/some.es.min.js +2 -2
  145. package/dist/some.js +2 -2
  146. package/dist/some.min.js +2 -2
  147. package/dist/some.mjs +2 -2
  148. package/dist/switchCase.es.js +2 -2
  149. package/dist/switchCase.es.min.js +2 -2
  150. package/dist/switchCase.js +2 -2
  151. package/dist/switchCase.min.js +2 -2
  152. package/dist/switchCase.mjs +2 -2
  153. package/dist/tap.es.js +2 -2
  154. package/dist/tap.es.min.js +2 -2
  155. package/dist/tap.js +2 -2
  156. package/dist/tap.min.js +2 -2
  157. package/dist/tap.mjs +2 -2
  158. package/dist/thunkify.es.js +2 -2
  159. package/dist/thunkify.es.min.js +2 -2
  160. package/dist/thunkify.js +2 -2
  161. package/dist/thunkify.min.js +2 -2
  162. package/dist/thunkify.mjs +2 -2
  163. package/dist/transform.es.js +2 -2
  164. package/dist/transform.es.min.js +2 -2
  165. package/dist/transform.js +2 -2
  166. package/dist/transform.min.js +2 -2
  167. package/dist/transform.mjs +2 -2
  168. package/dist/tryCatch.es.js +2 -2
  169. package/dist/tryCatch.es.min.js +2 -2
  170. package/dist/tryCatch.js +2 -2
  171. package/dist/tryCatch.min.js +2 -2
  172. package/dist/tryCatch.mjs +2 -2
  173. package/dist/x/append.es.js +2 -2
  174. package/dist/x/append.es.min.js +2 -2
  175. package/dist/x/append.js +2 -2
  176. package/dist/x/append.min.js +2 -2
  177. package/dist/x/append.mjs +2 -2
  178. package/dist/x/callProp.es.js +2 -2
  179. package/dist/x/callProp.es.min.js +2 -2
  180. package/dist/x/callProp.js +2 -2
  181. package/dist/x/callProp.min.js +2 -2
  182. package/dist/x/callProp.mjs +2 -2
  183. package/dist/x/defaultsDeep.es.js +2 -2
  184. package/dist/x/defaultsDeep.es.min.js +2 -2
  185. package/dist/x/defaultsDeep.js +2 -2
  186. package/dist/x/defaultsDeep.min.js +2 -2
  187. package/dist/x/defaultsDeep.mjs +2 -2
  188. package/dist/x/differenceWith.es.js +2 -2
  189. package/dist/x/differenceWith.es.min.js +2 -2
  190. package/dist/x/differenceWith.js +2 -2
  191. package/dist/x/differenceWith.min.js +2 -2
  192. package/dist/x/differenceWith.mjs +2 -2
  193. package/dist/x/filterOut.es.js +2 -2
  194. package/dist/x/filterOut.es.min.js +2 -2
  195. package/dist/x/filterOut.js +2 -2
  196. package/dist/x/filterOut.min.js +2 -2
  197. package/dist/x/filterOut.mjs +2 -2
  198. package/dist/x/find.es.js +2 -2
  199. package/dist/x/find.es.min.js +2 -2
  200. package/dist/x/find.js +2 -2
  201. package/dist/x/find.min.js +2 -2
  202. package/dist/x/find.mjs +2 -2
  203. package/dist/x/findIndex.es.js +2 -2
  204. package/dist/x/findIndex.es.min.js +2 -2
  205. package/dist/x/findIndex.js +2 -2
  206. package/dist/x/findIndex.min.js +2 -2
  207. package/dist/x/findIndex.mjs +2 -2
  208. package/dist/x/first.es.js +2 -2
  209. package/dist/x/first.es.min.js +2 -2
  210. package/dist/x/first.js +2 -2
  211. package/dist/x/first.min.js +2 -2
  212. package/dist/x/first.mjs +2 -2
  213. package/dist/x/flatten.es.js +2 -2
  214. package/dist/x/flatten.es.min.js +2 -2
  215. package/dist/x/flatten.js +2 -2
  216. package/dist/x/flatten.min.js +2 -2
  217. package/dist/x/flatten.mjs +2 -2
  218. package/dist/x/groupBy.es.js +2 -2
  219. package/dist/x/groupBy.es.min.js +2 -2
  220. package/dist/x/groupBy.js +2 -2
  221. package/dist/x/groupBy.min.js +2 -2
  222. package/dist/x/groupBy.mjs +2 -2
  223. package/dist/x/has.es.js +2 -2
  224. package/dist/x/has.es.min.js +2 -2
  225. package/dist/x/has.js +2 -2
  226. package/dist/x/has.min.js +2 -2
  227. package/dist/x/has.mjs +2 -2
  228. package/dist/x/identity.es.js +2 -2
  229. package/dist/x/identity.es.min.js +2 -2
  230. package/dist/x/identity.js +2 -2
  231. package/dist/x/identity.min.js +2 -2
  232. package/dist/x/identity.mjs +2 -2
  233. package/dist/x/includes.es.js +2 -2
  234. package/dist/x/includes.es.min.js +2 -2
  235. package/dist/x/includes.js +2 -2
  236. package/dist/x/includes.min.js +2 -2
  237. package/dist/x/includes.mjs +2 -2
  238. package/dist/x/isDeepEqual.es.js +2 -2
  239. package/dist/x/isDeepEqual.es.min.js +2 -2
  240. package/dist/x/isDeepEqual.js +2 -2
  241. package/dist/x/isDeepEqual.min.js +2 -2
  242. package/dist/x/isDeepEqual.mjs +2 -2
  243. package/dist/x/isEmpty.es.js +2 -2
  244. package/dist/x/isEmpty.es.min.js +2 -2
  245. package/dist/x/isEmpty.js +2 -2
  246. package/dist/x/isEmpty.min.js +2 -2
  247. package/dist/x/isEmpty.mjs +2 -2
  248. package/dist/x/isEqual.es.js +2 -2
  249. package/dist/x/isEqual.es.min.js +2 -2
  250. package/dist/x/isEqual.js +2 -2
  251. package/dist/x/isEqual.min.js +2 -2
  252. package/dist/x/isEqual.mjs +2 -2
  253. package/dist/x/isFunction.es.js +2 -2
  254. package/dist/x/isFunction.es.min.js +2 -2
  255. package/dist/x/isFunction.js +2 -2
  256. package/dist/x/isFunction.min.js +2 -2
  257. package/dist/x/isFunction.mjs +2 -2
  258. package/dist/x/isIn.es.js +2 -2
  259. package/dist/x/isIn.es.min.js +2 -2
  260. package/dist/x/isIn.js +2 -2
  261. package/dist/x/isIn.min.js +2 -2
  262. package/dist/x/isIn.mjs +2 -2
  263. package/dist/x/isObject.es.js +2 -2
  264. package/dist/x/isObject.es.min.js +2 -2
  265. package/dist/x/isObject.js +2 -2
  266. package/dist/x/isObject.min.js +2 -2
  267. package/dist/x/isObject.mjs +2 -2
  268. package/dist/x/isString.es.js +2 -2
  269. package/dist/x/isString.es.min.js +2 -2
  270. package/dist/x/isString.js +2 -2
  271. package/dist/x/isString.min.js +2 -2
  272. package/dist/x/isString.mjs +2 -2
  273. package/dist/x/keys.es.js +2 -2
  274. package/dist/x/keys.es.min.js +2 -2
  275. package/dist/x/keys.js +2 -2
  276. package/dist/x/keys.min.js +2 -2
  277. package/dist/x/keys.mjs +2 -2
  278. package/dist/x/last.es.js +2 -2
  279. package/dist/x/last.es.min.js +2 -2
  280. package/dist/x/last.js +2 -2
  281. package/dist/x/last.min.js +2 -2
  282. package/dist/x/last.mjs +2 -2
  283. package/dist/x/maxBy.es.js +2 -2
  284. package/dist/x/maxBy.es.min.js +2 -2
  285. package/dist/x/maxBy.js +2 -2
  286. package/dist/x/maxBy.min.js +2 -2
  287. package/dist/x/maxBy.mjs +2 -2
  288. package/dist/x/noop.es.js +2 -2
  289. package/dist/x/noop.es.min.js +2 -2
  290. package/dist/x/noop.js +2 -2
  291. package/dist/x/noop.min.js +2 -2
  292. package/dist/x/noop.mjs +2 -2
  293. package/dist/x/pluck.es.js +2 -2
  294. package/dist/x/pluck.es.min.js +2 -2
  295. package/dist/x/pluck.js +2 -2
  296. package/dist/x/pluck.min.js +2 -2
  297. package/dist/x/pluck.mjs +2 -2
  298. package/dist/x/prepend.es.js +2 -2
  299. package/dist/x/prepend.es.min.js +2 -2
  300. package/dist/x/prepend.js +2 -2
  301. package/dist/x/prepend.min.js +2 -2
  302. package/dist/x/prepend.mjs +2 -2
  303. package/dist/x/size.es.js +2 -2
  304. package/dist/x/size.es.min.js +2 -2
  305. package/dist/x/size.js +2 -2
  306. package/dist/x/size.min.js +2 -2
  307. package/dist/x/size.mjs +2 -2
  308. package/dist/x/trace.es.js +2 -2
  309. package/dist/x/trace.es.min.js +2 -2
  310. package/dist/x/trace.js +2 -2
  311. package/dist/x/trace.min.js +2 -2
  312. package/dist/x/trace.mjs +2 -2
  313. package/dist/x/unionWith.es.js +2 -2
  314. package/dist/x/unionWith.es.min.js +2 -2
  315. package/dist/x/unionWith.js +2 -2
  316. package/dist/x/unionWith.min.js +2 -2
  317. package/dist/x/unionWith.mjs +2 -2
  318. package/dist/x/uniq.es.js +2 -2
  319. package/dist/x/uniq.es.min.js +2 -2
  320. package/dist/x/uniq.js +2 -2
  321. package/dist/x/uniq.min.js +2 -2
  322. package/dist/x/uniq.mjs +2 -2
  323. package/dist/x/unless.es.js +2 -2
  324. package/dist/x/unless.es.min.js +2 -2
  325. package/dist/x/unless.js +2 -2
  326. package/dist/x/unless.min.js +2 -2
  327. package/dist/x/unless.mjs +2 -2
  328. package/dist/x/values.es.js +2 -2
  329. package/dist/x/values.es.min.js +2 -2
  330. package/dist/x/values.js +2 -2
  331. package/dist/x/values.min.js +2 -2
  332. package/dist/x/values.mjs +2 -2
  333. package/dist/x/when.es.js +2 -2
  334. package/dist/x/when.es.min.js +2 -2
  335. package/dist/x/when.js +2 -2
  336. package/dist/x/when.min.js +2 -2
  337. package/dist/x/when.mjs +2 -2
  338. package/es.js +6 -6
  339. package/flatMap.js +1 -1
  340. package/index.js +6 -6
  341. package/package.json +2 -8
package/dist/eq.es.min.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 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,areAnyValuesPromises=function(r){if(isArray(r)){const e=r.length;let s=-1;for(;++s<e;){const e=r[s];if(isPromise(e))return!0}return!1}for(const e in r){const s=r[e];if(isPromise(s))return!0}return!1},__=Symbol.for("placeholder"),curry4ResolveArg0=(r,e,s,o)=>function(t){return r(t,e,s,o)},curry4ResolveArg1=(r,e,s,o)=>function(t){return r(e,t,s,o)},curry4ResolveArg2=(r,e,s,o)=>function(t){return r(e,s,t,o)},curry4ResolveArg3=(r,e,s,o)=>function(t){return r(e,s,o,t)},curry4=function(r,e,s,o,t){return e==__?curry4ResolveArg0(r,s,o,t):s==__?curry4ResolveArg1(r,e,o,t):o==__?curry4ResolveArg2(r,e,s,t):curry4ResolveArg3(r,e,s,o)},curryArgs4ResolveArgs0=(r,e,s,o)=>function(...t){return r(t,e,s,o)},curryArgs4ResolveArgs1=(r,e,s,o)=>function(...t){return r(e,t,s,o)},curryArgs4ResolveArgs2=(r,e,s,o)=>function(...t){return r(e,s,t,o)},curryArgs4ResolveArgs3=(r,e,s,o)=>function(...t){return r(e,s,o,t)},curryArgs4=function(r,e,s,o,t){return e==__?curryArgs4ResolveArgs0(r,s,o,t):s==__?curryArgs4ResolveArgs1(r,e,o,t):o==__?curryArgs4ResolveArgs2(r,e,s,t):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 t=s(...r),n=o(...r);return isPromise(t)||isPromise(n)?promiseAll([t,n]).then(spread2(e)):e(t,n)},leftResolverRightValueCompare=function(r,e,s,o){const t=s(...r);return isPromise(t)||isPromise(o)?promiseAll([t,o]).then(spread2(e)):e(t,o)},leftValueRightResolverCompare=function(r,e,s,o){const t=o(...r);return isPromise(s)||isPromise(t)?promiseAll([s,t]).then(spread2(e)):e(s,t)},ComparisonOperator=r=>function(...e){const s=e.pop(),o=e.pop(),t="function"==typeof o,n="function"==typeof s;return t&&n?0==e.length?curryArgs4(leftResolverRightResolverCompare,__,r,o,s):areAnyValuesPromises(e)?promiseAll(e).then(curry4(leftResolverRightResolverCompare,__,r,o,s)):leftResolverRightResolverCompare(e,r,o,s):t?0==e.length?curryArgs4(leftResolverRightValueCompare,__,r,o,s):areAnyValuesPromises(e)?promiseAll(e).then(curry4(leftResolverRightValueCompare,__,r,o,s)):leftResolverRightValueCompare(e,r,o,s):n?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)},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.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 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.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 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.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 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.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 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.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 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,e){return"function"==typeof r?curry2(_every,__,r):isPromise(r)?r.then(curry2(_every,__,e)):_every(r,e)};export default every;
package/dist/every.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
package/dist/every.min.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 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.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 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.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 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.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 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,t){return"function"==typeof r?curry2(_filter,__,r):isPromise(r)?r.then(curry2(_filter,__,t)):_filter(r,t)};export default filter;
package/dist/filter.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 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.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 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.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 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.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 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.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
  const isPromise=e=>null!=e&&"function"==typeof e.then,isArray=Array.isArray,objectValues=Object.values,objectProto=Object.prototype,nativeObjectToString=objectProto.toString,objectToString=e=>nativeObjectToString.call(e),generatorFunctionTag="[object GeneratorFunction]",isGeneratorFunction=e=>objectToString(e)==generatorFunctionTag,asyncGeneratorFunctionTag="[object AsyncGeneratorFunction]",isAsyncGeneratorFunction=e=>objectToString(e)==asyncGeneratorFunctionTag,__=Symbol.for("placeholder"),curry3ResolveArg0=(e,r,t)=>function(n){return e(n,r,t)},curry3ResolveArg1=(e,r,t)=>function(n){return e(r,n,t)},curry3ResolveArg2=(e,r,t)=>function(n){return e(r,t,n)},curry3=function(e,r,t,n){return r==__?curry3ResolveArg0(e,t,n):t==__?curry3ResolveArg1(e,r,n):curry3ResolveArg2(e,r,t)},iteratorReduceAsync=async function(e,r,t){let n=e.next();if(n.done)return t;for(;!n.done;)t=r(t,n.value),isPromise(t)&&(t=await t),n=e.next();return t},iteratorReduce=function(e,r,t){let n=e.next();if(n.done)return t;for(void 0===t&&(t=n.value,n=e.next());!n.done;){if(t=r(t,n.value),isPromise(t))return t.then(curry3(iteratorReduceAsync,e,r,__));n=e.next()}return t},asyncIteratorReduce=async function(e,r,t){let n=await e.next();if(n.done)return t;for(void 0===t&&(t=n.value,n=await e.next());!n.done;)t=await r(t,n.value),n=await e.next();return t},symbolIterator=Symbol.iterator,symbolAsyncIterator=Symbol.asyncIterator,curry2ResolveArg0=(e,r)=>function(t){return e(t,r)},curry2ResolveArg1=(e,r)=>function(t){return e(r,t)},curry2=function(e,r,t){return r==__?curry2ResolveArg0(e,t):curry2ResolveArg1(e,r)},curryArgs3ResolveArgs0=(e,r,t)=>function(...n){return e(n,r,t)},curryArgs3ResolveArgs1=(e,r,t)=>function(...n){return e(r,n,t)},curryArgs3ResolveArgs2=(e,r,t)=>function(...n){return e(r,t,n)},curryArgs3=function(e,r,t,n){return r==__?curryArgs3ResolveArgs0(e,t,n):t==__?curryArgs3ResolveArgs1(e,r,n):curryArgs3ResolveArgs2(e,r,t)},curry4ResolveArg0=(e,r,t,n)=>function(o){return e(o,r,t,n)},curry4ResolveArg1=(e,r,t,n)=>function(o){return e(r,o,t,n)},curry4ResolveArg2=(e,r,t,n)=>function(o){return e(r,t,o,n)},curry4ResolveArg3=(e,r,t,n)=>function(o){return e(r,t,n,o)},curry4=function(e,r,t,n,o){return r==__?curry4ResolveArg0(e,t,n,o):t==__?curry4ResolveArg1(e,r,n,o):n==__?curry4ResolveArg2(e,r,t,o):curry4ResolveArg3(e,r,t,n)},arrayReduceAsync=async function(e,r,t,n){const o=e.length;for(;++n<o;)t=r(t,e[n],n,e),isPromise(t)&&(t=await t);return t},arrayReduce=function(e,r,t){const n=e.length;let o=-1;for(void 0===t&&(t=e[++o]);++o<n;)if(t=r(t,e[o],o,e),isPromise(t))return t.then(curry4(arrayReduceAsync,e,r,__,o));return t},curry5ResolveArg0=(e,r,t,n,o)=>function(c){return e(c,r,t,n,o)},curry5ResolveArg1=(e,r,t,n,o)=>function(c){return e(r,c,t,n,o)},curry5ResolveArg2=(e,r,t,n,o)=>function(c){return e(r,t,c,n,o)},curry5ResolveArg3=(e,r,t,n,o)=>function(c){return e(r,t,n,c,o)},curry5ResolveArg4=(e,r,t,n,o)=>function(c){return e(r,t,n,o,c)},curry5=function(e,r,t,n,o,c){return r==__?curry5ResolveArg0(e,t,n,o,c):t==__?curry5ResolveArg1(e,r,n,o,c):n==__?curry5ResolveArg2(e,r,t,o,c):o==__?curry5ResolveArg3(e,r,t,n,c):curry5ResolveArg4(e,r,t,n,o)},objectKeys=Object.keys,objectReduceAsync=async function(e,r,t,n,o){const c=n.length;for(;++o<c;){const c=n[o];t=r(t,e[c],c,e),isPromise(t)&&(t=await t)}return t},objectReduce=function(e,r,t){const n=objectKeys(e),o=n.length;let c=-1;for(void 0===t&&(t=e[n[++c]]);++c<o;){const o=n[c];if(t=r(t,e[o],o,e),isPromise(t))return t.then(curry5(objectReduceAsync,e,r,__,n,c))}return t},mapReduceAsync=async function(e,r,t,n){for(const[o,c]of n)t=r(t,c,o,e),isPromise(t)&&(t=await t);return t},mapReduce=function(e,r,t){const n=e.entries();if(void 0===t){const e=n.next();if(e.done)return t;t=e.value[1]}for(const[o,c]of n)if(t=r(t,c,o,e),isPromise(t))return t.then(curry4(mapReduceAsync,e,r,__,n));return t},reducerConcat=(e,r)=>function(t,n){const o=e(t,n);return isPromise(o)?o.then(curry2(r,__,n)):r(o,n)},genericReduce=function(e,r,t){return isArray(e)?arrayReduce(e,r,t):null==e?void 0===t?curry2(r,e,__):r(t,e):e.constructor==Map?mapReduce(e,r,t):"function"==typeof e[symbolIterator]?iteratorReduce(e[symbolIterator](),r,t):"function"==typeof e[symbolAsyncIterator]?asyncIteratorReduce(e[symbolAsyncIterator](),r,t):"function"==typeof e.reduce?e.reduce(r,t):"function"==typeof e.chain?e.chain(curry2(r,t,__)):"function"==typeof e.flatMap?e.flatMap(curry2(r,t,__)):e.constructor==Object?objectReduce(e,r,t):void 0===t?curry2(r,e,__):r(t,e)},arrayPush=function(e,r){return e.push(r),e},FlatMappingIterator=function(e,r){let t=[],n=0;return{[symbolIterator](){return this},next(){if(n<t.length){const e=t[n];return n+=1,{value:e,done:!1}}const o=e.next();if(o.done)return o;const c=genericReduce(r(o.value),arrayPush,[]);return c.length>1&&(t=c,n=1),{value:c[0],done:!1}}}},promiseRace=Promise.race.bind(Promise),sleep=e=>new Promise((r=>{setTimeout(r,e)})),FlatMappingAsyncIterator=function(e,r){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 e.next();if(c)this.isAsyncIteratorDone=c;else{const e=r(o);if(isPromise(e)){const r=e.then(curry3(genericReduce,__,arrayPush,t)).then((()=>n.delete(r)));n.add(r)}else{const r=genericReduce(e,arrayPush,t);if(isPromise(r)){const e=r.then((()=>n.delete(e)));n.add(e)}}}}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=e=>function(){return e},getArg1=(e,r)=>r,identity=e=>e,promiseAll=Promise.all.bind(Promise),funcConcatSync=(e,r)=>function(...t){return r(e(...t))},asyncIteratorForEach=async function(e,r){const t=[];for await(const n of e){const e=r(n);isPromise(e)&&t.push(e)}return 0==t.length?e:promiseAll(t).then(always(e))},arrayFlatten=function(e){const r=e.length,t=[],n=[];let o=-1;for(;++o<r;){const r=e[o];if(isArray(r)){const e=r.length;let t=-1;for(;++t<e;)n.push(r[t])}else if(null==r)n.push(r);else if("function"==typeof r.then)t.push(r.then(curry2(arrayPush,n,__)));else if("function"==typeof r[symbolIterator])for(const e of r)n.push(e);else if("function"==typeof r[symbolAsyncIterator])t.push(asyncIteratorForEach(r[symbolAsyncIterator](),curry2(arrayPush,n,__)));else if("function"==typeof r.chain){const e=r.chain(identity);isPromise(e)?t.push(e.then(curry2(arrayPush,n,__))):n.push(e)}else if("function"==typeof r.flatMap){const e=r.flatMap(identity);isPromise(e)?t.push(e.then(curry2(arrayPush,n,__))):n.push(e)}else if("function"==typeof r.reduce){const e=r.reduce(funcConcatSync(getArg1,curry2(arrayPush,n,__)),null);isPromise(e)&&t.push(e)}else if(r.constructor==Object)for(const e in r)n.push(r[e]);else n.push(r)}return 0==t.length?n:promiseAll(t).then(always(n))},arrayMap=function(e,r){const t=e.length,n=Array(t);let o=-1,c=!1;for(;++o<t;){const t=r(e[o],o,e);isPromise(t)&&(c=!0),n[o]=t}return c?promiseAll(n):n},arrayFlatMap=function(e,r){const t=arrayMap(e,r);return isPromise(t)?t.then(arrayFlatten):arrayFlatten(t)},promiseObjectAllExecutor=e=>function(r){const t={};let n=0;for(const o in e){const c=e[o];isPromise(c)?(n+=1,c.then((e=>function(o){t[e]=o,n-=1,0==n&&r(t)})(o))):t[o]=c}0==n&&r(t)},promiseObjectAll=e=>new Promise(promiseObjectAllExecutor(e)),objectMap=function(e,r){const t={};let n=!1;for(const o in e){const c=r(e[o],o,e);isPromise(c)&&(n=!0),t[o]=c}return n?promiseObjectAll(t):t},objectAssign=Object.assign,objectFlatten=function(e){const r=[],t={},n=curry2(objectAssign,t,__),o=funcConcatSync(getArg1,n);for(const c in e){const s=e[c];if(null!=s)if("function"==typeof s[symbolIterator])for(const e of s)objectAssign(t,e);else if("function"==typeof s[symbolAsyncIterator])r.push(asyncIteratorForEach(s[symbolAsyncIterator](),n));else if("function"==typeof s.chain){const e=s.chain(identity);isPromise(e)?r.push(e.then(n)):objectAssign(t,e)}else if("function"==typeof s.flatMap){const e=s.flatMap(identity);isPromise(e)?r.push(e.then(n)):n(e)}else if("function"==typeof s.reduce){const e=s.reduce(o,null);isPromise(e)&&r.push(e)}else objectAssign(t,s)}return 0==r.length?t:promiseAll(r).then((()=>t))},objectFlatMap=function(e,r){const t=objectMap(e,r);return isPromise(t)?t.then(objectFlatten):objectFlatten(t)},callPropUnary=(e,r,t)=>e[r](t),setMap=function(e,r){const t=new Set,n=[];for(const o of e){const c=r(o,o,e);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(e){e.size;const r=[],t=new Set,n=(e,r)=>t.add(r),o=curry3(callPropUnary,t,"add",__);for(const c of e)if(isArray(c)){const e=c.length;let r=-1;for(;++r<e;)t.add(c[r])}else if(null==c)t.add(c);else if("function"==typeof c[symbolIterator])for(const e of c)t.add(e);else if("function"==typeof c[symbolAsyncIterator])r.push(asyncIteratorForEach(c[symbolAsyncIterator](),o));else if("function"==typeof c.chain){const e=c.chain(identity);isPromise(e)?r.push(e.then(o)):t.add(e)}else if("function"==typeof c.flatMap){const e=c.flatMap(identity);isPromise(e)?r.push(e.then(o)):t.add(e)}else if("function"==typeof c.reduce){const e=c.reduce(n,null);isPromise(e)&&r.push(e)}else if(c.constructor==Object)for(const e in c)t.add(c[e]);else t.add(c);return 0==r.length?t:promiseAll(r).then((()=>t))},setFlatMap=function(e,r){const t=setMap(e,r);return isPromise(t)?t.then(setFlatten):setFlatten(t)},funcConcat=(e,r)=>function(...t){const n=e(...t);return isPromise(n)?n.then(r):r(n)},arrayJoin=(e,r)=>e.join(r),arrayFlattenToString=funcConcat(arrayFlatten,curry2(arrayJoin,__,"")),stringFlatMap=function(e,r){const t=arrayMap(e,r);return isPromise(t)?t.then(arrayFlattenToString):arrayFlattenToString(t)},_flatMap=function(e,r){if(isArray(e))return arrayFlatMap(e,r);if(null==e)return r(e);if("function"==typeof e.then)return e.then(r);if("function"==typeof e.next)return symbolIterator in e?FlatMappingIterator(e,r):FlatMappingAsyncIterator(e,r);if("function"==typeof e.chain)return e.chain(r);if("function"==typeof e.flatMap)return e.flatMap(r);const t=e.constructor;return t==Object?objectFlatMap(e,r):t==Set?setFlatMap(e,r):"string"==typeof e||t==String?stringFlatMap(e,r):r(e)},flatMap=(e,r)=>"function"==typeof e?curry2(_flatMap,__,e):isPromise(e)?e.then(curry2(_flatMap,__,r)):_flatMap(e,r);export default flatMap;
package/dist/flatMap.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 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.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 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.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 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.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
@@ -54,7 +54,7 @@ const arrayForEach = function (array, callback) {
54
54
  promises = []
55
55
  let index = -1
56
56
  while (++index < length) {
57
- const operation = callback(array[index])
57
+ const operation = callback(array[index], index, array)
58
58
  if (isPromise(operation)) {
59
59
  promises.push(operation)
60
60
  }
@@ -65,7 +65,7 @@ const arrayForEach = function (array, callback) {
65
65
  const objectForEach = function (object, callback) {
66
66
  const promises = []
67
67
  for (const key in object) {
68
- const operation = callback(object[key])
68
+ const operation = callback(object[key], key, object)
69
69
  if (isPromise(operation)) {
70
70
  promises.push(operation)
71
71
  }
@@ -124,7 +124,7 @@ const arrayForEachSeries = function (array, callback) {
124
124
  const length = array.length
125
125
  let index = -1
126
126
  while (++index < length) {
127
- const operation = callback(array[index])
127
+ const operation = callback(array[index], index, array)
128
128
  if (isPromise(operation)) {
129
129
  return operation
130
130
  .then(thunkify3(_arrayForEachSeriesAsync, array, callback, index))
@@ -155,7 +155,7 @@ const objectForEachSeries = function (object, callback) {
155
155
  const doneKeys = {}
156
156
  for (const key in object) {
157
157
  doneKeys[key] = true
158
- const operation = callback(object[key])
158
+ const operation = callback(object[key], key, object)
159
159
  if (isPromise(operation)) {
160
160
  return operation
161
161
  .then(thunkify3(_objectForEachSeriesAsync, object, callback, doneKeys))
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 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"),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,thunkify3=(r,o,t,n)=>function(){return r(o,t,n)},_arrayForEachSeriesAsync=async function(r,o,t){const n=r.length;for(;++t<n;){const n=o(r[t]);isPromise(n)&&await n}return r},arrayForEachSeries=function(r,o){const t=r.length;let n=-1;for(;++n<t;){const t=o(r[n]);if(isPromise(t))return t.then(thunkify3(_arrayForEachSeriesAsync,r,o,n))}return r},_objectForEachSeriesAsync=async function(r,o,t){for(const n in r){if(n in t)continue;const e=o(r[n]);isPromise(e)&&await e}return r},objectForEachSeries=function(r,o){const t={};for(const n in r){t[n]=!0;const e=o(r[n]);if(isPromise(e))return e.then(thunkify3(_objectForEachSeriesAsync,r,o,t))}return r},thunkify2=(r,o,t)=>function(){return r(o,t)},_iteratorForEachSeriesAsync=async function(r,o){let t=r.next();for(;!t.done;){const n=o(t.value);isPromise(n)&&await n,t=r.next()}return r},iteratorForEachSeries=function(r,o){let t=r.next();for(;!r.done;){const n=o(t.value);if(isPromise(n))return n.then(thunkify2(_iteratorForEachSeriesAsync,r,o));t=r.next()}return r},asyncIteratorForEachSeries=async function(r,o){for await(const t of r){const r=o(t);isPromise(r)&&await r}return r},_forEach=function(r,o){return isArray(r)?arrayForEach(r,o):null==r?r:"function"==typeof r.forEach?(r.forEach(o),r):"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,o){return"function"==typeof r?curry2(_forEach,__,r):isPromise(r)?r.then(curry2(_forEach,__,o)):_forEach(r,o)},_forEachSeries=function(r,o){if(isArray(r))return arrayForEachSeries(r,o);if(null==r)throw new TypeError(`invalid collection ${r}`);if("function"==typeof r[symbolIterator])return iteratorForEachSeries(r[symbolIterator](),o);if("function"==typeof r[symbolAsyncIterator])return asyncIteratorForEachSeries(r[symbolAsyncIterator](),o);if(r.constructor==Object)return objectForEachSeries(r,o);throw new TypeError(`invalid collection ${r}`)};forEach.series=function(r,o){return"function"==typeof r?curry2(_forEachSeries,__,r):isPromise(r)?r.then(curry2(_forEachSeries,__,o)):_forEachSeries(r,o)};export default forEach;
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],e,r);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],n,r);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,thunkify3=(r,o,t,n)=>function(){return r(o,t,n)},_arrayForEachSeriesAsync=async function(r,o,t){const n=r.length;for(;++t<n;){const n=o(r[t]);isPromise(n)&&await n}return r},arrayForEachSeries=function(r,o){const t=r.length;let n=-1;for(;++n<t;){const t=o(r[n],n,r);if(isPromise(t))return t.then(thunkify3(_arrayForEachSeriesAsync,r,o,n))}return r},_objectForEachSeriesAsync=async function(r,o,t){for(const n in r){if(n in t)continue;const e=o(r[n]);isPromise(e)&&await e}return r},objectForEachSeries=function(r,o){const t={};for(const n in r){t[n]=!0;const e=o(r[n],n,r);if(isPromise(e))return e.then(thunkify3(_objectForEachSeriesAsync,r,o,t))}return r},thunkify2=(r,o,t)=>function(){return r(o,t)},_iteratorForEachSeriesAsync=async function(r,o){let t=r.next();for(;!t.done;){const n=o(t.value);isPromise(n)&&await n,t=r.next()}return r},iteratorForEachSeries=function(r,o){let t=r.next();for(;!r.done;){const n=o(t.value);if(isPromise(n))return n.then(thunkify2(_iteratorForEachSeriesAsync,r,o));t=r.next()}return r},asyncIteratorForEachSeries=async function(r,o){for await(const t of r){const r=o(t);isPromise(r)&&await r}return r},_forEach=function(r,o){return isArray(r)?arrayForEach(r,o):null==r?r:"function"==typeof r.forEach?(r.forEach(o),r):"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,o){return"function"==typeof r?curry2(_forEach,__,r):isPromise(r)?r.then(curry2(_forEach,__,o)):_forEach(r,o)},_forEachSeries=function(r,o){if(isArray(r))return arrayForEachSeries(r,o);if(null==r)throw new TypeError(`invalid collection ${r}`);if("function"==typeof r[symbolIterator])return iteratorForEachSeries(r[symbolIterator](),o);if("function"==typeof r[symbolAsyncIterator])return asyncIteratorForEachSeries(r[symbolAsyncIterator](),o);if(r.constructor==Object)return objectForEachSeries(r,o);throw new TypeError(`invalid collection ${r}`)};forEach.series=function(r,o){return"function"==typeof r?curry2(_forEachSeries,__,r):isPromise(r)?r.then(curry2(_forEachSeries,__,o)):_forEachSeries(r,o)};export default forEach;
package/dist/forEach.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
@@ -60,7 +60,7 @@ const arrayForEach = function (array, callback) {
60
60
  promises = []
61
61
  let index = -1
62
62
  while (++index < length) {
63
- const operation = callback(array[index])
63
+ const operation = callback(array[index], index, array)
64
64
  if (isPromise(operation)) {
65
65
  promises.push(operation)
66
66
  }
@@ -71,7 +71,7 @@ const arrayForEach = function (array, callback) {
71
71
  const objectForEach = function (object, callback) {
72
72
  const promises = []
73
73
  for (const key in object) {
74
- const operation = callback(object[key])
74
+ const operation = callback(object[key], key, object)
75
75
  if (isPromise(operation)) {
76
76
  promises.push(operation)
77
77
  }
@@ -130,7 +130,7 @@ const arrayForEachSeries = function (array, callback) {
130
130
  const length = array.length
131
131
  let index = -1
132
132
  while (++index < length) {
133
- const operation = callback(array[index])
133
+ const operation = callback(array[index], index, array)
134
134
  if (isPromise(operation)) {
135
135
  return operation
136
136
  .then(thunkify3(_arrayForEachSeriesAsync, array, callback, index))
@@ -161,7 +161,7 @@ const objectForEachSeries = function (object, callback) {
161
161
  const doneKeys = {}
162
162
  for (const key in object) {
163
163
  doneKeys[key] = true
164
- const operation = callback(object[key])
164
+ const operation = callback(object[key], key, object)
165
165
  if (isPromise(operation)) {
166
166
  return operation
167
167
  .then(thunkify3(_objectForEachSeriesAsync, object, callback, doneKeys))
@@ -1,8 +1,8 @@
1
1
  /**
2
- * rubico v2.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 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.forEach=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=n=>null!=n&&"function"==typeof n.then,t=Symbol.for("placeholder"),o=function(n,o,r){return o==t?((n,t)=>function(o){return n(o,t)})(n,r):((n,t)=>function(o){return n(t,o)})(n,o)},r=Array.isArray,e=(Object.prototype.toString,Promise.all.bind(Promise)),c=n=>function(){return n},u=Symbol.iterator,f=Symbol.asyncIterator,i=(n,t,o,r)=>function(){return n(t,o,r)},s=async function(t,o,r){const e=t.length;for(;++r<e;){const e=o(t[r]);n(e)&&await e}return t},l=async function(t,o,r){for(const e in t){if(e in r)continue;const c=o(t[e]);n(c)&&await c}return t},a=(n,t,o)=>function(){return n(t,o)},h=async function(t,o){let r=t.next();for(;!r.done;){const e=o(r.value);n(e)&&await e,r=t.next()}return t},y=function(t,o){return r(t)?function(t,o){const r=t.length,u=[];let f=-1;for(;++f<r;){const r=o(t[f]);n(r)&&u.push(r)}return 0==u.length?t:e(u).then(c(t))}(t,o):null==t?t:"function"==typeof t.forEach?(t.forEach(o),t):"function"==typeof t[u]?function(t,o){const r=[];for(const e of t){const t=o(e);n(t)&&r.push(t)}return 0==r.length?t:e(r).then(c(t))}(t[u](),o):"function"==typeof t[f]?async function(t,o){const r=[];for await(const e of t){const t=o(e);n(t)&&r.push(t)}return 0==r.length?t:e(r).then(c(t))}(t[f](),o):t.constructor==Object?function(t,o){const r=[];for(const e in t){const c=o(t[e]);n(c)&&r.push(c)}return 0==r.length?t:e(r).then(c(t))}(t,o):t},p=function(r,e){return"function"==typeof r?o(y,t,r):n(r)?r.then(o(y,t,e)):y(r,e)},b=function(t,o){if(r(t))return function(t,o){const r=t.length;let e=-1;for(;++e<r;){const r=o(t[e]);if(n(r))return r.then(i(s,t,o,e))}return t}(t,o);if(null==t)throw new TypeError(`invalid collection ${t}`);if("function"==typeof t[u])return function(t,o){let r=t.next();for(;!t.done;){const e=o(r.value);if(n(e))return e.then(a(h,t,o));r=t.next()}return t}(t[u](),o);if("function"==typeof t[f])return async function(t,o){for await(const r of t){const t=o(r);n(t)&&await t}return t}(t[f](),o);if(t.constructor==Object)return function(t,o){const r={};for(const e in t){r[e]=!0;const c=o(t[e]);if(n(c))return c.then(i(l,t,o,r))}return t}(t,o);throw new TypeError(`invalid collection ${t}`)};return p.series=function(r,e){return"function"==typeof r?o(b,t,r):n(r)?r.then(o(b,t,e)):b(r,e)},p}());
8
+ !function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((()=>t)):n.forEach=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=n=>null!=n&&"function"==typeof n.then,t=Symbol.for("placeholder"),o=function(n,o,r){return o==t?((n,t)=>function(o){return n(o,t)})(n,r):((n,t)=>function(o){return n(t,o)})(n,o)},r=Array.isArray,e=(Object.prototype.toString,Promise.all.bind(Promise)),c=n=>function(){return n},u=Symbol.iterator,f=Symbol.asyncIterator,i=(n,t,o,r)=>function(){return n(t,o,r)},s=async function(t,o,r){const e=t.length;for(;++r<e;){const e=o(t[r]);n(e)&&await e}return t},l=async function(t,o,r){for(const e in t){if(e in r)continue;const c=o(t[e]);n(c)&&await c}return t},a=(n,t,o)=>function(){return n(t,o)},h=async function(t,o){let r=t.next();for(;!r.done;){const e=o(r.value);n(e)&&await e,r=t.next()}return t},y=function(t,o){return r(t)?function(t,o){const r=t.length,u=[];let f=-1;for(;++f<r;){const r=o(t[f],f,t);n(r)&&u.push(r)}return 0==u.length?t:e(u).then(c(t))}(t,o):null==t?t:"function"==typeof t.forEach?(t.forEach(o),t):"function"==typeof t[u]?function(t,o){const r=[];for(const e of t){const t=o(e);n(t)&&r.push(t)}return 0==r.length?t:e(r).then(c(t))}(t[u](),o):"function"==typeof t[f]?async function(t,o){const r=[];for await(const e of t){const t=o(e);n(t)&&r.push(t)}return 0==r.length?t:e(r).then(c(t))}(t[f](),o):t.constructor==Object?function(t,o){const r=[];for(const e in t){const c=o(t[e],e,t);n(c)&&r.push(c)}return 0==r.length?t:e(r).then(c(t))}(t,o):t},p=function(r,e){return"function"==typeof r?o(y,t,r):n(r)?r.then(o(y,t,e)):y(r,e)},b=function(t,o){if(r(t))return function(t,o){const r=t.length;let e=-1;for(;++e<r;){const r=o(t[e],e,t);if(n(r))return r.then(i(s,t,o,e))}return t}(t,o);if(null==t)throw new TypeError(`invalid collection ${t}`);if("function"==typeof t[u])return function(t,o){let r=t.next();for(;!t.done;){const e=o(r.value);if(n(e))return e.then(a(h,t,o));r=t.next()}return t}(t[u](),o);if("function"==typeof t[f])return async function(t,o){for await(const r of t){const t=o(r);n(t)&&await t}return t}(t[f](),o);if(t.constructor==Object)return function(t,o){const r={};for(const e in t){r[e]=!0;const c=o(t[e],e,t);if(n(c))return c.then(i(l,t,o,r))}return t}(t,o);throw new TypeError(`invalid collection ${t}`)};return p.series=function(r,e){return"function"==typeof r?o(b,t,r):n(r)?r.then(o(b,t,e)):b(r,e)},p}());
package/dist/forEach.mjs CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
@@ -54,7 +54,7 @@ const arrayForEach = function (array, callback) {
54
54
  promises = []
55
55
  let index = -1
56
56
  while (++index < length) {
57
- const operation = callback(array[index])
57
+ const operation = callback(array[index], index, array)
58
58
  if (isPromise(operation)) {
59
59
  promises.push(operation)
60
60
  }
@@ -65,7 +65,7 @@ const arrayForEach = function (array, callback) {
65
65
  const objectForEach = function (object, callback) {
66
66
  const promises = []
67
67
  for (const key in object) {
68
- const operation = callback(object[key])
68
+ const operation = callback(object[key], key, object)
69
69
  if (isPromise(operation)) {
70
70
  promises.push(operation)
71
71
  }
@@ -124,7 +124,7 @@ const arrayForEachSeries = function (array, callback) {
124
124
  const length = array.length
125
125
  let index = -1
126
126
  while (++index < length) {
127
- const operation = callback(array[index])
127
+ const operation = callback(array[index], index, array)
128
128
  if (isPromise(operation)) {
129
129
  return operation
130
130
  .then(thunkify3(_arrayForEachSeriesAsync, array, callback, index))
@@ -155,7 +155,7 @@ const objectForEachSeries = function (object, callback) {
155
155
  const doneKeys = {}
156
156
  for (const key in object) {
157
157
  doneKeys[key] = true
158
- const operation = callback(object[key])
158
+ const operation = callback(object[key], key, object)
159
159
  if (isPromise(operation)) {
160
160
  return operation
161
161
  .then(thunkify3(_objectForEachSeriesAsync, object, callback, doneKeys))
package/dist/get.es.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 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.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 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"),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):isPromise(r)?r.then(curry3(_get,__,e,t)):_get(r,e,t)};export default get;
package/dist/get.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
package/dist/get.min.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
package/dist/get.mjs CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7
 
package/dist/gt.es.js CHANGED
@@ -1,7 +1,7 @@
1
1
  /**
2
- * rubico v2.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 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.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 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,areAnyValuesPromises=function(r){if(isArray(r)){const e=r.length;let s=-1;for(;++s<e;){const e=r[s];if(isPromise(e))return!0}return!1}for(const e in r){const s=r[e];if(isPromise(s))return!0}return!1},__=Symbol.for("placeholder"),curry4ResolveArg0=(r,e,s,o)=>function(t){return r(t,e,s,o)},curry4ResolveArg1=(r,e,s,o)=>function(t){return r(e,t,s,o)},curry4ResolveArg2=(r,e,s,o)=>function(t){return r(e,s,t,o)},curry4ResolveArg3=(r,e,s,o)=>function(t){return r(e,s,o,t)},curry4=function(r,e,s,o,t){return e==__?curry4ResolveArg0(r,s,o,t):s==__?curry4ResolveArg1(r,e,o,t):o==__?curry4ResolveArg2(r,e,s,t):curry4ResolveArg3(r,e,s,o)},curryArgs4ResolveArgs0=(r,e,s,o)=>function(...t){return r(t,e,s,o)},curryArgs4ResolveArgs1=(r,e,s,o)=>function(...t){return r(e,t,s,o)},curryArgs4ResolveArgs2=(r,e,s,o)=>function(...t){return r(e,s,t,o)},curryArgs4ResolveArgs3=(r,e,s,o)=>function(...t){return r(e,s,o,t)},curryArgs4=function(r,e,s,o,t){return e==__?curryArgs4ResolveArgs0(r,s,o,t):s==__?curryArgs4ResolveArgs1(r,e,o,t):o==__?curryArgs4ResolveArgs2(r,e,s,t):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 t=s(...r),n=o(...r);return isPromise(t)||isPromise(n)?promiseAll([t,n]).then(spread2(e)):e(t,n)},leftResolverRightValueCompare=function(r,e,s,o){const t=s(...r);return isPromise(t)||isPromise(o)?promiseAll([t,o]).then(spread2(e)):e(t,o)},leftValueRightResolverCompare=function(r,e,s,o){const t=o(...r);return isPromise(s)||isPromise(t)?promiseAll([s,t]).then(spread2(e)):e(s,t)},ComparisonOperator=r=>function(...e){const s=e.pop(),o=e.pop(),t="function"==typeof o,n="function"==typeof s;return t&&n?0==e.length?curryArgs4(leftResolverRightResolverCompare,__,r,o,s):areAnyValuesPromises(e)?promiseAll(e).then(curry4(leftResolverRightResolverCompare,__,r,o,s)):leftResolverRightResolverCompare(e,r,o,s):t?0==e.length?curryArgs4(leftResolverRightValueCompare,__,r,o,s):areAnyValuesPromises(e)?promiseAll(e).then(curry4(leftResolverRightValueCompare,__,r,o,s)):leftResolverRightValueCompare(e,r,o,s):n?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)},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.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 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.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 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.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 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.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 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.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 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,areAnyValuesPromises=function(r){if(isArray(r)){const e=r.length;let s=-1;for(;++s<e;){const e=r[s];if(isPromise(e))return!0}return!1}for(const e in r){const s=r[e];if(isPromise(s))return!0}return!1},__=Symbol.for("placeholder"),curry4ResolveArg0=(r,e,s,o)=>function(t){return r(t,e,s,o)},curry4ResolveArg1=(r,e,s,o)=>function(t){return r(e,t,s,o)},curry4ResolveArg2=(r,e,s,o)=>function(t){return r(e,s,t,o)},curry4ResolveArg3=(r,e,s,o)=>function(t){return r(e,s,o,t)},curry4=function(r,e,s,o,t){return e==__?curry4ResolveArg0(r,s,o,t):s==__?curry4ResolveArg1(r,e,o,t):o==__?curry4ResolveArg2(r,e,s,t):curry4ResolveArg3(r,e,s,o)},curryArgs4ResolveArgs0=(r,e,s,o)=>function(...t){return r(t,e,s,o)},curryArgs4ResolveArgs1=(r,e,s,o)=>function(...t){return r(e,t,s,o)},curryArgs4ResolveArgs2=(r,e,s,o)=>function(...t){return r(e,s,t,o)},curryArgs4ResolveArgs3=(r,e,s,o)=>function(...t){return r(e,s,o,t)},curryArgs4=function(r,e,s,o,t){return e==__?curryArgs4ResolveArgs0(r,s,o,t):s==__?curryArgs4ResolveArgs1(r,e,o,t):o==__?curryArgs4ResolveArgs2(r,e,s,t):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 t=s(...r),n=o(...r);return isPromise(t)||isPromise(n)?promiseAll([t,n]).then(spread2(e)):e(t,n)},leftResolverRightValueCompare=function(r,e,s,o){const t=s(...r);return isPromise(t)||isPromise(o)?promiseAll([t,o]).then(spread2(e)):e(t,o)},leftValueRightResolverCompare=function(r,e,s,o){const t=o(...r);return isPromise(s)||isPromise(t)?promiseAll([s,t]).then(spread2(e)):e(s,t)},ComparisonOperator=r=>function(...e){const s=e.pop(),o=e.pop(),t="function"==typeof o,n="function"==typeof s;return t&&n?0==e.length?curryArgs4(leftResolverRightResolverCompare,__,r,o,s):areAnyValuesPromises(e)?promiseAll(e).then(curry4(leftResolverRightResolverCompare,__,r,o,s)):leftResolverRightResolverCompare(e,r,o,s):t?0==e.length?curryArgs4(leftResolverRightValueCompare,__,r,o,s):areAnyValuesPromises(e)?promiseAll(e).then(curry4(leftResolverRightValueCompare,__,r,o,s)):leftResolverRightValueCompare(e,r,o,s):n?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)},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.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 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.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 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.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 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.7.7
2
+ * rubico v2.7.9
3
3
  * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2025 Richard Tong
4
+ * (c) 2019-2026 Richard Tong
5
5
  * rubico may be freely distributed under the MIT license.
6
6
  */
7
7