rubico 2.8.1 → 2.8.3

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 (368) hide show
  1. package/README.md +10 -10
  2. package/dist/Transducer.es.js +5 -4
  3. package/dist/Transducer.es.min.js +5 -4
  4. package/dist/Transducer.js +5 -4
  5. package/dist/Transducer.min.js +6 -5
  6. package/dist/Transducer.mjs +5 -4
  7. package/dist/__.es.js +5 -4
  8. package/dist/__.es.min.js +5 -4
  9. package/dist/__.js +5 -4
  10. package/dist/__.min.js +6 -5
  11. package/dist/__.mjs +5 -4
  12. package/dist/all.es.js +5 -4
  13. package/dist/all.es.min.js +5 -4
  14. package/dist/all.js +5 -4
  15. package/dist/all.min.js +6 -5
  16. package/dist/all.mjs +5 -4
  17. package/dist/always.es.js +5 -4
  18. package/dist/always.es.min.js +5 -4
  19. package/dist/always.js +5 -4
  20. package/dist/always.min.js +6 -5
  21. package/dist/always.mjs +5 -4
  22. package/dist/and.es.js +5 -4
  23. package/dist/and.es.min.js +5 -4
  24. package/dist/and.js +5 -4
  25. package/dist/and.min.js +6 -5
  26. package/dist/and.mjs +5 -4
  27. package/dist/assign.es.js +5 -4
  28. package/dist/assign.es.min.js +5 -4
  29. package/dist/assign.js +5 -4
  30. package/dist/assign.min.js +6 -5
  31. package/dist/assign.mjs +5 -4
  32. package/dist/compose.es.js +5 -4
  33. package/dist/compose.es.min.js +5 -4
  34. package/dist/compose.js +5 -4
  35. package/dist/compose.min.js +6 -5
  36. package/dist/compose.mjs +5 -4
  37. package/dist/curry.es.js +5 -4
  38. package/dist/curry.es.min.js +5 -4
  39. package/dist/curry.js +5 -4
  40. package/dist/curry.min.js +6 -5
  41. package/dist/curry.mjs +5 -4
  42. package/dist/eq.es.js +5 -4
  43. package/dist/eq.es.min.js +5 -4
  44. package/dist/eq.js +5 -4
  45. package/dist/eq.min.js +6 -5
  46. package/dist/eq.mjs +5 -4
  47. package/dist/every.es.js +5 -4
  48. package/dist/every.es.min.js +6 -5
  49. package/dist/every.js +5 -4
  50. package/dist/every.min.js +6 -5
  51. package/dist/every.mjs +5 -4
  52. package/dist/filter.es.js +5 -4
  53. package/dist/filter.es.min.js +5 -4
  54. package/dist/filter.js +5 -4
  55. package/dist/filter.min.js +6 -5
  56. package/dist/filter.mjs +5 -4
  57. package/dist/flatMap.es.js +5 -4
  58. package/dist/flatMap.es.min.js +6 -5
  59. package/dist/flatMap.js +5 -4
  60. package/dist/flatMap.min.js +6 -5
  61. package/dist/flatMap.mjs +5 -4
  62. package/dist/forEach.es.js +5 -4
  63. package/dist/forEach.es.min.js +5 -4
  64. package/dist/forEach.js +5 -4
  65. package/dist/forEach.min.js +6 -5
  66. package/dist/forEach.mjs +5 -4
  67. package/dist/get.es.js +5 -4
  68. package/dist/get.es.min.js +5 -4
  69. package/dist/get.js +5 -4
  70. package/dist/get.min.js +6 -5
  71. package/dist/get.mjs +5 -4
  72. package/dist/gt.es.js +5 -4
  73. package/dist/gt.es.min.js +5 -4
  74. package/dist/gt.js +5 -4
  75. package/dist/gt.min.js +6 -5
  76. package/dist/gt.mjs +5 -4
  77. package/dist/gte.es.js +5 -4
  78. package/dist/gte.es.min.js +5 -4
  79. package/dist/gte.js +5 -4
  80. package/dist/gte.min.js +6 -5
  81. package/dist/gte.mjs +5 -4
  82. package/dist/lt.es.js +5 -4
  83. package/dist/lt.es.min.js +5 -4
  84. package/dist/lt.js +5 -4
  85. package/dist/lt.min.js +6 -5
  86. package/dist/lt.mjs +5 -4
  87. package/dist/lte.es.js +5 -4
  88. package/dist/lte.es.min.js +5 -4
  89. package/dist/lte.js +5 -4
  90. package/dist/lte.min.js +6 -5
  91. package/dist/lte.mjs +5 -4
  92. package/dist/map.es.js +5 -4
  93. package/dist/map.es.min.js +6 -5
  94. package/dist/map.js +5 -4
  95. package/dist/map.min.js +6 -5
  96. package/dist/map.mjs +5 -4
  97. package/dist/not.es.js +5 -4
  98. package/dist/not.es.min.js +5 -4
  99. package/dist/not.js +5 -4
  100. package/dist/not.min.js +6 -5
  101. package/dist/not.mjs +5 -4
  102. package/dist/omit.es.js +5 -4
  103. package/dist/omit.es.min.js +5 -4
  104. package/dist/omit.js +5 -4
  105. package/dist/omit.min.js +6 -5
  106. package/dist/omit.mjs +5 -4
  107. package/dist/or.es.js +5 -4
  108. package/dist/or.es.min.js +5 -4
  109. package/dist/or.js +5 -4
  110. package/dist/or.min.js +6 -5
  111. package/dist/or.mjs +5 -4
  112. package/dist/pick.es.js +5 -4
  113. package/dist/pick.es.min.js +5 -4
  114. package/dist/pick.js +5 -4
  115. package/dist/pick.min.js +6 -5
  116. package/dist/pick.mjs +5 -4
  117. package/dist/pipe.es.js +5 -4
  118. package/dist/pipe.es.min.js +5 -4
  119. package/dist/pipe.js +5 -4
  120. package/dist/pipe.min.js +6 -5
  121. package/dist/pipe.mjs +5 -4
  122. package/dist/reduce.es.js +5 -4
  123. package/dist/reduce.es.min.js +5 -4
  124. package/dist/reduce.js +5 -4
  125. package/dist/reduce.min.js +6 -5
  126. package/dist/reduce.mjs +5 -4
  127. package/dist/rubico.es.js +5 -4
  128. package/dist/rubico.es.min.js +6 -5
  129. package/dist/rubico.global.js +5 -4
  130. package/dist/rubico.global.min.js +6 -5
  131. package/dist/rubico.js +5 -4
  132. package/dist/rubico.min.js +6 -5
  133. package/dist/rubico.mjs +5 -4
  134. package/dist/set.es.js +5 -4
  135. package/dist/set.es.min.js +5 -4
  136. package/dist/set.js +5 -4
  137. package/dist/set.min.js +6 -5
  138. package/dist/set.mjs +5 -4
  139. package/dist/some.es.js +5 -4
  140. package/dist/some.es.min.js +6 -5
  141. package/dist/some.js +5 -4
  142. package/dist/some.min.js +6 -5
  143. package/dist/some.mjs +5 -4
  144. package/dist/switchCase.es.js +5 -4
  145. package/dist/switchCase.es.min.js +5 -4
  146. package/dist/switchCase.js +5 -4
  147. package/dist/switchCase.min.js +6 -5
  148. package/dist/switchCase.mjs +5 -4
  149. package/dist/tap.es.js +5 -4
  150. package/dist/tap.es.min.js +5 -4
  151. package/dist/tap.js +5 -4
  152. package/dist/tap.min.js +6 -5
  153. package/dist/tap.mjs +5 -4
  154. package/dist/thunkify.es.js +5 -4
  155. package/dist/thunkify.es.min.js +5 -4
  156. package/dist/thunkify.js +5 -4
  157. package/dist/thunkify.min.js +6 -5
  158. package/dist/thunkify.mjs +5 -4
  159. package/dist/transform.es.js +5 -4
  160. package/dist/transform.es.min.js +5 -4
  161. package/dist/transform.js +5 -4
  162. package/dist/transform.min.js +6 -5
  163. package/dist/transform.mjs +5 -4
  164. package/dist/tryCatch.es.js +5 -4
  165. package/dist/tryCatch.es.min.js +5 -4
  166. package/dist/tryCatch.js +5 -4
  167. package/dist/tryCatch.min.js +6 -5
  168. package/dist/tryCatch.mjs +5 -4
  169. package/dist/x/append.es.js +5 -4
  170. package/dist/x/append.es.min.js +5 -4
  171. package/dist/x/append.js +5 -4
  172. package/dist/x/append.min.js +6 -5
  173. package/dist/x/append.mjs +5 -4
  174. package/dist/x/callProp.es.js +5 -4
  175. package/dist/x/callProp.es.min.js +5 -4
  176. package/dist/x/callProp.js +5 -4
  177. package/dist/x/callProp.min.js +6 -5
  178. package/dist/x/callProp.mjs +5 -4
  179. package/dist/x/defaultsDeep.es.js +5 -4
  180. package/dist/x/defaultsDeep.es.min.js +5 -4
  181. package/dist/x/defaultsDeep.js +5 -4
  182. package/dist/x/defaultsDeep.min.js +6 -5
  183. package/dist/x/defaultsDeep.mjs +5 -4
  184. package/dist/x/differenceWith.es.js +5 -4
  185. package/dist/x/differenceWith.es.min.js +6 -5
  186. package/dist/x/differenceWith.js +5 -4
  187. package/dist/x/differenceWith.min.js +6 -5
  188. package/dist/x/differenceWith.mjs +5 -4
  189. package/dist/x/filterOut.es.js +5 -4
  190. package/dist/x/filterOut.es.min.js +5 -4
  191. package/dist/x/filterOut.js +5 -4
  192. package/dist/x/filterOut.min.js +6 -5
  193. package/dist/x/filterOut.mjs +5 -4
  194. package/dist/x/find.es.js +5 -4
  195. package/dist/x/find.es.min.js +5 -4
  196. package/dist/x/find.js +5 -4
  197. package/dist/x/find.min.js +6 -5
  198. package/dist/x/find.mjs +5 -4
  199. package/dist/x/findIndex.es.js +5 -4
  200. package/dist/x/findIndex.es.min.js +5 -4
  201. package/dist/x/findIndex.js +5 -4
  202. package/dist/x/findIndex.min.js +6 -5
  203. package/dist/x/findIndex.mjs +5 -4
  204. package/dist/x/first.es.js +5 -4
  205. package/dist/x/first.es.min.js +5 -4
  206. package/dist/x/first.js +5 -4
  207. package/dist/x/first.min.js +6 -5
  208. package/dist/x/first.mjs +5 -4
  209. package/dist/x/flatten.es.js +5 -4
  210. package/dist/x/flatten.es.min.js +6 -5
  211. package/dist/x/flatten.js +5 -4
  212. package/dist/x/flatten.min.js +6 -5
  213. package/dist/x/flatten.mjs +5 -4
  214. package/dist/x/groupBy.es.js +5 -4
  215. package/dist/x/groupBy.es.min.js +5 -4
  216. package/dist/x/groupBy.js +5 -4
  217. package/dist/x/groupBy.min.js +6 -5
  218. package/dist/x/groupBy.mjs +5 -4
  219. package/dist/x/has.es.js +5 -4
  220. package/dist/x/has.es.min.js +5 -4
  221. package/dist/x/has.js +5 -4
  222. package/dist/x/has.min.js +6 -5
  223. package/dist/x/has.mjs +5 -4
  224. package/dist/x/identity.es.js +5 -4
  225. package/dist/x/identity.es.min.js +5 -4
  226. package/dist/x/identity.js +5 -4
  227. package/dist/x/identity.min.js +6 -5
  228. package/dist/x/identity.mjs +5 -4
  229. package/dist/x/includes.es.js +5 -4
  230. package/dist/x/includes.es.min.js +5 -4
  231. package/dist/x/includes.js +5 -4
  232. package/dist/x/includes.min.js +6 -5
  233. package/dist/x/includes.mjs +5 -4
  234. package/dist/x/isDeepEqual.es.js +5 -4
  235. package/dist/x/isDeepEqual.es.min.js +5 -4
  236. package/dist/x/isDeepEqual.js +5 -4
  237. package/dist/x/isDeepEqual.min.js +6 -5
  238. package/dist/x/isDeepEqual.mjs +5 -4
  239. package/dist/x/isEmpty.es.js +5 -4
  240. package/dist/x/isEmpty.es.min.js +5 -4
  241. package/dist/x/isEmpty.js +5 -4
  242. package/dist/x/isEmpty.min.js +6 -5
  243. package/dist/x/isEmpty.mjs +5 -4
  244. package/dist/x/isEqual.es.js +5 -4
  245. package/dist/x/isEqual.es.min.js +5 -4
  246. package/dist/x/isEqual.js +5 -4
  247. package/dist/x/isEqual.min.js +6 -5
  248. package/dist/x/isEqual.mjs +5 -4
  249. package/dist/x/isFunction.es.js +5 -4
  250. package/dist/x/isFunction.es.min.js +5 -4
  251. package/dist/x/isFunction.js +5 -4
  252. package/dist/x/isFunction.min.js +6 -5
  253. package/dist/x/isFunction.mjs +5 -4
  254. package/dist/x/isIn.es.js +5 -4
  255. package/dist/x/isIn.es.min.js +5 -4
  256. package/dist/x/isIn.js +5 -4
  257. package/dist/x/isIn.min.js +6 -5
  258. package/dist/x/isIn.mjs +5 -4
  259. package/dist/x/isObject.es.js +5 -4
  260. package/dist/x/isObject.es.min.js +5 -4
  261. package/dist/x/isObject.js +5 -4
  262. package/dist/x/isObject.min.js +6 -5
  263. package/dist/x/isObject.mjs +5 -4
  264. package/dist/x/isString.es.js +5 -4
  265. package/dist/x/isString.es.min.js +5 -4
  266. package/dist/x/isString.js +5 -4
  267. package/dist/x/isString.min.js +6 -5
  268. package/dist/x/isString.mjs +5 -4
  269. package/dist/x/keys.es.js +5 -4
  270. package/dist/x/keys.es.min.js +5 -4
  271. package/dist/x/keys.js +5 -4
  272. package/dist/x/keys.min.js +6 -5
  273. package/dist/x/keys.mjs +5 -4
  274. package/dist/x/last.es.js +5 -4
  275. package/dist/x/last.es.min.js +5 -4
  276. package/dist/x/last.js +5 -4
  277. package/dist/x/last.min.js +6 -5
  278. package/dist/x/last.mjs +5 -4
  279. package/dist/x/maxBy.es.js +5 -4
  280. package/dist/x/maxBy.es.min.js +5 -4
  281. package/dist/x/maxBy.js +5 -4
  282. package/dist/x/maxBy.min.js +6 -5
  283. package/dist/x/maxBy.mjs +5 -4
  284. package/dist/x/noop.es.js +5 -4
  285. package/dist/x/noop.es.min.js +5 -4
  286. package/dist/x/noop.js +5 -4
  287. package/dist/x/noop.min.js +6 -5
  288. package/dist/x/noop.mjs +5 -4
  289. package/dist/x/pluck.es.js +5 -4
  290. package/dist/x/pluck.es.min.js +6 -5
  291. package/dist/x/pluck.js +5 -4
  292. package/dist/x/pluck.min.js +6 -5
  293. package/dist/x/pluck.mjs +5 -4
  294. package/dist/x/prepend.es.js +5 -4
  295. package/dist/x/prepend.es.min.js +5 -4
  296. package/dist/x/prepend.js +5 -4
  297. package/dist/x/prepend.min.js +6 -5
  298. package/dist/x/prepend.mjs +5 -4
  299. package/dist/x/size.es.js +5 -4
  300. package/dist/x/size.es.min.js +5 -4
  301. package/dist/x/size.js +5 -4
  302. package/dist/x/size.min.js +6 -5
  303. package/dist/x/size.mjs +5 -4
  304. package/dist/x/trace.es.js +5 -4
  305. package/dist/x/trace.es.min.js +5 -4
  306. package/dist/x/trace.js +5 -4
  307. package/dist/x/trace.min.js +6 -5
  308. package/dist/x/trace.mjs +5 -4
  309. package/dist/x/unionWith.es.js +5 -4
  310. package/dist/x/unionWith.es.min.js +5 -4
  311. package/dist/x/unionWith.js +5 -4
  312. package/dist/x/unionWith.min.js +6 -5
  313. package/dist/x/unionWith.mjs +5 -4
  314. package/dist/x/uniq.es.js +5 -4
  315. package/dist/x/uniq.es.min.js +5 -4
  316. package/dist/x/uniq.js +5 -4
  317. package/dist/x/uniq.min.js +6 -5
  318. package/dist/x/uniq.mjs +5 -4
  319. package/dist/x/unless.es.js +5 -4
  320. package/dist/x/unless.es.min.js +5 -4
  321. package/dist/x/unless.js +5 -4
  322. package/dist/x/unless.min.js +6 -5
  323. package/dist/x/unless.mjs +5 -4
  324. package/dist/x/values.es.js +5 -4
  325. package/dist/x/values.es.min.js +5 -4
  326. package/dist/x/values.js +5 -4
  327. package/dist/x/values.min.js +6 -5
  328. package/dist/x/values.mjs +5 -4
  329. package/dist/x/when.es.js +5 -4
  330. package/dist/x/when.es.min.js +5 -4
  331. package/dist/x/when.js +5 -4
  332. package/dist/x/when.min.js +6 -5
  333. package/dist/x/when.mjs +5 -4
  334. package/es.js +5 -4
  335. package/index.js +5 -4
  336. package/package.json +1 -1
  337. package/thunkify.js +9 -3
  338. package/x/append.js +1 -1
  339. package/x/callProp.js +1 -1
  340. package/x/defaultsDeep.js +1 -1
  341. package/x/differenceWith.js +2 -2
  342. package/x/find.js +1 -1
  343. package/x/findIndex.js +1 -1
  344. package/x/first.js +1 -1
  345. package/x/flatten.js +1 -1
  346. package/x/groupBy.js +2 -2
  347. package/x/has.js +1 -1
  348. package/x/identity.js +1 -1
  349. package/x/includes.js +1 -1
  350. package/x/isDeepEqual.js +2 -2
  351. package/x/isEmpty.js +1 -1
  352. package/x/isFunction.js +1 -1
  353. package/x/isIn.js +2 -2
  354. package/x/isObject.js +1 -1
  355. package/x/isString.js +1 -1
  356. package/x/keys.js +1 -1
  357. package/x/last.js +1 -1
  358. package/x/maxBy.js +2 -2
  359. package/x/noop.js +1 -1
  360. package/x/pluck.js +1 -1
  361. package/x/prepend.js +1 -1
  362. package/x/size.js +1 -1
  363. package/x/trace.js +1 -1
  364. package/x/unionWith.js +2 -2
  365. package/x/uniq.js +1 -1
  366. package/x/unless.js +1 -1
  367. package/x/values.js +1 -1
  368. package/x/when.js +1 -1
package/dist/tryCatch.mjs CHANGED
@@ -1,8 +1,9 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
 
8
9
  const isPromise = value => value != null && typeof value.then == 'function'
@@ -1,8 +1,9 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
 
8
9
  const isString = function (value) {
@@ -1,7 +1,8 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
  const isString=function(r){return"string"==typeof r||null!=r&&r.constructor==String},isArray=Array.isArray,append=r=>function(n){if(isArray(n))return isArray(r)?[...n,...r]:[...n,r];if(isString(n)){if(!isString(r))throw new TypeError(`${r} is not a string`);return`${n}${r}`}throw new TypeError(`${n} is not an Array or string`)};export default append;
package/dist/x/append.js CHANGED
@@ -1,8 +1,9 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
 
8
9
  (function (root, append) {
@@ -1,8 +1,9 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
 
8
- !function(r,t){"object"==typeof module?module.exports=t:"function"==typeof define?define(()=>t):r.append=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const r=function(r){return"string"==typeof r||null!=r&&r.constructor==String},t=Array.isArray;return n=>function(o){if(t(o))return t(n)?[...o,...n]:[...o,n];if(r(o)){if(!r(n))throw new TypeError(`${n} is not a string`);return`${o}${n}`}throw new TypeError(`${o} is not an Array or string`)}}());
9
+ !function(r,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((()=>t)):r.append=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const r=function(r){return"string"==typeof r||null!=r&&r.constructor==String},t=Array.isArray;return n=>function(o){if(t(o))return t(n)?[...o,...n]:[...o,n];if(r(o)){if(!r(n))throw new TypeError(`${n} is not a string`);return`${o}${n}`}throw new TypeError(`${o} is not an Array or string`)}}());
package/dist/x/append.mjs CHANGED
@@ -1,8 +1,9 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
 
8
9
  const isString = function (value) {
@@ -1,8 +1,9 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
 
8
9
  const callProp = (property, ...args) => function callingProp(object) {
@@ -1,7 +1,8 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
  const callProp=(l,...o)=>function(r){return r[l](...o)};export default callProp;
@@ -1,8 +1,9 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
 
8
9
  (function (root, callProp) {
@@ -1,8 +1,9 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
 
8
- !function(e,o){"object"==typeof module?module.exports=o:"function"==typeof define?define(()=>o):e.callProp=o}("object"==typeof globalThis?globalThis:this,function(){"use strict";return(e,...o)=>function(t){return t[e](...o)}}());
9
+ !function(e,o){"object"==typeof module?module.exports=o:"function"==typeof define?define((()=>o)):e.callProp=o}("object"==typeof globalThis?globalThis:this,function(){"use strict";return(e,...o)=>function(t){return t[e](...o)}}());
@@ -1,8 +1,9 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
 
8
9
  const callProp = (property, ...args) => function callingProp(object) {
@@ -1,8 +1,9 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
 
8
9
  const isArray = Array.isArray
@@ -1,7 +1,8 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
  const isArray=Array.isArray,__=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)};function arrayDefaultsDeepFromArray(r,e){const t=e.length,o=r.slice();let u=-1;for(;++u<t;){const t=r[u],n=e[u];isArray(t)&&isArray(n)?o[u]=arrayDefaultsDeepFromArray(t,n):null==t?o[u]=n:null==n?o[u]=t:t.constructor==Object&&n.constructor==Object?o[u]=objectDefaultsDeepFromObject(t,n):o[u]=t}return o}function objectDefaultsDeepFromObject(r,e){const t={...r};for(const o in e){const u=r[o],n=e[o];isArray(u)&&isArray(n)?t[o]=arrayDefaultsDeepFromArray(u,n):null==u?t[o]=n:null==n?t[o]=u:u.constructor==Object&&n.constructor==Object?t[o]=objectDefaultsDeepFromObject(u,n):t[o]=u}return t}function _defaultsDeep(r,e){return isArray(r)&&isArray(e)?arrayDefaultsDeepFromArray(r,e):null==r||null==e?r:r.constructor==Object&&e.constructor==Object?objectDefaultsDeepFromObject(r,e):r}function defaultsDeep(...r){if(1==r.length)return curry2(_defaultsDeep,__,r[0]);if(2==r.length)return _defaultsDeep(...r);throw new TypeError("Invalid number of arguments")}export default defaultsDeep;
@@ -1,8 +1,9 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
 
8
9
  (function (root, defaultsDeep) {
@@ -1,8 +1,9 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
 
8
- !function(t,n){"object"==typeof module?module.exports=n:"function"==typeof define?define(()=>n):t.defaultsDeep=n}("object"==typeof globalThis?globalThis:this,function(){"use strict";const t=Array.isArray,n=Symbol.for("placeholder");function o(n,e){const c=e.length,u=n.slice();let l=-1;for(;++l<c;){const c=n[l],s=e[l];t(c)&&t(s)?u[l]=o(c,s):null==c?u[l]=s:null==s?u[l]=c:c.constructor==Object&&s.constructor==Object?u[l]=r(c,s):u[l]=c}return u}function r(n,e){const c={...n};for(const u in e){const l=n[u],s=e[u];t(l)&&t(s)?c[u]=o(l,s):null==l?c[u]=s:null==s?c[u]=l:l.constructor==Object&&s.constructor==Object?c[u]=r(l,s):c[u]=l}return c}function e(n,e){return t(n)&&t(e)?o(n,e):null==n||null==e?n:n.constructor==Object&&e.constructor==Object?r(n,e):n}return function(...t){if(1==t.length)return o=e,r=n,c=t[0],r==n?((t,n)=>function(o){return t(o,n)})(o,c):((t,n)=>function(o){return t(n,o)})(o,r);var o,r,c;if(2==t.length)return e(...t);throw new TypeError("Invalid number of arguments")}}());
9
+ !function(t,n){"object"==typeof module?module.exports=n:"function"==typeof define?define((()=>n)):t.defaultsDeep=n}("object"==typeof globalThis?globalThis:this,function(){"use strict";const t=Array.isArray,n=Symbol.for("placeholder");function o(n,e){const c=e.length,u=n.slice();let l=-1;for(;++l<c;){const c=n[l],s=e[l];t(c)&&t(s)?u[l]=o(c,s):null==c?u[l]=s:null==s?u[l]=c:c.constructor==Object&&s.constructor==Object?u[l]=r(c,s):u[l]=c}return u}function r(n,e){const c={...n};for(const u in e){const l=n[u],s=e[u];t(l)&&t(s)?c[u]=o(l,s):null==l?c[u]=s:null==s?c[u]=l:l.constructor==Object&&s.constructor==Object?c[u]=r(l,s):c[u]=l}return c}function e(n,e){return t(n)&&t(e)?o(n,e):null==n||null==e?n:n.constructor==Object&&e.constructor==Object?r(n,e):n}return function(...t){if(1==t.length)return o=e,r=n,c=t[0],r==n?((t,n)=>function(o){return t(o,n)})(o,c):((t,n)=>function(o){return t(n,o)})(o,r);var o,r,c;if(2==t.length)return e(...t);throw new TypeError("Invalid number of arguments")}}());
@@ -1,8 +1,9 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
 
8
9
  const isArray = Array.isArray
@@ -1,8 +1,9 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
  const __ = Symbol.for('placeholder')
8
9
 
@@ -1,7 +1,8 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
- const __=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)},thunkify2=(r,n,e)=>function(){return r(n,e)},thunkify5=(r,n,e,t,o,i)=>function(){return r(n,e,t,o,i)},thunkConditional=(r,n,e)=>r?n():e(),isPromise=r=>null!=r&&"function"==typeof r.then,isArray=Array.isArray,SelfReferencingPromise=function(r){const n=r.then(r=>[r,n]);return n},promiseRace=Promise.race.bind(Promise),asyncArraySome=async function(r,n,e,t){const o=r.length;for(;++e<o;){const o=n(r[e]);if(isPromise(o))t.add(SelfReferencingPromise(o));else if(o)return!0}for(;t.size>0;){const[r,n]=await promiseRace(t);if(t.delete(n),r)return!0}return!1},arraySome=function(r,n){const e=r.length;let t=-1;for(;++t<e;){const e=n(r[t]);if(isPromise(e))return asyncArraySome(r,n,t,new Set([SelfReferencingPromise(e)]));if(e)return!0}return!1},arrayPush=function(r,n){return r.push(n),r},funcConcatSync=(r,n)=>function(...e){return n(r(...e))},noop=function(){},symbolIterator=Symbol.iterator,symbolAsyncIterator=Symbol.asyncIterator,differenceWithArrayAsync=async function(r,n,e,t,o){const i=n.length;for(;++o<i;){const i=n[o];let c=arraySome(e,curry2(r,i,__));isPromise(c)&&(c=await c),c||t.push(i)}return t},differenceWithArray=function(r,n,e){const t=n.length,o=[];let i=-1;for(;++i<t;){const t=n[i],c=arraySome(e,curry2(r,t,__));if(isPromise(c))return c.then(funcConcatSync(curry3(thunkConditional,__,noop,thunkify2(arrayPush,o,t)),thunkify5(differenceWithArrayAsync,r,n,e,o,i)));c||o.push(t)}return o},differenceWith=(r,n)=>function(e){if(isArray(e))return differenceWithArray(r,n,e);throw new TypeError(`${e} is not an Array`)};export default differenceWith;
8
+ const __=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)},thunkify2=(r,n,e)=>function(){return r(n,e)},thunkify5=(r,n,e,t,o,i)=>function(){return r(n,e,t,o,i)},thunkConditional=(r,n,e)=>r?n():e(),isPromise=r=>null!=r&&"function"==typeof r.then,isArray=Array.isArray,SelfReferencingPromise=function(r){const n=r.then((r=>[r,n]));return n},promiseRace=Promise.race.bind(Promise),asyncArraySome=async function(r,n,e,t){const o=r.length;for(;++e<o;){const o=n(r[e]);if(isPromise(o))t.add(SelfReferencingPromise(o));else if(o)return!0}for(;t.size>0;){const[r,n]=await promiseRace(t);if(t.delete(n),r)return!0}return!1},arraySome=function(r,n){const e=r.length;let t=-1;for(;++t<e;){const e=n(r[t]);if(isPromise(e))return asyncArraySome(r,n,t,new Set([SelfReferencingPromise(e)]));if(e)return!0}return!1},arrayPush=function(r,n){return r.push(n),r},funcConcatSync=(r,n)=>function(...e){return n(r(...e))},noop=function(){},symbolIterator=Symbol.iterator,symbolAsyncIterator=Symbol.asyncIterator,differenceWithArrayAsync=async function(r,n,e,t,o){const i=n.length;for(;++o<i;){const i=n[o];let c=arraySome(e,curry2(r,i,__));isPromise(c)&&(c=await c),c||t.push(i)}return t},differenceWithArray=function(r,n,e){const t=n.length,o=[];let i=-1;for(;++i<t;){const t=n[i],c=arraySome(e,curry2(r,t,__));if(isPromise(c))return c.then(funcConcatSync(curry3(thunkConditional,__,noop,thunkify2(arrayPush,o,t)),thunkify5(differenceWithArrayAsync,r,n,e,o,i)));c||o.push(t)}return o},differenceWith=(r,n)=>function(e){if(isArray(e))return differenceWithArray(r,n,e);throw new TypeError(`${e} is not an Array`)};export default differenceWith;
@@ -1,8 +1,9 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
 
8
9
  (function (root, differenceWith) {
@@ -1,8 +1,9 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
 
8
- !function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define(()=>t):n.differenceWith=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=Symbol.for("placeholder"),t=function(t,r,e){return r==n?((n,t)=>function(r){return n(r,t)})(t,e):((n,t)=>function(r){return n(t,r)})(t,r)},r=function(t,r,e,o){return r==n?((n,t,r)=>function(e){return n(e,t,r)})(t,e,o):e==n?((n,t,r)=>function(e){return n(t,e,r)})(t,r,o):((n,t,r)=>function(e){return n(t,r,e)})(t,r,e)},e=(n,t,r)=>function(){return n(t,r)},o=(n,t,r,e,o,u)=>function(){return n(t,r,e,o,u)},u=(n,t,r)=>n?t():r(),i=n=>null!=n&&"function"==typeof n.then,f=Array.isArray,c=function(n){const t=n.then(n=>[n,t]);return t},s=Promise.race.bind(Promise),l=async function(n,t,r,e){const o=n.length;for(;++r<o;){const o=t(n[r]);if(i(o))e.add(c(o));else if(o)return!0}for(;e.size>0;){const[n,t]=await s(e);if(e.delete(t),n)return!0}return!1},a=function(n,t){const r=n.length;let e=-1;for(;++e<r;){const r=t(n[e]);if(i(r))return l(n,t,e,new Set([c(r)]));if(r)return!0}return!1},h=function(n,t){return n.push(t),n},y=(n,t)=>function(...r){return t(n(...r))},d=function(){},p=(Symbol.iterator,Symbol.asyncIterator,async function(r,e,o,u,f){const c=e.length;for(;++f<c;){const c=e[f];let s=a(o,t(r,c,n));i(s)&&(s=await s),s||u.push(c)}return u});return(c,s)=>function(l){if(f(l))return function(f,c,s){const l=c.length,b=[];let m=-1;for(;++m<l;){const l=c[m],g=a(s,t(f,l,n));if(i(g))return g.then(y(r(u,n,d,e(h,b,l)),o(p,f,c,s,b,m)));g||b.push(l)}return b}(c,s,l);throw new TypeError(`${l} is not an Array`)}}());
9
+ !function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((()=>t)):n.differenceWith=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=Symbol.for("placeholder"),t=function(t,r,e){return r==n?((n,t)=>function(r){return n(r,t)})(t,e):((n,t)=>function(r){return n(t,r)})(t,r)},r=(n,t,r)=>function(){return n(t,r)},e=(n,t,r,e,o,u)=>function(){return n(t,r,e,o,u)},o=(n,t,r)=>n?t():r(),u=n=>null!=n&&"function"==typeof n.then,i=Array.isArray,f=function(n){const t=n.then((n=>[n,t]));return t},c=Promise.race.bind(Promise),s=async function(n,t,r,e){const o=n.length;for(;++r<o;){const o=t(n[r]);if(u(o))e.add(f(o));else if(o)return!0}for(;e.size>0;){const[n,t]=await c(e);if(e.delete(t),n)return!0}return!1},l=function(n,t){const r=n.length;let e=-1;for(;++e<r;){const r=t(n[e]);if(u(r))return s(n,t,e,new Set([f(r)]));if(r)return!0}return!1},a=function(n,t){return n.push(t),n},h=(n,t)=>function(...r){return t(n(...r))},y=function(){},d=(Symbol.iterator,Symbol.asyncIterator,async function(r,e,o,i,f){const c=e.length;for(;++f<c;){const c=e[f];let s=l(o,t(r,c,n));u(s)&&(s=await s),s||i.push(c)}return i});return(f,c)=>function(s){if(i(s))return function(i,f,c){const s=f.length,p=[];let b=-1;for(;++b<s;){const s=f[b],A=l(c,t(i,s,n));if(u(A))return A.then(h((m=o,g=n,w=y,S=r(a,p,s),g==n?((n,t,r)=>function(e){return n(e,t,r)})(m,w,S):w==n?((n,t,r)=>function(e){return n(t,e,r)})(m,g,S):((n,t,r)=>function(e){return n(t,r,e)})(m,g,w)),e(d,i,f,c,p,b)));A||p.push(s)}var m,g,w,S;return p}(f,c,s);throw new TypeError(`${s} is not an Array`)}}());
@@ -1,8 +1,9 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
  const __ = Symbol.for('placeholder')
8
9
 
@@ -1,8 +1,9 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
  const __ = Symbol.for('placeholder')
8
9
 
@@ -1,7 +1,8 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
  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],s=t(n,o,r);if(isPromise(s))return promiseAll(arrayExtendMap([s],r,t,o)).then(curry4(arrayFilterByConditions,r,e,o-1,__));s&&(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 s=t(i,i,r);isPromise(s)?o.push(s.then(curry3(thunkConditional,__,thunkify1(e,i),noop))):s&&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 s=t(i,o,r);isPromise(s)?e.push(s.then(curry3(thunkConditional,__,thunkify4(callPropBinary,n,"set",o,i),noop))):s&&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],s=t(i,o,r);isPromise(s)?e.push(s.then(curry4(objectSetIf,n,o,r[o],__))):s&&(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)},areAnyValuesPromises=function(r){if(isArray(r)){const t=r.length;let n=-1;for(;++n<t;){const t=r[n];if(isPromise(t))return!0}return!1}for(const t in r){const n=r[t];if(isPromise(n))return!0}return!1},curryArgs2ResolveArgs0=(r,t,n)=>function(...n){return r(n,t)},curryArgs2ResolveArgs1=(r,t,n)=>function(...n){return r(t,n)},curryArgs2=function(r,t,n){return t==__?curryArgs2ResolveArgs0(r,n):curryArgs2ResolveArgs1(r,t)},negate=r=>!r,_not=function(r,t){const n=t(...r);return isPromise(n)?n.then(negate):!n},not=function(...r){const t=r.pop();return"function"==typeof t?0==r.length?curryArgs2(_not,__,t):areAnyValuesPromises(r)?promiseAll(r).then(curry2(_not,__,t)):_not(r,t):isPromise(t)?t.then(negate):!t},filterOut=r=>filter(not(r));export default filterOut;
@@ -1,8 +1,9 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
 
8
9
  (function (root, filterOut) {
@@ -1,8 +1,9 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
 
8
- !function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define(()=>t):n.filterOut=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=Symbol.for("placeholder"),t=function(t,e,r){return e==n?((n,t)=>function(e){return n(e,t)})(t,r):((n,t)=>function(e){return n(t,e)})(t,e)},e=Symbol.iterator,r=(n,t)=>({[e](){return this},next(){let e=n.next();for(;!e.done;){const{value:r}=e;if(t(r))return{value:r,done:!1};e=n.next()}return e}}),o=n=>null!=n&&"function"==typeof n.then,u=Symbol.asyncIterator,c=(n,t)=>({isAsyncIteratorDone:!1,[u](){return this},async next(){for(;!this.isAsyncIteratorDone;){const{value:e,done:r}=await n.next();if(r)this.isAsyncIteratorDone=!0;else{const n=t(e);if(o(n)?await n:n)return{value:e,done:!1}}}return{value:void 0,done:!0}}}),i=Array.isArray,f=function(t,e,r,o,u){return e==n?((n,t,e,r)=>function(o){return n(o,t,e,r)})(t,r,o,u):r==n?((n,t,e,r)=>function(o){return n(t,o,e,r)})(t,e,o,u):o==n?((n,t,e,r)=>function(o){return n(t,e,o,r)})(t,e,r,u):((n,t,e,r)=>function(o){return n(t,e,r,o)})(t,e,r,o)},s=Promise.all.bind(Promise),l=function(n,t,e,r){const o=t.length;let u=n.length-1;for(;++r<o;)n[++u]=e(t[r],r,n);return n},h=function(n,t,e,r){const o=n.length;let u=-1;for(;++e<o;)r[++u]&&t.push(n[e]);return t},a=function(t,e){const r=t.length,u=[];let c=-1,i=-1;for(;++c<r;){const r=t[c],a=e(r,c,t);if(o(a))return s(l([a],t,e,c)).then(f(h,t,u,c-1,n));a&&(u[++i]=r)}return u},p=function(t,e,r,o){return e==n?((n,t,e)=>function(r){return n(r,t,e)})(t,r,o):r==n?((n,t,e)=>function(r){return n(t,r,e)})(t,e,o):((n,t,e)=>function(r){return n(t,e,r)})(t,e,r)},y=(n,t,e)=>n[t](e),d=n=>function(){return n},g=(n,t,e)=>n?t():e(),b=(n,t)=>function(){return n(t)},v=function(){},m=(n,t,e,r,o)=>function(){return n(t,e,r,o)},x=(n,t,e,r)=>n[t](e,r),S=function(n,t,e,r){r&&(n[t]=e)},j=function(t,l){return i(t)?a(t,l):null==t?t:"string"==typeof t||t.constructor==String?function(t,e){const r=a(t,e);return o(r)?r.then(p(y,n,"join","")):r.join("")}(t,l):t.constructor==Set?function(t,e){const r=new Set,u=r.add.bind(r),c=[];for(const i of t){const f=e(i,i,t);o(f)?c.push(f.then(p(g,n,b(u,i),v))):f&&r.add(i)}return 0==c.length?r:s(c).then(d(r))}(t,l):t.constructor==Map?function(t,e){const r=new Map,u=[];for(const[c,i]of t){const f=e(i,c,t);o(f)?u.push(f.then(p(g,n,m(x,r,"set",c,i),v))):f&&r.set(c,i)}return 0==u.length?r:s(u).then(d(r))}(t,l):"function"==typeof t.filter?t.filter(l):"function"==typeof t[e]?r(t[e](),l):"function"==typeof t[u]?c(t[u](),l):t.constructor==Object?function(t,e){const r={},u=[];for(const c in t){const i=t[c],s=e(i,c,t);o(s)?u.push(s.then(f(S,r,c,t[c],n))):s&&(r[c]=i)}return 0==u.length?r:s(u).then(d(r))}(t,l):t},A=n=>!n,w=function(n,t){const e=t(...n);return o(e)?e.then(A):!e},I=function(...e){const r=e.pop();return"function"==typeof r?0==e.length?(u=w,f=r,(c=n)==n?((n,t)=>function(...e){return n(e,t)})(u,f):((n,t)=>function(...e){return n(t,e)})(u,c)):function(n){if(i(n)){const t=n.length;let e=-1;for(;++e<t;){const t=n[e];if(o(t))return!0}return!1}for(const t in n){const e=n[t];if(o(e))return!0}return!1}(e)?s(e).then(t(w,n,r)):w(e,r):o(r)?r.then(A):!r;var u,c,f};return e=>{return"function"==typeof(r=I(e))?t(j,n,r):o(r)?r.then(t(j,n,u)):j(r,u);var r,u}}());
9
+ !function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((()=>t)):n.filterOut=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=Symbol.for("placeholder"),t=function(t,e,r){return e==n?((n,t)=>function(e){return n(e,t)})(t,r):((n,t)=>function(e){return n(t,e)})(t,e)},e=Symbol.iterator,r=(n,t)=>({[e](){return this},next(){let e=n.next();for(;!e.done;){const{value:r}=e;if(t(r))return{value:r,done:!1};e=n.next()}return e}}),o=n=>null!=n&&"function"==typeof n.then,u=Symbol.asyncIterator,c=(n,t)=>({isAsyncIteratorDone:!1,[u](){return this},async next(){for(;!this.isAsyncIteratorDone;){const{value:e,done:r}=await n.next();if(r)this.isAsyncIteratorDone=!0;else{const n=t(e);if(o(n)?await n:n)return{value:e,done:!1}}}return{value:void 0,done:!0}}}),i=Array.isArray,f=function(t,e,r,o,u){return e==n?((n,t,e,r)=>function(o){return n(o,t,e,r)})(t,r,o,u):r==n?((n,t,e,r)=>function(o){return n(t,o,e,r)})(t,e,o,u):o==n?((n,t,e,r)=>function(o){return n(t,e,o,r)})(t,e,r,u):((n,t,e,r)=>function(o){return n(t,e,r,o)})(t,e,r,o)},s=Promise.all.bind(Promise),l=function(n,t,e,r){const o=t.length;let u=n.length-1;for(;++r<o;)n[++u]=e(t[r],r,n);return n},h=function(n,t,e,r){const o=n.length;let u=-1;for(;++e<o;)r[++u]&&t.push(n[e]);return t},a=function(t,e){const r=t.length,u=[];let c=-1,i=-1;for(;++c<r;){const r=t[c],a=e(r,c,t);if(o(a))return s(l([a],t,e,c)).then(f(h,t,u,c-1,n));a&&(u[++i]=r)}return u},p=function(t,e,r,o){return e==n?((n,t,e)=>function(r){return n(r,t,e)})(t,r,o):r==n?((n,t,e)=>function(r){return n(t,r,e)})(t,e,o):((n,t,e)=>function(r){return n(t,e,r)})(t,e,r)},y=(n,t,e)=>n[t](e),d=n=>function(){return n},g=(n,t,e)=>n?t():e(),b=(n,t)=>function(){return n(t)},v=function(){},m=(n,t,e,r,o)=>function(){return n(t,e,r,o)},x=(n,t,e,r)=>n[t](e,r),S=function(n,t,e,r){r&&(n[t]=e)},j=function(t,l){return i(t)?a(t,l):null==t?t:"string"==typeof t||t.constructor==String?function(t,e){const r=a(t,e);return o(r)?r.then(p(y,n,"join","")):r.join("")}(t,l):t.constructor==Set?function(t,e){const r=new Set,u=r.add.bind(r),c=[];for(const i of t){const f=e(i,i,t);o(f)?c.push(f.then(p(g,n,b(u,i),v))):f&&r.add(i)}return 0==c.length?r:s(c).then(d(r))}(t,l):t.constructor==Map?function(t,e){const r=new Map,u=[];for(const[c,i]of t){const f=e(i,c,t);o(f)?u.push(f.then(p(g,n,m(x,r,"set",c,i),v))):f&&r.set(c,i)}return 0==u.length?r:s(u).then(d(r))}(t,l):"function"==typeof t.filter?t.filter(l):"function"==typeof t[e]?r(t[e](),l):"function"==typeof t[u]?c(t[u](),l):t.constructor==Object?function(t,e){const r={},u=[];for(const c in t){const i=t[c],s=e(i,c,t);o(s)?u.push(s.then(f(S,r,c,t[c],n))):s&&(r[c]=i)}return 0==u.length?r:s(u).then(d(r))}(t,l):t},A=n=>!n,w=function(n,t){const e=t(...n);return o(e)?e.then(A):!e},I=function(...e){const r=e.pop();return"function"==typeof r?0==e.length?(u=w,f=r,(c=n)==n?((n,t)=>function(...e){return n(e,t)})(u,f):((n,t)=>function(...e){return n(t,e)})(u,c)):function(n){if(i(n)){const t=n.length;let e=-1;for(;++e<t;){const t=n[e];if(o(t))return!0}return!1}for(const t in n){const e=n[t];if(o(e))return!0}return!1}(e)?s(e).then(t(w,n,r)):w(e,r):o(r)?r.then(A):!r;var u,c,f};return e=>{return"function"==typeof(r=I(e))?t(j,n,r):o(r)?r.then(t(j,n,u)):j(r,u);var r,u}}());
@@ -1,8 +1,9 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
  const __ = Symbol.for('placeholder')
8
9
 
package/dist/x/find.es.js CHANGED
@@ -1,8 +1,9 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
 
8
9
  const isArray = Array.isArray
@@ -1,7 +1,8 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
  const isArray=Array.isArray,symbolIterator=Symbol.iterator,symbolAsyncIterator=Symbol.asyncIterator,objectValues=Object.values,isPromise=r=>null!=r&&"function"==typeof r.then,__=Symbol.for("placeholder"),curry3ResolveArg0=(r,n,t)=>function(o){return r(o,n,t)},curry3ResolveArg1=(r,n,t)=>function(o){return r(n,o,t)},curry3ResolveArg2=(r,n,t)=>function(o){return r(n,t,o)},curry3=function(r,n,t,o){return n==__?curry3ResolveArg0(r,t,o):t==__?curry3ResolveArg1(r,n,o):curry3ResolveArg2(r,n,t)},thunkify3=(r,n,t,o)=>function(){return r(n,t,o)},thunkConditional=(r,n,t)=>r?n():t(),always=r=>function(){return r},arrayFindAsync=async function(r,n,t){const o=r.length;for(;++t<o;){const o=r[t];let e=n(o);if(isPromise(e)&&(e=await e),e)return o}},arrayFind=function(r,n){const t=r.length;let o=-1;for(;++o<t;){const t=r[o],e=n(t);if(isPromise(e))return e.then(curry3(thunkConditional,__,always(t),thunkify3(arrayFindAsync,r,n,o)));if(e)return t}},thunkify2=(r,n,t)=>function(){return r(n,t)},iteratorFindAsync=async function(r,n){let t=r.next();for(;!t.done;){const o=t.value;let e=n(o);if(isPromise(e)&&(e=await e),e)return o;t=r.next()}},iteratorFind=function(r,n){let t=r.next();for(;!t.done;){const o=t.value,e=n(o);if(isPromise(e))return e.then(curry3(thunkConditional,__,always(o),thunkify2(iteratorFindAsync,r,n)));if(e)return o;t=r.next()}},asyncIteratorFind=async function(r,n){let t=await r.next();for(;!t.done;){const o=t.value;let e=n(o);if(isPromise(e)&&(e=await e),e)return o;t=await r.next()}},find=r=>function(n){return isArray(n)?arrayFind(n,r):null!=n?"function"==typeof n[symbolIterator]?iteratorFind(n[symbolIterator](),r):"function"==typeof n[symbolAsyncIterator]?asyncIteratorFind(n[symbolAsyncIterator](),r):"function"==typeof n.find?n.find(r):n.constructor==Object?arrayFind(objectValues(n),r):void 0:void 0};export default find;
package/dist/x/find.js CHANGED
@@ -1,8 +1,9 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
 
8
9
  (function (root, find) {
@@ -1,8 +1,9 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
 
8
- !function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define(()=>t):n.find=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=Array.isArray,t=Symbol.iterator,e=Symbol.asyncIterator,o=Object.values,r=n=>null!=n&&"function"==typeof n.then,u=Symbol.for("placeholder"),f=function(n,t,e,o){return t==u?((n,t,e)=>function(o){return n(o,t,e)})(n,e,o):e==u?((n,t,e)=>function(o){return n(t,o,e)})(n,t,o):((n,t,e)=>function(o){return n(t,e,o)})(n,t,e)},i=(n,t,e,o)=>function(){return n(t,e,o)},c=(n,t,e)=>n?t():e(),l=n=>function(){return n},a=async function(n,t,e){const o=n.length;for(;++e<o;){const o=n[e];let u=t(o);if(r(u)&&(u=await u),u)return o}},s=function(n,t){const e=n.length;let o=-1;for(;++o<e;){const e=n[o],s=t(e);if(r(s))return s.then(f(c,u,l(e),i(a,n,t,o)));if(s)return e}},y=(n,t,e)=>function(){return n(t,e)},d=async function(n,t){let e=n.next();for(;!e.done;){const o=e.value;let u=t(o);if(r(u)&&(u=await u),u)return o;e=n.next()}};return i=>function(a){return n(a)?s(a,i):null!=a?"function"==typeof a[t]?function(n,t){let e=n.next();for(;!e.done;){const o=e.value,i=t(o);if(r(i))return i.then(f(c,u,l(o),y(d,n,t)));if(i)return o;e=n.next()}}(a[t](),i):"function"==typeof a[e]?async function(n,t){let e=await n.next();for(;!e.done;){const o=e.value;let u=t(o);if(r(u)&&(u=await u),u)return o;e=await n.next()}}(a[e](),i):"function"==typeof a.find?a.find(i):a.constructor==Object?s(o(a),i):void 0:void 0}}());
9
+ !function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((()=>t)):n.find=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=Array.isArray,t=Symbol.iterator,e=Symbol.asyncIterator,o=Object.values,r=n=>null!=n&&"function"==typeof n.then,u=Symbol.for("placeholder"),f=function(n,t,e,o){return t==u?((n,t,e)=>function(o){return n(o,t,e)})(n,e,o):e==u?((n,t,e)=>function(o){return n(t,o,e)})(n,t,o):((n,t,e)=>function(o){return n(t,e,o)})(n,t,e)},i=(n,t,e,o)=>function(){return n(t,e,o)},c=(n,t,e)=>n?t():e(),l=n=>function(){return n},a=async function(n,t,e){const o=n.length;for(;++e<o;){const o=n[e];let u=t(o);if(r(u)&&(u=await u),u)return o}},s=function(n,t){const e=n.length;let o=-1;for(;++o<e;){const e=n[o],s=t(e);if(r(s))return s.then(f(c,u,l(e),i(a,n,t,o)));if(s)return e}},y=(n,t,e)=>function(){return n(t,e)},d=async function(n,t){let e=n.next();for(;!e.done;){const o=e.value;let u=t(o);if(r(u)&&(u=await u),u)return o;e=n.next()}};return i=>function(a){return n(a)?s(a,i):null!=a?"function"==typeof a[t]?function(n,t){let e=n.next();for(;!e.done;){const o=e.value,i=t(o);if(r(i))return i.then(f(c,u,l(o),y(d,n,t)));if(i)return o;e=n.next()}}(a[t](),i):"function"==typeof a[e]?async function(n,t){let e=await n.next();for(;!e.done;){const o=e.value;let u=t(o);if(r(u)&&(u=await u),u)return o;e=await n.next()}}(a[e](),i):"function"==typeof a.find?a.find(i):a.constructor==Object?s(o(a),i):void 0:void 0}}());
package/dist/x/find.mjs CHANGED
@@ -1,8 +1,9 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
 
8
9
  const isArray = Array.isArray
@@ -1,8 +1,9 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
 
8
9
  const isArray = Array.isArray
@@ -1,7 +1,8 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
  const isArray=Array.isArray,isPromise=r=>null!=r&&"function"==typeof r.then,thunkConditional=(r,n,e)=>r?n():e(),__=Symbol.for("placeholder"),always=r=>function(){return r},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)},thunkify3=(r,n,e,t)=>function(){return r(n,e,t)},findIndexAsync=async function(r,n,e){const t=n.length;for(;++e<t;){let t=r(n[e]);if(isPromise(t)&&(t=await t),t)return e}return-1},findIndex=r=>function(n){const e=n.length;let t=-1;for(;++t<e;){const e=r(n[t]);if(isPromise(e))return e.then(curry3(thunkConditional,__,always(t),thunkify3(findIndexAsync,r,n,t)));if(e)return t}return-1};export default findIndex;
@@ -1,8 +1,9 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
 
8
9
  (function (root, findIndex) {
@@ -1,8 +1,9 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
 
8
- !function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define(()=>t):n.findIndex=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";Array.isArray;const n=n=>null!=n&&"function"==typeof n.then,t=(n,t,e)=>n?t():e(),e=Symbol.for("placeholder"),r=n=>function(){return n},o=function(n,t,r,o){return t==e?((n,t,e)=>function(r){return n(r,t,e)})(n,r,o):r==e?((n,t,e)=>function(r){return n(t,r,e)})(n,t,o):((n,t,e)=>function(r){return n(t,e,r)})(n,t,r)},u=(n,t,e,r)=>function(){return n(t,e,r)},f=async function(t,e,r){const o=e.length;for(;++r<o;){let o=t(e[r]);if(n(o)&&(o=await o),o)return r}return-1};return i=>function(c){const l=c.length;let s=-1;for(;++s<l;){const l=i(c[s]);if(n(l))return l.then(o(t,e,r(s),u(f,i,c,s)));if(l)return s}return-1}}());
9
+ !function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((()=>t)):n.findIndex=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";Array.isArray;const n=n=>null!=n&&"function"==typeof n.then,t=(n,t,e)=>n?t():e(),e=Symbol.for("placeholder"),r=n=>function(){return n},o=(n,t,e,r)=>function(){return n(t,e,r)},u=async function(t,e,r){const o=e.length;for(;++r<o;){let o=t(e[r]);if(n(o)&&(o=await o),o)return r}return-1};return f=>function(i){const c=i.length;let l=-1;for(;++l<c;){const c=f(i[l]);if(n(c))return c.then((s=t,a=e,h=r(l),y=o(u,f,i,l),a==e?((n,t,e)=>function(r){return n(r,t,e)})(s,h,y):h==e?((n,t,e)=>function(r){return n(t,r,e)})(s,a,y):((n,t,e)=>function(r){return n(t,e,r)})(s,a,h)));if(c)return l}var s,a,h,y;return-1}}());
@@ -1,8 +1,9 @@
1
1
  /**
2
- * rubico v2.8.1
3
- * https://github.com/a-synchronous/rubico
4
- * (c) 2019-2026 Richard Tong
5
- * rubico may be freely distributed under the MIT license.
2
+ * Rubico v2.8.3
3
+ * https://rubico.land/
4
+ *
5
+ * © Richard Yufei Tong, King of Software
6
+ * Rubico may be freely distributed under the CFOSS license.
6
7
  */
7
8
 
8
9
  const isArray = Array.isArray